[{"project":[{"_id":"2649B4DE-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"771402","name":"Epidemics in ant societies on a chip"},{"name":"Host-Parasite Coevolution","grant_number":"CR-118/3-1","_id":"25DAF0B2-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Stock, Miriam, et al. “Pathogen Evasion of Social Immunity.” Nature Ecology and Evolution, vol. 7, Springer Nature, 2023, pp. 450–60, doi:10.1038/s41559-023-01981-6.","ieee":"M. Stock et al., “Pathogen evasion of social immunity,” Nature Ecology and Evolution, vol. 7. Springer Nature, pp. 450–460, 2023.","short":"M. Stock, B. Milutinovic, M. Hönigsberger, A.V. Grasse, F. Wiesenhofer, N. Kampleitner, M. Narasimhan, T. Schmitt, S. Cremer, Nature Ecology and Evolution 7 (2023) 450–460.","ama":"Stock M, Milutinovic B, Hönigsberger M, et al. Pathogen evasion of social immunity. Nature Ecology and Evolution. 2023;7:450-460. doi:10.1038/s41559-023-01981-6","apa":"Stock, M., Milutinovic, B., Hönigsberger, M., Grasse, A. V., Wiesenhofer, F., Kampleitner, N., … Cremer, S. (2023). Pathogen evasion of social immunity. Nature Ecology and Evolution. Springer Nature. https://doi.org/10.1038/s41559-023-01981-6","chicago":"Stock, Miriam, Barbara Milutinovic, Michaela Hönigsberger, Anna V Grasse, Florian Wiesenhofer, Niklas Kampleitner, Madhumitha Narasimhan, Thomas Schmitt, and Sylvia Cremer. “Pathogen Evasion of Social Immunity.” Nature Ecology and Evolution. Springer Nature, 2023. https://doi.org/10.1038/s41559-023-01981-6.","ista":"Stock M, Milutinovic B, Hönigsberger M, Grasse AV, Wiesenhofer F, Kampleitner N, Narasimhan M, Schmitt T, Cremer S. 2023. Pathogen evasion of social immunity. Nature Ecology and Evolution. 7, 450–460."},"title":"Pathogen evasion of social immunity","article_processing_charge":"No","external_id":{"isi":["000924572800001"],"pmid":["36732670"]},"author":[{"first_name":"Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87","last_name":"Stock","full_name":"Stock, Miriam"},{"last_name":"Milutinovic","orcid":"0000-0002-8214-4758","full_name":"Milutinovic, Barbara","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","first_name":"Barbara"},{"first_name":"Michaela","id":"953894f3-25bd-11ec-8556-f70a9d38ef60","full_name":"Hönigsberger, Michaela","last_name":"Hönigsberger"},{"id":"406F989C-F248-11E8-B48F-1D18A9856A87","first_name":"Anna V","last_name":"Grasse","full_name":"Grasse, Anna V"},{"first_name":"Florian","id":"39523C54-F248-11E8-B48F-1D18A9856A87","full_name":"Wiesenhofer, Florian","last_name":"Wiesenhofer"},{"full_name":"Kampleitner, Niklas","last_name":"Kampleitner","id":"2AC57FAC-F248-11E8-B48F-1D18A9856A87","first_name":"Niklas"},{"full_name":"Narasimhan, Madhumitha","orcid":"0000-0002-8600-0671","last_name":"Narasimhan","first_name":"Madhumitha","id":"44BF24D0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schmitt, Thomas","last_name":"Schmitt","first_name":"Thomas"},{"full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"We thank B. M. Steinwender, N. V. Meyling and J. Eilenberg for the fungal strains; J. Anaya-Rojas for statistical advice; the Social Immunity team at ISTA for ant collection and experimental help, in particular H. Leitner, and the ISTA Lab Support Facility for general laboratory support; D. Ebert, H. Schulenburg and J. Heinze for continued project discussion; and M. Sixt, R. Roemhild and the Social Immunity team for comments on the manuscript. The study was funded by the German Research Foundation (CR118/3-1) within the Framework of the Priority Program SPP 1399, and the European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme (No. 771402; EPIDEMICSonCHIP), both to S.C.","oa":1,"quality_controlled":"1","publisher":"Springer Nature","publication":"Nature Ecology and Evolution","day":"01","year":"2023","has_accepted_license":"1","isi":1,"date_created":"2023-02-12T23:00:59Z","date_published":"2023-03-01T00:00:00Z","doi":"10.1038/s41559-023-01981-6","page":"450-460","_id":"12543","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","ddc":["570"],"date_updated":"2023-08-16T11:55:48Z","file_date_updated":"2023-08-16T11:54:59Z","department":[{"_id":"SyCr"},{"_id":"LifeSc"},{"_id":"JiFr"}],"pmid":1,"oa_version":"Published Version","abstract":[{"text":"Treating sick group members is a hallmark of collective disease defence in vertebrates and invertebrates alike. Despite substantial effects on pathogen fitness and epidemiology, it is still largely unknown how pathogens react to the selection pressure imposed by care intervention. Using social insects and pathogenic fungi, we here performed a serial passage experiment in the presence or absence of colony members, which provide social immunity by grooming off infectious spores from exposed individuals. We found specific effects on pathogen diversity, virulence and transmission. Under selection of social immunity, pathogens invested into higher spore production, but spores were less virulent. Notably, they also elicited a lower grooming response in colony members, compared with spores from the individual host selection lines. Chemical spore analysis suggested that the spores from social selection lines escaped the caregivers’ detection by containing lower levels of ergosterol, a key fungal membrane component. Experimental application of chemically pure ergosterol indeed induced sanitary grooming, supporting its role as a microbe-associated cue triggering host social immunity against fungal pathogens. By reducing this detection cue, pathogens were able to evade the otherwise very effective collective disease defences of their social hosts.","lang":"eng"}],"acknowledged_ssus":[{"_id":"LifeSc"}],"intvolume":" 7","month":"03","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"8244f4650a0e7aeea488d1bcd4a31702","file_id":"14069","success":1,"date_updated":"2023-08-16T11:54:59Z","file_size":1600499,"creator":"dernst","date_created":"2023-08-16T11:54:59Z","file_name":"2023_NatureEcoEvo_Stock.pdf"}],"publication_status":"published","publication_identifier":{"eissn":["2397-334X"]},"license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"volume":7,"related_material":{"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/how-sneaky-germs-hide-from-ants/","description":"News on ISTA website"}]}},{"scopus_import":"1","month":"02","intvolume":" 7","abstract":[{"text":"Differentiated X chromosomes are expected to have higher rates of adaptive divergence than autosomes, if new beneficial mutations are recessive (the “faster-X effect”), largely because these mutations are immediately exposed to selection in males. The evolution of X chromosomes after they stop recombining in males, but before they become hemizygous, has not been well explored theoretically. We use the diffusion approximation to infer substitution rates of beneficial and deleterious mutations under such a scenario. Our results show that selection is less efficient on diploid X loci than on autosomal and hemizygous X loci under a wide range of parameters. This “slower-X” effect is stronger for genes affecting primarily (or only) male fitness, and for sexually antagonistic genes. These unusual dynamics suggest that some of the peculiar features of X chromosomes, such as the differential accumulation of genes with sex-specific functions, may start arising earlier than previously appreciated.","lang":"eng"}],"oa_version":"Published Version","pmid":1,"volume":7,"issue":"1","ec_funded":1,"publication_identifier":{"issn":["2056-3744"]},"publication_status":"published","file":[{"creator":"dernst","file_size":2592189,"date_updated":"2023-08-16T11:43:33Z","file_name":"2023_EvLetters_Mrnjavac.pdf","date_created":"2023-08-16T11:43:33Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"a240a041cb9b9b7c8ba93a4706674a3f","file_id":"14068"}],"language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"_id":"12521","department":[{"_id":"GradSch"},{"_id":"BeVi"}],"file_date_updated":"2023-08-16T11:43:33Z","date_updated":"2023-08-16T11:44:32Z","ddc":["570"],"quality_controlled":"1","publisher":"Oxford University Press","oa":1,"acknowledgement":"We thank the Vicoso and Barton groups and ISTA Scientific Computing Unit. We also thank two anonymous reviewers for their valuable comments. This work was supported by the European Research Council under the European Union’s Horizon 2020 research and innovation program (grant agreements no. 715257 and no. 716117).","doi":"10.1093/evlett/qrac004","date_published":"2023-02-01T00:00:00Z","date_created":"2023-02-06T13:59:12Z","has_accepted_license":"1","isi":1,"year":"2023","day":"01","publication":"Evolution Letters","project":[{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"},{"_id":"250BDE62-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715257","name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution"}],"article_number":"qrac004","author":[{"id":"353FAC84-AE61-11E9-8BFC-00D3E5697425","first_name":"Andrea","full_name":"Mrnjavac, Andrea","last_name":"Mrnjavac"},{"id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","first_name":"Kseniia","full_name":"Khudiakova, Kseniia","orcid":"0000-0002-6246-1465","last_name":"Khudiakova"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz","last_name":"Vicoso"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["001021692200001"],"pmid":["37065438"]},"title":"Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution","citation":{"mla":"Mrnjavac, Andrea, et al. “Slower-X: Reduced Efficiency of Selection in the Early Stages of X Chromosome Evolution.” Evolution Letters, vol. 7, no. 1, qrac004, Oxford University Press, 2023, doi:10.1093/evlett/qrac004.","ieee":"A. Mrnjavac, K. Khudiakova, N. H. Barton, and B. Vicoso, “Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution,” Evolution Letters, vol. 7, no. 1. Oxford University Press, 2023.","short":"A. Mrnjavac, K. Khudiakova, N.H. Barton, B. Vicoso, Evolution Letters 7 (2023).","ama":"Mrnjavac A, Khudiakova K, Barton NH, Vicoso B. Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution. Evolution Letters. 2023;7(1). doi:10.1093/evlett/qrac004","apa":"Mrnjavac, A., Khudiakova, K., Barton, N. H., & Vicoso, B. (2023). Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution. Evolution Letters. Oxford University Press. https://doi.org/10.1093/evlett/qrac004","chicago":"Mrnjavac, Andrea, Kseniia Khudiakova, Nicholas H Barton, and Beatriz Vicoso. “Slower-X: Reduced Efficiency of Selection in the Early Stages of X Chromosome Evolution.” Evolution Letters. Oxford University Press, 2023. https://doi.org/10.1093/evlett/qrac004.","ista":"Mrnjavac A, Khudiakova K, Barton NH, Vicoso B. 2023. Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution. Evolution Letters. 7(1), qrac004."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"acknowledgement":"I wish to thank all current and past members of the Hippenmeyer laboratory at ISTA for exciting discussions on the subject of this review. I apologize to colleagues whose work I could not cite and/or discuss in the frame of the available space. Work in the Hippenmeyer laboratory on the\r\ndiscussed topic is supported by ISTA institutional funds, FWF SFB F78 to S.H., and the European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme (grant agree-ment no. 725780 LinPro) to SH.","oa":1,"quality_controlled":"1","publisher":"Elsevier","publication":"Current Opinion in Neurobiology","day":"01","year":"2023","isi":1,"has_accepted_license":"1","date_created":"2023-02-26T12:24:21Z","doi":"10.1016/j.conb.2023.102695","date_published":"2023-04-01T00:00:00Z","article_number":"102695","project":[{"grant_number":"F07805","name":"Molecular Mechanisms of Neural Stem Cell Lineage Progression","_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"H2020","_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Hippenmeyer, S. (2023). Principles of neural stem cell lineage progression: Insights from developing cerebral cortex. Current Opinion in Neurobiology. Elsevier. https://doi.org/10.1016/j.conb.2023.102695","ama":"Hippenmeyer S. Principles of neural stem cell lineage progression: Insights from developing cerebral cortex. Current Opinion in Neurobiology. 2023;79(4). doi:10.1016/j.conb.2023.102695","ieee":"S. Hippenmeyer, “Principles of neural stem cell lineage progression: Insights from developing cerebral cortex,” Current Opinion in Neurobiology, vol. 79, no. 4. Elsevier, 2023.","short":"S. Hippenmeyer, Current Opinion in Neurobiology 79 (2023).","mla":"Hippenmeyer, Simon. “Principles of Neural Stem Cell Lineage Progression: Insights from Developing Cerebral Cortex.” Current Opinion in Neurobiology, vol. 79, no. 4, 102695, Elsevier, 2023, doi:10.1016/j.conb.2023.102695.","ista":"Hippenmeyer S. 2023. Principles of neural stem cell lineage progression: Insights from developing cerebral cortex. Current Opinion in Neurobiology. 79(4), 102695.","chicago":"Hippenmeyer, Simon. “Principles of Neural Stem Cell Lineage Progression: Insights from Developing Cerebral Cortex.” Current Opinion in Neurobiology. Elsevier, 2023. https://doi.org/10.1016/j.conb.2023.102695."},"title":"Principles of neural stem cell lineage progression: Insights from developing cerebral cortex","article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000953497700001"],"pmid":["36842274"]},"author":[{"orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","text":"How to generate a brain of correct size and with appropriate cell-type diversity during development is a major question in Neuroscience. In the developing neocortex, radial glial progenitor (RGP) cells are the main neural stem cells that produce cortical excitatory projection neurons, glial cells, and establish the prospective postnatal stem cell niche in the lateral ventricles. RGPs follow a tightly orchestrated developmental program that when disrupted can result in severe cortical malformations such as microcephaly and megalencephaly. The precise cellular and molecular mechanisms instructing faithful RGP lineage progression are however not well understood. This review will summarize recent conceptual advances that contribute to our understanding of the general principles of RGP lineage progression."}],"intvolume":" 79","month":"04","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"date_created":"2023-08-16T12:29:06Z","file_name":"2023_CurrentOpinionNeurobio_Hippenmeyer.pdf","date_updated":"2023-08-16T12:29:06Z","file_size":1787894,"creator":"dernst","file_id":"14071","checksum":"4d11c4ca87e6cbc4d2ac46d3225ea615","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"issn":["0959-4388"]},"ec_funded":1,"issue":"4","volume":79,"_id":"12679","keyword":["General Neuroscience"],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"review","type":"journal_article","ddc":["570"],"date_updated":"2023-08-16T12:30:25Z","file_date_updated":"2023-08-16T12:29:06Z","department":[{"_id":"SiHi"}]},{"author":[{"id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72","first_name":"Antonio","last_name":"Agresti","full_name":"Agresti, Antonio","orcid":"0000-0002-9573-2962"},{"full_name":"Lindemulder, Nick","last_name":"Lindemulder","first_name":"Nick"},{"first_name":"Mark","last_name":"Veraar","full_name":"Veraar, Mark"}],"external_id":{"arxiv":["2104.05063"],"isi":["000914134900001"]},"article_processing_charge":"No","title":"On the trace embedding and its applications to evolution equations","citation":{"ista":"Agresti A, Lindemulder N, Veraar M. 2023. On the trace embedding and its applications to evolution equations. Mathematische Nachrichten. 296(4), 1319–1350.","chicago":"Agresti, Antonio, Nick Lindemulder, and Mark Veraar. “On the Trace Embedding and Its Applications to Evolution Equations.” Mathematische Nachrichten. Wiley, 2023. https://doi.org/10.1002/mana.202100192.","ieee":"A. Agresti, N. Lindemulder, and M. Veraar, “On the trace embedding and its applications to evolution equations,” Mathematische Nachrichten, vol. 296, no. 4. Wiley, pp. 1319–1350, 2023.","short":"A. Agresti, N. Lindemulder, M. Veraar, Mathematische Nachrichten 296 (2023) 1319–1350.","apa":"Agresti, A., Lindemulder, N., & Veraar, M. (2023). On the trace embedding and its applications to evolution equations. Mathematische Nachrichten. Wiley. https://doi.org/10.1002/mana.202100192","ama":"Agresti A, Lindemulder N, Veraar M. On the trace embedding and its applications to evolution equations. Mathematische Nachrichten. 2023;296(4):1319-1350. doi:10.1002/mana.202100192","mla":"Agresti, Antonio, et al. “On the Trace Embedding and Its Applications to Evolution Equations.” Mathematische Nachrichten, vol. 296, no. 4, Wiley, 2023, pp. 1319–50, doi:10.1002/mana.202100192."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Wiley","quality_controlled":"1","oa":1,"acknowledgement":"The first author has been partially supported by the Nachwuchsring—Network for the promotion of young scientists—at TU Kaiserslautern. The second and third authors were supported by the Vidi subsidy 639.032.427 of the Netherlands Organisation for Scientific Research (NWO).","page":"1319-1350","date_published":"2023-04-01T00:00:00Z","doi":"10.1002/mana.202100192","date_created":"2023-01-29T23:00:59Z","has_accepted_license":"1","isi":1,"year":"2023","day":"01","publication":"Mathematische Nachrichten","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"status":"public","_id":"12429","department":[{"_id":"JuFi"}],"file_date_updated":"2023-08-16T11:40:02Z","date_updated":"2023-08-16T11:41:42Z","ddc":["510"],"scopus_import":"1","month":"04","intvolume":" 296","abstract":[{"lang":"eng","text":"In this paper, we consider traces at initial times for functions with mixed time-space smoothness. Such results are often needed in the theory of evolution equations. Our result extends and unifies many previous results. Our main improvement is that we can allow general interpolation couples. The abstract results are applied to regularity problems for fractional evolution equations and stochastic evolution equations, where uniform trace estimates on the half-line are shown."}],"oa_version":"Published Version","issue":"4","volume":296,"license":"https://creativecommons.org/licenses/by-nc/4.0/","publication_identifier":{"eissn":["1522-2616"],"issn":["0025-584X"]},"publication_status":"published","file":[{"file_name":"2023_MathNachrichten_Agresti.pdf","date_created":"2023-08-16T11:40:02Z","creator":"dernst","file_size":449280,"date_updated":"2023-08-16T11:40:02Z","success":1,"file_id":"14067","checksum":"6f099f1d064173784d1a27716a2cc795","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}]},{"status":"public","article_type":"original","type":"journal_article","_id":"12430","department":[{"_id":"RoSe"}],"date_updated":"2023-08-16T11:47:27Z","month":"01","intvolume":" 35","scopus_import":"1","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2110.00458"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We study the time evolution of the Nelson model in a mean-field limit in which N nonrelativistic bosons weakly couple (with respect to the particle number) to a positive or zero mass quantized scalar field. Our main result is the derivation of the Bogoliubov dynamics and higher-order corrections. More precisely, we prove the convergence of the approximate wave function to the many-body wave function in norm, with a convergence rate proportional to the number of corrections taken into account in the approximation. We prove an analogous result for the unitary propagator. As an application, we derive a simple system of partial differential equations describing the time evolution of the first- and second-order approximations to the one-particle reduced density matrices of the particles and the quantum field, respectively."}],"issue":"4","volume":35,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0129-055X"]},"publication_status":"published","article_number":"2350006","title":"Bogoliubov dynamics and higher-order corrections for the regularized Nelson model","author":[{"full_name":"Falconi, Marco","last_name":"Falconi","first_name":"Marco"},{"last_name":"Leopold","full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822","first_name":"Nikolai K","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87"},{"id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","first_name":"David Johannes","full_name":"Mitrouskas, David Johannes","last_name":"Mitrouskas"},{"last_name":"Petrat","orcid":"0000-0002-9166-5889","full_name":"Petrat, Sören P","id":"40AC02DC-F248-11E8-B48F-1D18A9856A87","first_name":"Sören P"}],"article_processing_charge":"No","external_id":{"isi":["000909760300001"],"arxiv":["2110.00458"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Falconi, Marco, et al. “Bogoliubov Dynamics and Higher-Order Corrections for the Regularized Nelson Model.” Reviews in Mathematical Physics, vol. 35, no. 4, 2350006, World Scientific Publishing, 2023, doi:10.1142/S0129055X2350006X.","ama":"Falconi M, Leopold NK, Mitrouskas DJ, Petrat SP. Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. 2023;35(4). doi:10.1142/S0129055X2350006X","apa":"Falconi, M., Leopold, N. K., Mitrouskas, D. J., & Petrat, S. P. (2023). Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/S0129055X2350006X","ieee":"M. Falconi, N. K. Leopold, D. J. Mitrouskas, and S. P. Petrat, “Bogoliubov dynamics and higher-order corrections for the regularized Nelson model,” Reviews in Mathematical Physics, vol. 35, no. 4. World Scientific Publishing, 2023.","short":"M. Falconi, N.K. Leopold, D.J. Mitrouskas, S.P. Petrat, Reviews in Mathematical Physics 35 (2023).","chicago":"Falconi, Marco, Nikolai K Leopold, David Johannes Mitrouskas, and Sören P Petrat. “Bogoliubov Dynamics and Higher-Order Corrections for the Regularized Nelson Model.” Reviews in Mathematical Physics. World Scientific Publishing, 2023. https://doi.org/10.1142/S0129055X2350006X.","ista":"Falconi M, Leopold NK, Mitrouskas DJ, Petrat SP. 2023. Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. 35(4), 2350006."},"quality_controlled":"1","publisher":"World Scientific Publishing","oa":1,"date_published":"2023-01-09T00:00:00Z","doi":"10.1142/S0129055X2350006X","date_created":"2023-01-29T23:00:59Z","day":"09","publication":"Reviews in Mathematical Physics","isi":1,"year":"2023"},{"date_created":"2023-03-26T22:01:08Z","doi":"10.1038/s43588-023-00410-9","date_published":"2023-03-20T00:00:00Z","page":"254-263","publication":"Nature Computational Science","day":"20","year":"2023","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"This research was funded in whole, or in part, by the Austrian Science Fund (FWF) (grant no. PT1013M03318 to F.L. and no. P34015 to G.T.). For the purpose of open access, the author has applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. The study was supported by the European Union Horizon 2020 research and innovation program under the Marie Sklodowska-Curie action (grant agreement No. 754411 to F.L.).","title":"Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain","article_processing_charge":"No","external_id":{"arxiv":["2108.06686"]},"author":[{"first_name":"Fabrizio","id":"A057D288-3E88-11E9-986D-0CF4E5697425","last_name":"Lombardi","full_name":"Lombardi, Fabrizio","orcid":"0000-0003-2623-5249"},{"id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","first_name":"Selver","last_name":"Pepic","full_name":"Pepic, Selver"},{"first_name":"Oren","full_name":"Shriki, Oren","last_name":"Shriki"},{"orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper","last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper"},{"orcid":"0000-0002-5214-4706","full_name":"De Martino, Daniele","last_name":"De Martino","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","first_name":"Daniele"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. 2023. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. 3, 254–263.","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” Nature Computational Science. Springer Nature, 2023. https://doi.org/10.1038/s43588-023-00410-9.","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. 2023;3:254-263. doi:10.1038/s43588-023-00410-9","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., & De Martino, D. (2023). Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. Springer Nature. https://doi.org/10.1038/s43588-023-00410-9","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain,” Nature Computational Science, vol. 3. Springer Nature, pp. 254–263, 2023.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, Nature Computational Science 3 (2023) 254–263.","mla":"Lombardi, Fabrizio, et al. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” Nature Computational Science, vol. 3, Springer Nature, 2023, pp. 254–63, doi:10.1038/s43588-023-00410-9."},"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"eb943429-77a9-11ec-83b8-9f471cdf5c67","name":"Functional Advantages of Critical Brain Dynamics","grant_number":"M03318"},{"grant_number":"P34015","name":"Efficient coding with biophysical realism","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"}],"ec_funded":1,"volume":3,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"14073","checksum":"7c63b2b2edfd68aaffe96d70ca6a865a","file_size":4474284,"date_updated":"2023-08-16T12:39:57Z","creator":"dernst","file_name":"2023_NatureCompScience_Lombardi.pdf","date_created":"2023-08-16T12:39:57Z"}],"publication_status":"published","publication_identifier":{"eissn":["2662-8457"]},"intvolume":" 3","month":"03","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Neurons in the brain are wired into adaptive networks that exhibit collective dynamics as diverse as scale-specific oscillations and scale-free neuronal avalanches. Although existing models account for oscillations and avalanches separately, they typically do not explain both phenomena, are too complex to analyze analytically or intractable to infer from data rigorously. Here we propose a feedback-driven Ising-like class of neural networks that captures avalanches and oscillations simultaneously and quantitatively. In the simplest yet fully microscopic model version, we can analytically compute the phase diagram and 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 oscillations to collective behaviors of extreme events and neuronal avalanches. Importantly, the inferred parameters indicate that the co-existence of scale-specific (oscillations) and scale-free (avalanches) dynamics occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.","lang":"eng"}],"department":[{"_id":"GaTk"},{"_id":"GradSch"}],"file_date_updated":"2023-08-16T12:39:57Z","ddc":["570"],"date_updated":"2023-08-16T12:41:53Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"12762"},{"project":[{"grant_number":"742573","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","_id":"260F1432-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"26B1E39C-B435-11E9-9278-68D0E5697425","name":"Mesendoderm specification in zebrafish: The role of extraembryonic tissues","grant_number":"25239"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Schauer, A. (2023). Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12891","ama":"Schauer A. Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues. 2023. doi:10.15479/at:ista:12891","ieee":"A. Schauer, “Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues,” Institute of Science and Technology Austria, 2023.","short":"A. Schauer, Mesendoderm Formation in Zebrafish Gastrulation: The Role of Extraembryonic Tissues, Institute of Science and Technology Austria, 2023.","mla":"Schauer, Alexandra. Mesendoderm Formation in Zebrafish Gastrulation: The Role of Extraembryonic Tissues. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12891.","ista":"Schauer A. 2023. Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues. Institute of Science and Technology Austria.","chicago":"Schauer, Alexandra. “Mesendoderm Formation in Zebrafish Gastrulation: The Role of Extraembryonic Tissues.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12891."},"title":"Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues","author":[{"last_name":"Schauer","orcid":"0000-0001-7659-9142","full_name":"Schauer, Alexandra","id":"30A536BA-F248-11E8-B48F-1D18A9856A87","first_name":"Alexandra"}],"article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","day":"05","has_accepted_license":"1","year":"2023","date_published":"2023-05-05T00:00:00Z","doi":"10.15479/at:ista:12891","date_created":"2023-05-05T08:48:20Z","page":"190","_id":"12891","status":"public","type":"dissertation","ddc":["570"],"supervisor":[{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"date_updated":"2023-08-21T06:25:48Z","file_date_updated":"2023-05-05T13:04:15Z","department":[{"_id":"GradSch"},{"_id":"CaHe"}],"oa_version":"Published Version","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"abstract":[{"text":"The tight spatiotemporal coordination of signaling activity determining embryo\r\npatterning and the physical processes driving embryo morphogenesis renders\r\nembryonic development robust, such that key developmental processes can unfold\r\nrelatively normally even outside of the full embryonic context. For instance, embryonic\r\nstem cell cultures can recapitulate the hallmarks of gastrulation, i.e. break symmetry\r\nleading to germ layer formation and morphogenesis, in a very reduced environment.\r\nThis leads to questions on specific contributions of embryo-specific features, such as\r\nthe presence of extraembryonic tissues, which are inherently involved in gastrulation\r\nin the full embryonic context. To address this, we established zebrafish embryonic\r\nexplants without the extraembryonic yolk cell, an important player as a signaling\r\nsource and for morphogenesis during gastrulation, as a model of ex vivo development.\r\nWe found that dorsal-marginal determinants are required and sufficient in these\r\nexplants to form and pattern all three germ layers. However, formation of tissues,\r\nwhich require the highest Nodal-signaling levels, is variable, demonstrating a\r\ncontribution of extraembryonic tissues for reaching peak Nodal signaling levels.\r\nBlastoderm explants also undergo gastrulation-like axis elongation. We found that this\r\nelongation movement shows hallmarks of oriented mesendoderm cell intercalations\r\ntypically associated with dorsal tissues in the intact embryo. These are disrupted by\r\nuniform upregulation of BMP signaling activity and concomitant explant ventralization,\r\nsuggesting that tight spatial control of BMP signaling is a prerequisite for explant\r\nmorphogenesis. This control is achieved by Nodal signaling, which is critical for\r\neffectively downregulating BMP signaling in the mesendoderm, highlighting that Nodal\r\nsignaling is not only directly required for mesendoderm cell fate specification and\r\nmorphogenesis, but also by maintaining low levels of BMP signaling at the dorsal side.\r\nCollectively, we provide insights into the capacity and organization of signaling and\r\nmorphogenetic domains to recapitulate features of zebrafish gastrulation outside of\r\nthe full embryonic context.","lang":"eng"}],"month":"05","alternative_title":["ISTA Thesis"],"file":[{"file_name":"Thesis_Schauer_final.pdf","date_created":"2023-05-05T13:01:14Z","file_size":31434230,"date_updated":"2023-05-05T13:01:14Z","creator":"aschauer","embargo":"2024-05-05","file_id":"12907","checksum":"59b0303dc483f40a96a610a90aab7ee9","embargo_to":"open_access","content_type":"application/pdf","relation":"main_file","access_level":"closed"},{"file_name":"Thesis_Schauer_final.docx","date_created":"2023-05-05T13:04:15Z","file_size":43809109,"date_updated":"2023-05-05T13:04:15Z","creator":"aschauer","file_id":"12908","checksum":"25f54e12479b6adaabd129a20568e6c1","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","access_level":"closed"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663 - 337X"]},"degree_awarded":"PhD","publication_status":"published","related_material":{"record":[{"status":"public","id":"8966","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"7888","status":"public"}]},"ec_funded":1},{"date_updated":"2023-08-21T07:00:49Z","ddc":["000"],"file_date_updated":"2023-08-21T06:59:05Z","department":[{"_id":"MoHe"}],"_id":"14085","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2023-07-14","location":"Paderborn, Germany","start_date":"2023-07-10"},"status":"public","publication_identifier":{"isbn":["9783959772785"],"issn":["1868-8969"]},"publication_status":"published","file":[{"checksum":"074177e815a1656de5d4071c7a3dffa6","file_id":"14089","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-08-21T06:59:05Z","file_name":"2023_LIPIcsICALP_Goranci.pdf","creator":"dernst","date_updated":"2023-08-21T06:59:05Z","file_size":875910}],"language":[{"iso":"eng"}],"volume":261,"ec_funded":1,"abstract":[{"text":"We show an (1+ϵ)-approximation algorithm for maintaining maximum s-t flow under m edge insertions in m1/2+o(1)ϵ−1/2 amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LIPIcs"],"month":"07","intvolume":" 261","citation":{"ista":"Goranci G, Henzinger MH. 2023. Efficient data structures for incremental exact and approximate maximum flow. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 69.","chicago":"Goranci, Gramoz, and Monika H Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.69.","ieee":"G. Goranci and M. H. Henzinger, “Efficient data structures for incremental exact and approximate maximum flow,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","short":"G. Goranci, M.H. Henzinger, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","apa":"Goranci, G., & Henzinger, M. H. (2023). Efficient data structures for incremental exact and approximate maximum flow. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.69","ama":"Goranci G, Henzinger MH. Efficient data structures for incremental exact and approximate maximum flow. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.69","mla":"Goranci, Gramoz, and Monika H. Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.69."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Gramoz","full_name":"Goranci, Gramoz","last_name":"Goranci"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"article_processing_charge":"Yes","external_id":{"unknown":["2211.09606"]},"title":"Efficient data structures for incremental exact and approximate maximum flow","article_number":"69","project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775 ","name":"Fast Algorithms for a Reactive Network Layer"}],"has_accepted_license":"1","year":"2023","day":"01","publication":"50th International Colloquium on Automata, Languages, and Programming","date_published":"2023-07-01T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2023.69","date_created":"2023-08-20T22:01:14Z","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.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the\r\nAustrian Science Fund (FWF) project “Static and Dynamic Hierarchical Graph Decompositions”,\r\nI 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nThis work was done in part while Gramoz Goranci was at Institute for Theoretical Studies, ETH Zurich, Switzerland. There, he was supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation. We also thank Richard Peng, Thatchaphol Saranurak, Sebastian Forster and Sushant Sachdeva for helpful discussions, and the anonymous reviewers for their insightful comments.","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1},{"acknowledgement":"We thank Heng Guo for helpful explanations of algorithms for sampling connected subgraphs and matchings, Maksym Serbyn for bringing to our attention the Wang-Landau algorithm and its use in physics.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2023","day":"01","publication":"50th International Colloquium on Automata, Languages, and Programming","date_published":"2023-07-01T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2023.72","date_created":"2023-08-20T22:01:14Z","article_number":"72","citation":{"chicago":"Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.72.","ista":"Harris DG, Kolmogorov V. 2023. Parameter estimation for Gibbs distributions. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 72.","mla":"Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.72.","short":"D.G. Harris, V. Kolmogorov, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"D. G. Harris and V. Kolmogorov, “Parameter estimation for Gibbs distributions,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","ama":"Harris DG, Kolmogorov V. Parameter estimation for Gibbs distributions. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.72","apa":"Harris, D. G., & Kolmogorov, V. (2023). Parameter estimation for Gibbs distributions. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.72"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"David G.","last_name":"Harris","full_name":"Harris, David G."},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"article_processing_charge":"Yes","external_id":{"arxiv":["2007.10824"]},"title":"Parameter estimation for Gibbs distributions","abstract":[{"lang":"eng","text":"A central problem in computational statistics is to convert a procedure for sampling combinatorial objects into a procedure for counting those objects, and vice versa. We will consider sampling problems which come from Gibbs distributions, which are families of probability distributions over a discrete space Ω with probability mass function of the form μ^Ω_β(ω) ∝ e^{β H(ω)} for β in an interval [β_min, β_max] and H(ω) ∈ {0} ∪ [1, n].\r\nThe partition function is the normalization factor Z(β) = ∑_{ω ∈ Ω} e^{β H(ω)}, and the log partition ratio is defined as q = (log Z(β_max))/Z(β_min)\r\nWe develop a number of algorithms to estimate the counts c_x using roughly Õ(q/ε²) samples for general Gibbs distributions and Õ(n²/ε²) samples for integer-valued distributions (ignoring some second-order terms and parameters), We show this is optimal up to logarithmic factors. We illustrate with improved algorithms for counting connected subgraphs and perfect matchings in a graph."}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LIPIcs"],"month":"07","intvolume":" 261","publication_identifier":{"isbn":["9783959772785"],"issn":["1868-8969"]},"publication_status":"published","file":[{"checksum":"6dee0684245bb1c524b9c955db1e933d","file_id":"14088","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-08-21T06:45:16Z","file_name":"2023_LIPIcsICALP_Harris.pdf","creator":"dernst","date_updated":"2023-08-21T06:45:16Z","file_size":917791}],"language":[{"iso":"eng"}],"volume":261,"_id":"14084","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Paderborn, Germany","end_date":"2023-07-14","start_date":"2023-07-10"},"status":"public","date_updated":"2023-08-21T06:49:11Z","ddc":["000","510"],"department":[{"_id":"VlKo"}],"file_date_updated":"2023-08-21T06:45:16Z"},{"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":" Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant\r\nagreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Jan Vondrák: Supported by NSF Award 2127781.","date_created":"2023-08-20T22:01:14Z","doi":"10.4230/LIPIcs.ICALP.2023.74","date_published":"2023-07-01T00:00:00Z","publication":"50th International Colloquium on Automata, Languages, and Programming","day":"01","year":"2023","has_accepted_license":"1","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775 ","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"article_number":"74","title":"Faster submodular maximization for several classes of matroids","article_processing_charge":"Yes","external_id":{"arxiv":["2305.00122"]},"author":[{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Liu, Paul","last_name":"Liu","first_name":"Paul"},{"first_name":"Jan","last_name":"Vondrák","full_name":"Vondrák, Jan"},{"first_name":"Da Wei","full_name":"Zheng, Da Wei","last_name":"Zheng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Henzinger, Monika H, Paul Liu, Jan Vondrák, and Da Wei Zheng. “Faster Submodular Maximization for Several Classes of Matroids.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.74.","ista":"Henzinger MH, Liu P, Vondrák J, Zheng DW. 2023. Faster submodular maximization for several classes of matroids. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 74.","mla":"Henzinger, Monika H., et al. “Faster Submodular Maximization for Several Classes of Matroids.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.74.","short":"M.H. Henzinger, P. Liu, J. Vondrák, D.W. Zheng, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"M. H. Henzinger, P. Liu, J. Vondrák, and D. W. Zheng, “Faster submodular maximization for several classes of matroids,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","ama":"Henzinger MH, Liu P, Vondrák J, Zheng DW. Faster submodular maximization for several classes of matroids. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.74","apa":"Henzinger, M. H., Liu, P., Vondrák, J., & Zheng, D. W. (2023). Faster submodular maximization for several classes of matroids. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.74"},"intvolume":" 261","month":"07","alternative_title":["LIPIcs"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint has been investigated extensively due to its algorithmic properties and expressive power. Though tight approximation algorithms for general matroid constraints exist in theory, the running times of such algorithms typically scale quadratically, and are not practical for truly large scale settings. Recent progress has focused on fast algorithms for important classes of matroids given in explicit form. Currently, nearly-linear time algorithms only exist for graphic and partition matroids [Alina Ene and Huy L. Nguyen, 2019]. In this work, we develop algorithms for monotone submodular maximization constrained by graphic, transversal matroids, or laminar matroids in time near-linear in the size of their representation. Our algorithms achieve an optimal approximation of 1-1/e-ε and both generalize and accelerate the results of Ene and Nguyen [Alina Ene and Huy L. Nguyen, 2019]. In fact, the running time of our algorithm cannot be improved within the fast continuous greedy framework of Badanidiyuru and Vondrák [Ashwinkumar Badanidiyuru and Jan Vondrák, 2014].\r\nTo achieve near-linear running time, we make use of dynamic data structures that maintain bases with approximate maximum cardinality and weight under certain element updates. These data structures need to support a weight decrease operation and a novel Freeze operation that allows the algorithm to freeze elements (i.e. force to be contained) in its basis regardless of future data structure operations. For the laminar matroid, we present a new dynamic data structure using the top tree interface of Alstrup, Holm, de Lichtenberg, and Thorup [Stephen Alstrup et al., 2005] that maintains the maximum weight basis under insertions and deletions of elements in O(log n) time. This data structure needs to support certain subtree query and path update operations that are performed every insertion and deletion that are non-trivial to handle in conjunction. For the transversal matroid the Freeze operation corresponds to requiring the data structure to keep a certain set S of vertices matched, a property that we call S-stability. While there is a large body of work on dynamic matching algorithms, none are S-stable and maintain an approximate maximum weight matching under vertex updates. We give the first such algorithm for bipartite graphs with total running time linear (up to log factors) in the number of edges.","lang":"eng"}],"ec_funded":1,"volume":261,"language":[{"iso":"eng"}],"file":[{"file_id":"14090","checksum":"a5eef225014e003efbfbe4830fdd23cb","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-08-21T07:04:36Z","file_name":"2023_LIPIcsICALP_HenzingerM.pdf","creator":"dernst","date_updated":"2023-08-21T07:04:36Z","file_size":930943}],"publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959772785"]},"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"end_date":"2023-07-14","location":"Paderborn, Germany","start_date":"2023-07-10","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"type":"conference","_id":"14086","department":[{"_id":"MoHe"}],"file_date_updated":"2023-08-21T07:04:36Z","ddc":["000"],"date_updated":"2023-08-21T07:05:47Z"},{"title":"Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery","external_id":{"arxiv":["2210.07754"]},"article_processing_charge":"Yes","author":[{"first_name":"Nicolas","full_name":"Resch, Nicolas","last_name":"Resch"},{"first_name":"Chen","last_name":"Yuan","full_name":"Yuan, Chen"},{"id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","first_name":"Yihan","last_name":"Zhang","full_name":"Zhang, Yihan","orcid":"0000-0002-6465-6258"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Resch, Nicolas, et al. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.99.","apa":"Resch, N., Yuan, C., & Zhang, Y. (2023). Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.99","ama":"Resch N, Yuan C, Zhang Y. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.99","ieee":"N. Resch, C. Yuan, and Y. Zhang, “Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","short":"N. Resch, C. Yuan, Y. Zhang, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","chicago":"Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.99.","ista":"Resch N, Yuan C, Zhang Y. 2023. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 99."},"article_number":"99","date_created":"2023-08-20T22:01:13Z","date_published":"2023-07-01T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2023.99","publication":"50th International Colloquium on Automata, Languages, and Programming","day":"01","year":"2023","has_accepted_license":"1","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":"Nicolas Resch: Research supported in part by ERC H2020 grant No.74079 (ALGSTRONGCRYPTO). Chen Yuan: Research supported in part by the National Key Research and Development Projects under Grant 2022YFA1004900 and Grant 2021YFE0109900, the National Natural Science Foundation of China under Grant 12101403 and Grant 12031011.\r\nAcknowledgements YZ is grateful to Shashank Vatedka, Diyuan Wu and Fengxing Zhu for inspiring discussions.","department":[{"_id":"MaMo"}],"file_date_updated":"2023-08-21T07:23:18Z","ddc":["000"],"date_updated":"2023-08-21T07:26:01Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2023-07-10","end_date":"2023-07-14","location":"Paderborn, Germany"},"type":"conference","_id":"14083","volume":261,"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"14091","checksum":"a449143fec3fbebb092cb8ef3b53c226","success":1,"creator":"dernst","date_updated":"2023-08-21T07:23:18Z","file_size":1141497,"date_created":"2023-08-21T07:23:18Z","file_name":"2023_LIPIcsICALP_Resch.pdf"}],"publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772785"]},"intvolume":" 261","month":"07","alternative_title":["LIPIcs"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"In this work we consider the list-decodability and list-recoverability of arbitrary q-ary codes, for all integer values of q ≥ 2. A code is called (p,L)_q-list-decodable if every radius pn Hamming ball contains less than L codewords; (p,𝓁,L)_q-list-recoverability is a generalization where we place radius pn Hamming balls on every point of a combinatorial rectangle with side length 𝓁 and again stipulate that there be less than L codewords.\r\nOur main contribution is to precisely calculate the maximum value of p for which there exist infinite families of positive rate (p,𝓁,L)_q-list-recoverable codes, the quantity we call the zero-rate threshold. Denoting this value by p_*, we in fact show that codes correcting a p_*+ε fraction of errors must have size O_ε(1), i.e., independent of n. Such a result is typically referred to as a \"Plotkin bound.\" To complement this, a standard random code with expurgation construction shows that there exist positive rate codes correcting a p_*-ε fraction of errors. We also follow a classical proof template (typically attributed to Elias and Bassalygo) to derive from the zero-rate threshold other tradeoffs between rate and decoding radius for list-decoding and list-recovery.\r\nTechnically, proving the Plotkin bound boils down to demonstrating the Schur convexity of a certain function defined on the q-simplex as well as the convexity of a univariate function derived from it. We remark that an earlier argument claimed similar results for q-ary list-decoding; however, we point out that this earlier proof is flawed.","lang":"eng"}]},{"type":"journal_article","article_type":"original","status":"public","keyword":["General Chemistry","Catalysis"],"_id":"12922","date_updated":"2023-08-21T09:18:12Z","extern":"1","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/anie.202211663"}],"month":"01","intvolume":" 62","abstract":[{"lang":"eng","text":"The influence of structural modifications on the catalytic activity of carbon materials is poorly understood. A collection of carbonaceous materials with different pore networks and high nitrogen content was characterized and used to catalyze four reactions to deduce structure–activity relationships. The CO2 cycloaddition and Knoevenagel reaction depend on Lewis basic sites (electron-rich nitrogen species). The absence of large conjugated carbon domains resulting from the introduction of large amounts of nitrogen in the carbon network is responsible for poor redox activity, as observed through the catalytic reduction of nitrobenzene with hydrazine and the catalytic oxidation of 3,3′,5,5′-tetramethylbenzidine using hydroperoxide. The material with the highest activity towards Lewis acid catalysis (in the hydrolysis of (dimethoxymethyl)benzene to benzaldehyde) is the most effective for small molecule activation and presents the highest concentration of electron-poor nitrogen species."}],"oa_version":"Published Version","issue":"2","volume":62,"publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"publication_status":"published","language":[{"iso":"eng"}],"article_number":"e202211663","author":[{"first_name":"Enrico","last_name":"Lepre","full_name":"Lepre, Enrico"},{"first_name":"Sylvain","full_name":"Rat, Sylvain","last_name":"Rat"},{"first_name":"Cristian","full_name":"Cavedon, Cristian","last_name":"Cavedon"},{"first_name":"Peter H.","last_name":"Seeberger","full_name":"Seeberger, Peter H."},{"orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus"},{"full_name":"Antonietti, Markus","last_name":"Antonietti","first_name":"Markus"},{"last_name":"López‐Salas","full_name":"López‐Salas, Nieves","first_name":"Nieves"}],"article_processing_charge":"No","title":"Catalytic properties of high nitrogen content carbonaceous materials","citation":{"mla":"Lepre, Enrico, et al. “Catalytic Properties of High Nitrogen Content Carbonaceous Materials.” Angewandte Chemie International Edition, vol. 62, no. 2, e202211663, Wiley, 2023, doi:10.1002/anie.202211663.","apa":"Lepre, E., Rat, S., Cavedon, C., Seeberger, P. H., Pieber, B., Antonietti, M., & López‐Salas, N. (2023). Catalytic properties of high nitrogen content carbonaceous materials. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.202211663","ama":"Lepre E, Rat S, Cavedon C, et al. Catalytic properties of high nitrogen content carbonaceous materials. Angewandte Chemie International Edition. 2023;62(2). doi:10.1002/anie.202211663","ieee":"E. Lepre et al., “Catalytic properties of high nitrogen content carbonaceous materials,” Angewandte Chemie International Edition, vol. 62, no. 2. Wiley, 2023.","short":"E. Lepre, S. Rat, C. Cavedon, P.H. Seeberger, B. Pieber, M. Antonietti, N. López‐Salas, Angewandte Chemie International Edition 62 (2023).","chicago":"Lepre, Enrico, Sylvain Rat, Cristian Cavedon, Peter H. Seeberger, Bartholomäus Pieber, Markus Antonietti, and Nieves López‐Salas. “Catalytic Properties of High Nitrogen Content Carbonaceous Materials.” Angewandte Chemie International Edition. Wiley, 2023. https://doi.org/10.1002/anie.202211663.","ista":"Lepre E, Rat S, Cavedon C, Seeberger PH, Pieber B, Antonietti M, López‐Salas N. 2023. Catalytic properties of high nitrogen content carbonaceous materials. Angewandte Chemie International Edition. 62(2), e202211663."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Wiley","quality_controlled":"1","oa":1,"doi":"10.1002/anie.202211663","date_published":"2023-01-09T00:00:00Z","date_created":"2023-05-08T08:28:14Z","year":"2023","day":"09","publication":"Angewandte Chemie International Edition"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"O‘Grady, Anna J. G., Maria R. Drout, B. M. Gaensler, C. S. Kochanek, Kathryn F. Neugent, Carolyn L. Doherty, Joshua S. Speagle, et al. “Cool, Luminous, and Highly Variable Stars in the Magellanic Clouds. II. Spectroscopic and Environmental Analysis of Thorne–Żytkow Object and Super-AGB Star Candidates.” The Astrophysical Journal. American Astronomical Society, 2023. https://doi.org/10.3847/1538-4357/aca655.","ista":"O‘Grady AJG, Drout MR, Gaensler BM, Kochanek CS, Neugent KF, Doherty CL, Speagle JS, Shappee BJ, Rauch M, Götberg YLL, Ludwig B, Thompson TA. 2023. Cool, luminous, and highly variable stars in the Magellanic Clouds. II. Spectroscopic and environmental analysis of Thorne–Żytkow object and super-AGB star candidates. The Astrophysical Journal. 943(1), 18.","mla":"O‘Grady, Anna J. G., et al. “Cool, Luminous, and Highly Variable Stars in the Magellanic Clouds. II. Spectroscopic and Environmental Analysis of Thorne–Żytkow Object and Super-AGB Star Candidates.” The Astrophysical Journal, vol. 943, no. 1, 18, American Astronomical Society, 2023, doi:10.3847/1538-4357/aca655.","short":"A.J.G. O‘Grady, M.R. Drout, B.M. Gaensler, C.S. Kochanek, K.F. Neugent, C.L. Doherty, J.S. Speagle, B.J. Shappee, M. Rauch, Y.L.L. Götberg, B. Ludwig, T.A. Thompson, The Astrophysical Journal 943 (2023).","ieee":"A. J. G. O‘Grady et al., “Cool, luminous, and highly variable stars in the Magellanic Clouds. II. Spectroscopic and environmental analysis of Thorne–Żytkow object and super-AGB star candidates,” The Astrophysical Journal, vol. 943, no. 1. American Astronomical Society, 2023.","ama":"O‘Grady AJG, Drout MR, Gaensler BM, et al. Cool, luminous, and highly variable stars in the Magellanic Clouds. II. Spectroscopic and environmental analysis of Thorne–Żytkow object and super-AGB star candidates. The Astrophysical Journal. 2023;943(1). doi:10.3847/1538-4357/aca655","apa":"O‘Grady, A. J. G., Drout, M. R., Gaensler, B. M., Kochanek, C. S., Neugent, K. F., Doherty, C. L., … Thompson, T. A. (2023). Cool, luminous, and highly variable stars in the Magellanic Clouds. II. Spectroscopic and environmental analysis of Thorne–Żytkow object and super-AGB star candidates. The Astrophysical Journal. American Astronomical Society. https://doi.org/10.3847/1538-4357/aca655"},"title":"Cool, luminous, and highly variable stars in the Magellanic Clouds. II. Spectroscopic and environmental analysis of Thorne–Żytkow object and super-AGB star candidates","author":[{"full_name":"O‘Grady, Anna J. G.","last_name":"O‘Grady","first_name":"Anna J. G."},{"first_name":"Maria R.","full_name":"Drout, Maria R.","last_name":"Drout"},{"first_name":"B. M.","last_name":"Gaensler","full_name":"Gaensler, B. M."},{"first_name":"C. S.","full_name":"Kochanek, C. S.","last_name":"Kochanek"},{"full_name":"Neugent, Kathryn F.","last_name":"Neugent","first_name":"Kathryn F."},{"full_name":"Doherty, Carolyn L.","last_name":"Doherty","first_name":"Carolyn L."},{"full_name":"Speagle, Joshua S.","last_name":"Speagle","first_name":"Joshua S."},{"first_name":"B. J.","last_name":"Shappee","full_name":"Shappee, B. J."},{"first_name":"Michael","full_name":"Rauch, Michael","last_name":"Rauch"},{"first_name":"Ylva Louise Linsdotter","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","full_name":"Götberg, Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911","last_name":"Götberg"},{"first_name":"Bethany","full_name":"Ludwig, Bethany","last_name":"Ludwig"},{"first_name":"Todd A.","full_name":"Thompson, Todd A.","last_name":"Thompson"}],"external_id":{"arxiv":["2211.12438"]},"article_processing_charge":"No","article_number":"18","day":"20","publication":"The Astrophysical Journal","year":"2023","date_published":"2023-01-20T00:00:00Z","doi":"10.3847/1538-4357/aca655","date_created":"2023-08-03T10:10:12Z","publisher":"American Astronomical Society","quality_controlled":"1","oa":1,"extern":"1","date_updated":"2023-08-21T12:07:05Z","_id":"13450","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"publication_status":"published","volume":943,"issue":"1","oa_version":"Published Version","abstract":[{"text":"In previous work, we identified a population of 38 cool and luminous variable stars in the Magellanic Clouds and examined 11 in detail in order to classify them as either Thorne–Żytkow objects (TŻOs; red supergiants with a neutron star cores) or super-asymptotic giant branch (sAGB) stars (the most massive stars that will not undergo core collapse). This population includes HV 2112, a peculiar star previously considered in other works to be either a TŻO or high-mass asymptotic giant branch (AGB) star. Here we continue this investigation, using the kinematic and radio environments and local star formation history of these stars to place constraints on the age of the progenitor systems and the presence of past supernovae. These stars are not associated with regions of recent star formation, and we find no evidence of past supernovae at their locations. Finally, we also assess the presence of heavy elements and lithium in their spectra compared to red supergiants. We find strong absorption in Li and s-process elements compared to RSGs in most of the sample, consistent with sAGB nucleosynthesis, while HV 2112 shows additional strong lines associated with TŻO nucleosynthesis. Coupled with our previous mass estimates, the results are consistent with the stars being massive (∼4–6.5 M⊙) or sAGB (∼6.5–12 M⊙) stars in the thermally pulsing phase, providing crucial observations of the transition between low- and high-mass stellar populations. HV 2112 is more ambiguous; it could either be a maximally massive sAGB star, or a TŻO if the minimum mass for stability extends down to ≲13 M⊙.","lang":"eng"}],"month":"01","intvolume":" 943","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.3847/1538-4357/aca655","open_access":"1"}]},{"_id":"13449","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"type":"journal_article","article_type":"original","extern":"1","date_updated":"2023-08-21T12:09:14Z","oa_version":"Published Version","abstract":[{"text":"Stars strongly impact their environment, and shape structures on all scales throughout the universe, in a process known as \"feedback.\" Due to the complexity of both stellar evolution and the physics of larger astrophysical structures, there remain many unanswered questions about how feedback operates and what we can learn about stars by studying their imprint on the wider universe. In this white paper, we summarize discussions from the Lorentz Center meeting \"Bringing Stellar Evolution and Feedback Together\" in 2022 April and identify key areas where further dialog can bring about radical changes in how we view the relationship between stars and the universe they live in.","lang":"eng"}],"month":"03","intvolume":" 135","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1088/1538-3873/acb6b5"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0004-6280"],"eissn":["1538-3873"]},"publication_status":"published","issue":"1044","volume":135,"article_number":"021001","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Geen, Sam, Poojan Agrawal, Paul A. Crowther, B. W. Keller, Alex de Koter, Zsolt Keszthelyi, Freeke van de Voort, et al. “Bringing Stellar Evolution and Feedback Together: Summary of Proposals from the Lorentz Center Workshop.” Publications of the Astronomical Society of the Pacific. IOP Publishing, 2023. https://doi.org/10.1088/1538-3873/acb6b5.","ista":"Geen S, Agrawal P, Crowther PA, Keller BW, de Koter A, Keszthelyi Z, van de Voort F, Ali AA, Backs F, Bonne L, Brugaletta V, Derkink A, Ekström S, Fichtner YA, Grassitelli L, Götberg YLL, Higgins ER, Laplace E, You Liow K, Lorenzo M, McLeod AF, Meynet G, Newsome M, André Oliva G, Ramachandran V, Rey MP, Rieder S, Romano-Díaz E, Sabhahit G, Sander AAC, Sarwar R, Stinshoff H, Stoop M, Szécsi D, Trebitsch M, Vink JS, Winch E. 2023. Bringing stellar evolution and feedback together: Summary of proposals from the Lorentz Center workshop. Publications of the Astronomical Society of the Pacific. 135(1044), 021001.","mla":"Geen, Sam, et al. “Bringing Stellar Evolution and Feedback Together: Summary of Proposals from the Lorentz Center Workshop.” Publications of the Astronomical Society of the Pacific, vol. 135, no. 1044, 021001, IOP Publishing, 2023, doi:10.1088/1538-3873/acb6b5.","apa":"Geen, S., Agrawal, P., Crowther, P. A., Keller, B. W., de Koter, A., Keszthelyi, Z., … Winch, E. (2023). Bringing stellar evolution and feedback together: Summary of proposals from the Lorentz Center workshop. Publications of the Astronomical Society of the Pacific. IOP Publishing. https://doi.org/10.1088/1538-3873/acb6b5","ama":"Geen S, Agrawal P, Crowther PA, et al. Bringing stellar evolution and feedback together: Summary of proposals from the Lorentz Center workshop. Publications of the Astronomical Society of the Pacific. 2023;135(1044). doi:10.1088/1538-3873/acb6b5","ieee":"S. Geen et al., “Bringing stellar evolution and feedback together: Summary of proposals from the Lorentz Center workshop,” Publications of the Astronomical Society of the Pacific, vol. 135, no. 1044. IOP Publishing, 2023.","short":"S. Geen, P. Agrawal, P.A. Crowther, B.W. Keller, A. de Koter, Z. Keszthelyi, F. van de Voort, A.A. Ali, F. Backs, L. Bonne, V. Brugaletta, A. Derkink, S. Ekström, Y.A. Fichtner, L. Grassitelli, Y.L.L. Götberg, E.R. Higgins, E. Laplace, K. You Liow, M. Lorenzo, A.F. McLeod, G. Meynet, M. Newsome, G. André Oliva, V. Ramachandran, M.P. Rey, S. Rieder, E. Romano-Díaz, G. Sabhahit, A.A.C. Sander, R. Sarwar, H. Stinshoff, M. Stoop, D. Szécsi, M. Trebitsch, J.S. Vink, E. Winch, Publications of the Astronomical Society of the Pacific 135 (2023)."},"title":"Bringing stellar evolution and feedback together: Summary of proposals from the Lorentz Center workshop","author":[{"full_name":"Geen, Sam","last_name":"Geen","first_name":"Sam"},{"full_name":"Agrawal, Poojan","last_name":"Agrawal","first_name":"Poojan"},{"last_name":"Crowther","full_name":"Crowther, Paul A.","first_name":"Paul A."},{"last_name":"Keller","full_name":"Keller, B. W.","first_name":"B. W."},{"first_name":"Alex","full_name":"de Koter, Alex","last_name":"de Koter"},{"full_name":"Keszthelyi, Zsolt","last_name":"Keszthelyi","first_name":"Zsolt"},{"last_name":"van de Voort","full_name":"van de Voort, Freeke","first_name":"Freeke"},{"full_name":"Ali, Ahmad A.","last_name":"Ali","first_name":"Ahmad A."},{"full_name":"Backs, Frank","last_name":"Backs","first_name":"Frank"},{"full_name":"Bonne, Lars","last_name":"Bonne","first_name":"Lars"},{"last_name":"Brugaletta","full_name":"Brugaletta, Vittoria","first_name":"Vittoria"},{"first_name":"Annelotte","last_name":"Derkink","full_name":"Derkink, Annelotte"},{"full_name":"Ekström, Sylvia","last_name":"Ekström","first_name":"Sylvia"},{"last_name":"Fichtner","full_name":"Fichtner, Yvonne A.","first_name":"Yvonne A."},{"full_name":"Grassitelli, Luca","last_name":"Grassitelli","first_name":"Luca"},{"id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","first_name":"Ylva Louise Linsdotter","last_name":"Götberg","full_name":"Götberg, Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911"},{"full_name":"Higgins, Erin R.","last_name":"Higgins","first_name":"Erin R."},{"full_name":"Laplace, Eva","last_name":"Laplace","first_name":"Eva"},{"first_name":"Kong","last_name":"You Liow","full_name":"You Liow, Kong"},{"last_name":"Lorenzo","full_name":"Lorenzo, Marta","first_name":"Marta"},{"first_name":"Anna F.","full_name":"McLeod, Anna F.","last_name":"McLeod"},{"first_name":"Georges","full_name":"Meynet, Georges","last_name":"Meynet"},{"first_name":"Megan","last_name":"Newsome","full_name":"Newsome, Megan"},{"last_name":"André Oliva","full_name":"André Oliva, G.","first_name":"G."},{"full_name":"Ramachandran, Varsha","last_name":"Ramachandran","first_name":"Varsha"},{"last_name":"Rey","full_name":"Rey, Martin P.","first_name":"Martin P."},{"full_name":"Rieder, Steven","last_name":"Rieder","first_name":"Steven"},{"full_name":"Romano-Díaz, Emilio","last_name":"Romano-Díaz","first_name":"Emilio"},{"first_name":"Gautham","last_name":"Sabhahit","full_name":"Sabhahit, Gautham"},{"full_name":"Sander, Andreas A. C.","last_name":"Sander","first_name":"Andreas A. C."},{"first_name":"Rafia","last_name":"Sarwar","full_name":"Sarwar, Rafia"},{"first_name":"Hanno","last_name":"Stinshoff","full_name":"Stinshoff, Hanno"},{"first_name":"Mitchel","full_name":"Stoop, Mitchel","last_name":"Stoop"},{"first_name":"Dorottya","last_name":"Szécsi","full_name":"Szécsi, Dorottya"},{"first_name":"Maxime","last_name":"Trebitsch","full_name":"Trebitsch, Maxime"},{"last_name":"Vink","full_name":"Vink, Jorick S.","first_name":"Jorick S."},{"first_name":"Ethan","last_name":"Winch","full_name":"Winch, Ethan"}],"external_id":{"arxiv":["2301.13611"]},"article_processing_charge":"No","publisher":"IOP Publishing","quality_controlled":"1","oa":1,"day":"09","publication":"Publications of the Astronomical Society of the Pacific","year":"2023","doi":"10.1088/1538-3873/acb6b5","date_published":"2023-03-09T00:00:00Z","date_created":"2023-08-03T10:09:57Z"},{"page":"1692-1709","date_created":"2023-08-21T10:13:56Z","doi":"10.1093/mnras/stad1977","date_published":"2023-09-01T00:00:00Z","year":"2023","publication":"Monthly Notices of the Royal Astronomical Society","day":"01","oa":1,"publisher":"Oxford University Press","quality_controlled":"1","article_processing_charge":"No","external_id":{"arxiv":["2305.07337"]},"author":[{"first_name":"R","full_name":"Farmer, R","last_name":"Farmer"},{"first_name":"M","full_name":"Renzo, M","last_name":"Renzo"},{"first_name":"Ylva Louise Linsdotter","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","last_name":"Götberg","full_name":"Götberg, Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911"},{"full_name":"Bellinger, E","last_name":"Bellinger","first_name":"E"},{"first_name":"S","last_name":"Justham","full_name":"Justham, S"},{"first_name":"S E","full_name":"de Mink, S E","last_name":"de Mink"}],"title":"Observational predictions for Thorne–Żytkow objects","citation":{"ieee":"R. Farmer, M. Renzo, Y. L. L. Götberg, E. Bellinger, S. Justham, and S. E. de Mink, “Observational predictions for Thorne–Żytkow objects,” Monthly Notices of the Royal Astronomical Society, vol. 524, no. 2. Oxford University Press, pp. 1692–1709, 2023.","short":"R. Farmer, M. Renzo, Y.L.L. Götberg, E. Bellinger, S. Justham, S.E. de Mink, Monthly Notices of the Royal Astronomical Society 524 (2023) 1692–1709.","ama":"Farmer R, Renzo M, Götberg YLL, Bellinger E, Justham S, de Mink SE. Observational predictions for Thorne–Żytkow objects. Monthly Notices of the Royal Astronomical Society. 2023;524(2):1692-1709. doi:10.1093/mnras/stad1977","apa":"Farmer, R., Renzo, M., Götberg, Y. L. L., Bellinger, E., Justham, S., & de Mink, S. E. (2023). Observational predictions for Thorne–Żytkow objects. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stad1977","mla":"Farmer, R., et al. “Observational Predictions for Thorne–Żytkow Objects.” Monthly Notices of the Royal Astronomical Society, vol. 524, no. 2, Oxford University Press, 2023, pp. 1692–709, doi:10.1093/mnras/stad1977.","ista":"Farmer R, Renzo M, Götberg YLL, Bellinger E, Justham S, de Mink SE. 2023. Observational predictions for Thorne–Żytkow objects. Monthly Notices of the Royal Astronomical Society. 524(2), 1692–1709.","chicago":"Farmer, R, M Renzo, Ylva Louise Linsdotter Götberg, E Bellinger, S Justham, and S E de Mink. “Observational Predictions for Thorne–Żytkow Objects.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2023. https://doi.org/10.1093/mnras/stad1977."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"2","volume":524,"publication_status":"published","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2305.07337","open_access":"1"}],"scopus_import":"1","intvolume":" 524","month":"09","abstract":[{"lang":"eng","text":"Thorne–Żytkow objects (TŻO) are potential end products of the merger of a neutron star with a non-degenerate star. In this work, we have computed the first grid of evolutionary models of TŻOs with the MESA stellar evolution code. With these models, we predict several observational properties of TŻOs, including their surface temperatures and luminosities, pulsation periods, and nucleosynthetic products. We expand the range of possible TŻO solutions to cover 3.45≲log(Teff/K)≲3.65 and 4.85≲log(L/L⊙)≲5.5. Due to the much higher densities our TŻOs reach compared to previous models, if TŻOs form we expect them to be stable over a larger mass range than previously predicted, without exhibiting a gap in their mass distribution. Using the GYRE stellar pulsation code we show that TŻOs should have fundamental pulsation periods of 1000–2000 d, and period ratios of ≈0.2–0.3. Models computed with a large 399 isotope fully coupled nuclear network show a nucleosynthetic signal that is different to previously predicted. We propose a new nucleosynthetic signal to determine a star’s status as a TŻO: the isotopologues 44TiO2 and 44TiO, which will have a shift in their spectral features as compared to stable titanium-containing molecules. We find that in the local Universe (∼SMC metallicities and above) TŻOs show little heavy metal enrichment, potentially explaining the difficulty in finding TŻOs to-date."}],"oa_version":"Preprint","date_updated":"2023-08-21T12:12:48Z","extern":"1","type":"journal_article","article_type":"original","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"status":"public","_id":"14104"},{"status":"public","keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry","Multidisciplinary"],"type":"journal_article","article_type":"original","_id":"13989","extern":"1","date_updated":"2023-08-22T06:50:04Z","month":"06","intvolume":" 14","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1038/s41467-023-38540-3","open_access":"1"}],"pmid":1,"oa_version":"Published Version","abstract":[{"text":"Characterizing and controlling entanglement in quantum materials is crucial for the development of next-generation quantum technologies. However, defining a quantifiable figure of merit for entanglement in macroscopic solids is theoretically and experimentally challenging. At equilibrium the presence of entanglement can be diagnosed by extracting entanglement witnesses from spectroscopic observables and a nonequilibrium extension of this method could lead to the discovery of novel dynamical phenomena. Here, we propose a systematic approach to quantify the time-dependent quantum Fisher information and entanglement depth of transient states of quantum materials with time-resolved resonant inelastic x-ray scattering. Using a quarter-filled extended Hubbard model as an example, we benchmark the efficiency of this approach and predict a light-enhanced many-body entanglement due to the proximity to a phase boundary. Our work sets the stage for experimentally witnessing and controlling entanglement in light-driven quantum materials via ultrafast spectroscopic measurements.","lang":"eng"}],"volume":14,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2041-1723"]},"publication_status":"published","article_number":"3512","title":"Witnessing light-driven entanglement using time-resolved resonant inelastic X-ray scattering","author":[{"first_name":"Jordyn","last_name":"Hales","full_name":"Hales, Jordyn"},{"last_name":"Bajpai","full_name":"Bajpai, Utkarsh","first_name":"Utkarsh"},{"first_name":"Tongtong","full_name":"Liu, Tongtong","last_name":"Liu"},{"first_name":"Denitsa Rangelova","id":"71b4d059-2a03-11ee-914d-dfa3beed6530","last_name":"Baykusheva","full_name":"Baykusheva, Denitsa Rangelova"},{"first_name":"Mingda","full_name":"Li, Mingda","last_name":"Li"},{"full_name":"Mitrano, Matteo","last_name":"Mitrano","first_name":"Matteo"},{"first_name":"Yao","last_name":"Wang","full_name":"Wang, Yao"}],"article_processing_charge":"No","external_id":{"arxiv":["2209.02283"],"pmid":["37316515"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Hales J, Bajpai U, Liu T, Baykusheva DR, Li M, Mitrano M, Wang Y. 2023. Witnessing light-driven entanglement using time-resolved resonant inelastic X-ray scattering. Nature Communications. 14, 3512.","chicago":"Hales, Jordyn, Utkarsh Bajpai, Tongtong Liu, Denitsa Rangelova Baykusheva, Mingda Li, Matteo Mitrano, and Yao Wang. “Witnessing Light-Driven Entanglement Using Time-Resolved Resonant Inelastic X-Ray Scattering.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-38540-3.","apa":"Hales, J., Bajpai, U., Liu, T., Baykusheva, D. R., Li, M., Mitrano, M., & Wang, Y. (2023). Witnessing light-driven entanglement using time-resolved resonant inelastic X-ray scattering. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-023-38540-3","ama":"Hales J, Bajpai U, Liu T, et al. Witnessing light-driven entanglement using time-resolved resonant inelastic X-ray scattering. Nature Communications. 2023;14. doi:10.1038/s41467-023-38540-3","short":"J. Hales, U. Bajpai, T. Liu, D.R. Baykusheva, M. Li, M. Mitrano, Y. Wang, Nature Communications 14 (2023).","ieee":"J. Hales et al., “Witnessing light-driven entanglement using time-resolved resonant inelastic X-ray scattering,” Nature Communications, vol. 14. Springer Nature, 2023.","mla":"Hales, Jordyn, et al. “Witnessing Light-Driven Entanglement Using Time-Resolved Resonant Inelastic X-Ray Scattering.” Nature Communications, vol. 14, 3512, Springer Nature, 2023, doi:10.1038/s41467-023-38540-3."},"quality_controlled":"1","publisher":"Springer Nature","oa":1,"date_published":"2023-06-14T00:00:00Z","doi":"10.1038/s41467-023-38540-3","date_created":"2023-08-09T13:06:59Z","day":"14","publication":"Nature Communications","year":"2023"},{"oa":1,"quality_controlled":"1","publisher":"American Physical Society","publication":"Physical Review Letters","day":"10","year":"2023","date_created":"2023-08-09T13:07:24Z","doi":"10.1103/physrevlett.130.106902","date_published":"2023-03-10T00:00:00Z","article_number":"106902","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Baykusheva, Denitsa Rangelova, et al. “Witnessing Nonequilibrium Entanglement Dynamics in a Strongly Correlated Fermionic Chain.” Physical Review Letters, vol. 130, no. 10, 106902, American Physical Society, 2023, doi:10.1103/physrevlett.130.106902.","ieee":"D. R. Baykusheva et al., “Witnessing nonequilibrium entanglement dynamics in a strongly correlated fermionic chain,” Physical Review Letters, vol. 130, no. 10. American Physical Society, 2023.","short":"D.R. Baykusheva, M.H. Kalthoff, D. Hofmann, M. Claassen, D.M. Kennes, M.A. Sentef, M. Mitrano, Physical Review Letters 130 (2023).","ama":"Baykusheva DR, Kalthoff MH, Hofmann D, et al. Witnessing nonequilibrium entanglement dynamics in a strongly correlated fermionic chain. Physical Review Letters. 2023;130(10). doi:10.1103/physrevlett.130.106902","apa":"Baykusheva, D. R., Kalthoff, M. H., Hofmann, D., Claassen, M., Kennes, D. M., Sentef, M. A., & Mitrano, M. (2023). Witnessing nonequilibrium entanglement dynamics in a strongly correlated fermionic chain. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.130.106902","chicago":"Baykusheva, Denitsa Rangelova, Mona H. Kalthoff, Damian Hofmann, Martin Claassen, Dante M. Kennes, Michael A. Sentef, and Matteo Mitrano. “Witnessing Nonequilibrium Entanglement Dynamics in a Strongly Correlated Fermionic Chain.” Physical Review Letters. American Physical Society, 2023. https://doi.org/10.1103/physrevlett.130.106902.","ista":"Baykusheva DR, Kalthoff MH, Hofmann D, Claassen M, Kennes DM, Sentef MA, Mitrano M. 2023. Witnessing nonequilibrium entanglement dynamics in a strongly correlated fermionic chain. Physical Review Letters. 130(10), 106902."},"title":"Witnessing nonequilibrium entanglement dynamics in a strongly correlated fermionic chain","article_processing_charge":"No","external_id":{"pmid":["36962013"],"arxiv":["2209.02081"]},"author":[{"full_name":"Baykusheva, Denitsa Rangelova","last_name":"Baykusheva","id":"71b4d059-2a03-11ee-914d-dfa3beed6530","first_name":"Denitsa Rangelova"},{"first_name":"Mona H.","full_name":"Kalthoff, Mona H.","last_name":"Kalthoff"},{"last_name":"Hofmann","full_name":"Hofmann, Damian","first_name":"Damian"},{"last_name":"Claassen","full_name":"Claassen, Martin","first_name":"Martin"},{"full_name":"Kennes, Dante M.","last_name":"Kennes","first_name":"Dante M."},{"first_name":"Michael A.","full_name":"Sentef, Michael A.","last_name":"Sentef"},{"full_name":"Mitrano, Matteo","last_name":"Mitrano","first_name":"Matteo"}],"oa_version":"Preprint","pmid":1,"abstract":[{"text":"Many-body entanglement in condensed matter systems can be diagnosed from equilibrium response functions through the use of entanglement witnesses and operator-specific quantum bounds. Here, we investigate the applicability of this approach for detecting entangled states in quantum systems driven out of equilibrium. We use a multipartite entanglement witness, the quantum Fisher information, to study the dynamics of a paradigmatic fermion chain undergoing a time-dependent change of the Coulomb interaction. Our results show that the quantum Fisher information is able to witness distinct signatures of multipartite entanglement both near and far from equilibrium that are robust against decoherence. We discuss implications of these findings for probing entanglement in light-driven quantum materials with time-resolved optical and x-ray scattering methods.","lang":"eng"}],"intvolume":" 130","month":"03","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2209.02081"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"issue":"10","volume":130,"_id":"13990","keyword":["General Physics and Astronomy"],"status":"public","article_type":"original","type":"journal_article","extern":"1","date_updated":"2023-08-22T07:18:01Z"},{"acknowledgement":"We would like to thank Troy Shinbrot, Victor Lee and Daniele Foresti for helpful discussions. This project has received funding from the European Research Council Grant Agreement No. 949120 and from the the Marie Sk lodowska-Curie Grant Agreement No. 754411 under\r\nthe European Union’s Horizon 2020 research and innovation program.","publisher":"American Physical Society","quality_controlled":"1","oa":1,"isi":1,"has_accepted_license":"1","year":"2023","day":"03","publication":"Physical Review Letters","date_published":"2023-03-03T00:00:00Z","doi":"10.1103/physrevlett.130.098202","date_created":"2023-02-28T12:14:46Z","article_number":"098202","project":[{"_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","call_identifier":"H2020","name":"Tribocharge: a multi-scale approach to an enduring problem in physics","grant_number":"949120"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"citation":{"ista":"Grosjean GM, Waitukaitis SR. 2023. Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media. Physical Review Letters. 130(9), 098202.","chicago":"Grosjean, Galien M, and Scott R Waitukaitis. “Single-Collision Statistics Reveal a Global Mechanism Driven by Sample History for Contact Electrification in Granular Media.” Physical Review Letters. American Physical Society, 2023. https://doi.org/10.1103/physrevlett.130.098202.","ieee":"G. M. Grosjean and S. R. Waitukaitis, “Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media,” Physical Review Letters, vol. 130, no. 9. American Physical Society, 2023.","short":"G.M. Grosjean, S.R. Waitukaitis, Physical Review Letters 130 (2023).","ama":"Grosjean GM, Waitukaitis SR. Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media. Physical Review Letters. 2023;130(9). doi:10.1103/physrevlett.130.098202","apa":"Grosjean, G. M., & Waitukaitis, S. R. (2023). Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.130.098202","mla":"Grosjean, Galien M., and Scott R. Waitukaitis. “Single-Collision Statistics Reveal a Global Mechanism Driven by Sample History for Contact Electrification in Granular Media.” Physical Review Letters, vol. 130, no. 9, 098202, American Physical Society, 2023, doi:10.1103/physrevlett.130.098202."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"orcid":"0000-0001-5154-417X","full_name":"Grosjean, Galien M","last_name":"Grosjean","id":"0C5FDA4A-9CF6-11E9-8939-FF05E6697425","first_name":"Galien M"},{"orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R"}],"external_id":{"isi":["000946178200008"],"arxiv":["2211.02488"]},"article_processing_charge":"No","title":"Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media","abstract":[{"text":"Models for same-material contact electrification in granular media often rely on a local charge-driving parameter whose spatial variations lead to a stochastic origin for charge exchange. Measuring the charge transfer from individual granular spheres after contacts with substrates of the same material, we find instead a “global” charging behavior, coherent over the sample’s whole surface. Cleaning and baking samples fully resets charging magnitude and direction, which indicates the underlying global parameter is not intrinsic to the material, but acquired from its history. Charging behavior is randomly and irreversibly affected by changes in relative humidity, hinting at a mechanism where adsorbates, in particular, water, are fundamental to the charge-transfer process.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2211.02488","open_access":"1"}],"month":"03","intvolume":" 130","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"publication_status":"published","file":[{"file_name":"Main_Preprint.pdf","date_created":"2023-02-28T12:20:27Z","creator":"ggrosjea","file_size":2301864,"date_updated":"2023-02-28T12:20:27Z","success":1,"file_id":"12698","checksum":"c4f2f6eea0408811f8f4898e15890355","relation":"main_file","access_level":"open_access","content_type":"application/pdf"},{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"12699","checksum":"6af6ed6c97a977f923de4162294b43c4","file_size":1138625,"date_updated":"2023-02-28T12:20:55Z","creator":"ggrosjea","file_name":"Suppl_info.pdf","date_created":"2023-02-28T12:20:55Z"},{"creator":"ggrosjea","date_updated":"2023-02-28T12:37:54Z","file_size":793449,"date_created":"2023-02-28T12:37:54Z","file_name":"Suppl_vid1.mp4","access_level":"open_access","relation":"main_file","content_type":"video/mp4","file_id":"12700","checksum":"3f20365fb9515bdba3a111d912c8d8b4","success":1},{"file_name":"Suppl_vid2.mp4","date_created":"2023-02-28T12:37:54Z","file_size":455925,"date_updated":"2023-02-28T12:37:54Z","creator":"ggrosjea","success":1,"file_id":"12701","checksum":"90cecacbe0e2f9dea11f91a4ba20c32e","content_type":"video/mp4","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"8101","status":"public","relation":"research_paper"}]},"volume":130,"issue":"9","ec_funded":1,"_id":"12697","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","keyword":["General Physics","Electrostatics","Triboelectricity","Soft Matter","Acoustic Levitation","Granular Materials"],"date_updated":"2023-08-22T08:41:32Z","ddc":["530","537"],"department":[{"_id":"ScWa"}],"file_date_updated":"2023-02-28T12:37:54Z"},{"_id":"14103","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"status":"public","type":"journal_article","article_type":"original","extern":"1","date_updated":"2023-08-22T11:01:07Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Observations of individual massive stars, super-luminous supernovae, gamma-ray bursts, and gravitational wave events involving spectacular black hole mergers indicate that the low-metallicity Universe is fundamentally different from our own Galaxy. Many transient phenomena will remain enigmatic until we achieve a firm understanding of the physics and evolution of massive stars at low metallicity (Z). The Hubble Space Telescope has devoted 500 orbits to observing ∼250 massive stars at low Z in the ultraviolet (UV) with the COS and STIS spectrographs under the ULLYSES programme. The complementary X-Shooting ULLYSES (XShootU) project provides an enhanced legacy value with high-quality optical and near-infrared spectra obtained with the wide-wavelength coverage X-shooter spectrograph at ESO’s Very Large Telescope. We present an overview of the XShootU project, showing that combining ULLYSES UV and XShootU optical spectra is critical for the uniform determination of stellar parameters such as effective temperature, surface gravity, luminosity, and abundances, as well as wind properties such as mass-loss rates as a function of Z. As uncertainties in stellar and wind parameters percolate into many adjacent areas of astrophysics, the data and modelling of the XShootU project is expected to be a game changer for our physical understanding of massive stars at low Z. To be able to confidently interpret James Webb Space Telescope spectra of the first stellar generations, the individual spectra of low-Z stars need to be understood, which is exactly where XShootU can deliver."}],"intvolume":" 675","month":"07","main_file_link":[{"url":"https://doi.org/10.1051/0004-6361/202245650","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"volume":675,"article_number":"A154","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Vink JS, Mehner A, Crowther PA, et al. X-shooting ULLYSES: Massive stars at low metallicity. I. Project description. Astronomy & Astrophysics. 2023;675. doi:10.1051/0004-6361/202245650","apa":"Vink, J. S., Mehner, A., Crowther, P. A., Fullerton, A., Garcia, M., Martins, F., … Wang, L. (2023). X-shooting ULLYSES: Massive stars at low metallicity. I. Project description. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202245650","short":"J.S. Vink, A. Mehner, P.A. Crowther, A. Fullerton, M. Garcia, F. Martins, N. Morrell, L.M. Oskinova, N. St-Louis, A. ud-Doula, A.A.C. Sander, H. Sana, J.-C. Bouret, B. Kubátová, P. Marchant, L.P. Martins, A. Wofford, J.T. van Loon, O. Grace Telford, Y.L.L. Götberg, D.M. Bowman, C. Erba, V.M. Kalari, M. Abdul-Masih, T. Alkousa, F. Backs, C.L. Barbosa, S.R. Berlanas, M. Bernini-Peron, J.M. Bestenlehner, R. Blomme, J. Bodensteiner, S.A. Brands, C.J. Evans, A. David-Uraz, F.A. Driessen, K. Dsilva, S. Geen, V.M.A. Gómez-González, L. Grassitelli, W.-R. Hamann, C. Hawcroft, A. Herrero, E.R. Higgins, D. John Hillier, R. Ignace, A.G. Istrate, L. Kaper, N.D. Kee, C. Kehrig, Z. Keszthelyi, J. Klencki, A. de Koter, R. Kuiper, E. Laplace, C.J.K. Larkin, R.R. Lefever, C. Leitherer, D.J. Lennon, L. Mahy, J. Maíz Apellániz, G. Maravelias, W. Marcolino, A.F. McLeod, S.E. de Mink, F. Najarro, M.S. Oey, T.N. Parsons, D. Pauli, M.G. Pedersen, R.K. Prinja, V. Ramachandran, M.C. Ramírez-Tannus, G.N. Sabhahit, A. Schootemeijer, S. Reyero Serantes, T. Shenar, G.S. Stringfellow, N. Sudnik, F. Tramper, L. Wang, Astronomy & Astrophysics 675 (2023).","ieee":"J. S. Vink et al., “X-shooting ULLYSES: Massive stars at low metallicity. I. Project description,” Astronomy & Astrophysics, vol. 675. EDP Sciences, 2023.","mla":"Vink, Jorick S., et al. “X-Shooting ULLYSES: Massive Stars at Low Metallicity. I. Project Description.” Astronomy & Astrophysics, vol. 675, A154, EDP Sciences, 2023, doi:10.1051/0004-6361/202245650.","ista":"Vink JS, Mehner A, Crowther PA, Fullerton A, Garcia M, Martins F, Morrell N, Oskinova LM, St-Louis N, ud-Doula A, Sander AAC, Sana H, Bouret J-C, Kubátová B, Marchant P, Martins LP, Wofford A, van Loon JT, Grace Telford O, Götberg YLL, Bowman DM, Erba C, Kalari VM, Abdul-Masih M, Alkousa T, Backs F, Barbosa CL, Berlanas SR, Bernini-Peron M, Bestenlehner JM, Blomme R, Bodensteiner J, Brands SA, Evans CJ, David-Uraz A, Driessen FA, Dsilva K, Geen S, Gómez-González VMA, Grassitelli L, Hamann W-R, Hawcroft C, Herrero A, Higgins ER, John Hillier D, Ignace R, Istrate AG, Kaper L, Kee ND, Kehrig C, Keszthelyi Z, Klencki J, de Koter A, Kuiper R, Laplace E, Larkin CJK, Lefever RR, Leitherer C, Lennon DJ, Mahy L, Maíz Apellániz J, Maravelias G, Marcolino W, McLeod AF, de Mink SE, Najarro F, Oey MS, Parsons TN, Pauli D, Pedersen MG, Prinja RK, Ramachandran V, Ramírez-Tannus MC, Sabhahit GN, Schootemeijer A, Reyero Serantes S, Shenar T, Stringfellow GS, Sudnik N, Tramper F, Wang L. 2023. X-shooting ULLYSES: Massive stars at low metallicity. I. Project description. Astronomy & Astrophysics. 675, A154.","chicago":"Vink, Jorick S., A. Mehner, P. A. Crowther, A. Fullerton, M. Garcia, F. Martins, N. Morrell, et al. “X-Shooting ULLYSES: Massive Stars at Low Metallicity. I. Project Description.” Astronomy & Astrophysics. EDP Sciences, 2023. https://doi.org/10.1051/0004-6361/202245650."},"title":"X-shooting ULLYSES: Massive stars at low metallicity. I. Project description","article_processing_charge":"No","external_id":{"arxiv":["2305.06376"]},"author":[{"first_name":"Jorick S.","last_name":"Vink","full_name":"Vink, Jorick S."},{"last_name":"Mehner","full_name":"Mehner, A.","first_name":"A."},{"first_name":"P. A.","last_name":"Crowther","full_name":"Crowther, P. A."},{"first_name":"A.","last_name":"Fullerton","full_name":"Fullerton, A."},{"first_name":"M.","last_name":"Garcia","full_name":"Garcia, M."},{"first_name":"F.","full_name":"Martins, F.","last_name":"Martins"},{"first_name":"N.","full_name":"Morrell, N.","last_name":"Morrell"},{"first_name":"L. M.","full_name":"Oskinova, L. M.","last_name":"Oskinova"},{"first_name":"N.","full_name":"St-Louis, N.","last_name":"St-Louis"},{"first_name":"A.","full_name":"ud-Doula, A.","last_name":"ud-Doula"},{"full_name":"Sander, A. A. C.","last_name":"Sander","first_name":"A. A. C."},{"first_name":"H.","last_name":"Sana","full_name":"Sana, H."},{"full_name":"Bouret, J.-C.","last_name":"Bouret","first_name":"J.-C."},{"first_name":"B.","full_name":"Kubátová, B.","last_name":"Kubátová"},{"last_name":"Marchant","full_name":"Marchant, P.","first_name":"P."},{"full_name":"Martins, L. P.","last_name":"Martins","first_name":"L. P."},{"first_name":"A.","last_name":"Wofford","full_name":"Wofford, A."},{"last_name":"van Loon","full_name":"van Loon, J. Th.","first_name":"J. Th."},{"last_name":"Grace Telford","full_name":"Grace Telford, O.","first_name":"O."},{"id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","first_name":"Ylva Louise Linsdotter","full_name":"Götberg, Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911","last_name":"Götberg"},{"first_name":"D. M.","full_name":"Bowman, D. M.","last_name":"Bowman"},{"first_name":"C.","full_name":"Erba, C.","last_name":"Erba"},{"last_name":"Kalari","full_name":"Kalari, V. M.","first_name":"V. M."},{"full_name":"Abdul-Masih, M.","last_name":"Abdul-Masih","first_name":"M."},{"full_name":"Alkousa, T.","last_name":"Alkousa","first_name":"T."},{"first_name":"F.","full_name":"Backs, F.","last_name":"Backs"},{"full_name":"Barbosa, C. L.","last_name":"Barbosa","first_name":"C. L."},{"full_name":"Berlanas, S. R.","last_name":"Berlanas","first_name":"S. R."},{"last_name":"Bernini-Peron","full_name":"Bernini-Peron, M.","first_name":"M."},{"full_name":"Bestenlehner, J. M.","last_name":"Bestenlehner","first_name":"J. M."},{"first_name":"R.","last_name":"Blomme","full_name":"Blomme, R."},{"first_name":"J.","last_name":"Bodensteiner","full_name":"Bodensteiner, J."},{"last_name":"Brands","full_name":"Brands, S. A.","first_name":"S. A."},{"first_name":"C. J.","full_name":"Evans, C. J.","last_name":"Evans"},{"first_name":"A.","last_name":"David-Uraz","full_name":"David-Uraz, A."},{"first_name":"F. A.","last_name":"Driessen","full_name":"Driessen, F. A."},{"first_name":"K.","last_name":"Dsilva","full_name":"Dsilva, K."},{"first_name":"S.","last_name":"Geen","full_name":"Geen, S."},{"first_name":"V. M. A.","last_name":"Gómez-González","full_name":"Gómez-González, V. M. A."},{"last_name":"Grassitelli","full_name":"Grassitelli, L.","first_name":"L."},{"full_name":"Hamann, W.-R.","last_name":"Hamann","first_name":"W.-R."},{"last_name":"Hawcroft","full_name":"Hawcroft, C.","first_name":"C."},{"first_name":"A.","last_name":"Herrero","full_name":"Herrero, A."},{"full_name":"Higgins, E. R.","last_name":"Higgins","first_name":"E. R."},{"full_name":"John Hillier, D.","last_name":"John Hillier","first_name":"D."},{"last_name":"Ignace","full_name":"Ignace, R.","first_name":"R."},{"first_name":"A. G.","full_name":"Istrate, A. G.","last_name":"Istrate"},{"last_name":"Kaper","full_name":"Kaper, L.","first_name":"L."},{"full_name":"Kee, N. D.","last_name":"Kee","first_name":"N. D."},{"full_name":"Kehrig, C.","last_name":"Kehrig","first_name":"C."},{"first_name":"Z.","last_name":"Keszthelyi","full_name":"Keszthelyi, Z."},{"first_name":"J.","full_name":"Klencki, J.","last_name":"Klencki"},{"full_name":"de Koter, A.","last_name":"de Koter","first_name":"A."},{"first_name":"R.","full_name":"Kuiper, R.","last_name":"Kuiper"},{"last_name":"Laplace","full_name":"Laplace, E.","first_name":"E."},{"first_name":"C. J. K.","full_name":"Larkin, C. J. K.","last_name":"Larkin"},{"first_name":"R. R.","last_name":"Lefever","full_name":"Lefever, R. R."},{"full_name":"Leitherer, C.","last_name":"Leitherer","first_name":"C."},{"last_name":"Lennon","full_name":"Lennon, D. J.","first_name":"D. J."},{"first_name":"L.","full_name":"Mahy, L.","last_name":"Mahy"},{"full_name":"Maíz Apellániz, J.","last_name":"Maíz Apellániz","first_name":"J."},{"full_name":"Maravelias, G.","last_name":"Maravelias","first_name":"G."},{"full_name":"Marcolino, W.","last_name":"Marcolino","first_name":"W."},{"first_name":"A. F.","full_name":"McLeod, A. F.","last_name":"McLeod"},{"full_name":"de Mink, S. E.","last_name":"de Mink","first_name":"S. E."},{"full_name":"Najarro, F.","last_name":"Najarro","first_name":"F."},{"first_name":"M. S.","last_name":"Oey","full_name":"Oey, M. S."},{"full_name":"Parsons, T. N.","last_name":"Parsons","first_name":"T. N."},{"first_name":"D.","full_name":"Pauli, D.","last_name":"Pauli"},{"full_name":"Pedersen, M. G.","last_name":"Pedersen","first_name":"M. G."},{"first_name":"R. K.","last_name":"Prinja","full_name":"Prinja, R. K."},{"first_name":"V.","full_name":"Ramachandran, V.","last_name":"Ramachandran"},{"first_name":"M. C.","last_name":"Ramírez-Tannus","full_name":"Ramírez-Tannus, M. C."},{"full_name":"Sabhahit, G. N.","last_name":"Sabhahit","first_name":"G. N."},{"first_name":"A.","full_name":"Schootemeijer, A.","last_name":"Schootemeijer"},{"first_name":"S.","full_name":"Reyero Serantes, S.","last_name":"Reyero Serantes"},{"last_name":"Shenar","full_name":"Shenar, T.","first_name":"T."},{"last_name":"Stringfellow","full_name":"Stringfellow, G. S.","first_name":"G. S."},{"first_name":"N.","last_name":"Sudnik","full_name":"Sudnik, N."},{"first_name":"F.","full_name":"Tramper, F.","last_name":"Tramper"},{"full_name":"Wang, L.","last_name":"Wang","first_name":"L."}],"oa":1,"quality_controlled":"1","publisher":"EDP Sciences","publication":"Astronomy & Astrophysics","day":"01","year":"2023","date_created":"2023-08-21T10:12:35Z","doi":"10.1051/0004-6361/202245650","date_published":"2023-07-01T00:00:00Z"},{"publisher":"Institute of Science and Technology Austria","oa":1,"has_accepted_license":"1","year":"2023","day":"05","page":"202","date_published":"2023-05-05T00:00:00Z","doi":"10.15479/at:ista:13175","date_created":"2023-06-30T08:07:43Z","project":[{"_id":"26336814-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"A Fiber Optic Transceiver for Superconducting Qubits","grant_number":"758053"},{"call_identifier":"H2020","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A","grant_number":"899354","name":"Quantum Local Area Networks with Superconducting Qubits"},{"name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f"}],"citation":{"mla":"Sahu, Rishabh. Cavity Quantum Electrooptics. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13175.","short":"R. Sahu, Cavity Quantum Electrooptics, Institute of Science and Technology Austria, 2023.","ieee":"R. Sahu, “Cavity quantum electrooptics,” Institute of Science and Technology Austria, 2023.","apa":"Sahu, R. (2023). Cavity quantum electrooptics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:13175","ama":"Sahu R. Cavity quantum electrooptics. 2023. doi:10.15479/at:ista:13175","chicago":"Sahu, Rishabh. “Cavity Quantum Electrooptics.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13175.","ista":"Sahu R. 2023. Cavity quantum electrooptics. Institute of Science and Technology Austria."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"last_name":"Sahu","full_name":"Sahu, Rishabh","orcid":"0000-0001-6264-2162","id":"47D26E34-F248-11E8-B48F-1D18A9856A87","first_name":"Rishabh"}],"article_processing_charge":"No","title":"Cavity quantum electrooptics","abstract":[{"lang":"eng","text":"About a 100 years ago, we discovered that our universe is inherently noisy, that is, measuring any physical quantity with a precision beyond a certain point is not possible because of an omnipresent inherent noise. We call this - the quantum noise. Certain physical processes allow this quantum noise to get correlated in conjugate physical variables. These quantum correlations can be used to go beyond the potential of our inherently noisy universe and obtain a quantum advantage over the classical applications. \r\n\r\nQuantum noise being inherent also means that, at the fundamental level, the physical quantities are not well defined and therefore, objects can stay in multiple states at the same time. For example, the position of a particle not being well defined means that the particle is in multiple positions at the same time. About 4 decades ago, we started exploring the possibility of using objects which can be in multiple states at the same time to increase the dimensionality in computation. Thus, the field of quantum computing was born. We discovered that using quantum entanglement, a property closely related to quantum correlations, can be used to speed up computation of certain problems, such as factorisation of large numbers, faster than any known classical algorithm. Thus began the pursuit to make quantum computers a reality. \r\n\r\nTill date, we have explored quantum control over many physical systems including photons, spins, atoms, ions and even simple circuits made up of superconducting material. However, there persists one ubiquitous theme. The more readily a system interacts with an external field or matter, the more easily we can control it. But this also means that such a system can easily interact with a noisy environment and quickly lose its coherence. Consequently, such systems like electron spins need to be protected from the environment to ensure the longevity of their coherence. Other systems like nuclear spins are naturally protected as they do not interact easily with the environment. But, due to the same reason, it is harder to interact with such systems. \r\n\r\nAfter decades of experimentation with various systems, we are convinced that no one type of quantum system would be the best for all the quantum applications. We would need hybrid systems which are all interconnected - much like the current internet where all sorts of devices can all talk to each other - but now for quantum devices. A quantum internet. \r\n\r\nOptical photons are the best contenders to carry information for the quantum internet. They can carry quantum information cheaply and without much loss - the same reasons which has made them the backbone of our current internet. Following this direction, many systems, like trapped ions, have already demonstrated successful quantum links over a large distances using optical photons. However, some of the most promising contenders for quantum computing which are based on microwave frequencies have been left behind. This is because high energy optical photons can adversely affect fragile low-energy microwave systems. \r\n\r\nIn this thesis, we present substantial progress on this missing quantum link between microwave and optics using electrooptical nonlinearities in lithium niobate. The nonlinearities are enhanced by using resonant cavities for all the involved modes leading to observation of strong direct coupling between optical and microwave frequencies. With this strong coupling we are not only able to achieve almost 100\\% internal conversion efficiency with low added noise, thus presenting a quantum-enabled transducer, but also we are able to observe novel effects such as cooling of a microwave mode using optics. The strong coupling regime also leads to direct observation of dynamical backaction effect between microwave and optical frequencies which are studied in detail here. Finally, we also report first observation of microwave-optics entanglement in form of two-mode squeezed vacuum squeezed 0.7dB below vacuum level. \r\nWith this new bridge between microwave and optics, the microwave-based quantum technologies can finally be a part of a quantum network which is based on optical photons - putting us one step closer to a future with quantum internet. "}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"SSU"},{"_id":"NanoFab"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"05","publication_identifier":{"isbn":["978-3-99078-030-5"],"issn":["2663 - 337X"]},"degree_awarded":"PhD","publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"13176","checksum":"7d03f1a5a5258ee43dfc3323dea4e08f","success":1,"creator":"cchlebak","date_updated":"2023-06-30T08:17:25Z","file_size":18688376,"date_created":"2023-06-30T08:17:25Z","file_name":"thesis_pdfa.pdf"},{"access_level":"closed","relation":"source_file","content_type":"application/x-zip-compressed","checksum":"c3b45317ae58e0527533f98c202d81b7","file_id":"13196","creator":"cchlebak","date_updated":"2023-07-06T11:35:15Z","file_size":37847025,"date_created":"2023-07-06T11:35:15Z","file_name":"thesis.zip"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"old_edition","id":"12900","status":"public"},{"relation":"part_of_dissertation","id":"10924","status":"public"},{"id":"9114","status":"public","relation":"part_of_dissertation"}]},"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","_id":"13175","type":"dissertation","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"status":"public","keyword":["quantum optics","electrooptics","quantum networks","quantum communication","transduction"],"supervisor":[{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","last_name":"Fink","full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X"}],"date_updated":"2023-08-24T11:16:35Z","ddc":["537","535","539"],"file_date_updated":"2023-07-06T11:35:15Z","department":[{"_id":"GradSch"},{"_id":"JoFi"}]},{"project":[{"grant_number":"758053","name":"A Fiber Optic Transceiver for Superconducting Qubits","_id":"26336814-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"9B868D20-BA93-11EA-9121-9846C619BF3A","call_identifier":"H2020","name":"Quantum Local Area Networks with Superconducting Qubits","grant_number":"899354"},{"name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f"}],"citation":{"ista":"Sahu R. 2023. Cavity quantum electrooptics. Institute of Science and Technology Austria.","chicago":"Sahu, Rishabh. “Cavity Quantum Electrooptics.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12900.","ama":"Sahu R. Cavity quantum electrooptics. 2023. doi:10.15479/at:ista:12900","apa":"Sahu, R. (2023). Cavity quantum electrooptics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12900","short":"R. Sahu, Cavity Quantum Electrooptics, Institute of Science and Technology Austria, 2023.","ieee":"R. Sahu, “Cavity quantum electrooptics,” Institute of Science and Technology Austria, 2023.","mla":"Sahu, Rishabh. Cavity Quantum Electrooptics. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12900."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"last_name":"Sahu","full_name":"Sahu, Rishabh","orcid":"0000-0001-6264-2162","id":"47D26E34-F248-11E8-B48F-1D18A9856A87","first_name":"Rishabh"}],"article_processing_charge":"No","title":"Cavity quantum electrooptics","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","year":"2023","day":"05","page":"190","doi":"10.15479/at:ista:12900","date_published":"2023-05-05T00:00:00Z","date_created":"2023-05-05T11:08:50Z","_id":"12900","type":"dissertation","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"status":"public","keyword":["quantum optics","electrooptics","quantum networks","quantum communication","transduction"],"supervisor":[{"orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","last_name":"Fink","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-08-24T11:16:35Z","ddc":["537","535","539"],"file_date_updated":"2023-07-06T11:37:40Z","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"SSU"},{"_id":"NanoFab"}],"abstract":[{"text":"About a 100 years ago, we discovered that our universe is inherently noisy, that is, measuring any physical quantity with a precision beyond a certain point is not possible because of an omnipresent inherent noise. We call this - the quantum noise. Certain physical processes allow this quantum noise to get correlated in conjugate physical variables. These quantum correlations can be used to go beyond the potential of our inherently noisy universe and obtain a quantum advantage over the classical applications. \r\n\r\nQuantum noise being inherent also means that, at the fundamental level, the physical quantities are not well defined and therefore, objects can stay in multiple states at the same time. For example, the position of a particle not being well defined means that the particle is in multiple positions at the same time. About 4 decades ago, we started exploring the possibility of using objects which can be in multiple states at the same time to increase the dimensionality in computation. Thus, the field of quantum computing was born. We discovered that using quantum entanglement, a property closely related to quantum correlations, can be used to speed up computation of certain problems, such as factorisation of large numbers, faster than any known classical algorithm. Thus began the pursuit to make quantum computers a reality. \r\n\r\nTill date, we have explored quantum control over many physical systems including photons, spins, atoms, ions and even simple circuits made up of superconducting material. However, there persists one ubiquitous theme. The more readily a system interacts with an external field or matter, the more easily we can control it. But this also means that such a system can easily interact with a noisy environment and quickly lose its coherence. Consequently, such systems like electron spins need to be protected from the environment to ensure the longevity of their coherence. Other systems like nuclear spins are naturally protected as they do not interact easily with the environment. But, due to the same reason, it is harder to interact with such systems. \r\n\r\nAfter decades of experimentation with various systems, we are convinced that no one type of quantum system would be the best for all the quantum applications. We would need hybrid systems which are all interconnected - much like the current internet where all sorts of devices can all talk to each other - but now for quantum devices. A quantum internet. \r\n\r\nOptical photons are the best contenders to carry information for the quantum internet. They can carry quantum information cheaply and without much loss - the same reasons which has made them the backbone of our current internet. Following this direction, many systems, like trapped ions, have already demonstrated successful quantum links over a large distances using optical photons. However, some of the most promising contenders for quantum computing which are based on microwave frequencies have been left behind. This is because high energy optical photons can adversely affect fragile low-energy microwave systems. \r\n\r\nIn this thesis, we present substantial progress on this missing quantum link between microwave and optics using electrooptical nonlinearities in lithium niobate. The nonlinearities are enhanced by using resonant cavities for all the involved modes leading to observation of strong direct coupling between optical and microwave frequencies. With this strong coupling we are not only able to achieve almost 100\\% internal conversion efficiency with low added noise, thus presenting a quantum-enabled transducer, but also we are able to observe novel effects such as cooling of a microwave mode using optics. The strong coupling regime also leads to direct observation of dynamical backaction effect between microwave and optical frequencies which are studied in detail here. Finally, we also report first observation of microwave-optics entanglement in form of two-mode squeezed vacuum squeezed 0.7dB below vacuum level. \r\nWith this new bridge between microwave and optics, the microwave-based quantum technologies can finally be a part of a quantum network which is based on optical photons - putting us one step closer to a future with quantum internet. ","lang":"eng"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"05","publication_identifier":{"issn":["2663 - 337X"],"isbn":["978-3-99078-030-5"]},"publication_status":"published","degree_awarded":"PhD","file":[{"file_id":"12928","checksum":"8cbdab9c37ee55e591092a6f66b272c4","embargo_to":"open_access","content_type":"application/x-zip-compressed","relation":"source_file","access_level":"closed","file_name":"thesis.zip","date_created":"2023-05-09T08:45:14Z","file_size":36767177,"date_updated":"2023-06-06T22:30:03Z","creator":"rsahu"},{"date_created":"2023-05-09T08:51:17Z","file_name":"thesis_pdfa_final.pdf","date_updated":"2023-07-06T11:37:40Z","file_size":17501990,"creator":"rsahu","checksum":"439659ead46618147309be39d9dd5a8c","file_id":"12929","content_type":"application/pdf","access_level":"closed","relation":"main_file"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"13175","status":"public","relation":"new_edition"},{"relation":"part_of_dissertation","id":"10924","status":"public"},{"id":"9114","status":"public","relation":"part_of_dissertation"}]},"ec_funded":1},{"date_updated":"2023-09-05T07:06:14Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"14242","conference":{"start_date":"2023-02-07","location":"Washington, DC, United States","end_date":"2023-02-14","name":"AAAI: Conference on Artificial Intelligence"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781577358800"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":37,"issue":"12","abstract":[{"text":"We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore commonly adopted in industry. Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization, and certification of the quantized representation is necessary to guarantee robustness. In this work, we present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs. Inspired by advances in robust learning of non-quantized networks, our training algorithm computes the gradient of an abstract representation of the actual network. Unlike existing approaches, our method can handle the discrete semantics of QNNs. Based on QA-IBP, we also develop a complete verification procedure for verifying the adversarial robustness of QNNs, which is guaranteed to terminate and produce a correct answer. Compared to existing approaches, the key advantage of our verification procedure is that it runs entirely on GPU or other accelerator devices. We demonstrate experimentally that our approach significantly outperforms existing methods and establish the new state-of-the-art for training and certifying the robustness of QNNs.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2211.16187","open_access":"1"}],"scopus_import":"1","intvolume":" 37","month":"06","citation":{"ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence. Vol 37. Association for the Advancement of Artificial Intelligence; 2023:14964-14973. doi:10.1609/aaai.v37i12.26747","apa":"Lechner, M., Zikelic, D., Chatterjee, K., Henzinger, T. A., & Rus, D. (2023). Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 14964–14973). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v37i12.26747","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, D. Rus, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–14973.","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, T. A. Henzinger, and D. Rus, “Quantization-aware interval bound propagation for training certifiably robust quantized neural networks,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 12, pp. 14964–14973.","mla":"Lechner, Mathias, et al. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 12, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–73, doi:10.1609/aaai.v37i12.26747.","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. 2023. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 14964–14973.","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, Thomas A Henzinger, and Daniela Rus. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:14964–73. Association for the Advancement of Artificial Intelligence, 2023. https://doi.org/10.1609/aaai.v37i12.26747."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2211.16187"]},"article_processing_charge":"No","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"}],"title":"Quantization-aware interval bound propagation for training certifiably robust quantized neural networks","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"year":"2023","publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","day":"26","page":"14964-14973","date_created":"2023-08-27T22:01:17Z","date_published":"2023-06-26T00:00:00Z","doi":"10.1609/aaai.v37i12.26747","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, 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. Research was sponsored by the United\r\nStates Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-\r\n1000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied,\r\nof the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright\r\nnotation herein. The research was also funded in part by the AI2050 program at Schmidt Futures (Grant G-22-63172) and Capgemini SE.","oa":1,"publisher":"Association for the Advancement of Artificial Intelligence","quality_controlled":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.” Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 5, 2023, pp. 5464–71, doi:10.1609/aaai.v37i5.25679.","ama":"Avni G, Jecker IR, Zikelic D. Bidding graph games with partially-observable budgets. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence. Vol 37. ; 2023:5464-5471. doi:10.1609/aaai.v37i5.25679","apa":"Avni, G., Jecker, I. R., & Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 5464–5471). Washington, DC, United States. https://doi.org/10.1609/aaai.v37i5.25679","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, 2023, pp. 5464–5471.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Bidding Graph Games with Partially-Observable Budgets.” In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:5464–71, 2023. https://doi.org/10.1609/aaai.v37i5.25679.","ista":"Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471."},"title":"Bidding graph games with partially-observable budgets","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker","full_name":"Jecker, Ismael R"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"external_id":{"arxiv":["2211.13626"]},"article_processing_charge":"No","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"day":"27","publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","year":"2023","date_published":"2023-06-27T00:00:00Z","doi":"10.1609/aaai.v37i5.25679","date_created":"2023-08-27T22:01:18Z","page":"5464-5471","acknowledgement":"This research was supported in part by ISF grant no.1679/21, by the 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.","quality_controlled":"1","oa":1,"date_updated":"2023-09-05T08:37:00Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"14243","status":"public","type":"conference","conference":{"location":"Washington, DC, United States","end_date":"2023-02-14","start_date":"2023-02-07","name":"AAAI: Conference on Artificial Intelligence"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781577358800"]},"publication_status":"published","issue":"5","volume":37,"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Two-player zero-sum \"graph games\" are central in logic, verification, and multi-agent systems. The game proceeds by placing a token on a vertex of a graph, and allowing the players to move it to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In \"bidding games\", however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as full-information games. In this work we initiate the study of partial-information bidding games: we study bidding games in which a player's initial budget is drawn from a known probability distribution. We show that while for some bidding mechanisms and objectives, it is straightforward to adapt the results from the full-information setting to the partial-information setting, for others, the analysis is significantly more challenging, requires new techniques, and gives rise to interesting results. Specifically, we study games with \"mean-payoff\" objectives in combination with \"poorman\" bidding. We construct optimal strategies for a partially-informed player who plays against a fully-informed adversary. We show that, somewhat surprisingly, the \"value\" under pure strategies does not necessarily exist in such games."}],"month":"06","intvolume":" 37","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1609/aaai.v37i5.25679"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Tojo, Kenji, et al. “Stealth Shaper: Reflectivity Optimization as Surface Stylization.” SIGGRAPH 2023 Conference Proceedings, 20, Association for Computing Machinery, 2023, doi:10.1145/3588432.3591542.","short":"K. Tojo, A. Shamir, B. Bickel, N. Umetani, in:, SIGGRAPH 2023 Conference Proceedings, Association for Computing Machinery, 2023.","ieee":"K. Tojo, A. Shamir, B. Bickel, and N. Umetani, “Stealth shaper: Reflectivity optimization as surface stylization,” in SIGGRAPH 2023 Conference Proceedings, Los Angeles, CA, United States, 2023.","apa":"Tojo, K., Shamir, A., Bickel, B., & Umetani, N. (2023). Stealth shaper: Reflectivity optimization as surface stylization. In SIGGRAPH 2023 Conference Proceedings. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3588432.3591542","ama":"Tojo K, Shamir A, Bickel B, Umetani N. Stealth shaper: Reflectivity optimization as surface stylization. In: SIGGRAPH 2023 Conference Proceedings. Association for Computing Machinery; 2023. doi:10.1145/3588432.3591542","chicago":"Tojo, Kenji, Ariel Shamir, Bernd Bickel, and Nobuyuki Umetani. “Stealth Shaper: Reflectivity Optimization as Surface Stylization.” In SIGGRAPH 2023 Conference Proceedings. Association for Computing Machinery, 2023. https://doi.org/10.1145/3588432.3591542.","ista":"Tojo K, Shamir A, Bickel B, Umetani N. 2023. Stealth shaper: Reflectivity optimization as surface stylization. SIGGRAPH 2023 Conference Proceedings. SIGGRAPH: Computer Graphics and Interactive Techniques Conference, 20."},"title":"Stealth shaper: Reflectivity optimization as surface stylization","author":[{"last_name":"Tojo","full_name":"Tojo, Kenji","first_name":"Kenji"},{"first_name":"Ariel","last_name":"Shamir","full_name":"Shamir, Ariel"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385"},{"first_name":"Nobuyuki","full_name":"Umetani, Nobuyuki","last_name":"Umetani"}],"external_id":{"arxiv":["2305.05944"]},"article_processing_charge":"No","article_number":"20","day":"23","publication":"SIGGRAPH 2023 Conference Proceedings","year":"2023","date_published":"2023-07-23T00:00:00Z","doi":"10.1145/3588432.3591542","date_created":"2023-08-27T22:01:17Z","acknowledgement":"The authors would like to thank Yuki Koyama and Takeo Igarashi for early discussions, and Yuta Yaguchi for support in 3D printing. This research is partially supported by the Israel Science Foundation grant number 1390/19.\r\n","quality_controlled":"1","publisher":"Association for Computing Machinery","oa":1,"date_updated":"2023-09-05T07:22:03Z","department":[{"_id":"BeBi"}],"_id":"14241","status":"public","type":"conference","conference":{"location":"Los Angeles, CA, United States","end_date":"2023-08-10","start_date":"2023-08-06","name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9798400701597"]},"publication_status":"published","oa_version":"Preprint","abstract":[{"text":"We present a technique to optimize the reflectivity of a surface while preserving its overall shape. The naïve optimization of the mesh vertices using the gradients of reflectivity simulations results in undesirable distortion. In contrast, our robust formulation optimizes the surface normal as an independent variable that bridges the reflectivity term with differential rendering, and the regularization term with as-rigid-as-possible elastic energy. We further adaptively subdivide the input mesh to improve the convergence. Consequently, our method can minimize the retroreflectivity of a wide range of input shapes, resulting in sharply creased shapes ubiquitous among stealth aircraft and Sci-Fi vehicles. Furthermore, by changing the reward for the direction of the outgoing light directions, our method can be applied to other reflectivity design tasks, such as the optimization of architectural walls to concentrate light in a specific region. We have tested the proposed method using light-transport simulations and real-world 3D-printed objects.","lang":"eng"}],"month":"07","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2305.05944"}]},{"publication_identifier":{"issn":["0022-3077"],"eissn":["1522-1598"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"3","volume":129,"abstract":[{"lang":"eng","text":"Presynaptic inputs determine the pattern of activation of postsynaptic neurons in a neural circuit. Molecular and genetic pathways that regulate the selective formation of subsets of presynaptic inputs are largely unknown, despite significant understanding of the general process of synaptogenesis. In this study, we have begun to identify such factors using the spinal monosynaptic stretch reflex circuit as a model system. In this neuronal circuit, Ia proprioceptive afferents establish monosynaptic connections with spinal motor neurons that project to the same muscle (termed homonymous connections) or muscles with related or synergistic function. However, monosynaptic connections are not formed with motor neurons innervating muscles with antagonistic functions. The ETS transcription factor ER81 (also known as ETV1) is expressed by all proprioceptive afferents, but only a small set of motor neuron pools in the lumbar spinal cord of the mouse. Here we use conditional mouse genetic techniques to eliminate Er81 expression selectively from motor neurons. We find that ablation of Er81 in motor neurons reduces synaptic inputs from proprioceptive afferents conveying information from homonymous and synergistic muscles, with no change observed in the connectivity pattern from antagonistic proprioceptive afferents. In summary, these findings suggest a role for ER81 in defined motor neuron pools to control the assembly of specific presynaptic inputs and thereby influence the profile of activation of these motor neurons."}],"oa_version":"None","pmid":1,"month":"03","intvolume":" 129","date_updated":"2023-09-05T12:13:34Z","department":[{"_id":"SiHi"}],"_id":"12562","article_type":"original","type":"journal_article","status":"public","keyword":["Physiology","General Neuroscience"],"isi":1,"year":"2023","day":"01","publication":"Journal of Neurophysiology","page":"501-512","date_published":"2023-03-01T00:00:00Z","doi":"10.1152/jn.00172.2022","date_created":"2023-02-15T14:46:14Z","acknowledgement":"The authors gratefully thank Dr. Silvia Arber, University of Basel and Friedrich Miescher Institute for Biomedical Research, for support and in whose lab the data were collected. For advice on statistical analysis, we thank Michael Bottomley from the Statistical Consulting Center, College of Science and Mathematics, Wright State University.","publisher":"American Physiological Society","quality_controlled":"1","citation":{"apa":"Ladle, D. R., & Hippenmeyer, S. (2023). Loss of ETV1/ER81 in motor neurons leads to reduced monosynaptic inputs from proprioceptive sensory neurons. Journal of Neurophysiology. American Physiological Society. https://doi.org/10.1152/jn.00172.2022","ama":"Ladle DR, Hippenmeyer S. Loss of ETV1/ER81 in motor neurons leads to reduced monosynaptic inputs from proprioceptive sensory neurons. Journal of Neurophysiology. 2023;129(3):501-512. doi:10.1152/jn.00172.2022","ieee":"D. R. Ladle and S. Hippenmeyer, “Loss of ETV1/ER81 in motor neurons leads to reduced monosynaptic inputs from proprioceptive sensory neurons,” Journal of Neurophysiology, vol. 129, no. 3. American Physiological Society, pp. 501–512, 2023.","short":"D.R. Ladle, S. Hippenmeyer, Journal of Neurophysiology 129 (2023) 501–512.","mla":"Ladle, David R., and Simon Hippenmeyer. “Loss of ETV1/ER81 in Motor Neurons Leads to Reduced Monosynaptic Inputs from Proprioceptive Sensory Neurons.” Journal of Neurophysiology, vol. 129, no. 3, American Physiological Society, 2023, pp. 501–12, doi:10.1152/jn.00172.2022.","ista":"Ladle DR, Hippenmeyer S. 2023. Loss of ETV1/ER81 in motor neurons leads to reduced monosynaptic inputs from proprioceptive sensory neurons. Journal of Neurophysiology. 129(3), 501–512.","chicago":"Ladle, David R., and Simon Hippenmeyer. “Loss of ETV1/ER81 in Motor Neurons Leads to Reduced Monosynaptic Inputs from Proprioceptive Sensory Neurons.” Journal of Neurophysiology. American Physiological Society, 2023. https://doi.org/10.1152/jn.00172.2022."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Ladle, David R.","last_name":"Ladle","first_name":"David R."},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer"}],"article_processing_charge":"No","external_id":{"isi":["000957721600001"],"pmid":["36695533"]},"title":"Loss of ETV1/ER81 in motor neurons leads to reduced monosynaptic inputs from proprioceptive sensory neurons"},{"file_date_updated":"2023-07-31T08:11:20Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2023-09-05T15:14:00Z","ddc":["000"],"type":"conference","conference":{"name":"CAV: Computer Aided Verification","end_date":"2023-07-22","location":"Paris, France","start_date":"2023-07-17"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"13310","volume":13965,"ec_funded":1,"publication_identifier":{"eisbn":["9783031377037"],"isbn":["9783031377020"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publication_status":"published","file":[{"success":1,"checksum":"ccaf94bf7d658ba012c016e11869b54c","file_id":"13327","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_LNCS_CAV_HenzingerT.pdf","date_created":"2023-07-31T08:11:20Z","creator":"dernst","file_size":647760,"date_updated":"2023-07-31T08:11:20Z"}],"language":[{"iso":"eng"}],"alternative_title":["LNCS"],"month":"07","intvolume":" 13965","abstract":[{"lang":"eng","text":"Machine-learned systems are in widespread use for making decisions about humans, and it is important that they are fair, i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure. We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden. We build monitors that observe a long sequence of events as generated by a given system, and output, after each observation, a quantitative estimate of how fair or biased the system was on that run until that point in time. The estimate is proven to be correct modulo a variable error bound and a given confidence level, where the error bound gets tighter as the observed sequence gets longer. Our monitors are of two types, and use, respectively, frequentist and Bayesian statistical inference techniques. While the frequentist monitors compute estimates that are objectively correct with respect to the ground truth, the Bayesian monitors compute estimates that are correct subject to a given prior belief about the system’s model. Using a prototype implementation, we show how we can monitor if a bank is fair in giving loans to applicants from different social backgrounds, and if a college is fair in admitting students while maintaining a reasonable financial burden on the society. Although they exhibit different theoretical complexities in certain cases, in our experiments, both frequentist and Bayesian monitors took less than a millisecond to update their verdicts after each observation."}],"oa_version":"Published Version","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"f1dedef5-2f78-11ee-989a-c4c97bccf506","first_name":"Mahyar","orcid":"0009-0005-0820-1696","full_name":"Karimi, Mahyar","last_name":"Karimi"},{"id":"8121a2d0-dc85-11ea-9058-af578f3b4515","first_name":"Konstantin","last_name":"Kueffner","full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542"},{"first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","last_name":"Mallik"}],"article_processing_charge":"Yes (in subscription journal)","external_id":{"arxiv":["2305.15979"]},"title":"Monitoring algorithmic fairness","citation":{"chicago":"Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness.” In Computer Aided Verification, 13965:358–382. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37703-7_17.","ista":"Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13965, 358–382.","mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness.” Computer Aided Verification, vol. 13965, Springer Nature, 2023, pp. 358–382, doi:10.1007/978-3-031-37703-7_17.","ama":"Henzinger TA, Karimi M, Kueffner K, Mallik K. Monitoring algorithmic fairness. In: Computer Aided Verification. Vol 13965. Springer Nature; 2023:358–382. doi:10.1007/978-3-031-37703-7_17","apa":"Henzinger, T. A., Karimi, M., Kueffner, K., & Mallik, K. (2023). Monitoring algorithmic fairness. In Computer Aided Verification (Vol. 13965, pp. 358–382). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37703-7_17","short":"T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, Computer Aided Verification, Springer Nature, 2023, pp. 358–382.","ieee":"T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness,” in Computer Aided Verification, Paris, France, 2023, vol. 13965, pp. 358–382."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"page":"358–382","date_published":"2023-07-18T00:00:00Z","doi":"10.1007/978-3-031-37703-7_17","date_created":"2023-07-25T18:32:40Z","has_accepted_license":"1","year":"2023","day":"18","publication":"Computer Aided Verification","publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG101020093."},{"date_updated":"2023-09-05T15:18:37Z","ddc":["610"],"department":[{"_id":"JoDa"}],"file_date_updated":"2023-02-02T13:01:20Z","_id":"12205","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","keyword":["Oncology","Surgery"],"status":"public","publication_status":"published","publication_identifier":{"eissn":["1534-4681"],"issn":["1068-9265"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"12490","checksum":"36a1200e1011f4b2155a8041d0308f34","creator":"dernst","file_size":365865,"date_updated":"2023-02-02T13:01:20Z","file_name":"2023_AnnalsSurgicalOncology_Glajzer.pdf","date_created":"2023-02-02T13:01:20Z"}],"related_material":{"record":[{"status":"public","id":"12115","relation":"other"}]},"volume":30,"abstract":[{"lang":"eng","text":"Background: This study seeks to evaluate the impact of breast cancer (BRCA) gene status on tumor dissemination pattern, surgical outcome and survival in a multicenter cohort of paired primary ovarian cancer (pOC) and recurrent ovarian cancer (rOC).\r\n\r\nPatients and Methods: Medical records and follow-up data from 190 patients were gathered retrospectively. All patients had surgery at pOC and at least one further rOC surgery at four European high-volume centers. Patients were divided into one cohort with confirmed mutation for BRCA1 and/or BRCA2 (BRCAmut) and a second cohort with BRCA wild type or unknown (BRCAwt). Patterns of tumor presentation, surgical outcome and survival data were analyzed between the two groups.\r\n\r\nResults: Patients with BRCAmut disease were on average 4 years younger and had significantly more tumor involvement upon diagnosis. Patients with BRCAmut disease showed higher debulking rates at all stages. Multivariate analysis showed that only patient age had significant predictive value for complete tumor resection in pOC. At rOC, however, only BRCAmut status significantly correlated with optimal debulking. Patients with BRCAmut disease showed significantly prolonged overall survival (OS) by 24.3 months. Progression-free survival (PFS) was prolonged in the BRCAmut group at all stages as well, reaching statistical significance during recurrence.\r\n\r\nConclusions: Patients with BRCAmut disease showed a more aggressive course of disease with earlier onset and more extensive tumor dissemination at pOC. However, surgical outcome and OS were significantly better in patients with BRCAmut disease compared with patients with BRCAwt disease. We therefore propose to consider BRCAmut status in regard to patient selection for cytoreductive surgery, especially in rOC."}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 30","month":"01","citation":{"chicago":"Glajzer, Jacek, Dan Cacsire Castillo-Tong, Rolf Richter, Ignace Vergote, Hagen Kulbe, Adriaan Vanderstichele, Ilary Ruscito, et al. “Impact of BRCA Mutation Status on Tumor Dissemination Pattern, Surgical Outcome and Patient Survival in Primary and Recurrent High-Grade Serous Ovarian Cancer: A Multicenter Retrospective Study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) Consortium.” Annals of Surgical Oncology. Springer Nature, 2023. https://doi.org/10.1245/s10434-022-12459-3.","ista":"Glajzer J, Castillo-Tong DC, Richter R, Vergote I, Kulbe H, Vanderstichele A, Ruscito I, Trillsch F, Mustea A, Kreuzinger C, Gourley C, Gabra H, Taube ET, Dorigo O, Horst D, Keunecke C, Baum J, Angelotti T, Sehouli J, Braicu EI. 2023. Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium. Annals of Surgical Oncology. 30, 35–45.","mla":"Glajzer, Jacek, et al. “Impact of BRCA Mutation Status on Tumor Dissemination Pattern, Surgical Outcome and Patient Survival in Primary and Recurrent High-Grade Serous Ovarian Cancer: A Multicenter Retrospective Study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) Consortium.” Annals of Surgical Oncology, vol. 30, Springer Nature, 2023, pp. 35–45, doi:10.1245/s10434-022-12459-3.","ieee":"J. Glajzer et al., “Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium,” Annals of Surgical Oncology, vol. 30. Springer Nature, pp. 35–45, 2023.","short":"J. Glajzer, D.C. Castillo-Tong, R. Richter, I. Vergote, H. Kulbe, A. Vanderstichele, I. Ruscito, F. Trillsch, A. Mustea, C. Kreuzinger, C. Gourley, H. Gabra, E.T. Taube, O. Dorigo, D. Horst, C. Keunecke, J. Baum, T. Angelotti, J. Sehouli, E.I. Braicu, Annals of Surgical Oncology 30 (2023) 35–45.","ama":"Glajzer J, Castillo-Tong DC, Richter R, et al. Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium. Annals of Surgical Oncology. 2023;30:35-45. doi:10.1245/s10434-022-12459-3","apa":"Glajzer, J., Castillo-Tong, D. C., Richter, R., Vergote, I., Kulbe, H., Vanderstichele, A., … Braicu, E. I. (2023). Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium. Annals of Surgical Oncology. Springer Nature. https://doi.org/10.1245/s10434-022-12459-3"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000852125500006"]},"article_processing_charge":"No","author":[{"full_name":"Glajzer, Jacek","last_name":"Glajzer","first_name":"Jacek"},{"full_name":"Castillo-Tong, Dan Cacsire","last_name":"Castillo-Tong","first_name":"Dan Cacsire"},{"last_name":"Richter","full_name":"Richter, Rolf","first_name":"Rolf"},{"full_name":"Vergote, Ignace","last_name":"Vergote","first_name":"Ignace"},{"first_name":"Hagen","last_name":"Kulbe","full_name":"Kulbe, Hagen"},{"full_name":"Vanderstichele, Adriaan","last_name":"Vanderstichele","first_name":"Adriaan"},{"first_name":"Ilary","full_name":"Ruscito, Ilary","last_name":"Ruscito"},{"first_name":"Fabian","last_name":"Trillsch","full_name":"Trillsch, Fabian"},{"first_name":"Alexander","full_name":"Mustea, Alexander","last_name":"Mustea"},{"last_name":"Kreuzinger","full_name":"Kreuzinger, Caroline","first_name":"Caroline","id":"382077BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gourley, Charlie","last_name":"Gourley","first_name":"Charlie"},{"last_name":"Gabra","full_name":"Gabra, Hani","first_name":"Hani"},{"first_name":"Eliane T.","last_name":"Taube","full_name":"Taube, Eliane T."},{"full_name":"Dorigo, Oliver","last_name":"Dorigo","first_name":"Oliver"},{"first_name":"David","last_name":"Horst","full_name":"Horst, David"},{"first_name":"Carlotta","last_name":"Keunecke","full_name":"Keunecke, Carlotta"},{"full_name":"Baum, Joanna","last_name":"Baum","first_name":"Joanna"},{"last_name":"Angelotti","full_name":"Angelotti, Timothy","first_name":"Timothy"},{"last_name":"Sehouli","full_name":"Sehouli, Jalid","first_name":"Jalid"},{"first_name":"Elena Ioana","full_name":"Braicu, Elena Ioana","last_name":"Braicu"}],"title":"Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium","year":"2023","isi":1,"has_accepted_license":"1","publication":"Annals of Surgical Oncology","day":"01","page":"35-45","date_created":"2023-01-16T09:44:36Z","date_published":"2023-01-01T00:00:00Z","doi":"10.1245/s10434-022-12459-3","acknowledgement":"E.I.B. is a Feodor Lynen fellow of the Humboldt Foundation and a participant of the Charité Clinical Scientist Program funded by the Charité Universitätsmedizin Berlin and the Berlin Institute of Health. This work was supported by European Commission’s Seventh Framework Programme under grant agreement no. 279113 (OCTIPS; www.octips.eu).\r\nOpen Access funding enabled and organized by Projekt DEAL.","oa":1,"quality_controlled":"1","publisher":"Springer Nature"},{"department":[{"_id":"JoDa"}],"date_updated":"2023-09-05T15:18:36Z","article_type":"original","type":"journal_article","status":"public","keyword":["Oncology","Surgery"],"_id":"12115","volume":30,"related_material":{"record":[{"relation":"other","status":"public","id":"12205"}]},"publication_identifier":{"eissn":["1534-4681"],"issn":["1068-9265"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1245/s10434-022-12681-z"}],"month":"01","intvolume":" 30","oa_version":"Published Version","author":[{"full_name":"Glajzer, Jacek","last_name":"Glajzer","first_name":"Jacek"},{"first_name":"Dan Cacsire","full_name":"Castillo-Tong, Dan Cacsire","last_name":"Castillo-Tong"},{"first_name":"Rolf","full_name":"Richter, Rolf","last_name":"Richter"},{"first_name":"Ignace","last_name":"Vergote","full_name":"Vergote, Ignace"},{"last_name":"Kulbe","full_name":"Kulbe, Hagen","first_name":"Hagen"},{"full_name":"Vanderstichele, Adriaan","last_name":"Vanderstichele","first_name":"Adriaan"},{"last_name":"Ruscito","full_name":"Ruscito, Ilary","first_name":"Ilary"},{"last_name":"Trillsch","full_name":"Trillsch, Fabian","first_name":"Fabian"},{"first_name":"Alexander","full_name":"Mustea, Alexander","last_name":"Mustea"},{"id":"382077BA-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","last_name":"Kreuzinger","full_name":"Kreuzinger, Caroline"},{"first_name":"Charlie","last_name":"Gourley","full_name":"Gourley, Charlie"},{"full_name":"Gabra, Hani","last_name":"Gabra","first_name":"Hani"},{"last_name":"Taube","full_name":"Taube, Eliane T.","first_name":"Eliane T."},{"full_name":"Dorigo, Oliver","last_name":"Dorigo","first_name":"Oliver"},{"full_name":"Horst, David","last_name":"Horst","first_name":"David"},{"full_name":"Keunecke, Carlotta","last_name":"Keunecke","first_name":"Carlotta"},{"full_name":"Baum, Joanna","last_name":"Baum","first_name":"Joanna"},{"first_name":"Timothy","last_name":"Angelotti","full_name":"Angelotti, Timothy"},{"first_name":"Jalid","last_name":"Sehouli","full_name":"Sehouli, Jalid"},{"first_name":"Elena Ioana","last_name":"Braicu","full_name":"Braicu, Elena Ioana"}],"article_processing_charge":"No","external_id":{"isi":["000879151800001"]},"title":"ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium","citation":{"chicago":"Glajzer, Jacek, Dan Cacsire Castillo-Tong, Rolf Richter, Ignace Vergote, Hagen Kulbe, Adriaan Vanderstichele, Ilary Ruscito, et al. “ASO Visual Abstract: Impact of BRCA Mutation Status on Tumor Dissemination Pattern, Surgical Outcome, and Patient Survival in Primary and Recurrent High-Grade Serous Ovarian Cancer (HGSOC). A Multicenter, Retrospective Study of the Ovarian Cancer Therapy—Innovative Models Prolong Survival (OCTIPS) Consortium.” Annals of Surgical Oncology. Springer Nature, 2023. https://doi.org/10.1245/s10434-022-12681-z.","ista":"Glajzer J, Castillo-Tong DC, Richter R, Vergote I, Kulbe H, Vanderstichele A, Ruscito I, Trillsch F, Mustea A, Kreuzinger C, Gourley C, Gabra H, Taube ET, Dorigo O, Horst D, Keunecke C, Baum J, Angelotti T, Sehouli J, Braicu EI. 2023. ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium. Annals of Surgical Oncology. 30, 46–47.","mla":"Glajzer, Jacek, et al. “ASO Visual Abstract: Impact of BRCA Mutation Status on Tumor Dissemination Pattern, Surgical Outcome, and Patient Survival in Primary and Recurrent High-Grade Serous Ovarian Cancer (HGSOC). A Multicenter, Retrospective Study of the Ovarian Cancer Therapy—Innovative Models Prolong Survival (OCTIPS) Consortium.” Annals of Surgical Oncology, vol. 30, Springer Nature, 2023, pp. 46–47, doi:10.1245/s10434-022-12681-z.","apa":"Glajzer, J., Castillo-Tong, D. C., Richter, R., Vergote, I., Kulbe, H., Vanderstichele, A., … Braicu, E. I. (2023). ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium. Annals of Surgical Oncology. Springer Nature. https://doi.org/10.1245/s10434-022-12681-z","ama":"Glajzer J, Castillo-Tong DC, Richter R, et al. ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium. Annals of Surgical Oncology. 2023;30:46-47. doi:10.1245/s10434-022-12681-z","ieee":"J. Glajzer et al., “ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium,” Annals of Surgical Oncology, vol. 30. Springer Nature, pp. 46–47, 2023.","short":"J. Glajzer, D.C. Castillo-Tong, R. Richter, I. Vergote, H. Kulbe, A. Vanderstichele, I. Ruscito, F. Trillsch, A. Mustea, C. Kreuzinger, C. Gourley, H. Gabra, E.T. Taube, O. Dorigo, D. Horst, C. Keunecke, J. Baum, T. Angelotti, J. Sehouli, E.I. Braicu, Annals of Surgical Oncology 30 (2023) 46–47."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"46-47","doi":"10.1245/s10434-022-12681-z","date_published":"2023-01-01T00:00:00Z","date_created":"2023-01-12T11:56:22Z","isi":1,"year":"2023","day":"01","publication":"Annals of Surgical Oncology","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"This work was supported by European Commission’s Seventh Framework Programme under Grant Agreement No. 279113 (OCTIPS; www.octips.eu)."},{"date_created":"2023-09-03T22:01:14Z","date_published":"2023-08-26T00:00:00Z","doi":"10.1038/s41467-023-40930-6","year":"2023","has_accepted_license":"1","publication":"Nature Communications","day":"26","oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"We thank Kayla Templeton and Peter Turcanu for technical assistance, Michelle Salemi for assistance with LC-MS data acquisition and analysis, Dr. Belvin Gong for advice on monoclonal antibody generation, Drs. Maria Casas Prat and Eamonn Dickson for assistance with super-resolution TIRF microscopy, Dr. Oscar Cerda for assistance with the design of TAT-FFAT peptides, Dr. Fernando Santana for helpful discussions, and Dr. Jodi Nunnari for a careful reading of our manuscript. We also thank Dr. Alan Howe, Dr. Sohum Mehta, and Dr. Jin Zhang for providing plasmids used in this study. This project was funded by NIH Grants R01NS114210 and R21NS101648 (J.S.T.), and F32NS108519 (N.C.V.).","external_id":{"pmid":["37633939"]},"article_processing_charge":"Yes","author":[{"last_name":"Vierra","full_name":"Vierra, Nicholas C.","first_name":"Nicholas C."},{"first_name":"Luisa","full_name":"Ribeiro-Silva, Luisa","last_name":"Ribeiro-Silva"},{"last_name":"Kirmiz","full_name":"Kirmiz, Michael","first_name":"Michael"},{"full_name":"Van Der List, Deborah","last_name":"Van Der List","first_name":"Deborah"},{"last_name":"Bhandari","orcid":"0000-0003-0863-4481","full_name":"Bhandari, Pradeep","id":"45EDD1BC-F248-11E8-B48F-1D18A9856A87","first_name":"Pradeep"},{"full_name":"Mack, Olivia A.","last_name":"Mack","first_name":"Olivia A."},{"first_name":"James","last_name":"Carroll","full_name":"Carroll, James"},{"last_name":"Le Monnier","full_name":"Le Monnier, Elodie","first_name":"Elodie","id":"3B59276A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sue A.","last_name":"Aicher","full_name":"Aicher, Sue A."},{"full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"James S.","last_name":"Trimmer","full_name":"Trimmer, James S."}],"title":"Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling","citation":{"ista":"Vierra NC, Ribeiro-Silva L, Kirmiz M, Van Der List D, Bhandari P, Mack OA, Carroll J, Le Monnier E, Aicher SA, Shigemoto R, Trimmer JS. 2023. Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling. Nature Communications. 14, 5231.","chicago":"Vierra, Nicholas C., Luisa Ribeiro-Silva, Michael Kirmiz, Deborah Van Der List, Pradeep Bhandari, Olivia A. Mack, James Carroll, et al. “Neuronal ER-Plasma Membrane Junctions Couple Excitation to Ca2+-Activated PKA Signaling.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-40930-6.","ieee":"N. C. Vierra et al., “Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling,” Nature Communications, vol. 14. Springer Nature, 2023.","short":"N.C. Vierra, L. Ribeiro-Silva, M. Kirmiz, D. Van Der List, P. Bhandari, O.A. Mack, J. Carroll, E. Le Monnier, S.A. Aicher, R. Shigemoto, J.S. Trimmer, Nature Communications 14 (2023).","apa":"Vierra, N. C., Ribeiro-Silva, L., Kirmiz, M., Van Der List, D., Bhandari, P., Mack, O. A., … Trimmer, J. S. (2023). Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-023-40930-6","ama":"Vierra NC, Ribeiro-Silva L, Kirmiz M, et al. Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling. Nature Communications. 2023;14. doi:10.1038/s41467-023-40930-6","mla":"Vierra, Nicholas C., et al. “Neuronal ER-Plasma Membrane Junctions Couple Excitation to Ca2+-Activated PKA Signaling.” Nature Communications, vol. 14, 5231, Springer Nature, 2023, doi:10.1038/s41467-023-40930-6."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"5231","volume":14,"publication_status":"published","publication_identifier":{"eissn":["2041-1723"]},"language":[{"iso":"eng"}],"file":[{"checksum":"6ab8aab4e957f626a09a1c73db3388fb","file_id":"14270","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-09-06T06:50:07Z","file_name":"2023_NatureComm_Vierra.pdf","date_updated":"2023-09-06T06:50:07Z","file_size":9412549,"creator":"dernst"}],"scopus_import":"1","intvolume":" 14","month":"08","abstract":[{"text":"Junctions between the endoplasmic reticulum (ER) and the plasma membrane (PM) are specialized membrane contacts ubiquitous in eukaryotic cells. Concentration of intracellular signaling machinery near ER-PM junctions allows these domains to serve critical roles in lipid and Ca2+ signaling and homeostasis. Subcellular compartmentalization of protein kinase A (PKA) signaling also regulates essential cellular functions, however, no specific association between PKA and ER-PM junctional domains is known. Here, we show that in brain neurons type I PKA is directed to Kv2.1 channel-dependent ER-PM junctional domains via SPHKAP, a type I PKA-specific anchoring protein. SPHKAP association with type I PKA regulatory subunit RI and ER-resident VAP proteins results in the concentration of type I PKA between stacked ER cisternae associated with ER-PM junctions. This ER-associated PKA signalosome enables reciprocal regulation between PKA and Ca2+ signaling machinery to support Ca2+ influx and excitation-transcription coupling. These data reveal that neuronal ER-PM junctions support a receptor-independent form of PKA signaling driven by membrane depolarization and intracellular Ca2+, allowing conversion of information encoded in electrical signals into biochemical changes universally recognized throughout the cell.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","department":[{"_id":"RySh"}],"file_date_updated":"2023-09-06T06:50:07Z","date_updated":"2023-09-06T06:53:32Z","ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","_id":"14253"},{"file_date_updated":"2023-09-06T08:25:50Z","department":[{"_id":"KrCh"}],"date_updated":"2023-09-06T08:27:33Z","ddc":["000"],"type":"conference","conference":{"end_date":"2023-07-22","location":"Paris, France","start_date":"2023-07-17","name":"CAV: Computer Aided Verification"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"14259","volume":13964,"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031377051"],"issn":["0302-9743"]},"publication_status":"published","file":[{"date_created":"2023-09-06T08:25:50Z","file_name":"2023_LNCS_CAV_Kretinsky.pdf","date_updated":"2023-09-06T08:25:50Z","file_size":428354,"creator":"dernst","checksum":"ed66278b61bb869e1baba3d9b9081271","file_id":"14276","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"scopus_import":"1","alternative_title":["LNCS"],"month":"07","intvolume":" 13964","abstract":[{"lang":"eng","text":"We provide a learning-based technique for guessing a winning strategy in a parity game originating from an LTL synthesis problem. A cheaply obtained guess can be useful in several applications. Not only can the guessed strategy be applied as best-effort in cases where the game’s huge size prohibits rigorous approaches, but it can also increase the scalability of rigorous LTL synthesis in several ways. Firstly, checking whether a guessed strategy is winning is easier than constructing one. Secondly, even if the guess is wrong in some places, it can be fixed by strategy iteration faster than constructing one from scratch. Thirdly, the guess can be used in on-the-fly approaches to prioritize exploration in the most fruitful directions.\r\nIn contrast to previous works, we (i) reflect the highly structured logical information in game’s states, the so-called semantic labelling, coming from the recent LTL-to-automata translations, and (ii) learn to reflect it properly by learning from previously solved games, bringing the solving process closer to human-like reasoning."}],"oa_version":"Published Version","author":[{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"},{"last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"first_name":"Maximilian","last_name":"Prokop","full_name":"Prokop, Maximilian"},{"first_name":"Sabine","full_name":"Rieder, Sabine","last_name":"Rieder"}],"article_processing_charge":"Yes (in subscription journal)","title":"Guessing winning policies in LTL synthesis by semantic learning","citation":{"mla":"Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” 35th International Conference on Computer Aided Verification , vol. 13964, Springer Nature, 2023, pp. 390–414, doi:10.1007/978-3-031-37706-8_20.","short":"J. Kretinsky, T. Meggendorfer, M. Prokop, S. Rieder, in:, 35th International Conference on Computer Aided Verification , Springer Nature, 2023, pp. 390–414.","ieee":"J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning policies in LTL synthesis by semantic learning,” in 35th International Conference on Computer Aided Verification , Paris, France, 2023, vol. 13964, pp. 390–414.","apa":"Kretinsky, J., Meggendorfer, T., Prokop, M., & Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In 35th International Conference on Computer Aided Verification (Vol. 13964, pp. 390–414). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_20","ama":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. Guessing winning policies in LTL synthesis by semantic learning. In: 35th International Conference on Computer Aided Verification . Vol 13964. Springer Nature; 2023:390-414. doi:10.1007/978-3-031-37706-8_20","chicago":"Kretinsky, Jan, Tobias Meggendorfer, Maximilian Prokop, and Sabine Rieder. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” In 35th International Conference on Computer Aided Verification , 13964:390–414. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37706-8_20.","ista":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. 2023. Guessing winning policies in LTL synthesis by semantic learning. 35th International Conference on Computer Aided Verification . CAV: Computer Aided Verification, LNCS, vol. 13964, 390–414."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"390-414","date_published":"2023-07-17T00:00:00Z","doi":"10.1007/978-3-031-37706-8_20","date_created":"2023-09-03T22:01:16Z","has_accepted_license":"1","year":"2023","day":"17","publication":"35th International Conference on Computer Aided Verification ","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"This research was funded in part by the German Research Foundation (DFG) project 427755713 Group-By Objectives in Probabilistic Verification (GOPro)."},{"date_created":"2023-08-21T12:11:38Z","date_published":"2023-02-06T00:00:00Z","doi":"10.1109/wacv56688.2023.00278","publication":"2023 IEEE/CVF Winter Conference on Applications of Computer Vision","language":[{"iso":"eng"}],"day":"06","year":"2023","publication_status":"published","publication_identifier":{"isbn":["9781665493475"],"eissn":["2642-9381"]},"month":"02","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2209.11459","open_access":"1"}],"publisher":"Institute of Electrical and Electronics Engineers","quality_controlled":"1","scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"Despite their recent success, deep neural networks continue to perform poorly when they encounter distribution shifts at test time. Many recently proposed approaches try to counter this by aligning the model to the new distribution prior to inference. With no labels available this requires unsupervised objectives to adapt the model on the observed test data. In this paper, we propose Test-Time SelfTraining (TeST): a technique that takes as input a model trained on some source data and a novel data distribution at test time, and learns invariant and robust representations using a student-teacher framework. We find that models adapted using TeST significantly improve over baseline testtime adaptation algorithms. TeST achieves competitive performance to modern domain adaptation algorithms [4, 43], while having access to 5-10x less data at time of adaption. We thoroughly evaluate a variety of baselines on two tasks:\r\nobject detection and image segmentation and find that models adapted with TeST. We find that TeST sets the new stateof-the art for test-time domain adaptation algorithms. ","lang":"eng"}],"title":"TeST: Test-time Self-Training under distribution shift","department":[{"_id":"FrLo"}],"external_id":{"arxiv":["2209.11459"]},"article_processing_charge":"No","author":[{"first_name":"Samarth","last_name":"Sinha","full_name":"Sinha, Samarth"},{"first_name":"Peter","last_name":"Gehler","full_name":"Gehler, Peter"},{"last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"full_name":"Schiele, Bernt","last_name":"Schiele","first_name":"Bernt"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2023-09-06T10:26:56Z","citation":{"short":"S. Sinha, P. Gehler, F. Locatello, B. Schiele, in:, 2023 IEEE/CVF Winter Conference on Applications of Computer Vision, Institute of Electrical and Electronics Engineers, 2023.","ieee":"S. Sinha, P. Gehler, F. Locatello, and B. Schiele, “TeST: Test-time Self-Training under distribution shift,” in 2023 IEEE/CVF Winter Conference on Applications of Computer Vision, Waikoloa, HI, United States, 2023.","apa":"Sinha, S., Gehler, P., Locatello, F., & Schiele, B. (2023). TeST: Test-time Self-Training under distribution shift. In 2023 IEEE/CVF Winter Conference on Applications of Computer Vision. Waikoloa, HI, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/wacv56688.2023.00278","ama":"Sinha S, Gehler P, Locatello F, Schiele B. TeST: Test-time Self-Training under distribution shift. In: 2023 IEEE/CVF Winter Conference on Applications of Computer Vision. Institute of Electrical and Electronics Engineers; 2023. doi:10.1109/wacv56688.2023.00278","mla":"Sinha, Samarth, et al. “TeST: Test-Time Self-Training under Distribution Shift.” 2023 IEEE/CVF Winter Conference on Applications of Computer Vision, Institute of Electrical and Electronics Engineers, 2023, doi:10.1109/wacv56688.2023.00278.","ista":"Sinha S, Gehler P, Locatello F, Schiele B. 2023. TeST: Test-time Self-Training under distribution shift. 2023 IEEE/CVF Winter Conference on Applications of Computer Vision. WACV: Winter Conference on Applications of Computer Vision.","chicago":"Sinha, Samarth, Peter Gehler, Francesco Locatello, and Bernt Schiele. “TeST: Test-Time Self-Training under Distribution Shift.” In 2023 IEEE/CVF Winter Conference on Applications of Computer Vision. Institute of Electrical and Electronics Engineers, 2023. https://doi.org/10.1109/wacv56688.2023.00278."},"status":"public","conference":{"location":"Waikoloa, HI, United States","end_date":"2023-01-07","start_date":"2023-01-02","name":"WACV: Winter Conference on Applications of Computer Vision"},"type":"conference","_id":"14105"},{"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"letter_note","type":"journal_article","_id":"14256","file_date_updated":"2023-09-06T07:13:19Z","department":[{"_id":"LiBu"}],"ddc":["520"],"date_updated":"2023-09-06T11:05:58Z","intvolume":" 676","month":"08","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Context. Space asteroseismology is revolutionizing our knowledge of the internal structure and dynamics of stars. A breakthrough is ongoing with the recent discoveries of signatures of strong magnetic fields in the core of red giant stars. The key signature for such a detection is the asymmetry these fields induce in the frequency splittings of observed dipolar mixed gravito-acoustic modes.\r\nAims. We investigate the ability of the observed asymmetries of the frequency splittings of dipolar mixed modes to constrain the geometrical properties of deep magnetic fields.\r\nMethods. We used the powerful analytical Racah-Wigner algebra used in quantum mechanics to characterize the geometrical couplings of dipolar mixed oscillation modes with various realistically plausible topologies of fossil magnetic fields. We also computed the induced perturbation of their frequencies.\r\nResults. First, in the case of an oblique magnetic dipole, we provide the exact analytical expression of the asymmetry as a function of the angle between the rotation and magnetic axes. Its value provides a direct measure of this angle. Second, considering a combination of axisymmetric dipolar and quadrupolar fields, we show how the asymmetry is blind to the unraveling of the relative strength and sign of each component. Finally, in the case of a given multipole, we show that a negative asymmetry is a signature of non-axisymmetric topologies.\r\nConclusions. Asymmetries of dipolar mixed modes provide a key bit of information on the geometrical topology of deep fossil magnetic fields, but this is insufficient on its own. Asteroseismic constraints should therefore be combined with spectropolarimetric observations and numerical simulations, which aim to predict the more probable stable large-scale geometries.","lang":"eng"}],"volume":676,"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"14271","checksum":"7b30d26fb2b7bcb5b5be1414950615f9","creator":"dernst","file_size":458120,"date_updated":"2023-09-06T07:13:19Z","file_name":"2023_AstronomyAstrophysics_Mathis.pdf","date_created":"2023-09-06T07:13:19Z"}],"publication_status":"published","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"article_number":"L9","title":"Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields","article_processing_charge":"Yes (in subscription journal)","external_id":{"arxiv":["2306.11587"],"isi":["001046037700007"]},"author":[{"last_name":"Mathis","full_name":"Mathis, S.","first_name":"S."},{"orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Mathis, S., and Lisa Annabelle Bugnet. “Asymmetries of Frequency Splittings of Dipolar Mixed Modes: A Window on the Topology of Deep Magnetic Fields.” Astronomy and Astrophysics. EDP Sciences, 2023. https://doi.org/10.1051/0004-6361/202346832.","ista":"Mathis S, Bugnet LA. 2023. Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields. Astronomy and Astrophysics. 676, L9.","mla":"Mathis, S., and Lisa Annabelle Bugnet. “Asymmetries of Frequency Splittings of Dipolar Mixed Modes: A Window on the Topology of Deep Magnetic Fields.” Astronomy and Astrophysics, vol. 676, L9, EDP Sciences, 2023, doi:10.1051/0004-6361/202346832.","ama":"Mathis S, Bugnet LA. Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields. Astronomy and Astrophysics. 2023;676. doi:10.1051/0004-6361/202346832","apa":"Mathis, S., & Bugnet, L. A. (2023). Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields. Astronomy and Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202346832","ieee":"S. Mathis and L. A. Bugnet, “Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields,” Astronomy and Astrophysics, vol. 676. EDP Sciences, 2023.","short":"S. Mathis, L.A. Bugnet, Astronomy and Astrophysics 676 (2023)."},"oa":1,"quality_controlled":"1","publisher":"EDP Sciences","acknowledgement":"The authors are grateful to the referee for her/his detailed and constructive report, which has allowed us to improve our article. S. M. acknowledges support from the CNES GOLF-SOHO and PLATO grants at CEA/DAp and PNPS (CNRS/INSU). We thank R. A. Garcia for fruitful discussions and suggestions.","date_created":"2023-09-03T22:01:15Z","date_published":"2023-08-01T00:00:00Z","doi":"10.1051/0004-6361/202346832","publication":"Astronomy and Astrophysics","day":"01","year":"2023","has_accepted_license":"1","isi":1},{"scopus_import":"1","month":"08","intvolume":" 14","abstract":[{"text":"In this work, a generalized, adapted Numerov implementation capable of determining band structures of periodic quantum systems is outlined. Based on the input potential, the presented approach numerically solves the Schrödinger equation in position space at each momentum space point. Thus, in addition to the band structure, the method inherently provides information about the state functions and probability densities in position space at each momentum space point considered. The generalized, adapted Numerov framework provided reliable estimates for a variety of increasingly complex test suites in one, two, and three dimensions. The accuracy of the proposed methodology was benchmarked against results obtained for the analytically solvable Kronig-Penney model. Furthermore, the presented numerical solver was applied to a model potential representing a 2D optical lattice being a challenging application relevant, for example, in the field of quantum computing.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","issue":"33","volume":14,"publication_identifier":{"eissn":["1948-7185"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"637454e2b3a357498d8d622d241c4bf6","file_id":"14272","creator":"dernst","file_size":4986859,"date_updated":"2023-09-06T07:32:39Z","file_name":"2023_JourPhysChemistry_Gamper.pdf","date_created":"2023-09-06T07:32:39Z"}],"language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"14261","department":[{"_id":"GradSch"}],"file_date_updated":"2023-09-06T07:32:39Z","date_updated":"2023-09-06T11:04:31Z","ddc":["530","540"],"publisher":"American Chemical Society","quality_controlled":"1","oa":1,"acknowledgement":"Financial supports for this work via a PhD scholarship for J. Gamper issued by the Leopold-Franzens-University of Innsbruck (Vicerector Prof. Dr Ulrike Tanzer) are gratefully acknowledged. The computational results presented have been achieved (in part) using the HPC infrastructure of the University of Innsbruck.","page":"7395-7403","doi":"10.1021/acs.jpclett.3c01707","date_published":"2023-08-11T00:00:00Z","date_created":"2023-09-03T22:01:16Z","has_accepted_license":"1","isi":1,"year":"2023","day":"11","publication":"Journal of Physical Chemistry Letters","author":[{"first_name":"Jakob","last_name":"Gamper","full_name":"Gamper, Jakob"},{"last_name":"Kluibenschedl","full_name":"Kluibenschedl, Florian","id":"7499e70e-eb2c-11ec-b98b-f925648bc9d9","first_name":"Florian"},{"first_name":"Alexander K.H.","full_name":"Weiss, Alexander K.H.","last_name":"Weiss"},{"last_name":"Hofer","full_name":"Hofer, Thomas S.","first_name":"Thomas S."}],"article_processing_charge":"Yes (in subscription journal)","external_id":{"pmid":["37566743"],"isi":["001048165800001"]},"title":"Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems","citation":{"ieee":"J. Gamper, F. Kluibenschedl, A. K. H. Weiss, and T. S. Hofer, “Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems,” Journal of Physical Chemistry Letters, vol. 14, no. 33. American Chemical Society, pp. 7395–7403, 2023.","short":"J. Gamper, F. Kluibenschedl, A.K.H. Weiss, T.S. Hofer, Journal of Physical Chemistry Letters 14 (2023) 7395–7403.","apa":"Gamper, J., Kluibenschedl, F., Weiss, A. K. H., & Hofer, T. S. (2023). Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems. Journal of Physical Chemistry Letters. American Chemical Society. https://doi.org/10.1021/acs.jpclett.3c01707","ama":"Gamper J, Kluibenschedl F, Weiss AKH, Hofer TS. Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems. Journal of Physical Chemistry Letters. 2023;14(33):7395-7403. doi:10.1021/acs.jpclett.3c01707","mla":"Gamper, Jakob, et al. “Accessing Position Space Wave Functions in Band Structure Calculations of Periodic Systems - a Generalized, Adapted Numerov Implementation for One-, Two-, and Three-Dimensional Quantum Problems.” Journal of Physical Chemistry Letters, vol. 14, no. 33, American Chemical Society, 2023, pp. 7395–403, doi:10.1021/acs.jpclett.3c01707.","ista":"Gamper J, Kluibenschedl F, Weiss AKH, Hofer TS. 2023. Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems. Journal of Physical Chemistry Letters. 14(33), 7395–7403.","chicago":"Gamper, Jakob, Florian Kluibenschedl, Alexander K.H. Weiss, and Thomas S. Hofer. “Accessing Position Space Wave Functions in Band Structure Calculations of Periodic Systems - a Generalized, Adapted Numerov Implementation for One-, Two-, and Three-Dimensional Quantum Problems.” Journal of Physical Chemistry Letters. American Chemical Society, 2023. https://doi.org/10.1021/acs.jpclett.3c01707."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"oa":1,"publisher":"ML Research Press","quality_controlled":"1","year":"2023","publication":"Proceedings of the 40th International Conference on Machine Learning","day":"30","page":"43105-43128","date_created":"2023-08-22T14:18:18Z","date_published":"2023-05-30T00:00:00Z","citation":{"mla":"Zhu, Zhenyu, et al. “Benign Overfitting in Deep Neural Networks under Lazy Training.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 43105–28.","ama":"Zhu Z, Liu F, Chrysos GG, Locatello F, Cevher V. Benign overfitting in deep neural networks under lazy training. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:43105-43128.","apa":"Zhu, Z., Liu, F., Chrysos, G. G., Locatello, F., & Cevher, V. (2023). Benign overfitting in deep neural networks under lazy training. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 43105–43128). Honolulu, Hawaii, United States: ML Research Press.","ieee":"Z. Zhu, F. Liu, G. G. Chrysos, F. Locatello, and V. Cevher, “Benign overfitting in deep neural networks under lazy training,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, United States, 2023, vol. 202, pp. 43105–43128.","short":"Z. Zhu, F. Liu, G.G. Chrysos, F. Locatello, V. Cevher, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 43105–43128.","chicago":"Zhu, Zhenyu, Fanghui Liu, Grigorios G Chrysos, Francesco Locatello, and Volkan Cevher. “Benign Overfitting in Deep Neural Networks under Lazy Training.” In Proceedings of the 40th International Conference on Machine Learning, 202:43105–28. ML Research Press, 2023.","ista":"Zhu Z, Liu F, Chrysos GG, Locatello F, Cevher V. 2023. Benign overfitting in deep neural networks under lazy training. Proceedings of the 40th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 202, 43105–43128."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2305.19377"]},"article_processing_charge":"No","author":[{"first_name":"Zhenyu","last_name":"Zhu","full_name":"Zhu, Zhenyu"},{"first_name":"Fanghui","full_name":"Liu, Fanghui","last_name":"Liu"},{"full_name":"Chrysos, Grigorios G","last_name":"Chrysos","first_name":"Grigorios G"},{"last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"first_name":"Volkan","full_name":"Cevher, Volkan","last_name":"Cevher"}],"title":"Benign overfitting in deep neural networks under lazy training","abstract":[{"text":"This paper focuses on over-parameterized deep neural networks (DNNs) with ReLU activation functions and proves that when the data distribution is well-separated, DNNs can achieve Bayes-optimal test error for classification while obtaining (nearly) zero-training error under the lazy training regime. For this purpose, we unify three interrelated concepts of overparameterization, benign overfitting, and the Lipschitz constant of DNNs. Our results indicate that interpolating with smoother functions leads to better generalization. Furthermore, we investigate the special case where interpolating smooth ground-truth functions is performed by DNNs under the Neural Tangent Kernel (NTK) regime for generalization. Our result demonstrates that the generalization error converges to a constant order that only depends on label noise and initialization noise, which theoretically verifies benign overfitting. Our analysis provides a tight lower bound on the normalized margin under non-smooth activation functions, as well as the minimum eigenvalue of NTK under high-dimensional settings, which has its own interest in learning theory.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2305.19377","open_access":"1"}],"alternative_title":["PMLR"],"intvolume":" 202","month":"05","publication_status":"published","language":[{"iso":"eng"}],"volume":202,"_id":"14208","conference":{"start_date":"2023-07-23","location":"Honolulu, Hawaii, United States","end_date":"2023-07-29","name":"International Conference on Machine Learning"},"type":"conference","status":"public","date_updated":"2023-09-13T08:46:46Z","extern":"1","department":[{"_id":"FrLo"}]},{"date_created":"2023-08-22T14:18:43Z","date_published":"2023-04-20T00:00:00Z","doi":"10.48550/arXiv.2304.10253","language":[{"iso":"eng"}],"publication":"arXiv","day":"20","year":"2023","publication_status":"submitted","month":"04","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2304.10253"}],"oa":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Diffusion models excel at generating photorealistic images from text-queries. Naturally, many approaches have been proposed to use these generative abilities to augment training datasets for downstream tasks, such as classification. However, diffusion models are themselves trained on large noisily supervised, but nonetheless, annotated datasets. It is an open question whether the generalization capabilities of diffusion models beyond using the additional data of the pre-training process for augmentation lead to improved downstream performance. We perform a systematic evaluation of existing methods to generate images from diffusion models and study new extensions to assess their benefit for data augmentation. While we find that personalizing diffusion models towards the target data outperforms simpler prompting strategies, we also show that using the training data of the diffusion model alone, via a simple nearest neighbor retrieval procedure, leads to even stronger downstream performance. Overall, our study probes the limitations of diffusion models for data augmentation but also highlights its potential in generating new training data to improve performance on simple downstream vision tasks."}],"title":"A data augmentation perspective on diffusion models and retrieval","department":[{"_id":"FrLo"}],"external_id":{"arxiv":["2304.10253"]},"article_processing_charge":"No","author":[{"first_name":"Max F.","last_name":"Burg","full_name":"Burg, Max F."},{"first_name":"Florian","full_name":"Wenzel, Florian","last_name":"Wenzel"},{"first_name":"Dominik","last_name":"Zietlow","full_name":"Zietlow, Dominik"},{"full_name":"Horn, Max","last_name":"Horn","first_name":"Max"},{"last_name":"Makansi","full_name":"Makansi, Osama","first_name":"Osama"},{"orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"first_name":"Chris","last_name":"Russell","full_name":"Russell, Chris"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2023-09-13T08:51:56Z","citation":{"chicago":"Burg, Max F., Florian Wenzel, Dominik Zietlow, Max Horn, Osama Makansi, Francesco Locatello, and Chris Russell. “A Data Augmentation Perspective on Diffusion Models and Retrieval.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2304.10253.","ista":"Burg MF, Wenzel F, Zietlow D, Horn M, Makansi O, Locatello F, Russell C. A data augmentation perspective on diffusion models and retrieval. arXiv, 2304.10253.","mla":"Burg, Max F., et al. “A Data Augmentation Perspective on Diffusion Models and Retrieval.” ArXiv, 2304.10253, doi:10.48550/arXiv.2304.10253.","ieee":"M. F. Burg et al., “A data augmentation perspective on diffusion models and retrieval,” arXiv. .","short":"M.F. Burg, F. Wenzel, D. Zietlow, M. Horn, O. Makansi, F. Locatello, C. Russell, ArXiv (n.d.).","apa":"Burg, M. F., Wenzel, F., Zietlow, D., Horn, M., Makansi, O., Locatello, F., & Russell, C. (n.d.). A data augmentation perspective on diffusion models and retrieval. arXiv. https://doi.org/10.48550/arXiv.2304.10253","ama":"Burg MF, Wenzel F, Zietlow D, et al. A data augmentation perspective on diffusion models and retrieval. arXiv. doi:10.48550/arXiv.2304.10253"},"status":"public","type":"preprint","article_number":"2304.10253","_id":"14209"},{"date_created":"2023-08-22T14:19:21Z","date_published":"2023-04-01T00:00:00Z","publication":"2nd Conference on Causal Learning and Reasoning","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2023","month":"04","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2304.03265"}],"scopus_import":"1","quality_controlled":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Causal discovery methods are intrinsically constrained by the set of assumptions needed to ensure structure identifiability. Moreover additional restrictions are often imposed in order to simplify the inference task: this is the case for the Gaussian noise assumption on additive non-linear models, which is common to many causal discovery approaches. In this paper we show the shortcomings of inference under this hypothesis, analyzing the risk of edge inversion under violation of Gaussianity of the noise terms. Then, we propose a novel method for inferring the topological ordering of the variables in the causal graph, from data generated according to an additive non-linear model with a generic noise distribution. This leads to NoGAM (Not only Gaussian Additive noise Models), a causal discovery algorithm with a minimal set of assumptions and state of the art performance, experimentally benchmarked on synthetic data."}],"department":[{"_id":"FrLo"}],"title":"Causal discovery with score matching on additive models with arbitrary noise","article_processing_charge":"No","external_id":{"arxiv":["2304.03265"]},"author":[{"first_name":"Francesco","full_name":"Montagna, Francesco","last_name":"Montagna"},{"first_name":"Nicoletta","last_name":"Noceti","full_name":"Noceti, Nicoletta"},{"full_name":"Rosasco, Lorenzo","last_name":"Rosasco","first_name":"Lorenzo"},{"last_name":"Zhang","full_name":"Zhang, Kun","first_name":"Kun"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"mla":"Montagna, Francesco, et al. “Causal Discovery with Score Matching on Additive Models with Arbitrary Noise.” 2nd Conference on Causal Learning and Reasoning, 2023.","ama":"Montagna F, Noceti N, Rosasco L, Zhang K, Locatello F. Causal discovery with score matching on additive models with arbitrary noise. In: 2nd Conference on Causal Learning and Reasoning. ; 2023.","apa":"Montagna, F., Noceti, N., Rosasco, L., Zhang, K., & Locatello, F. (2023). Causal discovery with score matching on additive models with arbitrary noise. In 2nd Conference on Causal Learning and Reasoning. Tübingen, Germany.","short":"F. Montagna, N. Noceti, L. Rosasco, K. Zhang, F. Locatello, in:, 2nd Conference on Causal Learning and Reasoning, 2023.","ieee":"F. Montagna, N. Noceti, L. Rosasco, K. Zhang, and F. Locatello, “Causal discovery with score matching on additive models with arbitrary noise,” in 2nd Conference on Causal Learning and Reasoning, Tübingen, Germany, 2023.","chicago":"Montagna, Francesco, Nicoletta Noceti, Lorenzo Rosasco, Kun Zhang, and Francesco Locatello. “Causal Discovery with Score Matching on Additive Models with Arbitrary Noise.” In 2nd Conference on Causal Learning and Reasoning, 2023.","ista":"Montagna F, Noceti N, Rosasco L, Zhang K, Locatello F. 2023. Causal discovery with score matching on additive models with arbitrary noise. 2nd Conference on Causal Learning and Reasoning. CLeaR: Conference on Causal Learning and Reasoning."},"date_updated":"2023-09-13T09:00:31Z","status":"public","conference":{"start_date":"2023-04-11","location":"Tübingen, Germany","end_date":"2023-04-14","name":"CLeaR: Conference on Causal Learning and Reasoning"},"type":"conference","_id":"14211"},{"citation":{"chicago":"Montagna, Francesco, Nicoletta Noceti, Lorenzo Rosasco, Kun Zhang, and Francesco Locatello. “Scalable Causal Discovery with Score Matching.” In 2nd Conference on Causal Learning and Reasoning, 2023.","ista":"Montagna F, Noceti N, Rosasco L, Zhang K, Locatello F. 2023. Scalable causal discovery with score matching. 2nd Conference on Causal Learning and Reasoning. CLeaR: Conference on Causal Learning and Reasoning.","mla":"Montagna, Francesco, et al. “Scalable Causal Discovery with Score Matching.” 2nd Conference on Causal Learning and Reasoning, 2023.","short":"F. Montagna, N. Noceti, L. Rosasco, K. Zhang, F. Locatello, in:, 2nd Conference on Causal Learning and Reasoning, 2023.","ieee":"F. Montagna, N. Noceti, L. Rosasco, K. Zhang, and F. Locatello, “Scalable causal discovery with score matching,” in 2nd Conference on Causal Learning and Reasoning, Tübingen, Germany, 2023.","apa":"Montagna, F., Noceti, N., Rosasco, L., Zhang, K., & Locatello, F. (2023). Scalable causal discovery with score matching. In 2nd Conference on Causal Learning and Reasoning. Tübingen, Germany.","ama":"Montagna F, Noceti N, Rosasco L, Zhang K, Locatello F. Scalable causal discovery with score matching. In: 2nd Conference on Causal Learning and Reasoning. ; 2023."},"date_updated":"2023-09-13T09:03:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","external_id":{"arxiv":["2304.03382"]},"article_processing_charge":"No","author":[{"last_name":"Montagna","full_name":"Montagna, Francesco","first_name":"Francesco"},{"last_name":"Noceti","full_name":"Noceti, Nicoletta","first_name":"Nicoletta"},{"first_name":"Lorenzo","last_name":"Rosasco","full_name":"Rosasco, Lorenzo"},{"first_name":"Kun","full_name":"Zhang, Kun","last_name":"Zhang"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello"}],"department":[{"_id":"FrLo"}],"title":"Scalable causal discovery with score matching","_id":"14212","conference":{"end_date":"2023-04-14","location":"Tübingen, Germany","start_date":"2023-04-11","name":"CLeaR: Conference on Causal Learning and Reasoning"},"type":"conference","status":"public","year":"2023","publication_status":"published","language":[{"iso":"eng"}],"publication":"2nd Conference on Causal Learning and Reasoning","day":"01","date_created":"2023-08-22T14:19:40Z","date_published":"2023-04-01T00:00:00Z","abstract":[{"lang":"eng","text":"This paper demonstrates how to discover the whole causal graph from the second derivative of the log-likelihood in observational non-linear additive Gaussian noise models. Leveraging scalable machine learning approaches to approximate the score function ∇logp(X), we extend the work of Rolland et al. (2022) that only recovers the topological order from the score and requires an expensive pruning step removing spurious edges among those admitted by the ordering. Our analysis leads to DAS (acronym for Discovery At Scale), a practical algorithm that reduces the complexity of the pruning by a factor proportional to the graph size. In practice, DAS achieves competitive accuracy with current state-of-the-art while being over an order of magnitude faster. Overall, our approach enables principled and scalable causal discovery, significantly lowering the compute bar."}],"oa_version":"Preprint","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2304.03382","open_access":"1"}],"scopus_import":"1","quality_controlled":"1","month":"04"},{"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2301.05169"}],"month":"04","abstract":[{"text":"Recent years have seen a surge of interest in learning high-level causal representations from low-level image pairs under interventions. Yet, existing efforts are largely limited to simple synthetic settings that are far away from real-world problems. In this paper, we present Causal Triplet, a causal representation learning benchmark featuring not only visually more complex scenes, but also two crucial desiderata commonly overlooked in previous works: (i) an actionable counterfactual setting, where only certain object-level variables allow for counterfactual observations whereas others do not; (ii) an interventional downstream task with an emphasis on out-of-distribution robustness from the independent causal mechanisms principle. Through extensive experiments, we find that models built with the knowledge of disentangled or object-centric representations significantly outperform their distributed counterparts. However, recent causal representation learning methods still struggle to identify such latent structures, indicating substantial challenges and opportunities for future work.","lang":"eng"}],"oa_version":"Preprint","date_published":"2023-04-12T00:00:00Z","date_created":"2023-08-22T14:20:18Z","year":"2023","publication_status":"published","day":"12","language":[{"iso":"eng"}],"publication":"2nd Conference on Causal Learning and Reasoning","type":"conference","conference":{"location":"Tübingen, Germany","end_date":"2023-04-14","start_date":"2023-04-11","name":"CLeaR: Conference on Causal Learning and Reasoning"},"status":"public","_id":"14214","author":[{"full_name":"Liu, Yuejiang","last_name":"Liu","first_name":"Yuejiang"},{"full_name":"Alahi, Alexandre","last_name":"Alahi","first_name":"Alexandre"},{"full_name":"Russell, Chris","last_name":"Russell","first_name":"Chris"},{"last_name":"Horn","full_name":"Horn, Max","first_name":"Max"},{"first_name":"Dominik","last_name":"Zietlow","full_name":"Zietlow, Dominik"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello"}],"external_id":{"arxiv":["2301.05169"]},"article_processing_charge":"No","title":"Causal triplet: An open challenge for intervention-centric causal representation learning","department":[{"_id":"FrLo"}],"citation":{"chicago":"Liu, Yuejiang, Alexandre Alahi, Chris Russell, Max Horn, Dominik Zietlow, Bernhard Schölkopf, and Francesco Locatello. “Causal Triplet: An Open Challenge for Intervention-Centric Causal Representation Learning.” In 2nd Conference on Causal Learning and Reasoning, 2023.","ista":"Liu Y, Alahi A, Russell C, Horn M, Zietlow D, Schölkopf B, Locatello F. 2023. Causal triplet: An open challenge for intervention-centric causal representation learning. 2nd Conference on Causal Learning and Reasoning. CLeaR: Conference on Causal Learning and Reasoning.","mla":"Liu, Yuejiang, et al. “Causal Triplet: An Open Challenge for Intervention-Centric Causal Representation Learning.” 2nd Conference on Causal Learning and Reasoning, 2023.","ieee":"Y. Liu et al., “Causal triplet: An open challenge for intervention-centric causal representation learning,” in 2nd Conference on Causal Learning and Reasoning, Tübingen, Germany, 2023.","short":"Y. Liu, A. Alahi, C. Russell, M. Horn, D. Zietlow, B. Schölkopf, F. Locatello, in:, 2nd Conference on Causal Learning and Reasoning, 2023.","apa":"Liu, Y., Alahi, A., Russell, C., Horn, M., Zietlow, D., Schölkopf, B., & Locatello, F. (2023). Causal triplet: An open challenge for intervention-centric causal representation learning. In 2nd Conference on Causal Learning and Reasoning. Tübingen, Germany.","ama":"Liu Y, Alahi A, Russell C, et al. Causal triplet: An open challenge for intervention-centric causal representation learning. In: 2nd Conference on Causal Learning and Reasoning. ; 2023."},"date_updated":"2023-09-13T09:23:08Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Moschella L, Maiorca V, Fumero M, Norelli A, Locatello F, Rodolà E. Relative representations enable zero-shot latent space communication. In: The 11th International Conference on Learning Representations. ; 2023.","apa":"Moschella, L., Maiorca, V., Fumero, M., Norelli, A., Locatello, F., & Rodolà, E. (2023). Relative representations enable zero-shot latent space communication. In The 11th International Conference on Learning Representations. Kigali, Rwanda.","short":"L. Moschella, V. Maiorca, M. Fumero, A. Norelli, F. Locatello, E. Rodolà, in:, The 11th International Conference on Learning Representations, 2023.","ieee":"L. Moschella, V. Maiorca, M. Fumero, A. Norelli, F. Locatello, and E. Rodolà, “Relative representations enable zero-shot latent space communication,” in The 11th International Conference on Learning Representations, Kigali, Rwanda, 2023.","mla":"Moschella, Luca, et al. “Relative Representations Enable Zero-Shot Latent Space Communication.” The 11th International Conference on Learning Representations, 2023.","ista":"Moschella L, Maiorca V, Fumero M, Norelli A, Locatello F, Rodolà E. 2023. Relative representations enable zero-shot latent space communication. The 11th International Conference on Learning Representations. International Conference on Machine Learning Representations.","chicago":"Moschella, Luca, Valentino Maiorca, Marco Fumero, Antonio Norelli, Francesco Locatello, and Emanuele Rodolà. “Relative Representations Enable Zero-Shot Latent Space Communication.” In The 11th International Conference on Learning Representations, 2023."},"date_updated":"2023-09-13T09:44:26Z","title":"Relative representations enable zero-shot latent space communication","department":[{"_id":"FrLo"}],"author":[{"first_name":"Luca","last_name":"Moschella","full_name":"Moschella, Luca"},{"first_name":"Valentino","full_name":"Maiorca, Valentino","last_name":"Maiorca"},{"first_name":"Marco","full_name":"Fumero, Marco","last_name":"Fumero"},{"last_name":"Norelli","full_name":"Norelli, Antonio","first_name":"Antonio"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello"},{"full_name":"Rodolà, Emanuele","last_name":"Rodolà","first_name":"Emanuele"}],"article_processing_charge":"No","external_id":{"arxiv":["2209.15430"]},"_id":"14217","status":"public","type":"conference","conference":{"name":"International Conference on Machine Learning Representations","start_date":"2023-05-01","end_date":"2023-05-05","location":"Kigali, Rwanda"},"day":"01","language":[{"iso":"eng"}],"publication":"The 11th International Conference on Learning Representations","year":"2023","publication_status":"published","date_published":"2023-05-01T00:00:00Z","date_created":"2023-08-22T14:22:20Z","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Neural networks embed the geometric structure of a data manifold lying in a high-dimensional space into latent representations. Ideally, the distribution of the data points in the latent space should depend only on the task, the data, the loss, and other architecture-specific constraints. However, factors such as the random weights initialization, training hyperparameters, or other sources of randomness in the training phase may induce incoherent latent spaces that hinder any form of reuse. Nevertheless, we empirically observe that, under the same data and modeling choices, the angles between the encodings within distinct latent spaces do not change. In this work, we propose the latent similarity between each sample and a fixed set of anchors as an alternative data representation, demonstrating that it can enforce the desired invariances without any additional training. We show how neural architectures can leverage these relative representations to guarantee, in practice, invariance to latent isometries and rescalings, effectively enabling latent space communication: from zero-shot model stitching to latent space comparison between diverse settings. We extensively validate the generalization capability of our approach on different datasets, spanning various modalities (images, text, graphs), tasks (e.g., classification, reconstruction) and architectures (e.g., CNNs, GCNs, transformers)."}],"month":"05","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2209.15430"}],"oa":1},{"month":"04","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2110.06562","open_access":"1"}],"quality_controlled":"1","oa_version":"Preprint","abstract":[{"text":"Learning generative object models from unlabelled videos is a long standing problem and required for causal scene modeling. We decompose this problem into three easier subtasks, and provide candidate solutions for each of them. Inspired by the Common Fate Principle of Gestalt Psychology, we first extract (noisy) masks of moving objects via unsupervised motion segmentation. Second, generative models are trained on the masks of the background and the moving objects, respectively. Third, background and foreground models are combined in a conditional \"dead leaves\" scene model to sample novel scene configurations where occlusions and depth layering arise naturally. To evaluate the individual stages, we introduce the Fishbowl dataset positioned between complex real-world scenes and common object-centric benchmarks of simplistic objects. We show that our approach allows learning generative models that generalize beyond the occlusions present in the input videos, and represent scenes in a modular fashion that allows sampling plausible scenes outside the training distribution by permitting, for instance, object numbers or densities not observed in the training set.","lang":"eng"}],"date_created":"2023-08-22T14:23:54Z","date_published":"2023-04-15T00:00:00Z","publication":"2nd Conference on Causal Learning and Reasoning","language":[{"iso":"eng"}],"day":"15","publication_status":"published","year":"2023","status":"public","conference":{"end_date":"2023-04-14","location":"Tübingen, Germany","start_date":"2023-04-11","name":"CLeaR: Conference on Causal Learning and Reasoning"},"type":"conference","article_number":"2110.06562","_id":"14222","department":[{"_id":"FrLo"}],"title":"Unsupervised object learning via common fate","article_processing_charge":"No","external_id":{"arxiv":["2110.06562"]},"author":[{"last_name":"Tangemann","full_name":"Tangemann, Matthias","first_name":"Matthias"},{"first_name":"Steffen","full_name":"Schneider, Steffen","last_name":"Schneider"},{"full_name":"Kügelgen, Julius von","last_name":"Kügelgen","first_name":"Julius von"},{"last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"full_name":"Gehler, Peter","last_name":"Gehler","first_name":"Peter"},{"full_name":"Brox, Thomas","last_name":"Brox","first_name":"Thomas"},{"last_name":"Kümmerer","full_name":"Kümmerer, Matthias","first_name":"Matthias"},{"first_name":"Matthias","last_name":"Bethge","full_name":"Bethge, Matthias"},{"last_name":"Schölkopf","full_name":"Schölkopf, Bernhard","first_name":"Bernhard"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"mla":"Tangemann, Matthias, et al. “Unsupervised Object Learning via Common Fate.” 2nd Conference on Causal Learning and Reasoning, 2110.06562, 2023.","short":"M. Tangemann, S. Schneider, J. von Kügelgen, F. Locatello, P. Gehler, T. Brox, M. Kümmerer, M. Bethge, B. Schölkopf, in:, 2nd Conference on Causal Learning and Reasoning, 2023.","ieee":"M. Tangemann et al., “Unsupervised object learning via common fate,” in 2nd Conference on Causal Learning and Reasoning, Tübingen, Germany, 2023.","ama":"Tangemann M, Schneider S, Kügelgen J von, et al. Unsupervised object learning via common fate. In: 2nd Conference on Causal Learning and Reasoning. ; 2023.","apa":"Tangemann, M., Schneider, S., Kügelgen, J. von, Locatello, F., Gehler, P., Brox, T., … Schölkopf, B. (2023). Unsupervised object learning via common fate. In 2nd Conference on Causal Learning and Reasoning. Tübingen, Germany.","chicago":"Tangemann, Matthias, Steffen Schneider, Julius von Kügelgen, Francesco Locatello, Peter Gehler, Thomas Brox, Matthias Kümmerer, Matthias Bethge, and Bernhard Schölkopf. “Unsupervised Object Learning via Common Fate.” In 2nd Conference on Causal Learning and Reasoning, 2023.","ista":"Tangemann M, Schneider S, Kügelgen J von, Locatello F, Gehler P, Brox T, Kümmerer M, Bethge M, Schölkopf B. 2023. Unsupervised object learning via common fate. 2nd Conference on Causal Learning and Reasoning. CLeaR: Conference on Causal Learning and Reasoning, 2110.06562."},"date_updated":"2023-09-13T11:31:14Z"},{"_id":"14218","type":"conference","conference":{"start_date":"2023-05-01","end_date":"2023-05-05","location":"Kigali, Rwanda","name":"ICLR: International Conference on Learning Representations"},"status":"public","date_updated":"2023-09-13T11:37:03Z","citation":{"ista":"Seitzer M, Horn M, Zadaianchuk A, Zietlow D, Xiao T, Carl-Johann Simon-Gabriel C-JS-G, He T, Zhang Z, Schölkopf B, Brox T, Locatello F. 2023. Bridging the gap to real-world object-centric learning. The 11th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","chicago":"Seitzer, Maximilian, Max Horn, Andrii Zadaianchuk, Dominik Zietlow, Tianjun Xiao, Carl-Johann Simon-Gabriel Carl-Johann Simon-Gabriel, Tong He, et al. “Bridging the Gap to Real-World Object-Centric Learning.” In The 11th International Conference on Learning Representations, 2023.","ieee":"M. Seitzer et al., “Bridging the gap to real-world object-centric learning,” in The 11th International Conference on Learning Representations, Kigali, Rwanda, 2023.","short":"M. Seitzer, M. Horn, A. Zadaianchuk, D. Zietlow, T. Xiao, C.-J.S.-G. Carl-Johann Simon-Gabriel, T. He, Z. Zhang, B. Schölkopf, T. Brox, F. Locatello, in:, The 11th International Conference on Learning Representations, 2023.","ama":"Seitzer M, Horn M, Zadaianchuk A, et al. Bridging the gap to real-world object-centric learning. In: The 11th International Conference on Learning Representations. ; 2023.","apa":"Seitzer, M., Horn, M., Zadaianchuk, A., Zietlow, D., Xiao, T., Carl-Johann Simon-Gabriel, C.-J. S.-G., … Locatello, F. (2023). Bridging the gap to real-world object-centric learning. In The 11th International Conference on Learning Representations. Kigali, Rwanda.","mla":"Seitzer, Maximilian, et al. “Bridging the Gap to Real-World Object-Centric Learning.” The 11th International Conference on Learning Representations, 2023."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Seitzer","full_name":"Seitzer, Maximilian","first_name":"Maximilian"},{"first_name":"Max","full_name":"Horn, Max","last_name":"Horn"},{"full_name":"Zadaianchuk, Andrii","last_name":"Zadaianchuk","first_name":"Andrii"},{"last_name":"Zietlow","full_name":"Zietlow, Dominik","first_name":"Dominik"},{"first_name":"Tianjun","full_name":"Xiao, Tianjun","last_name":"Xiao"},{"last_name":"Carl-Johann Simon-Gabriel","full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel","first_name":"Carl-Johann Simon-Gabriel"},{"last_name":"He","full_name":"He, Tong","first_name":"Tong"},{"first_name":"Zheng","last_name":"Zhang","full_name":"Zhang, Zheng"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"},{"full_name":"Brox, Thomas","last_name":"Brox","first_name":"Thomas"},{"last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"}],"external_id":{"arxiv":["2209.14860"]},"article_processing_charge":"No","title":"Bridging the gap to real-world object-centric learning","department":[{"_id":"FrLo"}],"abstract":[{"text":"Humans naturally decompose their environment into entities at the appropriate level of abstraction to act in the world. Allowing machine learning algorithms to derive this decomposition in an unsupervised way has become an important line of research. However, current methods are restricted to simulated data or require additional information in the form of motion or depth in order to successfully discover objects. In this work, we overcome this limitation by showing that reconstructing features from models trained in a self-supervised manner is a sufficient training signal for object-centric representations to arise in a fully unsupervised way. Our approach, DINOSAUR, significantly out-performs existing image-based object-centric learning models on simulated data and is the first unsupervised object-centric model that scales to real-world datasets such as COCO and PASCAL VOC. DINOSAUR is conceptually simple and shows competitive performance compared to more involved pipelines from the computer vision literature.","lang":"eng"}],"oa_version":"Preprint","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2209.14860","open_access":"1"}],"oa":1,"month":"05","publication_status":"published","year":"2023","day":"10","publication":"The 11th International Conference on Learning Representations","language":[{"iso":"eng"}],"date_published":"2023-05-10T00:00:00Z","date_created":"2023-08-22T14:22:41Z"},{"conference":{"name":"ICLR: International Conference on Learning Representations","location":"Kigali, Rwanda","end_date":"2023-05-05","start_date":"2023-05-01"},"type":"conference","status":"public","_id":"14219","external_id":{"arxiv":["2207.05027"]},"article_processing_charge":"No","author":[{"first_name":"Andrii","last_name":"Zadaianchuk","full_name":"Zadaianchuk, Andrii"},{"full_name":"Kleindessner, Matthaeus","last_name":"Kleindessner","first_name":"Matthaeus"},{"full_name":"Zhu, Yi","last_name":"Zhu","first_name":"Yi"},{"last_name":"Locatello","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"first_name":"Thomas","full_name":"Brox, Thomas","last_name":"Brox"}],"title":"Unsupervised semantic segmentation with self-supervised object-centric representations","department":[{"_id":"FrLo"}],"date_updated":"2023-09-13T11:25:43Z","citation":{"chicago":"Zadaianchuk, Andrii, Matthaeus Kleindessner, Yi Zhu, Francesco Locatello, and Thomas Brox. “Unsupervised Semantic Segmentation with Self-Supervised Object-Centric Representations.” In The 11th International Conference on Learning Representations, 2023.","ista":"Zadaianchuk A, Kleindessner M, Zhu Y, Locatello F, Brox T. 2023. Unsupervised semantic segmentation with self-supervised object-centric representations. The 11th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","mla":"Zadaianchuk, Andrii, et al. “Unsupervised Semantic Segmentation with Self-Supervised Object-Centric Representations.” The 11th International Conference on Learning Representations, 2023.","apa":"Zadaianchuk, A., Kleindessner, M., Zhu, Y., Locatello, F., & Brox, T. (2023). Unsupervised semantic segmentation with self-supervised object-centric representations. In The 11th International Conference on Learning Representations. Kigali, Rwanda.","ama":"Zadaianchuk A, Kleindessner M, Zhu Y, Locatello F, Brox T. Unsupervised semantic segmentation with self-supervised object-centric representations. In: The 11th International Conference on Learning Representations. ; 2023.","short":"A. Zadaianchuk, M. Kleindessner, Y. Zhu, F. Locatello, T. Brox, in:, The 11th International Conference on Learning Representations, 2023.","ieee":"A. Zadaianchuk, M. Kleindessner, Y. Zhu, F. Locatello, and T. Brox, “Unsupervised semantic segmentation with self-supervised object-centric representations,” in The 11th International Conference on Learning Representations, Kigali, Rwanda, 2023."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2207.05027"}],"oa":1,"quality_controlled":"1","month":"05","abstract":[{"text":"In this paper, we show that recent advances in self-supervised feature\r\nlearning enable unsupervised object discovery and semantic segmentation with a\r\nperformance that matches the state of the field on supervised semantic\r\nsegmentation 10 years ago. We propose a methodology based on unsupervised\r\nsaliency masks and self-supervised feature clustering to kickstart object\r\ndiscovery followed by training a semantic segmentation network on pseudo-labels\r\nto bootstrap the system on images with multiple objects. We present results on\r\nPASCAL VOC that go far beyond the current state of the art (50.0 mIoU), and we\r\nreport for the first time results on MS COCO for the whole set of 81 classes:\r\nour method discovers 34 categories with more than $20\\%$ IoU, while obtaining\r\nan average IoU of 19.6 for all 81 categories.","lang":"eng"}],"oa_version":"Preprint","date_created":"2023-08-22T14:22:58Z","date_published":"2023-05-01T00:00:00Z","year":"2023","publication_status":"published","publication":"The 11th International Conference on Learning Representations","language":[{"iso":"eng"}],"day":"01"},{"department":[{"_id":"FrLo"}],"title":"Self-compatibility: Evaluating causal discovery without ground truth","author":[{"full_name":"Faller, Philipp M.","last_name":"Faller","first_name":"Philipp M."},{"last_name":"Vankadara","full_name":"Vankadara, Leena Chennuru","first_name":"Leena Chennuru"},{"first_name":"Atalanti A.","last_name":"Mastakouri","full_name":"Mastakouri, Atalanti A."},{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"last_name":"Janzing","full_name":"Janzing, Dominik","first_name":"Dominik"}],"external_id":{"arxiv":["2307.09552"]},"article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-13T12:47:53Z","citation":{"chicago":"Faller, Philipp M., Leena Chennuru Vankadara, Atalanti A. Mastakouri, Francesco Locatello, and Dominik Janzing. “Self-Compatibility: Evaluating Causal Discovery without Ground Truth.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2307.09552.","ista":"Faller PM, Vankadara LC, Mastakouri AA, Locatello F, Janzing D. Self-compatibility: Evaluating causal discovery without ground truth. arXiv, 2307.09552.","mla":"Faller, Philipp M., et al. “Self-Compatibility: Evaluating Causal Discovery without Ground Truth.” ArXiv, 2307.09552, doi:10.48550/arXiv.2307.09552.","short":"P.M. Faller, L.C. Vankadara, A.A. Mastakouri, F. Locatello, D. Janzing, ArXiv (n.d.).","ieee":"P. M. Faller, L. C. Vankadara, A. A. Mastakouri, F. Locatello, and D. Janzing, “Self-compatibility: Evaluating causal discovery without ground truth,” arXiv. .","ama":"Faller PM, Vankadara LC, Mastakouri AA, Locatello F, Janzing D. Self-compatibility: Evaluating causal discovery without ground truth. arXiv. doi:10.48550/arXiv.2307.09552","apa":"Faller, P. M., Vankadara, L. C., Mastakouri, A. A., Locatello, F., & Janzing, D. (n.d.). Self-compatibility: Evaluating causal discovery without ground truth. arXiv. https://doi.org/10.48550/arXiv.2307.09552"},"status":"public","type":"preprint","article_number":"2307.09552","_id":"14333","date_published":"2023-07-18T00:00:00Z","doi":"10.48550/arXiv.2307.09552","date_created":"2023-09-13T12:44:59Z","day":"18","language":[{"iso":"eng"}],"publication":"arXiv","publication_status":"submitted","year":"2023","month":"07","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2307.09552"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"As causal ground truth is incredibly rare, causal discovery algorithms are\r\ncommonly only evaluated on simulated data. This is concerning, given that\r\nsimulations reflect common preconceptions about generating processes regarding\r\nnoise distributions, model classes, and more. In this work, we propose a novel\r\nmethod for falsifying the output of a causal discovery algorithm in the absence\r\nof ground truth. Our key insight is that while statistical learning seeks\r\nstability across subsets of data points, causal learning should seek stability\r\nacross subsets of variables. Motivated by this insight, our method relies on a\r\nnotion of compatibility between causal graphs learned on different subsets of\r\nvariables. We prove that detecting incompatibilities can falsify wrongly\r\ninferred causal relations due to violation of assumptions or errors from finite\r\nsample effects. Although passing such compatibility tests is only a necessary\r\ncriterion for good performance, we argue that it provides strong evidence for\r\nthe causal models whenever compatibility entails strong implications for the\r\njoint distribution. We also demonstrate experimentally that detection of\r\nincompatibilities can aid in causal model selection."}]},{"month":"07","intvolume":" 1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Living tissues are characterized by an intrinsically mechanochemical interplay of active physical forces and complex biochemical signaling pathways. Either feature alone can give rise to complex emergent phenomena, for example, mechanically driven glassy dynamics and rigidity transitions, or chemically driven reaction-diffusion instabilities. An important question is how to quantitatively assess the contribution of these different cues to the large-scale dynamics of biological materials. We address this in Madin-Darby canine kidney (MDCK) monolayers, considering both mechanochemical feedback between extracellular signal-regulated kinase (ERK) signaling activity and cellular density as well as a mechanically active tissue rheology via a self-propelled vertex model. We show that the relative strength of active migration forces to mechanochemical couplings controls a transition from a uniform active glass to periodic spatiotemporal waves. We parametrize the model from published experimental data sets on MDCK monolayers and use it to make new predictions on the correlation functions of cellular dynamics and the dynamics of topological defects associated with the oscillatory phase of cells. Interestingly, MDCK monolayers are best described by an intermediary parameter region in which both mechanochemical couplings and noisy active propulsion have a strong influence on the dynamics. Finally, we study how tissue rheology and ERK waves produce feedback on one another and uncover a mechanism via which tissue fluidity can be controlled by mechanochemical waves at both the local and global levels."}],"volume":1,"issue":"1","ec_funded":1,"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"14335","checksum":"f881d98c89eb9f1aa136d7b781511553","success":1,"creator":"dernst","date_updated":"2023-09-15T06:30:50Z","file_size":2559520,"date_created":"2023-09-15T06:30:50Z","file_name":"2023_PRXLife_Boocock.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2835-8279"]},"publication_status":"published","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"14277","department":[{"_id":"EdHa"}],"file_date_updated":"2023-09-15T06:30:50Z","ddc":["570"],"date_updated":"2023-09-15T06:39:17Z","quality_controlled":"1","publisher":"American Physical Society","oa":1,"acknowledgement":"We thank all members of the Hannezo group for discussions and suggestions, as well as Sound Wai Phow for technical assistance. This work received funding from the European Research Council under the EU Horizon 2020 research and innovation program Grant Agreement No. 851288 (E.H.), JSPS KAKENHI Grant No. 21H05290, and the Ministry of Education under the Research Centres of Excellence program through the MBI at NUS.","doi":"10.1103/prxlife.1.013001","date_published":"2023-07-20T00:00:00Z","date_created":"2023-09-06T08:30:59Z","day":"20","publication":"PRX Life","has_accepted_license":"1","year":"2023","project":[{"call_identifier":"H2020","_id":"05943252-7A3F-11EA-A408-12923DDC885E","grant_number":"851288","name":"Design Principles of Branching Morphogenesis"}],"article_number":"013001","title":"Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers","author":[{"id":"453AF628-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel R","last_name":"Boocock","orcid":"0000-0002-1585-2631","full_name":"Boocock, Daniel R"},{"last_name":"Hirashima","full_name":"Hirashima, Tsuyoshi","first_name":"Tsuyoshi"},{"last_name":"Hannezo","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"Yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Boocock, Daniel R, Tsuyoshi Hirashima, and Edouard B Hannezo. “Interplay between Mechanochemical Patterning and Glassy Dynamics in Cellular Monolayers.” PRX Life. American Physical Society, 2023. https://doi.org/10.1103/prxlife.1.013001.","ista":"Boocock DR, Hirashima T, Hannezo EB. 2023. Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers. PRX Life. 1(1), 013001.","mla":"Boocock, Daniel R., et al. “Interplay between Mechanochemical Patterning and Glassy Dynamics in Cellular Monolayers.” PRX Life, vol. 1, no. 1, 013001, American Physical Society, 2023, doi:10.1103/prxlife.1.013001.","ama":"Boocock DR, Hirashima T, Hannezo EB. Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers. PRX Life. 2023;1(1). doi:10.1103/prxlife.1.013001","apa":"Boocock, D. R., Hirashima, T., & Hannezo, E. B. (2023). Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers. PRX Life. American Physical Society. https://doi.org/10.1103/prxlife.1.013001","ieee":"D. R. Boocock, T. Hirashima, and E. B. Hannezo, “Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers,” PRX Life, vol. 1, no. 1. American Physical Society, 2023.","short":"D.R. Boocock, T. Hirashima, E.B. Hannezo, PRX Life 1 (2023)."}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Nardin M, Käfer K, Stella F, Csicsvari JL. 2023. Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions. Cell Reports. 42(9), 113015.","chicago":"Nardin, Michele, Karola Käfer, Federico Stella, and Jozsef L Csicsvari. “Theta Oscillations as a Substrate for Medial Prefrontal-Hippocampal Assembly Interactions.” Cell Reports. Elsevier, 2023. https://doi.org/10.1016/j.celrep.2023.113015.","ama":"Nardin M, Käfer K, Stella F, Csicsvari JL. Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions. Cell Reports. 2023;42(9). doi:10.1016/j.celrep.2023.113015","apa":"Nardin, M., Käfer, K., Stella, F., & Csicsvari, J. L. (2023). Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2023.113015","short":"M. Nardin, K. Käfer, F. Stella, J.L. Csicsvari, Cell Reports 42 (2023).","ieee":"M. Nardin, K. Käfer, F. Stella, and J. L. Csicsvari, “Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions,” Cell Reports, vol. 42, no. 9. Elsevier, 2023.","mla":"Nardin, Michele, et al. “Theta Oscillations as a Substrate for Medial Prefrontal-Hippocampal Assembly Interactions.” Cell Reports, vol. 42, no. 9, 113015, Elsevier, 2023, doi:10.1016/j.celrep.2023.113015."},"title":"Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions","author":[{"first_name":"Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8849-6570","full_name":"Nardin, Michele","last_name":"Nardin"},{"first_name":"Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","last_name":"Käfer","full_name":"Käfer, Karola"},{"id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","first_name":"Federico","last_name":"Stella","orcid":"0000-0001-9439-3148","full_name":"Stella, Federico"},{"first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036"}],"external_id":{"pmid":["37632747"]},"article_processing_charge":"Yes","article_number":"113015","project":[{"grant_number":"607616","name":"Inter-and intracellular signalling in schizophrenia","_id":"257BBB4C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"day":"26","publication":"Cell Reports","has_accepted_license":"1","year":"2023","date_published":"2023-09-26T00:00:00Z","doi":"10.1016/j.celrep.2023.113015","date_created":"2023-09-10T22:01:11Z","acknowledgement":"We thank A. Cumpelik, H. Chiossi, and L. Bollman for comments on an earlier version of this manuscript. This work was funded by EU-FP7 MC-ITN IN-SENS (grant 607616).","publisher":"Elsevier","quality_controlled":"1","oa":1,"ddc":["570"],"date_updated":"2023-09-15T07:14:12Z","department":[{"_id":"JoCs"}],"file_date_updated":"2023-09-15T07:12:46Z","_id":"14314","status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"creator":"dernst","date_updated":"2023-09-15T07:12:46Z","file_size":4879455,"date_created":"2023-09-15T07:12:46Z","file_name":"2023_CellPress_Nardin.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"ca77a304fb813c292550b8604b0fb41d","file_id":"14337","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2211-1247"]},"publication_status":"published","volume":42,"issue":"9","ec_funded":1,"oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","text":"The execution of cognitive functions requires coordinated circuit activity across different brain areas that involves the associated firing of neuronal assemblies. Here, we tested the circuit mechanism behind assembly interactions between the hippocampus and the medial prefrontal cortex (mPFC) of adult rats by recording neuronal populations during a rule-switching task. We identified functionally coupled CA1-mPFC cells that synchronized their activity beyond that expected from common spatial coding or oscillatory firing. When such cell pairs fired together, the mPFC cell strongly phase locked to CA1 theta oscillations and maintained consistent theta firing phases, independent of the theta timing of their CA1 counterpart. These functionally connected CA1-mPFC cells formed interconnected assemblies. While firing together with their CA1 assembly partners, mPFC cells fired along specific theta sequences. Our results suggest that upregulated theta oscillatory firing of mPFC cells can signal transient interactions with specific CA1 assemblies, thus enabling distributed computations."}],"month":"09","intvolume":" 42","scopus_import":"1"},{"external_id":{"pmid":["37665327"]},"article_processing_charge":"Yes","author":[{"first_name":"Ukrae H.","full_name":"Cho, Ukrae H.","last_name":"Cho"},{"first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","last_name":"Hetzer","orcid":"0000-0002-2111-992X","full_name":"Hetzer, Martin W"}],"title":"Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress","citation":{"ista":"Cho UH, Hetzer M. 2023. Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress. eLife. 12, RP89066.","chicago":"Cho, Ukrae H., and Martin Hetzer. “Caspase-Mediated Nuclear Pore Complex Trimming in Cell Differentiation and Endoplasmic Reticulum Stress.” ELife. eLife Sciences Publications, 2023. https://doi.org/10.7554/eLife.89066.","ama":"Cho UH, Hetzer M. Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress. eLife. 2023;12. doi:10.7554/eLife.89066","apa":"Cho, U. H., & Hetzer, M. (2023). Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.89066","ieee":"U. H. Cho and M. Hetzer, “Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress,” eLife, vol. 12. eLife Sciences Publications, 2023.","short":"U.H. Cho, M. Hetzer, ELife 12 (2023).","mla":"Cho, Ukrae H., and Martin Hetzer. “Caspase-Mediated Nuclear Pore Complex Trimming in Cell Differentiation and Endoplasmic Reticulum Stress.” ELife, vol. 12, RP89066, eLife Sciences Publications, 2023, doi:10.7554/eLife.89066."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"RP89066","date_created":"2023-09-10T22:01:11Z","doi":"10.7554/eLife.89066","date_published":"2023-09-04T00:00:00Z","year":"2023","has_accepted_license":"1","publication":"eLife","day":"04","oa":1,"publisher":"eLife Sciences Publications","quality_controlled":"1","acknowledgement":"We thank the members of the Hetzer laboratory, Tony Hunter (Salk), Lorenzo Puri (Sanford Burnham Prebys), and Jongmin Kim (Massachusetts General Hospital) for the critical reading of the manuscript; Kenneth Diffenderfer and Aimee Pankonin (Stem Cell Core at the Salk Institute) for help with neurogenesis; Carol Marchetto and Fred Gage (Salk) for providing H9 embryonic stem cells; Lorenzo Puri, Alexandra Sacco, and Luca Caputo (Sanford Burnham Prebys) for helpful discussions and sharing mouse primary myoblasts. This work was supported by a Glenn Foundation for Medical Research Postdoctoral Fellowship in Aging Research (UHC), the NOMIS foundation (MWH), and the National Institutes of Health (R01 NS096786 to MWH and K01 AR080828 to UHC). This work was also supported by the Mass Spectrometry Core of the Salk Institute with funding from NIH-NCI CCSG: P30 014195 and the Helmsley Center for Genomic Medicine. We thank Jolene Diedrich and Antonio Pinto for technical support.","file_date_updated":"2023-09-15T06:59:10Z","department":[{"_id":"MaHe"}],"date_updated":"2023-09-15T07:07:10Z","ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","_id":"14315","volume":12,"publication_status":"published","publication_identifier":{"eissn":["2050-084X"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2023-09-15T06:59:10Z","file_size":3703097,"creator":"dernst","date_created":"2023-09-15T06:59:10Z","file_name":"2023_eLife_Cho.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"db24bf3d595507387b48d3799c33e289","file_id":"14336","success":1}],"scopus_import":"1","intvolume":" 12","month":"09","abstract":[{"text":"During apoptosis, caspases degrade 8 out of ~30 nucleoporins to irreversibly demolish the nuclear pore complex. However, for poorly understood reasons, caspases are also activated during cell differentiation. Here, we show that sublethal activation of caspases during myogenesis results in the transient proteolysis of four peripheral Nups and one transmembrane Nup. ‘Trimmed’ NPCs become nuclear export-defective, and we identified in an unbiased manner several classes of cytoplasmic, plasma membrane, and mitochondrial proteins that rapidly accumulate in the nucleus. NPC trimming by non-apoptotic caspases was also observed in neurogenesis and endoplasmic reticulum stress. Our results suggest that caspases can reversibly modulate nuclear transport activity, which allows them to function as agents of cell differentiation and adaptation at sublethal levels.","lang":"eng"}],"oa_version":"Published Version","pmid":1},{"citation":{"chicago":"Anastos, Michael, David Fabian, Alp Müyesser, and Tibor Szabó. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023. https://doi.org/10.37236/11714.","ista":"Anastos M, Fabian D, Müyesser A, Szabó T. 2023. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 30(3), P3.10.","mla":"Anastos, Michael, et al. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” Electronic Journal of Combinatorics, vol. 30, no. 3, P3.10, Electronic Journal of Combinatorics, 2023, doi:10.37236/11714.","apa":"Anastos, M., Fabian, D., Müyesser, A., & Szabó, T. (2023). Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11714","ama":"Anastos M, Fabian D, Müyesser A, Szabó T. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 2023;30(3). doi:10.37236/11714","ieee":"M. Anastos, D. Fabian, A. Müyesser, and T. Szabó, “Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets,” Electronic Journal of Combinatorics, vol. 30, no. 3. Electronic Journal of Combinatorics, 2023.","short":"M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","first_name":"Michael","full_name":"Anastos, Michael","last_name":"Anastos"},{"first_name":"David","full_name":"Fabian, David","last_name":"Fabian"},{"last_name":"Müyesser","full_name":"Müyesser, Alp","first_name":"Alp"},{"last_name":"Szabó","full_name":"Szabó, Tibor","first_name":"Tibor"}],"article_processing_charge":"Yes","external_id":{"arxiv":["2212.03100"]},"title":"Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets","article_number":"P3.10","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"has_accepted_license":"1","year":"2023","day":"28","publication":"Electronic Journal of Combinatorics","date_published":"2023-07-28T00:00:00Z","doi":"10.37236/11714","date_created":"2023-09-10T22:01:12Z","acknowledgement":"Anastos has received funding from the European Union’s Horizon 2020 research and in-novation programme under the Marie Sk lodowska-Curie grant agreement No 101034413.Fabian’s research is supported by the Deutsche Forschungsgemeinschaft (DFG, GermanResearch Foundation) Graduiertenkolleg “Facets of Complexity” (GRK 2434).","publisher":"Electronic Journal of Combinatorics","quality_controlled":"1","oa":1,"date_updated":"2023-09-15T08:12:30Z","ddc":["510"],"file_date_updated":"2023-09-15T08:02:09Z","department":[{"_id":"MaKw"}],"_id":"14319","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"status":"public","publication_identifier":{"eissn":["1077-8926"]},"publication_status":"published","file":[{"checksum":"52c46c8cb329f9aaee9ade01525f317b","file_id":"14338","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-09-15T08:02:09Z","file_name":"2023_elecJournCombinatorics_Anastos.pdf","creator":"dernst","date_updated":"2023-09-15T08:02:09Z","file_size":247917}],"language":[{"iso":"eng"}],"volume":30,"issue":"3","license":"https://creativecommons.org/licenses/by-nd/4.0/","ec_funded":1,"abstract":[{"lang":"eng","text":"We study multigraphs whose edge-sets are the union of three perfect matchings, M1, M2, and M3. Given such a graph G and any a1; a2; a3 2 N with a1 +a2 +a3 6 n - 2, we show there exists a matching M of G with jM \\ Mij = ai for each i 2 f1; 2; 3g. The bound n - 2 in the theorem is best possible in general. We conjecture however that if G is bipartite, the same result holds with n - 2 replaced by n - 1. We give a construction that shows such a result would be tight. We\r\nalso make a conjecture generalising the Ryser-Brualdi-Stein conjecture with colour\r\nmultiplicities."}],"oa_version":"Published Version","scopus_import":"1","month":"07","intvolume":" 30"},{"_id":"14318","status":"public","conference":{"start_date":"2023-07-17","location":"Paris, France","end_date":"2023-07-22","name":"CAV: Computer Aided Verification"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","ddc":["000"],"date_updated":"2023-09-20T08:25:57Z","department":[{"_id":"KrCh"}],"file_date_updated":"2023-09-20T08:24:47Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of a randomized algorithm. Given a PRR and a time limit κ, we consider the tail probability Pr[T≥κ], i.e., the probability that the randomized runtime T of the PRR exceeds κ. Our focus is the formal analysis of tail bounds that aims at finding a tight asymptotic upper bound u≥Pr[T≥κ]. To address this problem, the classical and most well-known approach is the cookbook method by Karp (JACM 1994), while other approaches are mostly limited to deriving tail bounds of specific PRRs via involved custom analysis.\r\nIn this work, we propose a novel approach for deriving the common exponentially-decreasing tail bounds for PRRs whose preprocessing time and random passed sizes observe discrete or (piecewise) uniform distribution and whose recursive call is either a single procedure call or a divide-and-conquer. We first establish a theoretical approach via Markov’s inequality, and then instantiate the theoretical approach with a template-based algorithmic approach via a refined treatment of exponentiation. Experimental evaluation shows that our algorithmic approach is capable of deriving tail bounds that are (i) asymptotically tighter than Karp’s method, (ii) match the best-known manually-derived asymptotic tail bound for QuickSelect, and (iii) is only slightly worse (with a loglogn factor) than the manually-proven optimal asymptotic tail bound for QuickSort. Moreover, our algorithmic approach handles all examples (including realistic PRRs such as QuickSort, QuickSelect, DiameterComputation, etc.) in less than 0.1 s, showing that our approach is efficient in practice."}],"intvolume":" 13966","month":"07","alternative_title":["LNCS"],"scopus_import":"1","language":[{"iso":"eng"}],"file":[{"date_created":"2023-09-20T08:24:47Z","file_name":"2023_LNCS_Sun.pdf","date_updated":"2023-09-20T08:24:47Z","file_size":624647,"creator":"dernst","file_id":"14348","checksum":"42917e086f8c7699f3bccf84f74fe000","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031377082"]},"ec_funded":1,"related_material":{"link":[{"relation":"software","url":"https://github.com/boyvolcano/PRR"}]},"volume":13966,"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Sun Y, Fu H, Chatterjee K, Goharshady AK. 2023. Automated tail bound analysis for probabilistic recurrence relations. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 16–39.","chicago":"Sun, Yican, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” In Computer Aided Verification, 13966:16–39. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_2.","ama":"Sun Y, Fu H, Chatterjee K, Goharshady AK. Automated tail bound analysis for probabilistic recurrence relations. In: Computer Aided Verification. Vol 13966. Springer Nature; 2023:16-39. doi:10.1007/978-3-031-37709-9_2","apa":"Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In Computer Aided Verification (Vol. 13966, pp. 16–39). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_2","ieee":"Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Automated tail bound analysis for probabilistic recurrence relations,” in Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 16–39.","short":"Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Computer Aided Verification, Springer Nature, 2023, pp. 16–39.","mla":"Sun, Yican, et al. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 16–39, doi:10.1007/978-3-031-37709-9_2."},"title":"Automated tail bound analysis for probabilistic recurrence relations","article_processing_charge":"Yes (in subscription journal)","author":[{"first_name":"Yican","full_name":"Sun, Yican","last_name":"Sun"},{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"We thank Prof. Bican Xia for valuable information on the exponential theory of reals. The work is partially supported by the National Natural Science Foundation of China (NSFC) with Grant No. 62172271, ERC CoG 863818 (ForM-SMArt), the Hong Kong Research Grants Council ECS Project Number 26208122, the HKUST-Kaisa Joint Research Institute Project Grant HKJRI3A-055 and the HKUST Startup Grant R9272.","oa":1,"quality_controlled":"1","publisher":"Springer Nature","publication":"Computer Aided Verification","day":"17","year":"2023","has_accepted_license":"1","date_created":"2023-09-10T22:01:12Z","date_published":"2023-07-17T00:00:00Z","doi":"10.1007/978-3-031-37709-9_2","page":"16-39"},{"acknowledgement":"This work was supported in part by the 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 as well as DST/CEFIPRA/INRIA project EQuaVE and SERB Matrices grant MTR/2018/00074.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","year":"2023","has_accepted_license":"1","publication":"International Conference on Computer Aided Verification","day":"17","page":"86-112","date_created":"2023-09-10T22:01:12Z","doi":"10.1007/978-3-031-37709-9_5","date_published":"2023-07-17T00:00:00Z","project":[{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"citation":{"ista":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. 2023. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 86–112.","chicago":"Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” In International Conference on Computer Aided Verification, 13966:86–112. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_5.","apa":"Akshay, S., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_5","ama":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In: International Conference on Computer Aided Verification. Vol 13966. Springer Nature; 2023:86-112. doi:10.1007/978-3-031-37709-9_5","ieee":"S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “MDPs as distribution transformers: Affine invariant synthesis for safety objectives,” in International Conference on Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 86–112.","short":"S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 86–112.","mla":"Akshay, S., et al. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” International Conference on Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 86–112, doi:10.1007/978-3-031-37709-9_5."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (in subscription journal)","author":[{"first_name":"S.","last_name":"Akshay","full_name":"Akshay, S."},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias"},{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"title":"MDPs as distribution transformers: Affine invariant synthesis for safety objectives","abstract":[{"lang":"eng","text":"Markov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason about trajectories of distributions, basic reachability and safety problems are known to be computationally intractable (i.e., Skolem-hard) to solve in such models. Further, we show that even for simple examples of MDPs, strategies for safety objectives over distributions can require infinite memory and randomization.\r\nIn light of this, we present a novel overapproximation approach to synthesize strategies in an MDP, such that a safety objective over the distributions is met. More precisely, we develop a new framework for template-based synthesis of certificates as affine distributional and inductive invariants for safety objectives in MDPs. We provide two algorithms within this framework. One can only synthesize memoryless strategies, but has relative completeness guarantees, while the other can synthesize general strategies. The runtime complexity of both algorithms is in PSPACE. We implement these algorithms and show that they can solve several non-trivial examples."}],"oa_version":"Published Version","alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 13966","month":"07","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031377082"],"eissn":["1611-3349"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"14349","checksum":"f143c8eedf609f20f2aad2eeb496d53f","creator":"dernst","file_size":531745,"date_updated":"2023-09-20T08:46:43Z","file_name":"2023_LNCS_Akshay.pdf","date_created":"2023-09-20T08:46:43Z"}],"ec_funded":1,"volume":13966,"_id":"14317","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2023-07-17","location":"Paris, France","end_date":"2023-07-22","name":"CAV: Computer Aided Verification"},"type":"conference","status":"public","date_updated":"2023-09-20T09:04:40Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2023-09-20T08:46:43Z"},{"date_published":"2023-09-01T00:00:00Z","doi":"10.1242/jcs.261448","date_created":"2023-09-10T22:01:12Z","year":"2023","day":"01","publication":"Journal of Cell Science","publisher":"The Company of Biologists","quality_controlled":"1","oa":1,"author":[{"first_name":"Makoto","full_name":"Nagano, Makoto","last_name":"Nagano"},{"first_name":"Kaito","last_name":"Aoshima","full_name":"Aoshima, Kaito"},{"first_name":"Hiroki","full_name":"Shimamura, Hiroki","last_name":"Shimamura"},{"first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","last_name":"Siekhaus"},{"first_name":"Junko Y.","last_name":"Toshima","full_name":"Toshima, Junko Y."},{"full_name":"Toshima, Jiro","last_name":"Toshima","first_name":"Jiro"}],"external_id":{"pmid":["37539494"]},"article_processing_charge":"No","title":"Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway","citation":{"ieee":"M. Nagano, K. Aoshima, H. Shimamura, D. E. Siekhaus, J. Y. Toshima, and J. Toshima, “Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway,” Journal of Cell Science, vol. 136, no. 17. The Company of Biologists, 2023.","short":"M. Nagano, K. Aoshima, H. Shimamura, D.E. Siekhaus, J.Y. Toshima, J. Toshima, Journal of Cell Science 136 (2023).","apa":"Nagano, M., Aoshima, K., Shimamura, H., Siekhaus, D. E., Toshima, J. Y., & Toshima, J. (2023). Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway. Journal of Cell Science. The Company of Biologists. https://doi.org/10.1242/jcs.261448","ama":"Nagano M, Aoshima K, Shimamura H, Siekhaus DE, Toshima JY, Toshima J. Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway. Journal of Cell Science. 2023;136(17). doi:10.1242/jcs.261448","mla":"Nagano, Makoto, et al. “Distinct Role of TGN-Resident Clathrin Adaptors for Vps21p Activation in the TGN-Endosome Trafficking Pathway.” Journal of Cell Science, vol. 136, no. 17, jcs261448, The Company of Biologists, 2023, doi:10.1242/jcs.261448.","ista":"Nagano M, Aoshima K, Shimamura H, Siekhaus DE, Toshima JY, Toshima J. 2023. Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway. Journal of Cell Science. 136(17), jcs261448.","chicago":"Nagano, Makoto, Kaito Aoshima, Hiroki Shimamura, Daria E Siekhaus, Junko Y. Toshima, and Jiro Toshima. “Distinct Role of TGN-Resident Clathrin Adaptors for Vps21p Activation in the TGN-Endosome Trafficking Pathway.” Journal of Cell Science. The Company of Biologists, 2023. https://doi.org/10.1242/jcs.261448."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"jcs261448","issue":"17","volume":136,"publication_identifier":{"eissn":["1477-9137"],"issn":["0021-9533"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1101/2023.03.27.534325","open_access":"1"}],"month":"09","intvolume":" 136","abstract":[{"text":"Clathrin-mediated vesicle trafficking plays central roles in post-Golgi transport. In yeast (Saccharomyces cerevisiae), the AP-1 complex and GGA adaptors are predicted to generate distinct transport vesicles at the trans-Golgi network (TGN), and the epsin-related proteins Ent3p and Ent5p (collectively Ent3p/5p) act as accessories for these adaptors. Recently, we showed that vesicle transport from the TGN is crucial for yeast Rab5 (Vps21p)-mediated endosome formation, and that Ent3p/5p are crucial for this process, whereas AP-1 and GGA adaptors are dispensable. However, these observations were incompatible with previous studies showing that these adaptors are required for Ent3p/5p recruitment to the TGN, and thus the overall mechanism responsible for regulation of Vps21p activity remains ambiguous. Here, we investigated the functional relationships between clathrin adaptors in post-Golgi-mediated Vps21p activation. We show that AP-1 disruption in the ent3Δ5Δ mutant impaired transport of the Vps21p guanine nucleotide exchange factor Vps9p transport to the Vps21p compartment and severely reduced Vps21p activity. Additionally, GGA adaptors, the phosphatidylinositol-4-kinase Pik1p and Rab11 GTPases Ypt31p and Ypt32p were found to have partially overlapping functions for recruitment of AP-1 and Ent3p/5p to the TGN. These findings suggest a distinct role of clathrin adaptors for Vps21p activation in the TGN–endosome trafficking pathway.","lang":"eng"}],"oa_version":"Preprint","pmid":1,"department":[{"_id":"DaSi"}],"date_updated":"2023-09-20T09:14:15Z","article_type":"original","type":"journal_article","status":"public","_id":"14316"}]