[{"external_id":{"pmid":["34661293"],"isi":["000708012800001"]},"citation":{"ieee":"S. Bajaj <i>et al.</i>, “Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration,” <i>EMBO Journal</i>, vol. 40, no. 23. Embo Press, 2021.","ama":"Bajaj S, Bagley JA, Sommer CM, et al. Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration. <i>EMBO Journal</i>. 2021;40(23). doi:<a href=\"https://doi.org/10.15252/embj.2021108714\">10.15252/embj.2021108714</a>","ista":"Bajaj S, Bagley JA, Sommer CM, Vertesy A, Nagumo Wong S, Krenn V, Lévi-Strauss J, Knoblich JA. 2021. Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration. EMBO Journal. 40(23), e108714.","chicago":"Bajaj, Sunanjay, Joshua A. Bagley, Christoph M Sommer, Abel Vertesy, Sakurako Nagumo Wong, Veronica Krenn, Julie Lévi-Strauss, and Juergen A. Knoblich. “Neurotransmitter Signaling Regulates Distinct Phases of Multimodal Human Interneuron Migration.” <i>EMBO Journal</i>. Embo Press, 2021. <a href=\"https://doi.org/10.15252/embj.2021108714\">https://doi.org/10.15252/embj.2021108714</a>.","apa":"Bajaj, S., Bagley, J. A., Sommer, C. M., Vertesy, A., Nagumo Wong, S., Krenn, V., … Knoblich, J. A. (2021). Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration. <i>EMBO Journal</i>. Embo Press. <a href=\"https://doi.org/10.15252/embj.2021108714\">https://doi.org/10.15252/embj.2021108714</a>","mla":"Bajaj, Sunanjay, et al. “Neurotransmitter Signaling Regulates Distinct Phases of Multimodal Human Interneuron Migration.” <i>EMBO Journal</i>, vol. 40, no. 23, e108714, Embo Press, 2021, doi:<a href=\"https://doi.org/10.15252/embj.2021108714\">10.15252/embj.2021108714</a>.","short":"S. Bajaj, J.A. Bagley, C.M. Sommer, A. Vertesy, S. Nagumo Wong, V. Krenn, J. Lévi-Strauss, J.A. Knoblich, EMBO Journal 40 (2021)."},"scopus_import":"1","intvolume":"        40","day":"18","pmid":1,"isi":1,"month":"10","department":[{"_id":"Bio"}],"author":[{"full_name":"Bajaj, Sunanjay","first_name":"Sunanjay","last_name":"Bajaj"},{"first_name":"Joshua A.","last_name":"Bagley","full_name":"Bagley, Joshua A."},{"id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","last_name":"Sommer","first_name":"Christoph M","full_name":"Sommer, Christoph M","orcid":"0000-0003-1216-9105"},{"full_name":"Vertesy, Abel","last_name":"Vertesy","first_name":"Abel"},{"full_name":"Nagumo Wong, Sakurako","first_name":"Sakurako","last_name":"Nagumo Wong"},{"first_name":"Veronica","last_name":"Krenn","full_name":"Krenn, Veronica"},{"full_name":"Lévi-Strauss, Julie","first_name":"Julie","last_name":"Lévi-Strauss"},{"last_name":"Knoblich","first_name":"Juergen A.","full_name":"Knoblich, Juergen A."}],"article_type":"original","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-08-14T08:05:23Z","volume":40,"acknowledgement":"We thank all Knoblich laboratory members for continued support and discussions. We thank the IMP/IMBA BioOptics facility, particularly Pawel Pasierbek, Alberto Moreno Cencerrado and Gerald Schmauss, the IMP/IMBA Molecular Biology Service, in particular Robert Heinen, the IMP Bioinformatics facility, in particular Thomas Burkard, the Vienna Biocenter Core Facilities (VBCF) Histopathology facility, in particular Tamara Engelmaier, and the VBCF Next Generation Sequencing Facility, notably Volodymyr Shubchynskyy and Carmen Czepe. We would also like to thank Simon Haendeler for advice on statistical analyses, Jose Guzman for discussions and assistance with slice culture setups, Oliver L. Eichmueller for discussions and assistance with microscopy, and E.H. Gustafson, S. Wolfinger, and D. Reumann for technical assistance regarding generation of cerebral organoids. This project received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie fellowship agreement Nr.707109 awarded to J.A.B. Work in J.A.K.'s laboratory is supported by the Austrian Federal Ministry of Education, Science and Research, the Austrian Academy of Sciences, the City of Vienna, a Research Program of the Austrian Science Fund FWF (SFBF78 Stem Cell, F 7803-B) and a European Research Council (ERC) Advanced Grant under the European 20 Union’s Horizon 2020 program (grant agreement no. 695642).","issue":"23","file_date_updated":"2021-12-13T14:54:14Z","date_created":"2021-10-24T22:01:34Z","_id":"10179","abstract":[{"lang":"eng","text":"Inhibitory GABAergic interneurons migrate over long distances from their extracortical origin into the developing cortex. In humans, this process is uniquely slow and prolonged, and it is unclear whether guidance cues unique to humans govern the various phases of this complex developmental process. Here, we use fused cerebral organoids to identify key roles of neurotransmitter signaling pathways in guiding the migratory behavior of human cortical interneurons. We use scRNAseq to reveal expression of GABA, glutamate, glycine, and serotonin receptors along distinct maturation trajectories across interneuron migration. We develop an image analysis software package, TrackPal, to simultaneously assess 48 parameters for entire migration tracks of individual cells. By chemical screening, we show that different modes of interneuron migration depend on distinct neurotransmitter signaling pathways, linking transcriptional maturation of interneurons with their migratory behavior. Altogether, our study provides a comprehensive quantitative analysis of human interneuron migration and its functional modulation by neurotransmitter signaling."}],"publication":"EMBO Journal","doi":"10.15252/embj.2021108714","title":"Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","file":[{"date_created":"2021-12-13T14:54:14Z","relation":"main_file","content_type":"application/pdf","creator":"alisjak","access_level":"open_access","checksum":"78d2d02e775322297e774f72810a41a4","file_id":"10541","date_updated":"2021-12-13T14:54:14Z","success":1,"file_name":"2021_EMBO_Bajaj.pdf","file_size":7819881}],"ddc":["610"],"quality_controlled":"1","publisher":"Embo Press","publication_identifier":{"issn":["0261-4189"],"eissn":["1460-2075"]},"publication_status":"published","year":"2021","date_published":"2021-10-18T00:00:00Z","oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"article_processing_charge":"Yes (in subscription journal)","language":[{"iso":"eng"}],"article_number":"e108714"},{"department":[{"_id":"DaAl"}],"month":"09","intvolume":"        22","day":"01","arxiv":1,"citation":{"mla":"Hoefler, Torsten, et al. “Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks.” <i>Journal of Machine Learning Research</i>, vol. 22, no. 241, Journal of Machine Learning Research, 2021, pp. 1–124.","apa":"Hoefler, T., Alistarh, D.-A., Ben-Nun, T., Dryden, N., &#38; Peste, E.-A. (2021). Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. <i>Journal of Machine Learning Research</i>. Journal of Machine Learning Research.","short":"T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, E.-A. Peste, Journal of Machine Learning Research 22 (2021) 1–124.","ama":"Hoefler T, Alistarh D-A, Ben-Nun T, Dryden N, Peste E-A. Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. <i>Journal of Machine Learning Research</i>. 2021;22(241):1-124.","chicago":"Hoefler, Torsten, Dan-Adrian Alistarh, Tal Ben-Nun, Nikoli Dryden, and Elena-Alexandra Peste. “Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks.” <i>Journal of Machine Learning Research</i>. Journal of Machine Learning Research, 2021.","ista":"Hoefler T, Alistarh D-A, Ben-Nun T, Dryden N, Peste E-A. 2021. Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. Journal of Machine Learning Research. 22(241), 1–124.","ieee":"T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, and E.-A. Peste, “Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks,” <i>Journal of Machine Learning Research</i>, vol. 22, no. 241. Journal of Machine Learning Research, pp. 1–124, 2021."},"scopus_import":"1","external_id":{"arxiv":["2102.00554"]},"date_created":"2021-10-24T22:01:34Z","_id":"10180","volume":22,"acknowledgement":"We thank Doug Burger, Steve Scott, Marco Heddes, and the respective teams at Microsoft for inspiring discussions on the topic. We thank Angelika Steger for uplifting debates about the connections to biological brains, Sidak Pal Singh for his support regarding experimental results, and Utku Evci as well as Xin Wang for comments on previous versions of this\r\nwork. Special thanks go to Bernhard Schölkopf, our JMLR editor Samy Bengio, and the three anonymous reviewers who provided excellent comprehensive, pointed, and deep review comments that improved the quality of our manuscript significantly.","issue":"241","file_date_updated":"2021-10-27T15:34:18Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2022-05-13T09:36:08Z","article_type":"original","author":[{"full_name":"Hoefler, Torsten","last_name":"Hoefler","first_name":"Torsten"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"last_name":"Ben-Nun","first_name":"Tal","full_name":"Ben-Nun, Tal"},{"last_name":"Dryden","first_name":"Nikoli","full_name":"Dryden, Nikoli"},{"full_name":"Peste, Elena-Alexandra","first_name":"Elena-Alexandra","last_name":"Peste","id":"32D78294-F248-11E8-B48F-1D18A9856A87"}],"file":[{"file_size":3527521,"file_id":"10192","date_updated":"2021-10-27T15:34:18Z","success":1,"file_name":"2021_JMachLearnRes_Hoefler.pdf","access_level":"open_access","content_type":"application/pdf","creator":"cziletti","checksum":"3389d9d01fc58f8fb4c1a53e14a8abbf","relation":"main_file","date_created":"2021-10-27T15:34:18Z"}],"ddc":["000"],"title":"Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://www.jmlr.org/papers/v22/21-0366.html"}],"abstract":[{"lang":"eng","text":"The growing energy and performance costs of deep learning have driven the community to reduce the size of neural networks by selectively pruning components. Similarly to their biological counterparts, sparse networks generalize just as well, sometimes even better than, the original dense networks. Sparsity promises to reduce the memory footprint of regular networks to fit mobile devices, as well as shorten training time for ever growing networks. In this paper, we survey prior work on sparsity in deep learning and provide an extensive tutorial of sparsification for both inference and training. We describe approaches to remove and add elements of neural networks, different training strategies to achieve model sparsity, and mechanisms to exploit sparsity in practice. Our work distills ideas from more than 300 research papers and provides guidance to practitioners who wish to utilize sparsity today, as well as to researchers whose goal is to push the frontier forward. We include the necessary background on mathematical methods in sparsification, describe phenomena such as early structure adaptation, the intricate relations between sparsity and the training process, and show techniques for achieving acceleration on real hardware. We also define a metric of pruned parameter efficiency that could serve as a baseline for comparison of different sparse networks. We close by speculating on how sparsity can improve future workloads and outline major open problems in the field."}],"publication":"Journal of Machine Learning Research","article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"year":"2021","publication_status":"published","publication_identifier":{"issn":["1532-4435"],"eissn":["1533-7928"]},"date_published":"2021-09-01T00:00:00Z","quality_controlled":"1","publisher":"Journal of Machine Learning Research","page":"1-124"},{"publisher":"Springer Nature","quality_controlled":"1","year":"2021","publication_identifier":{"eissn":["1877-0541"],"issn":["0927-6947"]},"publication_status":"published","date_published":"2021-10-09T00:00:00Z","status":"public","oa_version":"Published Version","oa":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"abstract":[{"text":"In this article we study some geometric properties of proximally smooth sets. First, we introduce a modification of the metric projection and prove its existence. Then we provide an algorithm for constructing a rectifiable curve between two sufficiently close points of a proximally smooth set in a uniformly convex and uniformly smooth Banach space, with the moduli of smoothness and convexity of power type. Our algorithm returns a reasonably short curve between two sufficiently close points of a proximally smooth set, is iterative and uses our modification of the metric projection. We estimate the length of the constructed curve and its deviation from the segment with the same endpoints. These estimates coincide up to a constant factor with those for the geodesics in a proximally smooth set in a Hilbert space.","lang":"eng"}],"publication":"Set-Valued and Variational Analysis","doi":"10.1007/s11228-021-00612-1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","title":"Rectifiable curves in proximally smooth sets","main_file_link":[{"url":"https://arxiv.org/abs/2012.10691","open_access":"1"}],"article_type":"original","author":[{"first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov","full_name":"Ivanov, Grigory"},{"full_name":"Lopushanski, Mariana S.","first_name":"Mariana S.","last_name":"Lopushanski"}],"date_updated":"2023-08-14T08:11:38Z","acknowledgement":"Theorem 2 was obtained at Steklov Mathematical Institute RAS and supported by Russian Science Foundation, grant N 19-11-00087.","_id":"10181","date_created":"2021-10-24T22:01:35Z","external_id":{"isi":["000705774800001"],"arxiv":["2012.10691"]},"citation":{"chicago":"Ivanov, Grigory, and Mariana S. Lopushanski. “Rectifiable Curves in Proximally Smooth Sets.” <i>Set-Valued and Variational Analysis</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11228-021-00612-1\">https://doi.org/10.1007/s11228-021-00612-1</a>.","ama":"Ivanov G, Lopushanski MS. Rectifiable curves in proximally smooth sets. <i>Set-Valued and Variational Analysis</i>. 2021. doi:<a href=\"https://doi.org/10.1007/s11228-021-00612-1\">10.1007/s11228-021-00612-1</a>","ista":"Ivanov G, Lopushanski MS. 2021. Rectifiable curves in proximally smooth sets. Set-Valued and Variational Analysis.","apa":"Ivanov, G., &#38; Lopushanski, M. S. (2021). Rectifiable curves in proximally smooth sets. <i>Set-Valued and Variational Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11228-021-00612-1\">https://doi.org/10.1007/s11228-021-00612-1</a>","short":"G. Ivanov, M.S. Lopushanski, Set-Valued and Variational Analysis (2021).","mla":"Ivanov, Grigory, and Mariana S. Lopushanski. “Rectifiable Curves in Proximally Smooth Sets.” <i>Set-Valued and Variational Analysis</i>, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s11228-021-00612-1\">10.1007/s11228-021-00612-1</a>.","ieee":"G. Ivanov and M. S. Lopushanski, “Rectifiable curves in proximally smooth sets,” <i>Set-Valued and Variational Analysis</i>. Springer Nature, 2021."},"scopus_import":"1","day":"09","arxiv":1,"month":"10","department":[{"_id":"UlWa"}],"isi":1},{"ec_funded":1,"article_number":"272","language":[{"iso":"eng"}],"article_processing_charge":"No","oa":1,"has_accepted_license":"1","status":"public","oa_version":"Submitted Version","date_published":"2021-12-01T00:00:00Z","publication_identifier":{"eissn":["1557-7368 "],"issn":["0730-0301"]},"publication_status":"published","year":"2021","publisher":"Association for Computing Machinery","quality_controlled":"1","file":[{"file_id":"10185","file_name":"rigidmolds-authorversion.pdf","date_updated":"2021-10-27T07:08:07Z","file_size":107708317,"date_created":"2021-10-27T07:08:07Z","relation":"main_file","content_type":"application/pdf","creator":"bbickel","access_level":"open_access","checksum":"384ece7a9ad1026787ba9560b04336d5"}],"ddc":["000"],"main_file_link":[{"url":"http://vcg.isti.cnr.it/Publications/2021/AMBCP21","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","title":"Volume decomposition for two-piece rigid casting","doi":"10.1145/3478513.3480555","publication":"ACM Transactions on Graphics","abstract":[{"lang":"eng","text":"We introduce a novel technique to automatically decompose an input object’s volume into a set of parts that can be represented by two opposite height fields. Such decomposition enables the manufacturing of individual parts using two-piece reusable rigid molds. Our decomposition strategy relies on a new energy formulation that utilizes a pre-computed signal on the mesh volume representing the accessibility for a predefined set of extraction directions. Thanks to this novel formulation, our method allows for efficient optimization of a fabrication-aware partitioning of volumes in a completely\r\nautomatic way. We demonstrate the efficacy of our approach by generating valid volume partitionings for a wide range of complex objects and physically reproducing several of them."}],"_id":"10184","date_created":"2021-10-27T07:08:19Z","file_date_updated":"2021-10-27T07:08:07Z","issue":"6","acknowledgement":"The authors thank Marco Callieri for all his precious help with the resin casts. The models used in the paper are courtesy of the Stanford 3D Scanning Repository, the AIM@SHAPE Shape Repository, and Thingi10K Repository. The research was partially funded by the European Research Council (ERC) MATERIALIZABLE: Intelligent fabrication-oriented computational design and modeling (grant no. 715767).","volume":40,"date_updated":"2024-02-28T12:52:48Z","article_type":"original","author":[{"last_name":"Alderighi","first_name":"Thomas","full_name":"Alderighi, Thomas"},{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"},{"full_name":"Cignoni, Paolo","first_name":"Paolo","last_name":"Cignoni"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"}],"month":"12","department":[{"_id":"BeBi"}],"isi":1,"day":"01","intvolume":"        40","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","call_identifier":"H2020"}],"citation":{"short":"T. Alderighi, L. Malomo, B. Bickel, P. Cignoni, N. Pietroni, ACM Transactions on Graphics 40 (2021).","apa":"Alderighi, T., Malomo, L., Bickel, B., Cignoni, P., &#38; Pietroni, N. (2021). Volume decomposition for two-piece rigid casting. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3478513.3480555\">https://doi.org/10.1145/3478513.3480555</a>","mla":"Alderighi, Thomas, et al. “Volume Decomposition for Two-Piece Rigid Casting.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 6, 272, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3478513.3480555\">10.1145/3478513.3480555</a>.","chicago":"Alderighi, Thomas, Luigi Malomo, Bernd Bickel, Paolo Cignoni, and Nico Pietroni. “Volume Decomposition for Two-Piece Rigid Casting.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3478513.3480555\">https://doi.org/10.1145/3478513.3480555</a>.","ama":"Alderighi T, Malomo L, Bickel B, Cignoni P, Pietroni N. Volume decomposition for two-piece rigid casting. <i>ACM Transactions on Graphics</i>. 2021;40(6). doi:<a href=\"https://doi.org/10.1145/3478513.3480555\">10.1145/3478513.3480555</a>","ista":"Alderighi T, Malomo L, Bickel B, Cignoni P, Pietroni N. 2021. Volume decomposition for two-piece rigid casting. ACM Transactions on Graphics. 40(6), 272.","ieee":"T. Alderighi, L. Malomo, B. Bickel, P. Cignoni, and N. Pietroni, “Volume decomposition for two-piece rigid casting,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 6. Association for Computing Machinery, 2021."},"external_id":{"isi":["000729846700077"]}},{"date_updated":"2025-07-14T09:10:16Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["safety","risk","reliability and quality","software"],"author":[{"last_name":"Bui","first_name":"Truc Lam","full_name":"Bui, Truc Lam"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tushar","last_name":"Gautam","full_name":"Gautam, Tushar"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"},{"first_name":"Viktor","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor"}],"article_type":"original","date_created":"2021-10-27T15:05:34Z","_id":"10191","acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003.","volume":5,"file_date_updated":"2021-11-04T07:24:48Z","issue":"OOPSLA","citation":{"mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>.","apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., &#38; Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5(OOPSLA). doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>","ista":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164.","chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>.","ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021."},"scopus_import":"1","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"external_id":{"arxiv":["2011.11763"]},"month":"10","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"intvolume":"         5","day":"15","arxiv":1,"publication_identifier":{"eissn":["2475-1421"]},"publication_status":"published","year":"2021","date_published":"2021-10-15T00:00:00Z","quality_controlled":"1","publisher":"Association for Computing Machinery","article_processing_charge":"No","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10199"}]},"language":[{"iso":"eng"}],"ec_funded":1,"article_number":"164","oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"doi":"10.1145/3485541","abstract":[{"text":"In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.\r\n\r\n","lang":"eng"}],"publication":"Proceedings of the ACM on Programming Languages","file":[{"date_updated":"2021-11-04T07:24:48Z","file_name":"2021_ProcACMPL_Bui.pdf","success":1,"file_id":"10215","file_size":2903485,"date_created":"2021-11-04T07:24:48Z","relation":"main_file","checksum":"9d6dce7b611853c529bb7b1915ac579e","content_type":"application/pdf","access_level":"open_access","creator":"cchlebak"}],"ddc":["000"],"title":"The reads-from equivalence for the TSO and PSO memory models","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"journal_article"},{"oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"article_processing_charge":"No","supervisor":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"10190","status":"public"},{"id":"9987","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"141"},{"relation":"part_of_dissertation","status":"public","id":"10191"}]},"alternative_title":["ISTA Thesis"],"ec_funded":1,"publisher":"Institute of Science and Technology Austria","page":"166","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"year":"2021","date_published":"2021-10-31T00:00:00Z","title":"Improved verification techniques for concurrent systems","degree_awarded":"PhD","type":"dissertation","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"date_created":"2021-11-08T14:12:22Z","relation":"main_file","content_type":"application/pdf","creator":"vtoman","access_level":"open_access","checksum":"4f412a1ee60952221b499a4b1268df35","file_id":"10225","date_updated":"2021-11-08T14:12:22Z","file_name":"toman_th_final.pdf","file_size":2915234},{"content_type":"application/zip","creator":"vtoman","access_level":"closed","checksum":"9584943f99127be2dd2963f6784c37d4","date_created":"2021-11-08T14:12:46Z","relation":"source_file","file_size":8616056,"file_id":"10226","date_updated":"2021-11-09T09:00:50Z","file_name":"toman_thesis.zip"}],"ddc":["000"],"acknowledged_ssus":[{"_id":"SSU"}],"abstract":[{"text":"The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness.","lang":"eng"}],"doi":"10.15479/at:ista:10199","file_date_updated":"2021-11-09T09:00:50Z","date_created":"2021-10-29T20:09:01Z","_id":"10199","author":[{"full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","first_name":"Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman"}],"keyword":["concurrency","verification","model checking"],"date_updated":"2025-07-14T09:10:16Z","day":"31","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"month":"10","citation":{"ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.","mla":"Toman, Viktor. <i>Improved Verification Techniques for Concurrent Systems</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>.","apa":"Toman, V. (2021). <i>Improved verification techniques for concurrent systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>","short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.","ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.","chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>."},"project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"}]},{"month":"10","department":[{"_id":"CaHe"}],"pmid":1,"isi":1,"day":"19","intvolume":"        12","scopus_import":"1","citation":{"ieee":"S. J. Pradhan <i>et al.</i>, “Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021.","chicago":"Pradhan, Saurabh J., Puli Chandramouli Reddy, Michael Smutny, Ankita Sharma, Keisuke Sako, Meghana S. Oak, Rini Shah, et al. “Satb2 Acts as a Gatekeeper for Major Developmental Transitions during Early Vertebrate Embryogenesis.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-26234-7\">https://doi.org/10.1038/s41467-021-26234-7</a>.","ama":"Pradhan SJ, Reddy PC, Smutny M, et al. Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-26234-7\">10.1038/s41467-021-26234-7</a>","ista":"Pradhan SJ, Reddy PC, Smutny M, Sharma A, Sako K, Oak MS, Shah R, Pal M, Deshpande O, Dsilva G, Tang Y, Mishra R, Deshpande G, Giraldez AJ, Sonawane M, Heisenberg C-PJ, Galande S. 2021. Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis. Nature Communications. 12(1), 6094.","apa":"Pradhan, S. J., Reddy, P. C., Smutny, M., Sharma, A., Sako, K., Oak, M. S., … Galande, S. (2021). Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-26234-7\">https://doi.org/10.1038/s41467-021-26234-7</a>","mla":"Pradhan, Saurabh J., et al. “Satb2 Acts as a Gatekeeper for Major Developmental Transitions during Early Vertebrate Embryogenesis.” <i>Nature Communications</i>, vol. 12, no. 1, 6094, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-26234-7\">10.1038/s41467-021-26234-7</a>.","short":"S.J. Pradhan, P.C. Reddy, M. Smutny, A. Sharma, K. Sako, M.S. Oak, R. Shah, M. Pal, O. Deshpande, G. Dsilva, Y. Tang, R. Mishra, G. Deshpande, A.J. Giraldez, M. Sonawane, C.-P.J. Heisenberg, S. Galande, Nature Communications 12 (2021)."},"external_id":{"pmid":["34667153"],"isi":["000709050300016"]},"_id":"10202","date_created":"2021-10-31T23:01:29Z","issue":"1","file_date_updated":"2021-11-09T13:59:26Z","volume":12,"acknowledgement":"We are grateful to the members of C.-P.H. and SG lab for discussions. Authors thank Shubha Tole for providing embryonic mouse tissues. Authors are grateful to Alessandro Mongera and Chetana Sachidanandan for generous help with Tg: Sox10: GFP line. Authors would like to thank Satyajeet Khare, Vanessa Barone, Jyothish S., Shalini Mishra, Yoshita Bhide, and Keshav Jha for assistance in experiments. We would also like to thank Chaitanya Dingare for valuable suggestions. We thank Diana Pinhiero and Alexandra Schauer for critical reading of early versions of the manuscript. This work was supported by the Centre of Excellence in Epigenetics program of the Department of Biotechnology, Government of India Phase I (BT/01/COE/09/07) to S.G. and R.K.M., and Phase II (BT/COE/34/SP17426/2016) to S.G. and JC Bose Fellowship (JCB/2019/000013) from Science and Engineering Research Board, Government of India to S.G., DST-BMWF Indo-Austrian bilateral program grant to S.G. and C.-P.H. The work using animal models was partly supported by the infrastructure support grants from the Department of Biotechnology (National Facility for Laboratory Model Organisms: BT/INF/22/SP17358/2016 and Establishment of a Pune Biotech Cluster, Model Organism to Human Disease: B-2 Whole Animal Imaging & Tissue Processing FacilityBT/Pune-Biocluster/01/2015). S.J.P. was supported by Fellowship from the Council of Scientific and Industrial Research, India and travel fellowship from the Company of Biologists, UK. P.C.R. was supported by the Early Career Fellowship of the Wellcome Trust-DBT India Alliance (IA/E/16/1/503057). A.S. was supported by UGC and R.S. was supported by CSIR India. M.S. was supported by core funding from the Tata Institute of Fundamental Research (TIFR 12P-121).","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-08-14T10:32:48Z","author":[{"full_name":"Pradhan, Saurabh J.","first_name":"Saurabh J.","last_name":"Pradhan"},{"last_name":"Reddy","first_name":"Puli Chandramouli","full_name":"Reddy, Puli Chandramouli"},{"full_name":"Smutny, Michael","orcid":"0000-0002-5920-9090","id":"3FE6E4E8-F248-11E8-B48F-1D18A9856A87","last_name":"Smutny","first_name":"Michael"},{"full_name":"Sharma, Ankita","last_name":"Sharma","first_name":"Ankita"},{"id":"3BED66BE-F248-11E8-B48F-1D18A9856A87","last_name":"Sako","first_name":"Keisuke","full_name":"Sako, Keisuke","orcid":"0000-0002-6453-8075"},{"full_name":"Oak, Meghana S.","last_name":"Oak","first_name":"Meghana S."},{"first_name":"Rini","last_name":"Shah","full_name":"Shah, Rini"},{"full_name":"Pal, Mrinmoy","first_name":"Mrinmoy","last_name":"Pal"},{"full_name":"Deshpande, Ojas","last_name":"Deshpande","first_name":"Ojas"},{"full_name":"Dsilva, Greg","last_name":"Dsilva","first_name":"Greg"},{"full_name":"Tang, Yin","last_name":"Tang","first_name":"Yin"},{"first_name":"Rakesh","last_name":"Mishra","full_name":"Mishra, Rakesh"},{"first_name":"Girish","last_name":"Deshpande","full_name":"Deshpande, Girish"},{"full_name":"Giraldez, Antonio J.","last_name":"Giraldez","first_name":"Antonio J."},{"full_name":"Sonawane, Mahendra","first_name":"Mahendra","last_name":"Sonawane"},{"full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J"},{"last_name":"Galande","first_name":"Sanjeev","full_name":"Galande, Sanjeev"}],"article_type":"original","file":[{"date_created":"2021-11-09T13:59:26Z","relation":"main_file","content_type":"application/pdf","creator":"cziletti","access_level":"open_access","checksum":"c40a69ae94435ecd3a30c9874a11ef2b","file_id":"10262","success":1,"file_name":"2021_NatureComm_Pradhan.pdf","date_updated":"2021-11-09T13:59:26Z","file_size":7144437}],"ddc":["570"],"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis","doi":"10.1038/s41467-021-26234-7","publication":"Nature Communications","abstract":[{"lang":"eng","text":"Zygotic genome activation (ZGA) initiates regionalized transcription underlying distinct cellular identities. ZGA is dependent upon dynamic chromatin architecture sculpted by conserved DNA-binding proteins. However, the direct mechanistic link between the onset of ZGA and the tissue-specific transcription remains unclear. Here, we have addressed the involvement of chromatin organizer Satb2 in orchestrating both processes during zebrafish embryogenesis. Integrative analysis of transcriptome, genome-wide occupancy and chromatin accessibility reveals contrasting molecular activities of maternally deposited and zygotically synthesized Satb2. Maternal Satb2 prevents premature transcription of zygotic genes by influencing the interplay between the pluripotency factors. By contrast, zygotic Satb2 activates transcription of the same group of genes during neural crest development and organogenesis. Thus, our comparative analysis of maternal versus zygotic function of Satb2 underscores how these antithetical activities are temporally coordinated and functionally implemented highlighting the evolutionary implications of the biphasic and bimodal regulation of landmark developmental transitions by a single determinant."}],"article_number":"6094","related_material":{"link":[{"url":"https://doi.org/10.1101/2020.11.23.394171 ","relation":"earlier_version","description":"Preprint"}]},"language":[{"iso":"eng"}],"article_processing_charge":"Yes","oa":1,"has_accepted_license":"1","status":"public","oa_version":"Published Version","date_published":"2021-10-19T00:00:00Z","publication_status":"published","year":"2021","publication_identifier":{"eissn":["20411723"]},"publisher":"Springer Nature","quality_controlled":"1"},{"publication":"Nature Communications","abstract":[{"lang":"eng","text":"Single photon emitters in atomically-thin semiconductors can be deterministically positioned using strain induced by underlying nano-structures. Here, we couple monolayer WSe2 to high-refractive-index gallium phosphide dielectric nano-antennas providing both optical enhancement and monolayer deformation. For single photon emitters formed on such nano-antennas, we find very low (femto-Joule) saturation pulse energies and up to 104 times brighter photoluminescence than in WSe2 placed on low-refractive-index SiO2 pillars. We show that the key to these observations is the increase on average by a factor of 5 of the quantum efficiency of the emitters coupled to the nano-antennas. This further allows us to gain new insights into their photoluminescence dynamics, revealing the roles of the dark exciton reservoir and Auger processes. We also find that the coherence time of such emitters is limited by intrinsic dephasing processes. Our work establishes dielectric nano-antennas as a platform for high-efficiency quantum light generation in monolayer semiconductors."}],"doi":"10.1038/s41467-021-26262-3","title":"Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","ddc":["530"],"file":[{"file_size":1434201,"success":1,"file_name":"2021_NatComm_Sortino.pdf","date_updated":"2021-11-03T11:31:24Z","file_id":"10212","checksum":"8580d128389860f732028c521cd5949e","creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","date_created":"2021-11-03T11:31:24Z","relation":"main_file"}],"quality_controlled":"1","publisher":"Springer Nature","date_published":"2021-10-18T00:00:00Z","year":"2021","publication_identifier":{"eissn":["2041-1723"]},"publication_status":"published","has_accepted_license":"1","oa":1,"oa_version":"Published Version","status":"public","language":[{"iso":"eng"}],"article_number":"6063","article_processing_charge":"No","external_id":{"arxiv":["2103.16986"],"isi":["000708601800015"]},"scopus_import":"1","citation":{"mla":"Sortino, Luca, et al. “Bright Single Photon Emitters with Enhanced Quantum Efficiency in a Two-Dimensional Semiconductor Coupled with Dielectric Nano-Antennas.” <i>Nature Communications</i>, vol. 12, 6063, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-26262-3\">10.1038/s41467-021-26262-3</a>.","short":"L. Sortino, P.G. Zotev, C.L. Phillips, A.J. Brash, J. Cambiasso, E. Marensi, A.M. Fox, S.A. Maier, R. Sapienza, A.I. Tartakovskii, Nature Communications 12 (2021).","apa":"Sortino, L., Zotev, P. G., Phillips, C. L., Brash, A. J., Cambiasso, J., Marensi, E., … Tartakovskii, A. I. (2021). Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-26262-3\">https://doi.org/10.1038/s41467-021-26262-3</a>","ista":"Sortino L, Zotev PG, Phillips CL, Brash AJ, Cambiasso J, Marensi E, Fox AM, Maier SA, Sapienza R, Tartakovskii AI. 2021. Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas. Nature Communications. 12, 6063.","chicago":"Sortino, Luca, Panaiot G. Zotev, Catherine L. Phillips, Alistair J. Brash, Javier Cambiasso, Elena Marensi, A. Mark Fox, Stefan A. Maier, Riccardo Sapienza, and Alexander I. Tartakovskii. “Bright Single Photon Emitters with Enhanced Quantum Efficiency in a Two-Dimensional Semiconductor Coupled with Dielectric Nano-Antennas.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-26262-3\">https://doi.org/10.1038/s41467-021-26262-3</a>.","ama":"Sortino L, Zotev PG, Phillips CL, et al. Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas. <i>Nature Communications</i>. 2021;12. doi:<a href=\"https://doi.org/10.1038/s41467-021-26262-3\">10.1038/s41467-021-26262-3</a>","ieee":"L. Sortino <i>et al.</i>, “Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas,” <i>Nature Communications</i>, vol. 12. Springer Nature, 2021."},"arxiv":1,"intvolume":"        12","day":"18","isi":1,"month":"10","department":[{"_id":"BjHo"}],"author":[{"last_name":"Sortino","first_name":"Luca","full_name":"Sortino, Luca"},{"full_name":"Zotev, Panaiot G.","last_name":"Zotev","first_name":"Panaiot G."},{"first_name":"Catherine L.","last_name":"Phillips","full_name":"Phillips, Catherine L."},{"full_name":"Brash, Alistair J.","first_name":"Alistair J.","last_name":"Brash"},{"last_name":"Cambiasso","first_name":"Javier","full_name":"Cambiasso, Javier"},{"orcid":"0000-0001-7173-4923","full_name":"Marensi, Elena","first_name":"Elena","last_name":"Marensi","id":"0BE7553A-1004-11EA-B805-18983DDC885E"},{"first_name":"A. Mark","last_name":"Fox","full_name":"Fox, A. Mark"},{"full_name":"Maier, Stefan A.","first_name":"Stefan A.","last_name":"Maier"},{"first_name":"Riccardo","last_name":"Sapienza","full_name":"Sapienza, Riccardo"},{"first_name":"Alexander I.","last_name":"Tartakovskii","full_name":"Tartakovskii, Alexander I."}],"article_type":"original","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-08-14T08:12:12Z","volume":12,"acknowledgement":"L.S., P.G.Z., and A.I.T. thank the financial support of the European Graphene Flagship Project under grant agreements 881603 and EPSRC grant EP/S030751/1. L.S. and A.I.T. thank the European Union’s Horizon 2020 research and innovation programme under ITN Spin-NANO Marie Sklodowska-Curie grant agreement no. 676108. P.G.Z. and A.I.T. thank the European Union’s Horizon 2020 research and innovation programme under ITN 4PHOTON Marie Sklodowska-Curie grant agreement no. 721394. J.C., S.A.M., and R.S. acknowledge funding by EPSRC (EP/P033369 and EP/M013812). C.L.P., A.J.B., A.I.T., and A.M.F. acknowledge funding by EPSRC Programme Grant EP/N031776/1. S.A.M. acknowledges the Lee-Lucas Chair in Physics, the Solar Energies go Hybrid (SolTech) programme, and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy - EXC 2089/1 - 390776260.","file_date_updated":"2021-11-03T11:31:24Z","date_created":"2021-10-31T23:01:30Z","_id":"10203"},{"publication":"Soft Matter","abstract":[{"lang":"eng","text":"Two common representations of close packings of identical spheres consisting of hexagonal layers, called Barlow stackings, appear abundantly in minerals and metals. These motifs, however, occupy an identical portion of space and bear identical first-order topological signatures as measured by persistent homology. Here we present a novel method based on k-fold covers that unambiguously distinguishes between these patterns. Moreover, our approach provides topological evidence that the FCC motif is the more stable of the two in the context of evolving experimental sphere packings during the transition from disordered to an ordered state. We conclude that our approach can be generalised to distinguish between various Barlow stackings manifested in minerals and metals."}],"doi":"10.1039/d1sm00774b","title":"Topological signatures and stability of hexagonal close packing and Barlow stackings","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","ddc":["540"],"file":[{"file_id":"14385","file_name":"2021_SoftMatter_acceptedversion_Osang.pdf","success":1,"date_updated":"2023-10-03T09:21:42Z","file_size":4678788,"date_created":"2023-10-03T09:21:42Z","relation":"main_file","content_type":"application/pdf","creator":"dernst","access_level":"open_access","checksum":"b4da0c420530295e61b153960f6cb350"}],"page":"9107-9115","quality_controlled":"1","publisher":"Royal Society of Chemistry ","date_published":"2021-10-20T00:00:00Z","publication_identifier":{"eissn":["1744-6848"],"issn":["1744-683X"]},"year":"2021","publication_status":"published","has_accepted_license":"1","oa":1,"oa_version":"Submitted Version","status":"public","language":[{"iso":"eng"}],"ec_funded":1,"article_processing_charge":"No","external_id":{"pmid":["34569592"],"isi":["000700090000001"]},"scopus_import":"1","project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020"},{"name":"The Wittgenstein Prize","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342"}],"citation":{"chicago":"Osang, Georg F, Herbert Edelsbrunner, and Mohammad Saadatfar. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” <i>Soft Matter</i>. Royal Society of Chemistry , 2021. <a href=\"https://doi.org/10.1039/d1sm00774b\">https://doi.org/10.1039/d1sm00774b</a>.","ista":"Osang GF, Edelsbrunner H, Saadatfar M. 2021. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 17(40), 9107–9115.","ama":"Osang GF, Edelsbrunner H, Saadatfar M. Topological signatures and stability of hexagonal close packing and Barlow stackings. <i>Soft Matter</i>. 2021;17(40):9107-9115. doi:<a href=\"https://doi.org/10.1039/d1sm00774b\">10.1039/d1sm00774b</a>","apa":"Osang, G. F., Edelsbrunner, H., &#38; Saadatfar, M. (2021). Topological signatures and stability of hexagonal close packing and Barlow stackings. <i>Soft Matter</i>. Royal Society of Chemistry . <a href=\"https://doi.org/10.1039/d1sm00774b\">https://doi.org/10.1039/d1sm00774b</a>","mla":"Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” <i>Soft Matter</i>, vol. 17, no. 40, Royal Society of Chemistry , 2021, pp. 9107–15, doi:<a href=\"https://doi.org/10.1039/d1sm00774b\">10.1039/d1sm00774b</a>.","short":"G.F. Osang, H. Edelsbrunner, M. Saadatfar, Soft Matter 17 (2021) 9107–9115.","ieee":"G. F. Osang, H. Edelsbrunner, and M. Saadatfar, “Topological signatures and stability of hexagonal close packing and Barlow stackings,” <i>Soft Matter</i>, vol. 17, no. 40. Royal Society of Chemistry , pp. 9107–9115, 2021."},"intvolume":"        17","day":"20","pmid":1,"isi":1,"department":[{"_id":"HeEd"}],"month":"10","article_type":"original","author":[{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","last_name":"Osang","first_name":"Georg F","full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Mohammad","last_name":"Saadatfar","full_name":"Saadatfar, Mohammad"}],"date_updated":"2023-10-03T09:24:27Z","volume":17,"acknowledgement":"MS acknowledges the support by Australian Research Council funding through the ARC Training Centre for M3D Innovation (IC180100008). MS thanks M. Hanifpour and N. Francois for their input and valuable discussions. This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme, grant no. 788183 and from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","issue":"40","file_date_updated":"2023-10-03T09:21:42Z","date_created":"2021-10-31T23:01:30Z","_id":"10204"},{"keyword":["monitoring","neural networks","novelty detection"],"author":[{"first_name":"Anna","last_name":"Lukina","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","full_name":"Lukina, Anna"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"date_updated":"2024-01-30T12:06:56Z","acknowledgement":"We thank Christoph Lampert and Alex Greengold for fruitful discussions. This research was supported in part by the Simons Institute for the Theory of Computing, the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411.","volume":"12974 ","date_created":"2021-10-31T23:01:31Z","_id":"10206","external_id":{"arxiv":["2009.06429"],"isi":["000719383800003"]},"project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","conference":{"location":"Virtual","name":"RV: Runtime Verification","start_date":"2021-10-11","end_date":"2021-10-14"},"citation":{"ama":"Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural networks. In: <i>21st International Conference on Runtime Verification</i>. Vol 12974. Cham: Springer Nature; 2021:42-61. doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>","ista":"Lukina A, Schilling C, Henzinger TA. 2021. Into the unknown: active monitoring of neural networks. 21st International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 42–61.","chicago":"Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks.” In <i>21st International Conference on Runtime Verification</i>, 12974:42–61. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>.","short":"A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.","mla":"Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.” <i>21st International Conference on Runtime Verification</i>, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>.","apa":"Lukina, A., Schilling, C., &#38; Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In <i>21st International Conference on Runtime Verification</i> (Vol. 12974, pp. 42–61). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>","ieee":"A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring of neural networks,” in <i>21st International Conference on Runtime Verification</i>, Virtual, 2021, vol. 12974, pp. 42–61."},"place":"Cham","arxiv":1,"day":"06","isi":1,"department":[{"_id":"ToHe"}],"month":"10","page":"42-61","quality_controlled":"1","publisher":"Springer Nature","date_published":"2021-10-06T00:00:00Z","year":"2021","publication_identifier":{"isbn":["9-783-0308-8493-2"],"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["978-3-030-88494-9"]},"publication_status":"published","oa":1,"oa_version":"Preprint","status":"public","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"extended_version","id":"13234","status":"public"}]},"ec_funded":1,"article_processing_charge":"No","publication":"21st International Conference on Runtime Verification","abstract":[{"lang":"eng","text":"Neural-network classifiers achieve high accuracy when predicting the class of an input that they were trained to identify. Maintaining this accuracy in dynamic environments, where inputs frequently fall outside the fixed set of initially known classes, remains a challenge. The typical approach is to detect inputs from novel classes and retrain the classifier on an augmented dataset. However, not only the classifier but also the detection mechanism needs to adapt in order to distinguish between newly learned and yet unknown input classes. To address this challenge, we introduce an algorithmic framework for active monitoring of a neural network. A monitor wrapped in our framework operates in parallel with the neural network and interacts with a human user via a series of interpretable labeling queries for incremental adaptation. In addition, we propose an adaptive quantitative monitor to improve precision. An experimental evaluation on a diverse set of benchmarks with varying numbers of classes confirms the benefits of our active monitoring framework in dynamic scenarios."}],"doi":"10.1007/978-3-030-88494-9_3","main_file_link":[{"url":"https://arxiv.org/abs/2009.06429","open_access":"1"}],"title":"Into the unknown: active monitoring of neural networks","type":"conference","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"date_updated":"2023-09-05T14:13:57Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"full_name":"Thrampoulidis, Christos","last_name":"Thrampoulidis","first_name":"Christos"},{"full_name":"Venkataramanan, Ramji","first_name":"Ramji","last_name":"Venkataramanan"}],"keyword":["Applied Mathematics","Computational Theory and Mathematics","Computational Mathematics","Analysis"],"article_type":"original","date_created":"2021-11-03T10:59:08Z","_id":"10211","acknowledgement":"M. Mondelli would like to thank Andrea Montanari for helpful discussions. All the authors would like to thank the anonymous reviewers for their helpful comments.","file_date_updated":"2021-12-13T15:47:54Z","citation":{"ieee":"M. Mondelli, C. Thrampoulidis, and R. Venkataramanan, “Optimal combination of linear and spectral estimators for generalized linear models,” <i>Foundations of Computational Mathematics</i>. Springer, 2021.","apa":"Mondelli, M., Thrampoulidis, C., &#38; Venkataramanan, R. (2021). Optimal combination of linear and spectral estimators for generalized linear models. <i>Foundations of Computational Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s10208-021-09531-x\">https://doi.org/10.1007/s10208-021-09531-x</a>","short":"M. Mondelli, C. Thrampoulidis, R. Venkataramanan, Foundations of Computational Mathematics (2021).","mla":"Mondelli, Marco, et al. “Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models.” <i>Foundations of Computational Mathematics</i>, Springer, 2021, doi:<a href=\"https://doi.org/10.1007/s10208-021-09531-x\">10.1007/s10208-021-09531-x</a>.","chicago":"Mondelli, Marco, Christos Thrampoulidis, and Ramji Venkataramanan. “Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models.” <i>Foundations of Computational Mathematics</i>. Springer, 2021. <a href=\"https://doi.org/10.1007/s10208-021-09531-x\">https://doi.org/10.1007/s10208-021-09531-x</a>.","ama":"Mondelli M, Thrampoulidis C, Venkataramanan R. Optimal combination of linear and spectral estimators for generalized linear models. <i>Foundations of Computational Mathematics</i>. 2021. doi:<a href=\"https://doi.org/10.1007/s10208-021-09531-x\">10.1007/s10208-021-09531-x</a>","ista":"Mondelli M, Thrampoulidis C, Venkataramanan R. 2021. Optimal combination of linear and spectral estimators for generalized linear models. Foundations of Computational Mathematics."},"scopus_import":"1","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"external_id":{"isi":["000685721000001"],"arxiv":["2008.03326"]},"isi":1,"month":"08","department":[{"_id":"MaMo"}],"day":"17","arxiv":1,"publication_status":"published","publication_identifier":{"eissn":["1615-3383"],"issn":["1615-3375"]},"year":"2021","date_published":"2021-08-17T00:00:00Z","quality_controlled":"1","publisher":"Springer","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"doi":"10.1007/s10208-021-09531-x","abstract":[{"text":"We study the problem of recovering an unknown signal 𝑥𝑥 given measurements obtained from a generalized linear model with a Gaussian sensing matrix. Two popular solutions are based on a linear estimator 𝑥𝑥^L and a spectral estimator 𝑥𝑥^s. The former is a data-dependent linear combination of the columns of the measurement matrix, and its analysis is quite simple. The latter is the principal eigenvector of a data-dependent matrix, and a recent line of work has studied its performance. In this paper, we show how to optimally combine 𝑥𝑥^L and 𝑥𝑥^s. At the heart of our analysis is the exact characterization of the empirical joint distribution of (𝑥𝑥,𝑥𝑥^L,𝑥𝑥^s) in the high-dimensional limit. This allows us to compute the Bayes-optimal combination of 𝑥𝑥^L and 𝑥𝑥^s, given the limiting distribution of the signal 𝑥𝑥. When the distribution of the signal is Gaussian, then the Bayes-optimal combination has the form 𝜃𝑥𝑥^L+𝑥𝑥^s and we derive the optimal combination coefficient. In order to establish the limiting distribution of (𝑥𝑥,𝑥𝑥^L,𝑥𝑥^s), we design and analyze an approximate message passing algorithm whose iterates give 𝑥𝑥^L and approach 𝑥𝑥^s. Numerical simulations demonstrate the improvement of the proposed combination with respect to the two methods considered separately.","lang":"eng"}],"publication":"Foundations of Computational Mathematics","ddc":["510"],"file":[{"file_size":2305731,"date_updated":"2021-12-13T15:47:54Z","success":1,"file_name":"2021_Springer_Mondelli.pdf","file_id":"10542","checksum":"9ea12dd8045a0678000a3a59295221cb","creator":"alisjak","access_level":"open_access","content_type":"application/pdf","relation":"main_file","date_created":"2021-12-13T15:47:54Z"}],"title":"Optimal combination of linear and spectral estimators for generalized linear models","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"journal_article"},{"volume":209,"acknowledgement":"This work was partially funded by National Supercomputing Mission, Govt. of India under the project “Concurrent and Distributed Programming primitives and algorithms for Temporal Graphs”(DST/NSM/R&D_Exascale/2021/16).\r\n","file_date_updated":"2021-11-12T09:23:22Z","date_created":"2021-11-07T23:01:23Z","_id":"10216","author":[{"last_name":"Chatterjee","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","first_name":"Bapi","full_name":"Chatterjee, Bapi"},{"first_name":"Sathya","last_name":"Peri","full_name":"Peri, Sathya"},{"full_name":"Sa, Muktikanta","last_name":"Sa","first_name":"Muktikanta"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2021-11-12T09:42:55Z","intvolume":"       209","day":"04","arxiv":1,"month":"10","department":[{"_id":"DaAl"}],"external_id":{"arxiv":["2003.01697"]},"citation":{"ieee":"B. Chatterjee, S. Peri, and M. Sa, “Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds,” in <i>35th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2021, vol. 209.","apa":"Chatterjee, B., Peri, S., &#38; Sa, M. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In <i>35th International Symposium on Distributed Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">https://doi.org/10.4230/LIPIcs.DISC.2021.52</a>","short":"B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","mla":"Chatterjee, Bapi, et al. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” <i>35th International Symposium on Distributed Computing</i>, vol. 209, 52, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">10.4230/LIPIcs.DISC.2021.52</a>.","ama":"Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">10.4230/LIPIcs.DISC.2021.52</a>","chicago":"Chatterjee, Bapi, Sathya Peri, and Muktikanta Sa. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” In <i>35th International Symposium on Distributed Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">https://doi.org/10.4230/LIPIcs.DISC.2021.52</a>.","ista":"Chatterjee B, Peri S, Sa M. 2021. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 52."},"scopus_import":"1","conference":{"end_date":"2021-10-08","location":"Freiburg, Germany","name":"DISC: Distributed Computing","start_date":"2021-10-04"},"oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"article_number":"52","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","publication_status":"published","publication_identifier":{"isbn":["9-783-9597-7210-5"],"issn":["1868-8969"]},"year":"2021","date_published":"2021-10-04T00:00:00Z","title":"Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds","type":"conference","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","ddc":["000"],"file":[{"date_created":"2021-11-12T09:23:22Z","relation":"main_file","access_level":"open_access","creator":"cchlebak","content_type":"application/pdf","checksum":"76546df112a0ba1166c864d33d7834e2","file_id":"10276","file_name":"2021_LIPIcsDISC_BChatterjee.pdf","success":1,"date_updated":"2021-11-12T09:23:22Z","file_size":795860}],"abstract":[{"text":"This paper reports a new concurrent graph data structure that supports updates of both edges and vertices and queries: Breadth-first search, Single-source shortest-path, and Betweenness centrality. The operations are provably linearizable and non-blocking.","lang":"eng"}],"publication":"35th International Symposium on Distributed Computing","doi":"10.4230/LIPIcs.DISC.2021.52"},{"acknowledgement":"Dan Alistarh: Supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Giorgi Nadiradze: Supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). The authors would like to thank the DISC anonymous reviewers for their useful\r\nfeedback and comments.","volume":209,"file_date_updated":"2021-11-12T09:33:26Z","date_created":"2021-11-07T23:01:23Z","_id":"10217","author":[{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"},{"first_name":"Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","last_name":"Nadiradze","full_name":"Nadiradze, Giorgi"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2022-08-19T07:23:28Z","intvolume":"       209","day":"04","month":"10","department":[{"_id":"DaAl"}],"citation":{"apa":"Alistarh, D.-A., Gelashvili, R., &#38; Nadiradze, G. (2021). Lower bounds for shared-memory leader election under bounded write contention. In <i>35th International Symposium on Distributed Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.4\">https://doi.org/10.4230/LIPIcs.DISC.2021.4</a>","short":"D.-A. Alistarh, R. Gelashvili, G. Nadiradze, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","mla":"Alistarh, Dan-Adrian, et al. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.” <i>35th International Symposium on Distributed Computing</i>, vol. 209, 4, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.4\">10.4230/LIPIcs.DISC.2021.4</a>.","ista":"Alistarh D-A, Gelashvili R, Nadiradze G. 2021. Lower bounds for shared-memory leader election under bounded write contention. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 4.","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Giorgi Nadiradze. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.” In <i>35th International Symposium on Distributed Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.4\">https://doi.org/10.4230/LIPIcs.DISC.2021.4</a>.","ama":"Alistarh D-A, Gelashvili R, Nadiradze G. Lower bounds for shared-memory leader election under bounded write contention. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.4\">10.4230/LIPIcs.DISC.2021.4</a>","ieee":"D.-A. Alistarh, R. Gelashvili, and G. Nadiradze, “Lower bounds for shared-memory leader election under bounded write contention,” in <i>35th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2021, vol. 209."},"scopus_import":"1","project":[{"grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"conference":{"name":"DISC: Distributed Computing","start_date":"2021-10-04","location":"Freiburg, Germany","end_date":"2021-10-08"},"oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"article_processing_charge":"No","alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"article_number":"4","ec_funded":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","year":"2021","publication_identifier":{"issn":["1868-8969"],"isbn":["9-783-9597-7210-5"]},"publication_status":"published","date_published":"2021-10-04T00:00:00Z","title":"Lower bounds for shared-memory leader election under bounded write contention","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","file":[{"content_type":"application/pdf","creator":"cchlebak","access_level":"open_access","checksum":"b4cdc6668c899a601c5e6a96b8ca54d9","relation":"main_file","date_created":"2021-11-12T09:33:26Z","file_size":706791,"file_id":"10277","date_updated":"2021-11-12T09:33:26Z","success":1,"file_name":"2021_LIPIcsDISC_Alistarh.pdf"}],"ddc":["000"],"abstract":[{"text":"This paper gives tight logarithmic lower bounds on the solo step complexity of leader election in an asynchronous shared-memory model with single-writer multi-reader (SWMR) registers, for both deterministic and randomized obstruction-free algorithms. The approach extends to lower bounds for deterministic and randomized obstruction-free algorithms using multi-writer registers under bounded write concurrency, showing a trade-off between the solo step complexity of a leader election algorithm, and the worst-case number of stalls incurred by a processor in an execution.","lang":"eng"}],"publication":"35th International Symposium on Distributed Computing","doi":"10.4230/LIPIcs.DISC.2021.4"},{"type":"conference","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Brief announcement: Fast graphical population protocols","ddc":["000"],"file":[{"file_id":"10274","date_updated":"2021-11-12T08:16:44Z","success":1,"file_name":"2021_LIPIcsDISC_Alistarh.pdf","file_size":534219,"relation":"main_file","date_created":"2021-11-12T08:16:44Z","access_level":"open_access","content_type":"application/pdf","creator":"cchlebak","checksum":"fd2a690f6856d21247e9aa952b0e2885"}],"publication":"35th International Symposium on Distributed Computing","abstract":[{"text":"Let G be a graph on n nodes. In the stochastic population protocol model, a collection of n indistinguishable, resource-limited nodes collectively solve tasks via pairwise interactions. In each interaction, two randomly chosen neighbors first read each other’s states, and then update their local states. A rich line of research has established tight upper and lower bounds on the complexity of fundamental tasks, such as majority and leader election, in this model, when G is a clique. Specifically, in the clique, these tasks can be solved fast, i.e., in n polylog n pairwise interactions, with high probability, using at most polylog n states per node. In this work, we consider the more general setting where G is an arbitrary graph, and present a technique for simulating protocols designed for fully-connected networks in any connected regular graph. Our main result is a simulation that is efficient on many interesting graph families: roughly, the simulation overhead is polylogarithmic in the number of nodes, and quadratic in the conductance of the graph. As an example, this implies that, in any regular graph with conductance φ, both leader election and exact majority can be solved in φ^{-2} ⋅ n polylog n pairwise interactions, with high probability, using at most φ^{-2} ⋅ polylog n states per node. This shows that there are fast and space-efficient population protocols for leader election and exact majority on graphs with good expansion properties.","lang":"eng"}],"doi":"10.4230/LIPIcs.DISC.2021.43","oa":1,"has_accepted_license":"1","status":"public","oa_version":"Published Version","ec_funded":1,"article_number":"43","language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"article_processing_charge":"No","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","date_published":"2021-10-04T00:00:00Z","year":"2021","publication_identifier":{"isbn":["9-783-9597-7210-5"],"issn":["1868-8969"]},"publication_status":"published","arxiv":1,"day":"04","intvolume":"       209","department":[{"_id":"DaAl"}],"month":"10","external_id":{"arxiv":["2102.08808"]},"conference":{"location":"Freiburg, Germany","start_date":"2021-10-04","name":"DISC: Distributed Computing ","end_date":"2021-10-08"},"project":[{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","name":"Coordination in constrained and natural distributed systems","call_identifier":"H2020","grant_number":"840605"}],"scopus_import":"1","citation":{"ieee":"D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Brief announcement: Fast graphical population protocols,” in <i>35th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2021, vol. 209.","apa":"Alistarh, D.-A., Gelashvili, R., &#38; Rybicki, J. (2021). Brief announcement: Fast graphical population protocols. In <i>35th International Symposium on Distributed Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.43\">https://doi.org/10.4230/LIPIcs.DISC.2021.43</a>","mla":"Alistarh, Dan-Adrian, et al. “Brief Announcement: Fast Graphical Population Protocols.” <i>35th International Symposium on Distributed Computing</i>, vol. 209, 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.43\">10.4230/LIPIcs.DISC.2021.43</a>.","short":"D.-A. Alistarh, R. Gelashvili, J. Rybicki, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ama":"Alistarh D-A, Gelashvili R, Rybicki J. Brief announcement: Fast graphical population protocols. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.43\">10.4230/LIPIcs.DISC.2021.43</a>","ista":"Alistarh D-A, Gelashvili R, Rybicki J. 2021. Brief announcement: Fast graphical population protocols. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 43.","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Brief Announcement: Fast Graphical Population Protocols.” In <i>35th International Symposium on Distributed Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.43\">https://doi.org/10.4230/LIPIcs.DISC.2021.43</a>."},"file_date_updated":"2021-11-12T08:16:44Z","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 840605.","volume":209,"_id":"10218","date_created":"2021-11-07T23:01:24Z","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"},{"full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-02-21T09:24:08Z"},{"external_id":{"arxiv":["2108.02655"]},"citation":{"ieee":"J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in <i>35th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2021, vol. 209.","ama":"Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.58\">10.4230/LIPIcs.DISC.2021.58</a>","ista":"Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. 2021. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 58.","chicago":"Korhonen, Janne, Ami Paz, Joel Rybicki, Stefan Schmid, and Jukka Suomela. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” In <i>35th International Symposium on Distributed Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.58\">https://doi.org/10.4230/LIPIcs.DISC.2021.58</a>.","apa":"Korhonen, J., Paz, A., Rybicki, J., Schmid, S., &#38; Suomela, J. (2021). Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In <i>35th International Symposium on Distributed Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.58\">https://doi.org/10.4230/LIPIcs.DISC.2021.58</a>","mla":"Korhonen, Janne, et al. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” <i>35th International Symposium on Distributed Computing</i>, vol. 209, 58, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.58\">10.4230/LIPIcs.DISC.2021.58</a>.","short":"J. Korhonen, A. Paz, J. Rybicki, S. Schmid, J. Suomela, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021."},"scopus_import":"1","project":[{"name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020"}],"conference":{"location":"Freiburg, Germany","start_date":"2021-10-04","name":"DISC: Distributed Computing ","end_date":"2021-10-08"},"intvolume":"       209","day":"04","arxiv":1,"department":[{"_id":"DaAl"}],"month":"10","author":[{"first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen","full_name":"Korhonen, Janne"},{"full_name":"Paz, Ami","first_name":"Ami","last_name":"Paz"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","first_name":"Joel","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"first_name":"Jukka","last_name":"Suomela","full_name":"Suomela, Jukka"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2021-11-12T09:37:18Z","acknowledgement":"Janne H. Korhonen: Project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Ami Paz: We acknowledge the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N. Stefan Schmid: Research supported by the Austrian Science Fund (FWF) project ADVISE, I 4800-N, 2020-2023.\r\n","volume":209,"file_date_updated":"2021-11-12T08:27:42Z","date_created":"2021-11-07T23:01:24Z","_id":"10219","abstract":[{"text":"We show that any algorithm that solves the sinkless orientation problem in the supported LOCAL model requires Ω(log n) rounds, and this is tight. The supported LOCAL is at least as strong as the usual LOCAL model, and as a corollary this also gives a new, short and elementary proof that shows that the round complexity of the sinkless orientation problem in the deterministic LOCAL model is Ω(log n).","lang":"eng"}],"publication":"35th International Symposium on Distributed Computing","doi":"10.4230/LIPIcs.DISC.2021.58","title":"Brief announcement: Sinkless orientation is hard also in the supported LOCAL model","type":"conference","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"file_size":474242,"file_id":"10275","date_updated":"2021-11-12T08:27:42Z","success":1,"file_name":"2021_LIPIcsDISC_Korhonen.pdf","content_type":"application/pdf","access_level":"open_access","creator":"cchlebak","checksum":"c43188dc2070bbd2bf5fd6fdaf9ce36d","date_created":"2021-11-12T08:27:42Z","relation":"main_file"}],"ddc":["000"],"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","publication_status":"published","year":"2021","publication_identifier":{"issn":["1868-8969"],"isbn":["9-783-9597-7210-5"]},"date_published":"2021-10-04T00:00:00Z","oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"article_processing_charge":"No","alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"article_number":"58","ec_funded":1},{"doi":"10.1007/s11856-021-2216-z","publication":"Israel Journal of Mathematics","abstract":[{"lang":"eng","text":"We study conditions under which a finite simplicial complex K can be mapped to ℝd without higher-multiplicity intersections. An almost r-embedding is a map f: K → ℝd such that the images of any r pairwise disjoint simplices of K do not have a common point. We show that if r is not a prime power and d ≥ 2r + 1, then there is a counterexample to the topological Tverberg conjecture, i.e., there is an almost r-embedding of the (d +1)(r − 1)-simplex in ℝd. This improves on previous constructions of counterexamples (for d ≥ 3r) based on a series of papers by M. Özaydin, M. Gromov, P. Blagojević, F. Frick, G. Ziegler, and the second and fourth present authors.\r\n\r\nThe counterexamples are obtained by proving the following algebraic criterion in codimension 2: If r ≥ 3 and if K is a finite 2(r − 1)-complex, then there exists an almost r-embedding K → ℝ2r if and only if there exists a general position PL map f: K → ℝ2r such that the algebraic intersection number of the f-images of any r pairwise disjoint simplices of K is zero. This result can be restated in terms of a cohomological obstruction and extends an analogous codimension 3 criterion by the second and fourth authors. As another application, we classify ornaments f: S3 ⊔ S3 ⊔ S3 → ℝ5 up to ornament concordance.\r\n\r\nIt follows from work of M. Freedman, V. Krushkal and P. Teichner that the analogous criterion for r = 2 is false. We prove a lemma on singular higher-dimensional Borromean rings, yielding an elementary proof of the counterexample."}],"main_file_link":[{"url":"https://arxiv.org/abs/1511.03501","open_access":"1"}],"title":"Eliminating higher-multiplicity intersections. III. Codimension 2","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-10-30T00:00:00Z","publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"year":"2021","publication_status":"published","page":"501–534 ","quality_controlled":"1","publisher":"Springer Nature","related_material":{"record":[{"status":"public","id":"8183","relation":"earlier_version"},{"relation":"earlier_version","id":"9308","status":"public"}]},"language":[{"iso":"eng"}],"article_processing_charge":"No","oa":1,"oa_version":"Preprint","status":"public","project":[{"_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory","grant_number":"P31312","call_identifier":"FWF"}],"scopus_import":"1","citation":{"apa":"Avvakumov, S., Mabillard, I., Skopenkov, A. B., &#38; Wagner, U. (2021). Eliminating higher-multiplicity intersections. III. Codimension 2. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-021-2216-z\">https://doi.org/10.1007/s11856-021-2216-z</a>","mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections. III. Codimension 2.” <i>Israel Journal of Mathematics</i>, vol. 245, Springer Nature, 2021, pp. 501–534, doi:<a href=\"https://doi.org/10.1007/s11856-021-2216-z\">10.1007/s11856-021-2216-z</a>.","short":"S. Avvakumov, I. Mabillard, A.B. Skopenkov, U. Wagner, Israel Journal of Mathematics 245 (2021) 501–534.","chicago":"Avvakumov, Sergey, Isaac Mabillard, Arkadiy B. Skopenkov, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections. III. Codimension 2.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11856-021-2216-z\">https://doi.org/10.1007/s11856-021-2216-z</a>.","ista":"Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. 2021. Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. 245, 501–534.","ama":"Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. Eliminating higher-multiplicity intersections. III. Codimension 2. <i>Israel Journal of Mathematics</i>. 2021;245:501–534. doi:<a href=\"https://doi.org/10.1007/s11856-021-2216-z\">10.1007/s11856-021-2216-z</a>","ieee":"S. Avvakumov, I. Mabillard, A. B. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections. III. Codimension 2,” <i>Israel Journal of Mathematics</i>, vol. 245. Springer Nature, pp. 501–534, 2021."},"external_id":{"arxiv":["1511.03501"],"isi":["000712942100013"]},"isi":1,"month":"10","department":[{"_id":"UlWa"}],"arxiv":1,"intvolume":"       245","day":"30","date_updated":"2023-08-14T11:43:55Z","author":[{"full_name":"Avvakumov, Sergey","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov"},{"id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","last_name":"Mabillard","first_name":"Isaac","full_name":"Mabillard, Isaac"},{"full_name":"Skopenkov, Arkadiy B.","first_name":"Arkadiy B.","last_name":"Skopenkov"},{"orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"}],"article_type":"original","date_created":"2021-11-07T23:01:24Z","_id":"10220","volume":245,"acknowledgement":"Research supported by the Swiss National Science Foundation (Project SNSF-PP00P2-138948), by the Austrian Science Fund (FWF Project P31312-N35), by the Russian Foundation for Basic Research (Grants No. 15-01-06302 and 19-01-00169), by a Simons-IUM Fellowship, and by the D. Zimin Dynasty Foundation Grant. We would like to thank E. Alkin, A. Klyachko, V. Krushkal, S. Melikhov, M. Tancer, P. Teichner and anonymous referees for helpful comments and discussions."},{"issue":"2","file_date_updated":"2022-02-02T10:19:55Z","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","volume":388,"_id":"10221","date_created":"2021-11-07T23:01:25Z","article_type":"original","author":[{"orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio"},{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder"}],"date_updated":"2023-08-14T10:29:49Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"day":"29","intvolume":"       388","month":"10","department":[{"_id":"LaEr"}],"isi":1,"external_id":{"arxiv":["2012.13215"],"isi":["000712232700001"]},"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"scopus_import":"1","citation":{"ama":"Cipolloni G, Erdös L, Schröder DJ. Eigenstate thermalization hypothesis for Wigner matrices. <i>Communications in Mathematical Physics</i>. 2021;388(2):1005–1048. doi:<a href=\"https://doi.org/10.1007/s00220-021-04239-z\">10.1007/s00220-021-04239-z</a>","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Eigenstate Thermalization Hypothesis for Wigner Matrices.” <i>Communications in Mathematical Physics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00220-021-04239-z\">https://doi.org/10.1007/s00220-021-04239-z</a>.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2021. Eigenstate thermalization hypothesis for Wigner matrices. Communications in Mathematical Physics. 388(2), 1005–1048.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Communications in Mathematical Physics 388 (2021) 1005–1048.","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2021). Eigenstate thermalization hypothesis for Wigner matrices. <i>Communications in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00220-021-04239-z\">https://doi.org/10.1007/s00220-021-04239-z</a>","mla":"Cipolloni, Giorgio, et al. “Eigenstate Thermalization Hypothesis for Wigner Matrices.” <i>Communications in Mathematical Physics</i>, vol. 388, no. 2, Springer Nature, 2021, pp. 1005–1048, doi:<a href=\"https://doi.org/10.1007/s00220-021-04239-z\">10.1007/s00220-021-04239-z</a>.","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Eigenstate thermalization hypothesis for Wigner matrices,” <i>Communications in Mathematical Physics</i>, vol. 388, no. 2. Springer Nature, pp. 1005–1048, 2021."},"oa":1,"has_accepted_license":"1","status":"public","oa_version":"Published Version","language":[{"iso":"eng"}],"article_processing_charge":"Yes (via OA deal)","page":"1005–1048","publisher":"Springer Nature","quality_controlled":"1","date_published":"2021-10-29T00:00:00Z","publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"publication_status":"published","year":"2021","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","title":"Eigenstate thermalization hypothesis for Wigner matrices","file":[{"file_id":"10715","success":1,"file_name":"2021_CommunMathPhys_Cipolloni.pdf","date_updated":"2022-02-02T10:19:55Z","file_size":841426,"relation":"main_file","date_created":"2022-02-02T10:19:55Z","access_level":"open_access","content_type":"application/pdf","creator":"cchlebak","checksum":"a2c7b6f5d23b5453cd70d1261272283b"}],"ddc":["510"],"publication":"Communications in Mathematical Physics","abstract":[{"text":"We prove that any deterministic matrix is approximately the identity in the eigenbasis of a large random Wigner matrix with very high probability and with an optimal error inversely proportional to the square root of the dimension. Our theorem thus rigorously verifies the Eigenstate Thermalisation Hypothesis by Deutsch (Phys Rev A 43:2046–2049, 1991) for the simplest chaotic quantum system, the Wigner ensemble. In mathematical terms, we prove the strong form of Quantum Unique Ergodicity (QUE) with an optimal convergence rate for all eigenvectors simultaneously, generalizing previous probabilistic QUE results in Bourgade and Yau (Commun Math Phys 350:231–278, 2017) and Bourgade et al. (Commun Pure Appl Math 73:1526–1596, 2020).","lang":"eng"}],"doi":"10.1007/s00220-021-04239-z"},{"oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"ec_funded":1,"quality_controlled":"1","publisher":"Taylor and Francis","page":"1-15","publication_status":"published","year":"2021","publication_identifier":{"eissn":["1944-950X"],"issn":["1058-6458"]},"date_published":"2021-10-25T00:00:00Z","title":"The beauty of random polytopes inscribed in the 2-sphere","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["510"],"file":[{"file_size":1966019,"file_id":"14053","date_updated":"2023-08-14T11:55:10Z","success":1,"file_name":"2023_ExperimentalMath_Akopyan.pdf","content_type":"application/pdf","access_level":"open_access","creator":"dernst","checksum":"3514382e3a1eb87fa6c61ad622874415","relation":"main_file","date_created":"2023-08-14T11:55:10Z"}],"abstract":[{"lang":"eng","text":"Consider a random set of points on the unit sphere in ℝd, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the case d = 3, for which there are elementary proofs and fascinating formulas for metric properties. In particular, we study the fraction of acute facets, the expected intrinsic volumes, the total edge length, and the distance to a fixed point. Finally we generalize the results to the ellipsoid with homeoid density."}],"publication":"Experimental Mathematics","doi":"10.1080/10586458.2021.1980459","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35.\r\nWe are grateful to Dmitry Zaporozhets and Christoph Thäle for valuable comments and for directing us to relevant references. We also thank to Anton Mellit for a useful discussion on Bessel functions.","file_date_updated":"2023-08-14T11:55:10Z","date_created":"2021-11-07T23:01:25Z","_id":"10222","article_type":"original","author":[{"first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"first_name":"Anton","last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-08-14T11:57:07Z","day":"25","arxiv":1,"isi":1,"department":[{"_id":"HeEd"}],"month":"10","external_id":{"isi":["000710893500001"],"arxiv":["2007.07783"]},"citation":{"ama":"Akopyan A, Edelsbrunner H, Nikitenko A. The beauty of random polytopes inscribed in the 2-sphere. <i>Experimental Mathematics</i>. 2021:1-15. doi:<a href=\"https://doi.org/10.1080/10586458.2021.1980459\">10.1080/10586458.2021.1980459</a>","ista":"Akopyan A, Edelsbrunner H, Nikitenko A. 2021. The beauty of random polytopes inscribed in the 2-sphere. Experimental Mathematics., 1–15.","chicago":"Akopyan, Arseniy, Herbert Edelsbrunner, and Anton Nikitenko. “The Beauty of Random Polytopes Inscribed in the 2-Sphere.” <i>Experimental Mathematics</i>. Taylor and Francis, 2021. <a href=\"https://doi.org/10.1080/10586458.2021.1980459\">https://doi.org/10.1080/10586458.2021.1980459</a>.","apa":"Akopyan, A., Edelsbrunner, H., &#38; Nikitenko, A. (2021). The beauty of random polytopes inscribed in the 2-sphere. <i>Experimental Mathematics</i>. Taylor and Francis. <a href=\"https://doi.org/10.1080/10586458.2021.1980459\">https://doi.org/10.1080/10586458.2021.1980459</a>","mla":"Akopyan, Arseniy, et al. “The Beauty of Random Polytopes Inscribed in the 2-Sphere.” <i>Experimental Mathematics</i>, Taylor and Francis, 2021, pp. 1–15, doi:<a href=\"https://doi.org/10.1080/10586458.2021.1980459\">10.1080/10586458.2021.1980459</a>.","short":"A. Akopyan, H. Edelsbrunner, A. Nikitenko, Experimental Mathematics (2021) 1–15.","ieee":"A. Akopyan, H. Edelsbrunner, and A. Nikitenko, “The beauty of random polytopes inscribed in the 2-sphere,” <i>Experimental Mathematics</i>. Taylor and Francis, pp. 1–15, 2021."},"scopus_import":"1","project":[{"grant_number":"788183","call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z00342"},{"grant_number":"I4887","name":"Discretization in Geometry and Dynamics","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35"}]},{"external_id":{"pmid":["34707283"],"isi":["000713338100006"]},"citation":{"ieee":"L. Li <i>et al.</i>, “Cell surface and intracellular auxin signalling for H<sup>+</sup> fluxes in root growth,” <i>Nature</i>, vol. 599, no. 7884. Springer Nature, pp. 273–277, 2021.","short":"L. Li, I. Verstraeten, M. Roosjen, K. Takahashi, L. Rodriguez Solovey, J. Merrin, J. Chen, L. Shabala, W. Smet, H. Ren, S. Vanneste, S. Shabala, B. De Rybel, D. Weijers, T. Kinoshita, W.M. Gray, J. Friml, Nature 599 (2021) 273–277.","apa":"Li, L., Verstraeten, I., Roosjen, M., Takahashi, K., Rodriguez Solovey, L., Merrin, J., … Friml, J. (2021). Cell surface and intracellular auxin signalling for H<sup>+</sup> fluxes in root growth. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-021-04037-6\">https://doi.org/10.1038/s41586-021-04037-6</a>","mla":"Li, Lanxin, et al. “Cell Surface and Intracellular Auxin Signalling for H<sup>+</sup> Fluxes in Root Growth.” <i>Nature</i>, vol. 599, no. 7884, Springer Nature, 2021, pp. 273–77, doi:<a href=\"https://doi.org/10.1038/s41586-021-04037-6\">10.1038/s41586-021-04037-6</a>.","ista":"Li L, Verstraeten I, Roosjen M, Takahashi K, Rodriguez Solovey L, Merrin J, Chen J, Shabala L, Smet W, Ren H, Vanneste S, Shabala S, De Rybel B, Weijers D, Kinoshita T, Gray WM, Friml J. 2021. Cell surface and intracellular auxin signalling for H<sup>+</sup> fluxes in root growth. Nature. 599(7884), 273–277.","chicago":"Li, Lanxin, Inge Verstraeten, Mark Roosjen, Koji Takahashi, Lesia Rodriguez Solovey, Jack Merrin, Jian Chen, et al. “Cell Surface and Intracellular Auxin Signalling for H<sup>+</sup> Fluxes in Root Growth.” <i>Nature</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41586-021-04037-6\">https://doi.org/10.1038/s41586-021-04037-6</a>.","ama":"Li L, Verstraeten I, Roosjen M, et al. Cell surface and intracellular auxin signalling for H<sup>+</sup> fluxes in root growth. <i>Nature</i>. 2021;599(7884):273-277. doi:<a href=\"https://doi.org/10.1038/s41586-021-04037-6\">10.1038/s41586-021-04037-6</a>"},"project":[{"grant_number":"742985","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"},{"name":"Molecular mechanisms of endocytic cargo recognition in plants","_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630","call_identifier":"FWF"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"},{"grant_number":"25351","name":"A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root","_id":"26B4D67E-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","intvolume":"       599","day":"11","isi":1,"pmid":1,"department":[{"_id":"JiFr"},{"_id":"NanoFab"}],"month":"11","keyword":["Multidisciplinary"],"author":[{"orcid":"0000-0002-5607-272X","full_name":"Li, Lanxin","first_name":"Lanxin","last_name":"Li","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Verstraeten, Inge","orcid":"0000-0001-7241-2328","first_name":"Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten"},{"last_name":"Roosjen","first_name":"Mark","full_name":"Roosjen, Mark"},{"full_name":"Takahashi, Koji","last_name":"Takahashi","first_name":"Koji"},{"id":"3922B506-F248-11E8-B48F-1D18A9856A87","last_name":"Rodriguez Solovey","first_name":"Lesia","full_name":"Rodriguez Solovey, Lesia","orcid":"0000-0002-7244-7237"},{"orcid":"0000-0001-5145-4609","full_name":"Merrin, Jack","last_name":"Merrin","id":"4515C308-F248-11E8-B48F-1D18A9856A87","first_name":"Jack"},{"last_name":"Chen","first_name":"Jian","full_name":"Chen, Jian"},{"last_name":"Shabala","first_name":"Lana","full_name":"Shabala, Lana"},{"first_name":"Wouter","last_name":"Smet","full_name":"Smet, Wouter"},{"last_name":"Ren","first_name":"Hong","full_name":"Ren, Hong"},{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"},{"full_name":"Shabala, Sergey","last_name":"Shabala","first_name":"Sergey"},{"full_name":"De Rybel, Bert","last_name":"De Rybel","first_name":"Bert"},{"full_name":"Weijers, Dolf","first_name":"Dolf","last_name":"Weijers"},{"last_name":"Kinoshita","first_name":"Toshinori","full_name":"Kinoshita, Toshinori"},{"full_name":"Gray, William M.","first_name":"William M.","last_name":"Gray"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří"}],"article_type":"original","date_updated":"2024-10-29T10:22:45Z","volume":599,"acknowledgement":"We thank N. Gnyliukh and L. Hörmayer for technical assistance and N. Paris for sharing PM-Cyto seeds. We gratefully acknowledge the Life Science, Machine Shop and Bioimaging Facilities of IST Austria. This project has received funding from the European Research Council Advanced Grant (ETAP-742985) and the Austrian Science Fund (FWF) under I 3630-B25 to J.F., the National Institutes of Health (GM067203) to W.M.G., the Netherlands Organization for Scientific Research (NWO; VIDI-864.13.001), Research Foundation-Flanders (FWO; Odysseus II G0D0515N) and a European Research Council Starting Grant (TORPEDO-714055) to W.S. and B.D.R., the VICI grant (865.14.001) from the Netherlands Organization for Scientific Research to M.R. and D.W., the Australian Research Council and China National Distinguished Expert Project (WQ20174400441) to S.S., the MEXT/JSPS KAKENHI to K.T. (20K06685) and T.K. (20H05687 and 20H05910), the European Union’s Horizon 2020 research and innovation programme under Marie Skłodowska-Curie grant agreement no. 665385 and the DOC Fellowship of the Austrian Academy of Sciences to L.L., and the China Scholarship Council to J.C.","issue":"7884","date_created":"2021-11-07T23:01:25Z","_id":"10223","abstract":[{"text":"Growth regulation tailors development in plants to their environment. A prominent example of this is the response to gravity, in which shoots bend up and roots bend down1. This paradox is based on opposite effects of the phytohormone auxin, which promotes cell expansion in shoots while inhibiting it in roots via a yet unknown cellular mechanism2. Here, by combining microfluidics, live imaging, genetic engineering and phosphoproteomics in Arabidopsis thaliana, we advance understanding of how auxin inhibits root growth. We show that auxin activates two distinct, antagonistically acting signalling pathways that converge on rapid regulation of apoplastic pH, a causative determinant of growth. Cell surface-based TRANSMEMBRANE KINASE1 (TMK1) interacts with and mediates phosphorylation and activation of plasma membrane H+-ATPases for apoplast acidification, while intracellular canonical auxin signalling promotes net cellular H+ influx, causing apoplast alkalinization. Simultaneous activation of these two counteracting mechanisms poises roots for rapid, fine-tuned growth modulation in navigating complex soil environments.","lang":"eng"}],"publication":"Nature","doi":"10.1038/s41586-021-04037-6","title":"Cell surface and intracellular auxin signalling for H<sup>+</sup> fluxes in root growth","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"open_access":"1","url":"https://www.doi.org/10.21203/rs.3.rs-266395/v3"}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"M-Shop"},{"_id":"Bio"}],"quality_controlled":"1","publisher":"Springer Nature","page":"273-277","year":"2021","publication_identifier":{"issn":["00280836"],"eissn":["14764687"]},"publication_status":"published","date_published":"2021-11-11T00:00:00Z","oa_version":"Preprint","status":"public","oa":1,"article_processing_charge":"No","related_material":{"link":[{"description":"News on IST Webpage","relation":"press_release","url":"https://ist.ac.at/en/news/stop-and-grow/"}],"record":[{"status":"public","id":"10095","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"ec_funded":1},{"doi":"10.1007/s00205-021-01715-7","abstract":[{"text":"We investigate the Fröhlich polaron model on a three-dimensional torus, and give a proof of the second-order quantum corrections to its ground-state energy in the strong-coupling limit. Compared to previous work in the confined case, the translational symmetry (and its breaking in the Pekar approximation) makes the analysis substantially more challenging.","lang":"eng"}],"publication":"Archive for Rational Mechanics and Analysis","file":[{"date_created":"2021-12-14T08:35:42Z","relation":"main_file","checksum":"672e9c21b20f1a50854b7c821edbb92f","access_level":"open_access","content_type":"application/pdf","creator":"alisjak","date_updated":"2021-12-14T08:35:42Z","file_name":"2021_Springer_Feliciangeli.pdf","success":1,"file_id":"10544","file_size":990529}],"ddc":["530"],"title":"The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2021","publication_status":"published","publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"date_published":"2021-10-25T00:00:00Z","quality_controlled":"1","publisher":"Springer Nature","page":"1835–1906","article_processing_charge":"Yes (via OA deal)","related_material":{"record":[{"status":"public","id":"9787","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"ec_funded":1,"oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"citation":{"mla":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 242, no. 3, Springer Nature, 2021, pp. 1835–1906, doi:<a href=\"https://doi.org/10.1007/s00205-021-01715-7\">10.1007/s00205-021-01715-7</a>.","apa":"Feliciangeli, D., &#38; Seiringer, R. (2021). The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-021-01715-7\">https://doi.org/10.1007/s00205-021-01715-7</a>","short":"D. Feliciangeli, R. Seiringer, Archive for Rational Mechanics and Analysis 242 (2021) 1835–1906.","ama":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. <i>Archive for Rational Mechanics and Analysis</i>. 2021;242(3):1835–1906. doi:<a href=\"https://doi.org/10.1007/s00205-021-01715-7\">10.1007/s00205-021-01715-7</a>","chicago":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00205-021-01715-7\">https://doi.org/10.1007/s00205-021-01715-7</a>.","ista":"Feliciangeli D, Seiringer R. 2021. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. Archive for Rational Mechanics and Analysis. 242(3), 1835–1906.","ieee":"D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 242, no. 3. Springer Nature, pp. 1835–1906, 2021."},"project":[{"call_identifier":"H2020","grant_number":"694227","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","external_id":{"isi":["000710850600001"],"arxiv":["2101.12566"]},"isi":1,"month":"10","department":[{"_id":"RoSe"}],"intvolume":"       242","day":"25","arxiv":1,"date_updated":"2023-08-14T10:32:19Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_type":"original","author":[{"last_name":"Feliciangeli","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","first_name":"Dario","orcid":"0000-0003-0754-8530","full_name":"Feliciangeli, Dario"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"date_created":"2021-11-07T23:01:26Z","_id":"10224","volume":242,"acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is gratefully acknowledged. We would also like to thank Rupert Frank for many helpful discussions, especially related to the Gross coordinate transformation defined in Def. 4.7.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).","file_date_updated":"2021-12-14T08:35:42Z","issue":"3"}]