[{"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 0Probability Theory and Related Fields. Springer Nature, 2023. https://doi.org/10.1007/s00440-023-01229-1.","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","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.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability Theory and Related Fields (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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio","full_name":"Cipolloni, Giorgio","orcid":"0000-0002-4901-7992","last_name":"Cipolloni"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"last_name":"Schröder","orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J"}],"article_processing_charge":"No","external_id":{"arxiv":["2210.12060"]},"title":"Mesoscopic central limit theorem for non-Hermitian random matrices","department":[{"_id":"LaEr"}]},{"file_date_updated":"2023-10-09T09:19:11Z","department":[{"_id":"KrCh"}],"ddc":["000"],"date_updated":"2023-10-09T09:22:37Z","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","_id":"14417","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"volume":272,"language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2023-10-09T09:19:11Z","file_size":826843,"date_created":"2023-10-09T09:19:11Z","file_name":"2023_LIPIcsMFCS_Baier.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"402281b17ed669bbf149d0fdf68ac201","file_id":"14418","success":1}],"publication_status":"published","publication_identifier":{"isbn":["9783959772921"],"eissn":["1868-8969"]},"intvolume":" 272","month":"08","alternative_title":["LIPIcs"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"title":"Entropic risk for turn-based stochastic games","article_processing_charge":"Yes","external_id":{"arxiv":["2307.06611"]},"author":[{"last_name":"Baier","full_name":"Baier, Christel","first_name":"Christel"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias"},{"first_name":"Jakob","last_name":"Piribauer","full_name":"Piribauer, Jakob"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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","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.","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."},"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"article_number":"15","date_created":"2023-10-09T09:21:05Z","doi":"10.4230/LIPIcs.MFCS.2023.15","date_published":"2023-08-21T00:00:00Z","publication":"48th International Symposium on Mathematical Foundations of Computer Science","day":"21","year":"2023","has_accepted_license":"1","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","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_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"}],"month":"04","intvolume":" 52","scopus_import":"1","main_file_link":[{"url":"https://hal-emse.ccsd.cnrs.fr/3IA-COTEDAZUR/hal-04083489v1","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"publication_status":"published","issue":"2","related_material":{"record":[{"id":"9441","status":"public","relation":"earlier_version"}]},"volume":52,"ec_funded":1,"_id":"12960","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-10-10T07:34:35Z","department":[{"_id":"HeEd"}],"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.","publisher":"Society for Industrial and Applied Mathematics","quality_controlled":"1","oa":1,"day":"30","publication":"SIAM Journal on Computing","isi":1,"year":"2023","date_published":"2023-04-30T00:00:00Z","doi":"10.1137/21M1412918","date_created":"2023-05-14T22:01:00Z","page":"452-486","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Learning and triangulating manifolds via collapses","grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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","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","short":"J.D. Boissonnat, S. Kachanovich, M. Wintraecken, SIAM Journal on Computing 52 (2023) 452–486.","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."},"title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations","author":[{"first_name":"Jean Daniel","full_name":"Boissonnat, Jean Daniel","last_name":"Boissonnat"},{"full_name":"Kachanovich, Siargey","last_name":"Kachanovich","first_name":"Siargey"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"external_id":{"isi":["001013183000012"]},"article_processing_charge":"No"},{"_id":"13216","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","keyword":["Colloid and Surface Chemistry","Biochemistry","General Chemistry","Catalysis"],"date_updated":"2023-10-11T08:45:10Z","ddc":["540"],"department":[{"_id":"MaIb"},{"_id":"BiCh"}],"file_date_updated":"2023-07-12T10:22:04Z","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,"month":"06","intvolume":" 145","publication_identifier":{"issn":["0002-7863"],"eissn":["1520-5126"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"13219","checksum":"e07d5323f9c0e5cbd1ad6453f29440ab","creator":"cchlebak","file_size":3155843,"date_updated":"2023-07-12T10:22:04Z","file_name":"2023_JACS_Bunting.pdf","date_created":"2023-07-12T10:22:04Z"}],"language":[{"iso":"eng"}],"volume":145,"issue":"27","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.","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.","short":"R. Bunting, F. Wodaczek, T. Torabi, B. Cheng, Journal of the American Chemical Society 145 (2023) 14894–14902.","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","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","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","author":[{"first_name":"Rhys","id":"91deeae8-1207-11ec-b130-c194ad5b50c6","last_name":"Bunting","orcid":"0000-0001-6928-074X","full_name":"Bunting, Rhys"},{"full_name":"Wodaczek, Felix","orcid":"0009-0000-1457-795X","last_name":"Wodaczek","id":"8b4b6a9f-32b0-11ee-9fa8-bbe85e26258e","first_name":"Felix"},{"full_name":"Torabi, Tina","last_name":"Torabi","first_name":"Tina"},{"orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing","last_name":"Cheng","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing"}],"external_id":{"pmid":["37390457"],"isi":["001020623900001"]},"article_processing_charge":"Yes (via OA deal)","title":"Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane","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.","publisher":"American Chemical Society","quality_controlled":"1","oa":1,"has_accepted_license":"1","isi":1,"year":"2023","day":"30","publication":"Journal of the American Chemical Society","page":"14894-14902","date_published":"2023-06-30T00:00:00Z","doi":"10.1021/jacs.3c04030","date_created":"2023-07-12T09:16:40Z"},{"status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"14426","department":[{"_id":"EdHa"}],"file_date_updated":"2023-10-16T07:20:49Z","ddc":["570"],"date_updated":"2023-10-16T07:25:48Z","month":"10","intvolume":" 21","scopus_import":"1","oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"issue":"10","related_material":{"link":[{"url":"https://github.com/JulieKlepstad/LiverDevelopment","relation":"software"}]},"volume":21,"ec_funded":1,"file":[{"creator":"dernst","file_size":6193110,"date_updated":"2023-10-16T07:20:49Z","file_name":"2023_PloSBiology_Unterweger.pdf","date_created":"2023-10-16T07:20:49Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"40a2b11b41d70a0e5939f8a52b66e389","file_id":"14431"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1545-7885"]},"publication_status":"published","project":[{"grant_number":"851288","name":"Design Principles of Branching Morphogenesis","_id":"05943252-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"article_number":"e3002315","title":"Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics","author":[{"full_name":"Unterweger, Iris A.","last_name":"Unterweger","first_name":"Iris A."},{"first_name":"Julie","last_name":"Klepstad","full_name":"Klepstad, Julie"},{"last_name":"Hannezo","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B"},{"last_name":"Lundegaard","full_name":"Lundegaard, Pia R.","first_name":"Pia R."},{"first_name":"Ala","last_name":"Trusina","full_name":"Trusina, Ala"},{"first_name":"Elke A.","full_name":"Ober, Elke A.","last_name":"Ober"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","short":"I.A. Unterweger, J. Klepstad, E.B. Hannezo, P.R. Lundegaard, A. Trusina, E.A. Ober, PLoS Biology 21 (2023).","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.","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","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"},"publisher":"Public Library of Science","quality_controlled":"1","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).","doi":"10.1371/journal.pbio.3002315","date_published":"2023-10-04T00:00:00Z","date_created":"2023-10-15T22:01:10Z","day":"04","publication":"PLoS Biology","has_accepted_license":"1","year":"2023"},{"publication":"43rd Annual International Cryptology Conference","day":"09","year":"2023","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","oa":1,"publisher":"Springer Nature","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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","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.","short":"Y. Dodis, N. Ferguson, E. Goldin, P. Hall, K.Z. Pietrzak, in:, 43rd Annual International Cryptology Conference, Springer Nature, 2023, pp. 514–546.","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."},"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"},{"first_name":"Niels","last_name":"Ferguson","full_name":"Ferguson, Niels"},{"full_name":"Goldin, Eli","last_name":"Goldin","first_name":"Eli"},{"last_name":"Hall","full_name":"Hall, Peter","first_name":"Peter"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031385445"],"eissn":["1611-3349"]},"volume":14082,"oa_version":"Preprint","abstract":[{"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.","lang":"eng"}],"intvolume":" 14082","month":"08","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2023/1041"}],"scopus_import":"1","alternative_title":["LNCS"],"date_updated":"2023-10-16T08:02:11Z","department":[{"_id":"KrPi"}],"_id":"14428","status":"public","conference":{"location":"Santa Barbara, CA, United States","end_date":"2023-08-24","start_date":"2023-08-20","name":"CRYPTO: Advances in Cryptology"},"type":"conference"},{"volume":207,"publication_status":"published","publication_identifier":{"eissn":["1730-6264"],"issn":["0065-1036"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2103.08268","open_access":"1"}],"intvolume":" 207","month":"01","abstract":[{"lang":"eng","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."}],"oa_version":"Preprint","department":[{"_id":"GradSch"}],"date_updated":"2023-10-17T09:15:17Z","article_type":"original","type":"journal_article","keyword":["Algebra","Number Theory"],"status":"public","_id":"12406","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","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","article_processing_charge":"No","external_id":{"isi":["000912903000001"],"arxiv":["2103.08268"]},"author":[{"last_name":"Diao","orcid":"0000-0002-4989-5330","full_name":"Diao, Yijie","id":"7b7eb4ca-eb2c-11ec-b98b-accec0b20c3b","first_name":"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.","short":"Y. Diao, Acta Arithmetica 207 (2023) 1–17.","ieee":"Y. Diao, “Density of the union of positive diagonal binary quadratic forms,” Acta Arithmetica, vol. 207. Instytut Matematyczny, pp. 1–17, 2023.","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","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","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"},{"article_number":"3784","project":[{"_id":"26336814-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"758053","name":"A Fiber Optic Transceiver for Superconducting Qubits"},{"grant_number":"899354","name":"Quantum Local Area Networks with Superconducting Qubits","call_identifier":"H2020","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A"},{"name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"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":{"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.","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.","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.","short":"L. Qiu, R. Sahu, W.J. Hease, G.M. Arnold, J.M. Fink, Nature Communications 14 (2023).","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","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"},"title":"Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action","article_processing_charge":"No","external_id":{"pmid":["37355691"],"isi":["001018100800002"],"arxiv":["2210.12443"]},"author":[{"orcid":"0000-0003-4345-4267","full_name":"Qiu, Liu","last_name":"Qiu","id":"45e99c0d-1eb1-11eb-9b96-ed8ab2983cac","first_name":"Liu"},{"id":"47D26E34-F248-11E8-B48F-1D18A9856A87","first_name":"Rishabh","orcid":"0000-0001-6264-2162","full_name":"Sahu, Rishabh","last_name":"Sahu"},{"id":"29705398-F248-11E8-B48F-1D18A9856A87","first_name":"William J","last_name":"Hease","orcid":"0000-0001-9868-2166","full_name":"Hease, William J"},{"first_name":"Georg M","id":"3770C838-F248-11E8-B48F-1D18A9856A87","last_name":"Arnold","full_name":"Arnold, Georg M","orcid":"0000-0003-1397-7876"},{"full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X","last_name":"Fink","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"}],"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.","oa":1,"publisher":"Nature Research","quality_controlled":"1","publication":"Nature Communications","day":"24","year":"2023","has_accepted_license":"1","isi":1,"date_created":"2023-07-09T22:01:11Z","date_published":"2023-06-24T00:00:00Z","doi":"10.1038/s41467-023-39493-3","_id":"13200","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-17T11:46:12Z","department":[{"_id":"JoFi"}],"file_date_updated":"2023-07-10T10:10:54Z","oa_version":"Published Version","pmid":1,"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"}],"intvolume":" 14","month":"06","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"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","success":1,"checksum":"ec7ccd2c08f90d59cab302fd0d7776a4","file_id":"13206","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication_status":"published","publication_identifier":{"eissn":["2041-1723"]},"ec_funded":1,"volume":14},{"month":"07","intvolume":" 120","scopus_import":"1","oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","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."}],"issue":"30","related_material":{"link":[{"url":"https://github.com/fcamilli95/Structured-PCA-","relation":"software"}]},"volume":120,"file":[{"success":1,"file_id":"13323","checksum":"1fc06228afdb3aa80cf8e7766bcf9dc5","content_type":"application/pdf","relation":"main_file","access_level":"open_access","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"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1091-6490"]},"publication_status":"published","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"13315","file_date_updated":"2023-07-31T07:30:48Z","department":[{"_id":"MaMo"}],"ddc":["000"],"date_updated":"2023-10-17T11:44:55Z","quality_controlled":"1","publisher":"National Academy of Sciences","oa":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.","doi":"10.1073/pnas.2302028120","date_published":"2023-07-25T00:00:00Z","date_created":"2023-07-30T22:01:02Z","day":"25","publication":"Proceedings of the National Academy of Sciences of the United States of America","has_accepted_license":"1","year":"2023","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"article_number":"e2302028120","title":"Fundamental limits in structured principal component analysis and how to reach them","author":[{"first_name":"Jean","last_name":"Barbier","full_name":"Barbier, Jean"},{"first_name":"Francesco","last_name":"Camilli","full_name":"Camilli, Francesco"},{"last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"last_name":"Sáenz","full_name":"Sáenz, Manuel","first_name":"Manuel"}],"external_id":{"pmid":["37463204"]},"article_processing_charge":"Yes (in subscription journal)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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","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","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.","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.","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.","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."}},{"file_date_updated":"2023-08-14T07:43:45Z","department":[{"_id":"MiLe"}],"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","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","ec_funded":1,"volume":120,"issue":"32","publication_status":"published","publication_identifier":{"eissn":["1091-6490"]},"language":[{"iso":"eng"}],"file":[{"file_id":"14047","checksum":"a5ed64788a5acef9b9a300a26fa5a177","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-08-14T07:43:45Z","file_name":"2023_PNAS_Vardi.pdf","creator":"dernst","date_updated":"2023-08-14T07:43:45Z","file_size":1003092}],"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","article_processing_charge":"Yes (in subscription journal)","external_id":{"pmid":["37523549"]},"author":[{"full_name":"Vardi, Ofek","last_name":"Vardi","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"},{"last_name":"Volosniev","orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem"},{"full_name":"Saragovi, Amijai","last_name":"Saragovi","first_name":"Amijai"},{"full_name":"Galili, Nir","last_name":"Galili","first_name":"Nir"},{"first_name":"Stav","last_name":"Ferrera","full_name":"Ferrera, Stav"},{"last_name":"Ghazaryan","full_name":"Ghazaryan, Areg","orcid":"0000-0001-9666-3543","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yuran, Nir","last_name":"Yuran","first_name":"Nir"},{"last_name":"Affek","full_name":"Affek, Hagit P.","first_name":"Hagit P."},{"last_name":"Luz","full_name":"Luz, Boaz","first_name":"Boaz"},{"first_name":"Yonaton","last_name":"Goldsmith","full_name":"Goldsmith, Yonaton"},{"first_name":"Nir","last_name":"Keren","full_name":"Keren, Nir"},{"last_name":"Yochelis","full_name":"Yochelis, Shira","first_name":"Shira"},{"full_name":"Halevy, Itay","last_name":"Halevy","first_name":"Itay"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Yossi","last_name":"Paltiel","full_name":"Paltiel, Yossi"}],"title":"Nuclear spin effects in biological processes","citation":{"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.","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.","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).","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.","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","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"e2300828120","date_created":"2023-08-13T22:01:12Z","date_published":"2023-07-31T00:00:00Z","doi":"10.1073/pnas.2300828120","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."},{"author":[{"id":"D5C6A458-10C4-11EA-ABF4-A4B43DDC885E","first_name":"Guillaume","full_name":"Dubach, Guillaume","orcid":"0000-0001-6892-8137","last_name":"Dubach"},{"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":{"isi":["000950650200005"],"arxiv":["2108.13694"]},"title":"Dynamics of a rank-one perturbation of a Hermitian matrix","citation":{"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.","ista":"Dubach G, Erdös L. 2023. Dynamics of a rank-one perturbation of a Hermitian matrix. Electronic Communications in Probability. 28, 1–13.","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.","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","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331"}],"page":"1-13","doi":"10.1214/23-ECP516","date_published":"2023-02-08T00:00:00Z","date_created":"2023-02-26T23:01:01Z","isi":1,"has_accepted_license":"1","year":"2023","day":"08","publication":"Electronic Communications in Probability","quality_controlled":"1","publisher":"Institute of Mathematical Statistics","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"}],"file_date_updated":"2023-02-27T09:43:27Z","date_updated":"2023-10-17T12:48:10Z","ddc":["510"],"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":"12683","volume":28,"ec_funded":1,"publication_identifier":{"eissn":["1083-589X"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"12692","checksum":"a1c6f0a3e33688fd71309c86a9aad86e","creator":"dernst","file_size":479105,"date_updated":"2023-02-27T09:43:27Z","file_name":"2023_ElectCommProbability_Dubach.pdf","date_created":"2023-02-27T09:43:27Z"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"02","intvolume":" 28","abstract":[{"lang":"eng","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."}],"oa_version":"Published Version"},{"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.","publisher":"Institute of Mathematical Statistics","quality_controlled":"1","oa":1,"day":"01","publication":"Annals of Applied Probability","isi":1,"year":"2023","date_published":"2023-02-01T00:00:00Z","doi":"10.1214/22-AAP1820","date_created":"2023-03-26T22:01:08Z","page":"447-489","project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Annals of Applied Probability 33 (2023) 447–489.","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.","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."},"title":"Functional central limit theorems for Wigner matrices","author":[{"first_name":"Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","last_name":"Cipolloni"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J","last_name":"Schröder"}],"article_processing_charge":"No","external_id":{"isi":["000946432400015"],"arxiv":["2012.13218"]},"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"}],"month":"02","intvolume":" 33","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.13218"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1050-5164"]},"publication_status":"published","issue":"1","volume":33,"ec_funded":1,"_id":"12761","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-10-17T12:48:52Z","department":[{"_id":"LaEr"}]},{"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/when-is-necessary-sufficient/"}]},"volume":197,"issue":"3","publication_status":"published","publication_identifier":{"issn":["0003-486X"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.02356"}],"intvolume":" 197","month":"05","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"}],"oa_version":"Preprint","department":[{"_id":"TiBr"}],"date_updated":"2023-10-17T12:47:43Z","type":"journal_article","article_type":"original","status":"public","_id":"8682","page":"1115-1203","date_created":"2020-10-19T14:28:50Z","doi":"10.4007/annals.2023.197.3.3","date_published":"2023-05-01T00:00:00Z","year":"2023","isi":1,"publication":"Annals of Mathematics","day":"01","oa":1,"publisher":"Princeton University","quality_controlled":"1","external_id":{"isi":["000966611000003"],"arxiv":["2006.02356"]},"article_processing_charge":"No","author":[{"orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","last_name":"Browning","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Pierre Le","full_name":"Boudec, Pierre Le","last_name":"Boudec"},{"first_name":"Will","last_name":"Sawin","full_name":"Sawin, Will"}],"title":"The Hasse principle for random Fano hypersurfaces","citation":{"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","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","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"isi":1,"has_accepted_license":"1","year":"2023","day":"27","publication":"PLoS One","page":"e0279838","doi":"10.1371/journal.pone.0279838","date_published":"2023-02-27T00:00:00Z","date_created":"2023-03-05T23:01:05Z","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.","publisher":"Public Library of Science","quality_controlled":"1","oa":1,"citation":{"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.","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jody C.","last_name":"Mckerral","full_name":"Mckerral, Jody C."},{"last_name":"Kleshnina","full_name":"Kleshnina, Maria","id":"4E21749C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"first_name":"Vladimir","last_name":"Ejov","full_name":"Ejov, Vladimir"},{"first_name":"Louise","last_name":"Bartle","full_name":"Bartle, Louise"},{"first_name":"James G.","full_name":"Mitchell, James G.","last_name":"Mitchell"},{"first_name":"Jerzy A.","last_name":"Filar","full_name":"Filar, Jerzy A."}],"article_processing_charge":"No","external_id":{"pmid":["36848357"],"isi":["000996122900022"]},"title":"Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations","publication_identifier":{"eissn":["1932-6203"]},"publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"12712","checksum":"798ed5739a4117b03173e5d56e0534c9","success":1,"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"}],"language":[{"iso":"eng"}],"issue":"2","volume":18,"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."}],"oa_version":"Published Version","pmid":1,"scopus_import":"1","month":"02","intvolume":" 18","date_updated":"2023-10-17T12:53:30Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2023-03-07T10:26:45Z","_id":"12706","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"},{"title":"Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons","external_id":{"isi":["001020132100005"],"pmid":["37160366"]},"article_processing_charge":"No","author":[{"id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","first_name":"Kohgaku","last_name":"Eguchi","orcid":"0000-0002-6170-2546","full_name":"Eguchi, Kohgaku"},{"first_name":"Elodie","id":"3B59276A-F248-11E8-B48F-1D18A9856A87","full_name":"Le Monnier, Elodie","last_name":"Le Monnier"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Eguchi, E. Le Monnier, R. Shigemoto, The Journal of Neuroscience 43 (2023) 4197–4216.","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.","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","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.","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.","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."},"project":[{"call_identifier":"H2020","_id":"2659CC84-B435-11E9-9278-68D0E5697425","name":"Ultrastructural analysis of phosphoinositides in nerve terminals: distribution, dynamics and physiological roles in synaptic transmission","grant_number":"793482"},{"grant_number":"694539","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","_id":"25CA28EA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"date_created":"2023-07-09T22:01:12Z","doi":"10.1523/JNEUROSCI.1514-22.2023","date_published":"2023-06-07T00:00:00Z","page":"4197-4216","publication":"The Journal of Neuroscience","day":"07","year":"2023","isi":1,"has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Society for Neuroscience","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","ddc":["570"],"date_updated":"2023-10-18T07:12:47Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"13202","ec_funded":1,"volume":43,"issue":"23","language":[{"iso":"eng"}],"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,"checksum":"70b2141870e0bf1c94fd343e18fdbc32","file_id":"13205"}],"publication_status":"published","publication_identifier":{"issn":["0270-6474"],"eissn":["1529-2401"]},"intvolume":" 43","month":"06","scopus_import":"1","oa_version":"Published Version","pmid":1,"abstract":[{"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.","lang":"eng"}],"acknowledged_ssus":[{"_id":"EM-Fac"}]},{"oa_version":"Preprint","abstract":[{"lang":"eng","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"}],"intvolume":" 24","month":"02","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2007.14182"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0391-173X"],"eissn":["2036-2145"]},"issue":"1","volume":24,"_id":"12916","status":"public","type":"journal_article","article_type":"original","date_updated":"2023-10-18T06:54:30Z","department":[{"_id":"TiBr"}],"oa":1,"quality_controlled":"1","publisher":"Scuola Normale Superiore - Edizioni della Normale","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","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","short":"D. Bonolis, T.D. Browning, Annali Della Scuola Normale Superiore Di Pisa - Classe Di Scienze 24 (2023) 173–204.","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","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","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."},"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"},{"last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D"}]},{"project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"},{"_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b","name":"Mathematical Challenges in BCS Theory of Superconductivity","grant_number":"I06427"}],"title":"Boundary superconductivity in BCS theory","author":[{"first_name":"Barbara","id":"5DA90512-D80F-11E9-8994-2E2EE6697425","last_name":"Roos","full_name":"Roos, Barbara","orcid":"0000-0002-9071-5880"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"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.","mla":"Roos, Barbara. Boundary Superconductivity in BCS Theory. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:14374.","ista":"Roos B. 2023. Boundary superconductivity in BCS theory. Institute of Science and Technology Austria.","chicago":"Roos, Barbara. “Boundary Superconductivity in BCS Theory.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:14374."},"publisher":"Institute of Science and Technology Austria","oa":1,"date_published":"2023-09-30T00:00:00Z","doi":"10.15479/at:ista:14374","date_created":"2023-09-28T14:23:04Z","page":"206","day":"30","has_accepted_license":"1","year":"2023","status":"public","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)"},"_id":"14374","file_date_updated":"2023-10-06T11:38:01Z","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"ddc":["515","539"],"supervisor":[{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"date_updated":"2023-10-27T10:37:30Z","month":"09","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","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."}],"related_material":{"record":[{"status":"public","id":"13207","relation":"part_of_dissertation"},{"status":"public","id":"10850","relation":"part_of_dissertation"}]},"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","ec_funded":1,"file":[{"file_name":"phd-thesis-draft_pdfa_acrobat.pdf","date_created":"2023-10-06T11:35:56Z","creator":"broos","file_size":2365702,"date_updated":"2023-10-06T11:35:56Z","file_id":"14398","checksum":"ef039ffc3de2cb8dee5b14110938e9b6","relation":"main_file","access_level":"open_access","content_type":"application/pdf"},{"creator":"broos","file_size":4691734,"date_updated":"2023-10-06T11:38:01Z","file_name":"Version5.zip","date_created":"2023-10-06T11:38:01Z","relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","checksum":"81dcac33daeefaf0111db52f41bb1fd0","file_id":"14399"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663 - 337X"]},"degree_awarded":"PhD","publication_status":"published"},{"oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"month":"05","intvolume":" 12","file":[{"creator":"alisjak","date_updated":"2023-07-11T08:19:15Z","file_size":304619,"date_created":"2023-07-11T08:19:15Z","file_name":"2023_EMS_Hainzl.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"13208","checksum":"5501da33be010b5c81440438287584d5","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1664-039X"],"eissn":["1664-0403"]},"publication_status":"published","issue":"4","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"14374"}]},"volume":12,"ec_funded":1,"_id":"13207","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":["530"],"date_updated":"2023-10-27T10:37:29Z","file_date_updated":"2023-07-11T08:19:15Z","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"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.","publisher":"EMS Press","quality_controlled":"1","oa":1,"day":"18","publication":"Journal of Spectral Theory","isi":1,"has_accepted_license":"1","year":"2023","doi":"10.4171/JST/439","date_published":"2023-05-18T00:00:00Z","date_created":"2023-07-10T16:35:45Z","page":"1507–1540","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"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.","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","short":"C. Hainzl, B. Roos, R. Seiringer, Journal of Spectral Theory 12 (2023) 1507–1540.","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.","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."},"title":"Boundary superconductivity in the BCS model","author":[{"full_name":"Hainzl, Christian","last_name":"Hainzl","first_name":"Christian"},{"orcid":"0000-0002-9071-5880","full_name":"Roos, Barbara","last_name":"Roos","id":"5DA90512-D80F-11E9-8994-2E2EE6697425","first_name":"Barbara"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"article_processing_charge":"No","external_id":{"isi":["000997933500008"],"arxiv":["2201.08090"]}},{"language":[{"iso":"eng"}],"file":[{"date_created":"2023-10-30T12:57:53Z","file_name":"2023_Genetics_Barton.pdf","date_updated":"2023-10-30T12:57:53Z","file_size":1439032,"creator":"dernst","file_id":"14469","checksum":"3f65b1fbe813e2f4dbb5d2b5e891844a","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"eissn":["1943-2631"],"issn":["0016-6731"]},"ec_funded":1,"volume":225,"related_material":{"record":[{"status":"public","id":"12949","relation":"research_data"}]},"issue":"2","oa_version":"Published Version","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 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.","lang":"eng"}],"intvolume":" 225","month":"10","scopus_import":"1","ddc":["570"],"date_updated":"2023-10-30T13:04:11Z","file_date_updated":"2023-10-30T12:57:53Z","department":[{"_id":"NiBa"}],"_id":"14452","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","publication":"Genetics","day":"01","year":"2023","has_accepted_license":"1","date_created":"2023-10-29T23:01:15Z","doi":"10.1093/genetics/iyad133","date_published":"2023-10-01T00:00:00Z","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.","oa":1,"quality_controlled":"1","publisher":"Oxford Academic","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","ista":"Barton NH, Etheridge AM, Véber A. 2023. The infinitesimal model with dominance. Genetics. 225(2), 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.","ieee":"N. H. Barton, A. M. Etheridge, and A. Véber, “The infinitesimal model with dominance,” Genetics, vol. 225, no. 2. Oxford Academic, 2023.","short":"N.H. Barton, A.M. Etheridge, A. Véber, Genetics 225 (2023).","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","ama":"Barton NH, Etheridge AM, Véber A. The infinitesimal model with dominance. Genetics. 2023;225(2). doi:10.1093/genetics/iyad133"},"title":"The infinitesimal model with dominance","article_processing_charge":"Yes (in subscription journal)","external_id":{"arxiv":["2211.03515"]},"author":[{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"last_name":"Etheridge","full_name":"Etheridge, Alison M.","first_name":"Alison M."},{"full_name":"Véber, Amandine","last_name":"Véber","first_name":"Amandine"}],"article_number":"iyad133","project":[{"grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"},{"_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00","grant_number":"101055327","name":"Understanding the evolution of continuous genomes"}]},{"keyword":["Quantitative genetics","infinitesimal model"],"status":"public","project":[{"_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00","grant_number":"101055327","name":"Understanding the evolution of continuous genomes"}],"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":"research_data","_id":"12949","department":[{"_id":"NiBa"}],"title":"The infinitesimal model with dominance","file_date_updated":"2023-05-16T04:09:08Z","article_processing_charge":"No","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["576"],"date_updated":"2023-10-30T13:04:11Z","citation":{"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","ieee":"N. H. Barton, “The infinitesimal model with dominance.” Institute of Science and Technology Austria, 2023.","short":"N.H. Barton, (2023).","mla":"Barton, Nicholas H. The Infinitesimal Model with Dominance. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12949.","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."},"month":"05","oa":1,"publisher":"Institute of Science and Technology Austria","oa_version":"Published Version","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 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."}],"date_created":"2023-05-13T09:49:09Z","contributor":[{"contributor_type":"researcher","first_name":"Amandine","last_name":"Veber"},{"last_name":"Etheridge","first_name":"Alison","contributor_type":"researcher"}],"date_published":"2023-05-13T00:00:00Z","related_material":{"record":[{"relation":"used_in_publication","id":"14452","status":"public"}]},"doi":"10.15479/AT:ISTA:12949","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","file_id":"12950","checksum":"b0ce7d4b1ee7e7265430ceed36fc3336","success":1,"creator":"nbarton","date_updated":"2023-05-13T09:36:33Z","file_size":13662,"date_created":"2023-05-13T09:36:33Z","file_name":"Neutral identities 16th Jan"},{"file_size":181619928,"date_updated":"2023-05-13T09:38:17Z","creator":"nbarton","file_name":"p, zA, zD, N=30 neutral III","date_created":"2023-05-13T09:38:17Z","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"ad5035ad4f7d3b150a252c79884f6a83","file_id":"12951"},{"checksum":"62182a1de796256edd6f4223704312ef","file_id":"12952","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","date_created":"2023-05-13T09:41:59Z","file_name":"p, zA, zD, N=30 neutral IV","creator":"nbarton","date_updated":"2023-05-13T09:41:59Z","file_size":605902074},{"date_created":"2023-05-13T09:46:52Z","file_name":"p, zA, zD, N=30 selected k=5","date_updated":"2023-05-13T09:46:52Z","file_size":1018238746,"creator":"nbarton","checksum":"af775dda5c4f6859cb1e5a81ec40a667","file_id":"12953","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file"},{"success":1,"checksum":"af26f3394c387d3ada14b434cd68b1e5","file_id":"12954","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"Pairwise F N=30 neutral II","date_created":"2023-05-13T09:42:05Z","file_size":3197160,"date_updated":"2023-05-13T09:42:05Z","creator":"nbarton"},{"creator":"nbarton","date_updated":"2023-05-13T09:42:06Z","file_size":55492,"date_created":"2023-05-13T09:42:06Z","file_name":"Pedigrees N=30 neutral II","access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","checksum":"d5da7dc0e7282dd48222e26d12e34220","file_id":"12955","success":1},{"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","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"00f386d80677590e29f6235d49cba58d","file_id":"12956"},{"file_name":"Algorithm for caclulating identities.nb","date_created":"2023-05-13T09:46:08Z","creator":"nbarton","file_size":121209,"date_updated":"2023-05-13T09:46:08Z","success":1,"checksum":"658cef3eaea6136a4d24da4f074191d7","file_id":"12957","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream"},{"success":1,"checksum":"db9b6dddd7a596d974e25f5e78f5c45c","file_id":"12958","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"Infinitesimal with dominance.nb","date_created":"2023-05-13T09:46:08Z","file_size":1803898,"date_updated":"2023-05-13T09:46:08Z","creator":"nbarton"},{"creator":"nbarton","date_updated":"2023-05-16T04:09:08Z","file_size":990,"date_created":"2023-05-16T04:09:08Z","file_name":"ReadMe.txt","access_level":"open_access","relation":"main_file","content_type":"text/plain","checksum":"91f80a9fb58cae8eef2d8bf59fe30189","file_id":"12967","success":1}],"day":"13","year":"2023","has_accepted_license":"1"},{"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).","quality_controlled":"1","publisher":"ML Research Press","oa":1,"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":"24020-24044","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","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.","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.","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.","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."},"title":"Quantized distributed training of large models with convergence guarantees","author":[{"id":"D0CF4148-C985-11E9-8066-0BDEE5697425","first_name":"Ilia","last_name":"Markov","full_name":"Markov, Ilia"},{"first_name":"Adrian","last_name":"Vladu","full_name":"Vladu, Adrian"},{"first_name":"Qi","last_name":"Guo","full_name":"Guo, Qi"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"article_processing_charge":"No","external_id":{"arxiv":["2302.02390"]},"oa_version":"Preprint","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"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"month":"07","intvolume":" 202","alternative_title":["PMLR"],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.02390","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2640-3498"]},"publication_status":"published","volume":202,"ec_funded":1,"_id":"14461","status":"public","type":"conference","conference":{"end_date":"2023-07-29","location":"Honolulu, Hawaii, HI, United States","start_date":"2023-07-23","name":"ICML: International Conference on Machine Learning"},"date_updated":"2023-10-31T09:40:45Z","department":[{"_id":"DaAl"}]},{"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.","date_published":"2023-07-30T00:00:00Z","date_created":"2023-10-29T23:01:17Z","page":"10072-10092","day":"30","publication":"Proceedings of the 40th International Conference on Machine Learning","year":"2023","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"name":"Wittgenstein Award - Monika Henzinger","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775 "}],"title":"Constant matters: Fine-grained error bound on differentially private continual observation","author":[{"first_name":"Hendrik","full_name":"Fichtenberger, Hendrik","last_name":"Fichtenberger"},{"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","full_name":"Upadhyay, Jalaj","last_name":"Upadhyay"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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.","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.","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."},"month":"07","intvolume":" 202","scopus_import":"1","alternative_title":["PMLR"],"main_file_link":[{"url":"https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf","open_access":"1"}],"oa_version":"Published Version","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."}],"volume":202,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2640-3498"]},"publication_status":"published","status":"public","type":"conference","conference":{"name":"ICML: International Conference on Machine Learning","start_date":"2023-07-23","location":"Honolulu, Hawaii, HI, United States","end_date":"2023-07-29"},"_id":"14462","department":[{"_id":"MoHe"}],"date_updated":"2023-10-31T09:54:05Z"},{"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).","oa":1,"publisher":"ML Research Press","quality_controlled":"1","year":"2023","publication":"Proceedings of the 40th International Conference on Machine Learning","day":"30","page":"31151-31209","date_created":"2023-10-29T23:01:17Z","date_published":"2023-07-30T00:00:00Z","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"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.","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2212.13468"]},"article_processing_charge":"No","author":[{"last_name":"Shevchenko","full_name":"Shevchenko, Aleksandr","id":"F2B06EC2-C99E-11E9-89F0-752EE6697425","first_name":"Aleksandr"},{"first_name":"Kevin","id":"94ec913c-dc85-11ea-9058-e5051ab2428b","full_name":"Kögler, Kevin","last_name":"Kögler"},{"last_name":"Hassani","full_name":"Hassani, Hamed","first_name":"Hamed"},{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"}],"title":"Fundamental limits of two-layer autoencoders, and achieving them with gradient methods","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"}],"oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.13468","open_access":"1"}],"alternative_title":["PMLR"],"scopus_import":"1","intvolume":" 202","month":"07","publication_status":"published","publication_identifier":{"eissn":["2640-3498"]},"language":[{"iso":"eng"}],"volume":202,"_id":"14459","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2023-07-29","location":"Honolulu, Hawaii, HI, United States","start_date":"2023-07-23"},"type":"conference","status":"public","date_updated":"2023-10-31T08:52:28Z","department":[{"_id":"MaMo"},{"_id":"DaAl"}]},{"title":"SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge","author":[{"full_name":"Nikdan, Mahdi","last_name":"Nikdan","first_name":"Mahdi","id":"66374281-f394-11eb-9cf6-869147deecc0"},{"last_name":"Pegolotti","full_name":"Pegolotti, Tommaso","first_name":"Tommaso"},{"first_name":"Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","orcid":"0000-0002-7778-3221","full_name":"Iofinova, Eugenia B","last_name":"Iofinova"},{"id":"47beb3a5-07b5-11eb-9b87-b108ec578218","first_name":"Eldar","full_name":"Kurtic, Eldar","last_name":"Kurtic"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["2302.04852"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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.","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.","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."},"project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"date_published":"2023-07-30T00:00:00Z","date_created":"2023-10-29T23:01:17Z","page":"26215-26227","day":"30","publication":"Proceedings of the 40th International Conference on Machine Learning","year":"2023","quality_controlled":"1","publisher":"ML Research Press","oa":1,"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. ","department":[{"_id":"DaAl"}],"date_updated":"2023-10-31T09:33:51Z","status":"public","type":"conference","conference":{"name":"ICML: International Conference on Machine Learning","location":"Honolulu, Hawaii, HI, United States","end_date":"2023-07-29","start_date":"2023-07-23"},"_id":"14460","volume":202,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2640-3498"]},"publication_status":"published","month":"07","intvolume":" 202","alternative_title":["PMLR"],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2302.04852"}],"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"}]},{"article_processing_charge":"No","author":[{"id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","first_name":"Charlotte","last_name":"Hoffmann","full_name":"Hoffmann, Charlotte","orcid":"0000-0003-2027-5549"},{"last_name":"Simkin","full_name":"Simkin, Mark","first_name":"Mark"}],"title":"Stronger lower bounds for leakage-resilient secret sharing","citation":{"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.","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","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","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Springer Nature","quality_controlled":"1","page":"215-228","date_created":"2023-10-29T23:01:16Z","date_published":"2023-10-01T00:00:00Z","doi":"10.1007/978-3-031-44469-2_11","year":"2023","publication":"8th International Conference on Cryptology and Information Security in Latin America","day":"01","conference":{"name":"LATINCRYPT: Conference on Cryptology and Information Security in Latin America","start_date":"2023-10-03","end_date":"2023-10-06","location":"Quito, Ecuador"},"type":"conference","status":"public","_id":"14457","department":[{"_id":"KrPi"}],"date_updated":"2023-10-31T11:43:12Z","main_file_link":[{"url":"https://eprint.iacr.org/2023/1017","open_access":"1"}],"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 14168","month":"10","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","volume":14168,"publication_status":"published","publication_identifier":{"isbn":["9783031444685"],"eissn":["1611-3349"],"issn":["0302-9743"]},"language":[{"iso":"eng"}]},{"volume":202,"ec_funded":1,"publication_identifier":{"eissn":["2640-3498"]},"publication_status":"published","language":[{"iso":"eng"}],"alternative_title":["PMLR"],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2301.00774","open_access":"1"}],"month":"07","intvolume":" 202","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"}],"oa_version":"Preprint","department":[{"_id":"DaAl"}],"date_updated":"2023-10-31T09:59:42Z","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":"14458","page":"10323-10337","date_published":"2023-07-30T00:00:00Z","date_created":"2023-10-29T23:01:16Z","year":"2023","day":"30","publication":"Proceedings of the 40th International Conference on Machine Learning","publisher":"ML Research Press","quality_controlled":"1","oa":1,"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.","author":[{"full_name":"Frantar, Elias","last_name":"Frantar","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","first_name":"Elias"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"}],"external_id":{"arxiv":["2301.00774"]},"article_processing_charge":"No","title":"SparseGPT: Massive language models can be accurately pruned in one-shot","citation":{"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.","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.","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.","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.","short":"E. Frantar, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}]},{"ec_funded":1,"publication_status":"epub_ahead","publication_identifier":{"issn":["0941-0643"],"eissn":["1433-3058"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00521-023-09033-7"}],"scopus_import":"1","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","department":[{"_id":"JuFi"}],"date_updated":"2023-10-31T10:58:28Z","article_type":"original","type":"journal_article","status":"public","_id":"14451","date_created":"2023-10-22T22:01:16Z","doi":"10.1007/s00521-023-09033-7","date_published":"2023-10-05T00:00:00Z","year":"2023","publication":"Neural Computing and Applications","day":"05","oa":1,"publisher":"Springer Nature","quality_controlled":"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.","article_processing_charge":"Yes (via OA deal)","external_id":{"arxiv":["2203.04579"]},"author":[{"orcid":"0000-0002-6269-5149","full_name":"Cornalba, Federico","last_name":"Cornalba","first_name":"Federico","id":"2CEB641C-A400-11E9-A717-D712E6697425"},{"first_name":"Constantin","full_name":"Disselkamp, Constantin","last_name":"Disselkamp"},{"last_name":"Scassola","full_name":"Scassola, Davide","first_name":"Davide"},{"full_name":"Helf, Christopher","last_name":"Helf","first_name":"Christopher"}],"title":"Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading","citation":{"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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}]},{"type":"journal_article","article_type":"original","status":"public","_id":"14444","department":[{"_id":"MaKw"}],"date_updated":"2023-10-31T11:27:30Z","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2202.05088","open_access":"1"}],"month":"09","intvolume":" 256","abstract":[{"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.","lang":"eng"}],"oa_version":"Preprint","volume":256,"issue":"2","publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"publication_status":"published","language":[{"iso":"eng"}],"author":[{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","last_name":"Kwan","orcid":"0000-0002-4003-7567","full_name":"Kwan, 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"}],"article_processing_charge":"Yes (in subscription journal)","external_id":{"arxiv":["2202.05088"]},"title":"Substructures in Latin squares","citation":{"ista":"Kwan MA, Sah A, Sawhney M, Simkin M. 2023. Substructures in Latin squares. Israel Journal of Mathematics. 256(2), 363–416.","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.","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","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","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.","short":"M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Israel Journal of Mathematics 256 (2023) 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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Springer Nature","oa":1,"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","doi":"10.1007/s11856-023-2513-9","date_published":"2023-09-01T00:00:00Z","date_created":"2023-10-22T22:01:14Z","year":"2023","day":"01","publication":"Israel Journal of Mathematics"},{"title":"Monitoring algorithmic fairness under partial observations","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","last_name":"Kueffner","full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542"},{"first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","last_name":"Mallik"}],"article_processing_charge":"No","external_id":{"arxiv":["2308.00341"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","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.","short":"T.A. Henzinger, K. Kueffner, K. Mallik, in:, 23rd International Conference on Runtime Verification, Springer Nature, 2023, 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."},"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"date_published":"2023-10-01T00:00:00Z","doi":"10.1007/978-3-031-44267-4_15","date_created":"2023-10-29T23:01:15Z","page":"291-311","day":"01","publication":"23rd International Conference on Runtime Verification","year":"2023","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","department":[{"_id":"ToHe"}],"date_updated":"2023-10-31T11:48:20Z","status":"public","type":"conference","conference":{"name":"RV: Conference on Runtime Verification","location":"Thessaloniki, Greece","end_date":"2023-10-06","start_date":"2023-10-03"},"_id":"14454","volume":14245,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783031442667"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publication_status":"published","month":"10","intvolume":" 14245","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2308.00341","open_access":"1"}],"oa_version":"Preprint","abstract":[{"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.","lang":"eng"}]},{"date_created":"2023-10-22T22:01:15Z","doi":"10.2478/msr-2023-0023","date_published":"2023-08-01T00:00:00Z","page":"175-183","publication":"Measurement Science Review","day":"01","year":"2023","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Sciendo","acknowledgement":"The work was supported by the Scientific Grant Agency of the Ministry of Education of the Slovak Republic and the Slovak Academy of Sciences, projects APVV-21-0216, VEGA2-0096-21 and VEGA 2-0023-22.","title":"Against the flow of time with multi-output models","article_processing_charge":"Yes","author":[{"last_name":"Jakubík","full_name":"Jakubík, Jozef","first_name":"Jozef"},{"full_name":"Bui Thi Mai, Phuong","last_name":"Bui Thi Mai","first_name":"Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martina","last_name":"Chvosteková","full_name":"Chvosteková, Martina"},{"full_name":"Krakovská, Anna","last_name":"Krakovská","first_name":"Anna"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Jakubík J, Phuong M, Chvosteková M, Krakovská A. 2023. Against the flow of time with multi-output models. Measurement Science Review. 23(4), 175–183.","chicago":"Jakubík, Jozef, Mary Phuong, Martina Chvosteková, and Anna Krakovská. “Against the Flow of Time with Multi-Output Models.” Measurement Science Review. Sciendo, 2023. https://doi.org/10.2478/msr-2023-0023.","ama":"Jakubík J, Phuong M, Chvosteková M, Krakovská A. Against the flow of time with multi-output models. Measurement Science Review. 2023;23(4):175-183. doi:10.2478/msr-2023-0023","apa":"Jakubík, J., Phuong, M., Chvosteková, M., & Krakovská, A. (2023). Against the flow of time with multi-output models. Measurement Science Review. Sciendo. https://doi.org/10.2478/msr-2023-0023","ieee":"J. Jakubík, M. Phuong, M. Chvosteková, and A. Krakovská, “Against the flow of time with multi-output models,” Measurement Science Review, vol. 23, no. 4. Sciendo, pp. 175–183, 2023.","short":"J. Jakubík, M. Phuong, M. Chvosteková, A. Krakovská, Measurement Science Review 23 (2023) 175–183.","mla":"Jakubík, Jozef, et al. “Against the Flow of Time with Multi-Output Models.” Measurement Science Review, vol. 23, no. 4, Sciendo, 2023, pp. 175–83, doi:10.2478/msr-2023-0023."},"volume":23,"issue":"4","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"14476","checksum":"b069cc10fa6a7c96b2bc9f728165f9e6","success":1,"creator":"dernst","date_updated":"2023-10-31T12:07:23Z","file_size":2639783,"date_created":"2023-10-31T12:07:23Z","file_name":"2023_MeasurementScienceRev_Jakubik.pdf"}],"publication_status":"published","publication_identifier":{"eissn":["1335-8871"]},"intvolume":" 23","month":"08","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Recent work has paid close attention to the first principle of Granger causality, according to which cause precedes effect. In this context, the question may arise whether the detected direction of causality also reverses after the time reversal of unidirectionally coupled data. Recently, it has been shown that for unidirectionally causally connected autoregressive (AR) processes X → Y, after time reversal of data, the opposite causal direction Y → X is indeed detected, although typically as part of the bidirectional X↔ Y link. As we argue here, the answer is different when the measured data are not from AR processes but from linked deterministic systems. When the goal is the usual forward data analysis, cross-mapping-like approaches correctly detect X → Y, while Granger causality-like approaches, which should not be used for deterministic time series, detect causal independence X → Y. The results of backward causal analysis depend on the predictability of the reversed data. Unlike AR processes, observables from deterministic dynamical systems, even complex nonlinear ones, can be predicted well forward, while backward predictions can be difficult (notably when the time reversal of a function leads to one-to-many relations). To address this problem, we propose an approach based on models that provide multiple candidate predictions for the target, combined with a loss function that consideres only the best candidate. The resulting good forward and backward predictability supports the view that unidirectionally causally linked deterministic dynamical systems X → Y can be expected to detect the same link both before and after time reversal.","lang":"eng"}],"department":[{"_id":"ChLa"}],"file_date_updated":"2023-10-31T12:07:23Z","ddc":["510"],"date_updated":"2023-10-31T12:12:47Z","status":"public","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"},"article_type":"original","type":"journal_article","_id":"14446"},{"ec_funded":1,"volume":404,"publication_status":"published","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"language":[{"iso":"eng"}],"file":[{"file_size":832375,"date_updated":"2023-10-31T12:21:39Z","creator":"dernst","file_name":"2023_CommMathPhysics_Brooks.pdf","date_created":"2023-10-31T12:21:39Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"14477","checksum":"1ae49b39247cb6b40ff75997381581b8"}],"scopus_import":"1","intvolume":" 404","month":"11","abstract":[{"text":"We study the Fröhlich polaron model in R3, and establish the subleading term in the strong coupling asymptotics of its ground state energy, corresponding to the quantum corrections to the classical energy determined by the Pekar approximation.","lang":"eng"}],"oa_version":"Published Version","department":[{"_id":"RoSe"}],"file_date_updated":"2023-10-31T12:21:39Z","date_updated":"2023-10-31T12:22:51Z","ddc":["510"],"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":"14441","page":"287-337","date_created":"2023-10-22T22:01:13Z","doi":"10.1007/s00220-023-04841-3","date_published":"2023-11-01T00:00:00Z","year":"2023","has_accepted_license":"1","publication":"Communications in Mathematical Physics","day":"01","oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is acknowledged. Open access funding provided by Institute of Science and Technology (IST Austria).","article_processing_charge":"Yes (via OA deal)","external_id":{"arxiv":["2207.03156"]},"author":[{"first_name":"Morris","id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","full_name":"Brooks, Morris","orcid":"0000-0002-6249-0928","last_name":"Brooks"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"title":"The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy","citation":{"ieee":"M. Brooks and R. Seiringer, “The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy,” Communications in Mathematical Physics, vol. 404. Springer Nature, pp. 287–337, 2023.","short":"M. Brooks, R. Seiringer, Communications in Mathematical Physics 404 (2023) 287–337.","ama":"Brooks M, Seiringer R. The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy. Communications in Mathematical Physics. 2023;404:287-337. doi:10.1007/s00220-023-04841-3","apa":"Brooks, M., & Seiringer, R. (2023). The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-023-04841-3","mla":"Brooks, Morris, and Robert Seiringer. “The Fröhlich Polaron at Strong Coupling: Part I - The Quantum Correction to the Classical Energy.” Communications in Mathematical Physics, vol. 404, Springer Nature, 2023, pp. 287–337, doi:10.1007/s00220-023-04841-3.","ista":"Brooks M, Seiringer R. 2023. The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy. Communications in Mathematical Physics. 404, 287–337.","chicago":"Brooks, Morris, and Robert Seiringer. “The Fröhlich Polaron at Strong Coupling: Part I - The Quantum Correction to the Classical Energy.” Communications in Mathematical Physics. Springer Nature, 2023. https://doi.org/10.1007/s00220-023-04841-3."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Kolmogorov V. 2023. Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2023, 11980–11989.","chicago":"Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions.” In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2023:11980–89. IEEE, 2023. https://doi.org/10.1109/CVPR52729.2023.01153.","ama":"Kolmogorov V. Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Vol 2023. IEEE; 2023:11980-11989. doi:10.1109/CVPR52729.2023.01153","apa":"Kolmogorov, V. (2023). Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Vol. 2023, pp. 11980–11989). Vancouver, Canada: IEEE. https://doi.org/10.1109/CVPR52729.2023.01153","ieee":"V. Kolmogorov, “Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Vancouver, Canada, 2023, vol. 2023, pp. 11980–11989.","short":"V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2023, pp. 11980–11989.","mla":"Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions.” Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2023, IEEE, 2023, pp. 11980–89, doi:10.1109/CVPR52729.2023.01153."},"title":"Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"article_processing_charge":"No","external_id":{"arxiv":["2010.09567"]},"quality_controlled":"1","publisher":"IEEE","oa":1,"day":"22","publication":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","year":"2023","date_published":"2023-08-22T00:00:00Z","doi":"10.1109/CVPR52729.2023.01153","date_created":"2023-10-22T22:01:16Z","page":"11980-11989","_id":"14448","status":"public","type":"conference","conference":{"end_date":"2023-06-24","location":"Vancouver, Canada","start_date":"2023-06-17","name":"CVPR: Conference on Computer Vision and Pattern Recognition"},"date_updated":"2023-10-31T12:01:24Z","department":[{"_id":"VlKo"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the problem of solving LP relaxations of MAP-MRF inference problems, and in particular the method proposed recently in [16], [35]. As a key computational subroutine, it uses a variant of the Frank-Wolfe (FW) method to minimize a smooth convex function over a combinatorial polytope. We propose an efficient implementation of this subroutine based on in-face Frank-Wolfe directions, introduced in [4] in a different context. More generally, we define an abstract data structure for a combinatorial subproblem that enables in-face FW directions, and describe its specialization for tree-structured MAP-MRF inference subproblems. Experimental results indicate that the resulting method is the current state-of-art LP solver for some classes of problems. Our code is available at pub.ist.ac.at/~vnk/papers/IN-FACE-FW.html."}],"month":"08","intvolume":" 2023","scopus_import":"1","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2010.09567"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9798350301298"],"issn":["1063-6919"]},"publication_status":"published","volume":2023},{"date_created":"2023-02-23T09:17:44Z","doi":"10.1016/j.celrep.2023.112132","date_published":"2023-03-28T00:00:00Z","publication":"Cell Reports","day":"28","year":"2023","isi":1,"has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Elsevier","acknowledgement":"The authors would like to thank Jasper Rine for advice and mentorship to D.B.L., Lesley Philips, Timothy Wells, Sophie Able, and Christina Wistrom for support with plant growth, and Bhagyshree Jamge and Frédéric Berger for help with analysis of ddm1 × WT RNA-sequencing data. This work was supported by BBSRC Institute Strategic Program GEN (BB/P013511/1) to X.F., M.H., and D.Z., a European Research Council grant MaintainMeth (725746) to D.Z., and a postdoctoral fellowship from the Helen Hay Whitney Foundation to D.B.L.","title":"Extensive de novo activity stabilizes epigenetic inheritance of CG methylation in Arabidopsis transposons","external_id":{"isi":["000944921600001"]},"article_processing_charge":"Yes","author":[{"first_name":"David B.","last_name":"Lyons","full_name":"Lyons, David B."},{"first_name":"Amy","full_name":"Briffa, Amy","last_name":"Briffa"},{"last_name":"He","full_name":"He, Shengbo","first_name":"Shengbo"},{"first_name":"Jaemyung","last_name":"Choi","full_name":"Choi, Jaemyung"},{"full_name":"Hollwey, Elizabeth","last_name":"Hollwey","first_name":"Elizabeth","id":"b8c4f54b-e484-11eb-8fdc-a54df64ef6dd"},{"first_name":"Jack","full_name":"Colicchio, Jack","last_name":"Colicchio"},{"last_name":"Anderson","full_name":"Anderson, Ian","first_name":"Ian"},{"last_name":"Feng","full_name":"Feng, Xiaoqi","orcid":"0000-0002-4008-1234","first_name":"Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958"},{"first_name":"Martin","last_name":"Howard","full_name":"Howard, Martin"},{"full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649","last_name":"Zilberman","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Lyons DB, Briffa A, He S, Choi J, Hollwey E, Colicchio J, Anderson I, Feng X, Howard M, Zilberman D. 2023. Extensive de novo activity stabilizes epigenetic inheritance of CG methylation in Arabidopsis transposons. Cell Reports. 42(3), 112132.","chicago":"Lyons, David B., Amy Briffa, Shengbo He, Jaemyung Choi, Elizabeth Hollwey, Jack Colicchio, Ian Anderson, Xiaoqi Feng, Martin Howard, and Daniel Zilberman. “Extensive de Novo Activity Stabilizes Epigenetic Inheritance of CG Methylation in Arabidopsis Transposons.” Cell Reports. Elsevier, 2023. https://doi.org/10.1016/j.celrep.2023.112132.","short":"D.B. Lyons, A. Briffa, S. He, J. Choi, E. Hollwey, J. Colicchio, I. Anderson, X. Feng, M. Howard, D. Zilberman, Cell Reports 42 (2023).","ieee":"D. B. Lyons et al., “Extensive de novo activity stabilizes epigenetic inheritance of CG methylation in Arabidopsis transposons,” Cell Reports, vol. 42, no. 3. Elsevier, 2023.","apa":"Lyons, D. B., Briffa, A., He, S., Choi, J., Hollwey, E., Colicchio, J., … Zilberman, D. (2023). Extensive de novo activity stabilizes epigenetic inheritance of CG methylation in Arabidopsis transposons. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2023.112132","ama":"Lyons DB, Briffa A, He S, et al. Extensive de novo activity stabilizes epigenetic inheritance of CG methylation in Arabidopsis transposons. Cell Reports. 2023;42(3). doi:10.1016/j.celrep.2023.112132","mla":"Lyons, David B., et al. “Extensive de Novo Activity Stabilizes Epigenetic Inheritance of CG Methylation in Arabidopsis Transposons.” Cell Reports, vol. 42, no. 3, 112132, Elsevier, 2023, doi:10.1016/j.celrep.2023.112132."},"project":[{"call_identifier":"H2020","_id":"62935a00-2b32-11ec-9570-eff30fa39068","grant_number":"725746","name":"Quantitative analysis of DNA methylation maintenance with chromatin"}],"article_number":"112132","ec_funded":1,"issue":"3","volume":42,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"6cbc44fdb18bf18834c9e2a5b9c67123","file_id":"12941","success":1,"date_updated":"2023-05-11T10:41:42Z","file_size":8401261,"creator":"kschuh","date_created":"2023-05-11T10:41:42Z","file_name":"2023_CellReports_Lyons.pdf"}],"publication_status":"published","publication_identifier":{"eissn":["2211-1247"]},"intvolume":" 42","month":"03","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Cytosine methylation within CG dinucleotides (mCG) can be epigenetically inherited over many generations. Such inheritance is thought to be mediated by a semiconservative mechanism that produces binary present/absent methylation patterns. However, we show here that in Arabidopsis thaliana h1ddm1 mutants, intermediate heterochromatic mCG is stably inherited across many generations and is quantitatively associated with transposon expression. We develop a mathematical model that estimates the rates of semiconservative maintenance failure and de novo methylation at each transposon, demonstrating that mCG can be stably inherited at any level via a dynamic balance of these activities. We find that DRM2 – the core methyltransferase of the RNA-directed DNA methylation pathway – catalyzes most of the heterochromatic de novo mCG, with de novo rates orders of magnitude higher than previously thought, whereas chromomethylases make smaller contributions. Our results demonstrate that stable epigenetic inheritance of mCG in plant heterochromatin is enabled by extensive de novo methylation."}],"file_date_updated":"2023-05-11T10:41:42Z","department":[{"_id":"DaZi"},{"_id":"XiFe"}],"ddc":["580"],"date_updated":"2023-11-02T12:23:45Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"12672"},{"project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"title":"Optimal parabolic upper bound for the energy-momentum relation of a strongly coupled polaron","external_id":{"isi":["001005008800001"],"arxiv":["2203.02454"]},"article_processing_charge":"Yes","author":[{"id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","first_name":"David Johannes","full_name":"Mitrouskas, David Johannes","last_name":"Mitrouskas"},{"last_name":"Mysliwy","full_name":"Mysliwy, Krzysztof","id":"316457FC-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Mitrouskas DJ, Mysliwy K, Seiringer R. 2023. Optimal parabolic upper bound for the energy-momentum relation of a strongly coupled polaron. Forum of Mathematics. 11, 1–52.","chicago":"Mitrouskas, David Johannes, Krzysztof Mysliwy, and Robert Seiringer. “Optimal Parabolic Upper Bound for the Energy-Momentum Relation of a Strongly Coupled Polaron.” Forum of Mathematics. Cambridge University Press, 2023. https://doi.org/10.1017/fms.2023.45.","short":"D.J. Mitrouskas, K. Mysliwy, R. Seiringer, Forum of Mathematics 11 (2023) 1–52.","ieee":"D. J. Mitrouskas, K. Mysliwy, and R. Seiringer, “Optimal parabolic upper bound for the energy-momentum relation of a strongly coupled polaron,” Forum of Mathematics, vol. 11. Cambridge University Press, pp. 1–52, 2023.","ama":"Mitrouskas DJ, Mysliwy K, Seiringer R. Optimal parabolic upper bound for the energy-momentum relation of a strongly coupled polaron. Forum of Mathematics. 2023;11:1-52. doi:10.1017/fms.2023.45","apa":"Mitrouskas, D. J., Mysliwy, K., & Seiringer, R. (2023). Optimal parabolic upper bound for the energy-momentum relation of a strongly coupled polaron. Forum of Mathematics. Cambridge University Press. https://doi.org/10.1017/fms.2023.45","mla":"Mitrouskas, David Johannes, et al. “Optimal Parabolic Upper Bound for the Energy-Momentum Relation of a Strongly Coupled Polaron.” Forum of Mathematics, vol. 11, Cambridge University Press, 2023, pp. 1–52, doi:10.1017/fms.2023.45."},"oa":1,"publisher":"Cambridge University Press","quality_controlled":"1","acknowledgement":"This research was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme grant agreement No. 694227 (R.S.) and the Maria Skłodowska-Curie grant agreement No. 665386 (K.M.).","date_created":"2023-07-02T22:00:43Z","doi":"10.1017/fms.2023.45","date_published":"2023-06-13T00:00:00Z","page":"1-52","publication":"Forum of Mathematics","day":"13","year":"2023","isi":1,"has_accepted_license":"1","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"13178","file_date_updated":"2023-07-03T10:36:25Z","department":[{"_id":"RoSe"}],"ddc":["500"],"date_updated":"2023-11-02T12:30:50Z","intvolume":" 11","month":"06","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider the large polaron described by the Fröhlich Hamiltonian and study its energy-momentum relation defined as the lowest possible energy as a function of the total momentum. Using a suitable family of trial states, we derive an optimal parabolic upper bound for the energy-momentum relation in the limit of strong coupling. The upper bound consists of a momentum independent term that agrees with the predicted two-term expansion for the ground state energy of the strongly coupled polaron at rest and a term that is quadratic in the momentum with coefficient given by the inverse of twice the classical effective mass introduced by Landau and Pekar."}],"ec_funded":1,"volume":11,"language":[{"iso":"eng"}],"file":[{"file_size":943192,"date_updated":"2023-07-03T10:36:25Z","creator":"alisjak","file_name":"2023_ForumofMathematics.Sigma_Mitrouskas.pdf","date_created":"2023-07-03T10:36:25Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"f672eb7dd015c472c9a04f1b9bf9df7d","file_id":"13186"}],"publication_status":"published","publication_identifier":{"eissn":["2050-5094"]}},{"page":"91-121","date_created":"2023-11-05T23:00:53Z","doi":"10.1146/annurev-cellbio-020823-011522","date_published":"2023-10-16T00:00:00Z","year":"2023","has_accepted_license":"1","publication":"Annual Review of Cell and Developmental Biology","day":"16","oa":1,"publisher":"Annual Reviews","quality_controlled":"1","acknowledgement":"We are grateful to Zena Hadjivasiliou for comments on this article. A.K. is supported by grants from the European Research Council under the European Union (EU) Horizon 2020 research and innovation program (680037) and Horizon Europe (101044579), and the Austrian Science Fund (F78) (Stem Cell Modulation). J.B. is supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (CC001051), the UK Medical Research Council (CC001051), and the Wellcome Trust (CC001051), and by a grant from the European Research Council under the EU Horizon 2020 research and innovation program (742138).","article_processing_charge":"Yes (in subscription journal)","external_id":{"pmid":["37418774"]},"author":[{"id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","first_name":"Anna","last_name":"Kicheva","full_name":"Kicheva, Anna","orcid":"0000-0003-4509-4998"},{"first_name":"James","full_name":"Briscoe, James","last_name":"Briscoe"}],"title":"Control of tissue development by morphogens","citation":{"short":"A. Kicheva, J. Briscoe, Annual Review of Cell and Developmental Biology 39 (2023) 91–121.","ieee":"A. Kicheva and J. Briscoe, “Control of tissue development by morphogens,” Annual Review of Cell and Developmental Biology, vol. 39. Annual Reviews, pp. 91–121, 2023.","apa":"Kicheva, A., & Briscoe, J. (2023). Control of tissue development by morphogens. Annual Review of Cell and Developmental Biology. Annual Reviews. https://doi.org/10.1146/annurev-cellbio-020823-011522","ama":"Kicheva A, Briscoe J. Control of tissue development by morphogens. Annual Review of Cell and Developmental Biology. 2023;39:91-121. doi:10.1146/annurev-cellbio-020823-011522","mla":"Kicheva, Anna, and James Briscoe. “Control of Tissue Development by Morphogens.” Annual Review of Cell and Developmental Biology, vol. 39, Annual Reviews, 2023, pp. 91–121, doi:10.1146/annurev-cellbio-020823-011522.","ista":"Kicheva A, Briscoe J. 2023. Control of tissue development by morphogens. Annual Review of Cell and Developmental Biology. 39, 91–121.","chicago":"Kicheva, Anna, and James Briscoe. “Control of Tissue Development by Morphogens.” Annual Review of Cell and Developmental Biology. Annual Reviews, 2023. https://doi.org/10.1146/annurev-cellbio-020823-011522."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","_id":"B6FC0238-B512-11E9-945C-1524E6697425","grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord"},{"grant_number":"101044579","name":"Mechanisms of tissue size regulation in spinal cord development","_id":"bd7e737f-d553-11ed-ba76-d69ffb5ee3aa"},{"_id":"059DF620-7A3F-11EA-A408-12923DDC885E","grant_number":"F07802","name":"Morphogen control of growth and pattern in the spinal cord"}],"ec_funded":1,"volume":39,"publication_status":"published","publication_identifier":{"issn":["1081-0706"],"eissn":["1530-8995"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2023-11-06T09:47:50Z","file_name":"2023_AnnualReviews_Kicheva.pdf","date_updated":"2023-11-06T09:47:50Z","file_size":434819,"creator":"dernst","checksum":"461726014cf5907010afbd418d3c13ec","file_id":"14491","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"scopus_import":"1","intvolume":" 39","month":"10","abstract":[{"lang":"eng","text":"Intercellular signaling molecules, known as morphogens, act at a long range in developing tissues to provide spatial information and control properties such as cell fate and tissue growth. The production, transport, and removal of morphogens shape their concentration profiles in time and space. Downstream signaling cascades and gene regulatory networks within cells then convert the spatiotemporal morphogen profiles into distinct cellular responses. Current challenges are to understand the diverse molecular and cellular mechanisms underlying morphogen gradient formation, as well as the logic of downstream regulatory circuits involved in morphogen interpretation. This knowledge, combining experimental and theoretical results, is essential to understand emerging properties of morphogen-controlled systems, such as robustness and scaling."}],"pmid":1,"oa_version":"Published Version","file_date_updated":"2023-11-06T09:47:50Z","department":[{"_id":"AnKi"}],"date_updated":"2023-11-06T09:56:24Z","ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"review","type":"journal_article","status":"public","_id":"14484"},{"date_created":"2023-11-05T23:00:54Z","doi":"10.1007/s11263-023-01899-3","date_published":"2023-10-31T00:00:00Z","language":[{"iso":"eng"}],"publication":"International Journal of Computer Vision","day":"31","year":"2023","publication_status":"epub_ahead","publication_identifier":{"eissn":["1573-1405"],"issn":["0920-5691"]},"month":"10","oa":1,"main_file_link":[{"url":"https://doi.org/10.1007/s11263-023-01899-3","open_access":"1"}],"publisher":"Springer Nature","quality_controlled":"1","scopus_import":"1","acknowledgement":"Open Access funding enabled and organized by Projekt DEAL.","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Portrait viewpoint and illumination editing is an important problem with several applications in VR/AR, movies, and photography. Comprehensive knowledge of geometry and illumination is critical for obtaining photorealistic results. Current methods are unable to explicitly model in 3D while handling both viewpoint and illumination editing from a single image. In this paper, we propose VoRF, a novel approach that can take even a single portrait image as input and relight human heads under novel illuminations that can be viewed from arbitrary viewpoints. VoRF represents a human head as a continuous volumetric field and learns a prior model of human heads using a coordinate-based MLP with individual latent spaces for identity and illumination. The prior model is learned in an auto-decoder manner over a diverse class of head shapes and appearances, allowing VoRF to generalize to novel test identities from a single input image. Additionally, VoRF has a reflectance MLP that uses the intermediate features of the prior model for rendering One-Light-at-A-Time (OLAT) images under novel views. We synthesize novel illuminations by combining these OLAT images with target environment maps. Qualitative and quantitative evaluations demonstrate the effectiveness of VoRF for relighting and novel view synthesis, even when applied to unseen subjects under uncontrolled illumination. This work is an extension of Rao et al. (VoRF: Volumetric Relightable Faces 2022). We provide extensive evaluation and ablative studies of our model and also provide an application, where any face can be relighted using textual input."}],"department":[{"_id":"BeBi"}],"title":"A deeper analysis of volumetric relightiable faces","article_processing_charge":"Yes (via OA deal)","author":[{"first_name":"Pramod","last_name":"Rao","full_name":"Rao, Pramod"},{"first_name":"B. R.","last_name":"Mallikarjun","full_name":"Mallikarjun, B. R."},{"last_name":"Fox","full_name":"Fox, Gereon","first_name":"Gereon"},{"full_name":"Weyrich, Tim","last_name":"Weyrich","first_name":"Tim"},{"last_name":"Bickel","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"first_name":"Hanspeter","full_name":"Pfister, Hanspeter","last_name":"Pfister"},{"last_name":"Matusik","full_name":"Matusik, Wojciech","first_name":"Wojciech"},{"full_name":"Zhan, Fangneng","last_name":"Zhan","first_name":"Fangneng"},{"last_name":"Tewari","full_name":"Tewari, Ayush","first_name":"Ayush"},{"first_name":"Christian","full_name":"Theobalt, Christian","last_name":"Theobalt"},{"first_name":"Mohamed","full_name":"Elgharib, Mohamed","last_name":"Elgharib"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Rao, Pramod, B. R. Mallikarjun, Gereon Fox, Tim Weyrich, Bernd Bickel, Hanspeter Pfister, Wojciech Matusik, et al. “A Deeper Analysis of Volumetric Relightiable Faces.” International Journal of Computer Vision. Springer Nature, 2023. https://doi.org/10.1007/s11263-023-01899-3.","ista":"Rao P, Mallikarjun BR, Fox G, Weyrich T, Bickel B, Pfister H, Matusik W, Zhan F, Tewari A, Theobalt C, Elgharib M. 2023. A deeper analysis of volumetric relightiable faces. International Journal of Computer Vision.","mla":"Rao, Pramod, et al. “A Deeper Analysis of Volumetric Relightiable Faces.” International Journal of Computer Vision, Springer Nature, 2023, doi:10.1007/s11263-023-01899-3.","ieee":"P. Rao et al., “A deeper analysis of volumetric relightiable faces,” International Journal of Computer Vision. Springer Nature, 2023.","short":"P. Rao, B.R. Mallikarjun, G. Fox, T. Weyrich, B. Bickel, H. Pfister, W. Matusik, F. Zhan, A. Tewari, C. Theobalt, M. Elgharib, International Journal of Computer Vision (2023).","apa":"Rao, P., Mallikarjun, B. R., Fox, G., Weyrich, T., Bickel, B., Pfister, H., … Elgharib, M. (2023). A deeper analysis of volumetric relightiable faces. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-023-01899-3","ama":"Rao P, Mallikarjun BR, Fox G, et al. A deeper analysis of volumetric relightiable faces. International Journal of Computer Vision. 2023. doi:10.1007/s11263-023-01899-3"},"date_updated":"2023-11-06T08:52:30Z","status":"public","type":"journal_article","article_type":"original","_id":"14488"},{"file":[{"creator":"dernst","file_size":5554901,"date_updated":"2023-11-07T08:10:44Z","file_name":"2023_WaterResourcesResearch_Buri.pdf","date_created":"2023-11-07T08:10:44Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"14495","checksum":"7ba9c87228dc09029b16bc800a0ef1a1"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1944-7973"],"issn":["0043-1397"]},"publication_status":"published","issue":"10","volume":59,"related_material":{"record":[{"relation":"research_data","id":"14494","status":"public"}]},"oa_version":"Published Version","abstract":[{"lang":"eng","text":"High Mountain Asia (HMA) is among the most vulnerable water towers globally and yet future projections of water availability in and from its high-mountain catchments remain uncertain, as their hydrologic response to ongoing environmental changes is complex. Mechanistic modeling approaches incorporating cryospheric, hydrological, and vegetation processes in high spatial, temporal, and physical detail have never been applied for high-elevation catchments of HMA. We use a land surface model at high spatial and temporal resolution (100 m and hourly) to simulate the coupled dynamics of energy, water, and vegetation for the 350 km2 Langtang catchment (Nepal). We compare our model outputs for one hydrological year against a large set of observations to gain insight into the partitioning of the water balance at the subseasonal scale and across elevation bands. During the simulated hydrological year, we find that evapotranspiration is a key component of the total water balance, as it causes about the equivalent of 20% of all the available precipitation or 154% of the water production from glacier melt in the basin to return directly to the atmosphere. The depletion of the cryospheric water budget is dominated by snow melt, but at high elevations is primarily dictated by snow and ice sublimation. Snow sublimation is the dominant vapor flux (49%) at the catchment scale, accounting for the equivalent of 11% of snowfall, 17% of snowmelt, and 75% of ice melt, respectively. We conclude that simulations should consider sublimation and other evaporative fluxes explicitly, as otherwise water balance estimates can be ill-quantified."}],"month":"10","intvolume":" 59","scopus_import":"1","ddc":["550"],"date_updated":"2023-11-07T08:12:34Z","file_date_updated":"2023-11-07T08:10:44Z","department":[{"_id":"FrPe"}],"_id":"14487","status":"public","article_type":"original","type":"journal_article","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"},"day":"25","publication":"Water Resources Research","has_accepted_license":"1","year":"2023","date_published":"2023-10-25T00:00:00Z","doi":"10.1029/2022WR033841","date_created":"2023-11-05T23:00:53Z","acknowledgement":"This project has received funding from the JSPS-SNSF (Japan Society for the Promotion of Science and Swiss National Science Foundation) Bilateral Programmes project (HOPE, High-ele-vation precipitation in High Mountain Asia; Grant 183633), and the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (RAVEN, Rapid mass losses of debris-covered glaciers in High Mountain Asia; Grant 772751). We want to thank in particular T. Gurung, S. Joshi, J. Shea, W. Immerzeel, and others involved, as well as ICIMOD, for their efforts over the past years in observing the meteorology of the Langtang catchment, collecting and organizing the data and making them publicly available. We also thank the National Geographic Society (Grant NGS-61784R-19) and the Mount Everest Foundation (reference 19-24) for providing fieldwork funding for C. L. Fyffe. We thank T. Kramer for help with the WSL Hyperion cluster. We are grate-ful for comments by three anonymous reviewers and the Associate Editor, who greatly helped to improve the manuscript further. Open access funding provided by ETH-Bereich Forschungsanstalten.","quality_controlled":"1","publisher":"Wiley","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan S. Miles, Michael McCarthy, Catriona Louise Fyffe, Stefan Fugger, et al. “Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High-Elevation Catchment.” Water Resources Research. Wiley, 2023. https://doi.org/10.1029/2022WR033841.","ista":"Buri P, Fatichi S, Shaw T, Miles ES, McCarthy M, Fyffe CL, Fugger S, Ren S, Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment. Water Resources Research. 59(10), e2022WR033841.","mla":"Buri, Pascal, et al. “Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High-Elevation Catchment.” Water Resources Research, vol. 59, no. 10, e2022WR033841, Wiley, 2023, doi:10.1029/2022WR033841.","apa":"Buri, P., Fatichi, S., Shaw, T., Miles, E. S., McCarthy, M., Fyffe, C. L., … Pellicciotti, F. (2023). Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment. Water Resources Research. Wiley. https://doi.org/10.1029/2022WR033841","ama":"Buri P, Fatichi S, Shaw T, et al. Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment. Water Resources Research. 2023;59(10). doi:10.1029/2022WR033841","ieee":"P. Buri et al., “Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment,” Water Resources Research, vol. 59, no. 10. Wiley, 2023.","short":"P. Buri, S. Fatichi, T. Shaw, E.S. Miles, M. McCarthy, C.L. Fyffe, S. Fugger, S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, Water Resources Research 59 (2023)."},"title":"Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment","author":[{"last_name":"Buri","full_name":"Buri, Pascal","first_name":"Pascal"},{"last_name":"Fatichi","full_name":"Fatichi, Simone","first_name":"Simone"},{"id":"3caa3f91-1f03-11ee-96ce-e0e553054d6e","first_name":"Thomas","last_name":"Shaw","full_name":"Shaw, Thomas"},{"first_name":"Evan S.","last_name":"Miles","full_name":"Miles, Evan S."},{"id":"22a2674a-61ce-11ee-94b5-d18813baf16f","first_name":"Michael","full_name":"Mccarthy, Michael","last_name":"Mccarthy"},{"last_name":"Fyffe","full_name":"Fyffe, Catriona Louise","first_name":"Catriona Louise","id":"001b0422-8d15-11ed-bc51-cab6c037a228"},{"last_name":"Fugger","full_name":"Fugger, Stefan","first_name":"Stefan"},{"first_name":"Shaoting","full_name":"Ren, Shaoting","last_name":"Ren"},{"full_name":"Kneib, Marin","last_name":"Kneib","first_name":"Marin"},{"first_name":"Achille","last_name":"Jouberton","full_name":"Jouberton, Achille"},{"full_name":"Steiner, Jakob","last_name":"Steiner","first_name":"Jakob"},{"last_name":"Fujita","full_name":"Fujita, Koji","first_name":"Koji"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca","orcid":"0000-0002-5554-8087"}],"article_processing_charge":"Yes (via OA deal)","article_number":"e2022WR033841"},{"department":[{"_id":"GradSch"}],"file_date_updated":"2023-11-06T11:45:21Z","date_updated":"2023-11-07T07:48:01Z","ddc":["000"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"DISC: Symposium on Distributed Computing","location":"L'Aquila, Italy","end_date":"2023-10-13","start_date":"2023-10-09"},"type":"conference","status":"public","_id":"14485","volume":281,"publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773010"]},"language":[{"iso":"eng"}],"file":[{"file_size":646665,"date_updated":"2023-11-06T11:45:21Z","creator":"dernst","file_name":"2023_LIPIcs_Aksenov.pdf","date_created":"2023-11-06T11:45:21Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"d9f8d2915cccdf2df5905b7cd1b4a560","file_id":"14492"}],"scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 281","month":"10","abstract":[{"text":"Batching is a technique that stores multiple keys/values in each node of a data structure. In sequential search data structures, batching reduces latency by reducing the number of cache misses and shortening the chain of pointers to dereference. Applying batching to concurrent data structures is challenging, because it is difficult to maintain the search property and keep contention low in the presence of batching.\r\nIn this paper, we present a general methodology for leveraging batching in concurrent search data structures, called BatchBoost. BatchBoost builds a search data structure from distinct \"data\" and \"index\" layers. The data layer’s purpose is to store a batch of key/value pairs in each of its nodes. The index layer uses an unmodified concurrent search data structure to route operations to a position in the data layer that is \"close\" to where the corresponding key should exist. The requirements on the index and data layers are low: with minimal effort, we were able to compose three highly scalable concurrent search data structures based on three original data structures as the index layers with a batched version of the Lazy List as the data layer. The resulting BatchBoost data structures provide significant performance improvements over their original counterparts.","lang":"eng"}],"oa_version":"Published Version","article_processing_charge":"Yes","author":[{"first_name":"Vitaly","full_name":"Aksenov, Vitaly","last_name":"Aksenov"},{"first_name":"Michael","last_name":"Anoprenko","full_name":"Anoprenko, Michael"},{"full_name":"Fedorov, Alexander","last_name":"Fedorov","first_name":"Alexander","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6"},{"full_name":"Spear, Michael","last_name":"Spear","first_name":"Michael"}],"title":"Brief announcement: BatchBoost: Universal batching for concurrent data structures","citation":{"short":"V. Aksenov, M. Anoprenko, A. Fedorov, M. Spear, in:, 37th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"V. Aksenov, M. Anoprenko, A. Fedorov, and M. Spear, “Brief announcement: BatchBoost: Universal batching for concurrent data structures,” in 37th International Symposium on Distributed Computing, L’Aquila, Italy, 2023, vol. 281.","apa":"Aksenov, V., Anoprenko, M., Fedorov, A., & Spear, M. (2023). Brief announcement: BatchBoost: Universal batching for concurrent data structures. In 37th International Symposium on Distributed Computing (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2023.35","ama":"Aksenov V, Anoprenko M, Fedorov A, Spear M. Brief announcement: BatchBoost: Universal batching for concurrent data structures. In: 37th International Symposium on Distributed Computing. Vol 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.DISC.2023.35","mla":"Aksenov, Vitaly, et al. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.” 37th International Symposium on Distributed Computing, vol. 281, 35, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.DISC.2023.35.","ista":"Aksenov V, Anoprenko M, Fedorov A, Spear M. 2023. Brief announcement: BatchBoost: Universal batching for concurrent data structures. 37th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 281, 35.","chicago":"Aksenov, Vitaly, Michael Anoprenko, Alexander Fedorov, and Michael Spear. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.” In 37th International Symposium on Distributed Computing, Vol. 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.DISC.2023.35."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"35","date_created":"2023-11-05T23:00:53Z","doi":"10.4230/LIPIcs.DISC.2023.35","date_published":"2023-10-01T00:00:00Z","year":"2023","has_accepted_license":"1","publication":"37th International Symposium on Distributed Computing","day":"01","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1"},{"acknowledgement":"We thank Zh. Alpichshev, A. Volosniev, and A. V. Zampetaki for fruitful discussions and comments. This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).","quality_controlled":"1","publisher":"American Physical Society","oa":1,"has_accepted_license":"1","year":"2023","day":"05","publication":"Physical Review Research","doi":"10.1103/PhysRevResearch.5.043016","date_published":"2023-10-05T00:00:00Z","date_created":"2023-11-05T23:00:53Z","article_number":"043016","project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"},{"grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"G. Koutentakis, A. Ghazaryan, M. Lemeshko, Physical Review Research 5 (2023).","ieee":"G. Koutentakis, A. Ghazaryan, and M. Lemeshko, “Rotor lattice model of ferroelectric large polarons,” Physical Review Research, vol. 5, no. 4. American Physical Society, 2023.","ama":"Koutentakis G, Ghazaryan A, Lemeshko M. Rotor lattice model of ferroelectric large polarons. Physical Review Research. 2023;5(4). doi:10.1103/PhysRevResearch.5.043016","apa":"Koutentakis, G., Ghazaryan, A., & Lemeshko, M. (2023). Rotor lattice model of ferroelectric large polarons. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.5.043016","mla":"Koutentakis, Georgios, et al. “Rotor Lattice Model of Ferroelectric Large Polarons.” Physical Review Research, vol. 5, no. 4, 043016, American Physical Society, 2023, doi:10.1103/PhysRevResearch.5.043016.","ista":"Koutentakis G, Ghazaryan A, Lemeshko M. 2023. Rotor lattice model of ferroelectric large polarons. Physical Review Research. 5(4), 043016.","chicago":"Koutentakis, Georgios, Areg Ghazaryan, and Mikhail Lemeshko. “Rotor Lattice Model of Ferroelectric Large Polarons.” Physical Review Research. American Physical Society, 2023. https://doi.org/10.1103/PhysRevResearch.5.043016."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"d7b23d3a-9e21-11ec-b482-f76739596b95","first_name":"Georgios","last_name":"Koutentakis","full_name":"Koutentakis, Georgios"},{"last_name":"Ghazaryan","orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"}],"external_id":{"arxiv":["2301.09875"]},"article_processing_charge":"Yes","title":"Rotor lattice model of ferroelectric large polarons","abstract":[{"text":"We present a minimal model of ferroelectric large polarons, which are suggested as one of the mechanisms responsible for the unique charge transport properties of hybrid perovskites. We demonstrate that short-ranged charge–rotor interactions lead to long-range ferroelectric ordering of rotors, which strongly affects the carrier mobility. In the nonperturbative regime, where our theory cannot be reduced to any of the earlier models, we reveal that the polaron is characterized by large coherence length and a roughly tenfold increase of the effective mass as compared to the bare mass. These results are in good agreement with other theoretical predictions for ferroelectric polarons. Our model establishes a general phenomenological framework for ferroelectric polarons providing the starting point for future studies of their role in the transport properties of hybrid organic-inorganic perovskites.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"10","intvolume":" 5","publication_identifier":{"issn":["2643-1564"]},"publication_status":"published","file":[{"date_updated":"2023-11-07T07:52:46Z","file_size":1127522,"creator":"dernst","date_created":"2023-11-07T07:52:46Z","file_name":"2023_PhysReviewResearch_Koutentakis.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"14493","checksum":"cb8de8fed6e09df1a18bd5a5aec5c55c","success":1}],"language":[{"iso":"eng"}],"issue":"4","volume":5,"ec_funded":1,"_id":"14486","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","date_updated":"2023-11-07T07:53:39Z","ddc":["530"],"department":[{"_id":"MiLe"}],"file_date_updated":"2023-11-07T07:52:46Z"},{"article_processing_charge":"No","external_id":{"pmid":["37666097"]},"author":[{"full_name":"Fiedler, Lukas","last_name":"Fiedler","first_name":"Lukas","id":"7c417475-8972-11ed-ae7b-8b674ca26986"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","last_name":"Friml","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596"}],"title":"Rapid auxin signaling: Unknowns old and new","citation":{"ista":"Fiedler L, Friml J. 2023. Rapid auxin signaling: Unknowns old and new. Current Opinion in Plant Biology. 75(10), 102443.","chicago":"Fiedler, Lukas, and Jiří Friml. “Rapid Auxin Signaling: Unknowns Old and New.” Current Opinion in Plant Biology. Elsevier, 2023. https://doi.org/10.1016/j.pbi.2023.102443.","ieee":"L. Fiedler and J. Friml, “Rapid auxin signaling: Unknowns old and new,” Current Opinion in Plant Biology, vol. 75, no. 10. Elsevier, 2023.","short":"L. Fiedler, J. Friml, Current Opinion in Plant Biology 75 (2023).","ama":"Fiedler L, Friml J. Rapid auxin signaling: Unknowns old and new. Current Opinion in Plant Biology. 2023;75(10). doi:10.1016/j.pbi.2023.102443","apa":"Fiedler, L., & Friml, J. (2023). Rapid auxin signaling: Unknowns old and new. Current Opinion in Plant Biology. Elsevier. https://doi.org/10.1016/j.pbi.2023.102443","mla":"Fiedler, Lukas, and Jiří Friml. “Rapid Auxin Signaling: Unknowns Old and New.” Current Opinion in Plant Biology, vol. 75, no. 10, 102443, Elsevier, 2023, doi:10.1016/j.pbi.2023.102443."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"102443","date_created":"2023-09-10T22:01:11Z","date_published":"2023-10-01T00:00:00Z","doi":"10.1016/j.pbi.2023.102443","year":"2023","has_accepted_license":"1","publication":"Current Opinion in Plant Biology","day":"01","oa":1,"publisher":"Elsevier","quality_controlled":"1","acknowledgement":"The opening quote is not intended to reflect any political views of the authors. The authors by no means endorse the rhetoric of Donald Rumsfeld or the 2003 invasion of Iraq by the United States. Nevertheless, Rumsfeld's quote led to both public and academic debates on the concept of known and unknown unknowns, which can be applied to the recent unexpected developments in the auxin signaling field. We thank Linlin Qi and Huihuang Chen for their suggestions on figure presentation and inspiring discussions of TIR1/AFB signaling. Finally, we thank Aroosa Hussain for discussion of Greek mythology.","file_date_updated":"2023-11-02T17:03:20Z","department":[{"_id":"JiFr"}],"date_updated":"2023-11-07T08:17:13Z","ddc":["580"],"type":"journal_article","article_type":"review","status":"public","_id":"14313","volume":75,"issue":"10","publication_status":"published","publication_identifier":{"issn":["1369-5266"]},"language":[{"iso":"eng"}],"file":[{"success":1,"checksum":"1c476c3414d2dfb0c85db0cb6cfd8a28","file_id":"14482","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"Fiedler CurrOpinOlantBiol 2023_revised.pdf","date_created":"2023-11-02T17:03:20Z","creator":"amally","file_size":737872,"date_updated":"2023-11-02T17:03:20Z"}],"scopus_import":"1","intvolume":" 75","month":"10","abstract":[{"lang":"eng","text":"To respond to auxin, the chief orchestrator of their multicellularity, plants evolved multiple receptor systems and signal transduction cascades. Despite decades of research, however, we are still lacking a satisfactory synthesis of various auxin signaling mechanisms. The chief discrepancy and historical controversy of the field is that of rapid and slow auxin effects on plant physiology and development. How is it possible that ions begin to trickle across the plasma membrane as soon as auxin enters the cell, even though the best-characterized transcriptional auxin pathway can take effect only after tens of minutes? Recently, unexpected progress has been made in understanding this and other unknowns of auxin signaling. We provide a perspective on these exciting developments and concepts whose general applicability might have ramifications beyond auxin signaling."}],"pmid":1,"oa_version":"Submitted Version"},{"day":"03","has_accepted_license":"1","year":"2023","doi":"10.5281/ZENODO.8402426","date_published":"2023-10-03T00:00:00Z","related_material":{"record":[{"relation":"used_in_publication","id":"14487","status":"public"}]},"license":"https://creativecommons.org/publicdomain/zero/1.0/","date_created":"2023-11-07T08:01:39Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We provide i) gridded initial conditions (.tif), ii) modeled gridded monthly outputs (.tif), and iii) modeled hourly outputs at the station locations (.txt) for the hydrological year 2019. Information about the variables and units can be found in the figures (.png) associated to each dataset. Details about the datasets can be found in the original publication by Buri and others (2023).\r\n\r\nBuri, P., Fatichi, S., Shaw, T. E., Miles, E. S., McCarthy, M. J., Fyffe, C. L., ... & Pellicciotti, F. (2023). Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High‐Elevation Catchment. Water Resources Research, 59(10), e2022WR033841. DOI: 10.1029/2022WR033841"}],"month":"10","publisher":"Zenodo","oa":1,"main_file_link":[{"url":"https://10.5281/ZENODO.8402426","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["550"],"citation":{"ieee":"P. Buri et al., “Model output data to ‘Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment.’” Zenodo, 2023.","short":"P. Buri, S. Fatichi, T. Shaw, E. Miles, M. McCarthy, C.L. Fyffe, S. Fugger, S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, (2023).","apa":"Buri, P., Fatichi, S., Shaw, T., Miles, E., McCarthy, M., Fyffe, C. L., … Pellicciotti, F. (2023). Model output data to “Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment.” Zenodo. https://doi.org/10.5281/ZENODO.8402426","ama":"Buri P, Fatichi S, Shaw T, et al. Model output data to “Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment.” 2023. doi:10.5281/ZENODO.8402426","mla":"Buri, Pascal, et al. Model Output Data to “Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High Elevation Catchment.” Zenodo, 2023, doi:10.5281/ZENODO.8402426.","ista":"Buri P, Fatichi S, Shaw T, Miles E, McCarthy M, Fyffe CL, Fugger S, Ren S, Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Model output data to ‘Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment’, Zenodo, 10.5281/ZENODO.8402426.","chicago":"Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan Miles, Michael McCarthy, Catriona Louise Fyffe, Stefan Fugger, et al. “Model Output Data to ‘Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High Elevation Catchment.’” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8402426."},"date_updated":"2023-11-07T08:12:35Z","department":[{"_id":"FrPe"}],"title":"Model output data to \"Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment\"","author":[{"full_name":"Buri, Pascal","last_name":"Buri","first_name":"Pascal"},{"first_name":"Simone","last_name":"Fatichi","full_name":"Fatichi, Simone"},{"last_name":"Shaw","full_name":"Shaw, Thomas","id":"3caa3f91-1f03-11ee-96ce-e0e553054d6e","first_name":"Thomas"},{"first_name":"Evan ","full_name":"Miles, Evan ","last_name":"Miles"},{"full_name":"McCarthy, Michael","last_name":"McCarthy","id":"22a2674a-61ce-11ee-94b5-d18813baf16f","first_name":"Michael"},{"first_name":"Catriona Louise","id":"001b0422-8d15-11ed-bc51-cab6c037a228","full_name":"Fyffe, Catriona Louise","last_name":"Fyffe"},{"last_name":"Fugger","full_name":"Fugger, Stefan","first_name":"Stefan"},{"full_name":"Ren, Shaoting","last_name":"Ren","first_name":"Shaoting"},{"last_name":"Kneib","full_name":"Kneib, Marin","first_name":"Marin"},{"full_name":"Jouberton, Achille","last_name":"Jouberton","first_name":"Achille"},{"full_name":"Steiner, Jakob","last_name":"Steiner","first_name":"Jakob"},{"first_name":"Koji","full_name":"Fujita, Koji","last_name":"Fujita"},{"orcid":"0000-0002-5554-8087","full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"}],"article_processing_charge":"No","_id":"14494","status":"public","type":"research_data_reference","tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"}},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","keyword":["Discrete Mathematics and Combinatorics","Geometry and Topology","Mathematical Physics","Statistics and Probability","Algebra and Number Theory","Analysis"],"status":"public","_id":"14499","file_date_updated":"2023-11-07T09:16:23Z","department":[{"_id":"MaKw"}],"date_updated":"2023-11-07T09:18:57Z","ddc":["510"],"scopus_import":"1","intvolume":" 11","month":"08","abstract":[{"text":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge statistics in Ramsey graphs, in particular obtaining very precise control of the distribution of the number of edges in a random vertex subset of a C-Ramsey graph. This brings together two ongoing lines of research: the study of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability for low-degree polynomials of independent random variables.\r\n\r\nThe proof proceeds via an ‘additive structure’ dichotomy on the degree sequence and involves a wide range of different tools from Fourier analysis, random matrix theory, the theory of Boolean functions, probabilistic combinatorics and low-rank approximation. In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright theorem on small-ball probability for polynomials of Gaussians, which we believe is of independent interest. One of the consequences of our result is the resolution of an old conjecture of Erdős and McKay, for which Erdős reiterated in several of his open problem collections and for which he offered one of his notorious monetary prizes.","lang":"eng"}],"oa_version":"Published Version","volume":11,"publication_status":"published","publication_identifier":{"issn":["2050-5086"]},"language":[{"iso":"eng"}],"file":[{"file_id":"14500","checksum":"54b824098d59073cc87a308d458b0a3e","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-11-07T09:16:23Z","file_name":"2023_ForumMathematics_Kwan.pdf","date_updated":"2023-11-07T09:16:23Z","file_size":1218719,"creator":"dernst"}],"project":[{"grant_number":"101076777","name":"Randomness and structure in combinatorics","_id":"bd95085b-d553-11ed-ba76-e55d3349be45"}],"article_number":"e21","article_processing_charge":"Yes","external_id":{"arxiv":["2208.02874"]},"author":[{"last_name":"Kwan","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"first_name":"Ashwin","full_name":"Sah, Ashwin","last_name":"Sah"},{"first_name":"Lisa","full_name":"Sauermann, Lisa","last_name":"Sauermann"},{"full_name":"Sawhney, Mehtaab","last_name":"Sawhney","first_name":"Mehtaab"}],"title":"Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture","citation":{"chicago":"Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi. Cambridge University Press, 2023. https://doi.org/10.1017/fmp.2023.17.","ista":"Kwan MA, Sah A, Sauermann L, Sawhney M. 2023. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 11, e21.","mla":"Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi, vol. 11, e21, Cambridge University Press, 2023, doi:10.1017/fmp.2023.17.","ama":"Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 2023;11. doi:10.1017/fmp.2023.17","apa":"Kwan, M. A., Sah, A., Sauermann, L., & Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. Cambridge University Press. https://doi.org/10.1017/fmp.2023.17","ieee":"M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture,” Forum of Mathematics, Pi, vol. 11. Cambridge University Press, 2023.","short":"M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11 (2023)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Cambridge University Press","quality_controlled":"1","acknowledgement":"Kwan was supported for part of this work by ERC Starting Grant ‘RANDSTRUCT’ No. 101076777. Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-2141064. Sah was supported by the PD Soros Fellowship. Sauermann was supported by NSF Award DMS-2100157, and for part of this work by a Sloan Research Fellowship.","date_created":"2023-11-07T09:02:48Z","date_published":"2023-08-24T00:00:00Z","doi":"10.1017/fmp.2023.17","year":"2023","has_accepted_license":"1","publication":"Forum of Mathematics, Pi","day":"24"},{"main_file_link":[{"url":"https://doi.org/10.1101/2023.03.14.532666","open_access":"1"}],"oa":1,"month":"03","abstract":[{"text":"Growth factors and cytokines signal by binding to the extracellular domains of their receptors and drive association and transphosphorylation of the receptor intracellular tyrosine kinase domains, initiating downstream signaling cascades. To enable systematic exploration of how receptor valency and geometry affects signaling outcomes, we designed cyclic homo-oligomers with up to 8 subunits using repeat protein building blocks that can be modularly extended. By incorporating a de novo designed fibroblast growth-factor receptor (FGFR) binding module into these scaffolds, we generated a series of synthetic signaling ligands that exhibit potent valency- and geometry-dependent Ca2+ release and MAPK pathway activation. The high specificity of the designed agonists reveal distinct roles for two FGFR splice variants in driving endothelial and mesenchymal cell fates during early vascular development. The ability to incorporate receptor binding domains and repeat extensions in a modular fashion makes our designed scaffolds broadly useful for probing and manipulating cellular signaling pathways.","lang":"eng"}],"oa_version":"Preprint","date_published":"2023-03-15T00:00:00Z","doi":"10.1101/2023.03.14.532666","date_created":"2023-09-06T12:31:49Z","publication_status":"submitted","year":"2023","day":"15","publication":"bioRxiv","language":[{"iso":"eng"}],"type":"preprint","status":"public","_id":"14294","author":[{"first_name":"Natasha I","full_name":"Edman, Natasha I","last_name":"Edman"},{"first_name":"Rachel L","full_name":"Redler, Rachel L","last_name":"Redler"},{"full_name":"Phal, Ashish","last_name":"Phal","first_name":"Ashish"},{"last_name":"Schlichthaerle","full_name":"Schlichthaerle, Thomas","first_name":"Thomas"},{"first_name":"Sanjay R","last_name":"Srivatsan","full_name":"Srivatsan, Sanjay R"},{"first_name":"Ali","full_name":"Etemadi, Ali","last_name":"Etemadi"},{"full_name":"An, Seong","last_name":"An","first_name":"Seong"},{"last_name":"Favor","full_name":"Favor, Andrew","first_name":"Andrew"},{"first_name":"Devon","full_name":"Ehnes, Devon","last_name":"Ehnes"},{"full_name":"Li, Zhe","last_name":"Li","first_name":"Zhe"},{"first_name":"Florian M","id":"dfec9381-4341-11ee-8fd8-faa02bba7d62","full_name":"Praetorius, Florian M","last_name":"Praetorius"},{"first_name":"Max","full_name":"Gordon, Max","last_name":"Gordon"},{"full_name":"Yang, Wei","last_name":"Yang","first_name":"Wei"},{"first_name":"Brian","full_name":"Coventry, Brian","last_name":"Coventry"},{"first_name":"Derrick R","full_name":"Hicks, Derrick R","last_name":"Hicks"},{"first_name":"Longxing","last_name":"Cao","full_name":"Cao, Longxing"},{"full_name":"Bethel, Neville","last_name":"Bethel","first_name":"Neville"},{"full_name":"Heine, Piper","last_name":"Heine","first_name":"Piper"},{"first_name":"Analisa N","full_name":"Murray, Analisa N","last_name":"Murray"},{"first_name":"Stacey","last_name":"Gerben","full_name":"Gerben, Stacey"},{"last_name":"Carter","full_name":"Carter, Lauren","first_name":"Lauren"},{"full_name":"Miranda, Marcos","last_name":"Miranda","first_name":"Marcos"},{"first_name":"Babak","last_name":"Negahdari","full_name":"Negahdari, Babak"},{"last_name":"Lee","full_name":"Lee, Sangwon","first_name":"Sangwon"},{"first_name":"Cole","last_name":"Trapnell","full_name":"Trapnell, Cole"},{"first_name":"Lance","full_name":"Stewart, Lance","last_name":"Stewart"},{"first_name":"Damian C","last_name":"Ekiert","full_name":"Ekiert, Damian C"},{"full_name":"Schlessinger, Joseph","last_name":"Schlessinger","first_name":"Joseph"},{"last_name":"Shendure","full_name":"Shendure, Jay","first_name":"Jay"},{"last_name":"Bhabha","full_name":"Bhabha, Gira","first_name":"Gira"},{"first_name":"Hannele","full_name":"Ruohola-Baker, Hannele","last_name":"Ruohola-Baker"},{"full_name":"Baker, David","last_name":"Baker","first_name":"David"}],"article_processing_charge":"No","title":"Modulation of FGF pathway signaling and vascular differentiation using designed oligomeric assemblies","date_updated":"2023-11-07T12:21:58Z","citation":{"mla":"Edman, Natasha I., et al. “Modulation of FGF Pathway Signaling and Vascular Differentiation Using Designed Oligomeric Assemblies.” BioRxiv, doi:10.1101/2023.03.14.532666.","apa":"Edman, N. I., Redler, R. L., Phal, A., Schlichthaerle, T., Srivatsan, S. R., Etemadi, A., … Baker, D. (n.d.). Modulation of FGF pathway signaling and vascular differentiation using designed oligomeric assemblies. bioRxiv. https://doi.org/10.1101/2023.03.14.532666","ama":"Edman NI, Redler RL, Phal A, et al. Modulation of FGF pathway signaling and vascular differentiation using designed oligomeric assemblies. bioRxiv. doi:10.1101/2023.03.14.532666","ieee":"N. I. Edman et al., “Modulation of FGF pathway signaling and vascular differentiation using designed oligomeric assemblies,” bioRxiv. .","short":"N.I. Edman, R.L. Redler, A. Phal, T. Schlichthaerle, S.R. Srivatsan, A. Etemadi, S. An, A. Favor, D. Ehnes, Z. Li, F.M. Praetorius, M. Gordon, W. Yang, B. Coventry, D.R. Hicks, L. Cao, N. Bethel, P. Heine, A.N. Murray, S. Gerben, L. Carter, M. Miranda, B. Negahdari, S. Lee, C. Trapnell, L. Stewart, D.C. Ekiert, J. Schlessinger, J. Shendure, G. Bhabha, H. Ruohola-Baker, D. Baker, BioRxiv (n.d.).","chicago":"Edman, Natasha I, Rachel L Redler, Ashish Phal, Thomas Schlichthaerle, Sanjay R Srivatsan, Ali Etemadi, Seong An, et al. “Modulation of FGF Pathway Signaling and Vascular Differentiation Using Designed Oligomeric Assemblies.” BioRxiv, n.d. https://doi.org/10.1101/2023.03.14.532666.","ista":"Edman NI, Redler RL, Phal A, Schlichthaerle T, Srivatsan SR, Etemadi A, An S, Favor A, Ehnes D, Li Z, Praetorius FM, Gordon M, Yang W, Coventry B, Hicks DR, Cao L, Bethel N, Heine P, Murray AN, Gerben S, Carter L, Miranda M, Negahdari B, Lee S, Trapnell C, Stewart L, Ekiert DC, Schlessinger J, Shendure J, Bhabha G, Ruohola-Baker H, Baker D. Modulation of FGF pathway signaling and vascular differentiation using designed oligomeric assemblies. bioRxiv, 10.1101/2023.03.14.532666."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"department":[{"_id":"MiLe"}],"date_updated":"2023-11-13T08:01:57Z","status":"public","article_type":"original","type":"journal_article","_id":"14513","ec_funded":1,"volume":1042,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0370-1573"]},"intvolume":" 1042","month":"11","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2202.11071"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Cold atomic gases have become a paradigmatic system for exploring fundamental physics, which at the same time allows for applications in quantum technologies. The accelerating developments in the field have led to a highly advanced set of engineering techniques that, for example, can tune interactions, shape the external geometry, select among a large set of atomic species with different properties, or control the number of atoms. In particular, it is possible to operate in lower dimensions and drive atomic systems into the strongly correlated regime. In this review, we discuss recent advances in few-body cold atom systems confined in low dimensions from a theoretical viewpoint. We mainly focus on bosonic systems in one dimension and provide an introduction to the static properties before we review the state-of-the-art research into quantum dynamical processes stimulated by the presence of correlations. Besides discussing the fundamental physical phenomena arising in these systems, we also provide an overview of the calculational and numerical tools and methods that are commonly used, thus delivering a balanced and comprehensive overview of the field. We conclude by giving an outlook on possible future directions that are interesting to explore in these correlated systems."}],"title":"Few-body Bose gases in low dimensions - A laboratory for quantum dynamics","external_id":{"arxiv":["2202.11071"]},"article_processing_charge":"No","author":[{"last_name":"Mistakidis","full_name":"Mistakidis, S. I.","first_name":"S. I."},{"full_name":"Volosniev, Artem","orcid":"0000-0003-0393-5525","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem"},{"first_name":"R. E.","last_name":"Barfknecht","full_name":"Barfknecht, R. E."},{"last_name":"Fogarty","full_name":"Fogarty, T.","first_name":"T."},{"first_name":"Th","full_name":"Busch, Th","last_name":"Busch"},{"first_name":"A.","last_name":"Foerster","full_name":"Foerster, A."},{"full_name":"Schmelcher, P.","last_name":"Schmelcher","first_name":"P."},{"first_name":"N. T.","last_name":"Zinner","full_name":"Zinner, N. T."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Mistakidis, S. I., Artem Volosniev, R. E. Barfknecht, T. Fogarty, Th Busch, A. Foerster, P. Schmelcher, and N. T. Zinner. “Few-Body Bose Gases in Low Dimensions - A Laboratory for Quantum Dynamics.” Physics Reports. Elsevier, 2023. https://doi.org/10.1016/j.physrep.2023.10.004.","ista":"Mistakidis SI, Volosniev A, Barfknecht RE, Fogarty T, Busch T, Foerster A, Schmelcher P, Zinner NT. 2023. Few-body Bose gases in low dimensions - A laboratory for quantum dynamics. Physics Reports. 1042, 1–108.","mla":"Mistakidis, S. I., et al. “Few-Body Bose Gases in Low Dimensions - A Laboratory for Quantum Dynamics.” Physics Reports, vol. 1042, Elsevier, 2023, pp. 1–108, doi:10.1016/j.physrep.2023.10.004.","apa":"Mistakidis, S. I., Volosniev, A., Barfknecht, R. E., Fogarty, T., Busch, T., Foerster, A., … Zinner, N. T. (2023). Few-body Bose gases in low dimensions - A laboratory for quantum dynamics. Physics Reports. Elsevier. https://doi.org/10.1016/j.physrep.2023.10.004","ama":"Mistakidis SI, Volosniev A, Barfknecht RE, et al. Few-body Bose gases in low dimensions - A laboratory for quantum dynamics. Physics Reports. 2023;1042:1-108. doi:10.1016/j.physrep.2023.10.004","short":"S.I. Mistakidis, A. Volosniev, R.E. Barfknecht, T. Fogarty, T. Busch, A. Foerster, P. Schmelcher, N.T. Zinner, Physics Reports 1042 (2023) 1–108.","ieee":"S. I. Mistakidis et al., “Few-body Bose gases in low dimensions - A laboratory for quantum dynamics,” Physics Reports, vol. 1042. Elsevier, pp. 1–108, 2023."},"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"date_created":"2023-11-12T23:00:54Z","doi":"10.1016/j.physrep.2023.10.004","date_published":"2023-11-29T00:00:00Z","page":"1-108","publication":"Physics Reports","day":"29","year":"2023","oa":1,"quality_controlled":"1","publisher":"Elsevier","acknowledgement":"This review could not have been written without the many fruitful discussions and great collaborations with colleagues throughout the years, there are too many to mention. Here we acknowledge conversations regarding the context of the review with Joachim Brand, Fabian Brauneis, Adolfo del Campo, Alberto Cappellaro, Panagiotis Giannakeas, Tommaso Macrí, Oleksandr Marchukov, Lukas Rammelmüller and Manuel Valiente. S. I. M. acknowledges support from the NSF through a grant for ITAMP at Harvard University. T.F. acknowledges support from JSPS KAKENHI Grant Number JP23K03290 and T.F. and Th.B. acknowledge support from the Okinawa Institute for Science and Technology Graduate University, and JST Grant Number JPMJPF2221. A.F. and R. E. B. acknowledge support from CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico) - Edital Universal 406563/2021-7. A. G. V. acknowledges support by European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. P. S. is supported by the Cluster of Excellence ‘Advanced Imaging of Matter’ of the Deutsche Forschungsgemeinschaft (DFG) - EXC2056 - project ID 390715994. N. T. Z. is partially supported by the Independent Research Fund Denmark ."},{"_id":"12869","tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"type":"research_data","status":"public","date_updated":"2023-11-13T07:47:29Z","citation":{"chicago":"Klausen, Frederik Ravn, and Asbjørn Bækgaard Lauritsen. “Research Data for: A Stochastic Cellular Automaton Model of Culture Formation.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:12869.","ista":"Klausen FR, Lauritsen AB. 2023. Research data for: A stochastic cellular automaton model of culture formation, Institute of Science and Technology Austria, 10.15479/AT:ISTA:12869.","mla":"Klausen, Frederik Ravn, and Asbjørn Bækgaard Lauritsen. Research Data for: A Stochastic Cellular Automaton Model of Culture Formation. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12869.","short":"F.R. Klausen, A.B. Lauritsen, (2023).","ieee":"F. R. Klausen and A. B. Lauritsen, “Research data for: A stochastic cellular automaton model of culture formation.” Institute of Science and Technology Austria, 2023.","apa":"Klausen, F. R., & Lauritsen, A. B. (2023). Research data for: A stochastic cellular automaton model of culture formation. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12869","ama":"Klausen FR, Lauritsen AB. Research data for: A stochastic cellular automaton model of culture formation. 2023. doi:10.15479/AT:ISTA:12869"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"article_processing_charge":"No","author":[{"last_name":"Klausen","full_name":"Klausen, Frederik Ravn","first_name":"Frederik Ravn"},{"last_name":"Lauritsen","full_name":"Lauritsen, Asbjørn Bækgaard","orcid":"0000-0003-4476-2288","first_name":"Asbjørn Bækgaard","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1"}],"title":"Research data for: A stochastic cellular automaton model of culture formation","file_date_updated":"2023-04-26T12:30:06Z","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"abstract":[{"lang":"eng","text":"We introduce a stochastic cellular automaton as a model for culture and border formation. The model can be conceptualized as a game where the expansion rate of cultures is quantified in terms of their area and perimeter in such a way that approximately round cultures get a competitive advantage. We first analyse the model with periodic boundary conditions, where we study how the model can end up in a fixed state, i.e. freezes. Then we implement the model on the European geography with mountains and rivers. We see how the model reproduces some qualitative features of European culture formation, namely that rivers and mountains are more frequently borders between cultures, mountainous regions tend to have higher cultural diversity and the central European plain has less clear cultural borders. "}],"acknowledgement":"FRK acknowledges support from the Villum Foundation for support through the QMATH center of Excellence (Grant No. 10059) and the Villum Young Investigator (Grant No. 25452) programs. ","oa_version":"Published Version","oa":1,"publisher":"Institute of Science and Technology Austria","month":"04","year":"2023","has_accepted_license":"1","day":"26","file":[{"date_updated":"2023-04-26T12:30:06Z","file_size":4567,"creator":"alaurits","date_created":"2023-04-26T12:30:06Z","file_name":"README.md","content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","file_id":"12870","checksum":"85ede12d38bb8d944022a8cba4d719f5","success":1},{"file_id":"12871","checksum":"25bf79452ae895f9c8a20571a096b4c3","success":1,"content_type":"application/x-zip-compressed","access_level":"open_access","relation":"main_file","date_created":"2023-04-26T12:27:34Z","file_name":"simulations_era=10_flux_varied_europe.zip","date_updated":"2023-04-26T12:27:34Z","file_size":732586731,"creator":"alaurits"},{"date_created":"2023-04-26T12:29:53Z","file_name":"simulations_era=10_flux_varied_torus.zip","date_updated":"2023-04-26T12:29:53Z","file_size":1743893150,"creator":"alaurits","file_id":"12872","checksum":"bca48d80ece73eb169aee7211a4a751a","success":1,"content_type":"application/x-zip-compressed","access_level":"open_access","relation":"main_file"},{"file_name":"simulations_era=10_R_varied_torus.zip","date_created":"2023-04-26T12:29:19Z","file_size":878391851,"date_updated":"2023-04-26T12:29:19Z","creator":"alaurits","success":1,"file_id":"12873","checksum":"e77a655db15486a387a36362fbf0b665","content_type":"application/x-zip-compressed","relation":"main_file","access_level":"open_access"},{"relation":"main_file","access_level":"open_access","content_type":"application/x-zip-compressed","success":1,"checksum":"8556406513adc4aa2e0417f46680f627","file_id":"12874","creator":"alaurits","file_size":201652478,"date_updated":"2023-04-26T12:30:05Z","file_name":"simulations_era=100.zip","date_created":"2023-04-26T12:30:05Z"}],"date_created":"2023-04-26T12:34:49Z","related_material":{"record":[{"relation":"used_in_publication","id":"14505","status":"for_moderation"},{"id":"12890","status":"public","relation":"used_in_publication"}]},"doi":"10.15479/AT:ISTA:12869","date_published":"2023-04-26T00:00:00Z"},{"acknowledgement":"Thanks to Kim Sneppen, Svend Krøjer, Peter Wildemann, Peter Rasmussen and Kent Bækgaard Lauritsen for discussions and suggestions. FRK acknowledges support from the Villum Foundation for support through the QMATH center of Excellence (Grant No. 10059) and the Villum Young Investigator (Grant No. 25452) programs.","oa":1,"quality_controlled":"1","publisher":"American Physical Society","publication":"Physical Review E","day":"08","year":"2023","date_created":"2023-05-04T08:35:01Z","date_published":"2023-11-08T00:00:00Z","doi":"10.1103/PhysRevE.108.054307","article_number":"054307","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Klausen, Frederik Ravn, and Asbjørn Bækgaard Lauritsen. “Stochastic Cellular Automaton Model of Culture Formation.” Physical Review E, vol. 108, no. 5, 054307, American Physical Society, 2023, doi:10.1103/PhysRevE.108.054307.","short":"F.R. Klausen, A.B. Lauritsen, Physical Review E 108 (2023).","ieee":"F. R. Klausen and A. B. Lauritsen, “Stochastic cellular automaton model of culture formation,” Physical Review E, vol. 108, no. 5. American Physical Society, 2023.","ama":"Klausen FR, Lauritsen AB. Stochastic cellular automaton model of culture formation. Physical Review E. 2023;108(5). doi:10.1103/PhysRevE.108.054307","apa":"Klausen, F. R., & Lauritsen, A. B. (2023). Stochastic cellular automaton model of culture formation. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.108.054307","chicago":"Klausen, Frederik Ravn, and Asbjørn Bækgaard Lauritsen. “Stochastic Cellular Automaton Model of Culture Formation.” Physical Review E. American Physical Society, 2023. https://doi.org/10.1103/PhysRevE.108.054307.","ista":"Klausen FR, Lauritsen AB. 2023. Stochastic cellular automaton model of culture formation. Physical Review E. 108(5), 054307."},"title":"Stochastic cellular automaton model of culture formation","external_id":{"arxiv":["2305.02153"]},"article_processing_charge":"No","author":[{"first_name":"Frederik Ravn","last_name":"Klausen","full_name":"Klausen, Frederik Ravn"},{"first_name":"Asbjørn Bækgaard","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","orcid":"0000-0003-4476-2288","full_name":"Lauritsen, Asbjørn Bækgaard","last_name":"Lauritsen"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We introduce a stochastic cellular automaton as a model for culture and border formation. The model can be conceptualized as a game where the expansion rate of cultures is quantified in terms of their area and perimeter in such a way that approximately geometrically round cultures get a competitive advantage. We first analyze the model with periodic boundary conditions, where we study how the model can end up in a fixed state, i.e., freezes. Then we implement the model on the European geography with mountains and rivers. We see how the model reproduces some qualitative features of European culture formation, namely, that rivers and mountains are more frequently borders between cultures, mountainous regions tend to have higher cultural diversity, and the central European plain has less clear cultural borders."}],"intvolume":" 108","month":"11","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2305.02153"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2470-0053"],"issn":["2470-0045"]},"issue":"5","related_material":{"record":[{"status":"public","id":"12869","relation":"research_data"}],"link":[{"url":"https://github.com/FrederikRavnKlausen/model-for-culture-formation","relation":"software"}]},"volume":108,"_id":"12890","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-11-13T07:47:30Z","department":[{"_id":"GradSch"},{"_id":"RoSe"}]},{"article_number":"7","author":[{"first_name":"Donald","full_name":"Beaver, Donald","last_name":"Beaver"},{"first_name":"Mahimna","full_name":"Kelkar, Mahimna","last_name":"Kelkar"},{"last_name":"Lewi","full_name":"Lewi, Kevin","first_name":"Kevin"},{"full_name":"Nikolaenko, Valeria","last_name":"Nikolaenko","first_name":"Valeria"},{"first_name":"Alberto","full_name":"Sonnino, Alberto","last_name":"Sonnino"},{"full_name":"Chalkias, Konstantinos","last_name":"Chalkias","first_name":"Konstantinos"},{"full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"first_name":"Ladi De","last_name":"Naurois","full_name":"Naurois, Ladi De"},{"full_name":"Roy, Arnab","last_name":"Roy","first_name":"Arnab"}],"article_processing_charge":"Yes","title":"STROBE: Streaming Threshold Random Beacons","citation":{"chicago":"Beaver, Donald, Mahimna Kelkar, Kevin Lewi, Valeria Nikolaenko, Alberto Sonnino, Konstantinos Chalkias, Eleftherios Kokoris Kogias, Ladi De Naurois, and Arnab Roy. “STROBE: Streaming Threshold Random Beacons.” In 5th Conference on Advances in Financial Technologies, Vol. 282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.AFT.2023.7.","ista":"Beaver D, Kelkar M, Lewi K, Nikolaenko V, Sonnino A, Chalkias K, Kokoris Kogias E, Naurois LD, Roy A. 2023. STROBE: Streaming Threshold Random Beacons. 5th Conference on Advances in Financial Technologies. AFT: Conference on Advances in Financial Technologies, LIPIcs, vol. 282, 7.","mla":"Beaver, Donald, et al. “STROBE: Streaming Threshold Random Beacons.” 5th Conference on Advances in Financial Technologies, vol. 282, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.AFT.2023.7.","apa":"Beaver, D., Kelkar, M., Lewi, K., Nikolaenko, V., Sonnino, A., Chalkias, K., … Roy, A. (2023). STROBE: Streaming Threshold Random Beacons. In 5th Conference on Advances in Financial Technologies (Vol. 282). Princeton, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.AFT.2023.7","ama":"Beaver D, Kelkar M, Lewi K, et al. STROBE: Streaming Threshold Random Beacons. In: 5th Conference on Advances in Financial Technologies. Vol 282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.AFT.2023.7","ieee":"D. Beaver et al., “STROBE: Streaming Threshold Random Beacons,” in 5th Conference on Advances in Financial Technologies, Princeton, NJ, United States, 2023, vol. 282.","short":"D. Beaver, M. Kelkar, K. Lewi, V. Nikolaenko, A. Sonnino, K. Chalkias, E. Kokoris Kogias, L.D. Naurois, A. Roy, in:, 5th Conference on Advances in Financial Technologies, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"acknowledgement":"Work done when all the authors were at Novi Research, Meta.","date_published":"2023-10-01T00:00:00Z","doi":"10.4230/LIPIcs.AFT.2023.7","date_created":"2023-11-12T23:00:55Z","has_accepted_license":"1","year":"2023","day":"01","publication":"5th Conference on Advances in Financial Technologies","type":"conference","conference":{"name":"AFT: Conference on Advances in Financial Technologies","start_date":"2023-10-23","location":"Princeton, NJ, United States","end_date":"2023-10-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)"},"status":"public","_id":"14516","department":[{"_id":"ElKo"}],"file_date_updated":"2023-11-13T08:44:34Z","date_updated":"2023-11-13T08:52:01Z","ddc":["000"],"scopus_import":"1","alternative_title":["LIPIcs"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1643"}],"month":"10","intvolume":" 282","abstract":[{"text":"We revisit decentralized random beacons with a focus on practical distributed applications. Decentralized random beacons (Beaver and So, Eurocrypt'93) provide the functionality for n parties to generate an unpredictable sequence of bits in a way that cannot be biased, which is useful for any decentralized protocol requiring trusted randomness. Existing beacon constructions are highly inefficient in practical settings where protocol parties need to rejoin after crashes or disconnections, and more significantly where smart contracts may rely on arbitrary index points in high-volume streams. For this, we introduce a new notion of history-generating decentralized random beacons (HGDRBs). Roughly, the history-generation property of HGDRBs allows for previous beacon outputs to be efficiently generated knowing only the current value and the public key. At application layers, history-generation supports registering a sparser set of on-chain values if desired, so that apps like lotteries can utilize on-chain values without incurring high-frequency costs, enjoying all the benefits of DRBs implemented off-chain or with decoupled, special-purpose chains. Unlike rollups, HG is tailored specifically to recovering and verifying pseudorandom bit sequences and thus enjoys unique optimizations investigated in this work. We introduce STROBE: an efficient HGDRB construction which generalizes the original squaring-based RSA approach of Beaver and So. STROBE enjoys several useful properties that make it suited for practical applications that use beacons: 1) history-generating: it can regenerate and verify high-throughput beacon streams, supporting sparse (thus cost-effective) ledger entries; 2) concisely self-verifying: NIZK-free, with state and validation employing a single ring element; 3) eco-friendly: stake-based rather than work based; 4) unbounded: refresh-free, addressing limitations of Beaver and So; 5) delay-free: results are immediately available. 6) storage-efficient: the last beacon suffices to derive all past outputs, thus O(1) storage requirements for nodes serving the whole history.","lang":"eng"}],"oa_version":"Published Version","volume":282,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773034"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"c1f98831cb5149d6c030c41999e6e960","file_id":"14521","creator":"dernst","file_size":793495,"date_updated":"2023-11-13T08:44:34Z","file_name":"2023_LIPIcs_Beaver.pdf","date_created":"2023-11-13T08:44:34Z"}],"language":[{"iso":"eng"}]},{"abstract":[{"text":"State-of-the-art transmon qubits rely on large capacitors, which systematically improve their coherence due to reduced surface-loss participation. However, this approach increases both the footprint and the parasitic cross-coupling and is ultimately limited by radiation losses—a potential roadblock for scaling up quantum processors to millions of qubits. In this work we present transmon qubits with sizes as low as 36 × 39 µm2 with 100-nm-wide vacuum-gap capacitors that are micromachined from commercial silicon-on-insulator wafers and shadow evaporated with aluminum. We achieve a vacuum participation ratio up to 99.6% in an in-plane design that is compatible with standard coplanar circuits. Qubit relaxationtime measurements for small gaps with high zero-point electric field variance of up to 22 V/m reveal a double exponential decay indicating comparably strong qubit interaction with long-lived two-level systems. The exceptionally high selectivity of up to 20 dB to the superconductor-vacuum interface allows us to precisely back out the sub-single-photon dielectric loss tangent of aluminum oxide previously exposed to ambient conditions. In terms of future scaling potential, we achieve a ratio of qubit quality factor to a footprint area equal to 20 µm−2, which is comparable with the highest T1 devices relying on larger geometries, a value that could improve substantially for lower surface-loss superconductors. ","lang":"eng"}],"acknowledged_ssus":[{"_id":"NanoFab"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2206.14104","open_access":"1"}],"month":"10","intvolume":" 20","publication_identifier":{"eissn":["2331-7019"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"4","volume":20,"related_material":{"record":[{"id":"14520","status":"public","relation":"research_data"}]},"ec_funded":1,"_id":"14517","article_type":"original","type":"journal_article","status":"public","date_updated":"2023-11-13T09:22:47Z","department":[{"_id":"JoFi"}],"acknowledgement":"This work was supported by the Austrian Science Fund (FWF) through BeyondC (F7105), the European Research Council under Grant Agreement No. 758053 (ERC StG QUNNECT) and a NOMIS foundation research grant. M.Z. was the recipient of a SAIA scholarship, E.R. of\r\na DOC fellowship of the Austrian Academy of Sciences, and M.P. of a Pöttinger scholarship at IST Austria. S.B. acknowledges support from Marie Skłodowska Curie Program No. 707438 (MSC-IF SUPEREOM). J.M.F. acknowledges support from the Horizon Europe Program HORIZON-CL4-2022-QUANTUM-01-SGA via Project No. 101113946 OpenSuperQPlus100 and the ISTA Nanofabrication Facility.","publisher":"American Physical Society","quality_controlled":"1","oa":1,"year":"2023","day":"20","publication":"Physical Review Applied","date_published":"2023-10-20T00:00:00Z","doi":"10.1103/PhysRevApplied.20.044054","date_created":"2023-11-12T23:00:55Z","article_number":"044054","project":[{"_id":"26927A52-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Integrating superconducting quantum circuits","grant_number":"F07105"},{"_id":"26336814-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"A Fiber Optic Transceiver for Superconducting Qubits","grant_number":"758053"},{"name":"Protected states of quantum matter","_id":"eb9b30ac-77a9-11ec-83b8-871f581d53d2"},{"call_identifier":"H2020","_id":"258047B6-B435-11E9-9278-68D0E5697425","grant_number":"707438","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics SUPEREOM"},{"name":"Open Superconducting Quantum Computers (OpenSuperQPlus)","grant_number":"101080139","_id":"bdb7cfc1-d553-11ed-ba76-d2eaab167738"}],"citation":{"mla":"Zemlicka, Martin, et al. “Compact Vacuum-Gap Transmon Qubits: Selective and Sensitive Probes for Superconductor Surface Losses.” Physical Review Applied, vol. 20, no. 4, 044054, American Physical Society, 2023, doi:10.1103/PhysRevApplied.20.044054.","apa":"Zemlicka, M., Redchenko, E., Peruzzo, M., Hassani, F., Trioni, A., Barzanjeh, S., & Fink, J. M. (2023). Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses. Physical Review Applied. American Physical Society. https://doi.org/10.1103/PhysRevApplied.20.044054","ama":"Zemlicka M, Redchenko E, Peruzzo M, et al. Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses. Physical Review Applied. 2023;20(4). doi:10.1103/PhysRevApplied.20.044054","ieee":"M. Zemlicka et al., “Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses,” Physical Review Applied, vol. 20, no. 4. American Physical Society, 2023.","short":"M. Zemlicka, E. Redchenko, M. Peruzzo, F. Hassani, A. Trioni, S. Barzanjeh, J.M. Fink, Physical Review Applied 20 (2023).","chicago":"Zemlicka, Martin, Elena Redchenko, Matilda Peruzzo, Farid Hassani, Andrea Trioni, Shabir Barzanjeh, and Johannes M Fink. “Compact Vacuum-Gap Transmon Qubits: Selective and Sensitive Probes for Superconductor Surface Losses.” Physical Review Applied. American Physical Society, 2023. https://doi.org/10.1103/PhysRevApplied.20.044054.","ista":"Zemlicka M, Redchenko E, Peruzzo M, Hassani F, Trioni A, Barzanjeh S, Fink JM. 2023. Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses. Physical Review Applied. 20(4), 044054."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Martin","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","last_name":"Zemlicka","full_name":"Zemlicka, Martin"},{"full_name":"Redchenko, Elena","last_name":"Redchenko","first_name":"Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Peruzzo","orcid":"0000-0002-3415-4628","full_name":"Peruzzo, Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","first_name":"Matilda"},{"id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid","last_name":"Hassani","orcid":"0000-0001-6937-5773","full_name":"Hassani, Farid"},{"first_name":"Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","full_name":"Trioni, Andrea","last_name":"Trioni"},{"last_name":"Barzanjeh","orcid":"0000-0003-0415-1423","full_name":"Barzanjeh, Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","first_name":"Shabir"},{"last_name":"Fink","full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M"}],"external_id":{"arxiv":["2206.14104"]},"article_processing_charge":"No","title":"Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses"},{"volume":13,"issue":"4","publication_status":"published","publication_identifier":{"eissn":["2160-3308"]},"language":[{"iso":"eng"}],"file":[{"file_size":1595223,"date_updated":"2023-11-13T09:00:19Z","creator":"dernst","file_name":"2023_PhysReviewX_Reinhardt.pdf","date_created":"2023-11-13T09:00:19Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"14522","checksum":"32574aeebcca7347a4152c611b66b3d5"}],"scopus_import":"1","intvolume":" 13","month":"10","abstract":[{"lang":"eng","text":"Most natural and engineered information-processing systems transmit information via signals that vary in time. Computing the information transmission rate or the information encoded in the temporal characteristics of these signals requires the mutual information between the input and output signals as a function of time, i.e., between the input and output trajectories. Yet, this is notoriously difficult because of the high-dimensional nature of the trajectory space, and all existing techniques require approximations. We present an exact Monte Carlo technique called path weight sampling (PWS) that, for the first time, makes it possible to compute the mutual information between input and output trajectories for any stochastic system that is described by a master equation. The principal idea is to use the master equation to evaluate the exact conditional probability of an individual output trajectory for a given input trajectory and average this via Monte Carlo sampling in trajectory space to obtain the mutual information. We present three variants of PWS, which all generate the trajectories using the standard stochastic simulation algorithm. While direct PWS is a brute-force method, Rosenbluth-Rosenbluth PWS exploits the analogy between signal trajectory sampling and polymer sampling, and thermodynamic integration PWS is based on a reversible work calculation in trajectory space. PWS also makes it possible to compute the mutual information between input and output trajectories for systems with hidden internal states as well as systems with feedback from output to input. Applying PWS to the bacterial chemotaxis system, consisting of 182 coupled chemical reactions, demonstrates not only that the scheme is highly efficient but also that the number of receptor clusters is much smaller than hitherto believed, while their size is much larger."}],"oa_version":"Published Version","department":[{"_id":"GaTk"}],"file_date_updated":"2023-11-13T09:00:19Z","date_updated":"2023-11-13T09:03:30Z","ddc":["530"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","_id":"14515","date_created":"2023-11-12T23:00:55Z","date_published":"2023-10-26T00:00:00Z","doi":"10.1103/PhysRevX.13.041017","year":"2023","has_accepted_license":"1","publication":"Physical Review X","day":"26","oa":1,"quality_controlled":"1","publisher":"American Physical Society","acknowledgement":"We thank Bela Mulder, Tom Shimizu, Fotios Avgidis, Peter Bolhuis, and Daan Frenkel for useful discussions and a careful reading of the manuscript, and we thank Age Tjalma for support with obtaining the Gaussian approximation of the chemotaxis system. This work is part of the Dutch Research Council (NWO) and was performed at the research institute AMOLF. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 885065) and was\r\nfinancially supported by NWO through the “Building a Synthetic Cell (BaSyC)” Gravitation Grant (024.003.019).","external_id":{"arxiv":["2203.03461"]},"article_processing_charge":"Yes","author":[{"first_name":"Manuel","last_name":"Reinhardt","full_name":"Reinhardt, Manuel"},{"last_name":"Tkačik","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Pieter Rein","full_name":"Ten Wolde, Pieter Rein","last_name":"Ten Wolde"}],"title":"Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories","citation":{"chicago":"Reinhardt, Manuel, Gašper Tkačik, and Pieter Rein Ten Wolde. “Path Weight Sampling: Exact Monte Carlo Computation of the Mutual Information between Stochastic Trajectories.” Physical Review X. American Physical Society, 2023. https://doi.org/10.1103/PhysRevX.13.041017.","ista":"Reinhardt M, Tkačik G, Ten Wolde PR. 2023. Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories. Physical Review X. 13(4), 041017.","mla":"Reinhardt, Manuel, et al. “Path Weight Sampling: Exact Monte Carlo Computation of the Mutual Information between Stochastic Trajectories.” Physical Review X, vol. 13, no. 4, 041017, American Physical Society, 2023, doi:10.1103/PhysRevX.13.041017.","apa":"Reinhardt, M., Tkačik, G., & Ten Wolde, P. R. (2023). Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories. Physical Review X. American Physical Society. https://doi.org/10.1103/PhysRevX.13.041017","ama":"Reinhardt M, Tkačik G, Ten Wolde PR. Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories. Physical Review X. 2023;13(4). doi:10.1103/PhysRevX.13.041017","ieee":"M. Reinhardt, G. Tkačik, and P. R. Ten Wolde, “Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories,” Physical Review X, vol. 13, no. 4. American Physical Society, 2023.","short":"M. Reinhardt, G. Tkačik, P.R. Ten Wolde, Physical Review X 13 (2023)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"041017"},{"publication":"Physical Review Letters","day":"20","year":"2023","has_accepted_license":"1","date_created":"2023-11-12T23:00:55Z","doi":"10.1103/PhysRevLett.131.168201","date_published":"2023-10-20T00:00:00Z","acknowledgement":"We are grateful to Dominic Vella, Jens Eggers, John Kolinski, Joshua Dijksman, and Daniel Bonn for insightful discussions. J. B. and A. S. acknowledge the support of the Engineering and Physical Sciences Research Council (EPSRC) through New Investigator Award No. EP/\r\nT000961/1. A. S. acknowledges the support of Royal Society under Grant No. RGS/R2/202135. J. E. S. acknowledges EPSRC Grants No. EP/N016602/1, EP/S022848/1, EP/S029966/1, and EP/P031684/1.","oa":1,"publisher":"American Physical Society","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Binysh, Jack, et al. “Modeling Leidenfrost Levitation of Soft Elastic Solids.” Physical Review Letters, vol. 131, no. 16, 168201, American Physical Society, 2023, doi:10.1103/PhysRevLett.131.168201.","apa":"Binysh, J., Chakraborty, I., Chubynsky, M. V., Diaz Melian, V. L., Waitukaitis, S. R., Sprittles, J. E., & Souslov, A. (2023). Modeling Leidenfrost levitation of soft elastic solids. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.131.168201","ama":"Binysh J, Chakraborty I, Chubynsky MV, et al. Modeling Leidenfrost levitation of soft elastic solids. Physical Review Letters. 2023;131(16). doi:10.1103/PhysRevLett.131.168201","short":"J. Binysh, I. Chakraborty, M.V. Chubynsky, V.L. Diaz Melian, S.R. Waitukaitis, J.E. Sprittles, A. Souslov, Physical Review Letters 131 (2023).","ieee":"J. Binysh et al., “Modeling Leidenfrost levitation of soft elastic solids,” Physical Review Letters, vol. 131, no. 16. American Physical Society, 2023.","chicago":"Binysh, Jack, Indrajit Chakraborty, Mykyta V. Chubynsky, Vicente L Diaz Melian, Scott R Waitukaitis, James E. Sprittles, and Anton Souslov. “Modeling Leidenfrost Levitation of Soft Elastic Solids.” Physical Review Letters. American Physical Society, 2023. https://doi.org/10.1103/PhysRevLett.131.168201.","ista":"Binysh J, Chakraborty I, Chubynsky MV, Diaz Melian VL, Waitukaitis SR, Sprittles JE, Souslov A. 2023. Modeling Leidenfrost levitation of soft elastic solids. Physical Review Letters. 131(16), 168201."},"title":"Modeling Leidenfrost levitation of soft elastic solids","article_processing_charge":"Yes (in subscription journal)","author":[{"last_name":"Binysh","full_name":"Binysh, Jack","first_name":"Jack"},{"first_name":"Indrajit","last_name":"Chakraborty","full_name":"Chakraborty, Indrajit"},{"full_name":"Chubynsky, Mykyta V.","last_name":"Chubynsky","first_name":"Mykyta V."},{"first_name":"Vicente L","id":"b6798902-eea0-11ea-9cbc-a8e14286c631","last_name":"Diaz Melian","full_name":"Diaz Melian, Vicente L"},{"full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R"},{"full_name":"Sprittles, James E.","last_name":"Sprittles","first_name":"James E."},{"last_name":"Souslov","full_name":"Souslov, Anton","first_name":"Anton"}],"article_number":"168201","language":[{"iso":"eng"}],"file":[{"date_created":"2023-11-13T09:12:58Z","file_name":"2023_PhysRevLetters_Binysh.pdf","creator":"dernst","date_updated":"2023-11-13T09:12:58Z","file_size":724098,"file_id":"14524","checksum":"1a419e25b762aadffbcc8eb2e609bd97","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"issue":"16","related_material":{"record":[{"status":"public","id":"14523","relation":"research_data"}]},"volume":131,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The elastic Leidenfrost effect occurs when a vaporizable soft solid is lowered onto a hot surface. Evaporative flow couples to elastic deformation, giving spontaneous bouncing or steady-state floating. The effect embodies an unexplored interplay between thermodynamics, elasticity, and lubrication: despite being observed, its basic theoretical description remains a challenge. Here, we provide a theory of elastic Leidenfrost floating. As weight increases, a rigid solid sits closer to the hot surface. By contrast, we discover an elasticity-dominated regime where the heavier the solid, the higher it floats. This geometry-governed behavior is reminiscent of the dynamics of large liquid Leidenfrost drops. We show that this elastic regime is characterized by Hertzian behavior of the solid’s underbelly and derive how the float height scales with materials parameters. Introducing a dimensionless elastic Leidenfrost number, we capture the crossover between rigid and Hertzian behavior. Our results provide theoretical underpinning for recent experiments, and point to the design of novel soft machines."}],"intvolume":" 131","month":"10","scopus_import":"1","ddc":["530"],"date_updated":"2023-11-13T09:21:30Z","file_date_updated":"2023-11-13T09:12:58Z","department":[{"_id":"ScWa"}],"_id":"14514","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article"}]