[{"publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772785"]},"language":[{"iso":"eng"}],"file":[{"success":1,"checksum":"074177e815a1656de5d4071c7a3dffa6","file_id":"14089","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_LIPIcsICALP_Goranci.pdf","date_created":"2023-08-21T06:59:05Z","creator":"dernst","file_size":875910,"date_updated":"2023-08-21T06:59:05Z"}],"ec_funded":1,"volume":261,"abstract":[{"lang":"eng","text":"We show an (1+ϵ)-approximation algorithm for maintaining maximum s-t flow under m edge insertions in m1/2+o(1)ϵ−1/2 amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee."}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 261","month":"07","date_updated":"2023-08-21T07:00:49Z","ddc":["000"],"department":[{"_id":"MoHe"}],"file_date_updated":"2023-08-21T06:59:05Z","_id":"14085","conference":{"start_date":"2023-07-10","end_date":"2023-07-14","location":"Paderborn, Germany","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","status":"public","year":"2023","has_accepted_license":"1","publication":"50th International Colloquium on Automata, Languages, and Programming","day":"01","date_created":"2023-08-20T22:01:14Z","doi":"10.4230/LIPIcs.ICALP.2023.69","date_published":"2023-07-01T00:00:00Z","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the\r\nAustrian Science Fund (FWF) project “Static and Dynamic Hierarchical Graph Decompositions”,\r\nI 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nThis work was done in part while Gramoz Goranci was at Institute for Theoretical Studies, ETH Zurich, Switzerland. There, he was supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation. We also thank Richard Peng, Thatchaphol Saranurak, Sebastian Forster and Sushant Sachdeva for helpful discussions, and the anonymous reviewers for their insightful comments.","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"chicago":"Goranci, Gramoz, and Monika H Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.69.","ista":"Goranci G, Henzinger MH. 2023. Efficient data structures for incremental exact and approximate maximum flow. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 69.","mla":"Goranci, Gramoz, and Monika H. Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.69.","apa":"Goranci, G., & Henzinger, M. H. (2023). Efficient data structures for incremental exact and approximate maximum flow. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.69","ama":"Goranci G, Henzinger MH. Efficient data structures for incremental exact and approximate maximum flow. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.69","short":"G. Goranci, M.H. Henzinger, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"G. Goranci and M. H. Henzinger, “Efficient data structures for incremental exact and approximate maximum flow,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"unknown":["2211.09606"]},"article_processing_charge":"Yes","author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"}],"title":"Efficient data structures for incremental exact and approximate maximum flow","article_number":"69","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775 ","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}]},{"day":"01","publication":"50th International Colloquium on Automata, Languages, and Programming","has_accepted_license":"1","year":"2023","doi":"10.4230/LIPIcs.ICALP.2023.72","date_published":"2023-07-01T00:00:00Z","date_created":"2023-08-20T22:01:14Z","acknowledgement":"We thank Heng Guo for helpful explanations of algorithms for sampling connected subgraphs and matchings, Maksym Serbyn for bringing to our attention the Wang-Landau algorithm and its use in physics.","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"D. G. Harris and V. Kolmogorov, “Parameter estimation for Gibbs distributions,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","short":"D.G. Harris, V. Kolmogorov, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ama":"Harris DG, Kolmogorov V. Parameter estimation for Gibbs distributions. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.72","apa":"Harris, D. G., & Kolmogorov, V. (2023). Parameter estimation for Gibbs distributions. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.72","mla":"Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.72.","ista":"Harris DG, Kolmogorov V. 2023. Parameter estimation for Gibbs distributions. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 72.","chicago":"Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.72."},"title":"Parameter estimation for Gibbs distributions","author":[{"last_name":"Harris","full_name":"Harris, David G.","first_name":"David G."},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"external_id":{"arxiv":["2007.10824"]},"article_processing_charge":"Yes","article_number":"72","file":[{"date_updated":"2023-08-21T06:45:16Z","file_size":917791,"creator":"dernst","date_created":"2023-08-21T06:45:16Z","file_name":"2023_LIPIcsICALP_Harris.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"6dee0684245bb1c524b9c955db1e933d","file_id":"14088","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783959772785"],"issn":["1868-8969"]},"publication_status":"published","volume":261,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A central problem in computational statistics is to convert a procedure for sampling combinatorial objects into a procedure for counting those objects, and vice versa. We will consider sampling problems which come from Gibbs distributions, which are families of probability distributions over a discrete space Ω with probability mass function of the form μ^Ω_β(ω) ∝ e^{β H(ω)} for β in an interval [β_min, β_max] and H(ω) ∈ {0} ∪ [1, n].\r\nThe partition function is the normalization factor Z(β) = ∑_{ω ∈ Ω} e^{β H(ω)}, and the log partition ratio is defined as q = (log Z(β_max))/Z(β_min)\r\nWe develop a number of algorithms to estimate the counts c_x using roughly Õ(q/ε²) samples for general Gibbs distributions and Õ(n²/ε²) samples for integer-valued distributions (ignoring some second-order terms and parameters), We show this is optimal up to logarithmic factors. We illustrate with improved algorithms for counting connected subgraphs and perfect matchings in a graph."}],"month":"07","intvolume":" 261","scopus_import":"1","alternative_title":["LIPIcs"],"ddc":["000","510"],"date_updated":"2023-08-21T06:49:11Z","file_date_updated":"2023-08-21T06:45:16Z","department":[{"_id":"VlKo"}],"_id":"14084","status":"public","type":"conference","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2023-07-14","location":"Paderborn, Germany","start_date":"2023-07-10"},"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)"}},{"scopus_import":"1","alternative_title":["LIPIcs"],"month":"07","intvolume":" 261","abstract":[{"lang":"eng","text":"The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint has been investigated extensively due to its algorithmic properties and expressive power. Though tight approximation algorithms for general matroid constraints exist in theory, the running times of such algorithms typically scale quadratically, and are not practical for truly large scale settings. Recent progress has focused on fast algorithms for important classes of matroids given in explicit form. Currently, nearly-linear time algorithms only exist for graphic and partition matroids [Alina Ene and Huy L. Nguyen, 2019]. In this work, we develop algorithms for monotone submodular maximization constrained by graphic, transversal matroids, or laminar matroids in time near-linear in the size of their representation. Our algorithms achieve an optimal approximation of 1-1/e-ε and both generalize and accelerate the results of Ene and Nguyen [Alina Ene and Huy L. Nguyen, 2019]. In fact, the running time of our algorithm cannot be improved within the fast continuous greedy framework of Badanidiyuru and Vondrák [Ashwinkumar Badanidiyuru and Jan Vondrák, 2014].\r\nTo achieve near-linear running time, we make use of dynamic data structures that maintain bases with approximate maximum cardinality and weight under certain element updates. These data structures need to support a weight decrease operation and a novel Freeze operation that allows the algorithm to freeze elements (i.e. force to be contained) in its basis regardless of future data structure operations. For the laminar matroid, we present a new dynamic data structure using the top tree interface of Alstrup, Holm, de Lichtenberg, and Thorup [Stephen Alstrup et al., 2005] that maintains the maximum weight basis under insertions and deletions of elements in O(log n) time. This data structure needs to support certain subtree query and path update operations that are performed every insertion and deletion that are non-trivial to handle in conjunction. For the transversal matroid the Freeze operation corresponds to requiring the data structure to keep a certain set S of vertices matched, a property that we call S-stability. While there is a large body of work on dynamic matching algorithms, none are S-stable and maintain an approximate maximum weight matching under vertex updates. We give the first such algorithm for bipartite graphs with total running time linear (up to log factors) in the number of edges."}],"oa_version":"Published Version","volume":261,"ec_funded":1,"publication_identifier":{"isbn":["9783959772785"],"issn":["18688969"]},"publication_status":"published","file":[{"checksum":"a5eef225014e003efbfbe4830fdd23cb","file_id":"14090","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-08-21T07:04:36Z","file_name":"2023_LIPIcsICALP_HenzingerM.pdf","date_updated":"2023-08-21T07:04:36Z","file_size":930943,"creator":"dernst"}],"language":[{"iso":"eng"}],"type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2023-07-10","end_date":"2023-07-14","location":"Paderborn, Germany"},"status":"public","_id":"14086","file_date_updated":"2023-08-21T07:04:36Z","department":[{"_id":"MoHe"}],"date_updated":"2023-08-21T07:05:47Z","ddc":["000"],"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"acknowledgement":" Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant\r\nagreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Jan Vondrák: Supported by NSF Award 2127781.","date_published":"2023-07-01T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2023.74","date_created":"2023-08-20T22:01:14Z","has_accepted_license":"1","year":"2023","day":"01","publication":"50th International Colloquium on Automata, Languages, and Programming","project":[{"name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775 "}],"article_number":"74","author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Liu, Paul","last_name":"Liu","first_name":"Paul"},{"full_name":"Vondrák, Jan","last_name":"Vondrák","first_name":"Jan"},{"first_name":"Da Wei","full_name":"Zheng, Da Wei","last_name":"Zheng"}],"article_processing_charge":"Yes","external_id":{"arxiv":["2305.00122"]},"title":"Faster submodular maximization for several classes of matroids","citation":{"mla":"Henzinger, Monika H., et al. “Faster Submodular Maximization for Several Classes of Matroids.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.74.","apa":"Henzinger, M. H., Liu, P., Vondrák, J., & Zheng, D. W. (2023). Faster submodular maximization for several classes of matroids. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.74","ama":"Henzinger MH, Liu P, Vondrák J, Zheng DW. Faster submodular maximization for several classes of matroids. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.74","short":"M.H. Henzinger, P. Liu, J. Vondrák, D.W. Zheng, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"M. H. Henzinger, P. Liu, J. Vondrák, and D. W. Zheng, “Faster submodular maximization for several classes of matroids,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","chicago":"Henzinger, Monika H, Paul Liu, Jan Vondrák, and Da Wei Zheng. “Faster Submodular Maximization for Several Classes of Matroids.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.74.","ista":"Henzinger MH, Liu P, Vondrák J, Zheng DW. 2023. Faster submodular maximization for several classes of matroids. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 74."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"title":"Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery","author":[{"last_name":"Resch","full_name":"Resch, Nicolas","first_name":"Nicolas"},{"last_name":"Yuan","full_name":"Yuan, Chen","first_name":"Chen"},{"last_name":"Zhang","orcid":"0000-0002-6465-6258","full_name":"Zhang, Yihan","first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"}],"external_id":{"arxiv":["2210.07754"]},"article_processing_charge":"Yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"N. Resch, C. Yuan, and Y. Zhang, “Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","short":"N. Resch, C. Yuan, Y. Zhang, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","apa":"Resch, N., Yuan, C., & Zhang, Y. (2023). Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.99","ama":"Resch N, Yuan C, Zhang Y. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.99","mla":"Resch, Nicolas, et al. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.99.","ista":"Resch N, Yuan C, Zhang Y. 2023. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 99.","chicago":"Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.99."},"article_number":"99","date_published":"2023-07-01T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2023.99","date_created":"2023-08-20T22:01:13Z","day":"01","publication":"50th International Colloquium on Automata, Languages, and Programming","has_accepted_license":"1","year":"2023","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"acknowledgement":"Nicolas Resch: Research supported in part by ERC H2020 grant No.74079 (ALGSTRONGCRYPTO). Chen Yuan: Research supported in part by the National Key Research and Development Projects under Grant 2022YFA1004900 and Grant 2021YFE0109900, the National Natural Science Foundation of China under Grant 12101403 and Grant 12031011.\r\nAcknowledgements YZ is grateful to Shashank Vatedka, Diyuan Wu and Fengxing Zhu for inspiring discussions.","department":[{"_id":"MaMo"}],"file_date_updated":"2023-08-21T07:23:18Z","ddc":["000"],"date_updated":"2023-08-21T07:26:01Z","status":"public","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2023-07-10","location":"Paderborn, Germany","end_date":"2023-07-14"},"_id":"14083","volume":261,"file":[{"success":1,"checksum":"a449143fec3fbebb092cb8ef3b53c226","file_id":"14091","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2023_LIPIcsICALP_Resch.pdf","date_created":"2023-08-21T07:23:18Z","file_size":1141497,"date_updated":"2023-08-21T07:23:18Z","creator":"dernst"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772785"]},"publication_status":"published","month":"07","intvolume":" 261","scopus_import":"1","alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"text":"In this work we consider the list-decodability and list-recoverability of arbitrary q-ary codes, for all integer values of q ≥ 2. A code is called (p,L)_q-list-decodable if every radius pn Hamming ball contains less than L codewords; (p,𝓁,L)_q-list-recoverability is a generalization where we place radius pn Hamming balls on every point of a combinatorial rectangle with side length 𝓁 and again stipulate that there be less than L codewords.\r\nOur main contribution is to precisely calculate the maximum value of p for which there exist infinite families of positive rate (p,𝓁,L)_q-list-recoverable codes, the quantity we call the zero-rate threshold. Denoting this value by p_*, we in fact show that codes correcting a p_*+ε fraction of errors must have size O_ε(1), i.e., independent of n. Such a result is typically referred to as a \"Plotkin bound.\" To complement this, a standard random code with expurgation construction shows that there exist positive rate codes correcting a p_*-ε fraction of errors. We also follow a classical proof template (typically attributed to Elias and Bassalygo) to derive from the zero-rate threshold other tradeoffs between rate and decoding radius for list-decoding and list-recovery.\r\nTechnically, proving the Plotkin bound boils down to demonstrating the Schur convexity of a certain function defined on the q-simplex as well as the convexity of a univariate function derived from it. We remark that an earlier argument claimed similar results for q-ary list-decoding; however, we point out that this earlier proof is flawed.","lang":"eng"}]},{"language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"12698","checksum":"c4f2f6eea0408811f8f4898e15890355","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"Main_Preprint.pdf","date_created":"2023-02-28T12:20:27Z","creator":"ggrosjea","file_size":2301864,"date_updated":"2023-02-28T12:20:27Z"},{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"6af6ed6c97a977f923de4162294b43c4","file_id":"12699","file_size":1138625,"date_updated":"2023-02-28T12:20:55Z","creator":"ggrosjea","file_name":"Suppl_info.pdf","date_created":"2023-02-28T12:20:55Z"},{"date_created":"2023-02-28T12:37:54Z","file_name":"Suppl_vid1.mp4","date_updated":"2023-02-28T12:37:54Z","file_size":793449,"creator":"ggrosjea","checksum":"3f20365fb9515bdba3a111d912c8d8b4","file_id":"12700","success":1,"content_type":"video/mp4","access_level":"open_access","relation":"main_file"},{"creator":"ggrosjea","file_size":455925,"date_updated":"2023-02-28T12:37:54Z","file_name":"Suppl_vid2.mp4","date_created":"2023-02-28T12:37:54Z","relation":"main_file","access_level":"open_access","content_type":"video/mp4","success":1,"checksum":"90cecacbe0e2f9dea11f91a4ba20c32e","file_id":"12701"}],"publication_status":"published","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"ec_funded":1,"related_material":{"record":[{"status":"public","id":"8101","relation":"research_paper"}]},"issue":"9","volume":130,"oa_version":"Preprint","abstract":[{"text":"Models for same-material contact electrification in granular media often rely on a local charge-driving parameter whose spatial variations lead to a stochastic origin for charge exchange. Measuring the charge transfer from individual granular spheres after contacts with substrates of the same material, we find instead a “global” charging behavior, coherent over the sample’s whole surface. Cleaning and baking samples fully resets charging magnitude and direction, which indicates the underlying global parameter is not intrinsic to the material, but acquired from its history. Charging behavior is randomly and irreversibly affected by changes in relative humidity, hinting at a mechanism where adsorbates, in particular, water, are fundamental to the charge-transfer process.","lang":"eng"}],"intvolume":" 130","month":"03","main_file_link":[{"url":"https://arxiv.org/abs/2211.02488","open_access":"1"}],"ddc":["530","537"],"date_updated":"2023-08-22T08:41:32Z","department":[{"_id":"ScWa"}],"file_date_updated":"2023-02-28T12:37:54Z","_id":"12697","keyword":["General Physics","Electrostatics","Triboelectricity","Soft Matter","Acoustic Levitation","Granular Materials"],"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":"Physical Review Letters","day":"03","year":"2023","isi":1,"has_accepted_license":"1","date_created":"2023-02-28T12:14:46Z","doi":"10.1103/physrevlett.130.098202","date_published":"2023-03-03T00:00:00Z","acknowledgement":"We would like to thank Troy Shinbrot, Victor Lee and Daniele Foresti for helpful discussions. This project has received funding from the European Research Council Grant Agreement No. 949120 and from the the Marie Sk lodowska-Curie Grant Agreement No. 754411 under\r\nthe European Union’s Horizon 2020 research and innovation program.","oa":1,"quality_controlled":"1","publisher":"American Physical Society","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"short":"G.M. Grosjean, S.R. Waitukaitis, Physical Review Letters 130 (2023).","ieee":"G. M. Grosjean and S. R. Waitukaitis, “Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media,” Physical Review Letters, vol. 130, no. 9. American Physical Society, 2023.","apa":"Grosjean, G. M., & Waitukaitis, S. R. (2023). Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.130.098202","ama":"Grosjean GM, Waitukaitis SR. Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media. Physical Review Letters. 2023;130(9). doi:10.1103/physrevlett.130.098202","mla":"Grosjean, Galien M., and Scott R. Waitukaitis. “Single-Collision Statistics Reveal a Global Mechanism Driven by Sample History for Contact Electrification in Granular Media.” Physical Review Letters, vol. 130, no. 9, 098202, American Physical Society, 2023, doi:10.1103/physrevlett.130.098202.","ista":"Grosjean GM, Waitukaitis SR. 2023. Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media. Physical Review Letters. 130(9), 098202.","chicago":"Grosjean, Galien M, and Scott R Waitukaitis. “Single-Collision Statistics Reveal a Global Mechanism Driven by Sample History for Contact Electrification in Granular Media.” Physical Review Letters. American Physical Society, 2023. https://doi.org/10.1103/physrevlett.130.098202."},"title":"Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media","external_id":{"isi":["000946178200008"],"arxiv":["2211.02488"]},"article_processing_charge":"No","author":[{"id":"0C5FDA4A-9CF6-11E9-8939-FF05E6697425","first_name":"Galien M","full_name":"Grosjean, Galien M","orcid":"0000-0001-5154-417X","last_name":"Grosjean"},{"last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R"}],"article_number":"098202","project":[{"grant_number":"949120","name":"Tribocharge: a multi-scale approach to an enduring problem in physics","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","call_identifier":"H2020"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}]},{"file":[{"creator":"cchlebak","date_updated":"2023-06-30T08:17:25Z","file_size":18688376,"date_created":"2023-06-30T08:17:25Z","file_name":"thesis_pdfa.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"7d03f1a5a5258ee43dfc3323dea4e08f","file_id":"13176","success":1},{"relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","checksum":"c3b45317ae58e0527533f98c202d81b7","file_id":"13196","creator":"cchlebak","file_size":37847025,"date_updated":"2023-07-06T11:35:15Z","file_name":"thesis.zip","date_created":"2023-07-06T11:35:15Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663 - 337X"],"isbn":["978-3-99078-030-5"]},"publication_status":"published","degree_awarded":"PhD","related_material":{"record":[{"relation":"old_edition","status":"public","id":"12900"},{"relation":"part_of_dissertation","status":"public","id":"10924"},{"relation":"part_of_dissertation","status":"public","id":"9114"}]},"ec_funded":1,"oa_version":"Published Version","abstract":[{"text":"About a 100 years ago, we discovered that our universe is inherently noisy, that is, measuring any physical quantity with a precision beyond a certain point is not possible because of an omnipresent inherent noise. We call this - the quantum noise. Certain physical processes allow this quantum noise to get correlated in conjugate physical variables. These quantum correlations can be used to go beyond the potential of our inherently noisy universe and obtain a quantum advantage over the classical applications. \r\n\r\nQuantum noise being inherent also means that, at the fundamental level, the physical quantities are not well defined and therefore, objects can stay in multiple states at the same time. For example, the position of a particle not being well defined means that the particle is in multiple positions at the same time. About 4 decades ago, we started exploring the possibility of using objects which can be in multiple states at the same time to increase the dimensionality in computation. Thus, the field of quantum computing was born. We discovered that using quantum entanglement, a property closely related to quantum correlations, can be used to speed up computation of certain problems, such as factorisation of large numbers, faster than any known classical algorithm. Thus began the pursuit to make quantum computers a reality. \r\n\r\nTill date, we have explored quantum control over many physical systems including photons, spins, atoms, ions and even simple circuits made up of superconducting material. However, there persists one ubiquitous theme. The more readily a system interacts with an external field or matter, the more easily we can control it. But this also means that such a system can easily interact with a noisy environment and quickly lose its coherence. Consequently, such systems like electron spins need to be protected from the environment to ensure the longevity of their coherence. Other systems like nuclear spins are naturally protected as they do not interact easily with the environment. But, due to the same reason, it is harder to interact with such systems. \r\n\r\nAfter decades of experimentation with various systems, we are convinced that no one type of quantum system would be the best for all the quantum applications. We would need hybrid systems which are all interconnected - much like the current internet where all sorts of devices can all talk to each other - but now for quantum devices. A quantum internet. \r\n\r\nOptical photons are the best contenders to carry information for the quantum internet. They can carry quantum information cheaply and without much loss - the same reasons which has made them the backbone of our current internet. Following this direction, many systems, like trapped ions, have already demonstrated successful quantum links over a large distances using optical photons. However, some of the most promising contenders for quantum computing which are based on microwave frequencies have been left behind. This is because high energy optical photons can adversely affect fragile low-energy microwave systems. \r\n\r\nIn this thesis, we present substantial progress on this missing quantum link between microwave and optics using electrooptical nonlinearities in lithium niobate. The nonlinearities are enhanced by using resonant cavities for all the involved modes leading to observation of strong direct coupling between optical and microwave frequencies. With this strong coupling we are not only able to achieve almost 100\\% internal conversion efficiency with low added noise, thus presenting a quantum-enabled transducer, but also we are able to observe novel effects such as cooling of a microwave mode using optics. The strong coupling regime also leads to direct observation of dynamical backaction effect between microwave and optical frequencies which are studied in detail here. Finally, we also report first observation of microwave-optics entanglement in form of two-mode squeezed vacuum squeezed 0.7dB below vacuum level. \r\nWith this new bridge between microwave and optics, the microwave-based quantum technologies can finally be a part of a quantum network which is based on optical photons - putting us one step closer to a future with quantum internet. ","lang":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"SSU"},{"_id":"NanoFab"}],"month":"05","alternative_title":["ISTA Thesis"],"ddc":["537","535","539"],"supervisor":[{"last_name":"Fink","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M"}],"date_updated":"2023-08-24T11:16:35Z","file_date_updated":"2023-07-06T11:35:15Z","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"_id":"13175","status":"public","keyword":["quantum optics","electrooptics","quantum networks","quantum communication","transduction"],"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)"},"day":"05","has_accepted_license":"1","year":"2023","doi":"10.15479/at:ista:13175","date_published":"2023-05-05T00:00:00Z","date_created":"2023-06-30T08:07:43Z","page":"202","publisher":"Institute of Science and Technology Austria","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"mla":"Sahu, Rishabh. Cavity Quantum Electrooptics. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13175.","ama":"Sahu R. Cavity quantum electrooptics. 2023. doi:10.15479/at:ista:13175","apa":"Sahu, R. (2023). Cavity quantum electrooptics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:13175","short":"R. Sahu, Cavity Quantum Electrooptics, Institute of Science and Technology Austria, 2023.","ieee":"R. Sahu, “Cavity quantum electrooptics,” Institute of Science and Technology Austria, 2023.","chicago":"Sahu, Rishabh. “Cavity Quantum Electrooptics.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13175.","ista":"Sahu R. 2023. Cavity quantum electrooptics. Institute of Science and Technology Austria."},"title":"Cavity quantum electrooptics","author":[{"id":"47D26E34-F248-11E8-B48F-1D18A9856A87","first_name":"Rishabh","last_name":"Sahu","full_name":"Sahu, Rishabh","orcid":"0000-0001-6264-2162"}],"article_processing_charge":"No","project":[{"name":"A Fiber Optic Transceiver for Superconducting Qubits","grant_number":"758053","call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"grant_number":"899354","name":"Quantum Local Area Networks with Superconducting Qubits","call_identifier":"H2020","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A"},{"_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits"}]},{"publisher":"Institute of Science and Technology Austria","page":"190","date_created":"2023-05-05T11:08:50Z","date_published":"2023-05-05T00:00:00Z","doi":"10.15479/at:ista:12900","year":"2023","has_accepted_license":"1","day":"05","project":[{"call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425","grant_number":"758053","name":"A Fiber Optic Transceiver for Superconducting Qubits"},{"call_identifier":"H2020","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A","name":"Quantum Local Area Networks with Superconducting Qubits","grant_number":"899354"},{"name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f"}],"article_processing_charge":"No","author":[{"last_name":"Sahu","full_name":"Sahu, Rishabh","orcid":"0000-0001-6264-2162","id":"47D26E34-F248-11E8-B48F-1D18A9856A87","first_name":"Rishabh"}],"title":"Cavity quantum electrooptics","citation":{"chicago":"Sahu, Rishabh. “Cavity Quantum Electrooptics.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12900.","ista":"Sahu R. 2023. Cavity quantum electrooptics. Institute of Science and Technology Austria.","mla":"Sahu, Rishabh. Cavity Quantum Electrooptics. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12900.","ieee":"R. Sahu, “Cavity quantum electrooptics,” Institute of Science and Technology Austria, 2023.","short":"R. Sahu, Cavity Quantum Electrooptics, Institute of Science and Technology Austria, 2023.","apa":"Sahu, R. (2023). Cavity quantum electrooptics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12900","ama":"Sahu R. Cavity quantum electrooptics. 2023. doi:10.15479/at:ista:12900"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","alternative_title":["ISTA Thesis"],"month":"05","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"SSU"},{"_id":"NanoFab"}],"abstract":[{"text":"About a 100 years ago, we discovered that our universe is inherently noisy, that is, measuring any physical quantity with a precision beyond a certain point is not possible because of an omnipresent inherent noise. We call this - the quantum noise. Certain physical processes allow this quantum noise to get correlated in conjugate physical variables. These quantum correlations can be used to go beyond the potential of our inherently noisy universe and obtain a quantum advantage over the classical applications. \r\n\r\nQuantum noise being inherent also means that, at the fundamental level, the physical quantities are not well defined and therefore, objects can stay in multiple states at the same time. For example, the position of a particle not being well defined means that the particle is in multiple positions at the same time. About 4 decades ago, we started exploring the possibility of using objects which can be in multiple states at the same time to increase the dimensionality in computation. Thus, the field of quantum computing was born. We discovered that using quantum entanglement, a property closely related to quantum correlations, can be used to speed up computation of certain problems, such as factorisation of large numbers, faster than any known classical algorithm. Thus began the pursuit to make quantum computers a reality. \r\n\r\nTill date, we have explored quantum control over many physical systems including photons, spins, atoms, ions and even simple circuits made up of superconducting material. However, there persists one ubiquitous theme. The more readily a system interacts with an external field or matter, the more easily we can control it. But this also means that such a system can easily interact with a noisy environment and quickly lose its coherence. Consequently, such systems like electron spins need to be protected from the environment to ensure the longevity of their coherence. Other systems like nuclear spins are naturally protected as they do not interact easily with the environment. But, due to the same reason, it is harder to interact with such systems. \r\n\r\nAfter decades of experimentation with various systems, we are convinced that no one type of quantum system would be the best for all the quantum applications. We would need hybrid systems which are all interconnected - much like the current internet where all sorts of devices can all talk to each other - but now for quantum devices. A quantum internet. \r\n\r\nOptical photons are the best contenders to carry information for the quantum internet. They can carry quantum information cheaply and without much loss - the same reasons which has made them the backbone of our current internet. Following this direction, many systems, like trapped ions, have already demonstrated successful quantum links over a large distances using optical photons. However, some of the most promising contenders for quantum computing which are based on microwave frequencies have been left behind. This is because high energy optical photons can adversely affect fragile low-energy microwave systems. \r\n\r\nIn this thesis, we present substantial progress on this missing quantum link between microwave and optics using electrooptical nonlinearities in lithium niobate. The nonlinearities are enhanced by using resonant cavities for all the involved modes leading to observation of strong direct coupling between optical and microwave frequencies. With this strong coupling we are not only able to achieve almost 100\\% internal conversion efficiency with low added noise, thus presenting a quantum-enabled transducer, but also we are able to observe novel effects such as cooling of a microwave mode using optics. The strong coupling regime also leads to direct observation of dynamical backaction effect between microwave and optical frequencies which are studied in detail here. Finally, we also report first observation of microwave-optics entanglement in form of two-mode squeezed vacuum squeezed 0.7dB below vacuum level. \r\nWith this new bridge between microwave and optics, the microwave-based quantum technologies can finally be a part of a quantum network which is based on optical photons - putting us one step closer to a future with quantum internet. ","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"related_material":{"record":[{"relation":"new_edition","status":"public","id":"13175"},{"id":"10924","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"9114","status":"public"}]},"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663 - 337X"],"isbn":["978-3-99078-030-5"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2023-06-06T22:30:03Z","file_size":36767177,"creator":"rsahu","date_created":"2023-05-09T08:45:14Z","file_name":"thesis.zip","content_type":"application/x-zip-compressed","embargo_to":"open_access","access_level":"closed","relation":"source_file","checksum":"8cbdab9c37ee55e591092a6f66b272c4","file_id":"12928"},{"file_id":"12929","checksum":"439659ead46618147309be39d9dd5a8c","access_level":"closed","relation":"main_file","content_type":"application/pdf","date_created":"2023-05-09T08:51:17Z","file_name":"thesis_pdfa_final.pdf","creator":"rsahu","date_updated":"2023-07-06T11:37:40Z","file_size":17501990}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"type":"dissertation","keyword":["quantum optics","electrooptics","quantum networks","quantum communication","transduction"],"status":"public","_id":"12900","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"file_date_updated":"2023-07-06T11:37:40Z","date_updated":"2023-08-24T11:16:35Z","supervisor":[{"orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","last_name":"Fink","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"}],"ddc":["537","535","539"]},{"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. Research was sponsored by the United\r\nStates Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-\r\n1000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied,\r\nof the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright\r\nnotation herein. The research was also funded in part by the AI2050 program at Schmidt Futures (Grant G-22-63172) and Capgemini SE.","quality_controlled":"1","publisher":"Association for the Advancement of Artificial Intelligence","oa":1,"day":"26","publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","year":"2023","date_published":"2023-06-26T00:00:00Z","doi":"10.1609/aaai.v37i12.26747","date_created":"2023-08-27T22:01:17Z","page":"14964-14973","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence. Vol 37. Association for the Advancement of Artificial Intelligence; 2023:14964-14973. doi:10.1609/aaai.v37i12.26747","apa":"Lechner, M., Zikelic, D., Chatterjee, K., Henzinger, T. A., & Rus, D. (2023). Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 14964–14973). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v37i12.26747","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, T. A. Henzinger, and D. Rus, “Quantization-aware interval bound propagation for training certifiably robust quantized neural networks,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 12, pp. 14964–14973.","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, D. Rus, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–14973.","mla":"Lechner, Mathias, et al. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 12, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–73, doi:10.1609/aaai.v37i12.26747.","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. 2023. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 14964–14973.","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, Thomas A Henzinger, and Daniela Rus. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:14964–73. Association for the Advancement of Artificial Intelligence, 2023. https://doi.org/10.1609/aaai.v37i12.26747."},"title":"Quantization-aware interval bound propagation for training certifiably robust quantized neural networks","author":[{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"}],"article_processing_charge":"No","external_id":{"arxiv":["2211.16187"]},"oa_version":"Preprint","abstract":[{"text":"We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore commonly adopted in industry. Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization, and certification of the quantized representation is necessary to guarantee robustness. In this work, we present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs. Inspired by advances in robust learning of non-quantized networks, our training algorithm computes the gradient of an abstract representation of the actual network. Unlike existing approaches, our method can handle the discrete semantics of QNNs. Based on QA-IBP, we also develop a complete verification procedure for verifying the adversarial robustness of QNNs, which is guaranteed to terminate and produce a correct answer. Compared to existing approaches, the key advantage of our verification procedure is that it runs entirely on GPU or other accelerator devices. We demonstrate experimentally that our approach significantly outperforms existing methods and establish the new state-of-the-art for training and certifying the robustness of QNNs.","lang":"eng"}],"month":"06","intvolume":" 37","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.16187"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781577358800"]},"publication_status":"published","volume":37,"issue":"12","ec_funded":1,"_id":"14242","status":"public","type":"conference","conference":{"name":"AAAI: Conference on Artificial Intelligence","start_date":"2023-02-07","location":"Washington, DC, United States","end_date":"2023-02-14"},"date_updated":"2023-09-05T07:06:14Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Avni G, Jecker IR, Zikelic D. Bidding graph games with partially-observable budgets. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence. Vol 37. ; 2023:5464-5471. doi:10.1609/aaai.v37i5.25679","apa":"Avni, G., Jecker, I. R., & Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 5464–5471). Washington, DC, United States. https://doi.org/10.1609/aaai.v37i5.25679","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, 2023, pp. 5464–5471.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.","mla":"Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.” Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 5, 2023, pp. 5464–71, doi:10.1609/aaai.v37i5.25679.","ista":"Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Bidding Graph Games with Partially-Observable Budgets.” In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:5464–71, 2023. https://doi.org/10.1609/aaai.v37i5.25679."},"title":"Bidding graph games with partially-observable budgets","article_processing_charge":"No","external_id":{"arxiv":["2211.13626"]},"author":[{"first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287"},{"first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R","last_name":"Jecker"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic"}],"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","day":"27","year":"2023","date_created":"2023-08-27T22:01:18Z","doi":"10.1609/aaai.v37i5.25679","date_published":"2023-06-27T00:00:00Z","page":"5464-5471","acknowledgement":"This research was supported in part by ISF grant no.1679/21, by the ERC CoG 863818 (ForM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","oa":1,"quality_controlled":"1","date_updated":"2023-09-05T08:37:00Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"14243","status":"public","conference":{"start_date":"2023-02-07","end_date":"2023-02-14","location":"Washington, DC, United States","name":"AAAI: Conference on Artificial Intelligence"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781577358800"]},"ec_funded":1,"issue":"5","volume":37,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Two-player zero-sum \"graph games\" are central in logic, verification, and multi-agent systems. The game proceeds by placing a token on a vertex of a graph, and allowing the players to move it to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In \"bidding games\", however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as full-information games. In this work we initiate the study of partial-information bidding games: we study bidding games in which a player's initial budget is drawn from a known probability distribution. We show that while for some bidding mechanisms and objectives, it is straightforward to adapt the results from the full-information setting to the partial-information setting, for others, the analysis is significantly more challenging, requires new techniques, and gives rise to interesting results. Specifically, we study games with \"mean-payoff\" objectives in combination with \"poorman\" bidding. We construct optimal strategies for a partially-informed player who plays against a fully-informed adversary. We show that, somewhat surprisingly, the \"value\" under pure strategies does not necessarily exist in such games."}],"intvolume":" 37","month":"06","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1609/aaai.v37i5.25679"}],"scopus_import":"1"},{"_id":"14241","status":"public","conference":{"name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference","end_date":"2023-08-10","location":"Los Angeles, CA, United States","start_date":"2023-08-06"},"type":"conference","date_updated":"2023-09-05T07:22:03Z","department":[{"_id":"BeBi"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present a technique to optimize the reflectivity of a surface while preserving its overall shape. The naïve optimization of the mesh vertices using the gradients of reflectivity simulations results in undesirable distortion. In contrast, our robust formulation optimizes the surface normal as an independent variable that bridges the reflectivity term with differential rendering, and the regularization term with as-rigid-as-possible elastic energy. We further adaptively subdivide the input mesh to improve the convergence. Consequently, our method can minimize the retroreflectivity of a wide range of input shapes, resulting in sharply creased shapes ubiquitous among stealth aircraft and Sci-Fi vehicles. Furthermore, by changing the reward for the direction of the outgoing light directions, our method can be applied to other reflectivity design tasks, such as the optimization of architectural walls to concentrate light in a specific region. We have tested the proposed method using light-transport simulations and real-world 3D-printed objects."}],"month":"07","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2305.05944","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9798400701597"]},"article_number":"20","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Tojo K, Shamir A, Bickel B, Umetani N. 2023. Stealth shaper: Reflectivity optimization as surface stylization. SIGGRAPH 2023 Conference Proceedings. SIGGRAPH: Computer Graphics and Interactive Techniques Conference, 20.","chicago":"Tojo, Kenji, Ariel Shamir, Bernd Bickel, and Nobuyuki Umetani. “Stealth Shaper: Reflectivity Optimization as Surface Stylization.” In SIGGRAPH 2023 Conference Proceedings. Association for Computing Machinery, 2023. https://doi.org/10.1145/3588432.3591542.","short":"K. Tojo, A. Shamir, B. Bickel, N. Umetani, in:, SIGGRAPH 2023 Conference Proceedings, Association for Computing Machinery, 2023.","ieee":"K. Tojo, A. Shamir, B. Bickel, and N. Umetani, “Stealth shaper: Reflectivity optimization as surface stylization,” in SIGGRAPH 2023 Conference Proceedings, Los Angeles, CA, United States, 2023.","apa":"Tojo, K., Shamir, A., Bickel, B., & Umetani, N. (2023). Stealth shaper: Reflectivity optimization as surface stylization. In SIGGRAPH 2023 Conference Proceedings. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3588432.3591542","ama":"Tojo K, Shamir A, Bickel B, Umetani N. Stealth shaper: Reflectivity optimization as surface stylization. In: SIGGRAPH 2023 Conference Proceedings. Association for Computing Machinery; 2023. doi:10.1145/3588432.3591542","mla":"Tojo, Kenji, et al. “Stealth Shaper: Reflectivity Optimization as Surface Stylization.” SIGGRAPH 2023 Conference Proceedings, 20, Association for Computing Machinery, 2023, doi:10.1145/3588432.3591542."},"title":"Stealth shaper: Reflectivity optimization as surface stylization","article_processing_charge":"No","external_id":{"arxiv":["2305.05944"]},"author":[{"first_name":"Kenji","last_name":"Tojo","full_name":"Tojo, Kenji"},{"first_name":"Ariel","full_name":"Shamir, Ariel","last_name":"Shamir"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"},{"last_name":"Umetani","full_name":"Umetani, Nobuyuki","first_name":"Nobuyuki"}],"acknowledgement":"The authors would like to thank Yuki Koyama and Takeo Igarashi for early discussions, and Yuta Yaguchi for support in 3D printing. This research is partially supported by the Israel Science Foundation grant number 1390/19.\r\n","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","publication":"SIGGRAPH 2023 Conference Proceedings","day":"23","year":"2023","date_created":"2023-08-27T22:01:17Z","date_published":"2023-07-23T00:00:00Z","doi":"10.1145/3588432.3591542"},{"_id":"12562","keyword":["Physiology","General Neuroscience"],"status":"public","article_type":"original","type":"journal_article","date_updated":"2023-09-05T12:13:34Z","department":[{"_id":"SiHi"}],"oa_version":"None","pmid":1,"abstract":[{"lang":"eng","text":"Presynaptic inputs determine the pattern of activation of postsynaptic neurons in a neural circuit. Molecular and genetic pathways that regulate the selective formation of subsets of presynaptic inputs are largely unknown, despite significant understanding of the general process of synaptogenesis. In this study, we have begun to identify such factors using the spinal monosynaptic stretch reflex circuit as a model system. In this neuronal circuit, Ia proprioceptive afferents establish monosynaptic connections with spinal motor neurons that project to the same muscle (termed homonymous connections) or muscles with related or synergistic function. However, monosynaptic connections are not formed with motor neurons innervating muscles with antagonistic functions. The ETS transcription factor ER81 (also known as ETV1) is expressed by all proprioceptive afferents, but only a small set of motor neuron pools in the lumbar spinal cord of the mouse. Here we use conditional mouse genetic techniques to eliminate Er81 expression selectively from motor neurons. We find that ablation of Er81 in motor neurons reduces synaptic inputs from proprioceptive afferents conveying information from homonymous and synergistic muscles, with no change observed in the connectivity pattern from antagonistic proprioceptive afferents. In summary, these findings suggest a role for ER81 in defined motor neuron pools to control the assembly of specific presynaptic inputs and thereby influence the profile of activation of these motor neurons."}],"intvolume":" 129","month":"03","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0022-3077"],"eissn":["1522-1598"]},"volume":129,"issue":"3","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"D. R. Ladle and S. Hippenmeyer, “Loss of ETV1/ER81 in motor neurons leads to reduced monosynaptic inputs from proprioceptive sensory neurons,” Journal of Neurophysiology, vol. 129, no. 3. American Physiological Society, pp. 501–512, 2023.","short":"D.R. Ladle, S. Hippenmeyer, Journal of Neurophysiology 129 (2023) 501–512.","ama":"Ladle DR, Hippenmeyer S. Loss of ETV1/ER81 in motor neurons leads to reduced monosynaptic inputs from proprioceptive sensory neurons. Journal of Neurophysiology. 2023;129(3):501-512. doi:10.1152/jn.00172.2022","apa":"Ladle, D. R., & Hippenmeyer, S. (2023). Loss of ETV1/ER81 in motor neurons leads to reduced monosynaptic inputs from proprioceptive sensory neurons. Journal of Neurophysiology. American Physiological Society. https://doi.org/10.1152/jn.00172.2022","mla":"Ladle, David R., and Simon Hippenmeyer. “Loss of ETV1/ER81 in Motor Neurons Leads to Reduced Monosynaptic Inputs from Proprioceptive Sensory Neurons.” Journal of Neurophysiology, vol. 129, no. 3, American Physiological Society, 2023, pp. 501–12, doi:10.1152/jn.00172.2022.","ista":"Ladle DR, Hippenmeyer S. 2023. Loss of ETV1/ER81 in motor neurons leads to reduced monosynaptic inputs from proprioceptive sensory neurons. Journal of Neurophysiology. 129(3), 501–512.","chicago":"Ladle, David R., and Simon Hippenmeyer. “Loss of ETV1/ER81 in Motor Neurons Leads to Reduced Monosynaptic Inputs from Proprioceptive Sensory Neurons.” Journal of Neurophysiology. American Physiological Society, 2023. https://doi.org/10.1152/jn.00172.2022."},"title":"Loss of ETV1/ER81 in motor neurons leads to reduced monosynaptic inputs from proprioceptive sensory neurons","article_processing_charge":"No","external_id":{"pmid":["36695533"],"isi":["000957721600001"]},"author":[{"first_name":"David R.","last_name":"Ladle","full_name":"Ladle, David R."},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon"}],"acknowledgement":"The authors gratefully thank Dr. Silvia Arber, University of Basel and Friedrich Miescher Institute for Biomedical Research, for support and in whose lab the data were collected. For advice on statistical analysis, we thank Michael Bottomley from the Statistical Consulting Center, College of Science and Mathematics, Wright State University.","quality_controlled":"1","publisher":"American Physiological Society","publication":"Journal of Neurophysiology","day":"01","year":"2023","isi":1,"date_created":"2023-02-15T14:46:14Z","doi":"10.1152/jn.00172.2022","date_published":"2023-03-01T00:00:00Z","page":"501-512"},{"file":[{"checksum":"ccaf94bf7d658ba012c016e11869b54c","file_id":"13327","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-07-31T08:11:20Z","file_name":"2023_LNCS_CAV_HenzingerT.pdf","creator":"dernst","date_updated":"2023-07-31T08:11:20Z","file_size":647760}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031377020"],"eisbn":["9783031377037"]},"publication_status":"published","volume":13965,"ec_funded":1,"oa_version":"Published Version","abstract":[{"text":"Machine-learned systems are in widespread use for making decisions about humans, and it is important that they are fair, i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure. We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden. We build monitors that observe a long sequence of events as generated by a given system, and output, after each observation, a quantitative estimate of how fair or biased the system was on that run until that point in time. The estimate is proven to be correct modulo a variable error bound and a given confidence level, where the error bound gets tighter as the observed sequence gets longer. Our monitors are of two types, and use, respectively, frequentist and Bayesian statistical inference techniques. While the frequentist monitors compute estimates that are objectively correct with respect to the ground truth, the Bayesian monitors compute estimates that are correct subject to a given prior belief about the system’s model. Using a prototype implementation, we show how we can monitor if a bank is fair in giving loans to applicants from different social backgrounds, and if a college is fair in admitting students while maintaining a reasonable financial burden on the society. Although they exhibit different theoretical complexities in certain cases, in our experiments, both frequentist and Bayesian monitors took less than a millisecond to update their verdicts after each observation.","lang":"eng"}],"month":"07","intvolume":" 13965","alternative_title":["LNCS"],"ddc":["000"],"date_updated":"2023-09-05T15:14:00Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2023-07-31T08:11:20Z","_id":"13310","status":"public","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CAV: Computer Aided Verification","end_date":"2023-07-22","location":"Paris, France","start_date":"2023-07-17"},"day":"18","publication":"Computer Aided Verification","has_accepted_license":"1","year":"2023","date_published":"2023-07-18T00:00:00Z","doi":"10.1007/978-3-031-37703-7_17","date_created":"2023-07-25T18:32:40Z","page":"358–382","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG101020093.","quality_controlled":"1","publisher":"Springer Nature","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness,” in Computer Aided Verification, Paris, France, 2023, vol. 13965, pp. 358–382.","short":"T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, Computer Aided Verification, Springer Nature, 2023, pp. 358–382.","ama":"Henzinger TA, Karimi M, Kueffner K, Mallik K. Monitoring algorithmic fairness. In: Computer Aided Verification. Vol 13965. Springer Nature; 2023:358–382. doi:10.1007/978-3-031-37703-7_17","apa":"Henzinger, T. A., Karimi, M., Kueffner, K., & Mallik, K. (2023). Monitoring algorithmic fairness. In Computer Aided Verification (Vol. 13965, pp. 358–382). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37703-7_17","mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness.” Computer Aided Verification, vol. 13965, Springer Nature, 2023, pp. 358–382, doi:10.1007/978-3-031-37703-7_17.","ista":"Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13965, 358–382.","chicago":"Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness.” In Computer Aided Verification, 13965:358–382. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37703-7_17."},"title":"Monitoring algorithmic fairness","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"orcid":"0009-0005-0820-1696","full_name":"Karimi, Mahyar","last_name":"Karimi","id":"f1dedef5-2f78-11ee-989a-c4c97bccf506","first_name":"Mahyar"},{"full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542","last_name":"Kueffner","first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515"},{"first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475"}],"article_processing_charge":"Yes (in subscription journal)","external_id":{"arxiv":["2305.15979"]},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}]},{"abstract":[{"text":"Background: This study seeks to evaluate the impact of breast cancer (BRCA) gene status on tumor dissemination pattern, surgical outcome and survival in a multicenter cohort of paired primary ovarian cancer (pOC) and recurrent ovarian cancer (rOC).\r\n\r\nPatients and Methods: Medical records and follow-up data from 190 patients were gathered retrospectively. All patients had surgery at pOC and at least one further rOC surgery at four European high-volume centers. Patients were divided into one cohort with confirmed mutation for BRCA1 and/or BRCA2 (BRCAmut) and a second cohort with BRCA wild type or unknown (BRCAwt). Patterns of tumor presentation, surgical outcome and survival data were analyzed between the two groups.\r\n\r\nResults: Patients with BRCAmut disease were on average 4 years younger and had significantly more tumor involvement upon diagnosis. Patients with BRCAmut disease showed higher debulking rates at all stages. Multivariate analysis showed that only patient age had significant predictive value for complete tumor resection in pOC. At rOC, however, only BRCAmut status significantly correlated with optimal debulking. Patients with BRCAmut disease showed significantly prolonged overall survival (OS) by 24.3 months. Progression-free survival (PFS) was prolonged in the BRCAmut group at all stages as well, reaching statistical significance during recurrence.\r\n\r\nConclusions: Patients with BRCAmut disease showed a more aggressive course of disease with earlier onset and more extensive tumor dissemination at pOC. However, surgical outcome and OS were significantly better in patients with BRCAmut disease compared with patients with BRCAwt disease. We therefore propose to consider BRCAmut status in regard to patient selection for cytoreductive surgery, especially in rOC.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"01","intvolume":" 30","publication_identifier":{"issn":["1068-9265"],"eissn":["1534-4681"]},"publication_status":"published","file":[{"success":1,"checksum":"36a1200e1011f4b2155a8041d0308f34","file_id":"12490","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2023_AnnalsSurgicalOncology_Glajzer.pdf","date_created":"2023-02-02T13:01:20Z","file_size":365865,"date_updated":"2023-02-02T13:01:20Z","creator":"dernst"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"12115","relation":"other"}]},"volume":30,"_id":"12205","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":["Oncology","Surgery"],"date_updated":"2023-09-05T15:18:37Z","ddc":["610"],"file_date_updated":"2023-02-02T13:01:20Z","department":[{"_id":"JoDa"}],"acknowledgement":"E.I.B. is a Feodor Lynen fellow of the Humboldt Foundation and a participant of the Charité Clinical Scientist Program funded by the Charité Universitätsmedizin Berlin and the Berlin Institute of Health. This work was supported by European Commission’s Seventh Framework Programme under grant agreement no. 279113 (OCTIPS; www.octips.eu).\r\nOpen Access funding enabled and organized by Projekt DEAL.","quality_controlled":"1","publisher":"Springer Nature","oa":1,"isi":1,"has_accepted_license":"1","year":"2023","day":"01","publication":"Annals of Surgical Oncology","page":"35-45","doi":"10.1245/s10434-022-12459-3","date_published":"2023-01-01T00:00:00Z","date_created":"2023-01-16T09:44:36Z","citation":{"chicago":"Glajzer, Jacek, Dan Cacsire Castillo-Tong, Rolf Richter, Ignace Vergote, Hagen Kulbe, Adriaan Vanderstichele, Ilary Ruscito, et al. “Impact of BRCA Mutation Status on Tumor Dissemination Pattern, Surgical Outcome and Patient Survival in Primary and Recurrent High-Grade Serous Ovarian Cancer: A Multicenter Retrospective Study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) Consortium.” Annals of Surgical Oncology. Springer Nature, 2023. https://doi.org/10.1245/s10434-022-12459-3.","ista":"Glajzer J, Castillo-Tong DC, Richter R, Vergote I, Kulbe H, Vanderstichele A, Ruscito I, Trillsch F, Mustea A, Kreuzinger C, Gourley C, Gabra H, Taube ET, Dorigo O, Horst D, Keunecke C, Baum J, Angelotti T, Sehouli J, Braicu EI. 2023. Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium. Annals of Surgical Oncology. 30, 35–45.","mla":"Glajzer, Jacek, et al. “Impact of BRCA Mutation Status on Tumor Dissemination Pattern, Surgical Outcome and Patient Survival in Primary and Recurrent High-Grade Serous Ovarian Cancer: A Multicenter Retrospective Study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) Consortium.” Annals of Surgical Oncology, vol. 30, Springer Nature, 2023, pp. 35–45, doi:10.1245/s10434-022-12459-3.","short":"J. Glajzer, D.C. Castillo-Tong, R. Richter, I. Vergote, H. Kulbe, A. Vanderstichele, I. Ruscito, F. Trillsch, A. Mustea, C. Kreuzinger, C. Gourley, H. Gabra, E.T. Taube, O. Dorigo, D. Horst, C. Keunecke, J. Baum, T. Angelotti, J. Sehouli, E.I. Braicu, Annals of Surgical Oncology 30 (2023) 35–45.","ieee":"J. Glajzer et al., “Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium,” Annals of Surgical Oncology, vol. 30. Springer Nature, pp. 35–45, 2023.","apa":"Glajzer, J., Castillo-Tong, D. C., Richter, R., Vergote, I., Kulbe, H., Vanderstichele, A., … Braicu, E. I. (2023). Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium. Annals of Surgical Oncology. Springer Nature. https://doi.org/10.1245/s10434-022-12459-3","ama":"Glajzer J, Castillo-Tong DC, Richter R, et al. Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium. Annals of Surgical Oncology. 2023;30:35-45. doi:10.1245/s10434-022-12459-3"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Glajzer, Jacek","last_name":"Glajzer","first_name":"Jacek"},{"first_name":"Dan Cacsire","last_name":"Castillo-Tong","full_name":"Castillo-Tong, Dan Cacsire"},{"last_name":"Richter","full_name":"Richter, Rolf","first_name":"Rolf"},{"first_name":"Ignace","full_name":"Vergote, Ignace","last_name":"Vergote"},{"full_name":"Kulbe, Hagen","last_name":"Kulbe","first_name":"Hagen"},{"first_name":"Adriaan","full_name":"Vanderstichele, Adriaan","last_name":"Vanderstichele"},{"first_name":"Ilary","last_name":"Ruscito","full_name":"Ruscito, Ilary"},{"first_name":"Fabian","full_name":"Trillsch, Fabian","last_name":"Trillsch"},{"full_name":"Mustea, Alexander","last_name":"Mustea","first_name":"Alexander"},{"last_name":"Kreuzinger","full_name":"Kreuzinger, Caroline","first_name":"Caroline","id":"382077BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gourley, Charlie","last_name":"Gourley","first_name":"Charlie"},{"first_name":"Hani","full_name":"Gabra, Hani","last_name":"Gabra"},{"first_name":"Eliane T.","last_name":"Taube","full_name":"Taube, Eliane T."},{"first_name":"Oliver","full_name":"Dorigo, Oliver","last_name":"Dorigo"},{"full_name":"Horst, David","last_name":"Horst","first_name":"David"},{"last_name":"Keunecke","full_name":"Keunecke, Carlotta","first_name":"Carlotta"},{"full_name":"Baum, Joanna","last_name":"Baum","first_name":"Joanna"},{"last_name":"Angelotti","full_name":"Angelotti, Timothy","first_name":"Timothy"},{"full_name":"Sehouli, Jalid","last_name":"Sehouli","first_name":"Jalid"},{"last_name":"Braicu","full_name":"Braicu, Elena Ioana","first_name":"Elena Ioana"}],"article_processing_charge":"No","external_id":{"isi":["000852125500006"]},"title":"Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium"},{"citation":{"ama":"Glajzer J, Castillo-Tong DC, Richter R, et al. ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium. Annals of Surgical Oncology. 2023;30:46-47. doi:10.1245/s10434-022-12681-z","apa":"Glajzer, J., Castillo-Tong, D. C., Richter, R., Vergote, I., Kulbe, H., Vanderstichele, A., … Braicu, E. I. (2023). ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium. Annals of Surgical Oncology. Springer Nature. https://doi.org/10.1245/s10434-022-12681-z","short":"J. Glajzer, D.C. Castillo-Tong, R. Richter, I. Vergote, H. Kulbe, A. Vanderstichele, I. Ruscito, F. Trillsch, A. Mustea, C. Kreuzinger, C. Gourley, H. Gabra, E.T. Taube, O. Dorigo, D. Horst, C. Keunecke, J. Baum, T. Angelotti, J. Sehouli, E.I. Braicu, Annals of Surgical Oncology 30 (2023) 46–47.","ieee":"J. Glajzer et al., “ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium,” Annals of Surgical Oncology, vol. 30. Springer Nature, pp. 46–47, 2023.","mla":"Glajzer, Jacek, et al. “ASO Visual Abstract: Impact of BRCA Mutation Status on Tumor Dissemination Pattern, Surgical Outcome, and Patient Survival in Primary and Recurrent High-Grade Serous Ovarian Cancer (HGSOC). A Multicenter, Retrospective Study of the Ovarian Cancer Therapy—Innovative Models Prolong Survival (OCTIPS) Consortium.” Annals of Surgical Oncology, vol. 30, Springer Nature, 2023, pp. 46–47, doi:10.1245/s10434-022-12681-z.","ista":"Glajzer J, Castillo-Tong DC, Richter R, Vergote I, Kulbe H, Vanderstichele A, Ruscito I, Trillsch F, Mustea A, Kreuzinger C, Gourley C, Gabra H, Taube ET, Dorigo O, Horst D, Keunecke C, Baum J, Angelotti T, Sehouli J, Braicu EI. 2023. ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium. Annals of Surgical Oncology. 30, 46–47.","chicago":"Glajzer, Jacek, Dan Cacsire Castillo-Tong, Rolf Richter, Ignace Vergote, Hagen Kulbe, Adriaan Vanderstichele, Ilary Ruscito, et al. “ASO Visual Abstract: Impact of BRCA Mutation Status on Tumor Dissemination Pattern, Surgical Outcome, and Patient Survival in Primary and Recurrent High-Grade Serous Ovarian Cancer (HGSOC). A Multicenter, Retrospective Study of the Ovarian Cancer Therapy—Innovative Models Prolong Survival (OCTIPS) Consortium.” Annals of Surgical Oncology. Springer Nature, 2023. https://doi.org/10.1245/s10434-022-12681-z."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Jacek","last_name":"Glajzer","full_name":"Glajzer, Jacek"},{"full_name":"Castillo-Tong, Dan Cacsire","last_name":"Castillo-Tong","first_name":"Dan Cacsire"},{"first_name":"Rolf","full_name":"Richter, Rolf","last_name":"Richter"},{"first_name":"Ignace","full_name":"Vergote, Ignace","last_name":"Vergote"},{"last_name":"Kulbe","full_name":"Kulbe, Hagen","first_name":"Hagen"},{"first_name":"Adriaan","last_name":"Vanderstichele","full_name":"Vanderstichele, Adriaan"},{"full_name":"Ruscito, Ilary","last_name":"Ruscito","first_name":"Ilary"},{"first_name":"Fabian","full_name":"Trillsch, Fabian","last_name":"Trillsch"},{"full_name":"Mustea, Alexander","last_name":"Mustea","first_name":"Alexander"},{"full_name":"Kreuzinger, Caroline","last_name":"Kreuzinger","id":"382077BA-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline"},{"full_name":"Gourley, Charlie","last_name":"Gourley","first_name":"Charlie"},{"last_name":"Gabra","full_name":"Gabra, Hani","first_name":"Hani"},{"first_name":"Eliane T.","full_name":"Taube, Eliane T.","last_name":"Taube"},{"last_name":"Dorigo","full_name":"Dorigo, Oliver","first_name":"Oliver"},{"last_name":"Horst","full_name":"Horst, David","first_name":"David"},{"full_name":"Keunecke, Carlotta","last_name":"Keunecke","first_name":"Carlotta"},{"last_name":"Baum","full_name":"Baum, Joanna","first_name":"Joanna"},{"full_name":"Angelotti, Timothy","last_name":"Angelotti","first_name":"Timothy"},{"first_name":"Jalid","last_name":"Sehouli","full_name":"Sehouli, Jalid"},{"last_name":"Braicu","full_name":"Braicu, Elena Ioana","first_name":"Elena Ioana"}],"article_processing_charge":"No","external_id":{"isi":["000879151800001"]},"title":"ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium","acknowledgement":"This work was supported by European Commission’s Seventh Framework Programme under Grant Agreement No. 279113 (OCTIPS; www.octips.eu).","publisher":"Springer Nature","quality_controlled":"1","oa":1,"isi":1,"year":"2023","day":"01","publication":"Annals of Surgical Oncology","page":"46-47","date_published":"2023-01-01T00:00:00Z","doi":"10.1245/s10434-022-12681-z","date_created":"2023-01-12T11:56:22Z","_id":"12115","article_type":"original","type":"journal_article","status":"public","keyword":["Oncology","Surgery"],"date_updated":"2023-09-05T15:18:36Z","department":[{"_id":"JoDa"}],"oa_version":"Published Version","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1245/s10434-022-12681-z"}],"month":"01","intvolume":" 30","publication_identifier":{"eissn":["1534-4681"],"issn":["1068-9265"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":30,"related_material":{"record":[{"relation":"other","status":"public","id":"12205"}]}},{"article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"14253","file_date_updated":"2023-09-06T06:50:07Z","department":[{"_id":"RySh"}],"date_updated":"2023-09-06T06:53:32Z","ddc":["570"],"scopus_import":"1","month":"08","intvolume":" 14","abstract":[{"text":"Junctions between the endoplasmic reticulum (ER) and the plasma membrane (PM) are specialized membrane contacts ubiquitous in eukaryotic cells. Concentration of intracellular signaling machinery near ER-PM junctions allows these domains to serve critical roles in lipid and Ca2+ signaling and homeostasis. Subcellular compartmentalization of protein kinase A (PKA) signaling also regulates essential cellular functions, however, no specific association between PKA and ER-PM junctional domains is known. Here, we show that in brain neurons type I PKA is directed to Kv2.1 channel-dependent ER-PM junctional domains via SPHKAP, a type I PKA-specific anchoring protein. SPHKAP association with type I PKA regulatory subunit RI and ER-resident VAP proteins results in the concentration of type I PKA between stacked ER cisternae associated with ER-PM junctions. This ER-associated PKA signalosome enables reciprocal regulation between PKA and Ca2+ signaling machinery to support Ca2+ influx and excitation-transcription coupling. These data reveal that neuronal ER-PM junctions support a receptor-independent form of PKA signaling driven by membrane depolarization and intracellular Ca2+, allowing conversion of information encoded in electrical signals into biochemical changes universally recognized throughout the cell.","lang":"eng"}],"oa_version":"Published Version","pmid":1,"volume":14,"publication_identifier":{"eissn":["2041-1723"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"6ab8aab4e957f626a09a1c73db3388fb","file_id":"14270","creator":"dernst","file_size":9412549,"date_updated":"2023-09-06T06:50:07Z","file_name":"2023_NatureComm_Vierra.pdf","date_created":"2023-09-06T06:50:07Z"}],"language":[{"iso":"eng"}],"article_number":"5231","author":[{"first_name":"Nicholas C.","full_name":"Vierra, Nicholas C.","last_name":"Vierra"},{"first_name":"Luisa","full_name":"Ribeiro-Silva, Luisa","last_name":"Ribeiro-Silva"},{"last_name":"Kirmiz","full_name":"Kirmiz, Michael","first_name":"Michael"},{"first_name":"Deborah","last_name":"Van Der List","full_name":"Van Der List, Deborah"},{"id":"45EDD1BC-F248-11E8-B48F-1D18A9856A87","first_name":"Pradeep","orcid":"0000-0003-0863-4481","full_name":"Bhandari, Pradeep","last_name":"Bhandari"},{"full_name":"Mack, Olivia A.","last_name":"Mack","first_name":"Olivia A."},{"first_name":"James","full_name":"Carroll, James","last_name":"Carroll"},{"first_name":"Elodie","id":"3B59276A-F248-11E8-B48F-1D18A9856A87","full_name":"Le Monnier, Elodie","last_name":"Le Monnier"},{"last_name":"Aicher","full_name":"Aicher, Sue A.","first_name":"Sue A."},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"},{"first_name":"James S.","full_name":"Trimmer, James S.","last_name":"Trimmer"}],"external_id":{"pmid":["37633939"]},"article_processing_charge":"Yes","title":"Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling","citation":{"mla":"Vierra, Nicholas C., et al. “Neuronal ER-Plasma Membrane Junctions Couple Excitation to Ca2+-Activated PKA Signaling.” Nature Communications, vol. 14, 5231, Springer Nature, 2023, doi:10.1038/s41467-023-40930-6.","ieee":"N. C. Vierra et al., “Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling,” Nature Communications, vol. 14. Springer Nature, 2023.","short":"N.C. Vierra, L. Ribeiro-Silva, M. Kirmiz, D. Van Der List, P. Bhandari, O.A. Mack, J. Carroll, E. Le Monnier, S.A. Aicher, R. Shigemoto, J.S. Trimmer, Nature Communications 14 (2023).","apa":"Vierra, N. C., Ribeiro-Silva, L., Kirmiz, M., Van Der List, D., Bhandari, P., Mack, O. A., … Trimmer, J. S. (2023). Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-023-40930-6","ama":"Vierra NC, Ribeiro-Silva L, Kirmiz M, et al. Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling. Nature Communications. 2023;14. doi:10.1038/s41467-023-40930-6","chicago":"Vierra, Nicholas C., Luisa Ribeiro-Silva, Michael Kirmiz, Deborah Van Der List, Pradeep Bhandari, Olivia A. Mack, James Carroll, et al. “Neuronal ER-Plasma Membrane Junctions Couple Excitation to Ca2+-Activated PKA Signaling.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-40930-6.","ista":"Vierra NC, Ribeiro-Silva L, Kirmiz M, Van Der List D, Bhandari P, Mack OA, Carroll J, Le Monnier E, Aicher SA, Shigemoto R, Trimmer JS. 2023. Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling. Nature Communications. 14, 5231."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"We thank Kayla Templeton and Peter Turcanu for technical assistance, Michelle Salemi for assistance with LC-MS data acquisition and analysis, Dr. Belvin Gong for advice on monoclonal antibody generation, Drs. Maria Casas Prat and Eamonn Dickson for assistance with super-resolution TIRF microscopy, Dr. Oscar Cerda for assistance with the design of TAT-FFAT peptides, Dr. Fernando Santana for helpful discussions, and Dr. Jodi Nunnari for a careful reading of our manuscript. We also thank Dr. Alan Howe, Dr. Sohum Mehta, and Dr. Jin Zhang for providing plasmids used in this study. This project was funded by NIH Grants R01NS114210 and R21NS101648 (J.S.T.), and F32NS108519 (N.C.V.).","doi":"10.1038/s41467-023-40930-6","date_published":"2023-08-26T00:00:00Z","date_created":"2023-09-03T22:01:14Z","has_accepted_license":"1","year":"2023","day":"26","publication":"Nature Communications"},{"type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CAV: Computer Aided Verification","location":"Paris, France","end_date":"2023-07-22","start_date":"2023-07-17"},"status":"public","_id":"14259","department":[{"_id":"KrCh"}],"file_date_updated":"2023-09-06T08:25:50Z","date_updated":"2023-09-06T08:27:33Z","ddc":["000"],"scopus_import":"1","alternative_title":["LNCS"],"month":"07","intvolume":" 13964","abstract":[{"lang":"eng","text":"We provide a learning-based technique for guessing a winning strategy in a parity game originating from an LTL synthesis problem. A cheaply obtained guess can be useful in several applications. Not only can the guessed strategy be applied as best-effort in cases where the game’s huge size prohibits rigorous approaches, but it can also increase the scalability of rigorous LTL synthesis in several ways. Firstly, checking whether a guessed strategy is winning is easier than constructing one. Secondly, even if the guess is wrong in some places, it can be fixed by strategy iteration faster than constructing one from scratch. Thirdly, the guess can be used in on-the-fly approaches to prioritize exploration in the most fruitful directions.\r\nIn contrast to previous works, we (i) reflect the highly structured logical information in game’s states, the so-called semantic labelling, coming from the recent LTL-to-automata translations, and (ii) learn to reflect it properly by learning from previously solved games, bringing the solving process closer to human-like reasoning."}],"oa_version":"Published Version","volume":13964,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031377051"],"eissn":["1611-3349"]},"publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"14276","checksum":"ed66278b61bb869e1baba3d9b9081271","success":1,"date_updated":"2023-09-06T08:25:50Z","file_size":428354,"creator":"dernst","date_created":"2023-09-06T08:25:50Z","file_name":"2023_LNCS_CAV_Kretinsky.pdf"}],"language":[{"iso":"eng"}],"author":[{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165"},{"last_name":"Prokop","full_name":"Prokop, Maximilian","first_name":"Maximilian"},{"last_name":"Rieder","full_name":"Rieder, Sabine","first_name":"Sabine"}],"article_processing_charge":"Yes (in subscription journal)","title":"Guessing winning policies in LTL synthesis by semantic learning","citation":{"ista":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. 2023. Guessing winning policies in LTL synthesis by semantic learning. 35th International Conference on Computer Aided Verification . CAV: Computer Aided Verification, LNCS, vol. 13964, 390–414.","chicago":"Kretinsky, Jan, Tobias Meggendorfer, Maximilian Prokop, and Sabine Rieder. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” In 35th International Conference on Computer Aided Verification , 13964:390–414. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37706-8_20.","ama":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. Guessing winning policies in LTL synthesis by semantic learning. In: 35th International Conference on Computer Aided Verification . Vol 13964. Springer Nature; 2023:390-414. doi:10.1007/978-3-031-37706-8_20","apa":"Kretinsky, J., Meggendorfer, T., Prokop, M., & Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In 35th International Conference on Computer Aided Verification (Vol. 13964, pp. 390–414). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_20","short":"J. Kretinsky, T. Meggendorfer, M. Prokop, S. Rieder, in:, 35th International Conference on Computer Aided Verification , Springer Nature, 2023, pp. 390–414.","ieee":"J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning policies in LTL synthesis by semantic learning,” in 35th International Conference on Computer Aided Verification , Paris, France, 2023, vol. 13964, pp. 390–414.","mla":"Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” 35th International Conference on Computer Aided Verification , vol. 13964, Springer Nature, 2023, pp. 390–414, doi:10.1007/978-3-031-37706-8_20."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"This research was funded in part by the German Research Foundation (DFG) project 427755713 Group-By Objectives in Probabilistic Verification (GOPro).","page":"390-414","doi":"10.1007/978-3-031-37706-8_20","date_published":"2023-07-17T00:00:00Z","date_created":"2023-09-03T22:01:16Z","has_accepted_license":"1","year":"2023","day":"17","publication":"35th International Conference on Computer Aided Verification "},{"acknowledgement":"The authors are grateful to the referee for her/his detailed and constructive report, which has allowed us to improve our article. S. M. acknowledges support from the CNES GOLF-SOHO and PLATO grants at CEA/DAp and PNPS (CNRS/INSU). We thank R. A. Garcia for fruitful discussions and suggestions.","oa":1,"quality_controlled":"1","publisher":"EDP Sciences","year":"2023","has_accepted_license":"1","isi":1,"publication":"Astronomy and Astrophysics","day":"01","date_created":"2023-09-03T22:01:15Z","doi":"10.1051/0004-6361/202346832","date_published":"2023-08-01T00:00:00Z","article_number":"L9","citation":{"ista":"Mathis S, Bugnet LA. 2023. Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields. Astronomy and Astrophysics. 676, L9.","chicago":"Mathis, S., and Lisa Annabelle Bugnet. “Asymmetries of Frequency Splittings of Dipolar Mixed Modes: A Window on the Topology of Deep Magnetic Fields.” Astronomy and Astrophysics. EDP Sciences, 2023. https://doi.org/10.1051/0004-6361/202346832.","ama":"Mathis S, Bugnet LA. Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields. Astronomy and Astrophysics. 2023;676. doi:10.1051/0004-6361/202346832","apa":"Mathis, S., & Bugnet, L. A. (2023). Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields. Astronomy and Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202346832","ieee":"S. Mathis and L. A. Bugnet, “Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields,” Astronomy and Astrophysics, vol. 676. EDP Sciences, 2023.","short":"S. Mathis, L.A. Bugnet, Astronomy and Astrophysics 676 (2023).","mla":"Mathis, S., and Lisa Annabelle Bugnet. “Asymmetries of Frequency Splittings of Dipolar Mixed Modes: A Window on the Topology of Deep Magnetic Fields.” Astronomy and Astrophysics, vol. 676, L9, EDP Sciences, 2023, doi:10.1051/0004-6361/202346832."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"Yes (in subscription journal)","external_id":{"arxiv":["2306.11587"],"isi":["001046037700007"]},"author":[{"full_name":"Mathis, S.","last_name":"Mathis","first_name":"S."},{"full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle"}],"title":"Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields","abstract":[{"lang":"eng","text":"Context. Space asteroseismology is revolutionizing our knowledge of the internal structure and dynamics of stars. A breakthrough is ongoing with the recent discoveries of signatures of strong magnetic fields in the core of red giant stars. The key signature for such a detection is the asymmetry these fields induce in the frequency splittings of observed dipolar mixed gravito-acoustic modes.\r\nAims. We investigate the ability of the observed asymmetries of the frequency splittings of dipolar mixed modes to constrain the geometrical properties of deep magnetic fields.\r\nMethods. We used the powerful analytical Racah-Wigner algebra used in quantum mechanics to characterize the geometrical couplings of dipolar mixed oscillation modes with various realistically plausible topologies of fossil magnetic fields. We also computed the induced perturbation of their frequencies.\r\nResults. First, in the case of an oblique magnetic dipole, we provide the exact analytical expression of the asymmetry as a function of the angle between the rotation and magnetic axes. Its value provides a direct measure of this angle. Second, considering a combination of axisymmetric dipolar and quadrupolar fields, we show how the asymmetry is blind to the unraveling of the relative strength and sign of each component. Finally, in the case of a given multipole, we show that a negative asymmetry is a signature of non-axisymmetric topologies.\r\nConclusions. Asymmetries of dipolar mixed modes provide a key bit of information on the geometrical topology of deep fossil magnetic fields, but this is insufficient on its own. Asteroseismic constraints should therefore be combined with spectropolarimetric observations and numerical simulations, which aim to predict the more probable stable large-scale geometries."}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 676","month":"08","publication_status":"published","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"language":[{"iso":"eng"}],"file":[{"file_size":458120,"date_updated":"2023-09-06T07:13:19Z","creator":"dernst","file_name":"2023_AstronomyAstrophysics_Mathis.pdf","date_created":"2023-09-06T07:13:19Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"7b30d26fb2b7bcb5b5be1414950615f9","file_id":"14271"}],"volume":676,"_id":"14256","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":"letter_note","status":"public","date_updated":"2023-09-06T11:05:58Z","ddc":["520"],"file_date_updated":"2023-09-06T07:13:19Z","department":[{"_id":"LiBu"}]},{"acknowledgement":"Financial supports for this work via a PhD scholarship for J. Gamper issued by the Leopold-Franzens-University of Innsbruck (Vicerector Prof. Dr Ulrike Tanzer) are gratefully acknowledged. The computational results presented have been achieved (in part) using the HPC infrastructure of the University of Innsbruck.","publisher":"American Chemical Society","quality_controlled":"1","oa":1,"day":"11","publication":"Journal of Physical Chemistry Letters","has_accepted_license":"1","isi":1,"year":"2023","date_published":"2023-08-11T00:00:00Z","doi":"10.1021/acs.jpclett.3c01707","date_created":"2023-09-03T22:01:16Z","page":"7395-7403","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Gamper, Jakob, Florian Kluibenschedl, Alexander K.H. Weiss, and Thomas S. Hofer. “Accessing Position Space Wave Functions in Band Structure Calculations of Periodic Systems - a Generalized, Adapted Numerov Implementation for One-, Two-, and Three-Dimensional Quantum Problems.” Journal of Physical Chemistry Letters. American Chemical Society, 2023. https://doi.org/10.1021/acs.jpclett.3c01707.","ista":"Gamper J, Kluibenschedl F, Weiss AKH, Hofer TS. 2023. Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems. Journal of Physical Chemistry Letters. 14(33), 7395–7403.","mla":"Gamper, Jakob, et al. “Accessing Position Space Wave Functions in Band Structure Calculations of Periodic Systems - a Generalized, Adapted Numerov Implementation for One-, Two-, and Three-Dimensional Quantum Problems.” Journal of Physical Chemistry Letters, vol. 14, no. 33, American Chemical Society, 2023, pp. 7395–403, doi:10.1021/acs.jpclett.3c01707.","apa":"Gamper, J., Kluibenschedl, F., Weiss, A. K. H., & Hofer, T. S. (2023). Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems. Journal of Physical Chemistry Letters. American Chemical Society. https://doi.org/10.1021/acs.jpclett.3c01707","ama":"Gamper J, Kluibenschedl F, Weiss AKH, Hofer TS. Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems. Journal of Physical Chemistry Letters. 2023;14(33):7395-7403. doi:10.1021/acs.jpclett.3c01707","short":"J. Gamper, F. Kluibenschedl, A.K.H. Weiss, T.S. Hofer, Journal of Physical Chemistry Letters 14 (2023) 7395–7403.","ieee":"J. Gamper, F. Kluibenschedl, A. K. H. Weiss, and T. S. Hofer, “Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems,” Journal of Physical Chemistry Letters, vol. 14, no. 33. American Chemical Society, pp. 7395–7403, 2023."},"title":"Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems","author":[{"full_name":"Gamper, Jakob","last_name":"Gamper","first_name":"Jakob"},{"last_name":"Kluibenschedl","full_name":"Kluibenschedl, Florian","id":"7499e70e-eb2c-11ec-b98b-f925648bc9d9","first_name":"Florian"},{"first_name":"Alexander K.H.","last_name":"Weiss","full_name":"Weiss, Alexander K.H."},{"last_name":"Hofer","full_name":"Hofer, Thomas S.","first_name":"Thomas S."}],"external_id":{"pmid":["37566743"],"isi":["001048165800001"]},"article_processing_charge":"Yes (in subscription journal)","oa_version":"Published Version","pmid":1,"abstract":[{"text":"In this work, a generalized, adapted Numerov implementation capable of determining band structures of periodic quantum systems is outlined. Based on the input potential, the presented approach numerically solves the Schrödinger equation in position space at each momentum space point. Thus, in addition to the band structure, the method inherently provides information about the state functions and probability densities in position space at each momentum space point considered. The generalized, adapted Numerov framework provided reliable estimates for a variety of increasingly complex test suites in one, two, and three dimensions. The accuracy of the proposed methodology was benchmarked against results obtained for the analytically solvable Kronig-Penney model. Furthermore, the presented numerical solver was applied to a model potential representing a 2D optical lattice being a challenging application relevant, for example, in the field of quantum computing.","lang":"eng"}],"month":"08","intvolume":" 14","scopus_import":"1","file":[{"file_name":"2023_JourPhysChemistry_Gamper.pdf","date_created":"2023-09-06T07:32:39Z","file_size":4986859,"date_updated":"2023-09-06T07:32:39Z","creator":"dernst","success":1,"file_id":"14272","checksum":"637454e2b3a357498d8d622d241c4bf6","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1948-7185"]},"publication_status":"published","issue":"33","volume":14,"_id":"14261","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["530","540"],"date_updated":"2023-09-06T11:04:31Z","file_date_updated":"2023-09-06T07:32:39Z","department":[{"_id":"GradSch"}]},{"date_updated":"2023-09-15T06:39:17Z","ddc":["570"],"file_date_updated":"2023-09-15T06:30:50Z","department":[{"_id":"EdHa"}],"_id":"14277","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","publication_identifier":{"issn":["2835-8279"]},"publication_status":"published","file":[{"creator":"dernst","date_updated":"2023-09-15T06:30:50Z","file_size":2559520,"date_created":"2023-09-15T06:30:50Z","file_name":"2023_PRXLife_Boocock.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"f881d98c89eb9f1aa136d7b781511553","file_id":"14335","success":1}],"language":[{"iso":"eng"}],"issue":"1","volume":1,"ec_funded":1,"abstract":[{"text":"Living tissues are characterized by an intrinsically mechanochemical interplay of active physical forces and complex biochemical signaling pathways. Either feature alone can give rise to complex emergent phenomena, for example, mechanically driven glassy dynamics and rigidity transitions, or chemically driven reaction-diffusion instabilities. An important question is how to quantitatively assess the contribution of these different cues to the large-scale dynamics of biological materials. We address this in Madin-Darby canine kidney (MDCK) monolayers, considering both mechanochemical feedback between extracellular signal-regulated kinase (ERK) signaling activity and cellular density as well as a mechanically active tissue rheology via a self-propelled vertex model. We show that the relative strength of active migration forces to mechanochemical couplings controls a transition from a uniform active glass to periodic spatiotemporal waves. We parametrize the model from published experimental data sets on MDCK monolayers and use it to make new predictions on the correlation functions of cellular dynamics and the dynamics of topological defects associated with the oscillatory phase of cells. Interestingly, MDCK monolayers are best described by an intermediary parameter region in which both mechanochemical couplings and noisy active propulsion have a strong influence on the dynamics. Finally, we study how tissue rheology and ERK waves produce feedback on one another and uncover a mechanism via which tissue fluidity can be controlled by mechanochemical waves at both the local and global levels.","lang":"eng"}],"oa_version":"Published Version","month":"07","intvolume":" 1","citation":{"mla":"Boocock, Daniel R., et al. “Interplay between Mechanochemical Patterning and Glassy Dynamics in Cellular Monolayers.” PRX Life, vol. 1, no. 1, 013001, American Physical Society, 2023, doi:10.1103/prxlife.1.013001.","short":"D.R. Boocock, T. Hirashima, E.B. Hannezo, PRX Life 1 (2023).","ieee":"D. R. Boocock, T. Hirashima, and E. B. Hannezo, “Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers,” PRX Life, vol. 1, no. 1. American Physical Society, 2023.","ama":"Boocock DR, Hirashima T, Hannezo EB. Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers. PRX Life. 2023;1(1). doi:10.1103/prxlife.1.013001","apa":"Boocock, D. R., Hirashima, T., & Hannezo, E. B. (2023). Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers. PRX Life. American Physical Society. https://doi.org/10.1103/prxlife.1.013001","chicago":"Boocock, Daniel R, Tsuyoshi Hirashima, and Edouard B Hannezo. “Interplay between Mechanochemical Patterning and Glassy Dynamics in Cellular Monolayers.” PRX Life. American Physical Society, 2023. https://doi.org/10.1103/prxlife.1.013001.","ista":"Boocock DR, Hirashima T, Hannezo EB. 2023. Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers. PRX Life. 1(1), 013001."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"453AF628-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel R","orcid":"0000-0002-1585-2631","full_name":"Boocock, Daniel R","last_name":"Boocock"},{"last_name":"Hirashima","full_name":"Hirashima, Tsuyoshi","first_name":"Tsuyoshi"},{"first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561"}],"article_processing_charge":"Yes","title":"Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers","article_number":"013001","project":[{"grant_number":"851288","name":"Design Principles of Branching Morphogenesis","call_identifier":"H2020","_id":"05943252-7A3F-11EA-A408-12923DDC885E"}],"has_accepted_license":"1","year":"2023","day":"20","publication":"PRX Life","doi":"10.1103/prxlife.1.013001","date_published":"2023-07-20T00:00:00Z","date_created":"2023-09-06T08:30:59Z","acknowledgement":"We thank all members of the Hannezo group for discussions and suggestions, as well as Sound Wai Phow for technical assistance. This work received funding from the European Research Council under the EU Horizon 2020 research and innovation program Grant Agreement No. 851288 (E.H.), JSPS KAKENHI Grant No. 21H05290, and the Ministry of Education under the Research Centres of Excellence program through the MBI at NUS.","quality_controlled":"1","publisher":"American Physical Society","oa":1},{"day":"26","publication":"Cell Reports","has_accepted_license":"1","year":"2023","date_published":"2023-09-26T00:00:00Z","doi":"10.1016/j.celrep.2023.113015","date_created":"2023-09-10T22:01:11Z","acknowledgement":"We thank A. Cumpelik, H. Chiossi, and L. Bollman for comments on an earlier version of this manuscript. This work was funded by EU-FP7 MC-ITN IN-SENS (grant 607616).","quality_controlled":"1","publisher":"Elsevier","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Nardin, M., Käfer, K., Stella, F., & Csicsvari, J. L. (2023). Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2023.113015","ama":"Nardin M, Käfer K, Stella F, Csicsvari JL. Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions. Cell Reports. 2023;42(9). doi:10.1016/j.celrep.2023.113015","short":"M. Nardin, K. Käfer, F. Stella, J.L. Csicsvari, Cell Reports 42 (2023).","ieee":"M. Nardin, K. Käfer, F. Stella, and J. L. Csicsvari, “Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions,” Cell Reports, vol. 42, no. 9. Elsevier, 2023.","mla":"Nardin, Michele, et al. “Theta Oscillations as a Substrate for Medial Prefrontal-Hippocampal Assembly Interactions.” Cell Reports, vol. 42, no. 9, 113015, Elsevier, 2023, doi:10.1016/j.celrep.2023.113015.","ista":"Nardin M, Käfer K, Stella F, Csicsvari JL. 2023. Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions. Cell Reports. 42(9), 113015.","chicago":"Nardin, Michele, Karola Käfer, Federico Stella, and Jozsef L Csicsvari. “Theta Oscillations as a Substrate for Medial Prefrontal-Hippocampal Assembly Interactions.” Cell Reports. Elsevier, 2023. https://doi.org/10.1016/j.celrep.2023.113015."},"title":"Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions","author":[{"full_name":"Nardin, Michele","orcid":"0000-0001-8849-6570","last_name":"Nardin","first_name":"Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Käfer","full_name":"Käfer, Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","first_name":"Karola"},{"last_name":"Stella","full_name":"Stella, Federico","orcid":"0000-0001-9439-3148","first_name":"Federico","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L"}],"article_processing_charge":"Yes","external_id":{"pmid":["37632747"]},"article_number":"113015","project":[{"name":"Inter-and intracellular signalling in schizophrenia","grant_number":"607616","_id":"257BBB4C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"file":[{"creator":"dernst","file_size":4879455,"date_updated":"2023-09-15T07:12:46Z","file_name":"2023_CellPress_Nardin.pdf","date_created":"2023-09-15T07:12:46Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"14337","checksum":"ca77a304fb813c292550b8604b0fb41d"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2211-1247"]},"publication_status":"published","issue":"9","volume":42,"ec_funded":1,"oa_version":"Published Version","pmid":1,"abstract":[{"text":"The execution of cognitive functions requires coordinated circuit activity across different brain areas that involves the associated firing of neuronal assemblies. Here, we tested the circuit mechanism behind assembly interactions between the hippocampus and the medial prefrontal cortex (mPFC) of adult rats by recording neuronal populations during a rule-switching task. We identified functionally coupled CA1-mPFC cells that synchronized their activity beyond that expected from common spatial coding or oscillatory firing. When such cell pairs fired together, the mPFC cell strongly phase locked to CA1 theta oscillations and maintained consistent theta firing phases, independent of the theta timing of their CA1 counterpart. These functionally connected CA1-mPFC cells formed interconnected assemblies. While firing together with their CA1 assembly partners, mPFC cells fired along specific theta sequences. Our results suggest that upregulated theta oscillatory firing of mPFC cells can signal transient interactions with specific CA1 assemblies, thus enabling distributed computations.","lang":"eng"}],"month":"09","intvolume":" 42","scopus_import":"1","ddc":["570"],"date_updated":"2023-09-15T07:14:12Z","file_date_updated":"2023-09-15T07:12:46Z","department":[{"_id":"JoCs"}],"_id":"14314","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)"}},{"doi":"10.7554/eLife.89066","date_published":"2023-09-04T00:00:00Z","date_created":"2023-09-10T22:01:11Z","day":"04","publication":"eLife","has_accepted_license":"1","year":"2023","publisher":"eLife Sciences Publications","quality_controlled":"1","oa":1,"acknowledgement":"We thank the members of the Hetzer laboratory, Tony Hunter (Salk), Lorenzo Puri (Sanford Burnham Prebys), and Jongmin Kim (Massachusetts General Hospital) for the critical reading of the manuscript; Kenneth Diffenderfer and Aimee Pankonin (Stem Cell Core at the Salk Institute) for help with neurogenesis; Carol Marchetto and Fred Gage (Salk) for providing H9 embryonic stem cells; Lorenzo Puri, Alexandra Sacco, and Luca Caputo (Sanford Burnham Prebys) for helpful discussions and sharing mouse primary myoblasts. This work was supported by a Glenn Foundation for Medical Research Postdoctoral Fellowship in Aging Research (UHC), the NOMIS foundation (MWH), and the National Institutes of Health (R01 NS096786 to MWH and K01 AR080828 to UHC). This work was also supported by the Mass Spectrometry Core of the Salk Institute with funding from NIH-NCI CCSG: P30 014195 and the Helmsley Center for Genomic Medicine. We thank Jolene Diedrich and Antonio Pinto for technical support.","title":"Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress","author":[{"full_name":"Cho, Ukrae H.","last_name":"Cho","first_name":"Ukrae H."},{"first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"Hetzer, Martin W","orcid":"0000-0002-2111-992X","last_name":"Hetzer"}],"article_processing_charge":"Yes","external_id":{"pmid":["37665327"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"U. H. Cho and M. Hetzer, “Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress,” eLife, vol. 12. eLife Sciences Publications, 2023.","short":"U.H. Cho, M. Hetzer, ELife 12 (2023).","ama":"Cho UH, Hetzer M. Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress. eLife. 2023;12. doi:10.7554/eLife.89066","apa":"Cho, U. H., & Hetzer, M. (2023). Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.89066","mla":"Cho, Ukrae H., and Martin Hetzer. “Caspase-Mediated Nuclear Pore Complex Trimming in Cell Differentiation and Endoplasmic Reticulum Stress.” ELife, vol. 12, RP89066, eLife Sciences Publications, 2023, doi:10.7554/eLife.89066.","ista":"Cho UH, Hetzer M. 2023. Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress. eLife. 12, RP89066.","chicago":"Cho, Ukrae H., and Martin Hetzer. “Caspase-Mediated Nuclear Pore Complex Trimming in Cell Differentiation and Endoplasmic Reticulum Stress.” ELife. eLife Sciences Publications, 2023. https://doi.org/10.7554/eLife.89066."},"article_number":"RP89066","volume":12,"file":[{"checksum":"db24bf3d595507387b48d3799c33e289","file_id":"14336","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-09-15T06:59:10Z","file_name":"2023_eLife_Cho.pdf","date_updated":"2023-09-15T06:59:10Z","file_size":3703097,"creator":"dernst"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2050-084X"]},"publication_status":"published","month":"09","intvolume":" 12","scopus_import":"1","oa_version":"Published Version","pmid":1,"abstract":[{"text":"During apoptosis, caspases degrade 8 out of ~30 nucleoporins to irreversibly demolish the nuclear pore complex. However, for poorly understood reasons, caspases are also activated during cell differentiation. Here, we show that sublethal activation of caspases during myogenesis results in the transient proteolysis of four peripheral Nups and one transmembrane Nup. ‘Trimmed’ NPCs become nuclear export-defective, and we identified in an unbiased manner several classes of cytoplasmic, plasma membrane, and mitochondrial proteins that rapidly accumulate in the nucleus. NPC trimming by non-apoptotic caspases was also observed in neurogenesis and endoplasmic reticulum stress. Our results suggest that caspases can reversibly modulate nuclear transport activity, which allows them to function as agents of cell differentiation and adaptation at sublethal levels.","lang":"eng"}],"file_date_updated":"2023-09-15T06:59:10Z","department":[{"_id":"MaHe"}],"ddc":["570"],"date_updated":"2023-09-15T07:07:10Z","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)"},"_id":"14315"},{"date_updated":"2023-09-15T08:12:30Z","ddc":["510"],"file_date_updated":"2023-09-15T08:02:09Z","department":[{"_id":"MaKw"}],"_id":"14319","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"status":"public","publication_identifier":{"eissn":["1077-8926"]},"publication_status":"published","file":[{"checksum":"52c46c8cb329f9aaee9ade01525f317b","file_id":"14338","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-09-15T08:02:09Z","file_name":"2023_elecJournCombinatorics_Anastos.pdf","date_updated":"2023-09-15T08:02:09Z","file_size":247917,"creator":"dernst"}],"language":[{"iso":"eng"}],"volume":30,"issue":"3","ec_funded":1,"license":"https://creativecommons.org/licenses/by-nd/4.0/","abstract":[{"text":"We study multigraphs whose edge-sets are the union of three perfect matchings, M1, M2, and M3. Given such a graph G and any a1; a2; a3 2 N with a1 +a2 +a3 6 n - 2, we show there exists a matching M of G with jM \\ Mij = ai for each i 2 f1; 2; 3g. The bound n - 2 in the theorem is best possible in general. We conjecture however that if G is bipartite, the same result holds with n - 2 replaced by n - 1. We give a construction that shows such a result would be tight. We\r\nalso make a conjecture generalising the Ryser-Brualdi-Stein conjecture with colour\r\nmultiplicities.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"07","intvolume":" 30","citation":{"mla":"Anastos, Michael, et al. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” Electronic Journal of Combinatorics, vol. 30, no. 3, P3.10, Electronic Journal of Combinatorics, 2023, doi:10.37236/11714.","apa":"Anastos, M., Fabian, D., Müyesser, A., & Szabó, T. (2023). Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11714","ama":"Anastos M, Fabian D, Müyesser A, Szabó T. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 2023;30(3). doi:10.37236/11714","short":"M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023).","ieee":"M. Anastos, D. Fabian, A. Müyesser, and T. Szabó, “Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets,” Electronic Journal of Combinatorics, vol. 30, no. 3. Electronic Journal of Combinatorics, 2023.","chicago":"Anastos, Michael, David Fabian, Alp Müyesser, and Tibor Szabó. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023. https://doi.org/10.37236/11714.","ista":"Anastos M, Fabian D, Müyesser A, Szabó T. 2023. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 30(3), P3.10."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Michael","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","full_name":"Anastos, Michael","last_name":"Anastos"},{"full_name":"Fabian, David","last_name":"Fabian","first_name":"David"},{"full_name":"Müyesser, Alp","last_name":"Müyesser","first_name":"Alp"},{"first_name":"Tibor","last_name":"Szabó","full_name":"Szabó, Tibor"}],"article_processing_charge":"Yes","external_id":{"arxiv":["2212.03100"]},"title":"Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets","article_number":"P3.10","project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"has_accepted_license":"1","year":"2023","day":"28","publication":"Electronic Journal of Combinatorics","date_published":"2023-07-28T00:00:00Z","doi":"10.37236/11714","date_created":"2023-09-10T22:01:12Z","acknowledgement":"Anastos has received funding from the European Union’s Horizon 2020 research and in-novation programme under the Marie Sk lodowska-Curie grant agreement No 101034413.Fabian’s research is supported by the Deutsche Forschungsgemeinschaft (DFG, GermanResearch Foundation) Graduiertenkolleg “Facets of Complexity” (GRK 2434).","quality_controlled":"1","publisher":"Electronic Journal of Combinatorics","oa":1},{"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"citation":{"chicago":"Sun, Yican, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” In Computer Aided Verification, 13966:16–39. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_2.","ista":"Sun Y, Fu H, Chatterjee K, Goharshady AK. 2023. Automated tail bound analysis for probabilistic recurrence relations. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 16–39.","mla":"Sun, Yican, et al. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 16–39, doi:10.1007/978-3-031-37709-9_2.","apa":"Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In Computer Aided Verification (Vol. 13966, pp. 16–39). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_2","ama":"Sun Y, Fu H, Chatterjee K, Goharshady AK. Automated tail bound analysis for probabilistic recurrence relations. In: Computer Aided Verification. Vol 13966. Springer Nature; 2023:16-39. doi:10.1007/978-3-031-37709-9_2","ieee":"Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Automated tail bound analysis for probabilistic recurrence relations,” in Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 16–39.","short":"Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Computer Aided Verification, Springer Nature, 2023, pp. 16–39."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Yican","full_name":"Sun, Yican","last_name":"Sun"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"}],"article_processing_charge":"Yes (in subscription journal)","title":"Automated tail bound analysis for probabilistic recurrence relations","acknowledgement":"We thank Prof. Bican Xia for valuable information on the exponential theory of reals. The work is partially supported by the National Natural Science Foundation of China (NSFC) with Grant No. 62172271, ERC CoG 863818 (ForM-SMArt), the Hong Kong Research Grants Council ECS Project Number 26208122, the HKUST-Kaisa Joint Research Institute Project Grant HKJRI3A-055 and the HKUST Startup Grant R9272.","publisher":"Springer Nature","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2023","day":"17","publication":"Computer Aided Verification","page":"16-39","date_published":"2023-07-17T00:00:00Z","doi":"10.1007/978-3-031-37709-9_2","date_created":"2023-09-10T22:01:12Z","_id":"14318","type":"conference","conference":{"location":"Paris, France","end_date":"2023-07-22","start_date":"2023-07-17","name":"CAV: Computer Aided Verification"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","date_updated":"2023-09-20T08:25:57Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2023-09-20T08:24:47Z","abstract":[{"text":"Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of a randomized algorithm. Given a PRR and a time limit κ, we consider the tail probability Pr[T≥κ], i.e., the probability that the randomized runtime T of the PRR exceeds κ. Our focus is the formal analysis of tail bounds that aims at finding a tight asymptotic upper bound u≥Pr[T≥κ]. To address this problem, the classical and most well-known approach is the cookbook method by Karp (JACM 1994), while other approaches are mostly limited to deriving tail bounds of specific PRRs via involved custom analysis.\r\nIn this work, we propose a novel approach for deriving the common exponentially-decreasing tail bounds for PRRs whose preprocessing time and random passed sizes observe discrete or (piecewise) uniform distribution and whose recursive call is either a single procedure call or a divide-and-conquer. We first establish a theoretical approach via Markov’s inequality, and then instantiate the theoretical approach with a template-based algorithmic approach via a refined treatment of exponentiation. Experimental evaluation shows that our algorithmic approach is capable of deriving tail bounds that are (i) asymptotically tighter than Karp’s method, (ii) match the best-known manually-derived asymptotic tail bound for QuickSelect, and (iii) is only slightly worse (with a loglogn factor) than the manually-proven optimal asymptotic tail bound for QuickSort. Moreover, our algorithmic approach handles all examples (including realistic PRRs such as QuickSort, QuickSelect, DiameterComputation, etc.) in less than 0.1 s, showing that our approach is efficient in practice.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LNCS"],"month":"07","intvolume":" 13966","publication_identifier":{"isbn":["9783031377082"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"42917e086f8c7699f3bccf84f74fe000","file_id":"14348","success":1,"date_updated":"2023-09-20T08:24:47Z","file_size":624647,"creator":"dernst","date_created":"2023-09-20T08:24:47Z","file_name":"2023_LNCS_Sun.pdf"}],"language":[{"iso":"eng"}],"related_material":{"link":[{"url":"https://github.com/boyvolcano/PRR","relation":"software"}]},"volume":13966,"ec_funded":1},{"_id":"14317","status":"public","type":"conference","conference":{"name":"CAV: Computer Aided Verification","location":"Paris, France","end_date":"2023-07-22","start_date":"2023-07-17"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_updated":"2023-09-20T09:04:40Z","department":[{"_id":"KrCh"}],"file_date_updated":"2023-09-20T08:46:43Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Markov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason about trajectories of distributions, basic reachability and safety problems are known to be computationally intractable (i.e., Skolem-hard) to solve in such models. Further, we show that even for simple examples of MDPs, strategies for safety objectives over distributions can require infinite memory and randomization.\r\nIn light of this, we present a novel overapproximation approach to synthesize strategies in an MDP, such that a safety objective over the distributions is met. More precisely, we develop a new framework for template-based synthesis of certificates as affine distributional and inductive invariants for safety objectives in MDPs. We provide two algorithms within this framework. One can only synthesize memoryless strategies, but has relative completeness guarantees, while the other can synthesize general strategies. The runtime complexity of both algorithms is in PSPACE. We implement these algorithms and show that they can solve several non-trivial examples."}],"month":"07","intvolume":" 13966","scopus_import":"1","alternative_title":["LNCS"],"file":[{"creator":"dernst","file_size":531745,"date_updated":"2023-09-20T08:46:43Z","file_name":"2023_LNCS_Akshay.pdf","date_created":"2023-09-20T08:46:43Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"f143c8eedf609f20f2aad2eeb496d53f","file_id":"14349"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031377082"],"eissn":["1611-3349"]},"publication_status":"published","volume":13966,"ec_funded":1,"project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” In International Conference on Computer Aided Verification, 13966:86–112. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_5.","ista":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. 2023. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 86–112.","mla":"Akshay, S., et al. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” International Conference on Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 86–112, doi:10.1007/978-3-031-37709-9_5.","ama":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In: International Conference on Computer Aided Verification. Vol 13966. Springer Nature; 2023:86-112. doi:10.1007/978-3-031-37709-9_5","apa":"Akshay, S., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_5","short":"S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 86–112.","ieee":"S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “MDPs as distribution transformers: Affine invariant synthesis for safety objectives,” in International Conference on Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 86–112."},"title":"MDPs as distribution transformers: Affine invariant synthesis for safety objectives","author":[{"first_name":"S.","last_name":"Akshay","full_name":"Akshay, S."},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic"}],"article_processing_charge":"Yes (in subscription journal)","acknowledgement":"This work was supported in part by the ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 as well as DST/CEFIPRA/INRIA project EQuaVE and SERB Matrices grant MTR/2018/00074.","quality_controlled":"1","publisher":"Springer Nature","oa":1,"day":"17","publication":"International Conference on Computer Aided Verification","has_accepted_license":"1","year":"2023","doi":"10.1007/978-3-031-37709-9_5","date_published":"2023-07-17T00:00:00Z","date_created":"2023-09-10T22:01:12Z","page":"86-112"},{"publisher":"The Company of Biologists","quality_controlled":"1","oa":1,"day":"01","publication":"Journal of Cell Science","year":"2023","date_published":"2023-09-01T00:00:00Z","doi":"10.1242/jcs.261448","date_created":"2023-09-10T22:01:12Z","article_number":"jcs261448","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Nagano M, Aoshima K, Shimamura H, Siekhaus DE, Toshima JY, Toshima J. 2023. Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway. Journal of Cell Science. 136(17), jcs261448.","chicago":"Nagano, Makoto, Kaito Aoshima, Hiroki Shimamura, Daria E Siekhaus, Junko Y. Toshima, and Jiro Toshima. “Distinct Role of TGN-Resident Clathrin Adaptors for Vps21p Activation in the TGN-Endosome Trafficking Pathway.” Journal of Cell Science. The Company of Biologists, 2023. https://doi.org/10.1242/jcs.261448.","ieee":"M. Nagano, K. Aoshima, H. Shimamura, D. E. Siekhaus, J. Y. Toshima, and J. Toshima, “Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway,” Journal of Cell Science, vol. 136, no. 17. The Company of Biologists, 2023.","short":"M. Nagano, K. Aoshima, H. Shimamura, D.E. Siekhaus, J.Y. Toshima, J. Toshima, Journal of Cell Science 136 (2023).","ama":"Nagano M, Aoshima K, Shimamura H, Siekhaus DE, Toshima JY, Toshima J. Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway. Journal of Cell Science. 2023;136(17). doi:10.1242/jcs.261448","apa":"Nagano, M., Aoshima, K., Shimamura, H., Siekhaus, D. E., Toshima, J. Y., & Toshima, J. (2023). Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway. Journal of Cell Science. The Company of Biologists. https://doi.org/10.1242/jcs.261448","mla":"Nagano, Makoto, et al. “Distinct Role of TGN-Resident Clathrin Adaptors for Vps21p Activation in the TGN-Endosome Trafficking Pathway.” Journal of Cell Science, vol. 136, no. 17, jcs261448, The Company of Biologists, 2023, doi:10.1242/jcs.261448."},"title":"Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway","author":[{"last_name":"Nagano","full_name":"Nagano, Makoto","first_name":"Makoto"},{"last_name":"Aoshima","full_name":"Aoshima, Kaito","first_name":"Kaito"},{"first_name":"Hiroki","full_name":"Shimamura, Hiroki","last_name":"Shimamura"},{"first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus","full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353"},{"full_name":"Toshima, Junko Y.","last_name":"Toshima","first_name":"Junko Y."},{"first_name":"Jiro","last_name":"Toshima","full_name":"Toshima, Jiro"}],"article_processing_charge":"No","external_id":{"pmid":["37539494"]},"oa_version":"Preprint","pmid":1,"abstract":[{"lang":"eng","text":"Clathrin-mediated vesicle trafficking plays central roles in post-Golgi transport. In yeast (Saccharomyces cerevisiae), the AP-1 complex and GGA adaptors are predicted to generate distinct transport vesicles at the trans-Golgi network (TGN), and the epsin-related proteins Ent3p and Ent5p (collectively Ent3p/5p) act as accessories for these adaptors. Recently, we showed that vesicle transport from the TGN is crucial for yeast Rab5 (Vps21p)-mediated endosome formation, and that Ent3p/5p are crucial for this process, whereas AP-1 and GGA adaptors are dispensable. However, these observations were incompatible with previous studies showing that these adaptors are required for Ent3p/5p recruitment to the TGN, and thus the overall mechanism responsible for regulation of Vps21p activity remains ambiguous. Here, we investigated the functional relationships between clathrin adaptors in post-Golgi-mediated Vps21p activation. We show that AP-1 disruption in the ent3Δ5Δ mutant impaired transport of the Vps21p guanine nucleotide exchange factor Vps9p transport to the Vps21p compartment and severely reduced Vps21p activity. Additionally, GGA adaptors, the phosphatidylinositol-4-kinase Pik1p and Rab11 GTPases Ypt31p and Ypt32p were found to have partially overlapping functions for recruitment of AP-1 and Ent3p/5p to the TGN. These findings suggest a distinct role of clathrin adaptors for Vps21p activation in the TGN–endosome trafficking pathway."}],"month":"09","intvolume":" 136","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2023.03.27.534325"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1477-9137"],"issn":["0021-9533"]},"publication_status":"published","issue":"17","volume":136,"_id":"14316","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-09-20T09:14:15Z","department":[{"_id":"DaSi"}]},{"department":[{"_id":"MaSe"},{"_id":"ChLa"},{"_id":"MiLe"}],"date_updated":"2023-09-20T09:38:24Z","status":"public","article_type":"original","type":"journal_article","_id":"14320","issue":"12","volume":108,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"intvolume":" 108","month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2210.06310"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"The development of two-dimensional materials has resulted in a diverse range of novel, high-quality compounds with increasing complexity. A key requirement for a comprehensive quantitative theory is the accurate determination of these materials' band structure parameters. However, this task is challenging due to the intricate band structures and the indirect nature of experimental probes. In this work, we introduce a general framework to derive band structure parameters from experimental data using deep neural networks. We applied our method to the penetration field capacitance measurement of trilayer graphene, an effective probe of its density of states. First, we demonstrate that a trained deep network gives accurate predictions for the penetration field capacitance as a function of tight-binding parameters. Next, we use the fast and accurate predictions from the trained network to automatically determine tight-binding parameters directly from experimental data, with extracted parameters being in a good agreement with values in the literature. We conclude by discussing potential applications of our method to other materials and experimental techniques beyond penetration field capacitance.","lang":"eng"}],"title":"Deep learning extraction of band structure parameters from density of states: A case study on trilayer graphene","article_processing_charge":"No","external_id":{"arxiv":["2210.06310"]},"author":[{"id":"13C09E74-18D9-11E9-8878-32CFE5697425","first_name":"Paul M","orcid":"0000-0002-5198-7445","full_name":"Henderson, Paul M","last_name":"Henderson"},{"last_name":"Ghazaryan","orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","first_name":"Areg"},{"full_name":"Zibrov, Alexander A.","last_name":"Zibrov","first_name":"Alexander A."},{"first_name":"Andrea F.","full_name":"Young, Andrea F.","last_name":"Young"},{"last_name":"Serbyn","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Henderson, Paul M, Areg Ghazaryan, Alexander A. Zibrov, Andrea F. Young, and Maksym Serbyn. “Deep Learning Extraction of Band Structure Parameters from Density of States: A Case Study on Trilayer Graphene.” Physical Review B. American Physical Society, 2023. https://doi.org/10.1103/physrevb.108.125411.","ista":"Henderson PM, Ghazaryan A, Zibrov AA, Young AF, Serbyn M. 2023. Deep learning extraction of band structure parameters from density of states: A case study on trilayer graphene. Physical Review B. 108(12), 125411.","mla":"Henderson, Paul M., et al. “Deep Learning Extraction of Band Structure Parameters from Density of States: A Case Study on Trilayer Graphene.” Physical Review B, vol. 108, no. 12, 125411, American Physical Society, 2023, doi:10.1103/physrevb.108.125411.","apa":"Henderson, P. M., Ghazaryan, A., Zibrov, A. A., Young, A. F., & Serbyn, M. (2023). Deep learning extraction of band structure parameters from density of states: A case study on trilayer graphene. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.108.125411","ama":"Henderson PM, Ghazaryan A, Zibrov AA, Young AF, Serbyn M. Deep learning extraction of band structure parameters from density of states: A case study on trilayer graphene. Physical Review B. 2023;108(12). doi:10.1103/physrevb.108.125411","short":"P.M. Henderson, A. Ghazaryan, A.A. Zibrov, A.F. Young, M. Serbyn, Physical Review B 108 (2023).","ieee":"P. M. Henderson, A. Ghazaryan, A. A. Zibrov, A. F. Young, and M. Serbyn, “Deep learning extraction of band structure parameters from density of states: A case study on trilayer graphene,” Physical Review B, vol. 108, no. 12. American Physical Society, 2023."},"article_number":"125411","date_created":"2023-09-12T07:12:12Z","date_published":"2023-09-15T00:00:00Z","doi":"10.1103/physrevb.108.125411","publication":"Physical Review B","day":"15","year":"2023","oa":1,"publisher":"American Physical Society","quality_controlled":"1","acknowledgement":"A.F.Y. acknowledges primary support from the Department of Energy under award DE-SC0020043, and additional support from the Gordon and Betty Moore Foundation under award GBMF9471 for group operations."},{"date_created":"2023-03-17T13:30:48Z","doi":"10.15479/at:ista:12732","date_published":"2023-03-21T00:00:00Z","page":"158","day":"21","year":"2023","has_accepted_license":"1","oa":1,"publisher":"Institute of Science and Technology Austria","title":"Ergodicity breaking in disordered and kinetically constrained quantum many-body systems","article_processing_charge":"No","author":[{"first_name":"Pietro","id":"4115AF5C-F248-11E8-B48F-1D18A9856A87","full_name":"Brighi, Pietro","orcid":"0000-0002-7969-2729","last_name":"Brighi"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Brighi P. 2023. Ergodicity breaking in disordered and kinetically constrained quantum many-body systems. Institute of Science and Technology Austria.","chicago":"Brighi, Pietro. “Ergodicity Breaking in Disordered and Kinetically Constrained Quantum Many-Body Systems.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12732.","ieee":"P. Brighi, “Ergodicity breaking in disordered and kinetically constrained quantum many-body systems,” Institute of Science and Technology Austria, 2023.","short":"P. Brighi, Ergodicity Breaking in Disordered and Kinetically Constrained Quantum Many-Body Systems, Institute of Science and Technology Austria, 2023.","apa":"Brighi, P. (2023). Ergodicity breaking in disordered and kinetically constrained quantum many-body systems. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12732","ama":"Brighi P. Ergodicity breaking in disordered and kinetically constrained quantum many-body systems. 2023. doi:10.15479/at:ista:12732","mla":"Brighi, Pietro. Ergodicity Breaking in Disordered and Kinetically Constrained Quantum Many-Body Systems. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12732."},"project":[{"call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"ec_funded":1,"related_material":{"record":[{"id":"11470","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"8308"},{"id":"11469","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"12750","status":"public"}]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2023-03-23T16:42:56Z","file_size":42167561,"creator":"pbrighi","date_created":"2023-03-23T16:42:56Z","file_name":"Thesis_sub_PBrighi.zip","content_type":"application/zip","access_level":"closed","relation":"source_file","checksum":"5d2de651ef9449c1b8dc27148ca74777","file_id":"12753"},{"success":1,"file_id":"12754","checksum":"7caa153d4a5b0873a79358787d2dfe1e","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"Thesis_PBrighi.pdf","date_created":"2023-03-23T16:43:14Z","creator":"pbrighi","file_size":13977000,"date_updated":"2023-03-23T16:43:14Z"}],"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"month":"03","alternative_title":["ISTA Thesis"],"oa_version":"None","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"lang":"eng","text":"Nonergodic systems, whose out-of-equilibrium dynamics fail to thermalize, provide a fascinating research direction both for fundamental reasons and for application in state of the art quantum devices.\r\nGoing beyond the description of statistical mechanics, ergodicity breaking yields a new paradigm in quantum many-body physics, introducing novel phases of matter with no counterpart at equilibrium.\r\nIn this Thesis, we address different open questions in the field, focusing on disorder-induced many-body localization (MBL) and on weak ergodicity breaking in kinetically constrained models.\r\nIn particular, we contribute to the debate about transport in kinetically constrained models, studying the effect of $U(1)$ conservation and inversion-symmetry breaking in a family of quantum East models.\r\nUsing tensor network techniques, we analyze the dynamics of large MBL systems beyond the limit of exact numerical methods.\r\nIn this setting, we approach the debated topic of the coexistence of localized and thermal eigenstates separated by energy thresholds known as many-body mobility edges.\r\nInspired by recent experiments, our work further investigates the localization of a small bath induced by the coupling to a large localized chain, the so-called MBL proximity effect.\r\n\r\nIn the first Chapter, we introduce a family of particle-conserving kinetically constrained models, inspired by the quantum East model.\r\nThe system we study features strong inversion-symmetry breaking, due to the nature of the correlated hopping.\r\nWe show that these models host so-called quantum Hilbert space fragmentation, consisting of disconnected subsectors in an entangled basis, and further provide an analytical description of this phenomenon.\r\nWe further probe its effect on dynamics of simple product states, showing revivals in fidelity and local observalbes.\r\nThe study of dynamics within the largest subsector reveals an anomalous transient superdiffusive behavior crossing over to slow logarithmic dynamics at later times.\r\nThis work suggests that particle conserving constrained models with inversion-symmetry breaking realize new universality classes of dynamics and invite their further theoretical and experimental studies.\r\n\r\nNext, we use kinetic constraints and disorder to design a model with many-body mobility edges in particle density.\r\nThis feature allows to study the dynamics of localized and thermal states in large systems beyond the limitations of previous studies.\r\nThe time-evolution shows typical signatures of localization at small densities, replaced by thermal behavior at larger densities.\r\nOur results provide evidence in favor of the stability of many-body mobility edges, which was recently challenged by a theoretical argument.\r\nTo support our findings, we probe the mechanism proposed as a cause of delocalization in many-body localized systems with mobility edges suggesting its ineffectiveness in the model studied.\r\n\r\nIn the last Chapter of this Thesis, we address the topic of many-body localization proximity effect.\r\nWe study a model inspired by recent experiments, featuring Anderson localized coupled to a small bath of free hard-core bosons.\r\nThe interaction among the two particle species results in non-trivial dynamics, which we probe using tensor network techniques.\r\nOur simulations show convincing evidence of many-body localization proximity effect when the bath is composed by a single free particle and interactions are strong.\r\nWe furthter observe an anomalous entanglement dynamics, which we explain through a phenomenological theory.\r\nFinally, we extract highly excited eigenstates of large systems, providing supplementary evidence in favor of our findings."}],"department":[{"_id":"GradSch"},{"_id":"MaSe"}],"file_date_updated":"2023-03-23T16:43:14Z","ddc":["530"],"date_updated":"2023-09-20T10:44:12Z","supervisor":[{"first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","last_name":"Serbyn"}],"status":"public","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"type":"dissertation","_id":"12732"},{"date_created":"2023-09-14T13:08:23Z","date_published":"2023-09-13T00:00:00Z","doi":"10.21468/scipostphys.15.3.093","year":"2023","has_accepted_license":"1","publication":"SciPost Physics","day":"13","oa":1,"quality_controlled":"1","publisher":"SciPost Foundation","acknowledgement":"We would like to thank Raimel A. Medina, Hansveer Singh, and Dmitry Abanin for useful\r\ndiscussions.The authors acknowledge support by the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation program (Grant\r\nAgreement No. 850899). We acknowledge support by the Erwin Schrödinger International\r\nInstitute for Mathematics and Physics (ESI).","article_processing_charge":"No","external_id":{"arxiv":["2210.15607"]},"author":[{"first_name":"Pietro","id":"4115AF5C-F248-11E8-B48F-1D18A9856A87","last_name":"Brighi","full_name":"Brighi, Pietro","orcid":"0000-0002-7969-2729"},{"id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko","last_name":"Ljubotina","full_name":"Ljubotina, Marko","orcid":"0000-0003-0038-7068"},{"last_name":"Serbyn","full_name":"Serbyn, Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym"}],"title":"Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models","citation":{"chicago":"Brighi, Pietro, Marko Ljubotina, and Maksym Serbyn. “Hilbert Space Fragmentation and Slow Dynamics in Particle-Conserving Quantum East Models.” SciPost Physics. SciPost Foundation, 2023. https://doi.org/10.21468/scipostphys.15.3.093.","ista":"Brighi P, Ljubotina M, Serbyn M. 2023. Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. SciPost Physics. 15(3), 093.","mla":"Brighi, Pietro, et al. “Hilbert Space Fragmentation and Slow Dynamics in Particle-Conserving Quantum East Models.” SciPost Physics, vol. 15, no. 3, 093, SciPost Foundation, 2023, doi:10.21468/scipostphys.15.3.093.","apa":"Brighi, P., Ljubotina, M., & Serbyn, M. (2023). Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. SciPost Physics. SciPost Foundation. https://doi.org/10.21468/scipostphys.15.3.093","ama":"Brighi P, Ljubotina M, Serbyn M. Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. SciPost Physics. 2023;15(3). doi:10.21468/scipostphys.15.3.093","ieee":"P. Brighi, M. Ljubotina, and M. Serbyn, “Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models,” SciPost Physics, vol. 15, no. 3. SciPost Foundation, 2023.","short":"P. Brighi, M. Ljubotina, M. Serbyn, SciPost Physics 15 (2023)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"article_number":"093","ec_funded":1,"issue":"3","volume":15,"related_material":{"record":[{"status":"public","id":"12750","relation":"earlier_version"}]},"publication_status":"published","publication_identifier":{"issn":["2542-4653"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"4cef6a8021f6b6c47ab2f2f2b1387ac2","file_id":"14350","success":1,"date_updated":"2023-09-20T10:46:10Z","file_size":4866506,"creator":"dernst","date_created":"2023-09-20T10:46:10Z","file_name":"2023_SciPostPhysics_Brighi.pdf"}],"intvolume":" 15","month":"09","abstract":[{"text":"Quantum kinetically constrained models have recently attracted significant attention due to their anomalous dynamics and thermalization. In this work, we introduce a hitherto unexplored family of kinetically constrained models featuring conserved particle number and strong inversion-symmetry breaking due to facilitated hopping. We demonstrate that these models provide a generic example of so-called quantum Hilbert space fragmentation, that is manifested in disconnected sectors in the Hilbert space that are not apparent in the computational basis. Quantum Hilbert space fragmentation leads to an exponential in system size number of eigenstates with exactly zero entanglement entropy across several bipartite cuts. These eigenstates can be probed dynamically using quenches from simple initial product states. In addition, we study the particle spreading under unitary dynamics launched from the domain wall state, and find faster than diffusive dynamics at high particle densities, that crosses over into logarithmically slow relaxation at smaller densities. Using a classically simulable cellular automaton, we reproduce the logarithmic dynamics observed in the quantum case. Our work suggests that particle conserving constrained models with inversion symmetry breaking realize so far unexplored dynamical behavior and invite their further theoretical and experimental studies.","lang":"eng"}],"oa_version":"Published Version","department":[{"_id":"MaSe"}],"file_date_updated":"2023-09-20T10:46:10Z","date_updated":"2023-09-20T10:46:29Z","ddc":["530"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","keyword":["General Physics and Astronomy"],"status":"public","_id":"14334"},{"oa":1,"publisher":"AIP Publishing","quality_controlled":"1","acknowledgement":"We thank Zhanybek Alpichshev, Mohammad Reza Safari, Binghai Yan, and Yossi Paltiel for enlightening discussions.\r\nM.L. acknowledges support from the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). A. C. received funding from the European Union’s Horizon Europe research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 101062862 - NeqMolRot.","date_created":"2023-09-13T09:25:09Z","date_published":"2023-09-11T00:00:00Z","doi":"10.1063/5.0165806","publication":"The Journal of Chemical Physics","day":"11","year":"2023","has_accepted_license":"1","project":[{"_id":"bd7b5202-d553-11ed-ba76-9b1c1b258338","name":"Non-equilibrium Field Theory of Molecular Rotations","grant_number":"101062862"},{"grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425"}],"article_number":"104103","title":"Achiral dipoles on a ferromagnet can affect its magnetization direction","external_id":{"pmid":["37694742"],"arxiv":["2306.17592"]},"article_processing_charge":"Yes (in subscription journal)","author":[{"first_name":"Ragheed","id":"d1c405be-ae15-11ed-8510-ccf53278162e","last_name":"Al Hyder","full_name":"Al Hyder, Ragheed"},{"id":"9d13b3cb-30a2-11eb-80dc-f772505e8660","first_name":"Alberto","last_name":"Cappellaro","orcid":"0000-0001-6110-2359","full_name":"Cappellaro, Alberto"},{"last_name":"Lemeshko","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem","last_name":"Volosniev","first_name":"Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Al Hyder, Ragheed, Alberto Cappellaro, Mikhail Lemeshko, and Artem Volosniev. “Achiral Dipoles on a Ferromagnet Can Affect Its Magnetization Direction.” The Journal of Chemical Physics. AIP Publishing, 2023. https://doi.org/10.1063/5.0165806.","ista":"Al Hyder R, Cappellaro A, Lemeshko M, Volosniev A. 2023. Achiral dipoles on a ferromagnet can affect its magnetization direction. The Journal of Chemical Physics. 159(10), 104103.","mla":"Al Hyder, Ragheed, et al. “Achiral Dipoles on a Ferromagnet Can Affect Its Magnetization Direction.” The Journal of Chemical Physics, vol. 159, no. 10, 104103, AIP Publishing, 2023, doi:10.1063/5.0165806.","apa":"Al Hyder, R., Cappellaro, A., Lemeshko, M., & Volosniev, A. (2023). Achiral dipoles on a ferromagnet can affect its magnetization direction. The Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/5.0165806","ama":"Al Hyder R, Cappellaro A, Lemeshko M, Volosniev A. Achiral dipoles on a ferromagnet can affect its magnetization direction. The Journal of Chemical Physics. 2023;159(10). doi:10.1063/5.0165806","short":"R. Al Hyder, A. Cappellaro, M. Lemeshko, A. Volosniev, The Journal of Chemical Physics 159 (2023).","ieee":"R. Al Hyder, A. Cappellaro, M. Lemeshko, and A. Volosniev, “Achiral dipoles on a ferromagnet can affect its magnetization direction,” The Journal of Chemical Physics, vol. 159, no. 10. AIP Publishing, 2023."},"intvolume":" 159","month":"09","scopus_import":"1","oa_version":"Published Version","pmid":1,"abstract":[{"text":"We demonstrate the possibility of a coupling between the magnetization direction of a ferromagnet and the tilting angle of adsorbed achiral molecules. To illustrate the mechanism of the coupling, we analyze a minimal Stoner model that includes Rashba spin–orbit coupling due to the electric field on the surface of the ferromagnet. The proposed mechanism allows us to study magnetic anisotropy of the system with an extended Stoner–Wohlfarth model and argue that adsorbed achiral molecules can change magnetocrystalline anisotropy of the substrate. Our research aims to motivate further experimental studies of the current-free chirality induced spin selectivity effect involving both enantiomers.","lang":"eng"}],"ec_funded":1,"issue":"10","volume":159,"language":[{"iso":"eng"}],"file":[{"file_size":5749653,"date_updated":"2023-09-13T09:34:20Z","creator":"acappell","file_name":"104103_1_5.0165806.pdf","date_created":"2023-09-13T09:34:20Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"14322","checksum":"507ab65ab29e2c987c94cabad7c5370b"}],"publication_status":"published","publication_identifier":{"eissn":["1089-7690"],"issn":["0021-9606"]},"keyword":["Physical and Theoretical Chemistry","General Physics and Astronomy"],"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","_id":"14321","file_date_updated":"2023-09-13T09:34:20Z","department":[{"_id":"MiLe"}],"ddc":["530"],"date_updated":"2023-09-20T09:48:12Z"},{"ddc":["530"],"date_updated":"2023-09-20T11:50:06Z","file_date_updated":"2023-09-20T11:36:16Z","department":[{"_id":"ZhAl"}],"_id":"14342","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)"},"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"89a1b604d58b209fec66c6b6f919ac98","file_id":"14353","success":1,"creator":"dernst","date_updated":"2023-09-20T11:36:16Z","file_size":1486715,"date_created":"2023-09-20T11:36:16Z","file_name":"2023_ApplPhysLetter_Lorenc.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0003-6951"]},"publication_status":"published","issue":"9","volume":123,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We propose a simple method to measure nonlinear Kerr refractive index in mid-infrared frequency range that avoids using sophisticated infrared detectors. Our approach is based on using a near-infrared probe beam which interacts with a mid-IR beam via wavelength-non-degenerate cross-phase modulation (XPM). By carefully measuring XPM-induced spectral modifications in the probe beam and comparing the experimental data with simulation results, we extract the value for the non-degenerate Kerr index. Finally, in order to obtain the value of degenerate mid-IR Kerr index, we use the well-established two-band formalism of Sheik-Bahae et al., which is shown to become particularly simple in the limit of low frequencies. The proposed technique is complementary to the conventional techniques, such as z-scan, and has the advantage of not requiring any mid-infrared detectors."}],"month":"08","intvolume":" 123","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Lorenc, Dusan, and Zhanybek Alpichshev. “Mid-Infrared Kerr Index Evaluation via Cross-Phase Modulation with a near-Infrared Probe Beam.” Applied Physics Letters. AIP Publishing, 2023. https://doi.org/10.1063/5.0161713.","ista":"Lorenc D, Alpichshev Z. 2023. Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam. Applied Physics Letters. 123(9), 091104.","mla":"Lorenc, Dusan, and Zhanybek Alpichshev. “Mid-Infrared Kerr Index Evaluation via Cross-Phase Modulation with a near-Infrared Probe Beam.” Applied Physics Letters, vol. 123, no. 9, 091104, AIP Publishing, 2023, doi:10.1063/5.0161713.","ama":"Lorenc D, Alpichshev Z. Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam. Applied Physics Letters. 2023;123(9). doi:10.1063/5.0161713","apa":"Lorenc, D., & Alpichshev, Z. (2023). Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam. Applied Physics Letters. AIP Publishing. https://doi.org/10.1063/5.0161713","short":"D. Lorenc, Z. Alpichshev, Applied Physics Letters 123 (2023).","ieee":"D. Lorenc and Z. Alpichshev, “Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam,” Applied Physics Letters, vol. 123, no. 9. AIP Publishing, 2023."},"title":"Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam","author":[{"first_name":"Dusan","id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87","full_name":"Lorenc, Dusan","last_name":"Lorenc"},{"first_name":"Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev","full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203"}],"article_processing_charge":"Yes (in subscription journal)","external_id":{"arxiv":["2306.09043"]},"article_number":"091104","day":"28","publication":"Applied Physics Letters","has_accepted_license":"1","year":"2023","doi":"10.1063/5.0161713","date_published":"2023-08-28T00:00:00Z","date_created":"2023-09-17T22:01:09Z","acknowledgement":"The work was supported by IST Austria. The authors would like to gratefully acknowledge the help and assistance of Professor John M. Dudley.","quality_controlled":"1","publisher":"AIP Publishing","oa":1},{"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"We acknowledge the assistance of the Miba machine shop and the team of the ISTA-HPC cluster. We thank M. Quadrio for the discussions. The work was supported by the Simons Foundation (grant no. 662960) and by the Austrian Science Fund (grant no. I4188-N30), within Deutsche Forschungsgemeinschaft research unit FOR 2688.","date_created":"2023-09-17T22:01:09Z","doi":"10.1038/s41586-023-06399-5","date_published":"2023-09-07T00:00:00Z","page":"71-74","publication":"Nature","day":"07","year":"2023","project":[{"grant_number":"662960","name":"Revisiting the Turbulence Problem Using Statistical Mechanics: Experimental Studies on Transitional and Turbulent Flows","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E"},{"name":"Instabilities in pulsating pipe flow of Newtonian and complex fluids","grant_number":"I04188","_id":"238B8092-32DE-11EA-91FC-C7463DDC885E","call_identifier":"FWF"}],"title":"Turbulence suppression by cardiac-cycle-inspired driving of pipe flow","article_processing_charge":"No","external_id":{"pmid":["37673988"]},"author":[{"first_name":"Davide","id":"40315C30-F248-11E8-B48F-1D18A9856A87","full_name":"Scarselli, Davide","orcid":"0000-0001-5227-4271","last_name":"Scarselli"},{"id":"40770848-F248-11E8-B48F-1D18A9856A87","first_name":"Jose M","orcid":"0000-0002-0384-2022","full_name":"Lopez Alonso, Jose M","last_name":"Lopez Alonso"},{"first_name":"Atul","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","last_name":"Varshney","orcid":"0000-0002-3072-5999","full_name":"Varshney, Atul"},{"first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","last_name":"Hof"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Scarselli, Davide, Jose M Lopez Alonso, Atul Varshney, and Björn Hof. “Turbulence Suppression by Cardiac-Cycle-Inspired Driving of Pipe Flow.” Nature. Springer Nature, 2023. https://doi.org/10.1038/s41586-023-06399-5.","ista":"Scarselli D, Lopez Alonso JM, Varshney A, Hof B. 2023. Turbulence suppression by cardiac-cycle-inspired driving of pipe flow. Nature. 621(7977), 71–74.","mla":"Scarselli, Davide, et al. “Turbulence Suppression by Cardiac-Cycle-Inspired Driving of Pipe Flow.” Nature, vol. 621, no. 7977, Springer Nature, 2023, pp. 71–74, doi:10.1038/s41586-023-06399-5.","short":"D. Scarselli, J.M. Lopez Alonso, A. Varshney, B. Hof, Nature 621 (2023) 71–74.","ieee":"D. Scarselli, J. M. Lopez Alonso, A. Varshney, and B. Hof, “Turbulence suppression by cardiac-cycle-inspired driving of pipe flow,” Nature, vol. 621, no. 7977. Springer Nature, pp. 71–74, 2023.","apa":"Scarselli, D., Lopez Alonso, J. M., Varshney, A., & Hof, B. (2023). Turbulence suppression by cardiac-cycle-inspired driving of pipe flow. Nature. Springer Nature. https://doi.org/10.1038/s41586-023-06399-5","ama":"Scarselli D, Lopez Alonso JM, Varshney A, Hof B. Turbulence suppression by cardiac-cycle-inspired driving of pipe flow. Nature. 2023;621(7977):71-74. doi:10.1038/s41586-023-06399-5"},"intvolume":" 621","month":"09","scopus_import":"1","oa_version":"None","pmid":1,"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"abstract":[{"lang":"eng","text":"Flows through pipes and channels are, in practice, almost always turbulent, and the multiscale eddying motion is responsible for a major part of the encountered friction losses and pumping costs1. Conversely, for pulsatile flows, in particular for aortic blood flow, turbulence levels remain low despite relatively large peak velocities. For aortic blood flow, high turbulence levels are intolerable as they would damage the shear-sensitive endothelial cell layer2,3,4,5. Here we show that turbulence in ordinary pipe flow is diminished if the flow is driven in a pulsatile mode that incorporates all the key features of the cardiac waveform. At Reynolds numbers comparable to those of aortic blood flow, turbulence is largely inhibited, whereas at much higher speeds, the turbulent drag is reduced by more than 25%. This specific operation mode is more efficient when compared with steady driving, which is the present situation for virtually all fluid transport processes ranging from heating circuits to water, gas and oil pipelines."}],"related_material":{"link":[{"url":"https://www.ista.ac.at/en/news/pumping-like-the-heart/","relation":"press_release","description":"News on ISTA website"}]},"issue":"7977","volume":621,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"status":"public","type":"journal_article","article_type":"original","_id":"14341","department":[{"_id":"BjHo"}],"date_updated":"2023-09-20T12:10:22Z"},{"_id":"13120","status":"public","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"location":"Bialystok, Poland","end_date":"2023-08-04","start_date":"2023-07-31","name":"ITP: International Conference on Interactive Theorem Proving"},"ddc":["000"],"date_updated":"2023-09-25T11:04:29Z","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"file_date_updated":"2023-08-07T11:55:43Z","oa_version":"Published Version","abstract":[{"text":"We formalized general (i.e., type-0) grammars using the Lean 3 proof assistant. We defined basic notions of rewrite rules and of words derived by a grammar, and used grammars to show closure of the class of type-0 languages under four operations: union, reversal, concatenation, and the Kleene star. The literature mostly focuses on Turing machine arguments, which are possibly more difficult to formalize. For the Kleene star, we could not follow the literature and came up with our own grammar-based construction.","lang":"eng"}],"month":"07","intvolume":" 268","scopus_import":"1","alternative_title":["LIPIcs"],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"773a0197f05b67feaa6cb1e17ec3642d","file_id":"13982","success":1,"creator":"dernst","date_updated":"2023-08-07T11:55:43Z","file_size":715976,"date_created":"2023-08-07T11:55:43Z","file_name":"2023_LIPIcS_Dvorak.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783959772846"],"eissn":["1868-8969"]},"publication_status":"published","volume":268,"related_material":{"link":[{"relation":"software","url":"https://github.com/madvorak/grammars/tree/publish"}]},"article_number":"15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars - Formally Verified.” In 14th International Conference on Interactive Theorem Proving, Vol. 268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ITP.2023.15.","ista":"Dvorak M, Blanchette J. 2023. Closure properties of general grammars - formally verified. 14th International Conference on Interactive Theorem Proving. ITP: International Conference on Interactive Theorem Proving, LIPIcs, vol. 268, 15.","mla":"Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars - Formally Verified.” 14th International Conference on Interactive Theorem Proving, vol. 268, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ITP.2023.15.","ama":"Dvorak M, Blanchette J. Closure properties of general grammars - formally verified. In: 14th International Conference on Interactive Theorem Proving. Vol 268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ITP.2023.15","apa":"Dvorak, M., & Blanchette, J. (2023). Closure properties of general grammars - formally verified. In 14th International Conference on Interactive Theorem Proving (Vol. 268). Bialystok, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITP.2023.15","short":"M. Dvorak, J. Blanchette, in:, 14th International Conference on Interactive Theorem Proving, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"M. Dvorak and J. Blanchette, “Closure properties of general grammars - formally verified,” in 14th International Conference on Interactive Theorem Proving, Bialystok, Poland, 2023, vol. 268."},"title":"Closure properties of general grammars - formally verified","author":[{"last_name":"Dvorak","full_name":"Dvorak, Martin","orcid":"0000-0001-5293-214X","first_name":"Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425"},{"last_name":"Blanchette","full_name":"Blanchette, Jasmin","first_name":"Jasmin"}],"article_processing_charge":"No","external_id":{"arxiv":["2302.06420"]},"acknowledgement":"Jasmin Blanchette: This research has received funding from the Netherlands Organization\r\nfor Scientific Research (NWO) under the Vidi program (project No. 016.Vidi.189.037, Lean Forward).\r\n__\r\nWe thank Vladimir Kolmogorov for making this collaboration possible. We\r\nthank Václav Končický for discussing ideas about the Kleene star construction. We thank Patrick Johnson, Floris van Doorn, and Damiano Testa for their small yet very valuable contributions to our code. We thank Eric Wieser for simplifying one of our proofs. We thank Mark Summerfield for suggesting textual improvements. We thank the anonymous reviewers for very helpful comments. Finally, we thank the Lean community for helping us with various technical issues and answering many questions. ","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"day":"27","publication":"14th International Conference on Interactive Theorem Proving","has_accepted_license":"1","year":"2023","doi":"10.4230/LIPIcs.ITP.2023.15","date_published":"2023-07-27T00:00:00Z","date_created":"2023-06-05T07:29:05Z"},{"_id":"13969","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","date_updated":"2023-09-25T10:56:10Z","ddc":["510"],"department":[{"_id":"UlWa"}],"file_date_updated":"2023-08-07T08:00:48Z","abstract":[{"text":"Bundling crossings is a strategy which can enhance the readability\r\nof graph drawings. In this paper we consider good drawings, i.e., we require that\r\nany two edges have at most one common point which can be a common vertex or a\r\ncrossing. Our main result is that there is a polynomial-time algorithm to compute an\r\n8-approximation of the bundled crossing number of a good drawing with no toothed\r\nhole. In general the number of toothed holes has to be added to the 8-approximation.\r\nIn the special case of circular drawings the approximation factor is 8, this improves\r\nupon the 10-approximation of Fink et al. [14]. Our approach also works with the same\r\napproximation factor for families of pseudosegments, i.e., curves intersecting at most\r\nonce. We also show how to compute a 9/2-approximation when the intersection graph of\r\nthe pseudosegments is bipartite and has no toothed hole.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"07","intvolume":" 27","publication_identifier":{"issn":["1526-1719"]},"publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"9c30d2b8e324cc1c904f2aeec92013a3","file_id":"13979","success":1,"date_updated":"2023-08-07T08:00:48Z","file_size":865774,"creator":"dernst","date_created":"2023-08-07T08:00:48Z","file_name":"2023_JourGraphAlgorithms_Arroyo.pdf"}],"language":[{"iso":"eng"}],"issue":"6","volume":27,"related_material":{"record":[{"relation":"earlier_version","id":"11185","status":"public"}]},"ec_funded":1,"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"citation":{"ista":"Arroyo Guevara AM, Felsner S. 2023. Approximating the bundled crossing number. Journal of Graph Algorithms and Applications. 27(6), 433–457.","chicago":"Arroyo Guevara, Alan M, and Stefan Felsner. “Approximating the Bundled Crossing Number.” Journal of Graph Algorithms and Applications. Brown University, 2023. https://doi.org/10.7155/jgaa.00629.","ama":"Arroyo Guevara AM, Felsner S. Approximating the bundled crossing number. Journal of Graph Algorithms and Applications. 2023;27(6):433-457. doi:10.7155/jgaa.00629","apa":"Arroyo Guevara, A. M., & Felsner, S. (2023). Approximating the bundled crossing number. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00629","short":"A.M. Arroyo Guevara, S. Felsner, Journal of Graph Algorithms and Applications 27 (2023) 433–457.","ieee":"A. M. Arroyo Guevara and S. Felsner, “Approximating the bundled crossing number,” Journal of Graph Algorithms and Applications, vol. 27, no. 6. Brown University, pp. 433–457, 2023.","mla":"Arroyo Guevara, Alan M., and Stefan Felsner. “Approximating the Bundled Crossing Number.” Journal of Graph Algorithms and Applications, vol. 27, no. 6, Brown University, 2023, pp. 433–57, doi:10.7155/jgaa.00629."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","first_name":"Alan M","full_name":"Arroyo Guevara, Alan M","orcid":"0000-0003-2401-8670","last_name":"Arroyo Guevara"},{"first_name":"Stefan","full_name":"Felsner, Stefan","last_name":"Felsner"}],"article_processing_charge":"Yes","external_id":{"arxiv":["2109.14892"]},"title":"Approximating the bundled crossing number","acknowledgement":"This work was initiated during the Workshop on Geometric Graphs in November 2019 in Strobl, Austria. We would like to thank Oswin Aichholzer, Fabian Klute, Man-Kwun Chiu, Martin Balko, Pavel Valtr for their avid discussions during the workshop. The first author has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No 754411. The second author has been supported by the German Research Foundation DFG Project FE 340/12-1. An extended abstract of this paper has been published in the proceedings of WALCOM 2022 in the Springer LNCS series, vol. 13174, pages 383–395.","quality_controlled":"1","publisher":"Brown University","oa":1,"has_accepted_license":"1","year":"2023","day":"01","publication":"Journal of Graph Algorithms and Applications","page":"433-457","doi":"10.7155/jgaa.00629","date_published":"2023-07-01T00:00:00Z","date_created":"2023-08-06T22:01:11Z"},{"publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","day":"01","year":"2023","date_created":"2023-09-17T22:01:10Z","date_published":"2023-01-01T00:00:00Z","doi":"10.1137/1.9781611977554.ch88","page":"2286-2323","oa":1,"quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2023:2286–2323. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/1.9781611977554.ch88.","ista":"Anastos M. 2023. Fast algorithms for solving the Hamilton cycle problem with high probability. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2023, 2286–2323.","mla":"Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2023, Society for Industrial and Applied Mathematics, 2023, pp. 2286–323, doi:10.1137/1.9781611977554.ch88.","short":"M. Anastos, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 2286–2323.","ieee":"M. Anastos, “Fast algorithms for solving the Hamilton cycle problem with high probability,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, vol. 2023, pp. 2286–2323.","apa":"Anastos, M. (2023). Fast algorithms for solving the Hamilton cycle problem with high probability. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2023, pp. 2286–2323). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch88","ama":"Anastos M. Fast algorithms for solving the Hamilton cycle problem with high probability. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2023. Society for Industrial and Applied Mathematics; 2023:2286-2323. doi:10.1137/1.9781611977554.ch88"},"title":"Fast algorithms for solving the Hamilton cycle problem with high probability","article_processing_charge":"No","external_id":{"arxiv":["2111.14759"]},"author":[{"first_name":"Michael","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","full_name":"Anastos, Michael","last_name":"Anastos"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781611977554"]},"volume":2023,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We study the Hamilton cycle problem with input a random graph G ~ G(n,p) in two different settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one, we are given the adjacency matrix of G. In each of the two settings we derive a deterministic algorithm that w.h.p. either finds a Hamilton cycle or returns a certificate that such a cycle does not exist for p = p(n) ≥ 0. The running times of our algorithms are O(n) and respectively, each being best possible in its own setting."}],"intvolume":" 2023","month":"01","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.14759"}],"scopus_import":"1","date_updated":"2023-09-25T09:13:41Z","department":[{"_id":"MaKw"}],"_id":"14344","status":"public","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Florence, Italy","end_date":"2023-01-25","start_date":"2023-01-22"},"type":"conference"},{"external_id":{"isi":["000941068900001"],"pmid":["36461812"]},"article_processing_charge":"No","author":[{"full_name":"Schamberger, Barbara","last_name":"Schamberger","first_name":"Barbara"},{"last_name":"Ziege","full_name":"Ziege, Ricardo","first_name":"Ricardo"},{"full_name":"Anselme, Karine","last_name":"Anselme","first_name":"Karine"},{"first_name":"Martine","last_name":"Ben Amar","full_name":"Ben Amar, Martine"},{"first_name":"Michał","last_name":"Bykowski","full_name":"Bykowski, Michał"},{"full_name":"Castro, André P.G.","last_name":"Castro","first_name":"André P.G."},{"first_name":"Amaia","full_name":"Cipitria, Amaia","last_name":"Cipitria"},{"last_name":"Coles","full_name":"Coles, Rhoslyn A.","first_name":"Rhoslyn A."},{"first_name":"Rumiana","full_name":"Dimova, Rumiana","last_name":"Dimova"},{"first_name":"Michaela","last_name":"Eder","full_name":"Eder, Michaela"},{"first_name":"Sebastian","last_name":"Ehrig","full_name":"Ehrig, Sebastian"},{"first_name":"Luis M.","full_name":"Escudero, Luis M.","last_name":"Escudero"},{"first_name":"Myfanwy E.","full_name":"Evans, Myfanwy E.","last_name":"Evans"},{"first_name":"Paulo R.","last_name":"Fernandes","full_name":"Fernandes, Paulo R."},{"first_name":"Peter","full_name":"Fratzl, Peter","last_name":"Fratzl"},{"last_name":"Geris","full_name":"Geris, Liesbet","first_name":"Liesbet"},{"first_name":"Notburga","full_name":"Gierlinger, Notburga","last_name":"Gierlinger"},{"id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B","last_name":"Hannezo","orcid":"0000-0001-6005-1561","full_name":"Hannezo, Edouard B"},{"full_name":"Iglič, Aleš","last_name":"Iglič","first_name":"Aleš"},{"first_name":"Jacob J.K.","last_name":"Kirkensgaard","full_name":"Kirkensgaard, Jacob J.K."},{"first_name":"Philip","full_name":"Kollmannsberger, Philip","last_name":"Kollmannsberger"},{"first_name":"Łucja","last_name":"Kowalewska","full_name":"Kowalewska, Łucja"},{"first_name":"Nicholas A.","full_name":"Kurniawan, Nicholas A.","last_name":"Kurniawan"},{"first_name":"Ioannis","full_name":"Papantoniou, Ioannis","last_name":"Papantoniou"},{"last_name":"Pieuchot","full_name":"Pieuchot, Laurent","first_name":"Laurent"},{"first_name":"Tiago H.V.","last_name":"Pires","full_name":"Pires, Tiago H.V."},{"first_name":"Lars D.","last_name":"Renner","full_name":"Renner, Lars D."},{"full_name":"Sageman-Furnas, Andrew O.","last_name":"Sageman-Furnas","first_name":"Andrew O."},{"last_name":"Schröder-Turk","full_name":"Schröder-Turk, Gerd E.","first_name":"Gerd E."},{"full_name":"Sengupta, Anupam","last_name":"Sengupta","first_name":"Anupam"},{"last_name":"Sharma","full_name":"Sharma, Vikas R.","first_name":"Vikas R."},{"first_name":"Antonio","last_name":"Tagua","full_name":"Tagua, Antonio"},{"full_name":"Tomba, Caterina","last_name":"Tomba","first_name":"Caterina"},{"first_name":"Xavier","last_name":"Trepat","full_name":"Trepat, Xavier"},{"last_name":"Waters","full_name":"Waters, Sarah L.","first_name":"Sarah L."},{"first_name":"Edwina F.","last_name":"Yeo","full_name":"Yeo, Edwina F."},{"first_name":"Andreas","full_name":"Roschger, Andreas","last_name":"Roschger"},{"first_name":"Cécile M.","full_name":"Bidan, Cécile M.","last_name":"Bidan"},{"last_name":"Dunlop","full_name":"Dunlop, John W.C.","first_name":"John W.C."}],"title":"Curvature in biological systems: Its quantification, emergence, and implications across the scales","citation":{"short":"B. Schamberger, R. Ziege, K. Anselme, M. Ben Amar, M. Bykowski, A.P.G. Castro, A. Cipitria, R.A. Coles, R. Dimova, M. Eder, S. Ehrig, L.M. Escudero, M.E. Evans, P.R. Fernandes, P. Fratzl, L. Geris, N. Gierlinger, E.B. Hannezo, A. Iglič, J.J.K. Kirkensgaard, P. Kollmannsberger, Ł. Kowalewska, N.A. Kurniawan, I. Papantoniou, L. Pieuchot, T.H.V. Pires, L.D. Renner, A.O. Sageman-Furnas, G.E. Schröder-Turk, A. Sengupta, V.R. Sharma, A. Tagua, C. Tomba, X. Trepat, S.L. Waters, E.F. Yeo, A. Roschger, C.M. Bidan, J.W.C. Dunlop, Advanced Materials 35 (2023).","ieee":"B. Schamberger et al., “Curvature in biological systems: Its quantification, emergence, and implications across the scales,” Advanced Materials, vol. 35, no. 13. Wiley, 2023.","apa":"Schamberger, B., Ziege, R., Anselme, K., Ben Amar, M., Bykowski, M., Castro, A. P. G., … Dunlop, J. W. C. (2023). Curvature in biological systems: Its quantification, emergence, and implications across the scales. Advanced Materials. Wiley. https://doi.org/10.1002/adma.202206110","ama":"Schamberger B, Ziege R, Anselme K, et al. Curvature in biological systems: Its quantification, emergence, and implications across the scales. Advanced Materials. 2023;35(13). doi:10.1002/adma.202206110","mla":"Schamberger, Barbara, et al. “Curvature in Biological Systems: Its Quantification, Emergence, and Implications across the Scales.” Advanced Materials, vol. 35, no. 13, 2206110, Wiley, 2023, doi:10.1002/adma.202206110.","ista":"Schamberger B, Ziege R, Anselme K, Ben Amar M, Bykowski M, Castro APG, Cipitria A, Coles RA, Dimova R, Eder M, Ehrig S, Escudero LM, Evans ME, Fernandes PR, Fratzl P, Geris L, Gierlinger N, Hannezo EB, Iglič A, Kirkensgaard JJK, Kollmannsberger P, Kowalewska Ł, Kurniawan NA, Papantoniou I, Pieuchot L, Pires THV, Renner LD, Sageman-Furnas AO, Schröder-Turk GE, Sengupta A, Sharma VR, Tagua A, Tomba C, Trepat X, Waters SL, Yeo EF, Roschger A, Bidan CM, Dunlop JWC. 2023. Curvature in biological systems: Its quantification, emergence, and implications across the scales. Advanced Materials. 35(13), 2206110.","chicago":"Schamberger, Barbara, Ricardo Ziege, Karine Anselme, Martine Ben Amar, Michał Bykowski, André P.G. Castro, Amaia Cipitria, et al. “Curvature in Biological Systems: Its Quantification, Emergence, and Implications across the Scales.” Advanced Materials. Wiley, 2023. https://doi.org/10.1002/adma.202206110."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"2206110","date_created":"2023-03-05T23:01:06Z","doi":"10.1002/adma.202206110","date_published":"2023-03-29T00:00:00Z","year":"2023","isi":1,"has_accepted_license":"1","publication":"Advanced Materials","day":"29","oa":1,"quality_controlled":"1","publisher":"Wiley","acknowledgement":"B.S. and A.R. contributed equally to this work. A.P.G.C. and P.R.F. acknowledge the funding from Fundação para a Ciência e Tecnologia (Portugal), through IDMEC, under LAETA project UIDB/50022/2020. T.H.V.P. acknowledges the funding from Fundação para a Ciência e Tecnologia (Portugal), through Ph.D. Grant 2020.04417.BD. A.S. acknowledges that this work was partially supported by the ATTRACT Investigator Grant (no. A17/MS/11572821/MBRACE, to A.S.) from the Luxembourg National Research Fund. The author thanks Gerardo Ceada for his help in the graphical representations. N.A.K. acknowledges support from the European Research Council (grant 851960) and the Gravitation Program “Materials Driven Regeneration,” funded by the Netherlands Organization for Scientific Research (024.003.013). M.B.A. acknowledges support from the French National Research Agency (grant ANR-201-8-CE1-3-0008 for the project “Epimorph”). G.E.S.T. acknowledges funding by the Australian Research Council through project DP200102593. A.C. acknowledges the funding from the Deutsche Forschungsgemeinschaft (DFG) Emmy Noether Grant CI 203/-2 1, the Spanish Ministry of Science and Innovation (PID2021-123013O-BI00) and the IKERBASQUE Basque Foundation for Science.","department":[{"_id":"EdHa"}],"file_date_updated":"2023-09-26T10:51:56Z","date_updated":"2023-09-26T10:56:46Z","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":"12710","issue":"13","volume":35,"publication_status":"published","publication_identifier":{"eissn":["1521-4095"],"issn":["0935-9648"]},"language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"14373","checksum":"5c04d68130e97a0ecd1ca27fbc15a246","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_AdvancedMaterials_Schamberger.pdf","date_created":"2023-09-26T10:51:56Z","creator":"dernst","file_size":2898063,"date_updated":"2023-09-26T10:51:56Z"}],"scopus_import":"1","intvolume":" 35","month":"03","abstract":[{"text":"Surface curvature both emerges from, and influences the behavior of, living objects at length scales ranging from cell membranes to single cells to tissues and organs. The relevance of surface curvature in biology is supported by numerous experimental and theoretical investigations in recent years. In this review, first, a brief introduction to the key ideas of surface curvature in the context of biological systems is given and the challenges that arise when measuring surface curvature are discussed. Giving an overview of the emergence of curvature in biological systems, its significance at different length scales becomes apparent. On the other hand, summarizing current findings also shows that both single cells and entire cell sheets, tissues or organisms respond to curvature by modulating their shape and their migration behavior. Finally, the interplay between the distribution of morphogens or micro-organisms and the emergence of curvature across length scales is addressed with examples demonstrating these key mechanistic principles of morphogenesis. Overall, this review highlights that curved interfaces are not merely a passive by-product of the chemical, biological, and mechanical processes but that curvature acts also as a signal that co-determines these processes.","lang":"eng"}],"oa_version":"Published Version","pmid":1},{"abstract":[{"lang":"eng","text":"Photoisomerization of azobenzenes from their stable E isomer to the metastable Z state is the basis of numerous applications of these molecules. However, this reaction typically requires ultraviolet light, which limits applicability. In this study, we introduce disequilibration by sensitization under confinement (DESC), a supramolecular approach to induce the E-to-Z isomerization by using light of a desired color, including red. DESC relies on a combination of a macrocyclic host and a photosensitizer, which act together to selectively bind and sensitize E-azobenzenes for isomerization. The Z isomer lacks strong affinity for and is expelled from the host, which can then convert additional E-azobenzenes to the Z state. In this way, the host–photosensitizer complex converts photon energy into chemical energy in the form of out-of-equilibrium photostationary states, including ones that cannot be accessed through direct photoexcitation."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.26434/chemrxiv-2023-gq2h0","open_access":"1"}],"month":"09","intvolume":" 381","publication_identifier":{"eissn":["1095-9203"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"6664","volume":381,"_id":"13340","article_type":"original","type":"journal_article","status":"public","date_updated":"2023-10-03T08:11:26Z","department":[{"_id":"RaKl"}],"acknowledgement":"We acknowledge funding from the European Union’s Horizon 2020 Research and Innovation Program [European Research Council grants 820008 (Ra.K.) and 101045223 (A.P.) and Marie Skłodowska-Curie grants 812868 (J.G.) and 101022777 (T.-P.R.)], the Academy of Finland [Center of Excellence Programme LIBER grant 346107 (A.P.), Flagship Programme PREIN grant 320165 (A.P.), and Postdoctoral Researcher grant 340103 (T.-P.R.)], Zuckerman STEM Leadership Program Fellowship (J.R.C.), President’s PhD Scholarship (M.O.), and the EPSRC [Established Career Fellowship grant EP/R00188X/1 (M.J.F.)].","quality_controlled":"1","publisher":"American Association for the Advancement of Science","oa":1,"year":"2023","day":"22","publication":"Science","page":"1357-1363","doi":"10.1126/science.adh9059","date_published":"2023-09-22T00:00:00Z","date_created":"2023-08-01T08:26:15Z","citation":{"mla":"Gemen, Julius, et al. “Disequilibrating Azoarenes by Visible-Light Sensitization under Confinement.” Science, vol. 381, no. 6664, American Association for the Advancement of Science, 2023, pp. 1357–63, doi:10.1126/science.adh9059.","ieee":"J. Gemen et al., “Disequilibrating azoarenes by visible-light sensitization under confinement,” Science, vol. 381, no. 6664. American Association for the Advancement of Science, pp. 1357–1363, 2023.","short":"J. Gemen, J.R. Church, T.-P. Ruoko, N. Durandin, M.J. Białek, M. Weissenfels, M. Feller, M. Kazes, V.A. Borin, M. Odaybat, R. Kalepu, Y. Diskin-Posner, D. Oron, M.J. Fuchter, A. Priimagi, I. Schapiro, R. Klajn, Science 381 (2023) 1357–1363.","apa":"Gemen, J., Church, J. R., Ruoko, T.-P., Durandin, N., Białek, M. J., Weissenfels, M., … Klajn, R. (2023). Disequilibrating azoarenes by visible-light sensitization under confinement. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.adh9059","ama":"Gemen J, Church JR, Ruoko T-P, et al. Disequilibrating azoarenes by visible-light sensitization under confinement. Science. 2023;381(6664):1357-1363. doi:10.1126/science.adh9059","chicago":"Gemen, Julius, Jonathan R. Church, Tero-Petri Ruoko, Nikita Durandin, Michał J. Białek, Maren Weissenfels, Moran Feller, et al. “Disequilibrating Azoarenes by Visible-Light Sensitization under Confinement.” Science. American Association for the Advancement of Science, 2023. https://doi.org/10.1126/science.adh9059.","ista":"Gemen J, Church JR, Ruoko T-P, Durandin N, Białek MJ, Weissenfels M, Feller M, Kazes M, Borin VA, Odaybat M, Kalepu R, Diskin-Posner Y, Oron D, Fuchter MJ, Priimagi A, Schapiro I, Klajn R. 2023. Disequilibrating azoarenes by visible-light sensitization under confinement. Science. 381(6664), 1357–1363."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Gemen, Julius","last_name":"Gemen","first_name":"Julius"},{"first_name":"Jonathan R.","last_name":"Church","full_name":"Church, Jonathan R."},{"full_name":"Ruoko, Tero-Petri","last_name":"Ruoko","first_name":"Tero-Petri"},{"first_name":"Nikita","full_name":"Durandin, Nikita","last_name":"Durandin"},{"first_name":"Michał J.","full_name":"Białek, Michał J.","last_name":"Białek"},{"full_name":"Weissenfels, Maren","last_name":"Weissenfels","first_name":"Maren"},{"full_name":"Feller, Moran","last_name":"Feller","first_name":"Moran"},{"first_name":"Miri","full_name":"Kazes, Miri","last_name":"Kazes"},{"full_name":"Borin, Veniamin A.","last_name":"Borin","first_name":"Veniamin A."},{"full_name":"Odaybat, Magdalena","last_name":"Odaybat","first_name":"Magdalena"},{"last_name":"Kalepu","full_name":"Kalepu, Rishir","first_name":"Rishir"},{"first_name":"Yael","last_name":"Diskin-Posner","full_name":"Diskin-Posner, Yael"},{"last_name":"Oron","full_name":"Oron, Dan","first_name":"Dan"},{"first_name":"Matthew J.","last_name":"Fuchter","full_name":"Fuchter, Matthew J."},{"first_name":"Arri","last_name":"Priimagi","full_name":"Priimagi, Arri"},{"first_name":"Igor","full_name":"Schapiro, Igor","last_name":"Schapiro"},{"first_name":"Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn","full_name":"Klajn, Rafal"}],"article_processing_charge":"No","title":"Disequilibrating azoarenes by visible-light sensitization under confinement"},{"_id":"12705","status":"public","type":"journal_article","article_type":"original","date_updated":"2023-10-03T11:31:51Z","department":[{"_id":"AnSa"}],"oa_version":"Preprint","pmid":1,"abstract":[{"lang":"eng","text":"The elasticity of disordered and polydisperse polymer networks is a fundamental problem of soft matter physics that is still open. Here, we self-assemble polymer networks via simulations of a mixture of bivalent and tri- or tetravalent patchy particles, which result in an exponential strand length distribution analogous to that of experimental randomly cross-linked systems. After assembly, the network connectivity and topology are frozen and the resulting system is characterized. We find that the fractal structure of the network depends on the number density at which the assembly has been carried out, but that systems with the same mean valence and same assembly density have the same structural properties. Moreover, we compute the long-time limit of the mean-squared displacement, also known as the (squared) localization length, of the cross-links and of the middle monomers of the strands, showing that the dynamics of long strands is well described by the tube model. Finally, we find a relation connecting these two localization lengths at high density and connect the cross-link localization length to the shear modulus of the system."}],"month":"02","intvolume":" 158","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2211.04810","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"publication_status":"published","issue":"7","volume":158,"article_number":"074905","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Sorichetti, V., Ninarello, A., Ruiz-Franco, J., Hugouvieux, V., Zaccarelli, E., Micheletti, C., … Rovigatti, L. (2023). Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks. Journal of Chemical Physics. American Institute of Physics. https://doi.org/10.1063/5.0134271","ama":"Sorichetti V, Ninarello A, Ruiz-Franco J, et al. Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks. Journal of Chemical Physics. 2023;158(7). doi:10.1063/5.0134271","ieee":"V. Sorichetti et al., “Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks,” Journal of Chemical Physics, vol. 158, no. 7. American Institute of Physics, 2023.","short":"V. Sorichetti, A. Ninarello, J. Ruiz-Franco, V. Hugouvieux, E. Zaccarelli, C. Micheletti, W. Kob, L. Rovigatti, Journal of Chemical Physics 158 (2023).","mla":"Sorichetti, Valerio, et al. “Structure and Elasticity of Model Disordered, Polydisperse, and Defect-Free Polymer Networks.” Journal of Chemical Physics, vol. 158, no. 7, 074905, American Institute of Physics, 2023, doi:10.1063/5.0134271.","ista":"Sorichetti V, Ninarello A, Ruiz-Franco J, Hugouvieux V, Zaccarelli E, Micheletti C, Kob W, Rovigatti L. 2023. Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks. Journal of Chemical Physics. 158(7), 074905.","chicago":"Sorichetti, Valerio, Andrea Ninarello, José Ruiz-Franco, Virginie Hugouvieux, Emanuela Zaccarelli, Cristian Micheletti, Walter Kob, and Lorenzo Rovigatti. “Structure and Elasticity of Model Disordered, Polydisperse, and Defect-Free Polymer Networks.” Journal of Chemical Physics. American Institute of Physics, 2023. https://doi.org/10.1063/5.0134271."},"title":"Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks","author":[{"first_name":"Valerio","id":"ef8a92cb-c7b6-11ec-8bea-e1fd5847bc5b","orcid":"0000-0002-9645-6576","full_name":"Sorichetti, Valerio","last_name":"Sorichetti"},{"first_name":"Andrea","last_name":"Ninarello","full_name":"Ninarello, Andrea"},{"last_name":"Ruiz-Franco","full_name":"Ruiz-Franco, José","first_name":"José"},{"first_name":"Virginie","full_name":"Hugouvieux, Virginie","last_name":"Hugouvieux"},{"first_name":"Emanuela","full_name":"Zaccarelli, Emanuela","last_name":"Zaccarelli"},{"first_name":"Cristian","full_name":"Micheletti, Cristian","last_name":"Micheletti"},{"first_name":"Walter","full_name":"Kob, Walter","last_name":"Kob"},{"last_name":"Rovigatti","full_name":"Rovigatti, Lorenzo","first_name":"Lorenzo"}],"article_processing_charge":"No","external_id":{"pmid":["36813705"],"isi":["000936943800002"],"arxiv":["2211.04810"]},"acknowledgement":"We thank Michael Lang for helpful discussions. We acknowledge financial support from the European Research Council (ERC Consolidator Grant No. 681597, MIMIC) and from LabEx NUMEV (Grant No. ANR-10-LABX-20) funded by the “Investissements d’Avenir” French Government program, managed by the French National Research Agency (ANR). W.K. is a senior member of the Institut Universitaire de France.","publisher":"American Institute of Physics","quality_controlled":"1","oa":1,"day":"21","publication":"Journal of Chemical Physics","isi":1,"year":"2023","doi":"10.1063/5.0134271","date_published":"2023-02-21T00:00:00Z","date_created":"2023-03-05T23:01:05Z"},{"month":"03","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1007/s10703-023-00411-4","open_access":"1"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We study turn-based stochastic zero-sum games with lexicographic preferences over objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as controllable and adversarial non-determinism. Lexicographic order allows one to consider multiple objectives with a strict preference order. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. For a mixture of reachability and safety objectives, we show that deterministic lexicographically optimal strategies exist and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in NP∩coNP, matching the current known bound for single objectives; and in general the decision problem is PSPACE-hard and can be solved in NEXPTIME∩coNEXPTIME. We present an algorithm that computes the lexicographically optimal strategies via a reduction to the computation of optimal strategies in a sequence of single-objectives games. For omega-regular objectives, we restrict our analysis to one-player games, also known as Markov decision processes. We show that lexicographically optimal strategies exist and need either randomization or finite memory. We present an algorithm that solves the relevant decision problem in polynomial time. We have implemented our algorithms and report experimental results on various case studies."}],"related_material":{"record":[{"id":"8272","status":"public","relation":"earlier_version"}]},"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1572-8102"]},"publication_status":"epub_ahead","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)"},"_id":"12738","department":[{"_id":"KrCh"}],"ddc":["000"],"date_updated":"2023-10-03T11:36:13Z","publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"Tobias Winkler and Joost-Pieter Katoen are supported by the DFG RTG 2236 UnRAVeL and the innovation programme under the Marie Skłodowska-Curie grant agreement No. 101008233 (Mission). Krishnendu Chatterjee is supported by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) Project ICT15-003. Maximilian Weininger is supported by the DFG projects 383882557 Statistical Unbounded Verification (SUV) and 427755713 Group-By Objectives in Probabilistic Verification (GOPro). Stefanie Mohr is supported by the DFG RTG 2428 CONVEY. Open Access funding enabled and organized by Projekt DEAL.","date_published":"2023-03-08T00:00:00Z","doi":"10.1007/s10703-023-00411-4","date_created":"2023-03-19T23:00:59Z","day":"08","publication":"Formal Methods in System Design","isi":1,"year":"2023","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"title":"Stochastic games with lexicographic objectives","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Katoen, Joost P","last_name":"Katoen","first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stefanie","full_name":"Mohr, Stefanie","last_name":"Mohr"},{"first_name":"Maximilian","last_name":"Weininger","full_name":"Weininger, Maximilian"},{"full_name":"Winkler, Tobias","last_name":"Winkler","first_name":"Tobias"}],"article_processing_charge":"No","external_id":{"isi":["000946174300001"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Objectives.” Formal Methods in System Design, Springer Nature, 2023, doi:10.1007/s10703-023-00411-4.","ama":"Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. Stochastic games with lexicographic objectives. Formal Methods in System Design. 2023. doi:10.1007/s10703-023-00411-4","apa":"Chatterjee, K., Katoen, J. P., Mohr, S., Weininger, M., & Winkler, T. (2023). Stochastic games with lexicographic objectives. Formal Methods in System Design. Springer Nature. https://doi.org/10.1007/s10703-023-00411-4","short":"K. Chatterjee, J.P. Katoen, S. Mohr, M. Weininger, T. Winkler, Formal Methods in System Design (2023).","ieee":"K. Chatterjee, J. P. Katoen, S. Mohr, M. Weininger, and T. Winkler, “Stochastic games with lexicographic objectives,” Formal Methods in System Design. Springer Nature, 2023.","chicago":"Chatterjee, Krishnendu, Joost P Katoen, Stefanie Mohr, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Objectives.” Formal Methods in System Design. Springer Nature, 2023. https://doi.org/10.1007/s10703-023-00411-4.","ista":"Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. 2023. Stochastic games with lexicographic objectives. Formal Methods in System Design."}},{"title":"Source data for the manuscript \"CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration\"","department":[{"_id":"EdHa"}],"author":[{"full_name":"Ucar, Mehmet C","orcid":"0000-0003-0506-4217","last_name":"Ucar","id":"50B2A802-6007-11E9-A42B-EB23E6697425","first_name":"Mehmet C"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"citation":{"apa":"Ucar, M. C. (2023). Source data for the manuscript “CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration.” Zenodo. https://doi.org/10.5281/ZENODO.8133960","ama":"Ucar MC. Source data for the manuscript “CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration.” 2023. doi:10.5281/ZENODO.8133960","ieee":"M. C. Ucar, “Source data for the manuscript ‘CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration.’” Zenodo, 2023.","short":"M.C. Ucar, (2023).","mla":"Ucar, Mehmet C. Source Data for the Manuscript “CCR7 Acts as Both a Sensor and a Sink for CCL19 to Coordinate Collective Leukocyte Migration.” Zenodo, 2023, doi:10.5281/ZENODO.8133960.","ista":"Ucar MC. 2023. Source data for the manuscript ‘CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration’, Zenodo, 10.5281/ZENODO.8133960.","chicago":"Ucar, Mehmet C. “Source Data for the Manuscript ‘CCR7 Acts as Both a Sensor and a Sink for CCL19 to Coordinate Collective Leukocyte Migration.’” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8133960."},"date_updated":"2023-10-03T11:42:58Z","status":"public","type":"research_data_reference","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":"14279","doi":"10.5281/ZENODO.8133960","related_material":{"record":[{"status":"public","id":"14274","relation":"used_in_publication"}]},"date_published":"2023-07-11T00:00:00Z","date_created":"2023-09-06T08:39:25Z","day":"11","has_accepted_license":"1","year":"2023","month":"07","publisher":"Zenodo","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.8133960"}],"oa":1,"oa_version":"Published Version","abstract":[{"text":"The zip file includes source data used in the manuscript \"CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration\", as well as a representative Jupyter notebook to reproduce the main figures. Please see the preprint on bioRxiv and the DOI link there to access the final published version. Note the title change between the preprint and the published manuscript.\r\nA sample script for particle-based simulations of collective chemotaxis by self-generated gradients is also included (see Self-generated_chemotaxis_sample_script.ipynb) to generate exemplary cell trajectories. A detailed description of the simulation setup is provided in the supplementary information of the manuscipt.","lang":"eng"}]},{"department":[{"_id":"LaEr"}],"file_date_updated":"2023-10-04T09:21:48Z","ddc":["510"],"date_updated":"2023-10-04T09:22:55Z","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":"10405","ec_funded":1,"volume":76,"issue":"5","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"14388","checksum":"8346bc2642afb4ccb7f38979f41df5d9","file_size":803440,"date_updated":"2023-10-04T09:21:48Z","creator":"dernst","file_name":"2023_CommPureMathematics_Cipolloni.pdf","date_created":"2023-10-04T09:21:48Z"}],"publication_status":"published","publication_identifier":{"eissn":["1097-0312"],"issn":["0010-3640"]},"intvolume":" 76","month":"05","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"We consider large non-Hermitian random matrices X with complex, independent, identically distributed centred entries and show that the linear statistics of their eigenvalues are asymptotically Gaussian for test functions having 2+ϵ derivatives. Previously this result was known only for a few special cases; either the test functions were required to be analytic [72], or the distribution of the matrix elements needed to be Gaussian [73], or at least match the Gaussian up to the first four moments [82, 56]. We find the exact dependence of the limiting variance on the fourth cumulant that was not known before. The proof relies on two novel ingredients: (i) a local law for a product of two resolvents of the Hermitisation of X with different spectral parameters and (ii) a coupling of several weakly dependent Dyson Brownian motions. These methods are also the key inputs for our analogous results on the linear eigenvalue statistics of real matrices X that are presented in the companion paper [32]. ","lang":"eng"}],"title":"Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices","external_id":{"isi":["000724652500001"],"arxiv":["1912.04100"]},"article_processing_charge":"Yes (via OA deal)","author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","last_name":"Cipolloni"},{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schröder","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Central Limit Theorem for Linear Eigenvalue Statistics of Non-Hermitian Random Matrices.” Communications on Pure and Applied Mathematics. Wiley, 2023. https://doi.org/10.1002/cpa.22028.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2023. Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices. Communications on Pure and Applied Mathematics. 76(5), 946–1034.","mla":"Cipolloni, Giorgio, et al. “Central Limit Theorem for Linear Eigenvalue Statistics of Non-Hermitian Random Matrices.” Communications on Pure and Applied Mathematics, vol. 76, no. 5, Wiley, 2023, pp. 946–1034, doi:10.1002/cpa.22028.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Communications on Pure and Applied Mathematics 76 (2023) 946–1034.","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices,” Communications on Pure and Applied Mathematics, vol. 76, no. 5. Wiley, pp. 946–1034, 2023.","apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices. Communications on Pure and Applied Mathematics. Wiley. https://doi.org/10.1002/cpa.22028","ama":"Cipolloni G, Erdös L, Schröder DJ. Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices. Communications on Pure and Applied Mathematics. 2023;76(5):946-1034. doi:10.1002/cpa.22028"},"project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"date_created":"2021-12-05T23:01:41Z","doi":"10.1002/cpa.22028","date_published":"2023-05-01T00:00:00Z","page":"946-1034","publication":"Communications on Pure and Applied Mathematics","day":"01","year":"2023","isi":1,"has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Wiley","acknowledgement":"L.E. would like to thank Nathanaël Berestycki and D.S.would like to thank Nina Holden for valuable discussions on the Gaussian freefield.G.C. and L.E. are partially supported by ERC Advanced Grant No. 338804.G.C. received funding from the European Union’s Horizon 2020 research and in-novation programme under the Marie Skłodowska-Curie Grant Agreement No.665385. D.S. is supported by Dr. Max Rössler, the Walter Haefner Foundation, and the ETH Zürich Foundation."},{"ec_funded":1,"volume":13,"language":[{"iso":"eng"}],"file":[{"date_created":"2022-02-21T08:54:17Z","file_name":"2022_DynamicGamesApplic_Graham.pdf","creator":"dernst","date_updated":"2022-02-21T08:54:17Z","file_size":1890512,"checksum":"cd53b07e96f9030ddb348f305e5b58c7","file_id":"10781","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"eissn":["2153-0793"],"issn":["2153-0785"]},"intvolume":" 13","month":"03","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Mathematical models often aim to describe a complicated mechanism in a cohesive and simple manner. However, reaching perfect balance between being simple enough or overly simplistic is a challenging task. Frequently, game-theoretic models have an underlying assumption that players, whenever they choose to execute a specific action, do so perfectly. In fact, it is rare that action execution perfectly coincides with intentions of individuals, giving rise to behavioural mistakes. The concept of incompetence of players was suggested to address this issue in game-theoretic settings. Under the assumption of incompetence, players have non-zero probabilities of executing a different strategy from the one they chose, leading to stochastic outcomes of the interactions. In this article, we survey results related to the concept of incompetence in classic as well as evolutionary game theory and provide several new results. We also suggest future extensions of the model and argue why it is important to take into account behavioural mistakes when analysing interactions among players in both economic and biological settings."}],"file_date_updated":"2022-02-21T08:54:17Z","department":[{"_id":"KrCh"}],"ddc":["000"],"date_updated":"2023-10-04T09:24:30Z","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":"10770","date_created":"2022-02-20T23:01:32Z","date_published":"2023-03-01T00:00:00Z","doi":"10.1007/s13235-022-00425-3","page":"231-264","publication":"Dynamic Games and Applications","day":"01","year":"2023","isi":1,"has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"The authors would like to acknowledge stimulating email discussions with Dr Wayne Lobb of W.A. Lobb LLC on the topic of evolutionary games. We also thank Dr Thomas Taimre for his input to the material in Sect. 3.\r\nThe authors would like to acknowledge partial support from the Australian Research Council under the Discovery grant DP180101602 and support by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement #754411.","title":"Where do mistakes lead? A survey of games with incompetent players","article_processing_charge":"No","external_id":{"isi":["000753777100001"]},"author":[{"first_name":"Thomas","last_name":"Graham","full_name":"Graham, Thomas"},{"full_name":"Kleshnina, Maria","last_name":"Kleshnina","first_name":"Maria","id":"4E21749C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jerzy A.","full_name":"Filar, Jerzy A.","last_name":"Filar"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Graham, T., Kleshnina, M., & Filar, J. A. (2023). Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. Springer Nature. https://doi.org/10.1007/s13235-022-00425-3","ama":"Graham T, Kleshnina M, Filar JA. Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. 2023;13:231-264. doi:10.1007/s13235-022-00425-3","short":"T. Graham, M. Kleshnina, J.A. Filar, Dynamic Games and Applications 13 (2023) 231–264.","ieee":"T. Graham, M. Kleshnina, and J. A. Filar, “Where do mistakes lead? A survey of games with incompetent players,” Dynamic Games and Applications, vol. 13. Springer Nature, pp. 231–264, 2023.","mla":"Graham, Thomas, et al. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.” Dynamic Games and Applications, vol. 13, Springer Nature, 2023, pp. 231–64, doi:10.1007/s13235-022-00425-3.","ista":"Graham T, Kleshnina M, Filar JA. 2023. Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. 13, 231–264.","chicago":"Graham, Thomas, Maria Kleshnina, and Jerzy A. Filar. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.” Dynamic Games and Applications. Springer Nature, 2023. https://doi.org/10.1007/s13235-022-00425-3."},"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Dello Schiavo L. 2023. Ergodic decomposition of Dirichlet forms via direct integrals and applications. Potential Analysis. 58, 573–615.","chicago":"Dello Schiavo, Lorenzo. “Ergodic Decomposition of Dirichlet Forms via Direct Integrals and Applications.” Potential Analysis. Springer Nature, 2023. https://doi.org/10.1007/s11118-021-09951-y.","ama":"Dello Schiavo L. Ergodic decomposition of Dirichlet forms via direct integrals and applications. Potential Analysis. 2023;58:573-615. doi:10.1007/s11118-021-09951-y","apa":"Dello Schiavo, L. (2023). Ergodic decomposition of Dirichlet forms via direct integrals and applications. Potential Analysis. Springer Nature. https://doi.org/10.1007/s11118-021-09951-y","ieee":"L. Dello Schiavo, “Ergodic decomposition of Dirichlet forms via direct integrals and applications,” Potential Analysis, vol. 58. Springer Nature, pp. 573–615, 2023.","short":"L. Dello Schiavo, Potential Analysis 58 (2023) 573–615.","mla":"Dello Schiavo, Lorenzo. “Ergodic Decomposition of Dirichlet Forms via Direct Integrals and Applications.” Potential Analysis, vol. 58, Springer Nature, 2023, pp. 573–615, doi:10.1007/s11118-021-09951-y."},"title":"Ergodic decomposition of Dirichlet forms via direct integrals and applications","external_id":{"isi":["000704213400001"],"arxiv":["2003.01366"]},"article_processing_charge":"Yes (via OA deal)","author":[{"last_name":"Dello Schiavo","full_name":"Dello Schiavo, Lorenzo","orcid":"0000-0002-9881-6870","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","first_name":"Lorenzo"}],"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"}],"publication":"Potential Analysis","day":"01","year":"2023","has_accepted_license":"1","isi":1,"date_created":"2021-10-17T22:01:17Z","doi":"10.1007/s11118-021-09951-y","date_published":"2023-03-01T00:00:00Z","page":"573-615","acknowledgement":"The author is grateful to Professors Sergio Albeverio and Andreas Eberle, and to Dr. Kohei Suzuki, for fruitful conversations on the subject of the present work, and for respectively pointing out the references [1, 13], and [3, 20]. Finally, he is especially grateful to an anonymous Reviewer for their very careful reading and their suggestions which improved the readability of the paper.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","ddc":["510"],"date_updated":"2023-10-04T09:19:12Z","department":[{"_id":"JaMa"}],"file_date_updated":"2023-10-04T09:18:59Z","_id":"10145","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","language":[{"iso":"eng"}],"file":[{"file_size":806391,"date_updated":"2023-10-04T09:18:59Z","creator":"dernst","file_name":"2023_PotentialAnalysis_DelloSchiavo.pdf","date_created":"2023-10-04T09:18:59Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"625526482be300ca7281c91c30d41725","file_id":"14387"}],"publication_status":"published","publication_identifier":{"eissn":["1572-929X"],"issn":["0926-2601"]},"ec_funded":1,"volume":58,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We study direct integrals of quadratic and Dirichlet forms. We show that each quasi-regular Dirichlet space over a probability space admits a unique representation as a direct integral of irreducible Dirichlet spaces, quasi-regular for the same underlying topology. The same holds for each quasi-regular strongly local Dirichlet space over a metrizable Luzin σ-finite Radon measure space, and admitting carré du champ operator. In this case, the representation is only projectively unique."}],"intvolume":" 58","month":"03","scopus_import":"1"},{"title":"Asymmetric Ramsey properties of random graphs involving cliques and cycles","author":[{"first_name":"Anita","full_name":"Liebenau, Anita","last_name":"Liebenau"},{"first_name":"Letícia","full_name":"Mattos, Letícia","last_name":"Mattos"},{"full_name":"Mendonca Dos Santos, Walner","last_name":"Mendonca Dos Santos","id":"12c6bd4d-2cd0-11ec-a0da-e28f42f65ebd","first_name":"Walner"},{"first_name":"Jozef","last_name":"Skokan","full_name":"Skokan, Jozef"}],"external_id":{"isi":["000828530400001"]},"article_processing_charge":"Yes (in subscription journal)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Liebenau, Anita, Letícia Mattos, Walner Mendonca dos Santos, and Jozef Skokan. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.” Random Structures and Algorithms. Wiley, 2023. https://doi.org/10.1002/rsa.21106.","ista":"Liebenau A, Mattos L, Mendonca dos Santos W, Skokan J. 2023. Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. 62(4), 1035–1055.","mla":"Liebenau, Anita, et al. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.” Random Structures and Algorithms, vol. 62, no. 4, Wiley, 2023, pp. 1035–55, doi:10.1002/rsa.21106.","ama":"Liebenau A, Mattos L, Mendonca dos Santos W, Skokan J. Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. 2023;62(4):1035-1055. doi:10.1002/rsa.21106","apa":"Liebenau, A., Mattos, L., Mendonca dos Santos, W., & Skokan, J. (2023). Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.21106","short":"A. Liebenau, L. Mattos, W. Mendonca dos Santos, J. Skokan, Random Structures and Algorithms 62 (2023) 1035–1055.","ieee":"A. Liebenau, L. Mattos, W. Mendonca dos Santos, and J. Skokan, “Asymmetric Ramsey properties of random graphs involving cliques and cycles,” Random Structures and Algorithms, vol. 62, no. 4. Wiley, pp. 1035–1055, 2023."},"doi":"10.1002/rsa.21106","date_published":"2023-07-01T00:00:00Z","date_created":"2022-07-31T22:01:49Z","page":"1035-1055","day":"01","publication":"Random Structures and Algorithms","has_accepted_license":"1","isi":1,"year":"2023","quality_controlled":"1","publisher":"Wiley","oa":1,"acknowledgement":"This work was started at the thematic program GRAPHS@IMPA (January–March 2018), in Rio de Janeiro. We thank IMPA and the organisers for the hospitality and for providing a pleasant research environment. We thank Rob Morris for helpful discussions, and the anonymous referees for their careful reading and many helpful suggestions. Open Access funding enabled and organized by Projekt DEAL.\r\nA. Liebenau was supported by an ARC DECRA Fellowship Grant DE170100789. L. Mattos was supported by CAPES and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy – The Berlin Mathematics Research Center MATH+ (EXC-2046/1, project ID: 390685689). W. Mendonça was supported by CAPES project 88882.332408/2010-01.","file_date_updated":"2023-10-04T09:37:26Z","department":[{"_id":"MaKw"}],"ddc":["510"],"date_updated":"2023-10-04T09:38:45Z","status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"_id":"11706","volume":62,"issue":"4","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"3a5969d0c512aef01c30f3dc81c6d59b","file_id":"14389","success":1,"date_updated":"2023-10-04T09:37:26Z","file_size":1362334,"creator":"dernst","date_created":"2023-10-04T09:37:26Z","file_name":"2023_RandomStructureAlgorithms_Liebenau.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1042-9832"],"eissn":["1098-2418"]},"publication_status":"published","month":"07","intvolume":" 62","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"We say that (Formula presented.) if, in every edge coloring (Formula presented.), we can find either a 1-colored copy of (Formula presented.) or a 2-colored copy of (Formula presented.). The well-known states that the threshold for the property (Formula presented.) is equal to (Formula presented.), where (Formula presented.) is given by (Formula presented.) for any pair of graphs (Formula presented.) and (Formula presented.) with (Formula presented.). In this article, we show the 0-statement of the Kohayakawa–Kreuter conjecture for every pair of cycles and cliques. ","lang":"eng"}]},{"date_updated":"2023-10-04T10:21:07Z","department":[{"_id":"LaEr"}],"_id":"12707","status":"public","type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1350-7265"]},"publication_status":"published","volume":29,"issue":"2","ec_funded":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We establish precise right-tail small deviation estimates for the largest eigenvalue of real symmetric and complex Hermitian matrices whose entries are independent random variables with uniformly bounded moments. The proof relies on a Green function comparison along a continuous interpolating matrix flow for a long time. Less precise estimates are also obtained in the left tail."}],"month":"05","intvolume":" 29","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2112.12093","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Erdös L, Xu Y. 2023. Small deviation estimates for the largest eigenvalue of Wigner matrices. Bernoulli. 29(2), 1063–1079.","chicago":"Erdös, László, and Yuanyuan Xu. “Small Deviation Estimates for the Largest Eigenvalue of Wigner Matrices.” Bernoulli. Bernoulli Society for Mathematical Statistics and Probability, 2023. https://doi.org/10.3150/22-BEJ1490.","apa":"Erdös, L., & Xu, Y. (2023). Small deviation estimates for the largest eigenvalue of Wigner matrices. Bernoulli. Bernoulli Society for Mathematical Statistics and Probability. https://doi.org/10.3150/22-BEJ1490","ama":"Erdös L, Xu Y. Small deviation estimates for the largest eigenvalue of Wigner matrices. Bernoulli. 2023;29(2):1063-1079. doi:10.3150/22-BEJ1490","short":"L. Erdös, Y. Xu, Bernoulli 29 (2023) 1063–1079.","ieee":"L. Erdös and Y. Xu, “Small deviation estimates for the largest eigenvalue of Wigner matrices,” Bernoulli, vol. 29, no. 2. Bernoulli Society for Mathematical Statistics and Probability, pp. 1063–1079, 2023.","mla":"Erdös, László, and Yuanyuan Xu. “Small Deviation Estimates for the Largest Eigenvalue of Wigner Matrices.” Bernoulli, vol. 29, no. 2, Bernoulli Society for Mathematical Statistics and Probability, 2023, pp. 1063–79, doi:10.3150/22-BEJ1490."},"title":"Small deviation estimates for the largest eigenvalue of Wigner matrices","author":[{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"id":"7902bdb1-a2a4-11eb-a164-c9216f71aea3","first_name":"Yuanyuan","full_name":"Xu, Yuanyuan","orcid":"0000-0003-1559-1205","last_name":"Xu"}],"external_id":{"arxiv":["2112.12093 "],"isi":["000947270100008"]},"article_processing_charge":"No","project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331","call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"day":"01","publication":"Bernoulli","isi":1,"year":"2023","doi":"10.3150/22-BEJ1490","date_published":"2023-05-01T00:00:00Z","date_created":"2023-03-05T23:01:05Z","page":"1063-1079","quality_controlled":"1","publisher":"Bernoulli Society for Mathematical Statistics and Probability","oa":1},{"_id":"12837","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-10-04T11:14:05Z","ddc":["570"],"file_date_updated":"2023-10-04T11:13:28Z","department":[{"_id":"EdHa"},{"_id":"AnKi"}],"abstract":[{"lang":"eng","text":"As developing tissues grow in size and undergo morphogenetic changes, their material properties may be altered. Such changes result from tension dynamics at cell contacts or cellular jamming. Yet, in many cases, the cellular mechanisms controlling the physical state of growing tissues are unclear. We found that at early developmental stages, the epithelium in the developing mouse spinal cord maintains both high junctional tension and high fluidity. This is achieved via a mechanism in which interkinetic nuclear movements generate cell area dynamics that drive extensive cell rearrangements. Over time, the cell proliferation rate declines, effectively solidifying the tissue. Thus, unlike well-studied jamming transitions, the solidification uncovered here resembles a glass transition that depends on the dynamical stresses generated by proliferation and differentiation. Our finding that the fluidity of developing epithelia is linked to interkinetic nuclear movements and the dynamics of growth is likely to be relevant to multiple developing tissues."}],"oa_version":"Published Version","scopus_import":"1","month":"07","intvolume":" 19","publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"]},"publication_status":"published","file":[{"date_created":"2023-10-04T11:13:28Z","file_name":"2023_NaturePhysics_Boncanegra.pdf","date_updated":"2023-10-04T11:13:28Z","file_size":5532285,"creator":"dernst","file_id":"14392","checksum":"858225a4205b74406e5045006cdd853f","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"volume":19,"related_material":{"record":[{"status":"public","id":"13081","relation":"dissertation_contains"}]},"ec_funded":1,"project":[{"_id":"B6FC0238-B512-11E9-945C-1524E6697425","call_identifier":"H2020","grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord"},{"name":"Mechanisms of tissue size regulation in spinal cord development","grant_number":"101044579","_id":"bd7e737f-d553-11ed-ba76-d69ffb5ee3aa"},{"_id":"059DF620-7A3F-11EA-A408-12923DDC885E","name":"Morphogen control of growth and pattern in the spinal cord","grant_number":"F07802"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"citation":{"ieee":"L. Bocanegra, A. Singh, E. B. Hannezo, M. P. Zagórski, and A. Kicheva, “Cell cycle dynamics control fluidity of the developing mouse neuroepithelium,” Nature Physics, vol. 19. Springer Nature, pp. 1050–1058, 2023.","short":"L. Bocanegra, A. Singh, E.B. Hannezo, M.P. Zagórski, A. Kicheva, Nature Physics 19 (2023) 1050–1058.","ama":"Bocanegra L, Singh A, Hannezo EB, Zagórski MP, Kicheva A. Cell cycle dynamics control fluidity of the developing mouse neuroepithelium. Nature Physics. 2023;19:1050-1058. doi:10.1038/s41567-023-01977-w","apa":"Bocanegra, L., Singh, A., Hannezo, E. B., Zagórski, M. P., & Kicheva, A. (2023). Cell cycle dynamics control fluidity of the developing mouse neuroepithelium. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-023-01977-w","mla":"Bocanegra, Laura, et al. “Cell Cycle Dynamics Control Fluidity of the Developing Mouse Neuroepithelium.” Nature Physics, vol. 19, Springer Nature, 2023, pp. 1050–58, doi:10.1038/s41567-023-01977-w.","ista":"Bocanegra L, Singh A, Hannezo EB, Zagórski MP, Kicheva A. 2023. Cell cycle dynamics control fluidity of the developing mouse neuroepithelium. Nature Physics. 19, 1050–1058.","chicago":"Bocanegra, Laura, Amrita Singh, Edouard B Hannezo, Marcin P Zagórski, and Anna Kicheva. “Cell Cycle Dynamics Control Fluidity of the Developing Mouse Neuroepithelium.” Nature Physics. Springer Nature, 2023. https://doi.org/10.1038/s41567-023-01977-w."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Laura","id":"4896F754-F248-11E8-B48F-1D18A9856A87","last_name":"Bocanegra","full_name":"Bocanegra, Laura"},{"first_name":"Amrita","id":"76250f9f-3a21-11eb-9a80-a6180a0d7958","full_name":"Singh, Amrita","last_name":"Singh"},{"full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","last_name":"Hannezo","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B"},{"first_name":"Marcin P","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","last_name":"Zagórski","orcid":"0000-0001-7896-7762","full_name":"Zagórski, Marcin P"},{"first_name":"Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","last_name":"Kicheva","orcid":"0000-0003-4509-4998","full_name":"Kicheva, Anna"}],"article_processing_charge":"No","external_id":{"isi":["000964029300003"]},"title":"Cell cycle dynamics control fluidity of the developing mouse neuroepithelium","acknowledgement":"We thank S. Hippenmeyer for the reagents and C. P. Heisenberg, J. Briscoe and K. Page for comments on the manuscript. This work was supported by IST Austria; the European Research Council under Horizon 2020 research and innovation programme grant no. 680037 and Horizon Europe grant 101044579 (A.K.); Austrian Science Fund (FWF): F78 (Stem Cell Modulation) (A.K.); ISTFELLOW postdoctoral program (A.S.); Narodowe Centrum Nauki, Poland SONATA, 2017/26/D/NZ2/00454 (M.Z.); and the Polish National Agency for Academic Exchange (M.Z.).","quality_controlled":"1","publisher":"Springer Nature","oa":1,"isi":1,"has_accepted_license":"1","year":"2023","day":"01","publication":"Nature Physics","page":"1050-1058","date_published":"2023-07-01T00:00:00Z","doi":"10.1038/s41567-023-01977-w","date_created":"2023-04-16T22:01:09Z"},{"citation":{"ista":"Bocanegra L. 2023. Epithelial dynamics during mouse neural tube development. Institute of Science and Technology Austria.","chicago":"Bocanegra, Laura. “Epithelial Dynamics during Mouse Neural Tube Development.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13081.","ieee":"L. Bocanegra, “Epithelial dynamics during mouse neural tube development,” Institute of Science and Technology Austria, 2023.","short":"L. Bocanegra, Epithelial Dynamics during Mouse Neural Tube Development, Institute of Science and Technology Austria, 2023.","apa":"Bocanegra, L. (2023). Epithelial dynamics during mouse neural tube development. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:13081","ama":"Bocanegra L. Epithelial dynamics during mouse neural tube development. 2023. doi:10.15479/at:ista:13081","mla":"Bocanegra, Laura. Epithelial Dynamics during Mouse Neural Tube Development. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13081."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Laura","id":"4896F754-F248-11E8-B48F-1D18A9856A87","last_name":"Bocanegra","full_name":"Bocanegra, Laura"}],"article_processing_charge":"No","title":"Epithelial dynamics during mouse neural tube development","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","year":"2023","day":"23","page":"93","date_published":"2023-05-23T00:00:00Z","doi":"10.15479/at:ista:13081","date_created":"2023-05-23T19:10:42Z","_id":"13081","type":"dissertation","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"},"status":"public","supervisor":[{"first_name":"Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998","full_name":"Kicheva, Anna","last_name":"Kicheva"}],"date_updated":"2023-10-04T11:14:04Z","ddc":["570"],"file_date_updated":"2023-05-25T06:32:16Z","department":[{"_id":"GradSch"},{"_id":"AnKi"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"abstract":[{"text":"During development, tissues undergo changes in size and shape to form functional organs. Distinct cellular processes such as cell division and cell rearrangements underlie tissue morphogenesis. Yet how the distinct processes are controlled and coordinated, and how they contribute to morphogenesis is poorly understood. In our study, we addressed these questions using the developing mouse neural tube. This epithelial organ transforms from a flat epithelial sheet to an epithelial tube while increasing in size and undergoing morpho-gen-mediated patterning. The extent and mechanism of neural progenitor rearrangement within the developing mouse neuroepithelium is unknown. To investigate this, we per-formed high resolution lineage tracing analysis to quantify the extent of epithelial rear-rangement at different stages of neural tube development. We quantitatively described the relationship between apical cell size with cell cycle dependent interkinetic nuclear migra-tions (IKNM) and performed high cellular resolution live imaging of the neuroepithelium to study the dynamics of junctional remodeling. Furthermore, developed a vertex model of the neuroepithelium to investigate the quantitative contribution of cell proliferation, cell differentiation and mechanical properties to the epithelial rearrangement dynamics and validated the model predictions through functional experiments. Our analysis revealed that at early developmental stages, the apical cell area kinetics driven by IKNM induce high lev-els of cell rearrangements in a regime of high junctional tension and contractility. After E9.5, there is a sharp decline in the extent of cell rearrangements, suggesting that the epi-thelium transitions from a fluid-like to a solid-like state. We found that this transition is regulated by the growth rate of the tissue, rather than by changes in cell-cell adhesion and contractile forces. Overall, our study provides a quantitative description of the relationship between tissue growth, cell cycle dynamics, epithelia rearrangements and the emergent tissue material properties, and novel insights on how epithelial cell dynamics influences tissue morphogenesis.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"05","publication_identifier":{"issn":["2663 - 337X"]},"publication_status":"published","degree_awarded":"PhD","file":[{"file_size":25615534,"date_updated":"2023-05-25T06:32:12Z","creator":"lbocaneg","file_name":"Thesis_final_LauraBocanegra.docx","date_created":"2023-05-25T06:32:12Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","access_level":"closed","checksum":"74f3f89e59a0189bee53ebfad9c1b9af","file_id":"13089"},{"checksum":"c6cdef6323eacfb4b7a8af20f32eae97","file_id":"13090","embargo":"2024-05-31","content_type":"application/pdf","embargo_to":"open_access","access_level":"closed","relation":"main_file","date_created":"2023-05-25T06:32:16Z","file_name":"TotalFinal_Thesis_LauraBocanegraArx.pdf","date_updated":"2023-05-25T06:32:16Z","file_size":12386046,"creator":"lbocaneg"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"9349","status":"public"},{"status":"public","id":"12837","relation":"part_of_dissertation"}]}},{"_id":"12863","status":"public","type":"journal_article","article_type":"original","date_updated":"2023-10-04T11:23:10Z","department":[{"_id":"LifeSc"}],"pmid":1,"oa_version":"None","abstract":[{"lang":"eng","text":"In the present study, essential and nonessential metal content and biomarker responses were investigated in the intestine of fish collected from the areas polluted by mining. Our objective was to determine metal and biomarker levels in tissue responsible for dietary intake, which is rarely studied in water pollution research. The study was conducted in the Bregalnica River, reference location, and in the Zletovska and Kriva Rivers (the Republic of North Macedonia), which are directly influenced by the active mines Zletovo and Toranica, respectively. Biological responses were analyzed in Vardar chub (Squalius vardarensis; Karaman, 1928), using for the first time intestinal cytosol as a potentially toxic cell fraction, since metal sensitivity is mostly associated with cytosol. Cytosolic metal levels were higher in fish under the influence of mining (Tl, Li, Cs, Mo, Sr, Cd, Rb, and Cu in the Zletovska River and Cr, Pb, and Se in the Kriva River compared to the Bregalnica River in both seasons). The same trend was evident for total proteins, biomarkers of general stress, and metallothioneins, biomarkers of metal exposure, indicating cellular disturbances in the intestine, the primary site of dietary metal uptake. The association of cytosolic Cu and Cd at all locations pointed to similar pathways and homeostasis of these metallothionein-binding metals. Comparison with other indicator tissues showed that metal concentrations were higher in the intestine of fish from mining-affected areas than in the liver and gills. In general, these results indicated the importance of dietary metal pathways, and cytosolic metal fraction in assessing pollution impacts in freshwater ecosystems."}],"month":"05","intvolume":" 30","scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1614-7499"],"issn":["0944-1344"]},"publication_status":"published","volume":30,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Filipović Marijić, Vlatka, Nesrete Krasnici, Damir Valić, Damir Kapetanović, Irena Vardić Smrzlić, Maja Jordanova, Katerina Rebok, et al. “Pollution Impact on Metal and Biomarker Responses in Intestinal Cytosol of Freshwater Fish.” Environmental Science and Pollution Research. Springer Nature, 2023. https://doi.org/10.1007/s11356-023-26844-2.","ista":"Filipović Marijić V, Krasnici N, Valić D, Kapetanović D, Vardić Smrzlić I, Jordanova M, Rebok K, Ramani S, Kostov V, Nastova R, Dragun Z. 2023. Pollution impact on metal and biomarker responses in intestinal cytosol of freshwater fish. Environmental Science and Pollution Research. 30, 63510–63521.","mla":"Filipović Marijić, Vlatka, et al. “Pollution Impact on Metal and Biomarker Responses in Intestinal Cytosol of Freshwater Fish.” Environmental Science and Pollution Research, vol. 30, Springer Nature, 2023, pp. 63510–21, doi:10.1007/s11356-023-26844-2.","ama":"Filipović Marijić V, Krasnici N, Valić D, et al. Pollution impact on metal and biomarker responses in intestinal cytosol of freshwater fish. Environmental Science and Pollution Research. 2023;30:63510-63521. doi:10.1007/s11356-023-26844-2","apa":"Filipović Marijić, V., Krasnici, N., Valić, D., Kapetanović, D., Vardić Smrzlić, I., Jordanova, M., … Dragun, Z. (2023). Pollution impact on metal and biomarker responses in intestinal cytosol of freshwater fish. Environmental Science and Pollution Research. Springer Nature. https://doi.org/10.1007/s11356-023-26844-2","short":"V. Filipović Marijić, N. Krasnici, D. Valić, D. Kapetanović, I. Vardić Smrzlić, M. Jordanova, K. Rebok, S. Ramani, V. Kostov, R. Nastova, Z. Dragun, Environmental Science and Pollution Research 30 (2023) 63510–63521.","ieee":"V. Filipović Marijić et al., “Pollution impact on metal and biomarker responses in intestinal cytosol of freshwater fish,” Environmental Science and Pollution Research, vol. 30. Springer Nature, pp. 63510–63521, 2023."},"title":"Pollution impact on metal and biomarker responses in intestinal cytosol of freshwater fish","author":[{"first_name":"Vlatka","last_name":"Filipović Marijić","full_name":"Filipović Marijić, Vlatka"},{"full_name":"Krasnici, Nesrete","last_name":"Krasnici","first_name":"Nesrete","id":"cb5852d4-287f-11ed-baf0-bc1dd2d5c745"},{"first_name":"Damir","full_name":"Valić, Damir","last_name":"Valić"},{"first_name":"Damir","full_name":"Kapetanović, Damir","last_name":"Kapetanović"},{"first_name":"Irena","full_name":"Vardić Smrzlić, Irena","last_name":"Vardić Smrzlić"},{"full_name":"Jordanova, Maja","last_name":"Jordanova","first_name":"Maja"},{"last_name":"Rebok","full_name":"Rebok, Katerina","first_name":"Katerina"},{"last_name":"Ramani","full_name":"Ramani, Sheriban","first_name":"Sheriban"},{"last_name":"Kostov","full_name":"Kostov, Vasil","first_name":"Vasil"},{"first_name":"Rodne","full_name":"Nastova, Rodne","last_name":"Nastova"},{"full_name":"Dragun, Zrinka","last_name":"Dragun","first_name":"Zrinka"}],"article_processing_charge":"No","external_id":{"pmid":["37055686"],"isi":["000970917900012"]},"acknowledgement":"The authors are grateful to Dr. Nevenka Mikac for the opportunity to perform metal measurements on HR ICP-MS. This research was funded by the Ministry of Science, Education and Sport of the Republic of Croatia (projects No. 098–0982934-2721 and 098–1782739-2749). The sampling was carried out as a part of two Croatian-Macedonian bilateral projects: “The assessment of availability and effects of metals on fish in the rivers under the impact of mining activities” and “Bacterial and parasitical communities of chub as indicators of the status of environment exposed to mining activities.”","quality_controlled":"1","publisher":"Springer Nature","day":"01","publication":"Environmental Science and Pollution Research","isi":1,"year":"2023","date_published":"2023-05-01T00:00:00Z","doi":"10.1007/s11356-023-26844-2","date_created":"2023-04-23T22:01:03Z","page":"63510-63521"},{"day":"04","publication":"Advanced Optical Materials","isi":1,"year":"2023","date_published":"2023-07-04T00:00:00Z","doi":"10.1002/adom.202202631","date_created":"2023-04-16T22:01:09Z","acknowledgement":"The authors acknowledge insightful discussions with Prof. Wang Yao and graphics by Rezlind Bushati. M.K. and N.Y. acknowledge support from NSF grants NSF DMR-1709996 and NSF OMA 1936276. S.G. was supported by the Army Research Office Multidisciplinary University Research Initiative program (W911NF-17-1-0312) and V.M.M. by the Army Research Office grant (W911NF-22-1-0091). K.M acknowledges the SPARC program that supported his collaboration with the CUNY team. The authors acknowledge the Nanofabrication facility at the CUNY Advanced Science Research Center where the cavity devices were fabricated.","quality_controlled":"1","publisher":"Wiley","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Khatoniar M, Yama N, Ghazaryan A, Guddala S, Ghaemi P, Majumdar K, Menon V. 2023. Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities. Advanced Optical Materials. 11(13), 2202631.","chicago":"Khatoniar, Mandeep, Nicholas Yama, Areg Ghazaryan, Sriram Guddala, Pouyan Ghaemi, Kausik Majumdar, and Vinod Menon. “Optical Manipulation of Layer–Valley Coherence via Strong Exciton–Photon Coupling in Microcavities.” Advanced Optical Materials. Wiley, 2023. https://doi.org/10.1002/adom.202202631.","ama":"Khatoniar M, Yama N, Ghazaryan A, et al. Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities. Advanced Optical Materials. 2023;11(13). doi:10.1002/adom.202202631","apa":"Khatoniar, M., Yama, N., Ghazaryan, A., Guddala, S., Ghaemi, P., Majumdar, K., & Menon, V. (2023). Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities. Advanced Optical Materials. Wiley. https://doi.org/10.1002/adom.202202631","ieee":"M. Khatoniar et al., “Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities,” Advanced Optical Materials, vol. 11, no. 13. Wiley, 2023.","short":"M. Khatoniar, N. Yama, A. Ghazaryan, S. Guddala, P. Ghaemi, K. Majumdar, V. Menon, Advanced Optical Materials 11 (2023).","mla":"Khatoniar, Mandeep, et al. “Optical Manipulation of Layer–Valley Coherence via Strong Exciton–Photon Coupling in Microcavities.” Advanced Optical Materials, vol. 11, no. 13, 2202631, Wiley, 2023, doi:10.1002/adom.202202631."},"title":"Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities","author":[{"first_name":"Mandeep","full_name":"Khatoniar, Mandeep","last_name":"Khatoniar"},{"first_name":"Nicholas","last_name":"Yama","full_name":"Yama, Nicholas"},{"first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan","full_name":"Ghazaryan, Areg","orcid":"0000-0001-9666-3543"},{"full_name":"Guddala, Sriram","last_name":"Guddala","first_name":"Sriram"},{"full_name":"Ghaemi, Pouyan","last_name":"Ghaemi","first_name":"Pouyan"},{"first_name":"Kausik","last_name":"Majumdar","full_name":"Majumdar, Kausik"},{"first_name":"Vinod","last_name":"Menon","full_name":"Menon, Vinod"}],"external_id":{"isi":["000963866700001"],"arxiv":["2211.08755"]},"article_processing_charge":"No","article_number":"2202631","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2195-1071"]},"publication_status":"published","volume":11,"issue":"13","oa_version":"Preprint","abstract":[{"text":"Coherent control and manipulation of quantum degrees of freedom such as spins forms the basis of emerging quantum technologies. In this context, the robust valley degree of freedom and the associated valley pseudospin found in two-dimensional transition metal dichalcogenides is a highly attractive platform. Valley polarization and coherent superposition of valley states have been observed in these systems even up to room temperature. Control of valley coherence is an important building block for the implementation of valley qubit. Large magnetic fields or high-power lasers have been used in the past to demonstrate the control (initialization and rotation) of the valley coherent states. Here, the control of layer–valley coherence via strong coupling of valley excitons in bilayer WS2 to microcavity photons is demonstrated by exploiting the pseudomagnetic field arising in optical cavities owing to the transverse electric–transverse magnetic (TE–TM)mode splitting. The use of photonic structures to generate pseudomagnetic fields which can be used to manipulate exciton-polaritons presents an attractive approach to control optical responses without the need for large magnets or high-intensity optical pump powers.","lang":"eng"}],"month":"07","intvolume":" 11","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2211.08755","open_access":"1"}],"date_updated":"2023-10-04T11:15:17Z","department":[{"_id":"MiLe"}],"_id":"12836","status":"public","type":"journal_article","article_type":"original"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Gladbach, Peter, et al. “Homogenisation of Dynamical Optimal Transport on Periodic Graphs.” Calculus of Variations and Partial Differential Equations, vol. 62, no. 5, 143, Springer Nature, 2023, doi:10.1007/s00526-023-02472-z.","ama":"Gladbach P, Kopfer E, Maas J, Portinale L. Homogenisation of dynamical optimal transport on periodic graphs. Calculus of Variations and Partial Differential Equations. 2023;62(5). doi:10.1007/s00526-023-02472-z","apa":"Gladbach, P., Kopfer, E., Maas, J., & Portinale, L. (2023). Homogenisation of dynamical optimal transport on periodic graphs. Calculus of Variations and Partial Differential Equations. Springer Nature. https://doi.org/10.1007/s00526-023-02472-z","short":"P. Gladbach, E. Kopfer, J. Maas, L. Portinale, Calculus of Variations and Partial Differential Equations 62 (2023).","ieee":"P. Gladbach, E. Kopfer, J. Maas, and L. Portinale, “Homogenisation of dynamical optimal transport on periodic graphs,” Calculus of Variations and Partial Differential Equations, vol. 62, no. 5. Springer Nature, 2023.","chicago":"Gladbach, Peter, Eva Kopfer, Jan Maas, and Lorenzo Portinale. “Homogenisation of Dynamical Optimal Transport on Periodic Graphs.” Calculus of Variations and Partial Differential Equations. Springer Nature, 2023. https://doi.org/10.1007/s00526-023-02472-z.","ista":"Gladbach P, Kopfer E, Maas J, Portinale L. 2023. Homogenisation of dynamical optimal transport on periodic graphs. Calculus of Variations and Partial Differential Equations. 62(5), 143."},"title":"Homogenisation of dynamical optimal transport on periodic graphs","author":[{"full_name":"Gladbach, Peter","last_name":"Gladbach","first_name":"Peter"},{"first_name":"Eva","last_name":"Kopfer","full_name":"Kopfer, Eva"},{"orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","first_name":"Lorenzo","last_name":"Portinale","full_name":"Portinale, Lorenzo"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000980588900001"],"arxiv":["2110.15321"]},"article_number":"143","project":[{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"},{"call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425","name":"Dissipation and Dispersion in Nonlinear Partial Differential Equations"}],"day":"28","publication":"Calculus of Variations and Partial Differential Equations","has_accepted_license":"1","isi":1,"year":"2023","date_published":"2023-04-28T00:00:00Z","doi":"10.1007/s00526-023-02472-z","date_created":"2023-05-14T22:01:00Z","acknowledgement":"J.M. gratefully acknowledges support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 716117). J.M and L.P. also acknowledge support from the Austrian Science Fund (FWF), grants No F65 and W1245. E.K. gratefully acknowledges support by the German Research Foundation through the Hausdorff Center for Mathematics and the Collaborative Research Center 1060. P.G. is partially funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)—350398276. We thank the anonymous reviewer for the careful reading and for useful suggestions. Open access funding provided by Austrian Science Fund (FWF).","quality_controlled":"1","publisher":"Springer Nature","oa":1,"ddc":["510"],"date_updated":"2023-10-04T11:34:49Z","file_date_updated":"2023-10-04T11:34:10Z","department":[{"_id":"JaMa"}],"_id":"12959","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)"},"file":[{"checksum":"359bee38d94b7e0aa73925063cb8884d","file_id":"14393","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-10-04T11:34:10Z","file_name":"2023_CalculusEquations_Gladbach.pdf","creator":"dernst","date_updated":"2023-10-04T11:34:10Z","file_size":1240995}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0944-2669"],"eissn":["1432-0835"]},"publication_status":"published","issue":"5","volume":62,"ec_funded":1,"oa_version":"Published Version","abstract":[{"text":"This paper deals with the large-scale behaviour of dynamical optimal transport on Zd\r\n-periodic graphs with general lower semicontinuous and convex energy densities. Our main contribution is a homogenisation result that describes the effective behaviour of the discrete problems in terms of a continuous optimal transport problem. The effective energy density can be explicitly expressed in terms of a cell formula, which is a finite-dimensional convex programming problem that depends non-trivially on the local geometry of the discrete graph and the discrete energy density. Our homogenisation result is derived from a Γ\r\n-convergence result for action functionals on curves of measures, which we prove under very mild growth conditions on the energy density. We investigate the cell formula in several cases of interest, including finite-volume discretisations of the Wasserstein distance, where non-trivial limiting behaviour occurs.","lang":"eng"}],"month":"04","intvolume":" 62","scopus_import":"1"},{"_id":"12915","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-10-04T11:29:22Z","department":[{"_id":"MaIb"}],"pmid":1,"oa_version":"None","abstract":[{"text":"Cu2–xS and Cu2–xSe have recently been reported as promising thermoelectric (TE) materials for medium-temperature applications. In contrast, Cu2–xTe, another member of the copper chalcogenide family, typically exhibits low Seebeck coefficients that limit its potential to achieve a superior thermoelectric figure of merit, zT, particularly in the low-temperature range where this material could be effective. To address this, we investigated the TE performance of Cu1.5–xTe–Cu2Se nanocomposites by consolidating surface-engineered Cu1.5Te nanocrystals. This surface engineering strategy allows for precise adjustment of Cu/Te ratios and results in a reversible phase transition at around 600 K in Cu1.5–xTe–Cu2Se nanocomposites, as systematically confirmed by in situ high-temperature X-ray diffraction combined with differential scanning calorimetry analysis. The phase transition leads to a conversion from metallic-like to semiconducting-like TE properties. Additionally, a layer of Cu2Se generated around Cu1.5–xTe nanoparticles effectively inhibits Cu1.5–xTe grain growth, minimizing thermal conductivity and decreasing hole concentration. These properties indicate that copper telluride based compounds have a promising thermoelectric potential, translated into a high dimensionless zT of 1.3 at 560 K.","lang":"eng"}],"intvolume":" 17","month":"05","scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1936-086X"],"issn":["1936-0851"]},"issue":"9","volume":17,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"C. Xing et al., “Thermoelectric performance of surface-engineered Cu1.5–xTe–Cu2Se nanocomposites,” ACS Nano, vol. 17, no. 9. American Chemical Society, pp. 8442–8452, 2023.","short":"C. Xing, Y. Zhang, K. Xiao, X. Han, Y. Liu, B. Nan, M.G. Ramon, K.H. Lim, J. Li, J. Arbiol, B. Poudel, A. Nozariasbmarz, W. Li, M. Ibáñez, A. Cabot, ACS Nano 17 (2023) 8442–8452.","ama":"Xing C, Zhang Y, Xiao K, et al. Thermoelectric performance of surface-engineered Cu1.5–xTe–Cu2Se nanocomposites. ACS Nano. 2023;17(9):8442-8452. doi:10.1021/acsnano.3c00495","apa":"Xing, C., Zhang, Y., Xiao, K., Han, X., Liu, Y., Nan, B., … Cabot, A. (2023). Thermoelectric performance of surface-engineered Cu1.5–xTe–Cu2Se nanocomposites. ACS Nano. American Chemical Society. https://doi.org/10.1021/acsnano.3c00495","mla":"Xing, Congcong, et al. “Thermoelectric Performance of Surface-Engineered Cu1.5–XTe–Cu2Se Nanocomposites.” ACS Nano, vol. 17, no. 9, American Chemical Society, 2023, pp. 8442–52, doi:10.1021/acsnano.3c00495.","ista":"Xing C, Zhang Y, Xiao K, Han X, Liu Y, Nan B, Ramon MG, Lim KH, Li J, Arbiol J, Poudel B, Nozariasbmarz A, Li W, Ibáñez M, Cabot A. 2023. Thermoelectric performance of surface-engineered Cu1.5–xTe–Cu2Se nanocomposites. ACS Nano. 17(9), 8442–8452.","chicago":"Xing, Congcong, Yu Zhang, Ke Xiao, Xu Han, Yu Liu, Bingfei Nan, Maria Garcia Ramon, et al. “Thermoelectric Performance of Surface-Engineered Cu1.5–XTe–Cu2Se Nanocomposites.” ACS Nano. American Chemical Society, 2023. https://doi.org/10.1021/acsnano.3c00495."},"title":"Thermoelectric performance of surface-engineered Cu1.5–xTe–Cu2Se nanocomposites","article_processing_charge":"No","external_id":{"isi":["000976063200001"],"pmid":["37071412"]},"author":[{"full_name":"Xing, Congcong","last_name":"Xing","first_name":"Congcong"},{"full_name":"Zhang, Yu","last_name":"Zhang","first_name":"Yu"},{"full_name":"Xiao, Ke","last_name":"Xiao","first_name":"Ke"},{"first_name":"Xu","last_name":"Han","full_name":"Han, Xu"},{"id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu","last_name":"Liu","orcid":"0000-0001-7313-6740","full_name":"Liu, Yu"},{"first_name":"Bingfei","full_name":"Nan, Bingfei","last_name":"Nan"},{"id":"1ffff7cd-ed76-11ed-8d5f-be5e7c364eb9","first_name":"Maria Garcia","full_name":"Ramon, Maria Garcia","last_name":"Ramon"},{"first_name":"Khak Ho","last_name":"Lim","full_name":"Lim, Khak Ho"},{"last_name":"Li","full_name":"Li, Junshan","first_name":"Junshan"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"full_name":"Poudel, Bed","last_name":"Poudel","first_name":"Bed"},{"full_name":"Nozariasbmarz, Amin","last_name":"Nozariasbmarz","first_name":"Amin"},{"last_name":"Li","full_name":"Li, Wenjie","first_name":"Wenjie"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"acknowledgement":"The authors acknowledge support from the projects ENE2016-77798-C4-3-R and NANOGEN (PID2020-116093RB-C43) funded by MCIN/AEI/10.13039/501100011033/and by “ERDF A way of making Europe”, and by the “European Union”. K.X. and B.N. thank the China Scholarship Council (CSC) for scholarship support. The authors acknowledge funding from Generalitat de Catalunya 2017 SGR 327 and 2017 SGR 1246. ICN2 is supported by the Severo Ochoa program from the Spanish MCIN/AEI (Grant No.: CEX2021-001214-S). IREC and ICN2 are funded by the CERCA Programme/Generalitat de Catalunya. J.L. acknowledges support from the Natural Science Foundation of Sichuan province (2022NSFSC1229). Part of the present work was performed in the frameworks of Universitat de Barcelona Nanoscience Ph.D. program and Universitat Autònoma de Barcelona Materials Science Ph.D. program. Y.L. acknowledges funding from the National Natural Science Foundation of China (Grant No. 22209034) and the Innovation and Entrepreneurship Project of Overseas Returnees in Anhui Province (Grants No. 2022LCX002). K.H.L. acknowledges the financial support of the National Natural Science Foundation of China (Grant No. 22208293).","publisher":"American Chemical Society","quality_controlled":"1","publication":"ACS Nano","day":"09","year":"2023","isi":1,"date_created":"2023-05-07T22:01:04Z","doi":"10.1021/acsnano.3c00495","date_published":"2023-05-09T00:00:00Z","page":"8442-8452"}]