[{"acknowledgement":"We thank Prof. Dr. Thomas Bugnyar for supporting the study and financing the marmoset laboratory, and Alexandra Bohmann and the animal keeping team for their care. Vedrana Šlipogor was funded by University of South Bohemia postdoctoral fellowship.","quality_controlled":"1","publisher":"Wiley","publication":"Developmental Science","day":"01","year":"2023","date_created":"2023-05-14T22:01:00Z","date_published":"2023-09-01T00:00:00Z","doi":"10.1111/desc.13395","article_number":"e13395","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Wagner B, Šlipogor V, Oh J, Varga M, Hoeschele M. 2023. A comparison between common marmosets (Callithrix jacchus) and human infants sheds light on traits proposed to be at the root of human octave equivalence. Developmental Science. 26(5), e13395.","chicago":"Wagner, Bernhard, Vedrana Šlipogor, Jinook Oh, Marion Varga, and Marisa Hoeschele. “A Comparison between Common Marmosets (Callithrix Jacchus) and Human Infants Sheds Light on Traits Proposed to Be at the Root of Human Octave Equivalence.” Developmental Science. Wiley, 2023. https://doi.org/10.1111/desc.13395.","ama":"Wagner B, Šlipogor V, Oh J, Varga M, Hoeschele M. A comparison between common marmosets (Callithrix jacchus) and human infants sheds light on traits proposed to be at the root of human octave equivalence. Developmental Science. 2023;26(5). doi:10.1111/desc.13395","apa":"Wagner, B., Šlipogor, V., Oh, J., Varga, M., & Hoeschele, M. (2023). A comparison between common marmosets (Callithrix jacchus) and human infants sheds light on traits proposed to be at the root of human octave equivalence. Developmental Science. Wiley. https://doi.org/10.1111/desc.13395","ieee":"B. Wagner, V. Šlipogor, J. Oh, M. Varga, and M. Hoeschele, “A comparison between common marmosets (Callithrix jacchus) and human infants sheds light on traits proposed to be at the root of human octave equivalence,” Developmental Science, vol. 26, no. 5. Wiley, 2023.","short":"B. Wagner, V. Šlipogor, J. Oh, M. Varga, M. Hoeschele, Developmental Science 26 (2023).","mla":"Wagner, Bernhard, et al. “A Comparison between Common Marmosets (Callithrix Jacchus) and Human Infants Sheds Light on Traits Proposed to Be at the Root of Human Octave Equivalence.” Developmental Science, vol. 26, no. 5, e13395, Wiley, 2023, doi:10.1111/desc.13395."},"title":"A comparison between common marmosets (Callithrix jacchus) and human infants sheds light on traits proposed to be at the root of human octave equivalence","external_id":{"pmid":["37101383"]},"article_processing_charge":"No","author":[{"last_name":"Wagner","full_name":"Wagner, Bernhard","first_name":"Bernhard"},{"full_name":"Šlipogor, Vedrana","last_name":"Šlipogor","first_name":"Vedrana"},{"last_name":"Oh","full_name":"Oh, Jinook","orcid":"0000-0001-7425-2372","id":"403169A4-080F-11EA-9993-BF3F3DDC885E","first_name":"Jinook"},{"first_name":"Marion","last_name":"Varga","full_name":"Varga, Marion"},{"last_name":"Hoeschele","full_name":"Hoeschele, Marisa","first_name":"Marisa"}],"pmid":1,"oa_version":"None","abstract":[{"lang":"eng","text":"Two notes separated by a doubling in frequency sound similar to humans. This “octave equivalence” is critical to perception and production of music and speech and occurs early in human development. Because it also occurs cross-culturally, a biological basis of octave equivalence has been hypothesized. Members of our team previousy suggested four human traits are at the root of this phenomenon: (1) vocal learning, (2) clear octave information in vocal harmonics, (3) differing vocal ranges, and (4) vocalizing together. Using cross-species studies, we can test how relevant these respective traits are, while controlling for enculturation effects and addressing questions of phylogeny. Common marmosets possess forms of three of the four traits, lacking differing vocal ranges. We tested 11 common marmosets by adapting an established head-turning paradigm, creating a parallel test to an important infant study. Unlike human infants, marmosets responded similarly to tones shifted by an octave or other intervals. Because previous studies with the same head-turning paradigm produced differential results to discernable acoustic stimuli in common marmosets, our results suggest that marmosets do not perceive octave equivalence. Our work suggests differing vocal ranges between adults and children and men and women and the way they are used in singing together may be critical to the development of octave equivalence."}],"intvolume":" 26","month":"09","scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1363-755X"],"eissn":["1467-7687"]},"volume":26,"issue":"5","_id":"12961","status":"public","type":"journal_article","article_type":"original","date_updated":"2023-10-04T11:37:33Z","department":[{"_id":"SyCr"}]},{"status":"public","article_type":"original","type":"journal_article","_id":"12877","department":[{"_id":"VaKa"}],"date_updated":"2023-10-04T11:25:37Z","intvolume":" 233","month":"08","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1905.00890"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider billiards obtained by removing from the plane finitely many strictly convex analytic obstacles satisfying the non-eclipse condition. The restriction of the dynamics to the set of non-escaping orbits is conjugated to a subshift, which provides a natural labeling of periodic orbits. We show that under suitable symmetry and genericity assumptions, the Marked Length Spectrum determines the geometry of the billiard table."}],"ec_funded":1,"volume":233,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1432-1297"],"issn":["0020-9910"]},"project":[{"_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A","call_identifier":"H2020","name":"Spectral rigidity and integrability for billiards and geodesic flows","grant_number":"885707"}],"title":"Marked Length Spectral determination of analytic chaotic billiards with axial symmetries","external_id":{"isi":["000978887600001"],"arxiv":["1905.00890"]},"article_processing_charge":"No","author":[{"first_name":"Jacopo","last_name":"De Simoi","full_name":"De Simoi, Jacopo"},{"first_name":"Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","last_name":"Kaloshin","orcid":"0000-0002-6051-2628","full_name":"Kaloshin, Vadim"},{"first_name":"Martin","last_name":"Leguil","full_name":"Leguil, Martin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"De Simoi, Jacopo, et al. “Marked Length Spectral Determination of Analytic Chaotic Billiards with Axial Symmetries.” Inventiones Mathematicae, vol. 233, Springer Nature, 2023, pp. 829–901, doi:10.1007/s00222-023-01191-8.","ieee":"J. De Simoi, V. Kaloshin, and M. Leguil, “Marked Length Spectral determination of analytic chaotic billiards with axial symmetries,” Inventiones Mathematicae, vol. 233. Springer Nature, pp. 829–901, 2023.","short":"J. De Simoi, V. Kaloshin, M. Leguil, Inventiones Mathematicae 233 (2023) 829–901.","apa":"De Simoi, J., Kaloshin, V., & Leguil, M. (2023). Marked Length Spectral determination of analytic chaotic billiards with axial symmetries. Inventiones Mathematicae. Springer Nature. https://doi.org/10.1007/s00222-023-01191-8","ama":"De Simoi J, Kaloshin V, Leguil M. Marked Length Spectral determination of analytic chaotic billiards with axial symmetries. Inventiones Mathematicae. 2023;233:829-901. doi:10.1007/s00222-023-01191-8","chicago":"De Simoi, Jacopo, Vadim Kaloshin, and Martin Leguil. “Marked Length Spectral Determination of Analytic Chaotic Billiards with Axial Symmetries.” Inventiones Mathematicae. Springer Nature, 2023. https://doi.org/10.1007/s00222-023-01191-8.","ista":"De Simoi J, Kaloshin V, Leguil M. 2023. Marked Length Spectral determination of analytic chaotic billiards with axial symmetries. Inventiones Mathematicae. 233, 829–901."},"oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"J.D.S. and M.L. have been partially supported by the NSERC Discovery grant, reference number 502617-2017. M.L. was also supported by the ERC project 692925 NUHGD of Sylvain Crovisier, by the ANR AAPG 2021 PRC CoSyDy: Conformally symplectic dynamics, beyond symplectic dynamics (ANR-CE40-0014), and by the ANR JCJC PADAWAN: Parabolic dynamics, bifurcations and wandering domains (ANR-21-CE40-0012). V.K. acknowledges partial support of the NSF grant DMS-1402164 and ERC Grant # 885707.","date_created":"2023-04-30T22:01:05Z","doi":"10.1007/s00222-023-01191-8","date_published":"2023-08-01T00:00:00Z","page":"829-901","publication":"Inventiones Mathematicae","day":"01","year":"2023","isi":1},{"oa_version":"Published Version","pmid":1,"abstract":[{"text":"Statistics of natural scenes are not uniform - their structure varies dramatically from ground to sky. It remains unknown whether these non-uniformities are reflected in the large-scale organization of the early visual system and what benefits such adaptations would confer. Here, by relying on the efficient coding hypothesis, we predict that changes in the structure of receptive fields across visual space increase the efficiency of sensory coding. We show experimentally that, in agreement with our predictions, receptive fields of retinal ganglion cells change their shape along the dorsoventral retinal axis, with a marked surround asymmetry at the visual horizon. Our work demonstrates that, according to principles of efficient coding, the panoramic structure of natural scenes is exploited by the retina across space and cell-types.","lang":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"PreCl"},{"_id":"LifeSc"},{"_id":"Bio"}],"month":"04","intvolume":" 26","scopus_import":"1","file":[{"success":1,"file_id":"14395","checksum":"a33d91e398e548f34003170e10988368","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_NatureNeuroscience_Gupta.pdf","date_created":"2023-10-04T11:40:51Z","creator":"dernst","file_size":6144866,"date_updated":"2023-10-04T11:40:51Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1097-6256"],"eissn":["1546-1726"]},"publication_status":"published","volume":26,"related_material":{"record":[{"relation":"research_data","id":"12370","status":"public"}]},"ec_funded":1,"_id":"12349","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)"},"ddc":["570"],"date_updated":"2023-10-04T11:41:05Z","file_date_updated":"2023-10-04T11:40:51Z","department":[{"_id":"GradSch"},{"_id":"MaJö"}],"acknowledgement":"We thank Hiroki Asari for sharing the dataset of naturalistic images, Anton Sumser for sharing visual stimulus code, Yoav Ben Simon for initial explorative work with the generation of AAVs, and Tomas Vega-Zuñiga for help with immunostainings. We also thank Gasper Tkacik and members of the Neuroethology group for their comments on the manuscript. This research was supported by the Scientific Service Units of IST Austria through resources provided by Scientific Computing, the Preclinical Facility, the Lab Support Facility, and the Imaging and Optics Facility. This work was supported by European Union Horizon 2020 Marie Skłodowska-Curie grant 665385 (DG), Austrian Science Fund (FWF) stand-alone grant P 34015 (WM), Human Frontiers Science Program LT000256/2018-L (AS), EMBO ALTF 1098-2017 (AS) and the European Research Council Starting Grant 756502 (MJ).","quality_controlled":"1","publisher":"Springer Nature","oa":1,"day":"01","publication":"Nature Neuroscience","has_accepted_license":"1","isi":1,"year":"2023","doi":"10.1038/s41593-023-01280-0","date_published":"2023-04-01T00:00:00Z","date_created":"2023-01-23T14:14:19Z","page":"606-614","project":[{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","grant_number":"P34015","name":"Efficient coding with biophysical realism"},{"call_identifier":"H2020","_id":"2634E9D2-B435-11E9-9278-68D0E5697425","grant_number":"756502","name":"Circuits of Visual Attention"},{"grant_number":"LT000256","name":"Neuronal networks of salience and spatial detection in the murine superior colliculus","_id":"266D407A-B435-11E9-9278-68D0E5697425"},{"_id":"264FEA02-B435-11E9-9278-68D0E5697425","name":"Connecting sensory with motor processing in the superior colliculus","grant_number":"ALTF 1098-2017"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Gupta, Divyansh, Wiktor F Mlynarski, Anton L Sumser, Olga Symonova, Jan Svaton, and Maximilian A Jösch. “Panoramic Visual Statistics Shape Retina-Wide Organization of Receptive Fields.” Nature Neuroscience. Springer Nature, 2023. https://doi.org/10.1038/s41593-023-01280-0.","ista":"Gupta D, Mlynarski WF, Sumser AL, Symonova O, Svaton J, Jösch MA. 2023. Panoramic visual statistics shape retina-wide organization of receptive fields. Nature Neuroscience. 26, 606–614.","mla":"Gupta, Divyansh, et al. “Panoramic Visual Statistics Shape Retina-Wide Organization of Receptive Fields.” Nature Neuroscience, vol. 26, Springer Nature, 2023, pp. 606–14, doi:10.1038/s41593-023-01280-0.","short":"D. Gupta, W.F. Mlynarski, A.L. Sumser, O. Symonova, J. Svaton, M.A. Jösch, Nature Neuroscience 26 (2023) 606–614.","ieee":"D. Gupta, W. F. Mlynarski, A. L. Sumser, O. Symonova, J. Svaton, and M. A. Jösch, “Panoramic visual statistics shape retina-wide organization of receptive fields,” Nature Neuroscience, vol. 26. Springer Nature, pp. 606–614, 2023.","apa":"Gupta, D., Mlynarski, W. F., Sumser, A. L., Symonova, O., Svaton, J., & Jösch, M. A. (2023). Panoramic visual statistics shape retina-wide organization of receptive fields. Nature Neuroscience. Springer Nature. https://doi.org/10.1038/s41593-023-01280-0","ama":"Gupta D, Mlynarski WF, Sumser AL, Symonova O, Svaton J, Jösch MA. Panoramic visual statistics shape retina-wide organization of receptive fields. Nature Neuroscience. 2023;26:606-614. doi:10.1038/s41593-023-01280-0"},"title":"Panoramic visual statistics shape retina-wide organization of receptive fields","author":[{"first_name":"Divyansh","id":"2A485EBE-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Divyansh","orcid":"0000-0001-7400-6665","last_name":"Gupta"},{"full_name":"Mlynarski, Wiktor F","last_name":"Mlynarski","first_name":"Wiktor F","id":"358A453A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sumser","orcid":"0000-0002-4792-1881","full_name":"Sumser, Anton L","first_name":"Anton L","id":"3320A096-F248-11E8-B48F-1D18A9856A87"},{"id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","first_name":"Olga","last_name":"Symonova","orcid":"0000-0003-2012-9947","full_name":"Symonova, Olga"},{"last_name":"Svaton","full_name":"Svaton, Jan","orcid":"0000-0002-6198-2939","id":"f7f724c3-9d6f-11ed-9f44-e5c5f3a5bee2","first_name":"Jan"},{"last_name":"Jösch","orcid":"0000-0002-3937-1330","full_name":"Jösch, Maximilian A","first_name":"Maximilian A","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"pmid":["36959418"],"isi":["000955258300002"]},"article_processing_charge":"Yes (in subscription journal)"},{"type":"research_data","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","_id":"12370","file_date_updated":"2023-01-26T10:51:34Z","department":[{"_id":"GradSch"},{"_id":"MaJö"}],"date_updated":"2023-10-04T11:41:04Z","ddc":["571"],"month":"01","abstract":[{"text":"Statistics of natural scenes are not uniform - their structure varies dramatically from ground to sky. It remains unknown whether these non-uniformities are reflected in the large-scale organization of the early visual system and what benefits such adaptations would confer. Here, by relying on the efficient coding hypothesis, we predict that changes in the structure of receptive fields across visual space increase the efficiency of sensory coding. We show experimentally that, in agreement with our predictions, receptive fields of retinal ganglion cells change their shape along the dorsoventral retinal axis, with a marked surround asymmetry at the visual horizon. Our work demonstrates that, according to principles of efficient coding, the panoramic structure of natural scenes is exploited by the retina across space and cell-types. ","lang":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"M-Shop"},{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"}],"oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"12349","relation":"used_in_publication"}]},"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","contributor":[{"last_name":"Symonova","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","first_name":"Olga"},{"last_name":"Mlynarski","first_name":"Wiktor F","id":"358A453A-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher"},{"last_name":"Svaton","contributor_type":"researcher","id":"f7f724c3-9d6f-11ed-9f44-e5c5f3a5bee2","first_name":"Jan"}],"ec_funded":1,"file":[{"content_type":"text/plain","relation":"main_file","access_level":"open_access","success":1,"checksum":"172cd1c315cbf063c122298396bc17a7","file_id":"12396","file_size":1917,"date_updated":"2023-01-26T10:51:34Z","creator":"dgupta","file_name":"readme_exvivo.txt","date_created":"2023-01-26T10:51:34Z"},{"file_id":"12397","checksum":"d3cecda51cad86b1182195731c01a14f","success":1,"access_level":"open_access","relation":"main_file","content_type":"text/plain","date_created":"2023-01-26T10:50:50Z","file_name":"readme_invivo.txt","creator":"dgupta","date_updated":"2023-01-26T10:50:50Z","file_size":1585},{"date_updated":"2023-01-26T10:43:30Z","file_size":5019459775,"creator":"dgupta","date_created":"2023-01-26T10:43:30Z","file_name":"exvivo_RFs.mat","content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","checksum":"b85018b27f2c43a6d94ee0e8b841220d","file_id":"12398","success":1},{"date_created":"2023-01-26T10:40:35Z","file_name":"RGC_in_vivo_RFs_selected.mat","creator":"dgupta","date_updated":"2023-01-26T10:40:35Z","file_size":94999721,"file_id":"12399","checksum":"f75dccd96a3f837cdeed65b5134e697e","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream"},{"creator":"dgupta","file_size":720893739,"date_updated":"2023-01-25T16:03:49Z","file_name":"invivo_BL6-eyeGC8m-dC-3_210924_1534_Result.mat","date_created":"2023-01-25T16:03:49Z","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"checksum":"d41836ffe03ea0efb677de31287c8d2e","file_id":"12382"},{"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","checksum":"0a0cba5208241a95f9bb7684d0a43afa","file_id":"12383","success":1,"creator":"dgupta","date_updated":"2023-01-25T16:03:30Z","file_size":248122209,"date_created":"2023-01-25T16:03:30Z","file_name":"invivo_BL6-eyeGC8m-dC-3_211026_1235_Result.mat"},{"date_created":"2023-01-25T16:04:54Z","file_name":"invivo_BL6-eyeGC8m-dC-3_211202_1505_Result.mat","date_updated":"2023-01-25T16:04:54Z","file_size":1757729346,"creator":"dgupta","file_id":"12384","checksum":"cf72c1f325631212f305ff1a6d342bc3","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file"},{"date_created":"2023-01-25T16:04:41Z","file_name":"invivo_BL6-eyeGC8m-dC-3_211208_1738_Result.mat","creator":"dgupta","date_updated":"2023-01-25T16:04:41Z","file_size":1177344595,"checksum":"f4cd25f37d433a7dced3aa8cc326c755","file_id":"12385","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream"},{"relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"checksum":"8c31637d447f2088fdb5ba1c6775f243","file_id":"12386","creator":"dgupta","file_size":2246592895,"date_updated":"2023-01-25T16:06:22Z","file_name":"invivo_BL6-eyeGC8m-dC-3_220111_1735_Result.mat","date_created":"2023-01-25T16:06:22Z"},{"date_created":"2023-01-25T16:07:41Z","file_name":"invivo_BL6-eyeGC8m-dC-4_220216_0950_Result.mat","date_updated":"2023-01-25T16:07:41Z","file_size":2151341770,"creator":"dgupta","checksum":"246d660ef06a9151c59b74490d991460","file_id":"12387","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file"},{"file_id":"12393","checksum":"b32987dd4589d05b9dfadb93d4178c0d","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","date_created":"2023-01-26T10:19:02Z","file_name":"invivo_BL6-eyeGC8m-dC-4_220428_1351_Result.mat","creator":"dgupta","date_updated":"2023-01-26T10:19:02Z","file_size":3719145736},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"6c88ca7d1df405f04002146d251dc22e","file_id":"12395","file_size":5818789752,"date_updated":"2023-01-26T10:34:46Z","creator":"dgupta","file_name":"invivo_BL6-eyeGC8m-dC-4_220502_1357_Result.mat","date_created":"2023-01-26T10:34:46Z"},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"file_id":"12394","checksum":"494057076bb0b0a28e4b7146bb50113c","file_size":2614677996,"date_updated":"2023-01-26T10:23:19Z","creator":"dgupta","file_name":"invivo_BL6-eyeGC8m-dC-4_220524_1726_Result.mat","date_created":"2023-01-26T10:23:19Z"},{"creator":"dgupta","file_size":1840481462,"date_updated":"2023-01-25T16:20:51Z","file_name":"invivo_BL6-eyeGC8m-dC-5_220613_1750_Result.mat","date_created":"2023-01-25T16:20:51Z","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"file_id":"12388","checksum":"e51015d43ede6b1628803c58e424f99f"},{"checksum":"9483686a44e69eadea428b705c33a9a2","file_id":"12389","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","date_created":"2023-01-25T16:23:02Z","file_name":"invivo_BL6-eyeGC8m-dC-5_220630_1518_Result.mat","date_updated":"2023-01-25T16:23:02Z","file_size":1617777136,"creator":"dgupta"}],"project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"P34015","name":"Efficient coding with biophysical realism","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"},{"_id":"2634E9D2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Circuits of Visual Attention","grant_number":"756502"},{"name":"Neuronal networks of salience and spatial detection in the murine superior colliculus","grant_number":"LT000256","_id":"266D407A-B435-11E9-9278-68D0E5697425"},{"_id":"264FEA02-B435-11E9-9278-68D0E5697425","grant_number":"ALTF 1098-2017","name":"Connecting sensory with motor processing in the superior colliculus"}],"author":[{"id":"2A485EBE-F248-11E8-B48F-1D18A9856A87","first_name":"Divyansh","last_name":"Gupta","orcid":"0000-0001-7400-6665","full_name":"Gupta, Divyansh"},{"id":"3320A096-F248-11E8-B48F-1D18A9856A87","first_name":"Anton L","orcid":"0000-0002-4792-1881","full_name":"Sumser, Anton L","last_name":"Sumser"},{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","first_name":"Maximilian A","full_name":"Jösch, Maximilian A","orcid":"0000-0002-3937-1330","last_name":"Jösch"}],"article_processing_charge":"No","title":"Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields","citation":{"ista":"Gupta D, Sumser AL, Jösch MA. 2023. Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields, Institute of Science and Technology Austria, 10.15479/AT:ISTA:12370.","chicago":"Gupta, Divyansh, Anton L Sumser, and Maximilian A Jösch. “Research Data for: Panoramic Visual Statistics Shape Retina-Wide Organization of Receptive Fields.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:12370.","ieee":"D. Gupta, A. L. Sumser, and M. A. Jösch, “Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields.” Institute of Science and Technology Austria, 2023.","short":"D. Gupta, A.L. Sumser, M.A. Jösch, (2023).","ama":"Gupta D, Sumser AL, Jösch MA. Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields. 2023. doi:10.15479/AT:ISTA:12370","apa":"Gupta, D., Sumser, A. L., & Jösch, M. A. (2023). Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12370","mla":"Gupta, Divyansh, et al. Research Data for: Panoramic Visual Statistics Shape Retina-Wide Organization of Receptive Fields. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12370."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Institute of Science and Technology Austria","oa":1,"date_published":"2023-01-26T00:00:00Z","doi":"10.15479/AT:ISTA:12370","date_created":"2023-01-25T12:45:18Z","has_accepted_license":"1","year":"2023","day":"26"},{"quality_controlled":"1","publisher":"Elsevier","acknowledgement":"This work was carried out within the framework of the project Combenergy, PID2019-105490RB-C32, financed by the Spanish MCIN/AEI/10.13039/501100011033. ICN2 is supported by the Severo Ochoa program from Spanish MCIN / AEI (Grant No.: CEX2021-001214-S). IREC and ICN2 are funded by the CERCA Programme from the Generalitat de Catalunya. Part of the present work has been performed in the frameworks of the Universitat de Barcelona Nanoscience PhD program. ICN2 acknowledges funding from Generalitat de Catalunya 2021SGR00457. This study was supported by MCIN with funding from European Union NextGenerationEU (PRTR-C17.I1) and Generalitat de Catalunya. The authors thank the support from the project NANOGEN (PID2020-116093RB-C43), funded by MCIN/ AEI/10.13039/501100011033/ and by “ERDF A way of making Europe”, by the European Union. The project on which these results are based has received funding from the European Union's Horizon 2020 research and innovation programme under Marie Skłodowska-Curie grant agreement No. 801342 (Tecniospring INDUSTRY) and the Government of Catalonia's Agency for Business Competitiveness (ACCIÓ). J. Li is grateful for the project supported by the Natural Science Foundation of Sichuan (2022NSFSC1229). M.I. acknowledges funding by ISTA and the Werner Siemens Foundation.","doi":"10.1016/j.jelechem.2023.117369","date_published":"2023-05-01T00:00:00Z","date_created":"2023-04-16T22:01:06Z","day":"01","publication":"Journal of Electroanalytical Chemistry","isi":1,"year":"2023","project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"article_number":"117369","title":"Phosphorous incorporation into palladium tin nanoparticles for the electrocatalytic formate oxidation reaction","author":[{"full_name":"Montaña-Mora, Guillem","last_name":"Montaña-Mora","first_name":"Guillem"},{"full_name":"Qi, Xueqiang","last_name":"Qi","first_name":"Xueqiang"},{"first_name":"Xiang","full_name":"Wang, Xiang","last_name":"Wang"},{"full_name":"Chacón-Borrero, Jesus","last_name":"Chacón-Borrero","first_name":"Jesus"},{"full_name":"Martinez-Alanis, Paulina R.","last_name":"Martinez-Alanis","first_name":"Paulina R."},{"first_name":"Xiaoting","full_name":"Yu, Xiaoting","last_name":"Yu"},{"first_name":"Junshan","full_name":"Li, Junshan","last_name":"Li"},{"first_name":"Qian","full_name":"Xue, Qian","last_name":"Xue"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843"},{"first_name":"Andreu","full_name":"Cabot, Andreu","last_name":"Cabot"}],"article_processing_charge":"No","external_id":{"isi":["000967060900001"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Montaña-Mora G, Qi X, Wang X, Chacón-Borrero J, Martinez-Alanis PR, Yu X, Li J, Xue Q, Arbiol J, Ibáñez M, Cabot A. 2023. Phosphorous incorporation into palladium tin nanoparticles for the electrocatalytic formate oxidation reaction. Journal of Electroanalytical Chemistry. 936, 117369.","chicago":"Montaña-Mora, Guillem, Xueqiang Qi, Xiang Wang, Jesus Chacón-Borrero, Paulina R. Martinez-Alanis, Xiaoting Yu, Junshan Li, et al. “Phosphorous Incorporation into Palladium Tin Nanoparticles for the Electrocatalytic Formate Oxidation Reaction.” Journal of Electroanalytical Chemistry. Elsevier, 2023. https://doi.org/10.1016/j.jelechem.2023.117369.","ieee":"G. Montaña-Mora et al., “Phosphorous incorporation into palladium tin nanoparticles for the electrocatalytic formate oxidation reaction,” Journal of Electroanalytical Chemistry, vol. 936. Elsevier, 2023.","short":"G. Montaña-Mora, X. Qi, X. Wang, J. Chacón-Borrero, P.R. Martinez-Alanis, X. Yu, J. Li, Q. Xue, J. Arbiol, M. Ibáñez, A. Cabot, Journal of Electroanalytical Chemistry 936 (2023).","apa":"Montaña-Mora, G., Qi, X., Wang, X., Chacón-Borrero, J., Martinez-Alanis, P. R., Yu, X., … Cabot, A. (2023). Phosphorous incorporation into palladium tin nanoparticles for the electrocatalytic formate oxidation reaction. Journal of Electroanalytical Chemistry. Elsevier. https://doi.org/10.1016/j.jelechem.2023.117369","ama":"Montaña-Mora G, Qi X, Wang X, et al. Phosphorous incorporation into palladium tin nanoparticles for the electrocatalytic formate oxidation reaction. Journal of Electroanalytical Chemistry. 2023;936. doi:10.1016/j.jelechem.2023.117369","mla":"Montaña-Mora, Guillem, et al. “Phosphorous Incorporation into Palladium Tin Nanoparticles for the Electrocatalytic Formate Oxidation Reaction.” Journal of Electroanalytical Chemistry, vol. 936, 117369, Elsevier, 2023, doi:10.1016/j.jelechem.2023.117369."},"month":"05","intvolume":" 936","scopus_import":"1","oa_version":"None","abstract":[{"lang":"eng","text":"The deployment of direct formate fuel cells (DFFCs) relies on the development of active and stable catalysts for the formate oxidation reaction (FOR). Palladium, providing effective full oxidation of formate to CO2, has been widely used as FOR catalyst, but it suffers from low stability, moderate activity, and high cost. Herein, we detail a colloidal synthesis route for the incorporation of P on Pd2Sn nanoparticles. These nanoparticles are dispersed on carbon black and the obtained composite is used as electrocatalytic material for the FOR. The Pd2Sn0.8P-based electrodes present outstanding catalytic activities with record mass current densities up to 10.0 A mgPd-1, well above those of Pd1.6Sn/C reference electrode. These high current densities are further enhanced by increasing the temperature from 25 °C to 40 °C. The Pd2Sn0.8P electrode also allows for slowing down the rapid current decay that generally happens during operation and can be rapidly re-activated through potential cycling. The excellent catalytic performance obtained is rationalized using density functional theory (DFT) calculations."}],"volume":936,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1572-6657"]},"publication_status":"published","status":"public","type":"journal_article","article_type":"original","_id":"12829","department":[{"_id":"MaIb"}],"date_updated":"2023-10-04T11:52:33Z"},{"oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"Open access funding provided by the Austrian Science Fund (FWF). This research was supported by the FWF grant, Project number I4245-N35, and by the Deutsche Forschungsgemeinschaft (DFG - German Research Foundation) - Project-ID 195170736 - TRR109.","page":"123-153","date_created":"2023-03-26T22:01:09Z","doi":"10.1007/s00454-023-00484-2","date_published":"2023-07-01T00:00:00Z","year":"2023","has_accepted_license":"1","isi":1,"publication":"Discrete and Computational Geometry","day":"01","project":[{"grant_number":"I04245","name":"Algebraic Footprints of Geometric Features in Homology","call_identifier":"FWF","_id":"26AD5D90-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000948148000001"]},"author":[{"full_name":"Kourimska, Hana","orcid":"0000-0001-7841-0091","last_name":"Kourimska","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","first_name":"Hana"}],"title":"Discrete yamabe problem for polyhedral surfaces","citation":{"chicago":"Kourimska, Hana. “Discrete Yamabe Problem for Polyhedral Surfaces.” Discrete and Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-023-00484-2.","ista":"Kourimska H. 2023. Discrete yamabe problem for polyhedral surfaces. Discrete and Computational Geometry. 70, 123–153.","mla":"Kourimska, Hana. “Discrete Yamabe Problem for Polyhedral Surfaces.” Discrete and Computational Geometry, vol. 70, Springer Nature, 2023, pp. 123–53, doi:10.1007/s00454-023-00484-2.","ieee":"H. Kourimska, “Discrete yamabe problem for polyhedral surfaces,” Discrete and Computational Geometry, vol. 70. Springer Nature, pp. 123–153, 2023.","short":"H. Kourimska, Discrete and Computational Geometry 70 (2023) 123–153.","apa":"Kourimska, H. (2023). Discrete yamabe problem for polyhedral surfaces. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-023-00484-2","ama":"Kourimska H. Discrete yamabe problem for polyhedral surfaces. Discrete and Computational Geometry. 2023;70:123-153. doi:10.1007/s00454-023-00484-2"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","intvolume":" 70","month":"07","abstract":[{"text":"We study a new discretization of the Gaussian curvature for polyhedral surfaces. This discrete Gaussian curvature is defined on each conical singularity of a polyhedral surface as the quotient of the angle defect and the area of the Voronoi cell corresponding to the singularity. We divide polyhedral surfaces into discrete conformal classes using a generalization of discrete conformal equivalence pioneered by Feng Luo. We subsequently show that, in every discrete conformal class, there exists a polyhedral surface with constant discrete Gaussian curvature. We also provide explicit examples to demonstrate that this surface is in general not unique.","lang":"eng"}],"oa_version":"Published Version","volume":70,"publication_status":"published","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"language":[{"iso":"eng"}],"file":[{"file_size":1026683,"date_updated":"2023-10-04T11:46:24Z","creator":"dernst","file_name":"2023_DiscreteGeometry_Kourimska.pdf","date_created":"2023-10-04T11:46:24Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"cdbf90ba4a7ddcb190d37b9e9d4cb9d3","file_id":"14396"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","_id":"12764","file_date_updated":"2023-10-04T11:46:24Z","department":[{"_id":"HeEd"}],"date_updated":"2023-10-04T11:46:48Z","ddc":["510"]},{"page":"26","doi":"10.15479/at:ista:13331","date_published":"2023-07-31T00:00:00Z","date_created":"2023-07-31T10:20:55Z","has_accepted_license":"1","year":"2023","day":"31","publisher":"Institute of Science and Technology Austria","oa":1,"author":[{"full_name":"Köse, Seyda","last_name":"Köse","id":"8ba3170d-dc85-11ea-9058-c4251c96a6eb","first_name":"Seyda"}],"article_processing_charge":"No","title":"Exterior algebra and combinatorics","citation":{"chicago":"Köse, Seyda. “Exterior Algebra and Combinatorics.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13331.","ista":"Köse S. 2023. Exterior algebra and combinatorics. Institute of Science and Technology Austria.","mla":"Köse, Seyda. Exterior Algebra and Combinatorics. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13331.","apa":"Köse, S. (2023). Exterior algebra and combinatorics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:13331","ama":"Köse S. Exterior algebra and combinatorics. 2023. doi:10.15479/at:ista:13331","ieee":"S. Köse, “Exterior algebra and combinatorics,” Institute of Science and Technology Austria, 2023.","short":"S. Köse, Exterior Algebra and Combinatorics, Institute of Science and Technology Austria, 2023."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","related_material":{"record":[{"id":"12680","status":"public","relation":"part_of_dissertation"}]},"publication_identifier":{"issn":["2791-4585"]},"publication_status":"published","degree_awarded":"MS","file":[{"relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","checksum":"96ee518d796d02af71395622c45de03c","file_id":"13333","creator":"skoese","file_size":28684,"date_updated":"2023-07-31T10:16:32Z","file_name":"Exterior Algebra and Combinatorics.zip","date_created":"2023-07-31T10:16:32Z"},{"date_updated":"2023-08-03T15:28:55Z","file_size":4953418,"creator":"skoese","date_created":"2023-08-03T15:28:55Z","file_name":"thesis-pdfa.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"13480","checksum":"f610f4713f88bc477de576aaa46b114e","success":1}],"language":[{"iso":"eng"}],"alternative_title":["ISTA Master's Thesis"],"month":"07","abstract":[{"lang":"eng","text":"The extension of extremal combinatorics to the setting of exterior algebra is a work\r\nin progress that gained attention recently. In this thesis, we study the combinatorial structure of exterior algebra by introducing a dictionary that translates the notions from the set systems into the framework of exterior algebra. We show both generalizations of celebrated Erdös--Ko--Rado theorem and Hilton--Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms.\r\n"}],"oa_version":"Published Version","department":[{"_id":"GradSch"},{"_id":"UlWa"}],"file_date_updated":"2023-08-03T15:28:55Z","supervisor":[{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"date_updated":"2023-10-04T11:54:56Z","ddc":["510","516"],"type":"dissertation","status":"public","_id":"13331"},{"title":"Behavioural defences against parasites across host social structures","external_id":{"isi":["000948940500001"]},"article_processing_charge":"No","author":[{"first_name":"Sebastian","last_name":"Stockmaier","full_name":"Stockmaier, Sebastian"},{"first_name":"Yuko","last_name":"Ulrich","full_name":"Ulrich, Yuko"},{"full_name":"Albery, Gregory F.","last_name":"Albery","first_name":"Gregory F."},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer"},{"first_name":"Patricia C.","full_name":"Lopes, Patricia C.","last_name":"Lopes"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Stockmaier, S., Ulrich, Y., Albery, G. F., Cremer, S., & Lopes, P. C. (2023). Behavioural defences against parasites across host social structures. Functional Ecology. British Ecological Society. https://doi.org/10.1111/1365-2435.14310","ama":"Stockmaier S, Ulrich Y, Albery GF, Cremer S, Lopes PC. Behavioural defences against parasites across host social structures. Functional Ecology. 2023;37(4):809-820. doi:10.1111/1365-2435.14310","ieee":"S. Stockmaier, Y. Ulrich, G. F. Albery, S. Cremer, and P. C. Lopes, “Behavioural defences against parasites across host social structures,” Functional Ecology, vol. 37, no. 4. British Ecological Society, pp. 809–820, 2023.","short":"S. Stockmaier, Y. Ulrich, G.F. Albery, S. Cremer, P.C. Lopes, Functional Ecology 37 (2023) 809–820.","mla":"Stockmaier, Sebastian, et al. “Behavioural Defences against Parasites across Host Social Structures.” Functional Ecology, vol. 37, no. 4, British Ecological Society, 2023, pp. 809–20, doi:10.1111/1365-2435.14310.","ista":"Stockmaier S, Ulrich Y, Albery GF, Cremer S, Lopes PC. 2023. Behavioural defences against parasites across host social structures. Functional Ecology. 37(4), 809–820.","chicago":"Stockmaier, Sebastian, Yuko Ulrich, Gregory F. Albery, Sylvia Cremer, and Patricia C. Lopes. “Behavioural Defences against Parasites across Host Social Structures.” Functional Ecology. British Ecological Society, 2023. https://doi.org/10.1111/1365-2435.14310."},"publisher":"British Ecological Society","quality_controlled":"1","date_created":"2023-03-26T22:01:09Z","doi":"10.1111/1365-2435.14310","date_published":"2023-04-01T00:00:00Z","page":"809-820","publication":"Functional Ecology","day":"01","year":"2023","isi":1,"status":"public","article_type":"review","type":"journal_article","_id":"12765","department":[{"_id":"SyCr"}],"date_updated":"2023-10-04T11:50:15Z","intvolume":" 37","month":"04","scopus_import":"1","oa_version":"None","abstract":[{"text":"Animals exhibit a variety of behavioural defences against socially transmitted parasites. These defences evolved to increase host fitness by avoiding, resisting or tolerating infection.\r\nBecause they can occur in both infected individuals and their uninfected social partners, these defences often have important consequences for the social group.\r\nHere, we discuss the evolution and ecology of anti-parasite behavioural defences across a taxonomically wide social spectrum, considering colonial groups, stable groups, transitional groups and solitary animals.\r\nWe discuss avoidance, resistance and tolerance behaviours across these social group structures, identifying how social complexity, group composition and interdependent social relationships may contribute to the expression and evolution of behavioural strategies.\r\nFinally, we outline avenues for further investigation such as approaches to quantify group-level responses, and the connection of the physiological and behavioural response to parasites in different social contexts.","lang":"eng"}],"volume":37,"issue":"4","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0269-8463"],"eissn":["1365-2435"]}},{"status":"public","article_type":"letter_note","type":"journal_article","_id":"12680","department":[{"_id":"UlWa"},{"_id":"GradSch"}],"date_updated":"2023-10-04T11:54:57Z","intvolume":" 346","month":"06","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2201.10892"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"The celebrated Erdős–Ko–Rado theorem about the maximal size of an intersecting family of r-element subsets of was extended to the setting of exterior algebra in [5, Theorem 2.3] and in [6, Theorem 1.4]. However, the equality case has not been settled yet. In this short note, we show that the extension of the Erdős–Ko–Rado theorem and the characterization of the equality case therein, as well as those of the Hilton–Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms follow from a folklore puzzle about possible arrangements of an intersecting family of lines."}],"volume":346,"related_material":{"record":[{"id":"13331","status":"public","relation":"dissertation_contains"}]},"issue":"6","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0012-365X"]},"article_number":"113363","title":"Erdős-Ko-Rado and Hilton-Milner theorems for two-forms","external_id":{"arxiv":["2201.10892"]},"article_processing_charge":"No","author":[{"id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","first_name":"Grigory","last_name":"Ivanov","full_name":"Ivanov, Grigory"},{"last_name":"Köse","full_name":"Köse, Seyda","first_name":"Seyda","id":"8ba3170d-dc85-11ea-9058-c4251c96a6eb"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"G. Ivanov and S. Köse, “Erdős-Ko-Rado and Hilton-Milner theorems for two-forms,” Discrete Mathematics, vol. 346, no. 6. Elsevier, 2023.","short":"G. Ivanov, S. Köse, Discrete Mathematics 346 (2023).","ama":"Ivanov G, Köse S. Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. 2023;346(6). doi:10.1016/j.disc.2023.113363","apa":"Ivanov, G., & Köse, S. (2023). Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2023.113363","mla":"Ivanov, Grigory, and Seyda Köse. “Erdős-Ko-Rado and Hilton-Milner Theorems for Two-Forms.” Discrete Mathematics, vol. 346, no. 6, 113363, Elsevier, 2023, doi:10.1016/j.disc.2023.113363.","ista":"Ivanov G, Köse S. 2023. Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. 346(6), 113363.","chicago":"Ivanov, Grigory, and Seyda Köse. “Erdős-Ko-Rado and Hilton-Milner Theorems for Two-Forms.” Discrete Mathematics. Elsevier, 2023. https://doi.org/10.1016/j.disc.2023.113363."},"oa":1,"quality_controlled":"1","publisher":"Elsevier","date_created":"2023-02-26T23:01:00Z","doi":"10.1016/j.disc.2023.113363","date_published":"2023-06-01T00:00:00Z","publication":"Discrete Mathematics","day":"01","year":"2023"},{"scopus_import":"1","intvolume":" 401","month":"07","abstract":[{"lang":"eng","text":"In the physics literature the spectral form factor (SFF), the squared Fourier transform of the empirical eigenvalue density, is the most common tool to test universality for disordered quantum systems, yet previous mathematical results have been restricted only to two exactly solvable models (Forrester in J Stat Phys 183:33, 2021. https://doi.org/10.1007/s10955-021-02767-5, Commun Math Phys 387:215–235, 2021. https://doi.org/10.1007/s00220-021-04193-w). We rigorously prove the physics prediction on SFF up to an intermediate time scale for a large class of random matrices using a robust method, the multi-resolvent local laws. Beyond Wigner matrices we also consider the monoparametric ensemble and prove that universality of SFF can already be triggered by a single random parameter, supplementing the recently proven Wigner–Dyson universality (Cipolloni et al. in Probab Theory Relat Fields, 2021. https://doi.org/10.1007/s00440-022-01156-7) to larger spectral scales. Remarkably, extensive numerics indicates that our formulas correctly predict the SFF in the entire slope-dip-ramp regime, as customarily called in physics."}],"oa_version":"Published Version","ec_funded":1,"volume":401,"publication_status":"published","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2023-10-04T12:09:18Z","file_name":"2023_CommMathPhysics_Cipolloni.pdf","creator":"dernst","date_updated":"2023-10-04T12:09:18Z","file_size":859967,"file_id":"14397","checksum":"72057940f76654050ca84a221f21786c","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","_id":"12792","department":[{"_id":"LaEr"}],"file_date_updated":"2023-10-04T12:09:18Z","date_updated":"2023-10-04T12:10:31Z","ddc":["510"],"oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"We are grateful to the authors of [25] for sharing with us their insights and preliminary numerical results. We are especially thankful to Stephen Shenker for very valuable advice over several email communications. Helpful comments on the manuscript from Peter Forrester and from the anonymous referees are also acknowledged.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).\r\nLászló Erdős: Partially supported by ERC Advanced Grant \"RMTBeyond\" No. 101020331. Dominik Schröder: Supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation.","page":"1665-1700","date_created":"2023-04-02T22:01:11Z","doi":"10.1007/s00220-023-04692-y","date_published":"2023-07-01T00:00:00Z","year":"2023","has_accepted_license":"1","isi":1,"publication":"Communications in Mathematical Physics","day":"01","project":[{"call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000957343500001"]},"author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio","last_name":"Cipolloni","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio"},{"last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J","last_name":"Schröder"}],"title":"On the spectral form factor for random matrices","citation":{"chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “On the Spectral Form Factor for Random Matrices.” Communications in Mathematical Physics. Springer Nature, 2023. https://doi.org/10.1007/s00220-023-04692-y.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2023. On the spectral form factor for random matrices. Communications in Mathematical Physics. 401, 1665–1700.","mla":"Cipolloni, Giorgio, et al. “On the Spectral Form Factor for Random Matrices.” Communications in Mathematical Physics, vol. 401, Springer Nature, 2023, pp. 1665–700, doi:10.1007/s00220-023-04692-y.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Communications in Mathematical Physics 401 (2023) 1665–1700.","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “On the spectral form factor for random matrices,” Communications in Mathematical Physics, vol. 401. Springer Nature, pp. 1665–1700, 2023.","apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). On the spectral form factor for random matrices. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-023-04692-y","ama":"Cipolloni G, Erdös L, Schröder DJ. On the spectral form factor for random matrices. Communications in Mathematical Physics. 2023;401:1665-1700. doi:10.1007/s00220-023-04692-y"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Corbet R, Kerber M, Lesnick M, Osang GF. 2023. Computing the multicover bifiltration. Discrete and Computational Geometry. 70, 376–405.","chicago":"Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.” Discrete and Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00476-8.","ieee":"R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” Discrete and Computational Geometry, vol. 70. Springer Nature, pp. 376–405, 2023.","short":"R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, Discrete and Computational Geometry 70 (2023) 376–405.","ama":"Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. Discrete and Computational Geometry. 2023;70:376-405. doi:10.1007/s00454-022-00476-8","apa":"Corbet, R., Kerber, M., Lesnick, M., & Osang, G. F. (2023). Computing the multicover bifiltration. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00476-8","mla":"Corbet, René, et al. “Computing the Multicover Bifiltration.” Discrete and Computational Geometry, vol. 70, Springer Nature, 2023, pp. 376–405, doi:10.1007/s00454-022-00476-8."},"title":"Computing the multicover bifiltration","author":[{"first_name":"René","full_name":"Corbet, René","last_name":"Corbet"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lesnick","full_name":"Lesnick, Michael","first_name":"Michael"},{"last_name":"Osang","orcid":"0000-0002-8882-5116","full_name":"Osang, Georg F","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000936496800001"],"arxiv":["2103.07823"]},"acknowledgement":"We thank the anonymous reviewers for many helpful comments and suggestions, which led to substantial improvements of the paper. The first two authors were supported by the Austrian Science Fund (FWF) grant number P 29984-N35 and W1230. The first author was partly supported by an Austrian Marshall Plan Scholarship, and by the Brummer & Partners MathDataLab. A conference version of this paper was presented at the 37th International Symposium on Computational Geometry (SoCG 2021). Open access funding provided by the Royal Institute of Technology.","quality_controlled":"1","publisher":"Springer Nature","oa":1,"day":"01","publication":"Discrete and Computational Geometry","has_accepted_license":"1","isi":1,"year":"2023","doi":"10.1007/s00454-022-00476-8","date_published":"2023-09-01T00:00:00Z","date_created":"2023-03-05T23:01:06Z","page":"376-405","_id":"12709","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)"},"ddc":["000"],"date_updated":"2023-10-04T12:03:40Z","department":[{"_id":"HeEd"}],"file_date_updated":"2023-03-07T14:40:14Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness."}],"month":"09","intvolume":" 70","scopus_import":"1","file":[{"date_updated":"2023-03-07T14:40:14Z","file_size":1359323,"creator":"cchlebak","date_created":"2023-03-07T14:40:14Z","file_name":"2023_DisCompGeo_Corbet.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"71ce7e59f7ee4620acc704fecca620c2","file_id":"12715","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"publication_status":"published","related_material":{"record":[{"relation":"earlier_version","id":"9605","status":"public"}]},"volume":70},{"status":"public","article_type":"original","type":"journal_article","_id":"12763","department":[{"_id":"HeEd"}],"date_updated":"2023-10-04T12:07:18Z","month":"09","intvolume":" 7","scopus_import":"1","main_file_link":[{"url":"https://inserm.hal.science/INRIA-SACLAY/hal-04083524v1","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Kleinjohann (Archiv der Mathematik 35(1):574–582, 1980; Mathematische Zeitschrift 176(3), 327–344, 1981) and Bangert (Archiv der Mathematik 38(1):54–57, 1982) extended the reach rch(S) from subsets S of Euclidean space to the reach rchM(S) of subsets S of Riemannian manifolds M, where M is smooth (we’ll assume at least C3). Bangert showed that sets of positive reach in Euclidean space and Riemannian manifolds are very similar. In this paper we introduce a slight variant of Kleinjohann’s and Bangert’s extension and quantify the similarity between sets of positive reach in Euclidean space and Riemannian manifolds in a new way: Given p∈M and q∈S, we bound the local feature size (a local version of the reach) of its lifting to the tangent space via the inverse exponential map (exp−1p(S)) at q, assuming that rchM(S) and the geodesic distance dM(p,q) are bounded. These bounds are motivated by the importance of the reach and local feature size to manifold learning, topological inference, and triangulating manifolds and the fact that intrinsic approaches circumvent the curse of dimensionality."}],"volume":7,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"publication_status":"published","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","grant_number":"M03073","name":"Learning and triangulating manifolds via collapses"}],"title":"The reach of subsets of manifolds","author":[{"first_name":"Jean Daniel","full_name":"Boissonnat, Jean Daniel","last_name":"Boissonnat"},{"orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Boissonnat JD, Wintraecken M. 2023. The reach of subsets of manifolds. Journal of Applied and Computational Topology. 7, 619–641.","chicago":"Boissonnat, Jean Daniel, and Mathijs Wintraecken. “The Reach of Subsets of Manifolds.” Journal of Applied and Computational Topology. Springer Nature, 2023. https://doi.org/10.1007/s41468-023-00116-x.","ama":"Boissonnat JD, Wintraecken M. The reach of subsets of manifolds. Journal of Applied and Computational Topology. 2023;7:619-641. doi:10.1007/s41468-023-00116-x","apa":"Boissonnat, J. D., & Wintraecken, M. (2023). The reach of subsets of manifolds. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-023-00116-x","short":"J.D. Boissonnat, M. Wintraecken, Journal of Applied and Computational Topology 7 (2023) 619–641.","ieee":"J. D. Boissonnat and M. Wintraecken, “The reach of subsets of manifolds,” Journal of Applied and Computational Topology, vol. 7. Springer Nature, pp. 619–641, 2023.","mla":"Boissonnat, Jean Daniel, and Mathijs Wintraecken. “The Reach of Subsets of Manifolds.” Journal of Applied and Computational Topology, vol. 7, Springer Nature, 2023, pp. 619–41, doi:10.1007/s41468-023-00116-x."},"publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"We thank Eddie Aamari, David Cohen-Steiner, Isa Costantini, Fred Chazal, Ramsay Dyer, André Lieutier, and Alef Sterk for discussion and Pierre Pansu for encouragement. We further acknowledge the anonymous reviewers whose comments helped improve the exposition.\r\nThe research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions). The first author is further supported by the French government, through the 3IA Côte d’Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002. The second author is supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411 and the Austrian science fund (FWF) M-3073.","date_published":"2023-09-01T00:00:00Z","doi":"10.1007/s41468-023-00116-x","date_created":"2023-03-26T22:01:08Z","page":"619-641","day":"01","publication":"Journal of Applied and Computational Topology","year":"2023"},{"acknowledgement":"We thank Christof Löding for pointing us to some results on PSpace-hardess of universality problems and the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093 and the Israel Science Foundation grant 2410/22.","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2023","has_accepted_license":"1","publication":"34th International Conference on Concurrency Theory","day":"01","date_created":"2023-07-14T10:00:15Z","date_published":"2023-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2023.17","article_number":"17","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"citation":{"ieee":"U. Boker, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Safety and liveness of quantitative automata,” in 34th International Conference on Concurrency Theory, Antwerp, Belgium, 2023, vol. 279.","short":"U. Boker, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","apa":"Boker, U., Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2023). Safety and liveness of quantitative automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2023.17","ama":"Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. Safety and liveness of quantitative automata. In: 34th International Conference on Concurrency Theory. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.CONCUR.2023.17","mla":"Boker, Udi, et al. “Safety and Liveness of Quantitative Automata.” 34th International Conference on Concurrency Theory, vol. 279, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.CONCUR.2023.17.","ista":"Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Safety and liveness of quantitative automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 17.","chicago":"Boker, Udi, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Safety and Liveness of Quantitative Automata.” In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.CONCUR.2023.17."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2307.06016"]},"article_processing_charge":"No","author":[{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac","full_name":"Sarac, Naci E"}],"title":"Safety and liveness of quantitative automata","abstract":[{"text":"The safety-liveness dichotomy is a fundamental concept in formal languages which plays a key role in verification. Recently, this dichotomy has been lifted to quantitative properties, which are arbitrary functions from infinite words to partially-ordered domains. We look into harnessing the dichotomy for the specific classes of quantitative properties expressed by quantitative automata. These automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totallyordered domain of real numbers. In this automata-theoretic setting, we establish a connection between quantitative safety and topological continuity and provide an alternative characterization of quantitative safety and liveness in terms of their boolean counterparts. For all common value functions, we show how the safety closure of a quantitative automaton can be constructed in PTime, and we provide PSpace-complete checks of whether a given quantitative automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata, for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf, and LimSup automata, we give PTime decompositions into safe and live automata. These decompositions enable the separation of techniques for safety and liveness verification for quantitative specifications.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"intvolume":" 279","month":"09","publication_status":"published","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772990"]},"language":[{"iso":"eng"}],"file":[{"checksum":"d40e57a04448ea5c77d7e1cfb9590a81","file_id":"13224","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-07-14T12:03:48Z","file_name":"CONCUR23.pdf","creator":"esarac","date_updated":"2023-07-14T12:03:48Z","file_size":755529}],"ec_funded":1,"volume":279,"_id":"13221","conference":{"name":"CONCUR: Conference on Concurrency Theory","location":"Antwerp, Belgium","end_date":"2023-09-23","start_date":"2023-09-18"},"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","status":"public","date_updated":"2023-10-09T07:14:03Z","ddc":["000"],"file_date_updated":"2023-07-14T12:03:48Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}]},{"article_type":"original","type":"journal_article","status":"public","_id":"14406","department":[{"_id":"MaSe"}],"date_updated":"2023-10-09T07:09:30Z","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.09455","open_access":"1"}],"month":"09","intvolume":" 108","abstract":[{"lang":"eng","text":"Recently, a concept of generalized multifractality, which characterizes fluctuations and correlations of critical eigenstates, was introduced and explored for all 10 symmetry classes of disordered systems. Here, by using the nonlinear sigma-model (\r\nNL\r\nσ\r\nM\r\n) field theory, we extend the theory of generalized multifractality to boundaries of systems at criticality. Our numerical simulations on two-dimensional systems of symmetry classes A, C, and AII fully confirm the analytical predictions of pure-scaling observables and Weyl symmetry relations between critical exponents of surface generalized multifractality. This demonstrates the validity of the \r\nNL\r\nσ\r\nM\r\n for the description of Anderson-localization critical phenomena, not only in the bulk but also on the boundary. The critical exponents strongly violate generalized parabolicity, in analogy with earlier results for the bulk, corroborating the conclusion that the considered Anderson-localization critical points are not described by conformal field theories. We further derive relations between generalized surface multifractal spectra and linear combinations of Lyapunov exponents of a strip in quasi-one-dimensional geometry, which hold under the assumption of invariance with respect to a logarithmic conformal map. Our numerics demonstrate that these relations hold with an excellent accuracy. Taken together, our results indicate an intriguing situation: the conformal invariance is broken but holds partially at critical points of Anderson localization."}],"oa_version":"Preprint","volume":108,"issue":"10","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"publication_status":"published","language":[{"iso":"eng"}],"article_number":"104205","author":[{"first_name":"Serafim","id":"41e64307-6672-11ee-b9ad-cc7a0075a479","orcid":"0009-0003-7382-8036","full_name":"Babkin, Serafim","last_name":"Babkin"},{"full_name":"Karcher, Jonas F.","last_name":"Karcher","first_name":"Jonas F."},{"first_name":"Igor S.","full_name":"Burmistrov, Igor S.","last_name":"Burmistrov"},{"full_name":"Mirlin, Alexander D.","last_name":"Mirlin","first_name":"Alexander D."}],"external_id":{"arxiv":["2306.09455"]},"article_processing_charge":"No","title":"Generalized surface multifractality in two-dimensional disordered systems","citation":{"mla":"Babkin, Serafim, et al. “Generalized Surface Multifractality in Two-Dimensional Disordered Systems.” Physical Review B, vol. 108, no. 10, 104205, American Physical Society, 2023, doi:10.1103/PhysRevB.108.104205.","ama":"Babkin S, Karcher JF, Burmistrov IS, Mirlin AD. Generalized surface multifractality in two-dimensional disordered systems. Physical Review B. 2023;108(10). doi:10.1103/PhysRevB.108.104205","apa":"Babkin, S., Karcher, J. F., Burmistrov, I. S., & Mirlin, A. D. (2023). Generalized surface multifractality in two-dimensional disordered systems. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.108.104205","ieee":"S. Babkin, J. F. Karcher, I. S. Burmistrov, and A. D. Mirlin, “Generalized surface multifractality in two-dimensional disordered systems,” Physical Review B, vol. 108, no. 10. American Physical Society, 2023.","short":"S. Babkin, J.F. Karcher, I.S. Burmistrov, A.D. Mirlin, Physical Review B 108 (2023).","chicago":"Babkin, Serafim, Jonas F. Karcher, Igor S. Burmistrov, and Alexander D. Mirlin. “Generalized Surface Multifractality in Two-Dimensional Disordered Systems.” Physical Review B. American Physical Society, 2023. https://doi.org/10.1103/PhysRevB.108.104205.","ista":"Babkin S, Karcher JF, Burmistrov IS, Mirlin AD. 2023. Generalized surface multifractality in two-dimensional disordered systems. Physical Review B. 108(10), 104205."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Physical Society","quality_controlled":"1","oa":1,"acknowledgement":"We thank Ilya Gruzberg for many illuminating discussions. S.S.B., J.F.K., and A.D.M. acknowledge support by the Deutsche Forschungsgemeinschaft (DFG) via the Grant\r\nNo. MI 658/14-1. I.S.B. acknowledges support from Russian Science Foundation (Grant No. 22-42-04416).","doi":"10.1103/PhysRevB.108.104205","date_published":"2023-09-01T00:00:00Z","date_created":"2023-10-08T22:01:17Z","year":"2023","day":"01","publication":"Physical Review B"},{"page":"67-73","date_created":"2023-10-08T22:01:18Z","date_published":"2023-08-20T00:00:00Z","doi":"10.1007/978-3-031-40773-4_6","volume":14068,"year":"2023","publication_status":"published","publication_identifier":{"isbn":["9783031407727"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publication":"International Workshop on Reproducible Research in Pattern Recognition","language":[{"iso":"eng"}],"day":"20","alternative_title":["LNCS"],"scopus_import":"1","publisher":"Springer Nature","quality_controlled":"1","intvolume":" 14068","month":"08","abstract":[{"lang":"eng","text":"This paper focuses on the implementation details of the baseline methods and a recent lightweight conditional model extrapolation algorithm LIMES [5] for streaming data under class-prior shift. LIMES achieves superior performance over the baseline methods, especially concerning the minimum-across-day accuracy, which is important for the users of the system. In this work, the key measures to facilitate reproducibility and enhance the credibility of the results are described."}],"oa_version":"None","article_processing_charge":"No","author":[{"first_name":"Paulina","last_name":"Tomaszewska","full_name":"Tomaszewska, Paulina"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"title":"On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift","department":[{"_id":"ChLa"}],"date_updated":"2023-10-09T06:48:02Z","citation":{"ieee":"P. Tomaszewska and C. Lampert, “On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift,” in International Workshop on Reproducible Research in Pattern Recognition, Montreal, Canada, 2023, vol. 14068, pp. 67–73.","short":"P. Tomaszewska, C. Lampert, in:, International Workshop on Reproducible Research in Pattern Recognition, Springer Nature, 2023, pp. 67–73.","ama":"Tomaszewska P, Lampert C. On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift. In: International Workshop on Reproducible Research in Pattern Recognition. Vol 14068. Springer Nature; 2023:67-73. doi:10.1007/978-3-031-40773-4_6","apa":"Tomaszewska, P., & Lampert, C. (2023). On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift. In International Workshop on Reproducible Research in Pattern Recognition (Vol. 14068, pp. 67–73). Montreal, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-40773-4_6","mla":"Tomaszewska, Paulina, and Christoph Lampert. “On the Implementation of Baselines and Lightweight Conditional Model Extrapolation (LIMES) under Class-Prior Shift.” International Workshop on Reproducible Research in Pattern Recognition, vol. 14068, Springer Nature, 2023, pp. 67–73, doi:10.1007/978-3-031-40773-4_6.","ista":"Tomaszewska P, Lampert C. 2023. On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift. International Workshop on Reproducible Research in Pattern Recognition. RRPR: Reproducible Research in Pattern Recognition, LNCS, vol. 14068, 67–73.","chicago":"Tomaszewska, Paulina, and Christoph Lampert. “On the Implementation of Baselines and Lightweight Conditional Model Extrapolation (LIMES) under Class-Prior Shift.” In International Workshop on Reproducible Research in Pattern Recognition, 14068:67–73. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-40773-4_6."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2022-08-21","location":"Montreal, Canada","end_date":"2022-08-21","name":"RRPR: Reproducible Research in Pattern Recognition"},"type":"conference","status":"public","_id":"14410"},{"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":{"start_date":"2023-09-19","location":"Antwerp, Belgium","end_date":"2023-09-22","name":"CONCUR: Conference on Concurrency Theory"},"status":"public","_id":"14405","file_date_updated":"2023-10-09T07:42:45Z","department":[{"_id":"ToHe"}],"date_updated":"2023-10-09T07:43:44Z","ddc":["000"],"scopus_import":"1","alternative_title":["LIPIcs"],"month":"09","intvolume":" 279","abstract":[{"lang":"eng","text":"We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic formula specifies relations between sequences of variable values in different system executions. Unlike HyperLTL, hypernode logic takes an asynchronous view on execution traces by constraining the values and the order of value changes of each variable without correlating the timing of the changes. Different execution traces are synchronized solely through the transitions of hypernode automata. Hypernode automata naturally combine asynchronicity at the node level with synchronicity at the transition level. We show that the model-checking problem for hypernode automata is decidable over action-labeled Kripke structures, whose actions induce transitions of the specification automata. For this reason, hypernode automaton is a suitable formalism for specifying and verifying asynchronous hyperproperties, such as declassifying observational determinism in multi-threaded programs."}],"oa_version":"Published Version","volume":279,"ec_funded":1,"publication_identifier":{"issn":["18688969"],"isbn":["9783959772990"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"14413","checksum":"215765e40454d806174ac0a223e8d6fa","creator":"dernst","file_size":795790,"date_updated":"2023-10-09T07:42:45Z","file_name":"2023_LIPcs_Bartocci.pdf","date_created":"2023-10-09T07:42:45Z"}],"language":[{"iso":"eng"}],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"article_number":"21","author":[{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","last_name":"Nickovic"},{"last_name":"Oliveira da Costa","orcid":"0000-0002-8741-5799","full_name":"Oliveira da Costa, Ana","first_name":"Ana","id":"f347ec37-6676-11ee-b395-a888cb7b4fb4"}],"article_processing_charge":"Yes","external_id":{"arxiv":["2305.02836"]},"title":"Hypernode automata","citation":{"mla":"Bartocci, Ezio, et al. “Hypernode Automata.” 34th International Conference on Concurrency Theory, vol. 279, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.CONCUR.2023.21.","apa":"Bartocci, E., Henzinger, T. A., Nickovic, D., & Oliveira da Costa, A. (2023). Hypernode automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2023.21","ama":"Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. In: 34th International Conference on Concurrency Theory. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.CONCUR.2023.21","ieee":"E. Bartocci, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” in 34th International Conference on Concurrency Theory, Antwerp, Belgium, 2023, vol. 279.","short":"E. Bartocci, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","chicago":"Bartocci, Ezio, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.” In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.CONCUR.2023.21.","ista":"Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. 2023. Hypernode automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 21."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF) SFB project\r\nSpyCoDe F8502, by the FWF projects ZK-35 and W1255-N23, and by the ERC Advanced Grant\r\nVAMOS 101020093.","date_published":"2023-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2023.21","date_created":"2023-10-08T22:01:16Z","has_accepted_license":"1","year":"2023","day":"01","publication":"34th International Conference on Concurrency Theory"},{"status":"public","article_type":"original","type":"journal_article","_id":"14408","department":[{"_id":"LaEr"}],"title":"Mesoscopic central limit theorem for non-Hermitian random matrices","article_processing_charge":"No","external_id":{"arxiv":["2210.12060"]},"author":[{"full_name":"Cipolloni, Giorgio","orcid":"0000-0002-4901-7992","last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","last_name":"Erdös"},{"full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder","first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-10-09T07:19:01Z","citation":{"apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). Mesoscopic central limit theorem for non-Hermitian random matrices. Probability Theory and Related Fields. Springer Nature. https://doi.org/10.1007/s00440-023-01229-1","ama":"Cipolloni G, Erdös L, Schröder DJ. Mesoscopic central limit theorem for non-Hermitian random matrices. Probability Theory and Related Fields. 2023. doi:10.1007/s00440-023-01229-1","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability Theory and Related Fields (2023).","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Mesoscopic central limit theorem for non-Hermitian random matrices,” Probability Theory and Related Fields. Springer Nature, 2023.","mla":"Cipolloni, Giorgio, et al. “Mesoscopic Central Limit Theorem for Non-Hermitian Random Matrices.” Probability Theory and Related Fields, Springer Nature, 2023, doi:10.1007/s00440-023-01229-1.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2023. Mesoscopic central limit theorem for non-Hermitian random matrices. Probability Theory and Related Fields.","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Mesoscopic Central Limit Theorem for Non-Hermitian Random Matrices.” Probability Theory and Related Fields. Springer Nature, 2023. https://doi.org/10.1007/s00440-023-01229-1."},"month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2210.12060"}],"oa":1,"quality_controlled":"1","publisher":"Springer Nature","scopus_import":"1","acknowledgement":"The authors are grateful to Joscha Henheik for his help with the formulas in Appendix B.","oa_version":"Preprint","abstract":[{"text":"We prove that the mesoscopic linear statistics ∑if(na(σi−z0)) of the eigenvalues {σi}i of large n×n non-Hermitian random matrices with complex centred i.i.d. entries are asymptotically Gaussian for any H20-functions f around any point z0 in the bulk of the spectrum on any mesoscopic scale 0Science. AAAS, 2023. https://doi.org/10.1126/science.adk3070.","ama":"Balazs D, Ibáñez M. Widening the use of 3D printing. Science. 2023;381(6665):1413-1414. doi:10.1126/science.adk3070","apa":"Balazs, D., & Ibáñez, M. (2023). Widening the use of 3D printing. Science. AAAS. https://doi.org/10.1126/science.adk3070","ieee":"D. Balazs and M. Ibáñez, “Widening the use of 3D printing,” Science, vol. 381, no. 6665. AAAS, pp. 1413–1414, 2023.","short":"D. Balazs, M. Ibáñez, Science 381 (2023) 1413–1414.","mla":"Balazs, Daniel, and Maria Ibáñez. “Widening the Use of 3D Printing.” Science, vol. 381, no. 6665, AAAS, 2023, pp. 1413–14, doi:10.1126/science.adk3070."},"title":"Widening the use of 3D printing","article_processing_charge":"No","external_id":{"pmid":["37769110"]},"author":[{"first_name":"Daniel","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","orcid":"0000-0001-7597-043X","full_name":"Balazs, Daniel","last_name":"Balazs"},{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"}],"project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1095-9203"]},"volume":381,"issue":"6665","pmid":1,"oa_version":"None","abstract":[{"text":"A light-triggered fabrication method extends the functionality of printable nanomaterials","lang":"eng"}],"intvolume":" 381","month":"09","scopus_import":"1","date_updated":"2023-10-09T07:32:58Z","department":[{"_id":"MaIb"},{"_id":"LifeSc"}],"_id":"14404","status":"public","type":"journal_article","article_type":"letter_note"},{"ddc":["000"],"date_updated":"2023-10-09T09:22:37Z","file_date_updated":"2023-10-09T09:19:11Z","department":[{"_id":"KrCh"}],"_id":"14417","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":{"start_date":"2023-08-28","end_date":"2023-09-01","location":"Bordeaux, France","name":"MFCS: Symposium on Mathematical Foundations of Computer Science"},"type":"conference","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"14418","checksum":"402281b17ed669bbf149d0fdf68ac201","file_size":826843,"date_updated":"2023-10-09T09:19:11Z","creator":"dernst","file_name":"2023_LIPIcsMFCS_Baier.pdf","date_created":"2023-10-09T09:19:11Z"}],"publication_status":"published","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772921"]},"ec_funded":1,"volume":272,"oa_version":"Published Version","abstract":[{"text":"Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective. This gives rise to an objective function that demands the control of systems in a risk-averse manner. We show that the resulting games are determined and, in particular, admit optimal memoryless deterministic strategies. This contrasts risk measures that previously have been considered in the special case of Markov decision processes and that require randomization and/or memory. We provide several results on the decidability and the computational complexity of the threshold problem, i.e. whether the optimal value of ERisk exceeds a given threshold. In the most general case, the problem is decidable subject to Shanuel’s conjecture. If all inputs are rational, the resulting threshold problem can be solved using algebraic numbers, leading to decidability via a polynomial-time reduction to the existential theory of the reals. Further restrictions on the encoding of the input allow the solution of the threshold problem in NP∩coNP. Finally, an approximation algorithm for the optimal value of ERisk is provided.","lang":"eng"}],"intvolume":" 272","month":"08","scopus_import":"1","alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2023.15","ama":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. In: 48th International Symposium on Mathematical Foundations of Computer Science. Vol 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.MFCS.2023.15","short":"C. Baier, K. Chatterjee, T. Meggendorfer, J. Piribauer, in:, 48th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in 48th International Symposium on Mathematical Foundations of Computer Science, Bordeaux, France, 2023, vol. 272.","mla":"Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.” 48th International Symposium on Mathematical Foundations of Computer Science, vol. 272, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.MFCS.2023.15.","ista":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2023. Entropic risk for turn-based stochastic games. 48th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 272, 15.","chicago":"Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” In 48th International Symposium on Mathematical Foundations of Computer Science, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.MFCS.2023.15."},"title":"Entropic risk for turn-based stochastic games","article_processing_charge":"Yes","external_id":{"arxiv":["2307.06611"]},"author":[{"first_name":"Christel","last_name":"Baier","full_name":"Baier, Christel"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias"},{"first_name":"Jakob","full_name":"Piribauer, Jakob","last_name":"Piribauer"}],"article_number":"15","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"publication":"48th International Symposium on Mathematical Foundations of Computer Science","day":"21","year":"2023","has_accepted_license":"1","date_created":"2023-10-09T09:21:05Z","doi":"10.4230/LIPIcs.MFCS.2023.15","date_published":"2023-08-21T00:00:00Z","acknowledgement":"This work was partly funded by the ERC CoG 863818 (ForM-SMArt), the DFG Grant\r\n389792660 as part of TRR 248 (Foundations of Perspicuous Software Systems), the Cluster of\r\nExcellence EXC 2050/1 (CeTI, project ID 390696704, as part of Germany’s Excellence Strategy), and the DFG projects BA-1679/11-1 and BA-1679/12-1.","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"intvolume":" 52","month":"04","main_file_link":[{"url":"https://hal-emse.ccsd.cnrs.fr/3IA-COTEDAZUR/hal-04083489v1","open_access":"1"}],"scopus_import":"1","oa_version":"Submitted Version","abstract":[{"text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e., submanifolds of Rd defined as the zero set of some multivariate multivalued smooth function f:Rd→Rd−n, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M=f−1(0) is to consider its piecewise linear (PL) approximation M^\r\n based on a triangulation T of the ambient space Rd. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ=1/D (and unavoidably exponential in n). Since it is known that for δ=Ω(d2.5), M^ is O(D2)-close and isotopic to M\r\n, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M^ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. ","lang":"eng"}],"ec_funded":1,"volume":52,"related_material":{"record":[{"relation":"earlier_version","id":"9441","status":"public"}]},"issue":"2","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"status":"public","type":"journal_article","article_type":"original","_id":"12960","department":[{"_id":"HeEd"}],"date_updated":"2023-10-10T07:34:35Z","oa":1,"quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","acknowledgement":"The authors have received funding from the European Research Council under the European Union's ERC grant greement 339025 GUDHI (Algorithmic Foundations of Geometric Un-derstanding in Higher Dimensions). The first author was supported by the French government,through the 3IA C\\^ote d'Azur Investments in the Future project managed by the National ResearchAgency (ANR) with the reference ANR-19-P3IA-0002. The third author was supported by the Eu-ropean Union's Horizon 2020 research and innovation programme under the Marie Sk\\lodowska-Curiegrant agreement 754411 and the FWF (Austrian Science Fund) grant M 3073.","date_created":"2023-05-14T22:01:00Z","date_published":"2023-04-30T00:00:00Z","doi":"10.1137/21M1412918","page":"452-486","publication":"SIAM Journal on Computing","day":"30","year":"2023","isi":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"M03073","name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations","article_processing_charge":"No","external_id":{"isi":["001013183000012"]},"author":[{"last_name":"Boissonnat","full_name":"Boissonnat, Jean Daniel","first_name":"Jean Daniel"},{"full_name":"Kachanovich, Siargey","last_name":"Kachanovich","first_name":"Siargey"},{"full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Boissonnat JD, Kachanovich S, Wintraecken M. 2023. Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM Journal on Computing. 52(2), 452–486.","chicago":"Boissonnat, Jean Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn Triangulations.” SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/21M1412918.","ieee":"J. D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations,” SIAM Journal on Computing, vol. 52, no. 2. Society for Industrial and Applied Mathematics, pp. 452–486, 2023.","short":"J.D. Boissonnat, S. Kachanovich, M. Wintraecken, SIAM Journal on Computing 52 (2023) 452–486.","ama":"Boissonnat JD, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM Journal on Computing. 2023;52(2):452-486. doi:10.1137/21M1412918","apa":"Boissonnat, J. D., Kachanovich, S., & Wintraecken, M. (2023). Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM Journal on Computing. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21M1412918","mla":"Boissonnat, Jean Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn Triangulations.” SIAM Journal on Computing, vol. 52, no. 2, Society for Industrial and Applied Mathematics, 2023, pp. 452–86, doi:10.1137/21M1412918."}},{"status":"public","article_type":"original","type":"journal_article","_id":"13134","department":[{"_id":"HeEd"}],"date_updated":"2023-10-10T07:37:16Z","month":"10","intvolume":" 142","scopus_import":"1","oa_version":"None","abstract":[{"text":"We propose a characterization of discrete analytical spheres, planes and lines in the body-centered cubic (BCC) grid, both in the Cartesian and in the recently proposed alternative compact coordinate system, in which each integer triplet addresses some voxel in the grid. We define spheres and planes through double Diophantine inequalities and investigate their relevant topological features, such as functionality or the interrelation between the thickness of the objects and their connectivity and separation properties. We define lines as the intersection of planes. The number of the planes (up to six) is equal to the number of the pairs of faces of a BCC voxel that are parallel to the line.","lang":"eng"}],"volume":142,"issue":"10","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0031-3203"]},"publication_status":"published","project":[{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"},{"grant_number":"I4887","name":"Discretization in Geometry and Dynamics","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"}],"article_number":"109693","title":"Discrete analytical objects in the body-centered cubic grid","author":[{"first_name":"Lidija","last_name":"Čomić","full_name":"Čomić, Lidija"},{"first_name":"Gaëlle","last_name":"Largeteau-Skapin","full_name":"Largeteau-Skapin, Gaëlle"},{"last_name":"Zrour","full_name":"Zrour, Rita","first_name":"Rita"},{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","last_name":"Biswas","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita"},{"first_name":"Eric","full_name":"Andres, Eric","last_name":"Andres"}],"article_processing_charge":"No","external_id":{"isi":["001013526000001"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Čomić L, Largeteau-Skapin G, Zrour R, Biswas R, Andres E. 2023. Discrete analytical objects in the body-centered cubic grid. Pattern Recognition. 142(10), 109693.","chicago":"Čomić, Lidija, Gaëlle Largeteau-Skapin, Rita Zrour, Ranita Biswas, and Eric Andres. “Discrete Analytical Objects in the Body-Centered Cubic Grid.” Pattern Recognition. Elsevier, 2023. https://doi.org/10.1016/j.patcog.2023.109693.","short":"L. Čomić, G. Largeteau-Skapin, R. Zrour, R. Biswas, E. Andres, Pattern Recognition 142 (2023).","ieee":"L. Čomić, G. Largeteau-Skapin, R. Zrour, R. Biswas, and E. Andres, “Discrete analytical objects in the body-centered cubic grid,” Pattern Recognition, vol. 142, no. 10. Elsevier, 2023.","apa":"Čomić, L., Largeteau-Skapin, G., Zrour, R., Biswas, R., & Andres, E. (2023). Discrete analytical objects in the body-centered cubic grid. Pattern Recognition. Elsevier. https://doi.org/10.1016/j.patcog.2023.109693","ama":"Čomić L, Largeteau-Skapin G, Zrour R, Biswas R, Andres E. Discrete analytical objects in the body-centered cubic grid. Pattern Recognition. 2023;142(10). doi:10.1016/j.patcog.2023.109693","mla":"Čomić, Lidija, et al. “Discrete Analytical Objects in the Body-Centered Cubic Grid.” Pattern Recognition, vol. 142, no. 10, 109693, Elsevier, 2023, doi:10.1016/j.patcog.2023.109693."},"publisher":"Elsevier","quality_controlled":"1","acknowledgement":"The first author has been partially supported by the Ministry of Science, Technological Development and Innovation of the Republic of Serbia through the project no. 451-03-47/2023-01/200156. The fourth author is funded by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35.","date_published":"2023-10-01T00:00:00Z","doi":"10.1016/j.patcog.2023.109693","date_created":"2023-06-18T22:00:45Z","day":"01","publication":"Pattern Recognition","isi":1,"year":"2023"},{"abstract":[{"text":"Physical catalysts often have multiple sites where reactions can take place. One prominent example is single-atom alloys, where the reactive dopant atoms can preferentially locate in the bulk or at different sites on the surface of the nanoparticle. However, ab initio modeling of catalysts usually only considers one site of the catalyst, neglecting the effects of multiple sites. Here, nanoparticles of copper doped with single-atom rhodium or palladium are modeled for the dehydrogenation of propane. Single-atom alloy nanoparticles are simulated at 400–600 K, using machine learning potentials trained on density functional theory calculations, and then the occupation of different single-atom active sites is identified using a similarity kernel. Further, the turnover frequency for all possible sites is calculated for propane dehydrogenation to propene through microkinetic modeling using density functional theory calculations. The total turnover frequencies of the whole nanoparticle are then described from both the population and the individual turnover frequency of each site. Under operating conditions, rhodium as a dopant is found to almost exclusively occupy (111) surface sites while palladium as a dopant occupies a greater variety of facets. Undercoordinated dopant surface sites are found to tend to be more reactive for propane dehydrogenation compared to the (111) surface. It is found that considering the dynamics of the single-atom alloy nanoparticle has a profound effect on the calculated catalytic activity of single-atom alloys by several orders of magnitude.","lang":"eng"}],"oa_version":"Published Version","pmid":1,"intvolume":" 145","month":"06","publication_status":"published","publication_identifier":{"issn":["0002-7863"],"eissn":["1520-5126"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2023-07-12T10:22:04Z","file_name":"2023_JACS_Bunting.pdf","creator":"cchlebak","date_updated":"2023-07-12T10:22:04Z","file_size":3155843,"file_id":"13219","checksum":"e07d5323f9c0e5cbd1ad6453f29440ab","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"volume":145,"issue":"27","_id":"13216","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","keyword":["Colloid and Surface Chemistry","Biochemistry","General Chemistry","Catalysis"],"status":"public","date_updated":"2023-10-11T08:45:10Z","ddc":["540"],"file_date_updated":"2023-07-12T10:22:04Z","department":[{"_id":"MaIb"},{"_id":"BiCh"}],"acknowledgement":"B.C. acknowledges resources provided by the Cambridge Tier2 system operated by the University of Cambridge Research\r\nComputing Service funded by EPSRC Tier-2 capital grant EP/\r\nP020259/1.","oa":1,"publisher":"American Chemical Society","quality_controlled":"1","year":"2023","isi":1,"has_accepted_license":"1","publication":"Journal of the American Chemical Society","day":"30","page":"14894-14902","date_created":"2023-07-12T09:16:40Z","date_published":"2023-06-30T00:00:00Z","doi":"10.1021/jacs.3c04030","citation":{"ista":"Bunting R, Wodaczek F, Torabi T, Cheng B. 2023. Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane. Journal of the American Chemical Society. 145(27), 14894–14902.","chicago":"Bunting, Rhys, Felix Wodaczek, Tina Torabi, and Bingqing Cheng. “Reactivity of Single-Atom Alloy Nanoparticles: Modeling the Dehydrogenation of Propane.” Journal of the American Chemical Society. American Chemical Society, 2023. https://doi.org/10.1021/jacs.3c04030.","short":"R. Bunting, F. Wodaczek, T. Torabi, B. Cheng, Journal of the American Chemical Society 145 (2023) 14894–14902.","ieee":"R. Bunting, F. Wodaczek, T. Torabi, and B. Cheng, “Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane,” Journal of the American Chemical Society, vol. 145, no. 27. American Chemical Society, pp. 14894–14902, 2023.","apa":"Bunting, R., Wodaczek, F., Torabi, T., & Cheng, B. (2023). Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.3c04030","ama":"Bunting R, Wodaczek F, Torabi T, Cheng B. Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane. Journal of the American Chemical Society. 2023;145(27):14894-14902. doi:10.1021/jacs.3c04030","mla":"Bunting, Rhys, et al. “Reactivity of Single-Atom Alloy Nanoparticles: Modeling the Dehydrogenation of Propane.” Journal of the American Chemical Society, vol. 145, no. 27, American Chemical Society, 2023, pp. 14894–902, doi:10.1021/jacs.3c04030."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"isi":["001020623900001"],"pmid":["37390457"]},"article_processing_charge":"Yes (via OA deal)","author":[{"orcid":"0000-0001-6928-074X","full_name":"Bunting, Rhys","last_name":"Bunting","first_name":"Rhys","id":"91deeae8-1207-11ec-b130-c194ad5b50c6"},{"last_name":"Wodaczek","orcid":"0009-0000-1457-795X","full_name":"Wodaczek, Felix","first_name":"Felix","id":"8b4b6a9f-32b0-11ee-9fa8-bbe85e26258e"},{"last_name":"Torabi","full_name":"Torabi, Tina","first_name":"Tina"},{"last_name":"Cheng","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing"}],"title":"Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane"},{"file_date_updated":"2023-10-16T07:20:49Z","department":[{"_id":"EdHa"}],"date_updated":"2023-10-16T07:25:48Z","ddc":["570"],"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":"14426","issue":"10","related_material":{"link":[{"relation":"software","url":"https://github.com/JulieKlepstad/LiverDevelopment"}]},"volume":21,"ec_funded":1,"publication_identifier":{"eissn":["1545-7885"]},"publication_status":"published","file":[{"file_name":"2023_PloSBiology_Unterweger.pdf","date_created":"2023-10-16T07:20:49Z","creator":"dernst","file_size":6193110,"date_updated":"2023-10-16T07:20:49Z","success":1,"checksum":"40a2b11b41d70a0e5939f8a52b66e389","file_id":"14431","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"10","intvolume":" 21","abstract":[{"lang":"eng","text":"To meet the physiological demands of the body, organs need to establish a functional tissue architecture and adequate size as the embryo develops to adulthood. In the liver, uni- and bipotent progenitor differentiation into hepatocytes and biliary epithelial cells (BECs), and their relative proportions, comprise the functional architecture. Yet, the contribution of individual liver progenitors at the organ level to both fates, and their specific proportion, is unresolved. Combining mathematical modelling with organ-wide, multispectral FRaeppli-NLS lineage tracing in zebrafish, we demonstrate that a precise BEC-to-hepatocyte ratio is established (i) fast, (ii) solely by heterogeneous lineage decisions from uni- and bipotent progenitors, and (iii) independent of subsequent cell type–specific proliferation. Extending lineage tracing to adulthood determined that embryonic cells undergo spatially heterogeneous three-dimensional growth associated with distinct environments. Strikingly, giant clusters comprising almost half a ventral lobe suggest lobe-specific dominant-like growth behaviours. We show substantial hepatocyte polyploidy in juveniles representing another hallmark of postembryonic liver growth. Our findings uncover heterogeneous progenitor contributions to tissue architecture-defining cell type proportions and postembryonic organ growth as key mechanisms forming the adult liver."}],"oa_version":"Published Version","author":[{"first_name":"Iris A.","full_name":"Unterweger, Iris A.","last_name":"Unterweger"},{"first_name":"Julie","last_name":"Klepstad","full_name":"Klepstad, Julie"},{"first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561"},{"first_name":"Pia R.","full_name":"Lundegaard, Pia R.","last_name":"Lundegaard"},{"first_name":"Ala","full_name":"Trusina, Ala","last_name":"Trusina"},{"last_name":"Ober","full_name":"Ober, Elke A.","first_name":"Elke A."}],"article_processing_charge":"No","title":"Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics","citation":{"mla":"Unterweger, Iris A., et al. “Lineage Tracing Identifies Heterogeneous Hepatoblast Contribution to Cell Lineages and Postembryonic Organ Growth Dynamics.” PLoS Biology, vol. 21, no. 10, e3002315, Public Library of Science, 2023, doi:10.1371/journal.pbio.3002315.","apa":"Unterweger, I. A., Klepstad, J., Hannezo, E. B., Lundegaard, P. R., Trusina, A., & Ober, E. A. (2023). Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.3002315","ama":"Unterweger IA, Klepstad J, Hannezo EB, Lundegaard PR, Trusina A, Ober EA. Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics. PLoS Biology. 2023;21(10). doi:10.1371/journal.pbio.3002315","ieee":"I. A. Unterweger, J. Klepstad, E. B. Hannezo, P. R. Lundegaard, A. Trusina, and E. A. Ober, “Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics,” PLoS Biology, vol. 21, no. 10. Public Library of Science, 2023.","short":"I.A. Unterweger, J. Klepstad, E.B. Hannezo, P.R. Lundegaard, A. Trusina, E.A. Ober, PLoS Biology 21 (2023).","chicago":"Unterweger, Iris A., Julie Klepstad, Edouard B Hannezo, Pia R. Lundegaard, Ala Trusina, and Elke A. Ober. “Lineage Tracing Identifies Heterogeneous Hepatoblast Contribution to Cell Lineages and Postembryonic Organ Growth Dynamics.” PLoS Biology. Public Library of Science, 2023. https://doi.org/10.1371/journal.pbio.3002315.","ista":"Unterweger IA, Klepstad J, Hannezo EB, Lundegaard PR, Trusina A, Ober EA. 2023. Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics. PLoS Biology. 21(10), e3002315."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"05943252-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"851288","name":"Design Principles of Branching Morphogenesis"}],"article_number":"e3002315","date_published":"2023-10-04T00:00:00Z","doi":"10.1371/journal.pbio.3002315","date_created":"2023-10-15T22:01:10Z","has_accepted_license":"1","year":"2023","day":"04","publication":"PLoS Biology","quality_controlled":"1","publisher":"Public Library of Science","oa":1,"acknowledgement":"We thank the Ober group for discussion and comments on the manuscript. We are grateful to\r\nDr. F. Lemaigre for feedback on the manuscript and Dr. T. Piotrowski for invaluable support.\r\nWe thank the department of experimental medicine (AEM) in Copenhagen for expert fish\r\ncare. We gratefully acknowledge the DanStem Imaging Platform (University of Copenhagen)\r\nfor support and assistance in this work.\r\nThis work is supported by Novo Nordisk Foundation grant NNF17CC0027852 (EAO);\r\nNordisk Foundation grant NNF19OC0058327 (EAO); Novo Nordisk Foundation grant\r\nNNF17OC0031204 (PRL); https://novonordiskfonden.dk/en/; Danish National\r\nResearch Foundation grant DNRF116 (EAO and AT); https://dg.dk/en/; John and Birthe Meyer\r\nFoundation (PRL) and European Research Council (ERC) under the EU Horizon 2020 research and Innovation Programme Grant Agreement No. 851288 (EH)."},{"title":"Random oracle combiners: Breaking the concatenation barrier for collision-resistance","article_processing_charge":"No","author":[{"first_name":"Yevgeniy","full_name":"Dodis, Yevgeniy","last_name":"Dodis"},{"full_name":"Ferguson, Niels","last_name":"Ferguson","first_name":"Niels"},{"last_name":"Goldin","full_name":"Goldin, Eli","first_name":"Eli"},{"first_name":"Peter","last_name":"Hall","full_name":"Hall, Peter"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Dodis, Yevgeniy, et al. “Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance.” 43rd Annual International Cryptology Conference, vol. 14082, Springer Nature, 2023, pp. 514–46, doi:10.1007/978-3-031-38545-2_17.","short":"Y. Dodis, N. Ferguson, E. Goldin, P. Hall, K.Z. Pietrzak, in:, 43rd Annual International Cryptology Conference, Springer Nature, 2023, pp. 514–546.","ieee":"Y. Dodis, N. Ferguson, E. Goldin, P. Hall, and K. Z. Pietrzak, “Random oracle combiners: Breaking the concatenation barrier for collision-resistance,” in 43rd Annual International Cryptology Conference, Santa Barbara, CA, United States, 2023, vol. 14082, pp. 514–546.","ama":"Dodis Y, Ferguson N, Goldin E, Hall P, Pietrzak KZ. Random oracle combiners: Breaking the concatenation barrier for collision-resistance. In: 43rd Annual International Cryptology Conference. Vol 14082. Springer Nature; 2023:514-546. doi:10.1007/978-3-031-38545-2_17","apa":"Dodis, Y., Ferguson, N., Goldin, E., Hall, P., & Pietrzak, K. Z. (2023). Random oracle combiners: Breaking the concatenation barrier for collision-resistance. In 43rd Annual International Cryptology Conference (Vol. 14082, pp. 514–546). Santa Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-38545-2_17","chicago":"Dodis, Yevgeniy, Niels Ferguson, Eli Goldin, Peter Hall, and Krzysztof Z Pietrzak. “Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance.” In 43rd Annual International Cryptology Conference, 14082:514–46. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-38545-2_17.","ista":"Dodis Y, Ferguson N, Goldin E, Hall P, Pietrzak KZ. 2023. Random oracle combiners: Breaking the concatenation barrier for collision-resistance. 43rd Annual International Cryptology Conference. CRYPTO: Advances in Cryptology, LNCS, vol. 14082, 514–546."},"date_created":"2023-10-15T22:01:11Z","date_published":"2023-08-09T00:00:00Z","doi":"10.1007/978-3-031-38545-2_17","page":"514-546","publication":"43rd Annual International Cryptology Conference","day":"09","year":"2023","oa":1,"quality_controlled":"1","publisher":"Springer Nature","department":[{"_id":"KrPi"}],"date_updated":"2023-10-16T08:02:11Z","status":"public","conference":{"name":"CRYPTO: Advances in Cryptology","start_date":"2023-08-20","end_date":"2023-08-24","location":"Santa Barbara, CA, United States"},"type":"conference","_id":"14428","volume":14082,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031385445"],"eissn":["1611-3349"]},"intvolume":" 14082","month":"08","main_file_link":[{"url":"https://eprint.iacr.org/2023/1041","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Suppose we have two hash functions h1 and h2, but we trust the security of only one of them. To mitigate this worry, we wish to build a hash combiner Ch1,h2 which is secure so long as one of the underlying hash functions is. This question has been well-studied in the regime of collision resistance. In this case, concatenating the two hash function outputs clearly works. Unfortunately, a long series of works (Boneh and Boyen, CRYPTO’06; Pietrzak, Eurocrypt’07; Pietrzak, CRYPTO’08) showed no (noticeably) shorter combiner for collision resistance is possible.\r\nIn this work, we revisit this pessimistic state of affairs, motivated by the observation that collision-resistance is insufficient for many interesting applications of cryptographic hash functions anyway. We argue the right formulation of the “hash combiner” is to build what we call random oracle (RO) combiners, utilizing stronger assumptions for stronger constructions.\r\nIndeed, we circumvent the previous lower bounds for collision resistance by constructing a simple length-preserving RO combiner C˜h1,h2Z1,Z2(M)=h1(M,Z1)⊕h2(M,Z2),where Z1,Z2\r\n are random salts of appropriate length. We show that this extra randomness is necessary for RO combiners, and indeed our construction is somewhat tight with this lower bound.\r\nOn the negative side, we show that one cannot generically apply the composition theorem to further replace “monolithic” hash functions h1 and h2 by some simpler indifferentiable construction (such as the Merkle-Damgård transformation) from smaller components, such as fixed-length compression functions. Finally, despite this issue, we directly prove collision resistance of the Merkle-Damgård variant of our combiner, where h1 and h2 are replaced by iterative Merkle-Damgård hashes applied to a fixed-length compression function. Thus, we can still subvert the concatenation barrier for collision-resistance combiners while utilizing practically small fixed-length components underneath."}]},{"date_created":"2023-05-22T08:41:48Z","doi":"10.1007/978-1-0716-3135-5_9","date_published":"2023-04-28T00:00:00Z","page":"137-147","publication":"The Immune Synapse","day":"28","year":"2023","publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"A.L. was funded by an Erwin Schrödinger postdoctoral fellowship of the Austrian Science Fund (FWF, project number: J4542-B) and is an EMBO non-stipendiary postdoctoral fellow. This work was supported by a European Research Council grant ERC-CoG-72437 to M.S. We thank the Imaging & Optics facility, the Nanofabrication facility, and the Miba Machine Shop of ISTA for their excellent support.","title":"En-Face Imaging of T Cell-Dendritic Cell Immunological Synapses","editor":[{"first_name":"Cosima","last_name":"Baldari","full_name":"Baldari, Cosima"},{"first_name":"Michael","full_name":"Dustin, Michael","last_name":"Dustin"}],"external_id":{"pmid":["37106180"]},"article_processing_charge":"No","author":[{"first_name":"Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","full_name":"Leithner, Alexander F","orcid":"0000-0002-1073-744X","last_name":"Leithner"},{"orcid":"0000-0001-5145-4609","full_name":"Merrin, Jack","last_name":"Merrin","id":"4515C308-F248-11E8-B48F-1D18A9856A87","first_name":"Jack"},{"last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Leithner AF, Merrin J, Sixt MK. En-Face Imaging of T Cell-Dendritic Cell Immunological Synapses. In: Baldari C, Dustin M, eds. The Immune Synapse. Vol 2654. MIMB. New York, NY: Springer Nature; 2023:137-147. doi:10.1007/978-1-0716-3135-5_9","apa":"Leithner, A. F., Merrin, J., & Sixt, M. K. (2023). En-Face Imaging of T Cell-Dendritic Cell Immunological Synapses. In C. Baldari & M. Dustin (Eds.), The Immune Synapse (Vol. 2654, pp. 137–147). New York, NY: Springer Nature. https://doi.org/10.1007/978-1-0716-3135-5_9","short":"A.F. Leithner, J. Merrin, M.K. Sixt, in:, C. Baldari, M. Dustin (Eds.), The Immune Synapse, Springer Nature, New York, NY, 2023, pp. 137–147.","ieee":"A. F. Leithner, J. Merrin, and M. K. Sixt, “En-Face Imaging of T Cell-Dendritic Cell Immunological Synapses,” in The Immune Synapse, vol. 2654, C. Baldari and M. Dustin, Eds. New York, NY: Springer Nature, 2023, pp. 137–147.","mla":"Leithner, Alexander F., et al. “En-Face Imaging of T Cell-Dendritic Cell Immunological Synapses.” The Immune Synapse, edited by Cosima Baldari and Michael Dustin, vol. 2654, Springer Nature, 2023, pp. 137–47, doi:10.1007/978-1-0716-3135-5_9.","ista":"Leithner AF, Merrin J, Sixt MK. 2023.En-Face Imaging of T Cell-Dendritic Cell Immunological Synapses. In: The Immune Synapse. Methods in Molecular Biology, vol. 2654, 137–147.","chicago":"Leithner, Alexander F, Jack Merrin, and Michael K Sixt. “En-Face Imaging of T Cell-Dendritic Cell Immunological Synapses.” In The Immune Synapse, edited by Cosima Baldari and Michael Dustin, 2654:137–47. MIMB. New York, NY: Springer Nature, 2023. https://doi.org/10.1007/978-1-0716-3135-5_9."},"project":[{"call_identifier":"H2020","_id":"25FE9508-B435-11E9-9278-68D0E5697425","name":"Cellular navigation along spatial gradients","grant_number":"724373"}],"ec_funded":1,"volume":2654,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1064-3745"],"isbn":["9781071631348"],"eissn":["1940-6029"],"eisbn":["9781071631355"]},"intvolume":" 2654","month":"04","place":"New York, NY","alternative_title":["Methods in Molecular Biology"],"scopus_import":"1","oa_version":"None","pmid":1,"abstract":[{"lang":"eng","text":"Imaging of the immunological synapse (IS) between dendritic cells (DCs) and T cells in suspension is hampered by suboptimal alignment of cell-cell contacts along the vertical imaging plane. This requires optical sectioning that often results in unsatisfactory resolution in time and space. Here, we present a workflow where DCs and T cells are confined between a layer of glass and polydimethylsiloxane (PDMS) that orients the cells along one, horizontal imaging plane, allowing for fast en-face-imaging of the DC-T cell IS."}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"NanoFab"},{"_id":"M-Shop"}],"department":[{"_id":"MiSi"},{"_id":"NanoFab"}],"date_updated":"2023-10-17T08:44:53Z","status":"public","type":"book_chapter","series_title":"MIMB","_id":"13052"},{"external_id":{"arxiv":["2103.08268"],"isi":["000912903000001"]},"article_processing_charge":"No","author":[{"id":"7b7eb4ca-eb2c-11ec-b98b-accec0b20c3b","first_name":"Yijie","last_name":"Diao","orcid":"0000-0002-4989-5330","full_name":"Diao, Yijie"}],"title":"Density of the union of positive diagonal binary quadratic forms","citation":{"ista":"Diao Y. 2023. Density of the union of positive diagonal binary quadratic forms. Acta Arithmetica. 207, 1–17.","chicago":"Diao, Yijie. “Density of the Union of Positive Diagonal Binary Quadratic Forms.” Acta Arithmetica. Instytut Matematyczny, 2023. https://doi.org/10.4064/aa210830-24-11.","ieee":"Y. Diao, “Density of the union of positive diagonal binary quadratic forms,” Acta Arithmetica, vol. 207. Instytut Matematyczny, pp. 1–17, 2023.","short":"Y. Diao, Acta Arithmetica 207 (2023) 1–17.","ama":"Diao Y. Density of the union of positive diagonal binary quadratic forms. Acta Arithmetica. 2023;207:1-17. doi:10.4064/aa210830-24-11","apa":"Diao, Y. (2023). Density of the union of positive diagonal binary quadratic forms. Acta Arithmetica. Instytut Matematyczny. https://doi.org/10.4064/aa210830-24-11","mla":"Diao, Yijie. “Density of the Union of Positive Diagonal Binary Quadratic Forms.” Acta Arithmetica, vol. 207, Instytut Matematyczny, 2023, pp. 1–17, doi:10.4064/aa210830-24-11."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Instytut Matematyczny","quality_controlled":"1","acknowledgement":"This article is a version the author’s master thesis at the University of Bonn. The author would like to thank his advisor Valentin Blomer for introducing the problem, and giving generous feedback and encouragement along the way, especially during the global pandemic.\r\nThe author thanks Edgar Assing for his lectures on analytic number theory. Finally, the author is grateful to the anonymous referees for their valuable time and comments.\r\n","page":"1-17","date_created":"2023-01-26T21:17:04Z","doi":"10.4064/aa210830-24-11","date_published":"2023-01-09T00:00:00Z","year":"2023","isi":1,"publication":"Acta Arithmetica","day":"09","article_type":"original","type":"journal_article","keyword":["Algebra","Number Theory"],"status":"public","_id":"12406","department":[{"_id":"GradSch"}],"date_updated":"2023-10-17T09:15:17Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2103.08268","open_access":"1"}],"intvolume":" 207","month":"01","abstract":[{"text":"Let X be a sufficiently large positive integer. We prove that one may choose a subset S of primes with cardinality O(logX) such that a positive proportion of integers less than X can be represented by x2+py2 for at least one p∈S.","lang":"eng"}],"oa_version":"Preprint","volume":207,"publication_status":"published","publication_identifier":{"issn":["0065-1036"],"eissn":["1730-6264"]},"language":[{"iso":"eng"}]},{"article_number":"3784","project":[{"call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425","grant_number":"758053","name":"A Fiber Optic Transceiver for Superconducting Qubits"},{"name":"Quantum Local Area Networks with Superconducting Qubits","grant_number":"899354","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A","call_identifier":"H2020"},{"_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"_id":"2671EB66-B435-11E9-9278-68D0E5697425","name":"Coherent on-chip conversion of superconducting qubit signals from microwaves to optical frequencies"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Qiu, Liu, et al. “Coherent Optical Control of a Superconducting Microwave Cavity via Electro-Optical Dynamical Back-Action.” Nature Communications, vol. 14, 3784, Nature Research, 2023, doi:10.1038/s41467-023-39493-3.","apa":"Qiu, L., Sahu, R., Hease, W. J., Arnold, G. M., & Fink, J. M. (2023). Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action. Nature Communications. Nature Research. https://doi.org/10.1038/s41467-023-39493-3","ama":"Qiu L, Sahu R, Hease WJ, Arnold GM, Fink JM. Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action. Nature Communications. 2023;14. doi:10.1038/s41467-023-39493-3","short":"L. Qiu, R. Sahu, W.J. Hease, G.M. Arnold, J.M. Fink, Nature Communications 14 (2023).","ieee":"L. Qiu, R. Sahu, W. J. Hease, G. M. Arnold, and J. M. Fink, “Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action,” Nature Communications, vol. 14. Nature Research, 2023.","chicago":"Qiu, Liu, Rishabh Sahu, William J Hease, Georg M Arnold, and Johannes M Fink. “Coherent Optical Control of a Superconducting Microwave Cavity via Electro-Optical Dynamical Back-Action.” Nature Communications. Nature Research, 2023. https://doi.org/10.1038/s41467-023-39493-3.","ista":"Qiu L, Sahu R, Hease WJ, Arnold GM, Fink JM. 2023. Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action. Nature Communications. 14, 3784."},"title":"Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action","author":[{"last_name":"Qiu","full_name":"Qiu, Liu","orcid":"0000-0003-4345-4267","first_name":"Liu","id":"45e99c0d-1eb1-11eb-9b96-ed8ab2983cac"},{"first_name":"Rishabh","id":"47D26E34-F248-11E8-B48F-1D18A9856A87","full_name":"Sahu, Rishabh","orcid":"0000-0001-6264-2162","last_name":"Sahu"},{"orcid":"0000-0001-9868-2166","full_name":"Hease, William J","last_name":"Hease","id":"29705398-F248-11E8-B48F-1D18A9856A87","first_name":"William J"},{"orcid":"0000-0003-1397-7876","full_name":"Arnold, Georg M","last_name":"Arnold","first_name":"Georg M","id":"3770C838-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fink","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M"}],"external_id":{"isi":["001018100800002"],"pmid":["37355691"],"arxiv":["2210.12443"]},"article_processing_charge":"No","acknowledgement":"This work was supported by the European Research Council under grant agreement no. 758053 (ERC StG QUNNECT), the European Union’s Horizon 2020 research and innovation program under grant agreement no. 899354 (FETopen SuperQuLAN), and the Austrian Science Fund (FWF) through BeyondC (F7105). L.Q. acknowledges generous support from the ISTFELLOW programme. W.H. is the recipient of an ISTplus postdoctoral fellowship with funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement no. 754411. G.A. is the recipient of a DOC fellowship of the Austrian Academy of Sciences at IST Austria.","quality_controlled":"1","publisher":"Nature Research","oa":1,"day":"24","publication":"Nature Communications","isi":1,"has_accepted_license":"1","year":"2023","date_published":"2023-06-24T00:00:00Z","doi":"10.1038/s41467-023-39493-3","date_created":"2023-07-09T22:01:11Z","_id":"13200","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)"},"ddc":["000"],"date_updated":"2023-10-17T11:46:12Z","file_date_updated":"2023-07-10T10:10:54Z","department":[{"_id":"JoFi"}],"pmid":1,"oa_version":"Published Version","abstract":[{"text":"Recent quantum technologies have established precise quantum control of various microscopic systems using electromagnetic waves. Interfaces based on cryogenic cavity electro-optic systems are particularly promising, due to the direct interaction between microwave and optical fields in the quantum regime. Quantum optical control of superconducting microwave circuits has been precluded so far due to the weak electro-optical coupling as well as quasi-particles induced by the pump laser. Here we report the coherent control of a superconducting microwave cavity using laser pulses in a multimode electro-optical device at millikelvin temperature with near-unity cooperativity. Both the stationary and instantaneous responses of the microwave and optical modes comply with the coherent electro-optical interaction, and reveal only minuscule amount of excess back-action with an unanticipated time delay. Our demonstration enables wide ranges of applications beyond quantum transductions, from squeezing and quantum non-demolition measurements of microwave fields, to entanglement generation and hybrid quantum networks.","lang":"eng"}],"month":"06","intvolume":" 14","scopus_import":"1","file":[{"success":1,"file_id":"13206","checksum":"ec7ccd2c08f90d59cab302fd0d7776a4","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2023_NatureComms_Qiu.pdf","date_created":"2023-07-10T10:10:54Z","file_size":1349134,"date_updated":"2023-07-10T10:10:54Z","creator":"alisjak"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2041-1723"]},"publication_status":"published","volume":14,"ec_funded":1},{"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"article_number":"e2302028120","article_processing_charge":"Yes (in subscription journal)","external_id":{"pmid":["37463204"]},"author":[{"last_name":"Barbier","full_name":"Barbier, Jean","first_name":"Jean"},{"full_name":"Camilli, Francesco","last_name":"Camilli","first_name":"Francesco"},{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"full_name":"Sáenz, Manuel","last_name":"Sáenz","first_name":"Manuel"}],"title":"Fundamental limits in structured principal component analysis and how to reach them","citation":{"mla":"Barbier, Jean, et al. “Fundamental Limits in Structured Principal Component Analysis and How to Reach Them.” Proceedings of the National Academy of Sciences of the United States of America, vol. 120, no. 30, e2302028120, National Academy of Sciences, 2023, doi:10.1073/pnas.2302028120.","short":"J. Barbier, F. Camilli, M. Mondelli, M. Sáenz, Proceedings of the National Academy of Sciences of the United States of America 120 (2023).","ieee":"J. Barbier, F. Camilli, M. Mondelli, and M. Sáenz, “Fundamental limits in structured principal component analysis and how to reach them,” Proceedings of the National Academy of Sciences of the United States of America, vol. 120, no. 30. National Academy of Sciences, 2023.","ama":"Barbier J, Camilli F, Mondelli M, Sáenz M. Fundamental limits in structured principal component analysis and how to reach them. Proceedings of the National Academy of Sciences of the United States of America. 2023;120(30). doi:10.1073/pnas.2302028120","apa":"Barbier, J., Camilli, F., Mondelli, M., & Sáenz, M. (2023). Fundamental limits in structured principal component analysis and how to reach them. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2302028120","chicago":"Barbier, Jean, Francesco Camilli, Marco Mondelli, and Manuel Sáenz. “Fundamental Limits in Structured Principal Component Analysis and How to Reach Them.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2023. https://doi.org/10.1073/pnas.2302028120.","ista":"Barbier J, Camilli F, Mondelli M, Sáenz M. 2023. Fundamental limits in structured principal component analysis and how to reach them. Proceedings of the National Academy of Sciences of the United States of America. 120(30), e2302028120."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"National Academy of Sciences","quality_controlled":"1","acknowledgement":"J.B. was funded by the European Union (ERC, CHORAL, project number 101039794). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them. M.M. was supported by the 2019 Lopez-Loreta Prize. We would like to thank the reviewers for the insightful comments and, in particular, for suggesting the BAMP-inspired denoisers leading to AMP-AP.","date_created":"2023-07-30T22:01:02Z","date_published":"2023-07-25T00:00:00Z","doi":"10.1073/pnas.2302028120","year":"2023","has_accepted_license":"1","publication":"Proceedings of the National Academy of Sciences of the United States of America","day":"25","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":"13315","file_date_updated":"2023-07-31T07:30:48Z","department":[{"_id":"MaMo"}],"date_updated":"2023-10-17T11:44:55Z","ddc":["000"],"scopus_import":"1","intvolume":" 120","month":"07","abstract":[{"text":"How do statistical dependencies in measurement noise influence high-dimensional inference? To answer this, we study the paradigmatic spiked matrix model of principal components analysis (PCA), where a rank-one matrix is corrupted by additive noise. We go beyond the usual independence assumption on the noise entries, by drawing the noise from a low-order polynomial orthogonal matrix ensemble. The resulting noise correlations make the setting relevant for applications but analytically challenging. We provide characterization of the Bayes optimal limits of inference in this model. If the spike is rotation invariant, we show that standard spectral PCA is optimal. However, for more general priors, both PCA and the existing approximate message-passing algorithm (AMP) fall short of achieving the information-theoretic limits, which we compute using the replica method from statistical physics. We thus propose an AMP, inspired by the theory of adaptive Thouless–Anderson–Palmer equations, which is empirically observed to saturate the conjectured theoretical limit. This AMP comes with a rigorous state evolution analysis tracking its performance. Although we focus on specific noise distributions, our methodology can be generalized to a wide class of trace matrix ensembles at the cost of more involved expressions. Finally, despite the seemingly strong assumption of rotation-invariant noise, our theory empirically predicts algorithmic performance on real data, pointing at strong universality properties.","lang":"eng"}],"oa_version":"Published Version","pmid":1,"related_material":{"link":[{"relation":"software","url":"https://github.com/fcamilli95/Structured-PCA-"}]},"volume":120,"issue":"30","publication_status":"published","publication_identifier":{"eissn":["1091-6490"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2023_PNAS_Barbier.pdf","date_created":"2023-07-31T07:30:48Z","file_size":995933,"date_updated":"2023-07-31T07:30:48Z","creator":"dernst","success":1,"checksum":"1fc06228afdb3aa80cf8e7766bcf9dc5","file_id":"13323","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}]},{"ec_funded":1,"volume":120,"issue":"32","publication_status":"published","publication_identifier":{"eissn":["1091-6490"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2023-08-14T07:43:45Z","file_size":1003092,"creator":"dernst","date_created":"2023-08-14T07:43:45Z","file_name":"2023_PNAS_Vardi.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"a5ed64788a5acef9b9a300a26fa5a177","file_id":"14047","success":1}],"scopus_import":"1","intvolume":" 120","month":"07","abstract":[{"lang":"eng","text":"Traditionally, nuclear spin is not considered to affect biological processes. Recently, this has changed as isotopic fractionation that deviates from classical mass dependence was reported both in vitro and in vivo. In these cases, the isotopic effect correlates with the nuclear magnetic spin. Here, we show nuclear spin effects using stable oxygen isotopes (16O, 17O, and 18O) in two separate setups: an artificial dioxygen production system and biological aquaporin channels in cells. We observe that oxygen dynamics in chiral environments (in particular its transport) depend on nuclear spin, suggesting future applications for controlled isotope separation to be used, for instance, in NMR. To demonstrate the mechanism behind our findings, we formulate theoretical models based on a nuclear-spin-enhanced switch between electronic spin states. Accounting for the role of nuclear spin in biology can provide insights into the role of quantum effects in living systems and help inspire the development of future biotechnology solutions."}],"pmid":1,"oa_version":"Published Version","department":[{"_id":"MiLe"}],"file_date_updated":"2023-08-14T07:43:45Z","date_updated":"2023-10-17T11:45:25Z","ddc":["530"],"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"type":"journal_article","article_type":"original","status":"public","_id":"14037","date_created":"2023-08-13T22:01:12Z","doi":"10.1073/pnas.2300828120","date_published":"2023-07-31T00:00:00Z","year":"2023","has_accepted_license":"1","publication":"Proceedings of the National Academy of Sciences of the United States of America","day":"31","oa":1,"quality_controlled":"1","publisher":"National Academy of Sciences","acknowledgement":"N.M.-S. acknowledges the support of the Ministry of Energy, Israel, as part of the scholarship program for graduate students in the fields of energy. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). Y.P. acknowledges the support of the Ministry of Innovation, Science and Technology, Israel Grant No. 1001593872. Y.P acknowledges the support of the BSF-NSF 094 Grant No. 2022503.","article_processing_charge":"Yes (in subscription journal)","external_id":{"pmid":["37523549"]},"author":[{"last_name":"Vardi","full_name":"Vardi, Ofek","first_name":"Ofek"},{"full_name":"Maroudas-Sklare, Naama","last_name":"Maroudas-Sklare","first_name":"Naama"},{"last_name":"Kolodny","full_name":"Kolodny, Yuval","first_name":"Yuval"},{"id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem","full_name":"Volosniev, Artem","orcid":"0000-0003-0393-5525","last_name":"Volosniev"},{"first_name":"Amijai","last_name":"Saragovi","full_name":"Saragovi, Amijai"},{"last_name":"Galili","full_name":"Galili, Nir","first_name":"Nir"},{"last_name":"Ferrera","full_name":"Ferrera, Stav","first_name":"Stav"},{"id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","first_name":"Areg","last_name":"Ghazaryan","orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg"},{"first_name":"Nir","full_name":"Yuran, Nir","last_name":"Yuran"},{"full_name":"Affek, Hagit P.","last_name":"Affek","first_name":"Hagit P."},{"last_name":"Luz","full_name":"Luz, Boaz","first_name":"Boaz"},{"full_name":"Goldsmith, Yonaton","last_name":"Goldsmith","first_name":"Yonaton"},{"full_name":"Keren, Nir","last_name":"Keren","first_name":"Nir"},{"first_name":"Shira","last_name":"Yochelis","full_name":"Yochelis, Shira"},{"first_name":"Itay","full_name":"Halevy, Itay","last_name":"Halevy"},{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Paltiel","full_name":"Paltiel, Yossi","first_name":"Yossi"}],"title":"Nuclear spin effects in biological processes","citation":{"mla":"Vardi, Ofek, et al. “Nuclear Spin Effects in Biological Processes.” Proceedings of the National Academy of Sciences of the United States of America, vol. 120, no. 32, e2300828120, National Academy of Sciences, 2023, doi:10.1073/pnas.2300828120.","apa":"Vardi, O., Maroudas-Sklare, N., Kolodny, Y., Volosniev, A., Saragovi, A., Galili, N., … Paltiel, Y. (2023). Nuclear spin effects in biological processes. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2300828120","ama":"Vardi O, Maroudas-Sklare N, Kolodny Y, et al. Nuclear spin effects in biological processes. Proceedings of the National Academy of Sciences of the United States of America. 2023;120(32). doi:10.1073/pnas.2300828120","ieee":"O. Vardi et al., “Nuclear spin effects in biological processes,” Proceedings of the National Academy of Sciences of the United States of America, vol. 120, no. 32. National Academy of Sciences, 2023.","short":"O. Vardi, N. Maroudas-Sklare, Y. Kolodny, A. Volosniev, A. Saragovi, N. Galili, S. Ferrera, A. Ghazaryan, N. Yuran, H.P. Affek, B. Luz, Y. Goldsmith, N. Keren, S. Yochelis, I. Halevy, M. Lemeshko, Y. Paltiel, Proceedings of the National Academy of Sciences of the United States of America 120 (2023).","chicago":"Vardi, Ofek, Naama Maroudas-Sklare, Yuval Kolodny, Artem Volosniev, Amijai Saragovi, Nir Galili, Stav Ferrera, et al. “Nuclear Spin Effects in Biological Processes.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2023. https://doi.org/10.1073/pnas.2300828120.","ista":"Vardi O, Maroudas-Sklare N, Kolodny Y, Volosniev A, Saragovi A, Galili N, Ferrera S, Ghazaryan A, Yuran N, Affek HP, Luz B, Goldsmith Y, Keren N, Yochelis S, Halevy I, Lemeshko M, Paltiel Y. 2023. Nuclear spin effects in biological processes. Proceedings of the National Academy of Sciences of the United States of America. 120(32), e2300828120."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425"}],"article_number":"e2300828120"},{"department":[{"_id":"LaEr"}],"file_date_updated":"2023-02-27T09:43:27Z","date_updated":"2023-10-17T12:48:10Z","ddc":["510"],"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":"12683","volume":28,"ec_funded":1,"publication_identifier":{"eissn":["1083-589X"]},"publication_status":"published","file":[{"file_id":"12692","checksum":"a1c6f0a3e33688fd71309c86a9aad86e","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-02-27T09:43:27Z","file_name":"2023_ElectCommProbability_Dubach.pdf","creator":"dernst","date_updated":"2023-02-27T09:43:27Z","file_size":479105}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"02","intvolume":" 28","abstract":[{"text":"We study the eigenvalue trajectories of a time dependent matrix Gt=H+itvv∗ for t≥0, where H is an N×N Hermitian random matrix and v is a unit vector. In particular, we establish that with high probability, an outlier can be distinguished at all times t>1+N−1/3+ϵ, for any ϵ>0. The study of this natural process combines elements of Hermitian and non-Hermitian analysis, and illustrates some aspects of the intrinsic instability of (even weakly) non-Hermitian matrices.","lang":"eng"}],"oa_version":"Published Version","author":[{"last_name":"Dubach","orcid":"0000-0001-6892-8137","full_name":"Dubach, Guillaume","first_name":"Guillaume","id":"D5C6A458-10C4-11EA-ABF4-A4B43DDC885E"},{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"arxiv":["2108.13694"],"isi":["000950650200005"]},"title":"Dynamics of a rank-one perturbation of a Hermitian matrix","citation":{"short":"G. Dubach, L. Erdös, Electronic Communications in Probability 28 (2023) 1–13.","ieee":"G. Dubach and L. Erdös, “Dynamics of a rank-one perturbation of a Hermitian matrix,” Electronic Communications in Probability, vol. 28. Institute of Mathematical Statistics, pp. 1–13, 2023.","apa":"Dubach, G., & Erdös, L. (2023). Dynamics of a rank-one perturbation of a Hermitian matrix. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/23-ECP516","ama":"Dubach G, Erdös L. Dynamics of a rank-one perturbation of a Hermitian matrix. Electronic Communications in Probability. 2023;28:1-13. doi:10.1214/23-ECP516","mla":"Dubach, Guillaume, and László Erdös. “Dynamics of a Rank-One Perturbation of a Hermitian Matrix.” Electronic Communications in Probability, vol. 28, Institute of Mathematical Statistics, 2023, pp. 1–13, doi:10.1214/23-ECP516.","ista":"Dubach G, Erdös L. 2023. Dynamics of a rank-one perturbation of a Hermitian matrix. Electronic Communications in Probability. 28, 1–13.","chicago":"Dubach, Guillaume, and László Erdös. “Dynamics of a Rank-One Perturbation of a Hermitian Matrix.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2023. https://doi.org/10.1214/23-ECP516."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331"}],"page":"1-13","date_published":"2023-02-08T00:00:00Z","doi":"10.1214/23-ECP516","date_created":"2023-02-26T23:01:01Z","isi":1,"has_accepted_license":"1","year":"2023","day":"08","publication":"Electronic Communications in Probability","publisher":"Institute of Mathematical Statistics","quality_controlled":"1","oa":1,"acknowledgement":"G. Dubach gratefully acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. L. Erdős is supported by ERC Advanced Grant “RMTBeyond” No. 101020331."},{"department":[{"_id":"LaEr"}],"date_updated":"2023-10-17T12:48:52Z","status":"public","article_type":"original","type":"journal_article","_id":"12761","volume":33,"issue":"1","ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1050-5164"]},"publication_status":"published","month":"02","intvolume":" 33","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2012.13218","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"We consider the fluctuations of regular functions f of a Wigner matrix W viewed as an entire matrix f (W). Going beyond the well-studied tracial mode, Trf (W), which is equivalent to the customary linear statistics of eigenvalues, we show that Trf (W)A is asymptotically normal for any nontrivial bounded deterministic matrix A. We identify three different and asymptotically independent modes of this fluctuation, corresponding to the tracial part, the traceless diagonal part and the off-diagonal part of f (W) in the entire mesoscopic regime, where we find that the off-diagonal modes fluctuate on a much smaller scale than the tracial mode. As a main motivation to study CLT in such generality on small mesoscopic scales, we determine\r\nthe fluctuations in the eigenstate thermalization hypothesis (Phys. Rev. A 43 (1991) 2046–2049), that is, prove that the eigenfunction overlaps with any deterministic matrix are asymptotically Gaussian after a small spectral averaging. Finally, in the macroscopic regime our result also generalizes (Zh. Mat. Fiz. Anal. Geom. 9 (2013) 536–581, 611, 615) to complex W and to all crossover ensembles in between. The main technical inputs are the recent\r\nmultiresolvent local laws with traceless deterministic matrices from the companion paper (Comm. Math. Phys. 388 (2021) 1005–1048).","lang":"eng"}],"title":"Functional central limit theorems for Wigner matrices","author":[{"orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","last_name":"Cipolloni","first_name":"Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schröder","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J"}],"external_id":{"isi":["000946432400015"],"arxiv":["2012.13218"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Cipolloni G, Erdös L, Schröder DJ. 2023. Functional central limit theorems for Wigner matrices. Annals of Applied Probability. 33(1), 447–489.","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Functional Central Limit Theorems for Wigner Matrices.” Annals of Applied Probability. Institute of Mathematical Statistics, 2023. https://doi.org/10.1214/22-AAP1820.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Annals of Applied Probability 33 (2023) 447–489.","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Functional central limit theorems for Wigner matrices,” Annals of Applied Probability, vol. 33, no. 1. Institute of Mathematical Statistics, pp. 447–489, 2023.","ama":"Cipolloni G, Erdös L, Schröder DJ. Functional central limit theorems for Wigner matrices. Annals of Applied Probability. 2023;33(1):447-489. doi:10.1214/22-AAP1820","apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). Functional central limit theorems for Wigner matrices. Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/22-AAP1820","mla":"Cipolloni, Giorgio, et al. “Functional Central Limit Theorems for Wigner Matrices.” Annals of Applied Probability, vol. 33, no. 1, Institute of Mathematical Statistics, 2023, pp. 447–89, doi:10.1214/22-AAP1820."},"project":[{"call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"date_published":"2023-02-01T00:00:00Z","doi":"10.1214/22-AAP1820","date_created":"2023-03-26T22:01:08Z","page":"447-489","day":"01","publication":"Annals of Applied Probability","isi":1,"year":"2023","quality_controlled":"1","publisher":"Institute of Mathematical Statistics","oa":1,"acknowledgement":"The second author is partially funded by the ERC Advanced Grant “RMTBEYOND” No. 101020331. The third author is supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation."},{"title":"The Hasse principle for random Fano hypersurfaces","author":[{"first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177"},{"last_name":"Boudec","full_name":"Boudec, Pierre Le","first_name":"Pierre Le"},{"first_name":"Will","full_name":"Sawin, Will","last_name":"Sawin"}],"external_id":{"isi":["000966611000003"],"arxiv":["2006.02356"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Browning TD, Boudec PL, Sawin W. 2023. The Hasse principle for random Fano hypersurfaces. Annals of Mathematics. 197(3), 1115–1203.","chicago":"Browning, Timothy D, Pierre Le Boudec, and Will Sawin. “The Hasse Principle for Random Fano Hypersurfaces.” Annals of Mathematics. Princeton University, 2023. https://doi.org/10.4007/annals.2023.197.3.3.","apa":"Browning, T. D., Boudec, P. L., & Sawin, W. (2023). The Hasse principle for random Fano hypersurfaces. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2023.197.3.3","ama":"Browning TD, Boudec PL, Sawin W. The Hasse principle for random Fano hypersurfaces. Annals of Mathematics. 2023;197(3):1115-1203. doi:10.4007/annals.2023.197.3.3","short":"T.D. Browning, P.L. Boudec, W. Sawin, Annals of Mathematics 197 (2023) 1115–1203.","ieee":"T. D. Browning, P. L. Boudec, and W. Sawin, “The Hasse principle for random Fano hypersurfaces,” Annals of Mathematics, vol. 197, no. 3. Princeton University, pp. 1115–1203, 2023.","mla":"Browning, Timothy D., et al. “The Hasse Principle for Random Fano Hypersurfaces.” Annals of Mathematics, vol. 197, no. 3, Princeton University, 2023, pp. 1115–203, doi:10.4007/annals.2023.197.3.3."},"publisher":"Princeton University","quality_controlled":"1","oa":1,"doi":"10.4007/annals.2023.197.3.3","date_published":"2023-05-01T00:00:00Z","date_created":"2020-10-19T14:28:50Z","page":"1115-1203","day":"01","publication":"Annals of Mathematics","isi":1,"year":"2023","status":"public","type":"journal_article","article_type":"original","_id":"8682","department":[{"_id":"TiBr"}],"date_updated":"2023-10-17T12:47:43Z","month":"05","intvolume":" 197","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.02356"}],"oa_version":"Preprint","abstract":[{"text":"It is known that the Brauer--Manin obstruction to the Hasse principle is vacuous for smooth Fano hypersurfaces of dimension at least 3 over any number field. Moreover, for such varieties it follows from a general conjecture of Colliot-Thélène that the Brauer--Manin obstruction to the Hasse principle should be the only one, so that the Hasse principle is expected to hold. Working over the field of rational numbers and ordering Fano hypersurfaces of fixed degree and dimension by height, we prove that almost every such hypersurface satisfies the Hasse principle provided that the dimension is at least 3. This proves a conjecture of Poonen and Voloch in every case except for cubic surfaces.","lang":"eng"}],"related_material":{"link":[{"url":"https://ist.ac.at/en/news/when-is-necessary-sufficient/","relation":"press_release","description":"News on IST Homepage"}]},"issue":"3","volume":197,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0003-486X"]},"publication_status":"published"},{"pmid":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Allometric settings of population dynamics models are appealing due to their parsimonious nature and broad utility when studying system level effects. Here, we parameterise the size-scaled Rosenzweig-MacArthur differential equations to eliminate prey-mass dependency, facilitating an in depth analytic study of the equations which incorporates scaling parameters’ contributions to coexistence. We define the functional response term to match empirical findings, and examine situations where metabolic theory derivations and observation diverge. The dynamical properties of the Rosenzweig-MacArthur system, encompassing the distribution of size-abundance equilibria, the scaling of period and amplitude of population cycling, and relationships between predator and prey abundances, are consistent with empirical observation. Our parameterisation is an accurate minimal model across 15+ orders of mass magnitude."}],"intvolume":" 18","month":"02","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"date_updated":"2023-03-07T10:26:45Z","file_size":1257003,"creator":"cchlebak","date_created":"2023-03-07T10:26:45Z","file_name":"2023_PLOSOne_Mckerral.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"12712","checksum":"798ed5739a4117b03173e5d56e0534c9","success":1}],"publication_status":"published","publication_identifier":{"eissn":["1932-6203"]},"volume":18,"issue":"2","_id":"12706","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":["000"],"date_updated":"2023-10-17T12:53:30Z","department":[{"_id":"KrCh"}],"file_date_updated":"2023-03-07T10:26:45Z","acknowledgement":"This research was supported by an Australian Government Research Training Program\r\n(RTP) Scholarship to JCM (https://www.dese.gov.au), and LB is supported by the Centre de\r\nrecherche sur le vieillissement Fellowship Program. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","oa":1,"publisher":"Public Library of Science","quality_controlled":"1","publication":"PLoS One","day":"27","year":"2023","isi":1,"has_accepted_license":"1","date_created":"2023-03-05T23:01:05Z","doi":"10.1371/journal.pone.0279838","date_published":"2023-02-27T00:00:00Z","page":"e0279838","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Mckerral, Jody C., et al. “Empirical Parameterisation and Dynamical Analysis of the Allometric Rosenzweig-MacArthur Equations.” PLoS One, vol. 18, no. 2, Public Library of Science, 2023, p. e0279838, doi:10.1371/journal.pone.0279838.","ama":"Mckerral JC, Kleshnina M, Ejov V, Bartle L, Mitchell JG, Filar JA. Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. 2023;18(2):e0279838. doi:10.1371/journal.pone.0279838","apa":"Mckerral, J. C., Kleshnina, M., Ejov, V., Bartle, L., Mitchell, J. G., & Filar, J. A. (2023). Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0279838","ieee":"J. C. Mckerral, M. Kleshnina, V. Ejov, L. Bartle, J. G. Mitchell, and J. A. Filar, “Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations,” PLoS One, vol. 18, no. 2. Public Library of Science, p. e0279838, 2023.","short":"J.C. Mckerral, M. Kleshnina, V. Ejov, L. Bartle, J.G. Mitchell, J.A. Filar, PLoS One 18 (2023) e0279838.","chicago":"Mckerral, Jody C., Maria Kleshnina, Vladimir Ejov, Louise Bartle, James G. Mitchell, and Jerzy A. Filar. “Empirical Parameterisation and Dynamical Analysis of the Allometric Rosenzweig-MacArthur Equations.” PLoS One. Public Library of Science, 2023. https://doi.org/10.1371/journal.pone.0279838.","ista":"Mckerral JC, Kleshnina M, Ejov V, Bartle L, Mitchell JG, Filar JA. 2023. Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. 18(2), e0279838."},"title":"Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations","article_processing_charge":"No","external_id":{"pmid":["36848357"],"isi":["000996122900022"]},"author":[{"full_name":"Mckerral, Jody C.","last_name":"Mckerral","first_name":"Jody C."},{"first_name":"Maria","id":"4E21749C-F248-11E8-B48F-1D18A9856A87","last_name":"Kleshnina","full_name":"Kleshnina, Maria"},{"first_name":"Vladimir","full_name":"Ejov, Vladimir","last_name":"Ejov"},{"last_name":"Bartle","full_name":"Bartle, Louise","first_name":"Louise"},{"last_name":"Mitchell","full_name":"Mitchell, James G.","first_name":"James G."},{"last_name":"Filar","full_name":"Filar, Jerzy A.","first_name":"Jerzy A."}]},{"author":[{"orcid":"0000-0002-6170-2546","full_name":"Eguchi, Kohgaku","last_name":"Eguchi","first_name":"Kohgaku","id":"2B7846DC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Le Monnier, Elodie","last_name":"Le Monnier","id":"3B59276A-F248-11E8-B48F-1D18A9856A87","first_name":"Elodie"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"}],"article_processing_charge":"No","external_id":{"pmid":["37160366"],"isi":["001020132100005"]},"title":"Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons","citation":{"chicago":"Eguchi, Kohgaku, Elodie Le Monnier, and Ryuichi Shigemoto. “Nanoscale Phosphoinositide Distribution on Cell Membranes of Mouse Cerebellar Neurons.” The Journal of Neuroscience. Society for Neuroscience, 2023. https://doi.org/10.1523/JNEUROSCI.1514-22.2023.","ista":"Eguchi K, Le Monnier E, Shigemoto R. 2023. Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons. The Journal of Neuroscience. 43(23), 4197–4216.","mla":"Eguchi, Kohgaku, et al. “Nanoscale Phosphoinositide Distribution on Cell Membranes of Mouse Cerebellar Neurons.” The Journal of Neuroscience, vol. 43, no. 23, Society for Neuroscience, 2023, pp. 4197–216, doi:10.1523/JNEUROSCI.1514-22.2023.","apa":"Eguchi, K., Le Monnier, E., & Shigemoto, R. (2023). Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons. The Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1514-22.2023","ama":"Eguchi K, Le Monnier E, Shigemoto R. Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons. The Journal of Neuroscience. 2023;43(23):4197-4216. doi:10.1523/JNEUROSCI.1514-22.2023","ieee":"K. Eguchi, E. Le Monnier, and R. Shigemoto, “Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons,” The Journal of Neuroscience, vol. 43, no. 23. Society for Neuroscience, pp. 4197–4216, 2023.","short":"K. Eguchi, E. Le Monnier, R. Shigemoto, The Journal of Neuroscience 43 (2023) 4197–4216."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","_id":"2659CC84-B435-11E9-9278-68D0E5697425","grant_number":"793482","name":"Ultrastructural analysis of phosphoinositides in nerve terminals: distribution, dynamics and physiological roles in synaptic transmission"},{"grant_number":"694539","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","call_identifier":"H2020","_id":"25CA28EA-B435-11E9-9278-68D0E5697425"}],"page":"4197-4216","date_published":"2023-06-07T00:00:00Z","doi":"10.1523/JNEUROSCI.1514-22.2023","date_created":"2023-07-09T22:01:12Z","has_accepted_license":"1","isi":1,"year":"2023","day":"07","publication":"The Journal of Neuroscience","quality_controlled":"1","publisher":"Society for Neuroscience","oa":1,"acknowledgement":"This work was supported by The Institute of Science and Technology (IST) Austria, the European Union's Horizon 2020 Research and Innovation Program under the Marie Skłodowska-Curie Grant Agreement No. 793482 (to K.E.) and by the European Research Council (ERC) Grant Agreement No. 694539 (to R.S.). We thank Nicoleta Condruz (IST Austria, Klosterneuburg, Austria) for technical assistance with sample preparation, the Electron Microscopy Facility of IST Austria (Klosterneuburg, Austria) for technical support with EM works, Natalia Baranova (University of Vienna, Vienna, Austria) and Martin Loose (IST Austria, Klosterneuburg, Austria) for advice on liposome preparation, and Yugo Fukazawa (University of Fukui, Fukui, Japan) for comments.","department":[{"_id":"RySh"}],"file_date_updated":"2023-07-10T09:04:58Z","date_updated":"2023-10-18T07:12:47Z","ddc":["570"],"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","_id":"13202","issue":"23","volume":43,"ec_funded":1,"publication_identifier":{"eissn":["1529-2401"],"issn":["0270-6474"]},"publication_status":"published","file":[{"creator":"alisjak","file_size":7794425,"date_updated":"2023-07-10T09:04:58Z","file_name":"2023_JN_Eguchi.pdf","date_created":"2023-07-10T09:04:58Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"13205","checksum":"70b2141870e0bf1c94fd343e18fdbc32"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"06","intvolume":" 43","abstract":[{"lang":"eng","text":"Phosphatidylinositol-4,5-bisphosphate (PI(4,5)P2) plays an essential role in neuronal activities through interaction with various proteins involved in signaling at membranes. However, the distribution pattern of PI(4,5)P2 and the association with these proteins on the neuronal cell membranes remain elusive. In this study, we established a method for visualizing PI(4,5)P2 by SDS-digested freeze-fracture replica labeling (SDS-FRL) to investigate the quantitative nanoscale distribution of PI(4,5)P2 in cryo-fixed brain. We demonstrate that PI(4,5)P2 forms tiny clusters with a mean size of ∼1000 nm2 rather than randomly distributed in cerebellar neuronal membranes in male C57BL/6J mice. These clusters show preferential accumulation in specific membrane compartments of different cell types, in particular, in Purkinje cell (PC) spines and granule cell (GC) presynaptic active zones. Furthermore, we revealed extensive association of PI(4,5)P2 with CaV2.1 and GIRK3 across different membrane compartments, whereas its association with mGluR1α was compartment specific. These results suggest that our SDS-FRL method provides valuable insights into the physiological functions of PI(4,5)P2 in neurons."}],"acknowledged_ssus":[{"_id":"EM-Fac"}],"oa_version":"Published Version","pmid":1},{"publication":"Annali della Scuola Normale Superiore di Pisa - Classe di Scienze","day":"16","year":"2023","date_created":"2023-05-07T22:01:04Z","doi":"10.2422/2036-2145.202010_018","date_published":"2023-02-16T00:00:00Z","page":"173-204","oa":1,"publisher":"Scuola Normale Superiore - Edizioni della Normale","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Bonolis, Dante, and Timothy D Browning. “Uniform Bounds for Rational Points on Hyperelliptic Fibrations.” Annali Della Scuola Normale Superiore Di Pisa - Classe Di Scienze. Scuola Normale Superiore - Edizioni della Normale, 2023. https://doi.org/10.2422/2036-2145.202010_018.","ista":"Bonolis D, Browning TD. 2023. Uniform bounds for rational points on hyperelliptic fibrations. Annali della Scuola Normale Superiore di Pisa - Classe di Scienze. 24(1), 173–204.","mla":"Bonolis, Dante, and Timothy D. Browning. “Uniform Bounds for Rational Points on Hyperelliptic Fibrations.” Annali Della Scuola Normale Superiore Di Pisa - Classe Di Scienze, vol. 24, no. 1, Scuola Normale Superiore - Edizioni della Normale, 2023, pp. 173–204, doi:10.2422/2036-2145.202010_018.","ama":"Bonolis D, Browning TD. Uniform bounds for rational points on hyperelliptic fibrations. Annali della Scuola Normale Superiore di Pisa - Classe di Scienze. 2023;24(1):173-204. doi:10.2422/2036-2145.202010_018","apa":"Bonolis, D., & Browning, T. D. (2023). Uniform bounds for rational points on hyperelliptic fibrations. Annali Della Scuola Normale Superiore Di Pisa - Classe Di Scienze. Scuola Normale Superiore - Edizioni della Normale. https://doi.org/10.2422/2036-2145.202010_018","short":"D. Bonolis, T.D. Browning, Annali Della Scuola Normale Superiore Di Pisa - Classe Di Scienze 24 (2023) 173–204.","ieee":"D. Bonolis and T. D. Browning, “Uniform bounds for rational points on hyperelliptic fibrations,” Annali della Scuola Normale Superiore di Pisa - Classe di Scienze, vol. 24, no. 1. Scuola Normale Superiore - Edizioni della Normale, pp. 173–204, 2023."},"title":"Uniform bounds for rational points on hyperelliptic fibrations","article_processing_charge":"No","external_id":{"arxiv":["2007.14182"]},"author":[{"last_name":"Bonolis","full_name":"Bonolis, Dante","id":"6A459894-5FDD-11E9-AF35-BB24E6697425","first_name":"Dante"},{"full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","last_name":"Browning","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0391-173X"],"eissn":["2036-2145"]},"volume":24,"issue":"1","oa_version":"Preprint","abstract":[{"text":"We apply a variant of the square-sieve to produce an upper bound for the number of rational points of bounded height on a family of surfaces that admit a fibration over P1 whose general fibre is a hyperelliptic curve. The implied constant does not depend on the coefficients of the polynomial defining the surface.\r\n","lang":"eng"}],"intvolume":" 24","month":"02","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2007.14182"}],"scopus_import":"1","date_updated":"2023-10-18T06:54:30Z","department":[{"_id":"TiBr"}],"_id":"12916","status":"public","article_type":"original","type":"journal_article"},{"publisher":"Institute of Science and Technology Austria","year":"2023","has_accepted_license":"1","day":"12","page":"148","date_created":"2023-10-12T14:13:25Z","doi":"10.15479/at:ista:14422","date_published":"2023-10-12T00:00:00Z","project":[{"name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","grant_number":"819603","call_identifier":"H2020","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234"}],"citation":{"ista":"Confavreux BJ. 2023. Synapseek: Meta-learning synaptic plasticity rules. Institute of Science and Technology Austria.","chicago":"Confavreux, Basile J. “Synapseek: Meta-Learning Synaptic Plasticity Rules.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:14422.","ieee":"B. J. Confavreux, “Synapseek: Meta-learning synaptic plasticity rules,” Institute of Science and Technology Austria, 2023.","short":"B.J. Confavreux, Synapseek: Meta-Learning Synaptic Plasticity Rules, Institute of Science and Technology Austria, 2023.","ama":"Confavreux BJ. Synapseek: Meta-learning synaptic plasticity rules. 2023. doi:10.15479/at:ista:14422","apa":"Confavreux, B. J. (2023). Synapseek: Meta-learning synaptic plasticity rules. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:14422","mla":"Confavreux, Basile J. Synapseek: Meta-Learning Synaptic Plasticity Rules. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:14422."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","author":[{"full_name":"Confavreux, Basile J","last_name":"Confavreux","first_name":"Basile J","id":"C7610134-B532-11EA-BD9F-F5753DDC885E"}],"title":"Synapseek: Meta-learning synaptic plasticity rules","abstract":[{"lang":"eng","text":"Animals exhibit a remarkable ability to learn and remember new behaviors, skills, and associations throughout their lifetime. These capabilities are made possible thanks to a variety of\r\nchanges in the brain throughout adulthood, regrouped under the term \"plasticity\". Some cells\r\nin the brain —neurons— and specifically changes in the connections between neurons, the\r\nsynapses, were shown to be crucial for the formation, selection, and consolidation of memories\r\nfrom past experiences. These ongoing changes of synapses across time are called synaptic\r\nplasticity. Understanding how a myriad of biochemical processes operating at individual\r\nsynapses can somehow work in concert to give rise to meaningful changes in behavior is a\r\nfascinating problem and an active area of research.\r\nHowever, the experimental search for the precise plasticity mechanisms at play in the brain\r\nis daunting, as it is difficult to control and observe synapses during learning. Theoretical\r\napproaches have thus been the default method to probe the plasticity-behavior connection. Such\r\nstudies attempt to extract unifying principles across synapses and model all observed synaptic\r\nchanges using plasticity rules: equations that govern the evolution of synaptic strengths across\r\ntime in neuronal network models. These rules can use many relevant quantities to determine\r\nthe magnitude of synaptic changes, such as the precise timings of pre- and postsynaptic\r\naction potentials, the recent neuronal activity levels, the state of neighboring synapses, etc.\r\nHowever, analytical studies rely heavily on human intuition and are forced to make simplifying\r\nassumptions about plasticity rules.\r\nIn this thesis, we aim to assist and augment human intuition in this search for plasticity rules.\r\nWe explore whether a numerical approach could automatically discover the plasticity rules\r\nthat elicit desired behaviors in large networks of interconnected neurons. This approach is\r\ndubbed meta-learning synaptic plasticity: learning plasticity rules which themselves will make\r\nneuronal networks learn how to solve a desired task. We first write all the potential plasticity\r\nmechanisms to consider using a single expression with adjustable parameters. We then optimize\r\nthese plasticity parameters using evolutionary strategies or Bayesian inference on tasks known\r\nto involve synaptic plasticity, such as familiarity detection and network stabilization.\r\nWe show that these automated approaches are powerful tools, able to complement established\r\nanalytical methods. By comprehensively screening plasticity rules at all synapse types in\r\nrealistic, spiking neuronal network models, we discover entire sets of degenerate plausible\r\nplasticity rules that reliably elicit memory-related behaviors. Our approaches allow for more\r\nrobust experimental predictions, by abstracting out the idiosyncrasies of individual plasticity\r\nrules, and provide fresh insights on synaptic plasticity in spiking network models.\r\n"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"10","publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663 - 337X"]},"language":[{"iso":"eng"}],"file":[{"file_size":30599717,"date_updated":"2023-10-12T14:54:52Z","creator":"cchlebak","file_name":"Confavreux_Thesis_2A.pdf","date_created":"2023-10-12T14:53:50Z","embargo_to":"open_access","content_type":"application/pdf","relation":"main_file","access_level":"closed","embargo":"2024-10-12","file_id":"14424","checksum":"7f636555eae7803323df287672fd13ed"},{"creator":"cchlebak","file_size":68406739,"date_updated":"2023-10-18T07:56:08Z","file_name":"Confavreux Thesis.zip","date_created":"2023-10-18T07:38:34Z","relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","file_id":"14440","checksum":"725e85946db92290a4583a0de9779e1b"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"9633","relation":"part_of_dissertation"}]},"_id":"14422","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)"},"type":"dissertation","status":"public","date_updated":"2023-10-18T09:20:56Z","supervisor":[{"orcid":"0000-0003-3295-6181","full_name":"Vogels, Tim P","last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","first_name":"Tim P"}],"ddc":["610"],"department":[{"_id":"GradSch"},{"_id":"TiVo"}],"file_date_updated":"2023-10-18T07:56:08Z"},{"has_accepted_license":"1","year":"2023","day":"30","page":"206","date_published":"2023-09-30T00:00:00Z","doi":"10.15479/at:ista:14374","date_created":"2023-09-28T14:23:04Z","publisher":"Institute of Science and Technology Austria","oa":1,"citation":{"mla":"Roos, Barbara. Boundary Superconductivity in BCS Theory. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:14374.","ama":"Roos B. Boundary superconductivity in BCS theory. 2023. doi:10.15479/at:ista:14374","apa":"Roos, B. (2023). Boundary superconductivity in BCS theory. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:14374","short":"B. Roos, Boundary Superconductivity in BCS Theory, Institute of Science and Technology Austria, 2023.","ieee":"B. Roos, “Boundary superconductivity in BCS theory,” Institute of Science and Technology Austria, 2023.","chicago":"Roos, Barbara. “Boundary Superconductivity in BCS Theory.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:14374.","ista":"Roos B. 2023. Boundary superconductivity in BCS theory. Institute of Science and Technology Austria."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"id":"5DA90512-D80F-11E9-8994-2E2EE6697425","first_name":"Barbara","orcid":"0000-0002-9071-5880","full_name":"Roos, Barbara","last_name":"Roos"}],"article_processing_charge":"No","title":"Boundary superconductivity in BCS theory","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"},{"name":"Mathematical Challenges in BCS Theory of Superconductivity","grant_number":"I06427","_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b"}],"publication_identifier":{"issn":["2663 - 337X"]},"degree_awarded":"PhD","publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"ef039ffc3de2cb8dee5b14110938e9b6","file_id":"14398","date_updated":"2023-10-06T11:35:56Z","file_size":2365702,"creator":"broos","date_created":"2023-10-06T11:35:56Z","file_name":"phd-thesis-draft_pdfa_acrobat.pdf"},{"content_type":"application/x-zip-compressed","relation":"source_file","access_level":"closed","checksum":"81dcac33daeefaf0111db52f41bb1fd0","file_id":"14399","file_size":4691734,"date_updated":"2023-10-06T11:38:01Z","creator":"broos","file_name":"Version5.zip","date_created":"2023-10-06T11:38:01Z"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"13207","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"10850"}]},"ec_funded":1,"abstract":[{"lang":"eng","text":"Superconductivity has many important applications ranging from levitating trains over qubits to MRI scanners. The phenomenon is successfully modeled by Bardeen-Cooper-Schrieffer (BCS) theory. From a mathematical perspective, BCS theory has been studied extensively for systems without boundary. However, little is known in the presence of boundaries. With the help of numerical methods physicists observed that the critical temperature may increase in the presence of a boundary. The goal of this thesis is to understand the influence of boundaries on the critical temperature in BCS theory and to give a first rigorous justification of these observations. On the way, we also study two-body Schrödinger operators on domains with boundaries and prove additional results for superconductors without boundary.\r\n\r\nBCS theory is based on a non-linear functional, where the minimizer indicates whether the system is superconducting or in the normal, non-superconducting state. By considering the Hessian of the BCS functional at the normal state, one can analyze whether the normal state is possibly a minimum of the BCS functional and estimate the critical temperature. The Hessian turns out to be a linear operator resembling a Schrödinger operator for two interacting particles, but with more complicated kinetic energy. As a first step, we study the two-body Schrödinger operator in the presence of boundaries.\r\nFor Neumann boundary conditions, we prove that the addition of a boundary can create new eigenvalues, which correspond to the two particles forming a bound state close to the boundary.\r\n\r\nSecond, we need to understand superconductivity in the translation invariant setting. While in three dimensions this has been extensively studied, there is no mathematical literature for the one and two dimensional cases. In dimensions one and two, we compute the weak coupling asymptotics of the critical temperature and the energy gap in the translation invariant setting. We also prove that their ratio is independent of the microscopic details of the model in the weak coupling limit; this property is referred to as universality.\r\n\r\nIn the third part, we study the critical temperature of superconductors in the presence of boundaries. We start by considering the one-dimensional case of a half-line with contact interaction. Then, we generalize the results to generic interactions and half-spaces in one, two and three dimensions. Finally, we compare the critical temperature of a quarter space in two dimensions to the critical temperatures of a half-space and of the full space."}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"09","supervisor":[{"last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"date_updated":"2023-10-27T10:37:30Z","ddc":["515","539"],"file_date_updated":"2023-10-06T11:38:01Z","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"_id":"14374","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"},{"page":"1507–1540","date_published":"2023-05-18T00:00:00Z","doi":"10.4171/JST/439","date_created":"2023-07-10T16:35:45Z","isi":1,"has_accepted_license":"1","year":"2023","day":"18","publication":"Journal of Spectral Theory","quality_controlled":"1","publisher":"EMS Press","oa":1,"acknowledgement":"We thank Egor Babaev for encouraging us to study this problem, and Rupert Frank for many fruitful discussions. scussions. Funding. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No. 694227 (Barbara Roos and Robert Seiringer) is gratefully acknowledged.","author":[{"full_name":"Hainzl, Christian","last_name":"Hainzl","first_name":"Christian"},{"last_name":"Roos","full_name":"Roos, Barbara","orcid":"0000-0002-9071-5880","first_name":"Barbara","id":"5DA90512-D80F-11E9-8994-2E2EE6697425"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"external_id":{"isi":["000997933500008"],"arxiv":["2201.08090"]},"article_processing_charge":"No","title":"Boundary superconductivity in the BCS model","citation":{"chicago":"Hainzl, Christian, Barbara Roos, and Robert Seiringer. “Boundary Superconductivity in the BCS Model.” Journal of Spectral Theory. EMS Press, 2023. https://doi.org/10.4171/JST/439.","ista":"Hainzl C, Roos B, Seiringer R. 2023. Boundary superconductivity in the BCS model. Journal of Spectral Theory. 12(4), 1507–1540.","mla":"Hainzl, Christian, et al. “Boundary Superconductivity in the BCS Model.” Journal of Spectral Theory, vol. 12, no. 4, EMS Press, 2023, pp. 1507–1540, doi:10.4171/JST/439.","ieee":"C. Hainzl, B. Roos, and R. Seiringer, “Boundary superconductivity in the BCS model,” Journal of Spectral Theory, vol. 12, no. 4. EMS Press, pp. 1507–1540, 2023.","short":"C. Hainzl, B. Roos, R. Seiringer, Journal of Spectral Theory 12 (2023) 1507–1540.","ama":"Hainzl C, Roos B, Seiringer R. Boundary superconductivity in the BCS model. Journal of Spectral Theory. 2023;12(4):1507–1540. doi:10.4171/JST/439","apa":"Hainzl, C., Roos, B., & Seiringer, R. (2023). Boundary superconductivity in the BCS model. Journal of Spectral Theory. EMS Press. https://doi.org/10.4171/JST/439"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"14374","status":"public"}]},"volume":12,"issue":"4","ec_funded":1,"publication_identifier":{"issn":["1664-039X"],"eissn":["1664-0403"]},"publication_status":"published","file":[{"date_created":"2023-07-11T08:19:15Z","file_name":"2023_EMS_Hainzl.pdf","date_updated":"2023-07-11T08:19:15Z","file_size":304619,"creator":"alisjak","file_id":"13208","checksum":"5501da33be010b5c81440438287584d5","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"month":"05","intvolume":" 12","abstract":[{"lang":"eng","text":"We consider the linear BCS equation, determining the BCS critical temperature, in the presence of a boundary, where Dirichlet boundary conditions are imposed. In the one-dimensional case with point interactions, we prove that the critical temperature is strictly larger than the bulk value, at least at weak coupling. In particular, the Cooper-pair wave function localizes near the boundary, an effect that cannot be modeled by effective Neumann boundary conditions on the order parameter as often imposed in Ginzburg–Landau theory. We also show that the relative shift in critical temperature vanishes if the coupling constant either goes to zero or to infinity."}],"oa_version":"Published Version","file_date_updated":"2023-07-11T08:19:15Z","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"date_updated":"2023-10-27T10:37:29Z","ddc":["530"],"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","_id":"13207"},{"doi":"10.1093/genetics/iyad133","date_published":"2023-10-01T00:00:00Z","date_created":"2023-10-29T23:01:15Z","has_accepted_license":"1","year":"2023","day":"01","publication":"Genetics","quality_controlled":"1","publisher":"Oxford Academic","oa":1,"acknowledgement":"NHB was supported in part by ERC Grants 250152 and 101055327. AV was partly supported by the chaire Modélisation Mathématique et Biodiversité of Veolia Environment—Ecole Polytechnique—Museum National d’Histoire Naturelle—Fondation X.","author":[{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"first_name":"Alison M.","last_name":"Etheridge","full_name":"Etheridge, Alison M."},{"last_name":"Véber","full_name":"Véber, Amandine","first_name":"Amandine"}],"external_id":{"arxiv":["2211.03515"]},"article_processing_charge":"Yes (in subscription journal)","title":"The infinitesimal model with dominance","citation":{"ista":"Barton NH, Etheridge AM, Véber A. 2023. The infinitesimal model with dominance. Genetics. 225(2), iyad133.","chicago":"Barton, Nicholas H, Alison M. Etheridge, and Amandine Véber. “The Infinitesimal Model with Dominance.” Genetics. Oxford Academic, 2023. https://doi.org/10.1093/genetics/iyad133.","short":"N.H. Barton, A.M. Etheridge, A. Véber, Genetics 225 (2023).","ieee":"N. H. Barton, A. M. Etheridge, and A. Véber, “The infinitesimal model with dominance,” Genetics, vol. 225, no. 2. Oxford Academic, 2023.","ama":"Barton NH, Etheridge AM, Véber A. The infinitesimal model with dominance. Genetics. 2023;225(2). doi:10.1093/genetics/iyad133","apa":"Barton, N. H., Etheridge, A. M., & Véber, A. (2023). The infinitesimal model with dominance. Genetics. Oxford Academic. https://doi.org/10.1093/genetics/iyad133","mla":"Barton, Nicholas H., et al. “The Infinitesimal Model with Dominance.” Genetics, vol. 225, no. 2, iyad133, Oxford Academic, 2023, doi:10.1093/genetics/iyad133."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"},{"_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00","name":"Understanding the evolution of continuous genomes","grant_number":"101055327"}],"article_number":"iyad133","volume":225,"related_material":{"record":[{"id":"12949","status":"public","relation":"research_data"}]},"issue":"2","ec_funded":1,"publication_identifier":{"issn":["0016-6731"],"eissn":["1943-2631"]},"publication_status":"published","file":[{"checksum":"3f65b1fbe813e2f4dbb5d2b5e891844a","file_id":"14469","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-10-30T12:57:53Z","file_name":"2023_Genetics_Barton.pdf","creator":"dernst","date_updated":"2023-10-30T12:57:53Z","file_size":1439032}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"10","intvolume":" 225","abstract":[{"lang":"eng","text":"The classical infinitesimal model is a simple and robust model for the inheritance of quantitative traits. In this model, a quantitative trait is expressed as the sum of a genetic and an environmental component, and the genetic component of offspring traits within a family follows a normal distribution around the average of the parents’ trait values, and has a variance that is independent of the parental traits. In previous work, we showed that when trait values are determined by the sum of a large number of additive Mendelian factors, each of small effect, one can justify the infinitesimal model as a limit of Mendelian inheritance. In this paper, we show that this result extends to include dominance. We define the model in terms of classical quantities of quantitative genetics, before justifying it as a limit of Mendelian inheritance as the number, M, of underlying loci tends to infinity. As in the additive case, the multivariate normal distribution of trait values across the pedigree can be expressed in terms of variance components in an ancestral population and probabilities of identity by descent determined by the pedigree. Now, with just first-order dominance effects, we require two-, three-, and four-way identities. We also show that, even if we condition on parental trait values, the “shared” and “residual” components of trait values within each family will be asymptotically normally distributed as the number of loci tends to infinity, with an error of order 1/M−−√. We illustrate our results with some numerical examples."}],"oa_version":"Published Version","department":[{"_id":"NiBa"}],"file_date_updated":"2023-10-30T12:57:53Z","date_updated":"2023-10-30T13:04:11Z","ddc":["570"],"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","_id":"14452"},{"has_accepted_license":"1","year":"2023","day":"13","file":[{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"b0ce7d4b1ee7e7265430ceed36fc3336","file_id":"12950","file_size":13662,"date_updated":"2023-05-13T09:36:33Z","creator":"nbarton","file_name":"Neutral identities 16th Jan","date_created":"2023-05-13T09:36:33Z"},{"success":1,"checksum":"ad5035ad4f7d3b150a252c79884f6a83","file_id":"12951","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"p, zA, zD, N=30 neutral III","date_created":"2023-05-13T09:38:17Z","file_size":181619928,"date_updated":"2023-05-13T09:38:17Z","creator":"nbarton"},{"creator":"nbarton","date_updated":"2023-05-13T09:41:59Z","file_size":605902074,"date_created":"2023-05-13T09:41:59Z","file_name":"p, zA, zD, N=30 neutral IV","access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","file_id":"12952","checksum":"62182a1de796256edd6f4223704312ef","success":1},{"success":1,"file_id":"12953","checksum":"af775dda5c4f6859cb1e5a81ec40a667","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","file_name":"p, zA, zD, N=30 selected k=5","date_created":"2023-05-13T09:46:52Z","creator":"nbarton","file_size":1018238746,"date_updated":"2023-05-13T09:46:52Z"},{"date_created":"2023-05-13T09:42:05Z","file_name":"Pairwise F N=30 neutral II","date_updated":"2023-05-13T09:42:05Z","file_size":3197160,"creator":"nbarton","file_id":"12954","checksum":"af26f3394c387d3ada14b434cd68b1e5","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file"},{"file_name":"Pedigrees N=30 neutral II","date_created":"2023-05-13T09:42:06Z","file_size":55492,"date_updated":"2023-05-13T09:42:06Z","creator":"nbarton","success":1,"file_id":"12955","checksum":"d5da7dc0e7282dd48222e26d12e34220","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access"},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"file_id":"12956","checksum":"00f386d80677590e29f6235d49cba58d","file_size":474003467,"date_updated":"2023-05-13T09:46:06Z","creator":"nbarton","file_name":"selected reps N=30 selected k=1,2 300 reps III","date_created":"2023-05-13T09:46:06Z"},{"relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"checksum":"658cef3eaea6136a4d24da4f074191d7","file_id":"12957","creator":"nbarton","file_size":121209,"date_updated":"2023-05-13T09:46:08Z","file_name":"Algorithm for caclulating identities.nb","date_created":"2023-05-13T09:46:08Z"},{"checksum":"db9b6dddd7a596d974e25f5e78f5c45c","file_id":"12958","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","date_created":"2023-05-13T09:46:08Z","file_name":"Infinitesimal with dominance.nb","creator":"nbarton","date_updated":"2023-05-13T09:46:08Z","file_size":1803898},{"checksum":"91f80a9fb58cae8eef2d8bf59fe30189","file_id":"12967","success":1,"content_type":"text/plain","access_level":"open_access","relation":"main_file","date_created":"2023-05-16T04:09:08Z","file_name":"ReadMe.txt","date_updated":"2023-05-16T04:09:08Z","file_size":990,"creator":"nbarton"}],"related_material":{"record":[{"id":"14452","status":"public","relation":"used_in_publication"}]},"date_published":"2023-05-13T00:00:00Z","doi":"10.15479/AT:ISTA:12949","date_created":"2023-05-13T09:49:09Z","contributor":[{"first_name":"Amandine","contributor_type":"researcher","last_name":"Veber"},{"last_name":"Etheridge","first_name":"Alison","contributor_type":"researcher"}],"abstract":[{"text":"The classical infinitesimal model is a simple and robust model for the inheritance of quantitative traits. In this model, a quantitative trait is expressed as the sum of a genetic and a non-genetic (environmental) component and the genetic component of offspring traits within a family follows a normal distribution around the average of the parents’ trait values, and has a variance that is independent of the trait values of the parents. Although the trait distribution across the whole population can be far from normal, the trait distributions within families are normally distributed with a variance-covariance matrix that is determined entirely by that in the ancestral population and the probabilities of identity determined by the pedigree. Moreover, conditioning on some of the trait values within the pedigree has predictable effects on the mean and variance within and between families. In previous work, Barton et al. (2017), we showed that when trait values are determined by the sum of a large number of Mendelian factors, each of small effect, one can justify the infinitesimal model as limit of Mendelian inheritance. It was also shown that under some forms of epistasis, trait values within a family are still normally distributed.","lang":"eng"}],"oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","oa":1,"month":"05","date_updated":"2023-10-30T13:04:11Z","citation":{"ista":"Barton NH. 2023. The infinitesimal model with dominance, Institute of Science and Technology Austria, 10.15479/AT:ISTA:12949.","chicago":"Barton, Nicholas H. “The Infinitesimal Model with Dominance.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:12949.","ama":"Barton NH. The infinitesimal model with dominance. 2023. doi:10.15479/AT:ISTA:12949","apa":"Barton, N. H. (2023). The infinitesimal model with dominance. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12949","short":"N.H. Barton, (2023).","ieee":"N. H. Barton, “The infinitesimal model with dominance.” Institute of Science and Technology Austria, 2023.","mla":"Barton, Nicholas H. The Infinitesimal Model with Dominance. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12949."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["576"],"author":[{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"article_processing_charge":"No","title":"The infinitesimal model with dominance","file_date_updated":"2023-05-16T04:09:08Z","department":[{"_id":"NiBa"}],"_id":"12949","type":"research_data","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)"},"project":[{"_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00","grant_number":"101055327","name":"Understanding the evolution of continuous genomes"}],"status":"public","keyword":["Quantitative genetics","infinitesimal model"]},{"publication_identifier":{"eissn":["2640-3498"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":202,"ec_funded":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"text":"Communication-reduction techniques are a popular way to improve scalability in data-parallel training of deep neural networks (DNNs). The recent emergence of large language models such as GPT has created the need for new approaches to exploit data-parallelism. Among these, fully-sharded data parallel (FSDP) training is highly popular, yet it still encounters scalability bottlenecks. One reason is that applying compression techniques to FSDP is challenging: as the vast majority of the communication involves the model’s weights, direct compression alters convergence and leads to accuracy loss. We present QSDP, a variant of FSDP which supports both gradient and weight quantization with theoretical guarantees, is simple to implement and has essentially no overheads. To derive QSDP we prove that a natural modification of SGD achieves convergence even when we only maintain quantized weights, and thus the domain over which we train consists of quantized points and is, therefore, highly non-convex. We validate this approach by training GPT-family models with up to 1.3 billion parameters on a multi-node cluster. Experiments show that QSDP preserves model accuracy, while completely removing the communication bottlenecks of FSDP, providing end-to-end speedups of up to 2.2x.","lang":"eng"}],"oa_version":"Preprint","alternative_title":["PMLR"],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2302.02390"}],"month":"07","intvolume":" 202","date_updated":"2023-10-31T09:40:45Z","department":[{"_id":"DaAl"}],"_id":"14461","type":"conference","conference":{"location":"Honolulu, Hawaii, HI, United States","end_date":"2023-07-29","start_date":"2023-07-23","name":"ICML: International Conference on Machine Learning"},"status":"public","year":"2023","day":"30","publication":"Proceedings of the 40th International Conference on Machine Learning","page":"24020-24044","date_published":"2023-07-30T00:00:00Z","date_created":"2023-10-29T23:01:17Z","acknowledgement":"The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), as well as experimental support from the IST Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and Alois Schloegl. AV acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT), the support of Fondation Hadamard with a PRMO grant, and the support of CNRS with a CoopIntEER IEA grant (project ALFRED).","publisher":"ML Research Press","quality_controlled":"1","oa":1,"citation":{"chicago":"Markov, Ilia, Adrian Vladu, Qi Guo, and Dan-Adrian Alistarh. “Quantized Distributed Training of Large Models with Convergence Guarantees.” In Proceedings of the 40th International Conference on Machine Learning, 202:24020–44. ML Research Press, 2023.","ista":"Markov I, Vladu A, Guo Q, Alistarh D-A. 2023. Quantized distributed training of large models with convergence guarantees. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 24020–24044.","mla":"Markov, Ilia, et al. “Quantized Distributed Training of Large Models with Convergence Guarantees.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 24020–44.","short":"I. Markov, A. Vladu, Q. Guo, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 24020–24044.","ieee":"I. Markov, A. Vladu, Q. Guo, and D.-A. Alistarh, “Quantized distributed training of large models with convergence guarantees,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 24020–24044.","ama":"Markov I, Vladu A, Guo Q, Alistarh D-A. Quantized distributed training of large models with convergence guarantees. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:24020-24044.","apa":"Markov, I., Vladu, A., Guo, Q., & Alistarh, D.-A. (2023). Quantized distributed training of large models with convergence guarantees. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 24020–24044). Honolulu, Hawaii, HI, United States: ML Research Press."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Markov","full_name":"Markov, Ilia","first_name":"Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"last_name":"Vladu","full_name":"Vladu, Adrian","first_name":"Adrian"},{"last_name":"Guo","full_name":"Guo, Qi","first_name":"Qi"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"arxiv":["2302.02390"]},"title":"Quantized distributed training of large models with convergence guarantees","project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}]},{"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":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422","name":"Wittgenstein Award - Monika Henzinger"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775 ","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"author":[{"first_name":"Hendrik","last_name":"Fichtenberger","full_name":"Fichtenberger, Hendrik"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Jalaj","last_name":"Upadhyay","full_name":"Upadhyay, Jalaj"}],"article_processing_charge":"No","title":"Constant matters: Fine-grained error bound on differentially private continual observation","citation":{"ama":"Fichtenberger H, Henzinger MH, Upadhyay J. Constant matters: Fine-grained error bound on differentially private continual observation. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:10072-10092.","apa":"Fichtenberger, H., Henzinger, M. H., & Upadhyay, J. (2023). Constant matters: Fine-grained error bound on differentially private continual observation. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092). Honolulu, Hawaii, HI, United States: ML Research Press.","short":"H. Fichtenberger, M.H. Henzinger, J. Upadhyay, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092.","ieee":"H. Fichtenberger, M. H. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained error bound on differentially private continual observation,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10072–10092.","mla":"Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10072–92.","ista":"Fichtenberger H, Henzinger MH, Upadhyay J. 2023. Constant matters: Fine-grained error bound on differentially private continual observation. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 10072–10092.","chicago":"Fichtenberger, Hendrik, Monika H Henzinger, and Jalaj Upadhyay. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” In Proceedings of the 40th International Conference on Machine Learning, 202:10072–92. ML Research Press, 2023."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ML Research Press","quality_controlled":"1","oa":1,"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 Austrian Science Fund (FWF) project Z 422-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. 2020–2024. JU’s research was funded by Decanal Research Grant. A part of this work was done when JU was visiting Indian Statistical Institute, Delhi. The authors would like to thank Rajat Bhatia, Aleksandar Nikolov, Shanta Laisharam, Vern Paulsen, Ryan Rogers, Abhradeep Thakurta, and Sarvagya Upadhyay for useful discussions.","page":"10072-10092","date_published":"2023-07-30T00:00:00Z","date_created":"2023-10-29T23:01:17Z","year":"2023","day":"30","publication":"Proceedings of the 40th International Conference on Machine Learning","type":"conference","conference":{"location":"Honolulu, Hawaii, HI, United States","end_date":"2023-07-29","start_date":"2023-07-23","name":"ICML: International Conference on Machine Learning"},"status":"public","_id":"14462","department":[{"_id":"MoHe"}],"date_updated":"2023-10-31T09:54:05Z","alternative_title":["PMLR"],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf"}],"month":"07","intvolume":" 202","abstract":[{"lang":"eng","text":"We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation model. More specifically, we give an explicit factorization for the counting matrix Mcount and upper bound the error explicitly. We also give a fine-grained analysis, specifying the exact constant in the upper bound. Our analysis is based on upper and lower bounds of the completely bounded norm (cb-norm) of Mcount\r\n. Along the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large range of the dimension of Mcount. Furthermore, we are the first to give concrete error bounds for various problems under continual observation such as binary counting, maintaining a histogram, releasing an approximately cut-preserving synthetic graph, many graph-based statistics, and substring and episode counting. Finally, we note that our result can be used to get a fine-grained error bound for non-interactive local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private counting under continual observation. Subsequent to this work, Henzinger et al. (SODA, 2023) showed that our factorization also achieves fine-grained mean-squared error."}],"oa_version":"Published Version","volume":202,"ec_funded":1,"publication_identifier":{"eissn":["2640-3498"]},"publication_status":"published","language":[{"iso":"eng"}]},{"title":"Fundamental limits of two-layer autoencoders, and achieving them with gradient methods","external_id":{"arxiv":["2212.13468"]},"article_processing_charge":"No","author":[{"first_name":"Aleksandr","id":"F2B06EC2-C99E-11E9-89F0-752EE6697425","last_name":"Shevchenko","full_name":"Shevchenko, Aleksandr"},{"last_name":"Kögler","full_name":"Kögler, Kevin","first_name":"Kevin","id":"94ec913c-dc85-11ea-9058-e5051ab2428b"},{"first_name":"Hamed","last_name":"Hassani","full_name":"Hassani, Hamed"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","last_name":"Mondelli"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Shevchenko, A., Kögler, K., Hassani, H., & Mondelli, M. (2023). Fundamental limits of two-layer autoencoders, and achieving them with gradient methods. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 31151–31209). Honolulu, Hawaii, HI, United States: ML Research Press.","ama":"Shevchenko A, Kögler K, Hassani H, Mondelli M. Fundamental limits of two-layer autoencoders, and achieving them with gradient methods. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:31151-31209.","short":"A. Shevchenko, K. Kögler, H. Hassani, M. Mondelli, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 31151–31209.","ieee":"A. Shevchenko, K. Kögler, H. Hassani, and M. Mondelli, “Fundamental limits of two-layer autoencoders, and achieving them with gradient methods,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 31151–31209.","mla":"Shevchenko, Aleksandr, et al. “Fundamental Limits of Two-Layer Autoencoders, and Achieving Them with Gradient Methods.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 31151–209.","ista":"Shevchenko A, Kögler K, Hassani H, Mondelli M. 2023. Fundamental limits of two-layer autoencoders, and achieving them with gradient methods. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 31151–31209.","chicago":"Shevchenko, Aleksandr, Kevin Kögler, Hamed Hassani, and Marco Mondelli. “Fundamental Limits of Two-Layer Autoencoders, and Achieving Them with Gradient Methods.” In Proceedings of the 40th International Conference on Machine Learning, 202:31151–209. ML Research Press, 2023."},"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"date_created":"2023-10-29T23:01:17Z","date_published":"2023-07-30T00:00:00Z","page":"31151-31209","publication":"Proceedings of the 40th International Conference on Machine Learning","day":"30","year":"2023","oa":1,"publisher":"ML Research Press","quality_controlled":"1","acknowledgement":"Aleksandr Shevchenko, Kevin Kogler and Marco Mondelli are supported by the 2019 Lopez-Loreta Prize. Hamed Hassani acknowledges the support by the NSF CIF award (1910056) and the NSF Institute for CORE Emerging Methods in Data Science (EnCORE).","department":[{"_id":"MaMo"},{"_id":"DaAl"}],"date_updated":"2023-10-31T08:52:28Z","status":"public","conference":{"name":"ICML: International Conference on Machine Learning","start_date":"2023-07-23","location":"Honolulu, Hawaii, HI, United States","end_date":"2023-07-29"},"type":"conference","_id":"14459","volume":202,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2640-3498"]},"intvolume":" 202","month":"07","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.13468","open_access":"1"}],"alternative_title":["PMLR"],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"Autoencoders are a popular model in many branches of machine learning and lossy data compression. However, their fundamental limits, the performance of gradient methods and the features learnt during optimization remain poorly understood, even in the two-layer setting. In fact, earlier work has considered either linear autoencoders or specific training regimes (leading to vanishing or diverging compression rates). Our paper addresses this gap by focusing on non-linear two-layer autoencoders trained in the challenging proportional regime in which the input dimension scales linearly with the size of the representation. Our results characterize the minimizers of the population risk, and show that such minimizers are achieved by gradient methods; their structure is also unveiled, thus leading to a concise description of the features obtained via training. For the special case of a sign activation function, our analysis establishes the fundamental limits for the lossy compression of Gaussian sources via (shallow) autoencoders. Finally, while the results are proved for Gaussian data, numerical simulations on standard datasets display the universality of the theoretical predictions.","lang":"eng"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” In Proceedings of the 40th International Conference on Machine Learning, 202:26215–27. ML Research Press, 2023.","ista":"Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. 2023. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 26215–26227.","mla":"Nikdan, Mahdi, et al. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 26215–27.","apa":"Nikdan, M., Pegolotti, T., Iofinova, E. B., Kurtic, E., & Alistarh, D.-A. (2023). SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 26215–26227). Honolulu, Hawaii, HI, United States: ML Research Press.","ama":"Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:26215-26227.","ieee":"M. Nikdan, T. Pegolotti, E. B. Iofinova, E. Kurtic, and D.-A. Alistarh, “SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 26215–26227.","short":"M. Nikdan, T. Pegolotti, E.B. Iofinova, E. Kurtic, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 26215–26227."},"title":"SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge","author":[{"first_name":"Mahdi","id":"66374281-f394-11eb-9cf6-869147deecc0","last_name":"Nikdan","full_name":"Nikdan, Mahdi"},{"first_name":"Tommaso","full_name":"Pegolotti, Tommaso","last_name":"Pegolotti"},{"last_name":"Iofinova","orcid":"0000-0002-7778-3221","full_name":"Iofinova, Eugenia B","first_name":"Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117"},{"full_name":"Kurtic, Eldar","last_name":"Kurtic","first_name":"Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"arxiv":["2302.04852"]},"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}],"day":"30","publication":"Proceedings of the 40th International Conference on Machine Learning","year":"2023","date_published":"2023-07-30T00:00:00Z","date_created":"2023-10-29T23:01:17Z","page":"26215-26227","acknowledgement":"We would like to thank Elias Frantar for his valuable assistance and support at the outset of this project, and the anonymous ICML and SNN reviewers for very constructive feedback. EI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. DA acknowledges generous ERC support, via Starting Grant 805223 ScaleML. ","quality_controlled":"1","publisher":"ML Research Press","oa":1,"date_updated":"2023-10-31T09:33:51Z","department":[{"_id":"DaAl"}],"_id":"14460","status":"public","type":"conference","conference":{"name":"ICML: International Conference on Machine Learning","start_date":"2023-07-23","end_date":"2023-07-29","location":"Honolulu, Hawaii, HI, United States"},"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2640-3498"]},"publication_status":"published","volume":202,"ec_funded":1,"oa_version":"Preprint","abstract":[{"text":"We provide an efficient implementation of the backpropagation algorithm, specialized to the case where the weights of the neural network being trained are sparse. Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and common layer types (e.g., convolutional or linear). We provide a fast vectorized implementation on commodity CPUs, and show that it can yield speedups in end-to-end runtime experiments, both in transfer learning using already-sparsified networks, and in training sparse networks from scratch. Thus, our results provide the first support for sparse training on commodity hardware.","lang":"eng"}],"month":"07","intvolume":" 202","alternative_title":["PMLR"],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.04852","open_access":"1"}]},{"year":"2023","day":"01","publication":"8th International Conference on Cryptology and Information Security in Latin America","page":"215-228","doi":"10.1007/978-3-031-44469-2_11","date_published":"2023-10-01T00:00:00Z","date_created":"2023-10-29T23:01:16Z","quality_controlled":"1","publisher":"Springer Nature","oa":1,"citation":{"ama":"Hoffmann C, Simkin M. Stronger lower bounds for leakage-resilient secret sharing. In: 8th International Conference on Cryptology and Information Security in Latin America. Vol 14168. Springer Nature; 2023:215-228. doi:10.1007/978-3-031-44469-2_11","apa":"Hoffmann, C., & Simkin, M. (2023). Stronger lower bounds for leakage-resilient secret sharing. In 8th International Conference on Cryptology and Information Security in Latin America (Vol. 14168, pp. 215–228). Quito, Ecuador: Springer Nature. https://doi.org/10.1007/978-3-031-44469-2_11","short":"C. Hoffmann, M. Simkin, in:, 8th International Conference on Cryptology and Information Security in Latin America, Springer Nature, 2023, pp. 215–228.","ieee":"C. Hoffmann and M. Simkin, “Stronger lower bounds for leakage-resilient secret sharing,” in 8th International Conference on Cryptology and Information Security in Latin America, Quito, Ecuador, 2023, vol. 14168, pp. 215–228.","mla":"Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient Secret Sharing.” 8th International Conference on Cryptology and Information Security in Latin America, vol. 14168, Springer Nature, 2023, pp. 215–28, doi:10.1007/978-3-031-44469-2_11.","ista":"Hoffmann C, Simkin M. 2023. Stronger lower bounds for leakage-resilient secret sharing. 8th International Conference on Cryptology and Information Security in Latin America. LATINCRYPT: Conference on Cryptology and Information Security in Latin America, LNCS, vol. 14168, 215–228.","chicago":"Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient Secret Sharing.” In 8th International Conference on Cryptology and Information Security in Latin America, 14168:215–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44469-2_11."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Hoffmann","full_name":"Hoffmann, Charlotte","orcid":"0000-0003-2027-5549","first_name":"Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7"},{"first_name":"Mark","full_name":"Simkin, Mark","last_name":"Simkin"}],"article_processing_charge":"No","title":"Stronger lower bounds for leakage-resilient secret sharing","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031444685"],"issn":["0302-9743"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":14168,"abstract":[{"text":"Threshold secret sharing allows a dealer to split a secret s into n shares, such that any t shares allow for reconstructing s, but no t-1 shares reveal any information about s. Leakage-resilient secret sharing requires that the secret remains hidden, even when an adversary additionally obtains a limited amount of leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n and conjectured that the same holds for t = c.n for any constant 0≤c≤1. Nielsen and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n).\r\nIn this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy leakage-resilience, where a random subset of leakages is replaced by uniformly random noise. We prove a lower bound for Shamir’s secret sharing, similar to that of Nielsen and Simkin, which holds even when a constant fraction of leakages is replaced by random noise. To this end, we first prove a lower bound on the share size of any noisy-leakage-resilient sharing scheme. We then use this lower bound to show that there exist universal constants c1, c2, such that for sufficiently large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random noise.\r\n\r\n\r\n\r\n","lang":"eng"}],"oa_version":"Preprint","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2023/1017","open_access":"1"}],"month":"10","intvolume":" 14168","date_updated":"2023-10-31T11:43:12Z","department":[{"_id":"KrPi"}],"_id":"14457","type":"conference","conference":{"name":"LATINCRYPT: Conference on Cryptology and Information Security in Latin America","start_date":"2023-10-03","location":"Quito, Ecuador","end_date":"2023-10-06"},"status":"public"},{"date_updated":"2023-10-31T09:59:42Z","department":[{"_id":"DaAl"}],"_id":"14458","status":"public","conference":{"name":"ICML: International Conference on Machine Learning","location":"Honolulu, Hawaii, HI, United States","end_date":"2023-07-29","start_date":"2023-07-23"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2640-3498"]},"ec_funded":1,"volume":202,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We show for the first time that large-scale generative pretrained transformer (GPT) family models can be pruned to at least 50% sparsity in one-shot, without any retraining, at minimal loss of accuracy. This is achieved via a new pruning method called SparseGPT, specifically designed to work efficiently and accurately on massive GPT-family models. We can execute SparseGPT on the largest available open-source models, OPT-175B and BLOOM-176B, in under 4.5 hours, and can reach 60% unstructured sparsity with negligible increase in perplexity: remarkably, more than 100 billion weights from these models can be ignored at inference time. SparseGPT generalizes to semi-structured (2:4 and 4:8) patterns, and is compatible with weight quantization approaches. The code is available at: https://github.com/IST-DASLab/sparsegpt."}],"acknowledged_ssus":[{"_id":"ScienComp"}],"intvolume":" 202","month":"07","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2301.00774"}],"alternative_title":["PMLR"],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10323–37.","apa":"Frantar, E., & Alistarh, D.-A. (2023). SparseGPT: Massive language models can be accurately pruned in one-shot. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10323–10337). Honolulu, Hawaii, HI, United States: ML Research Press.","ama":"Frantar E, Alistarh D-A. SparseGPT: Massive language models can be accurately pruned in one-shot. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:10323-10337.","ieee":"E. Frantar and D.-A. Alistarh, “SparseGPT: Massive language models can be accurately pruned in one-shot,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10323–10337.","short":"E. Frantar, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10323–10337.","chicago":"Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” In Proceedings of the 40th International Conference on Machine Learning, 202:10323–37. ML Research Press, 2023.","ista":"Frantar E, Alistarh D-A. 2023. SparseGPT: Massive language models can be accurately pruned in one-shot. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 10323–10337."},"title":"SparseGPT: Massive language models can be accurately pruned in one-shot","external_id":{"arxiv":["2301.00774"]},"article_processing_charge":"No","author":[{"last_name":"Frantar","full_name":"Frantar, Elias","first_name":"Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}],"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"publication":"Proceedings of the 40th International Conference on Machine Learning","day":"30","year":"2023","date_created":"2023-10-29T23:01:16Z","date_published":"2023-07-30T00:00:00Z","page":"10323-10337","acknowledgement":"The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 programme (grant agreement No. 805223 ScaleML), as well as experimental support from Eldar Kurtic, and from the IST Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and Alois Schloegl.","oa":1,"quality_controlled":"1","publisher":"ML Research Press"},{"author":[{"full_name":"Cornalba, Federico","orcid":"0000-0002-6269-5149","last_name":"Cornalba","id":"2CEB641C-A400-11E9-A717-D712E6697425","first_name":"Federico"},{"last_name":"Disselkamp","full_name":"Disselkamp, Constantin","first_name":"Constantin"},{"last_name":"Scassola","full_name":"Scassola, Davide","first_name":"Davide"},{"first_name":"Christopher","last_name":"Helf","full_name":"Helf, Christopher"}],"external_id":{"arxiv":["2203.04579"]},"article_processing_charge":"Yes (via OA deal)","title":"Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading","citation":{"chicago":"Cornalba, Federico, Constantin Disselkamp, Davide Scassola, and Christopher Helf. “Multi-Objective Reward Generalization: Improving Performance of Deep Reinforcement Learning for Applications in Single-Asset Trading.” Neural Computing and Applications. Springer Nature, 2023. https://doi.org/10.1007/s00521-023-09033-7.","ista":"Cornalba F, Disselkamp C, Scassola D, Helf C. 2023. Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading. Neural Computing and Applications.","mla":"Cornalba, Federico, et al. “Multi-Objective Reward Generalization: Improving Performance of Deep Reinforcement Learning for Applications in Single-Asset Trading.” Neural Computing and Applications, Springer Nature, 2023, doi:10.1007/s00521-023-09033-7.","ieee":"F. Cornalba, C. Disselkamp, D. Scassola, and C. Helf, “Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading,” Neural Computing and Applications. Springer Nature, 2023.","short":"F. Cornalba, C. Disselkamp, D. Scassola, C. Helf, Neural Computing and Applications (2023).","ama":"Cornalba F, Disselkamp C, Scassola D, Helf C. Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading. Neural Computing and Applications. 2023. doi:10.1007/s00521-023-09033-7","apa":"Cornalba, F., Disselkamp, C., Scassola, D., & Helf, C. (2023). Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading. Neural Computing and Applications. Springer Nature. https://doi.org/10.1007/s00521-023-09033-7"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"doi":"10.1007/s00521-023-09033-7","date_published":"2023-10-05T00:00:00Z","date_created":"2023-10-22T22:01:16Z","year":"2023","day":"05","publication":"Neural Computing and Applications","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"Open access funding provided by Università degli Studi di Trieste within the CRUI-CARE Agreement. Funding was provided by Austrian Science Fund (Grant No. F65), Horizon 2020 (Grant No. 754411) and Österreichische Forschungsförderungsgesellschaft.","department":[{"_id":"JuFi"}],"date_updated":"2023-10-31T10:58:28Z","article_type":"original","type":"journal_article","status":"public","_id":"14451","ec_funded":1,"publication_identifier":{"eissn":["1433-3058"],"issn":["0941-0643"]},"publication_status":"epub_ahead","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00521-023-09033-7"}],"month":"10","abstract":[{"text":"We investigate the potential of Multi-Objective, Deep Reinforcement Learning for stock and cryptocurrency single-asset trading: in particular, we consider a Multi-Objective algorithm which generalizes the reward functions and discount factor (i.e., these components are not specified a priori, but incorporated in the learning process). Firstly, using several important assets (BTCUSD, ETHUSDT, XRPUSDT, AAPL, SPY, NIFTY50), we verify the reward generalization property of the proposed Multi-Objective algorithm, and provide preliminary statistical evidence showing increased predictive stability over the corresponding Single-Objective strategy. Secondly, we show that the Multi-Objective algorithm has a clear edge over the corresponding Single-Objective strategy when the reward mechanism is sparse (i.e., when non-null feedback is infrequent over time). Finally, we discuss the generalization properties with respect to the discount factor. The entirety of our code is provided in open-source format.","lang":"eng"}],"oa_version":"Published Version"},{"article_number":"95","title":"Mixtures of self-propelled particles interacting with asymmetric obstacles","article_processing_charge":"No","external_id":{"pmid":["37819444"]},"author":[{"id":"441e7207-f91f-11ec-b67c-9e6fe3d8fd6d","first_name":"Mauricio Nicolas","last_name":"Rojas Vega","full_name":"Rojas Vega, Mauricio Nicolas"},{"first_name":"Pablo","last_name":"De Castro","full_name":"De Castro, Pablo"},{"first_name":"Rodrigo","last_name":"Soto","full_name":"Soto, Rodrigo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Rojas Vega, Mauricio Nicolas, Pablo De Castro, and Rodrigo Soto. “Mixtures of Self-Propelled Particles Interacting with Asymmetric Obstacles.” The European Physical Journal E. Springer Nature, 2023. https://doi.org/10.1140/epje/s10189-023-00354-y.","ista":"Rojas Vega MN, De Castro P, Soto R. 2023. Mixtures of self-propelled particles interacting with asymmetric obstacles. The European Physical Journal E. 46(10), 95.","mla":"Rojas Vega, Mauricio Nicolas, et al. “Mixtures of Self-Propelled Particles Interacting with Asymmetric Obstacles.” The European Physical Journal E, vol. 46, no. 10, 95, Springer Nature, 2023, doi:10.1140/epje/s10189-023-00354-y.","ieee":"M. N. Rojas Vega, P. De Castro, and R. Soto, “Mixtures of self-propelled particles interacting with asymmetric obstacles,” The European Physical Journal E, vol. 46, no. 10. Springer Nature, 2023.","short":"M.N. Rojas Vega, P. De Castro, R. Soto, The European Physical Journal E 46 (2023).","apa":"Rojas Vega, M. N., De Castro, P., & Soto, R. (2023). Mixtures of self-propelled particles interacting with asymmetric obstacles. The European Physical Journal E. Springer Nature. https://doi.org/10.1140/epje/s10189-023-00354-y","ama":"Rojas Vega MN, De Castro P, Soto R. Mixtures of self-propelled particles interacting with asymmetric obstacles. The European Physical Journal E. 2023;46(10). doi:10.1140/epje/s10189-023-00354-y"},"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"MR-V and RS are supported by Fondecyt Grant No. 1220536 and Millennium Science Initiative Program NCN19_170D of ANID, Chile. P.d.C. was supported by Scholarships Nos. 2021/10139-2 and 2022/13872-5 and ICTP-SAIFR Grant No. 2021/14335-0, all granted by São Paulo Research Foundation (FAPESP), Brazil.","date_created":"2023-10-22T22:01:13Z","doi":"10.1140/epje/s10189-023-00354-y","date_published":"2023-10-01T00:00:00Z","publication":"The European Physical Journal E","day":"01","year":"2023","status":"public","type":"journal_article","article_type":"original","_id":"14442","department":[{"_id":"AnSa"}],"date_updated":"2023-10-31T11:16:41Z","intvolume":" 46","month":"10","scopus_import":"1","oa_version":"None","pmid":1,"abstract":[{"text":"In the presence of an obstacle, active particles condensate into a surface “wetting” layer due to persistent motion. If the obstacle is asymmetric, a rectification current arises in addition to wetting. Asymmetric geometries are therefore commonly used to concentrate microorganisms like bacteria and sperms. However, most studies neglect the fact that biological active matter is diverse, composed of individuals with distinct self-propulsions. Using simulations, we study a mixture of “fast” and “slow” active Brownian disks in two dimensions interacting with large half-disk obstacles. With this prototypical obstacle geometry, we analyze how the stationary collective behavior depends on the degree of self-propulsion “diversity,” defined as proportional to the difference between the self-propulsion speeds, while keeping the average self-propulsion speed fixed. A wetting layer rich in fast particles arises. The rectification current is amplified by speed diversity due to a superlinear dependence of rectification on self-propulsion speed, which arises from cooperative effects. Thus, the total rectification current cannot be obtained from an effective one-component active fluid with the same average self-propulsion speed, highlighting the importance of considering diversity in active matter.","lang":"eng"}],"volume":46,"issue":"10","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1292-8941"],"eissn":["1292-895X"]}},{"oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-1745302. Sah was supported by the PD Soros Fellowship. Simkin was supported by the Center of Mathematical Sciences and Applications at Harvard University.","page":"363-416","date_created":"2023-10-22T22:01:14Z","doi":"10.1007/s11856-023-2513-9","date_published":"2023-09-01T00:00:00Z","year":"2023","publication":"Israel Journal of Mathematics","day":"01","external_id":{"arxiv":["2202.05088"]},"article_processing_charge":"Yes (in subscription journal)","author":[{"last_name":"Kwan","full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"first_name":"Ashwin","last_name":"Sah","full_name":"Sah, Ashwin"},{"full_name":"Sawhney, Mehtaab","last_name":"Sawhney","first_name":"Mehtaab"},{"first_name":"Michael","last_name":"Simkin","full_name":"Simkin, Michael"}],"title":"Substructures in Latin squares","citation":{"chicago":"Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “Substructures in Latin Squares.” Israel Journal of Mathematics. Springer Nature, 2023. https://doi.org/10.1007/s11856-023-2513-9.","ista":"Kwan MA, Sah A, Sawhney M, Simkin M. 2023. Substructures in Latin squares. Israel Journal of Mathematics. 256(2), 363–416.","mla":"Kwan, Matthew Alan, et al. “Substructures in Latin Squares.” Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 363–416, doi:10.1007/s11856-023-2513-9.","apa":"Kwan, M. A., Sah, A., Sawhney, M., & Simkin, M. (2023). Substructures in Latin squares. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-023-2513-9","ama":"Kwan MA, Sah A, Sawhney M, Simkin M. Substructures in Latin squares. Israel Journal of Mathematics. 2023;256(2):363-416. doi:10.1007/s11856-023-2513-9","short":"M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Israel Journal of Mathematics 256 (2023) 363–416.","ieee":"M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “Substructures in Latin squares,” Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 363–416, 2023."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2202.05088","open_access":"1"}],"scopus_import":"1","intvolume":" 256","month":"09","abstract":[{"lang":"eng","text":"We prove several results about substructures in Latin squares. First, we explain how to adapt our recent work on high-girth Steiner triple systems to the setting of Latin squares, resolving a conjecture of Linial that there exist Latin squares with arbitrarily high girth. As a consequence, we see that the number of order- n Latin squares with no intercalate (i.e., no 2×2 Latin subsquare) is at least (e−9/4n−o(n))n2. Equivalently, P[N=0]≥e−n2/4−o(n2)=e−(1+o(1))EN\r\n , where N is the number of intercalates in a uniformly random order- n Latin square. \r\nIn fact, extending recent work of Kwan, Sah, and Sawhney, we resolve the general large-deviation problem for intercalates in random Latin squares, up to constant factors in the exponent: for any constant 0<δ≤1 we have P[N≤(1−δ)EN]=exp(−Θ(n2)) and for any constant δ>0 we have P[N≥(1+δ)EN]=exp(−Θ(n4/3logn)). \r\nFinally, as an application of some new general tools for studying substructures in random Latin squares, we show that in almost all order- n Latin squares, the number of cuboctahedra (i.e., the number of pairs of possibly degenerate 2×2 submatrices with the same arrangement of symbols) is of order n4, which is the minimum possible. As observed by Gowers and Long, this number can be interpreted as measuring ``how associative'' the quasigroup associated with the Latin square is."}],"oa_version":"Preprint","volume":256,"issue":"2","publication_status":"published","publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","status":"public","_id":"14444","department":[{"_id":"MaKw"}],"date_updated":"2023-10-31T11:27:30Z"},{"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031442667"],"issn":["0302-9743"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":14245,"ec_funded":1,"abstract":[{"lang":"eng","text":"As AI and machine-learned software are used increasingly for making decisions that affect humans, it is imperative that they remain fair and unbiased in their decisions. To complement design-time bias mitigation measures, runtime verification techniques have been introduced recently to monitor the algorithmic fairness of deployed systems. Previous monitoring techniques assume full observability of the states of the (unknown) monitored system. Moreover, they can monitor only fairness properties that are specified as arithmetic expressions over the probabilities of different events. In this work, we extend fairness monitoring to systems modeled as partially observed Markov chains (POMC), and to specifications containing arithmetic expressions over the expected values of numerical functions on event sequences. The only assumptions we make are that the underlying POMC is aperiodic and starts in the stationary distribution, with a bound on its mixing time being known. These assumptions enable us to estimate a given property for the entire distribution of possible executions of the monitored POMC, by observing only a single execution. Our monitors observe a long run of the system and, after each new observation, output updated PAC-estimates of how fair or biased the system is. The monitors are computationally lightweight and, using a prototype implementation, we demonstrate their effectiveness on several real-world examples."}],"oa_version":"Preprint","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2308.00341"}],"month":"10","intvolume":" 14245","date_updated":"2023-10-31T11:48:20Z","department":[{"_id":"ToHe"}],"_id":"14454","type":"conference","conference":{"start_date":"2023-10-03","location":"Thessaloniki, Greece","end_date":"2023-10-06","name":"RV: Conference on Runtime Verification"},"status":"public","year":"2023","day":"01","publication":"23rd International Conference on Runtime Verification","page":"291-311","doi":"10.1007/978-3-031-44267-4_15","date_published":"2023-10-01T00:00:00Z","date_created":"2023-10-29T23:01:15Z","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","publisher":"Springer Nature","quality_controlled":"1","oa":1,"citation":{"mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness under Partial Observations.” 23rd International Conference on Runtime Verification, vol. 14245, Springer Nature, 2023, pp. 291–311, doi:10.1007/978-3-031-44267-4_15.","short":"T.A. Henzinger, K. Kueffner, K. Mallik, in:, 23rd International Conference on Runtime Verification, Springer Nature, 2023, pp. 291–311.","ieee":"T. A. Henzinger, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness under partial observations,” in 23rd International Conference on Runtime Verification, Thessaloniki, Greece, 2023, vol. 14245, pp. 291–311.","ama":"Henzinger TA, Kueffner K, Mallik K. Monitoring algorithmic fairness under partial observations. In: 23rd International Conference on Runtime Verification. Vol 14245. Springer Nature; 2023:291-311. doi:10.1007/978-3-031-44267-4_15","apa":"Henzinger, T. A., Kueffner, K., & Mallik, K. (2023). Monitoring algorithmic fairness under partial observations. In 23rd International Conference on Runtime Verification (Vol. 14245, pp. 291–311). Thessaloniki, Greece: Springer Nature. https://doi.org/10.1007/978-3-031-44267-4_15","chicago":"Henzinger, Thomas A, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness under Partial Observations.” In 23rd International Conference on Runtime Verification, 14245:291–311. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44267-4_15.","ista":"Henzinger TA, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness under partial observations. 23rd International Conference on Runtime Verification. RV: Conference on Runtime Verification, LNCS, vol. 14245, 291–311."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542","last_name":"Kueffner"},{"first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik"}],"external_id":{"arxiv":["2308.00341"]},"article_processing_charge":"No","title":"Monitoring algorithmic fairness under partial observations","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}]}]