[{"scopus_import":"1","doi":"10.1007/978-3-031-37706-8_20","intvolume":"     13964","author":[{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165"},{"full_name":"Prokop, Maximilian","last_name":"Prokop","first_name":"Maximilian"},{"last_name":"Rieder","full_name":"Rieder, Sabine","first_name":"Sabine"}],"date_created":"2023-09-03T22:01:16Z","volume":13964,"oa":1,"month":"07","oa_version":"Published Version","status":"public","_id":"14259","ddc":["000"],"file_date_updated":"2023-09-06T08:25:50Z","language":[{"iso":"eng"}],"year":"2023","license":"https://creativecommons.org/licenses/by/4.0/","page":"390-414","publisher":"Springer Nature","day":"17","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","department":[{"_id":"KrCh"}],"date_updated":"2025-09-09T12:52:34Z","publication_status":"published","title":"Guessing winning policies in LTL synthesis by semantic learning","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"external_id":{"isi":["001310786500020"]},"date_published":"2023-07-17T00:00:00Z","quality_controlled":"1","abstract":[{"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.","lang":"eng"}],"publication_identifier":{"isbn":["9783031377051"],"issn":["0302-9743"],"eissn":["1611-3349"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"chicago":"Kretinsky, Jan, Tobias Meggendorfer, Maximilian Prokop, and Sabine Rieder. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” In <i>35th International Conference on Computer Aided Verification </i>, 13964:390–414. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">https://doi.org/10.1007/978-3-031-37706-8_20</a>.","apa":"Kretinsky, J., Meggendorfer, T., Prokop, M., &#38; Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In <i>35th International Conference on Computer Aided Verification </i> (Vol. 13964, pp. 390–414). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">https://doi.org/10.1007/978-3-031-37706-8_20</a>","short":"J. Kretinsky, T. Meggendorfer, M. Prokop, S. Rieder, in:, 35th International Conference on Computer Aided Verification , Springer Nature, 2023, pp. 390–414.","ama":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. Guessing winning policies in LTL synthesis by semantic learning. In: <i>35th International Conference on Computer Aided Verification </i>. Vol 13964. Springer Nature; 2023:390-414. doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">10.1007/978-3-031-37706-8_20</a>","ieee":"J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning policies in LTL synthesis by semantic learning,” in <i>35th International Conference on Computer Aided Verification </i>, Paris, France, 2023, vol. 13964, pp. 390–414.","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.","mla":"Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” <i>35th International Conference on Computer Aided Verification </i>, vol. 13964, Springer Nature, 2023, pp. 390–414, doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">10.1007/978-3-031-37706-8_20</a>."},"publication":"35th International Conference on Computer Aided Verification ","file":[{"file_id":"14276","file_size":428354,"relation":"main_file","content_type":"application/pdf","checksum":"ed66278b61bb869e1baba3d9b9081271","file_name":"2023_LNCS_CAV_Kretinsky.pdf","date_created":"2023-09-06T08:25:50Z","date_updated":"2023-09-06T08:25:50Z","success":1,"access_level":"open_access","creator":"dernst"}],"alternative_title":["LNCS"],"type":"conference","acknowledgement":"This research was funded in part by the German Research Foundation (DFG) project 427755713 Group-By Objectives in Probabilistic Verification (GOPro).","conference":{"end_date":"2023-07-22","start_date":"2023-07-17","location":"Paris, France","name":"CAV: Computer Aided Verification"}},{"volume":13964,"related_material":{"record":[{"status":"public","relation":"research_data","id":"14995"}]},"date_created":"2023-09-03T22:01:16Z","author":[{"first_name":"Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","last_name":"Koval","full_name":"Koval, Nikita"},{"full_name":"Fedorov, Alexander","last_name":"Fedorov","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander"},{"full_name":"Sokolova, Maria","last_name":"Sokolova","first_name":"Maria"},{"first_name":"Dmitry","full_name":"Tsitelov, Dmitry","last_name":"Tsitelov"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"}],"intvolume":"     13964","doi":"10.1007/978-3-031-37706-8_8","scopus_import":"1","_id":"14260","ddc":["000"],"file_date_updated":"2023-09-06T08:16:25Z","status":"public","oa_version":"Published Version","month":"07","oa":1,"page":"156-169","year":"2023","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"},{"_id":"GradSch"}],"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","day":"17","publisher":"Springer Nature","quality_controlled":"1","abstract":[{"text":"This paper presents Lincheck, a new practical and user-friendly framework for testing concurrent algorithms on the Java Virtual Machine (JVM). Lincheck provides a simple and declarative way to write concurrent tests: instead of describing how to perform the test, users specify what to test by declaring all the operations to examine; the framework automatically handles the rest. As a result, tests written with Lincheck are concise and easy to understand. The framework automatically generates a set of concurrent scenarios, examines them using stress-testing or bounded model checking, and verifies that the results of each invocation are correct. Notably, if an error is detected via model checking, Lincheck provides an easy-to-follow trace to reproduce it, significantly simplifying the bug investigation.\r\n\r\nTo the best of our knowledge, Lincheck is the first production-ready tool on the JVM that offers such a simple way of writing concurrent tests, without requiring special skills or expertise. We successfully integrated Lincheck in the development process of several large projects, such as Kotlin Coroutines, and identified new bugs in popular concurrency libraries, such as a race in Java’s standard ConcurrentLinkedDeque and a liveliness bug in Java’s AbstractQueuedSynchronizer framework, which is used in most of the synchronization primitives. We believe that Lincheck can significantly improve the quality and productivity of concurrent algorithms research and development and become the state-of-the-art tool for checking their correctness.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"external_id":{"isi":["001310786500008"]},"date_published":"2023-07-17T00:00:00Z","publication_status":"published","title":"Lincheck: A practical framework for testing concurrent data structures on JVM","date_updated":"2025-09-09T12:51:52Z","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031377051"],"issn":["0302-9743"]},"publication":"35th International Conference on Computer Aided Verification ","citation":{"apa":"Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &#38; Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. In <i>35th International Conference on Computer Aided Verification </i> (Vol. 13964, pp. 156–169). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">https://doi.org/10.1007/978-3-031-37706-8_8</a>","chicago":"Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” In <i>35th International Conference on Computer Aided Verification </i>, 13964:156–69. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">https://doi.org/10.1007/978-3-031-37706-8_8</a>.","short":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, in:, 35th International Conference on Computer Aided Verification , Springer Nature, 2023, pp. 156–169.","ieee":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM,” in <i>35th International Conference on Computer Aided Verification </i>, Paris, France, 2023, vol. 13964, pp. 156–169.","ama":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. In: <i>35th International Conference on Computer Aided Verification </i>. Vol 13964. Springer Nature; 2023:156-169. doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">10.1007/978-3-031-37706-8_8</a>","mla":"Koval, Nikita, et al. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” <i>35th International Conference on Computer Aided Verification </i>, vol. 13964, Springer Nature, 2023, pp. 156–69, doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">10.1007/978-3-031-37706-8_8</a>.","ista":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck: A practical framework for testing concurrent data structures on JVM. 35th International Conference on Computer Aided Verification . CAV: Computer Aided Verification, LNCS, vol. 13964, 156–169."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"name":"CAV: Computer Aided Verification","end_date":"2023-07-22","location":"Paris, France","start_date":"2023-07-17"},"type":"conference","alternative_title":["LNCS"],"file":[{"file_name":"2023_LNCS_Koval.pdf","date_created":"2023-09-06T08:16:25Z","access_level":"open_access","creator":"dernst","success":1,"date_updated":"2023-09-06T08:16:25Z","file_id":"14275","file_size":421408,"checksum":"c346016393123a0a2338ad4d976f61bc","relation":"main_file","content_type":"application/pdf"}]},{"publication":"Journal of Physical Chemistry Letters","citation":{"apa":"Gamper, J., Kluibenschedl, F., Weiss, A. K. H., &#38; 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. <i>Journal of Physical Chemistry Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.jpclett.3c01707\">https://doi.org/10.1021/acs.jpclett.3c01707</a>","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.” <i>Journal of Physical Chemistry Letters</i>. American Chemical Society, 2023. <a href=\"https://doi.org/10.1021/acs.jpclett.3c01707\">https://doi.org/10.1021/acs.jpclett.3c01707</a>.","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,” <i>Journal of Physical Chemistry Letters</i>, vol. 14, no. 33. American Chemical Society, pp. 7395–7403, 2023.","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. <i>Journal of Physical Chemistry Letters</i>. 2023;14(33):7395-7403. doi:<a href=\"https://doi.org/10.1021/acs.jpclett.3c01707\">10.1021/acs.jpclett.3c01707</a>","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.” <i>Journal of Physical Chemistry Letters</i>, vol. 14, no. 33, American Chemical Society, 2023, pp. 7395–403, doi:<a href=\"https://doi.org/10.1021/acs.jpclett.3c01707\">10.1021/acs.jpclett.3c01707</a>.","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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","pmid":1,"acknowledgement":"Financial supports for this work via a PhD scholarship for J. Gamper issued by the Leopold-Franzens-University of Innsbruck (Vicerector Prof. Dr Ulrike Tanzer) are gratefully acknowledged. The computational results presented have been achieved (in part) using the HPC infrastructure of the University of Innsbruck.","type":"journal_article","file":[{"file_id":"14272","file_size":4986859,"checksum":"637454e2b3a357498d8d622d241c4bf6","relation":"main_file","content_type":"application/pdf","file_name":"2023_JourPhysChemistry_Gamper.pdf","date_created":"2023-09-06T07:32:39Z","access_level":"open_access","creator":"dernst","success":1,"date_updated":"2023-09-06T07:32:39Z"}],"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"}],"quality_controlled":"1","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","publication_status":"published","date_updated":"2023-09-06T11:04:31Z","date_published":"2023-08-11T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"external_id":{"isi":["001048165800001"],"pmid":["37566743"]},"publication_identifier":{"eissn":["1948-7185"]},"page":"7395-7403","year":"2023","language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","department":[{"_id":"GradSch"}],"publisher":"American Chemical Society","article_type":"original","day":"11","issue":"33","author":[{"first_name":"Jakob","full_name":"Gamper, Jakob","last_name":"Gamper"},{"id":"7499e70e-eb2c-11ec-b98b-f925648bc9d9","first_name":"Florian","full_name":"Kluibenschedl, Florian","last_name":"Kluibenschedl"},{"first_name":"Alexander K.H.","full_name":"Weiss, Alexander K.H.","last_name":"Weiss"},{"full_name":"Hofer, Thomas S.","last_name":"Hofer","first_name":"Thomas S."}],"volume":14,"date_created":"2023-09-03T22:01:16Z","doi":"10.1021/acs.jpclett.3c01707","scopus_import":"1","intvolume":"        14","_id":"14261","file_date_updated":"2023-09-06T07:32:39Z","ddc":["530","540"],"oa_version":"Published Version","status":"public","oa":1,"month":"08"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Boocock, D. R., Hirashima, T., &#38; Hannezo, E. B. (2023). Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers. <i>PRX Life</i>. American Physical Society. <a href=\"https://doi.org/10.1103/prxlife.1.013001\">https://doi.org/10.1103/prxlife.1.013001</a>","chicago":"Boocock, Daniel R, Tsuyoshi Hirashima, and Edouard B Hannezo. “Interplay between Mechanochemical Patterning and Glassy Dynamics in Cellular Monolayers.” <i>PRX Life</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/prxlife.1.013001\">https://doi.org/10.1103/prxlife.1.013001</a>.","short":"D.R. Boocock, T. Hirashima, E.B. Hannezo, PRX Life 1 (2023).","ama":"Boocock DR, Hirashima T, Hannezo EB. Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers. <i>PRX Life</i>. 2023;1(1). doi:<a href=\"https://doi.org/10.1103/prxlife.1.013001\">10.1103/prxlife.1.013001</a>","ieee":"D. R. Boocock, T. Hirashima, and E. B. Hannezo, “Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers,” <i>PRX Life</i>, vol. 1, no. 1. American Physical Society, 2023.","mla":"Boocock, Daniel R., et al. “Interplay between Mechanochemical Patterning and Glassy Dynamics in Cellular Monolayers.” <i>PRX Life</i>, vol. 1, no. 1, 013001, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/prxlife.1.013001\">10.1103/prxlife.1.013001</a>.","ista":"Boocock DR, Hirashima T, Hannezo EB. 2023. Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers. PRX Life. 1(1), 013001."},"publication":"PRX Life","file":[{"file_size":2559520,"file_id":"14335","relation":"main_file","content_type":"application/pdf","checksum":"f881d98c89eb9f1aa136d7b781511553","file_name":"2023_PRXLife_Boocock.pdf","date_created":"2023-09-15T06:30:50Z","success":1,"date_updated":"2023-09-15T06:30:50Z","access_level":"open_access","creator":"dernst"}],"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.","type":"journal_article","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_published":"2023-07-20T00:00:00Z","date_updated":"2025-04-14T07:52:27Z","publication_status":"published","project":[{"call_identifier":"H2020","_id":"05943252-7A3F-11EA-A408-12923DDC885E","name":"Design Principles of Branching Morphogenesis","grant_number":"851288"}],"title":"Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers","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"}],"quality_controlled":"1","publication_identifier":{"issn":["2835-8279"]},"corr_author":"1","ec_funded":1,"language":[{"iso":"eng"}],"year":"2023","issue":"1","day":"20","publisher":"American Physical Society","article_type":"original","department":[{"_id":"EdHa"}],"has_accepted_license":"1","article_processing_charge":"Yes","intvolume":"         1","doi":"10.1103/prxlife.1.013001","date_created":"2023-09-06T08:30:59Z","volume":1,"author":[{"first_name":"Daniel R","id":"453AF628-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1585-2631","full_name":"Boocock, Daniel R","last_name":"Boocock"},{"full_name":"Hirashima, Tsuyoshi","last_name":"Hirashima","first_name":"Tsuyoshi"},{"last_name":"Hannezo","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B"}],"month":"07","oa":1,"article_number":"013001","oa_version":"Published Version","status":"public","ddc":["570"],"_id":"14277","file_date_updated":"2023-09-15T06:30:50Z"},{"publisher":"Zenodo","day":"11","article_processing_charge":"No","type":"research_data_reference","has_accepted_license":"1","department":[{"_id":"EdHa"}],"citation":{"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.","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:<a href=\"https://doi.org/10.5281/ZENODO.8133960\">10.5281/ZENODO.8133960</a>","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, <a href=\"https://doi.org/10.5281/ZENODO.8133960\">10.5281/ZENODO.8133960</a>.","mla":"Ucar, Mehmet C. <i>Source Data for the Manuscript “CCR7 Acts as Both a Sensor and a Sink for CCL19 to Coordinate Collective Leukocyte Migration.”</i> Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8133960\">10.5281/ZENODO.8133960</a>.","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. <a href=\"https://doi.org/10.5281/ZENODO.8133960\">https://doi.org/10.5281/ZENODO.8133960</a>.","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. <a href=\"https://doi.org/10.5281/ZENODO.8133960\">https://doi.org/10.5281/ZENODO.8133960</a>","short":"M.C. Ucar, (2023)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","corr_author":"1","oa":1,"month":"07","_id":"14279","ddc":["570"],"status":"public","oa_version":"Published Version","doi":"10.5281/ZENODO.8133960","title":"Source data for the manuscript \"CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration\"","date_updated":"2025-04-15T06:54:33Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_published":"2023-07-11T00:00:00Z","author":[{"id":"50B2A802-6007-11E9-A42B-EB23E6697425","first_name":"Mehmet C","last_name":"Ucar","full_name":"Ucar, Mehmet C","orcid":"0000-0003-0506-4217"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.8133960"}],"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"}],"related_material":{"record":[{"id":"14274","relation":"used_in_publication","status":"public"}]},"date_created":"2023-09-06T08:39:25Z"},{"year":"2023","language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"article_processing_charge":"No","has_accepted_license":"1","day":"01","issue":"10","article_type":"review","publisher":"Elsevier","volume":75,"date_created":"2023-09-10T22:01:11Z","author":[{"full_name":"Fiedler, Lukas","last_name":"Fiedler","id":"7c417475-8972-11ed-ae7b-8b674ca26986","first_name":"Lukas"},{"last_name":"Friml","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří"}],"intvolume":"        75","doi":"10.1016/j.pbi.2023.102443","scopus_import":"1","article_number":"102443","_id":"14313","ddc":["580"],"file_date_updated":"2023-11-02T17:03:20Z","status":"public","oa_version":"Submitted Version","month":"10","oa":1,"publication":"Current Opinion in Plant Biology","pmid":1,"citation":{"chicago":"Fiedler, Lukas, and Jiří Friml. “Rapid Auxin Signaling: Unknowns Old and New.” <i>Current Opinion in Plant Biology</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.pbi.2023.102443\">https://doi.org/10.1016/j.pbi.2023.102443</a>.","apa":"Fiedler, L., &#38; Friml, J. (2023). Rapid auxin signaling: Unknowns old and new. <i>Current Opinion in Plant Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.pbi.2023.102443\">https://doi.org/10.1016/j.pbi.2023.102443</a>","short":"L. Fiedler, J. Friml, Current Opinion in Plant Biology 75 (2023).","ieee":"L. Fiedler and J. Friml, “Rapid auxin signaling: Unknowns old and new,” <i>Current Opinion in Plant Biology</i>, vol. 75, no. 10. Elsevier, 2023.","ama":"Fiedler L, Friml J. Rapid auxin signaling: Unknowns old and new. <i>Current Opinion in Plant Biology</i>. 2023;75(10). doi:<a href=\"https://doi.org/10.1016/j.pbi.2023.102443\">10.1016/j.pbi.2023.102443</a>","mla":"Fiedler, Lukas, and Jiří Friml. “Rapid Auxin Signaling: Unknowns Old and New.” <i>Current Opinion in Plant Biology</i>, vol. 75, no. 10, 102443, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.pbi.2023.102443\">10.1016/j.pbi.2023.102443</a>.","ista":"Fiedler L, Friml J. 2023. Rapid auxin signaling: Unknowns old and new. Current Opinion in Plant Biology. 75(10), 102443."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","acknowledgement":"The opening quote is not intended to reflect any political views of the authors. The authors by no means endorse the rhetoric of Donald Rumsfeld or the 2003 invasion of Iraq by the United States. Nevertheless, Rumsfeld's quote led to both public and academic debates on the concept of known and unknown unknowns, which can be applied to the recent unexpected developments in the auxin signaling field. We thank Linlin Qi and Huihuang Chen for their suggestions on figure presentation and inspiring discussions of TIR1/AFB signaling. Finally, we thank Aroosa Hussain for discussion of Greek mythology.","file":[{"access_level":"open_access","creator":"amally","date_updated":"2023-11-02T17:03:20Z","success":1,"file_name":"Fiedler CurrOpinOlantBiol 2023_revised.pdf","date_created":"2023-11-02T17:03:20Z","checksum":"1c476c3414d2dfb0c85db0cb6cfd8a28","relation":"main_file","content_type":"application/pdf","file_size":737872,"file_id":"14482"}],"quality_controlled":"1","abstract":[{"text":"To respond to auxin, the chief orchestrator of their multicellularity, plants evolved multiple receptor systems and signal transduction cascades. Despite decades of research, however, we are still lacking a satisfactory synthesis of various auxin signaling mechanisms. The chief discrepancy and historical controversy of the field is that of rapid and slow auxin effects on plant physiology and development. How is it possible that ions begin to trickle across the plasma membrane as soon as auxin enters the cell, even though the best-characterized transcriptional auxin pathway can take effect only after tens of minutes? Recently, unexpected progress has been made in understanding this and other unknowns of auxin signaling. We provide a perspective on these exciting developments and concepts whose general applicability might have ramifications beyond auxin signaling.","lang":"eng"}],"date_published":"2023-10-01T00:00:00Z","isi":1,"external_id":{"pmid":["37666097"],"isi":["001080095300001"]},"publication_status":"published","title":"Rapid auxin signaling: Unknowns old and new","date_updated":"2025-09-09T12:54:16Z","corr_author":"1","publication_identifier":{"issn":["1369-5266"]}},{"oa":1,"month":"09","_id":"14314","file_date_updated":"2023-09-15T07:12:46Z","ddc":["570"],"oa_version":"Published Version","status":"public","article_number":"113015","doi":"10.1016/j.celrep.2023.113015","scopus_import":"1","intvolume":"        42","author":[{"first_name":"Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8849-6570","full_name":"Nardin, Michele","last_name":"Nardin"},{"first_name":"Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","full_name":"Käfer, Karola","last_name":"Käfer"},{"orcid":"0000-0001-9439-3148","full_name":"Stella, Federico","last_name":"Stella","first_name":"Federico","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari","orcid":"0000-0002-5193-4036"}],"volume":42,"date_created":"2023-09-10T22:01:11Z","article_type":"original","publisher":"Elsevier","day":"26","issue":"9","article_processing_charge":"Yes","has_accepted_license":"1","department":[{"_id":"JoCs"}],"year":"2023","language":[{"iso":"eng"}],"corr_author":"1","publication_identifier":{"eissn":["2211-1247"]},"ec_funded":1,"project":[{"grant_number":"607616","name":"inter-and intracellular signalling in schizophrenia","_id":"257BBB4C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"title":"Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions","publication_status":"published","date_updated":"2025-09-09T12:53:32Z","date_published":"2023-09-26T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["37632747"],"isi":["001068779200001"]},"isi":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"The execution of cognitive functions requires coordinated circuit activity across different brain areas that involves the associated firing of neuronal assemblies. Here, we tested the circuit mechanism behind assembly interactions between the hippocampus and the medial prefrontal cortex (mPFC) of adult rats by recording neuronal populations during a rule-switching task. We identified functionally coupled CA1-mPFC cells that synchronized their activity beyond that expected from common spatial coding or oscillatory firing. When such cell pairs fired together, the mPFC cell strongly phase locked to CA1 theta oscillations and maintained consistent theta firing phases, independent of the theta timing of their CA1 counterpart. These functionally connected CA1-mPFC cells formed interconnected assemblies. While firing together with their CA1 assembly partners, mPFC cells fired along specific theta sequences. Our results suggest that upregulated theta oscillatory firing of mPFC cells can signal transient interactions with specific CA1 assemblies, thus enabling distributed computations."}],"file":[{"relation":"main_file","content_type":"application/pdf","checksum":"ca77a304fb813c292550b8604b0fb41d","file_size":4879455,"file_id":"14337","date_updated":"2023-09-15T07:12:46Z","success":1,"creator":"dernst","access_level":"open_access","file_name":"2023_CellPress_Nardin.pdf","date_created":"2023-09-15T07:12:46Z"}],"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).","type":"journal_article","citation":{"apa":"Nardin, M., Käfer, K., Stella, F., &#38; Csicsvari, J. L. (2023). Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions. <i>Cell Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.celrep.2023.113015\">https://doi.org/10.1016/j.celrep.2023.113015</a>","chicago":"Nardin, Michele, Karola Käfer, Federico Stella, and Jozsef L Csicsvari. “Theta Oscillations as a Substrate for Medial Prefrontal-Hippocampal Assembly Interactions.” <i>Cell Reports</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.celrep.2023.113015\">https://doi.org/10.1016/j.celrep.2023.113015</a>.","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,” <i>Cell Reports</i>, vol. 42, no. 9. Elsevier, 2023.","ama":"Nardin M, Käfer K, Stella F, Csicsvari JL. Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions. <i>Cell Reports</i>. 2023;42(9). doi:<a href=\"https://doi.org/10.1016/j.celrep.2023.113015\">10.1016/j.celrep.2023.113015</a>","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.","mla":"Nardin, Michele, et al. “Theta Oscillations as a Substrate for Medial Prefrontal-Hippocampal Assembly Interactions.” <i>Cell Reports</i>, vol. 42, no. 9, 113015, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.celrep.2023.113015\">10.1016/j.celrep.2023.113015</a>."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pmid":1,"publication":"Cell Reports"},{"publication_identifier":{"eissn":["2050-084X"]},"corr_author":"1","quality_controlled":"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"}],"date_updated":"2024-10-09T21:06:57Z","publication_status":"published","title":"Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress","date_published":"2023-09-04T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["37665327"]},"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.","type":"journal_article","file":[{"file_id":"14336","file_size":3703097,"checksum":"db24bf3d595507387b48d3799c33e289","content_type":"application/pdf","relation":"main_file","date_created":"2023-09-15T06:59:10Z","file_name":"2023_eLife_Cho.pdf","creator":"dernst","access_level":"open_access","success":1,"date_updated":"2023-09-15T06:59:10Z"}],"publication":"eLife","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Cho, Ukrae H., and Martin Hetzer. “Caspase-Mediated Nuclear Pore Complex Trimming in Cell Differentiation and Endoplasmic Reticulum Stress.” <i>ELife</i>. eLife Sciences Publications, 2023. <a href=\"https://doi.org/10.7554/eLife.89066\">https://doi.org/10.7554/eLife.89066</a>.","apa":"Cho, U. H., &#38; Hetzer, M. (2023). Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.89066\">https://doi.org/10.7554/eLife.89066</a>","short":"U.H. Cho, M. Hetzer, ELife 12 (2023).","ieee":"U. H. Cho and M. Hetzer, “Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress,” <i>eLife</i>, vol. 12. eLife Sciences Publications, 2023.","ama":"Cho UH, Hetzer M. Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress. <i>eLife</i>. 2023;12. doi:<a href=\"https://doi.org/10.7554/eLife.89066\">10.7554/eLife.89066</a>","ista":"Cho UH, Hetzer M. 2023. Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress. eLife. 12, RP89066.","mla":"Cho, Ukrae H., and Martin Hetzer. “Caspase-Mediated Nuclear Pore Complex Trimming in Cell Differentiation and Endoplasmic Reticulum Stress.” <i>ELife</i>, vol. 12, RP89066, eLife Sciences Publications, 2023, doi:<a href=\"https://doi.org/10.7554/eLife.89066\">10.7554/eLife.89066</a>."},"pmid":1,"status":"public","oa_version":"Published Version","_id":"14315","file_date_updated":"2023-09-15T06:59:10Z","ddc":["570"],"article_number":"RP89066","oa":1,"month":"09","author":[{"first_name":"Ukrae H.","full_name":"Cho, Ukrae H.","last_name":"Cho"},{"orcid":"0000-0002-2111-992X","full_name":"Hetzer, Martin W","last_name":"Hetzer","first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"date_created":"2023-09-10T22:01:11Z","volume":12,"scopus_import":"1","doi":"10.7554/eLife.89066","intvolume":"        12","has_accepted_license":"1","article_processing_charge":"Yes","department":[{"_id":"MaHe"}],"article_type":"original","publisher":"eLife Sciences Publications","day":"04","language":[{"iso":"eng"}],"year":"2023"},{"publication_status":"published","title":"Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway","date_updated":"2025-09-09T12:56:46Z","external_id":{"pmid":["37539494"],"isi":["001112832300005"]},"date_published":"2023-09-01T00:00:00Z","isi":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."}],"quality_controlled":"1","publication_identifier":{"issn":["0021-9533"],"eissn":["1477-9137"]},"citation":{"short":"M. Nagano, K. Aoshima, H. Shimamura, D.E. Siekhaus, J.Y. Toshima, J. Toshima, Journal of Cell Science 136 (2023).","apa":"Nagano, M., Aoshima, K., Shimamura, H., Siekhaus, D. E., Toshima, J. Y., &#38; Toshima, J. (2023). Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway. <i>Journal of Cell Science</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.261448\">https://doi.org/10.1242/jcs.261448</a>","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.” <i>Journal of Cell Science</i>. The Company of Biologists, 2023. <a href=\"https://doi.org/10.1242/jcs.261448\">https://doi.org/10.1242/jcs.261448</a>.","mla":"Nagano, Makoto, et al. “Distinct Role of TGN-Resident Clathrin Adaptors for Vps21p Activation in the TGN-Endosome Trafficking Pathway.” <i>Journal of Cell Science</i>, vol. 136, no. 17, jcs261448, The Company of Biologists, 2023, doi:<a href=\"https://doi.org/10.1242/jcs.261448\">10.1242/jcs.261448</a>.","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.","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,” <i>Journal of Cell Science</i>, vol. 136, no. 17. The Company of Biologists, 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. <i>Journal of Cell Science</i>. 2023;136(17). doi:<a href=\"https://doi.org/10.1242/jcs.261448\">10.1242/jcs.261448</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pmid":1,"publication":"Journal of Cell Science","type":"journal_article","doi":"10.1242/jcs.261448","scopus_import":"1","intvolume":"       136","author":[{"first_name":"Makoto","last_name":"Nagano","full_name":"Nagano, Makoto"},{"last_name":"Aoshima","full_name":"Aoshima, Kaito","first_name":"Kaito"},{"last_name":"Shimamura","full_name":"Shimamura, Hiroki","first_name":"Hiroki"},{"id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","full_name":"Siekhaus, Daria E","last_name":"Siekhaus","orcid":"0000-0001-8323-8353"},{"full_name":"Toshima, Junko Y.","last_name":"Toshima","first_name":"Junko Y."},{"last_name":"Toshima","full_name":"Toshima, Jiro","first_name":"Jiro"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2023.03.27.534325"}],"volume":136,"date_created":"2023-09-10T22:01:12Z","oa":1,"month":"09","_id":"14316","status":"public","oa_version":"Preprint","article_number":"jcs261448","year":"2023","language":[{"iso":"eng"}],"article_type":"original","publisher":"The Company of Biologists","issue":"17","day":"01","article_processing_charge":"No","department":[{"_id":"DaSi"}]},{"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031377082"]},"ec_funded":1,"date_published":"2023-07-17T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["001310805600005"]},"isi":1,"publication_status":"published","project":[{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"title":"MDPs as distribution transformers: Affine invariant synthesis for safety objectives","date_updated":"2025-09-09T12:56:00Z","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."}],"quality_controlled":"1","alternative_title":["LNCS"],"file":[{"file_size":531745,"file_id":"14349","relation":"main_file","content_type":"application/pdf","checksum":"f143c8eedf609f20f2aad2eeb496d53f","file_name":"2023_LNCS_Akshay.pdf","date_created":"2023-09-20T08:46:43Z","date_updated":"2023-09-20T08:46:43Z","success":1,"creator":"dernst","access_level":"open_access"}],"conference":{"name":"CAV: Computer Aided Verification","end_date":"2023-07-22","location":"Paris, France","start_date":"2023-07-17"},"type":"conference","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.","citation":{"ama":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In: <i>International Conference on Computer Aided Verification</i>. Vol 13966. Springer Nature; 2023:86-112. doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_5\">10.1007/978-3-031-37709-9_5</a>","ieee":"S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “MDPs as distribution transformers: Affine invariant synthesis for safety objectives,” in <i>International Conference on Computer Aided Verification</i>, Paris, France, 2023, vol. 13966, pp. 86–112.","mla":"Akshay, S., et al. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” <i>International Conference on Computer Aided Verification</i>, vol. 13966, Springer Nature, 2023, pp. 86–112, doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_5\">10.1007/978-3-031-37709-9_5</a>.","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.","apa":"Akshay, S., Chatterjee, K., Meggendorfer, T., &#38; Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In <i>International Conference on Computer Aided Verification</i> (Vol. 13966, pp. 86–112). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_5\">https://doi.org/10.1007/978-3-031-37709-9_5</a>","chicago":"Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” In <i>International Conference on Computer Aided Verification</i>, 13966:86–112. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_5\">https://doi.org/10.1007/978-3-031-37709-9_5</a>.","short":"S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 86–112."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"International Conference on Computer Aided Verification","month":"07","oa":1,"_id":"14317","file_date_updated":"2023-09-20T08:46:43Z","ddc":["000"],"status":"public","oa_version":"Published Version","intvolume":"     13966","doi":"10.1007/978-3-031-37709-9_5","scopus_import":"1","volume":13966,"date_created":"2023-09-10T22:01:12Z","author":[{"last_name":"Akshay","full_name":"Akshay, S.","first_name":"S."},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"day":"17","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","year":"2023","language":[{"iso":"eng"}],"page":"86-112"},{"alternative_title":["LNCS"],"file":[{"content_type":"application/pdf","relation":"main_file","checksum":"42917e086f8c7699f3bccf84f74fe000","file_size":624647,"file_id":"14348","date_updated":"2023-09-20T08:24:47Z","success":1,"creator":"dernst","access_level":"open_access","date_created":"2023-09-20T08:24:47Z","file_name":"2023_LNCS_Sun.pdf"}],"conference":{"name":"CAV: Computer Aided Verification","location":"Paris, France","start_date":"2023-07-17","end_date":"2023-07-22"},"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.","type":"conference","citation":{"ista":"Sun Y, Fu H, Chatterjee K, Goharshady AK. 2023. Automated tail bound analysis for probabilistic recurrence relations. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 16–39.","mla":"Sun, Yican, et al. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” <i>Computer Aided Verification</i>, vol. 13966, Springer Nature, 2023, pp. 16–39, doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_2\">10.1007/978-3-031-37709-9_2</a>.","ieee":"Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Automated tail bound analysis for probabilistic recurrence relations,” in <i>Computer Aided Verification</i>, Paris, France, 2023, vol. 13966, pp. 16–39.","ama":"Sun Y, Fu H, Chatterjee K, Goharshady AK. Automated tail bound analysis for probabilistic recurrence relations. In: <i>Computer Aided Verification</i>. Vol 13966. Springer Nature; 2023:16-39. doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_2\">10.1007/978-3-031-37709-9_2</a>","short":"Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Computer Aided Verification, Springer Nature, 2023, pp. 16–39.","apa":"Sun, Y., Fu, H., Chatterjee, K., &#38; Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In <i>Computer Aided Verification</i> (Vol. 13966, pp. 16–39). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_2\">https://doi.org/10.1007/978-3-031-37709-9_2</a>","chicago":"Sun, Yican, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” In <i>Computer Aided Verification</i>, 13966:16–39. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_2\">https://doi.org/10.1007/978-3-031-37709-9_2</a>."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Computer Aided Verification","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031377082"]},"ec_funded":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["001310805600002"]},"isi":1,"date_published":"2023-07-17T00:00:00Z","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"}],"title":"Automated tail bound analysis for probabilistic recurrence relations","publication_status":"published","date_updated":"2025-09-09T12:55:28Z","quality_controlled":"1","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"}],"day":"17","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","year":"2023","language":[{"iso":"eng"}],"page":"16-39","month":"07","oa":1,"_id":"14318","file_date_updated":"2023-09-20T08:24:47Z","ddc":["000"],"status":"public","oa_version":"Published Version","intvolume":"     13966","doi":"10.1007/978-3-031-37709-9_2","scopus_import":"1","volume":13966,"related_material":{"link":[{"relation":"software","url":"https://github.com/boyvolcano/PRR"}]},"date_created":"2023-09-10T22:01:12Z","author":[{"first_name":"Yican","full_name":"Sun, Yican","last_name":"Sun"},{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar"}]},{"department":[{"_id":"MaKw"}],"article_processing_charge":"Yes","has_accepted_license":"1","issue":"3","day":"28","publisher":"Electronic Journal of Combinatorics","article_type":"original","license":"https://creativecommons.org/licenses/by-nd/4.0/","year":"2023","language":[{"iso":"eng"}],"article_number":"P3.10","_id":"14319","file_date_updated":"2023-09-15T08:02:09Z","ddc":["510"],"oa_version":"Published Version","status":"public","month":"07","oa":1,"volume":30,"date_created":"2023-09-10T22:01:12Z","author":[{"full_name":"Anastos, Michael","last_name":"Anastos","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","first_name":"Michael"},{"first_name":"David","last_name":"Fabian","full_name":"Fabian, David"},{"full_name":"Müyesser, Alp","last_name":"Müyesser","first_name":"Alp"},{"first_name":"Tibor","last_name":"Szabó","full_name":"Szabó, Tibor"}],"intvolume":"        30","doi":"10.37236/11714","scopus_import":"1","type":"journal_article","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).","file":[{"access_level":"open_access","creator":"dernst","success":1,"date_updated":"2023-09-15T08:02:09Z","file_name":"2023_elecJournCombinatorics_Anastos.pdf","date_created":"2023-09-15T08:02:09Z","checksum":"52c46c8cb329f9aaee9ade01525f317b","relation":"main_file","content_type":"application/pdf","file_size":247917,"file_id":"14338"}],"publication":"Electronic Journal of Combinatorics","citation":{"chicago":"Anastos, Michael, David Fabian, Alp Müyesser, and Tibor Szabó. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2023. <a href=\"https://doi.org/10.37236/11714\">https://doi.org/10.37236/11714</a>.","apa":"Anastos, M., Fabian, D., Müyesser, A., &#38; Szabó, T. (2023). Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/11714\">https://doi.org/10.37236/11714</a>","short":"M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023).","ama":"Anastos M, Fabian D, Müyesser A, Szabó T. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. <i>Electronic Journal of Combinatorics</i>. 2023;30(3). doi:<a href=\"https://doi.org/10.37236/11714\">10.37236/11714</a>","ieee":"M. Anastos, D. Fabian, A. Müyesser, and T. Szabó, “Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets,” <i>Electronic Journal of Combinatorics</i>, vol. 30, no. 3. Electronic Journal of Combinatorics, 2023.","ista":"Anastos M, Fabian D, Müyesser A, Szabó T. 2023. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 30(3), P3.10.","mla":"Anastos, Michael, et al. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” <i>Electronic Journal of Combinatorics</i>, vol. 30, no. 3, P3.10, Electronic Journal of Combinatorics, 2023, doi:<a href=\"https://doi.org/10.37236/11714\">10.37236/11714</a>."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"ec_funded":1,"publication_identifier":{"eissn":["1077-8926"]},"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"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png"},"external_id":{"arxiv":["2212.03100"],"isi":["001042382200001"]},"isi":1,"date_published":"2023-07-28T00:00:00Z","title":"Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets","project":[{"grant_number":"101034413","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program"}],"publication_status":"published","date_updated":"2025-09-09T12:54:51Z"},{"type":"journal_article","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.","publication":"Physical Review B","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"P.M. Henderson, A. Ghazaryan, A.A. Zibrov, A.F. Young, M. Serbyn, Physical Review B 108 (2023).","apa":"Henderson, P. M., Ghazaryan, A., Zibrov, A. A., Young, A. F., &#38; Serbyn, M. (2023). Deep learning extraction of band structure parameters from density of states: A case study on trilayer graphene. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.108.125411\">https://doi.org/10.1103/physrevb.108.125411</a>","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.” <i>Physical Review B</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/physrevb.108.125411\">https://doi.org/10.1103/physrevb.108.125411</a>.","mla":"Henderson, Paul M., et al. “Deep Learning Extraction of Band Structure Parameters from Density of States: A Case Study on Trilayer Graphene.” <i>Physical Review B</i>, vol. 108, no. 12, 125411, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/physrevb.108.125411\">10.1103/physrevb.108.125411</a>.","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.","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. <i>Physical Review B</i>. 2023;108(12). doi:<a href=\"https://doi.org/10.1103/physrevb.108.125411\">10.1103/physrevb.108.125411</a>","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,” <i>Physical Review B</i>, vol. 108, no. 12. American Physical Society, 2023."},"arxiv":1,"publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"quality_controlled":"1","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"}],"date_published":"2023-09-15T00:00:00Z","external_id":{"arxiv":["2210.06310"]},"date_updated":"2023-09-20T09:38:24Z","title":"Deep learning extraction of band structure parameters from density of states: A case study on trilayer graphene","publication_status":"published","department":[{"_id":"MaSe"},{"_id":"ChLa"},{"_id":"MiLe"}],"article_processing_charge":"No","day":"15","issue":"12","article_type":"original","publisher":"American Physical Society","language":[{"iso":"eng"}],"year":"2023","article_number":"125411","oa_version":"Preprint","status":"public","_id":"14320","month":"09","oa":1,"date_created":"2023-09-12T07:12:12Z","volume":108,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2210.06310"}],"author":[{"first_name":"Paul M","id":"13C09E74-18D9-11E9-8878-32CFE5697425","orcid":"0000-0002-5198-7445","full_name":"Henderson, Paul M","last_name":"Henderson"},{"orcid":"0000-0001-9666-3543","last_name":"Ghazaryan","full_name":"Ghazaryan, Areg","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexander A.","full_name":"Zibrov, Alexander A.","last_name":"Zibrov"},{"last_name":"Young","full_name":"Young, Andrea F.","first_name":"Andrea F."},{"orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","last_name":"Serbyn","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"       108","scopus_import":"1","doi":"10.1103/physrevb.108.125411"},{"language":[{"iso":"eng"}],"year":"2023","keyword":["Physical and Theoretical Chemistry","General Physics and Astronomy"],"issue":"10","day":"11","publisher":"AIP Publishing","article_type":"original","department":[{"_id":"MiLe"}],"has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","intvolume":"       159","scopus_import":"1","doi":"10.1063/5.0165806","date_created":"2023-09-13T09:25:09Z","volume":159,"author":[{"first_name":"Ragheed","id":"d1c405be-ae15-11ed-8510-ccf53278162e","full_name":"Al Hyder, Ragheed","last_name":"Al Hyder"},{"full_name":"Cappellaro, Alberto","last_name":"Cappellaro","orcid":"0000-0001-6110-2359","id":"9d13b3cb-30a2-11eb-80dc-f772505e8660","first_name":"Alberto"},{"last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"},{"full_name":"Volosniev, Artem","last_name":"Volosniev","orcid":"0000-0003-0393-5525","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem"}],"month":"09","oa":1,"article_number":"104103","oa_version":"Published Version","status":"public","_id":"14321","ddc":["530"],"file_date_updated":"2023-09-13T09:34:20Z","pmid":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Al Hyder, R., Cappellaro, A., Lemeshko, M., &#38; Volosniev, A. (2023). Achiral dipoles on a ferromagnet can affect its magnetization direction. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0165806\">https://doi.org/10.1063/5.0165806</a>","chicago":"Al Hyder, Ragheed, Alberto Cappellaro, Mikhail Lemeshko, and Artem Volosniev. “Achiral Dipoles on a Ferromagnet Can Affect Its Magnetization Direction.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2023. <a href=\"https://doi.org/10.1063/5.0165806\">https://doi.org/10.1063/5.0165806</a>.","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,” <i>The Journal of Chemical Physics</i>, vol. 159, no. 10. AIP Publishing, 2023.","ama":"Al Hyder R, Cappellaro A, Lemeshko M, Volosniev A. Achiral dipoles on a ferromagnet can affect its magnetization direction. <i>The Journal of Chemical Physics</i>. 2023;159(10). doi:<a href=\"https://doi.org/10.1063/5.0165806\">10.1063/5.0165806</a>","mla":"Al Hyder, Ragheed, et al. “Achiral Dipoles on a Ferromagnet Can Affect Its Magnetization Direction.” <i>The Journal of Chemical Physics</i>, vol. 159, no. 10, 104103, AIP Publishing, 2023, doi:<a href=\"https://doi.org/10.1063/5.0165806\">10.1063/5.0165806</a>.","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."},"publication":"The Journal of Chemical Physics","file":[{"date_updated":"2023-09-13T09:34:20Z","success":1,"access_level":"open_access","creator":"acappell","file_name":"104103_1_5.0165806.pdf","date_created":"2023-09-13T09:34:20Z","relation":"main_file","content_type":"application/pdf","checksum":"507ab65ab29e2c987c94cabad7c5370b","file_size":5749653,"file_id":"14322"}],"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.","type":"journal_article","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2306.17592"],"isi":["001133333600011"],"pmid":["37694742"]},"date_published":"2023-09-11T00:00:00Z","isi":1,"date_updated":"2025-09-09T12:57:42Z","title":"Achiral dipoles on a ferromagnet can affect its magnetization direction","project":[{"grant_number":"101062862","_id":"bd7b5202-d553-11ed-ba76-9b1c1b258338","name":"Non-Equilibrium Field Theory of Molecular Rotations"},{"grant_number":"801770","call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle"}],"publication_status":"published","quality_controlled":"1","abstract":[{"lang":"eng","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."}],"publication_identifier":{"eissn":["1089-7690"],"issn":["0021-9606"]},"corr_author":"1","ec_funded":1,"arxiv":1},{"year":"2023","language":[{"iso":"eng"}],"citation":{"ista":"Faller PM, Vankadara LC, Mastakouri AA, Locatello F, Janzing D. Self-compatibility: Evaluating causal discovery without ground truth. arXiv, 2307.09552.","mla":"Faller, Philipp M., et al. “Self-Compatibility: Evaluating Causal Discovery without Ground Truth.” <i>ArXiv</i>, 2307.09552, doi:<a href=\"https://doi.org/10.48550/arXiv.2307.09552\">10.48550/arXiv.2307.09552</a>.","ieee":"P. M. Faller, L. C. Vankadara, A. A. Mastakouri, F. Locatello, and D. Janzing, “Self-compatibility: Evaluating causal discovery without ground truth,” <i>arXiv</i>. .","ama":"Faller PM, Vankadara LC, Mastakouri AA, Locatello F, Janzing D. Self-compatibility: Evaluating causal discovery without ground truth. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2307.09552\">10.48550/arXiv.2307.09552</a>","short":"P.M. Faller, L.C. Vankadara, A.A. Mastakouri, F. Locatello, D. Janzing, ArXiv (n.d.).","chicago":"Faller, Philipp M., Leena Chennuru Vankadara, Atalanti A. Mastakouri, Francesco Locatello, and Dominik Janzing. “Self-Compatibility: Evaluating Causal Discovery without Ground Truth.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2307.09552\">https://doi.org/10.48550/arXiv.2307.09552</a>.","apa":"Faller, P. M., Vankadara, L. C., Mastakouri, A. A., Locatello, F., &#38; Janzing, D. (n.d.). Self-compatibility: Evaluating causal discovery without ground truth. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2307.09552\">https://doi.org/10.48550/arXiv.2307.09552</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"arXiv","day":"18","department":[{"_id":"FrLo"}],"article_processing_charge":"No","type":"preprint","external_id":{"arxiv":["2307.09552"]},"date_published":"2023-07-18T00:00:00Z","publication_status":"submitted","doi":"10.48550/arXiv.2307.09552","title":"Self-compatibility: Evaluating causal discovery without ground truth","extern":"1","date_updated":"2024-10-14T12:31:20Z","date_created":"2023-09-13T12:44:59Z","author":[{"first_name":"Philipp M.","last_name":"Faller","full_name":"Faller, Philipp M."},{"first_name":"Leena Chennuru","full_name":"Vankadara, Leena Chennuru","last_name":"Vankadara"},{"first_name":"Atalanti A.","full_name":"Mastakouri, Atalanti A.","last_name":"Mastakouri"},{"full_name":"Locatello, Francesco","last_name":"Locatello","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"last_name":"Janzing","full_name":"Janzing, Dominik","first_name":"Dominik"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2307.09552"}],"abstract":[{"lang":"eng","text":"As causal ground truth is incredibly rare, causal discovery algorithms are\r\ncommonly only evaluated on simulated data. This is concerning, given that\r\nsimulations reflect common preconceptions about generating processes regarding\r\nnoise distributions, model classes, and more. In this work, we propose a novel\r\nmethod for falsifying the output of a causal discovery algorithm in the absence\r\nof ground truth. Our key insight is that while statistical learning seeks\r\nstability across subsets of data points, causal learning should seek stability\r\nacross subsets of variables. Motivated by this insight, our method relies on a\r\nnotion of compatibility between causal graphs learned on different subsets of\r\nvariables. We prove that detecting incompatibilities can falsify wrongly\r\ninferred causal relations due to violation of assumptions or errors from finite\r\nsample effects. Although passing such compatibility tests is only a necessary\r\ncriterion for good performance, we argue that it provides strong evidence for\r\nthe causal models whenever compatibility entails strong implications for the\r\njoint distribution. We also demonstrate experimentally that detection of\r\nincompatibilities can aid in causal model selection."}],"month":"07","oa":1,"article_number":"2307.09552","arxiv":1,"_id":"14333","oa_version":"Preprint","status":"public"},{"arxiv":1,"ec_funded":1,"corr_author":"1","publication_identifier":{"issn":["2542-4653"]},"quality_controlled":"1","abstract":[{"lang":"eng","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."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_published":"2023-09-13T00:00:00Z","external_id":{"arxiv":["2210.15607"]},"project":[{"grant_number":"850899","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","call_identifier":"H2020"}],"title":"Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models","publication_status":"published","date_updated":"2025-04-14T07:52:05Z","type":"journal_article","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).","file":[{"success":1,"date_updated":"2023-09-20T10:46:10Z","creator":"dernst","access_level":"open_access","file_name":"2023_SciPostPhysics_Brighi.pdf","date_created":"2023-09-20T10:46:10Z","relation":"main_file","content_type":"application/pdf","checksum":"4cef6a8021f6b6c47ab2f2f2b1387ac2","file_size":4866506,"file_id":"14350"}],"publication":"SciPost Physics","citation":{"ieee":"P. Brighi, M. Ljubotina, and M. Serbyn, “Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models,” <i>SciPost Physics</i>, vol. 15, no. 3. SciPost Foundation, 2023.","ama":"Brighi P, Ljubotina M, Serbyn M. Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. <i>SciPost Physics</i>. 2023;15(3). doi:<a href=\"https://doi.org/10.21468/scipostphys.15.3.093\">10.21468/scipostphys.15.3.093</a>","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.” <i>SciPost Physics</i>, vol. 15, no. 3, 093, SciPost Foundation, 2023, doi:<a href=\"https://doi.org/10.21468/scipostphys.15.3.093\">10.21468/scipostphys.15.3.093</a>.","chicago":"Brighi, Pietro, Marko Ljubotina, and Maksym Serbyn. “Hilbert Space Fragmentation and Slow Dynamics in Particle-Conserving Quantum East Models.” <i>SciPost Physics</i>. SciPost Foundation, 2023. <a href=\"https://doi.org/10.21468/scipostphys.15.3.093\">https://doi.org/10.21468/scipostphys.15.3.093</a>.","apa":"Brighi, P., Ljubotina, M., &#38; Serbyn, M. (2023). Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. <i>SciPost Physics</i>. SciPost Foundation. <a href=\"https://doi.org/10.21468/scipostphys.15.3.093\">https://doi.org/10.21468/scipostphys.15.3.093</a>","short":"P. Brighi, M. Ljubotina, M. Serbyn, SciPost Physics 15 (2023)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"093","ddc":["530"],"_id":"14334","file_date_updated":"2023-09-20T10:46:10Z","oa_version":"Published Version","status":"public","month":"09","oa":1,"volume":15,"related_material":{"record":[{"id":"12750","relation":"earlier_version","status":"public"}]},"date_created":"2023-09-14T13:08:23Z","author":[{"first_name":"Pietro","id":"4115AF5C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7969-2729","last_name":"Brighi","full_name":"Brighi, Pietro"},{"id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko","full_name":"Ljubotina, Marko","last_name":"Ljubotina","orcid":"0000-0003-0038-7068"},{"full_name":"Serbyn, Maksym","last_name":"Serbyn","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym"}],"intvolume":"        15","doi":"10.21468/scipostphys.15.3.093","scopus_import":"1","department":[{"_id":"MaSe"}],"article_processing_charge":"No","has_accepted_license":"1","issue":"3","day":"13","article_type":"original","publisher":"SciPost Foundation","keyword":["General Physics and Astronomy"],"year":"2023","language":[{"iso":"eng"}]},{"date_updated":"2024-10-21T06:01:33Z","publication_status":"published","title":"Antigravitropic PIN polarization maintains non-vertical growth in lateral roots","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["001069238800014"],"pmid":["37666965"]},"date_published":"2023-09-01T00:00:00Z","quality_controlled":"1","abstract":[{"text":"Lateral roots are typically maintained at non-vertical angles with respect to gravity. These gravitropic setpoint angles are intriguing because their maintenance requires that roots are able to effect growth response both with and against the gravity vector, a phenomenon previously attributed to gravitropism acting against an antigravitropic offset mechanism. Here we show how the components mediating gravitropism in the vertical primary root—PINs and phosphatases acting upon them—are reconfigured in their regulation such that lateral root growth at a range of angles can be maintained. We show that the ability of Arabidopsis lateral roots to bend both downward and upward requires the generation of auxin asymmetries and is driven by angle-dependent variation in downward gravitropic auxin flux acting against angle-independent upward, antigravitropic flux. Further, we demonstrate a symmetry in auxin distribution in lateral roots at gravitropic setpoint angle that can be traced back to a net, balanced polarization of PIN3 and PIN7 auxin transporters in the columella. These auxin fluxes are shifted by altering PIN protein phosphoregulation in the columella, either by introducing PIN3 phosphovariant versions or via manipulation of levels of the phosphatase subunit PP2A/RCN1. Finally, we show that auxin, in addition to driving lateral root directional growth, acts within the lateral root columella to induce more vertical growth by increasing RCN1 levels, causing a downward shift in PIN3 localization, thereby diminishing the magnitude of the upward, antigravitropic auxin flux.","lang":"eng"}],"publication_identifier":{"issn":["2055-0278"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Roychoudhry, S., Sageman-Furnas, K., Wolverton, C., Grones, P., Tan, S., Molnar, G., … Kepinski, S. (2023). Antigravitropic PIN polarization maintains non-vertical growth in lateral roots. <i>Nature Plants</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41477-023-01478-x\">https://doi.org/10.1038/s41477-023-01478-x</a>","chicago":"Roychoudhry, S, K Sageman-Furnas, C Wolverton, Peter Grones, Shutang Tan, Gergely Molnar, M De Angelis, et al. “Antigravitropic PIN Polarization Maintains Non-Vertical Growth in Lateral Roots.” <i>Nature Plants</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41477-023-01478-x\">https://doi.org/10.1038/s41477-023-01478-x</a>.","short":"S. Roychoudhry, K. Sageman-Furnas, C. Wolverton, P. Grones, S. Tan, G. Molnar, M. De Angelis, H. Goodman, N. Capstaff, L. JPB, J. Mullen, R. Hangarter, J. Friml, S. Kepinski, Nature Plants 9 (2023) 1500–1513.","ieee":"S. Roychoudhry <i>et al.</i>, “Antigravitropic PIN polarization maintains non-vertical growth in lateral roots,” <i>Nature Plants</i>, vol. 9. Springer Nature, pp. 1500–1513, 2023.","ama":"Roychoudhry S, Sageman-Furnas K, Wolverton C, et al. Antigravitropic PIN polarization maintains non-vertical growth in lateral roots. <i>Nature Plants</i>. 2023;9:1500-1513. doi:<a href=\"https://doi.org/10.1038/s41477-023-01478-x\">10.1038/s41477-023-01478-x</a>","mla":"Roychoudhry, S., et al. “Antigravitropic PIN Polarization Maintains Non-Vertical Growth in Lateral Roots.” <i>Nature Plants</i>, vol. 9, Springer Nature, 2023, pp. 1500–13, doi:<a href=\"https://doi.org/10.1038/s41477-023-01478-x\">10.1038/s41477-023-01478-x</a>.","ista":"Roychoudhry S, Sageman-Furnas K, Wolverton C, Grones P, Tan S, Molnar G, De Angelis M, Goodman H, Capstaff N, JPB L, Mullen J, Hangarter R, Friml J, Kepinski S. 2023. Antigravitropic PIN polarization maintains non-vertical growth in lateral roots. Nature Plants. 9, 1500–1513."},"pmid":1,"publication":"Nature Plants","file":[{"success":1,"date_updated":"2023-09-20T10:51:31Z","access_level":"open_access","creator":"dernst","file_name":"2023_NaturePlants_Roychoudhry.pdf","date_created":"2023-09-20T10:51:31Z","relation":"main_file","content_type":"application/pdf","checksum":"3d6d5d5abb937c14a5f6f0afba3b8624","file_size":9647103,"file_id":"14351"}],"type":"journal_article","acknowledgement":"We thank D. Weijers, C. Schwechheimer and R. Offringa for generous sharing of published and unpublished materials and P. Masson for advice on the use of the ARL2 promoter. We are grateful to M. Del Bianco and O. Leyser for critical reading of the manuscript. This work was supported by the BBSRC (grants BB/N010124/1 and BB/R000859/1 to S.K.), the Gatsby Charitable Foundation and the Leverhulme Trust (RPG-2018-137 to S.K.).","scopus_import":"1","doi":"10.1038/s41477-023-01478-x","intvolume":"         9","author":[{"full_name":"Roychoudhry, S","last_name":"Roychoudhry","first_name":"S"},{"first_name":"K","full_name":"Sageman-Furnas, K","last_name":"Sageman-Furnas"},{"first_name":"C","full_name":"Wolverton, C","last_name":"Wolverton"},{"full_name":"Grones, Peter","last_name":"Grones","id":"399876EC-F248-11E8-B48F-1D18A9856A87","first_name":"Peter"},{"full_name":"Tan, Shutang","last_name":"Tan","orcid":"0000-0002-0471-8285","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","first_name":"Shutang"},{"first_name":"Gergely","id":"34F1AF46-F248-11E8-B48F-1D18A9856A87","full_name":"Molnar, Gergely","last_name":"Molnar"},{"first_name":"M","full_name":"De Angelis, M","last_name":"De Angelis"},{"full_name":"Goodman, HL","last_name":"Goodman","first_name":"HL"},{"first_name":"N","last_name":"Capstaff","full_name":"Capstaff, N"},{"last_name":"JPB","full_name":"JPB, Lloyd","first_name":"Lloyd"},{"first_name":"J","full_name":"Mullen, J","last_name":"Mullen"},{"full_name":"Hangarter, R","last_name":"Hangarter","first_name":"R"},{"first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jiří"},{"first_name":"S","full_name":"Kepinski, S","last_name":"Kepinski"}],"date_created":"2023-09-15T09:56:01Z","volume":9,"oa":1,"month":"09","status":"public","oa_version":"Published Version","_id":"14339","ddc":["580"],"file_date_updated":"2023-09-20T10:51:31Z","language":[{"iso":"eng"}],"year":"2023","page":"1500-1513","publisher":"Springer Nature","article_type":"original","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","department":[{"_id":"JiFr"}]},{"date_updated":"2025-09-09T12:59:04Z","title":"Turbulence suppression by cardiac-cycle-inspired driving of pipe flow","publication_status":"published","project":[{"name":"Revisiting the Turbulence Problem Using Statistical Mechanics","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E","grant_number":"662960"},{"grant_number":"I04188","call_identifier":"FWF","_id":"238B8092-32DE-11EA-91FC-C7463DDC885E","name":"Instabilities in pulsating pipe flow in complex fluids"}],"isi":1,"external_id":{"pmid":["37673988"],"isi":["001168947700009"]},"date_published":"2023-09-07T00:00:00Z","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."}],"quality_controlled":"1","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Scarselli, D., Lopez Alonso, J. M., Varshney, A., &#38; Hof, B. (2023). Turbulence suppression by cardiac-cycle-inspired driving of pipe flow. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-023-06399-5\">https://doi.org/10.1038/s41586-023-06399-5</a>","chicago":"Scarselli, Davide, Jose M Lopez Alonso, Atul Varshney, and Björn Hof. “Turbulence Suppression by Cardiac-Cycle-Inspired Driving of Pipe Flow.” <i>Nature</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41586-023-06399-5\">https://doi.org/10.1038/s41586-023-06399-5</a>.","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,” <i>Nature</i>, vol. 621, no. 7977. Springer Nature, pp. 71–74, 2023.","ama":"Scarselli D, Lopez Alonso JM, Varshney A, Hof B. Turbulence suppression by cardiac-cycle-inspired driving of pipe flow. <i>Nature</i>. 2023;621(7977):71-74. doi:<a href=\"https://doi.org/10.1038/s41586-023-06399-5\">10.1038/s41586-023-06399-5</a>","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.” <i>Nature</i>, vol. 621, no. 7977, Springer Nature, 2023, pp. 71–74, doi:<a href=\"https://doi.org/10.1038/s41586-023-06399-5\">10.1038/s41586-023-06399-5</a>."},"pmid":1,"publication":"Nature","file":[{"content_type":"application/pdf","relation":"main_file","checksum":"9c9f172ba0a9a301d76fff4229812464","file_size":3247252,"file_id":"17118","success":1,"date_updated":"2024-06-04T09:24:34Z","creator":"dernst","access_level":"open_access","date_created":"2024-06-04T09:24:34Z","file_name":"2023_submittedversion.pdf"}],"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.","type":"journal_article","scopus_import":"1","doi":"10.1038/s41586-023-06399-5","intvolume":"       621","author":[{"id":"40315C30-F248-11E8-B48F-1D18A9856A87","first_name":"Davide","last_name":"Scarselli","full_name":"Scarselli, Davide","orcid":"0000-0001-5227-4271"},{"orcid":"0000-0002-0384-2022","last_name":"Lopez Alonso","full_name":"Lopez Alonso, Jose M","first_name":"Jose M","id":"40770848-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Varshney","full_name":"Varshney, Atul","orcid":"0000-0002-3072-5999","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","first_name":"Atul"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","full_name":"Hof, Björn","last_name":"Hof","orcid":"0000-0003-2057-2754"}],"related_material":{"link":[{"description":"News on ISTA website","relation":"press_release","url":"https://www.ista.ac.at/en/news/pumping-like-the-heart/"}]},"date_created":"2023-09-17T22:01:09Z","volume":621,"oa":1,"month":"09","oa_version":"Submitted Version","status":"public","ddc":["530"],"_id":"14341","file_date_updated":"2024-06-04T09:24:34Z","language":[{"iso":"eng"}],"year":"2023","page":"71-74","article_type":"original","publisher":"Springer Nature","issue":"7977","day":"07","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"has_accepted_license":"1","article_processing_charge":"No","department":[{"_id":"BjHo"}]},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Lorenc, D., &#38; Alpichshev, Z. (2023). Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam. <i>Applied Physics Letters</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0161713\">https://doi.org/10.1063/5.0161713</a>","chicago":"Lorenc, Dusan, and Zhanybek Alpichshev. “Mid-Infrared Kerr Index Evaluation via Cross-Phase Modulation with a near-Infrared Probe Beam.” <i>Applied Physics Letters</i>. AIP Publishing, 2023. <a href=\"https://doi.org/10.1063/5.0161713\">https://doi.org/10.1063/5.0161713</a>.","short":"D. Lorenc, Z. Alpichshev, Applied Physics Letters 123 (2023).","ama":"Lorenc D, Alpichshev Z. Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam. <i>Applied Physics Letters</i>. 2023;123(9). doi:<a href=\"https://doi.org/10.1063/5.0161713\">10.1063/5.0161713</a>","ieee":"D. Lorenc and Z. Alpichshev, “Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam,” <i>Applied Physics Letters</i>, vol. 123, no. 9. AIP Publishing, 2023.","mla":"Lorenc, Dusan, and Zhanybek Alpichshev. “Mid-Infrared Kerr Index Evaluation via Cross-Phase Modulation with a near-Infrared Probe Beam.” <i>Applied Physics Letters</i>, vol. 123, no. 9, 091104, AIP Publishing, 2023, doi:<a href=\"https://doi.org/10.1063/5.0161713\">10.1063/5.0161713</a>.","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."},"publication":"Applied Physics Letters","file":[{"content_type":"application/pdf","relation":"main_file","checksum":"89a1b604d58b209fec66c6b6f919ac98","file_size":1486715,"file_id":"14353","date_updated":"2023-09-20T11:36:16Z","success":1,"creator":"dernst","access_level":"open_access","date_created":"2023-09-20T11:36:16Z","file_name":"2023_ApplPhysLetter_Lorenc.pdf"}],"acknowledgement":"The work was supported by IST Austria. The authors would like to gratefully acknowledge the help and assistance of Professor John M. Dudley.","type":"journal_article","date_updated":"2025-09-09T12:58:23Z","publication_status":"published","title":"Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"date_published":"2023-08-28T00:00:00Z","external_id":{"arxiv":["2306.09043"],"isi":["001145465400004"]},"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."}],"quality_controlled":"1","publication_identifier":{"issn":["0003-6951"]},"corr_author":"1","arxiv":1,"language":[{"iso":"eng"}],"year":"2023","publisher":"AIP Publishing","article_type":"original","issue":"9","day":"28","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","department":[{"_id":"ZhAl"}],"scopus_import":"1","doi":"10.1063/5.0161713","intvolume":"       123","author":[{"first_name":"Dusan","id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87","last_name":"Lorenc","full_name":"Lorenc, Dusan"},{"last_name":"Alpichshev","full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","first_name":"Zhanybek"}],"date_created":"2023-09-17T22:01:09Z","volume":123,"oa":1,"month":"08","oa_version":"Published Version","status":"public","file_date_updated":"2023-09-20T11:36:16Z","_id":"14342","ddc":["530"],"article_number":"091104"},{"publisher":"Society for Industrial and Applied Mathematics","day":"01","article_processing_charge":"No","department":[{"_id":"MaKw"}],"year":"2023","language":[{"iso":"eng"}],"page":"2286-2323","oa":1,"month":"01","_id":"14344","oa_version":"Preprint","status":"public","doi":"10.1137/1.9781611977554.ch88","scopus_import":"1","intvolume":"      2023","author":[{"first_name":"Michael","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","last_name":"Anastos","full_name":"Anastos, Michael"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.14759"}],"volume":2023,"date_created":"2023-09-17T22:01:10Z","type":"conference","conference":{"location":"Florence, Italy","start_date":"2023-01-22","end_date":"2023-01-25","name":"SODA: Symposium on Discrete Algorithms"},"citation":{"ama":"Anastos M. Fast algorithms for solving the Hamilton cycle problem with high probability. In: <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Vol 2023. Society for Industrial and Applied Mathematics; 2023:2286-2323. doi:<a href=\"https://doi.org/10.1137/1.9781611977554.ch88\">10.1137/1.9781611977554.ch88</a>","ieee":"M. Anastos, “Fast algorithms for solving the Hamilton cycle problem with high probability,” in <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Florence, Italy, 2023, vol. 2023, pp. 2286–2323.","mla":"Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, vol. 2023, Society for Industrial and Applied Mathematics, 2023, pp. 2286–323, doi:<a href=\"https://doi.org/10.1137/1.9781611977554.ch88\">10.1137/1.9781611977554.ch88</a>.","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.","chicago":"Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2023:2286–2323. Society for Industrial and Applied Mathematics, 2023. <a href=\"https://doi.org/10.1137/1.9781611977554.ch88\">https://doi.org/10.1137/1.9781611977554.ch88</a>.","apa":"Anastos, M. (2023). Fast algorithms for solving the Hamilton cycle problem with high probability. In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i> (Vol. 2023, pp. 2286–2323). Florence, Italy: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977554.ch88\">https://doi.org/10.1137/1.9781611977554.ch88</a>","short":"M. Anastos, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 2286–2323."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","corr_author":"1","publication_identifier":{"isbn":["9781611977554"]},"arxiv":1,"title":"Fast algorithms for solving the Hamilton cycle problem with high probability","publication_status":"published","date_updated":"2024-10-09T21:07:01Z","date_published":"2023-01-01T00:00:00Z","external_id":{"arxiv":["2111.14759"]},"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."}],"quality_controlled":"1"}]