[{"quality_controlled":"1","corr_author":"1","isi":1,"month":"10","publication":"Journal of Mathematical Physics","oa":1,"status":"public","acknowledgement":"We would like to thank Nils Carqueville, Tobias Dyckerhoff, Jan Hesse, Ehud Meir, Sebastian Novak, Louis-Hadrien Robert, Nick Salter, Walker Stern, and Lukas Woike for helpful discussions and comments. L.S. was supported by the DFG Research Training Group 1670 “Mathematics Inspired by String Theory and Quantum Field Theory.”","abstract":[{"lang":"eng","text":"We give a combinatorial model for r-spin surfaces with parameterized boundary based on Novak (“Lattice topological field theories in two dimensions,” Ph.D. thesis, Universität Hamburg, 2015). The r-spin structure is encoded in terms of ℤ𝑟-valued indices assigned to the edges of a polygonal decomposition. This combinatorial model is designed for our state-sum construction of two-dimensional topological field theories on r-spin surfaces. We show that an example of such a topological field theory computes the Arf-invariant of an r-spin surface as introduced by Randal-Williams [J. Topol. 7, 155 (2014)] and Geiges et al. [Osaka J. Math. 49, 449 (2012)]. This implies, in particular, that the r-spin Arf-invariant is constant on orbits of the mapping class group, providing an alternative proof of that fact."}],"article_type":"original","publisher":"AIP Publishing","_id":"10176","scopus_import":"1","date_created":"2021-10-24T22:01:32Z","volume":62,"title":"Topological field theory on r-spin surfaces and the Arf-invariant","citation":{"ista":"Runkel I, Szegedy L. 2021. Topological field theory on r-spin surfaces and the Arf-invariant. Journal of Mathematical Physics. 62(10), 102302.","mla":"Runkel, Ingo, and Lorant Szegedy. “Topological Field Theory on R-Spin Surfaces and the Arf-Invariant.” <i>Journal of Mathematical Physics</i>, vol. 62, no. 10, 102302, AIP Publishing, 2021, doi:<a href=\"https://doi.org/10.1063/5.0037826\">10.1063/5.0037826</a>.","short":"I. Runkel, L. Szegedy, Journal of Mathematical Physics 62 (2021).","chicago":"Runkel, Ingo, and Lorant Szegedy. “Topological Field Theory on R-Spin Surfaces and the Arf-Invariant.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2021. <a href=\"https://doi.org/10.1063/5.0037826\">https://doi.org/10.1063/5.0037826</a>.","ieee":"I. Runkel and L. Szegedy, “Topological field theory on r-spin surfaces and the Arf-invariant,” <i>Journal of Mathematical Physics</i>, vol. 62, no. 10. AIP Publishing, 2021.","ama":"Runkel I, Szegedy L. Topological field theory on r-spin surfaces and the Arf-invariant. <i>Journal of Mathematical Physics</i>. 2021;62(10). doi:<a href=\"https://doi.org/10.1063/5.0037826\">10.1063/5.0037826</a>","apa":"Runkel, I., &#38; Szegedy, L. (2021). Topological field theory on r-spin surfaces and the Arf-invariant. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0037826\">https://doi.org/10.1063/5.0037826</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1802.09978"}],"article_processing_charge":"No","department":[{"_id":"MiLe"}],"language":[{"iso":"eng"}],"date_published":"2021-10-01T00:00:00Z","year":"2021","type":"journal_article","publication_identifier":{"issn":["0022-2488"]},"date_updated":"2025-07-10T11:49:44Z","day":"01","intvolume":"        62","issue":"10","article_number":"102302","publication_status":"published","arxiv":1,"external_id":{"isi":["000755638500010"],"arxiv":["1802.09978"]},"oa_version":"Preprint","doi":"10.1063/5.0037826","author":[{"last_name":"Runkel","full_name":"Runkel, Ingo","first_name":"Ingo"},{"full_name":"Szegedy, Lorant","orcid":"0000-0003-2834-5054","last_name":"Szegedy","id":"7943226E-220E-11EA-94C7-D59F3DDC885E","first_name":"Lorant"}]},{"doi":"10.1126/sciadv.abj0127","file":[{"date_created":"2021-10-27T14:16:06Z","success":1,"date_updated":"2021-10-27T14:16:06Z","creator":"cziletti","file_name":"2021_ScienceAdv_Martin-Sanchez.pdf","checksum":"0a470ef6a47d2b8a96ede4c4d28cfacd","access_level":"open_access","relation":"main_file","file_id":"10189","file_size":2441163,"content_type":"application/pdf"}],"author":[{"first_name":"Javier","full_name":"Martín-Sánchez, Javier","last_name":"Martín-Sánchez"},{"first_name":"Jiahua","full_name":"Duan, Jiahua","last_name":"Duan"},{"first_name":"Javier","last_name":"Taboada-Gutiérrez","full_name":"Taboada-Gutiérrez, Javier"},{"first_name":"Gonzalo","last_name":"Álvarez-Pérez","full_name":"Álvarez-Pérez, Gonzalo"},{"first_name":"Kirill V.","full_name":"Voronin, Kirill V.","last_name":"Voronin"},{"full_name":"Prieto Gonzalez, Ivan","last_name":"Prieto Gonzalez","orcid":"0000-0002-7370-5357","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ivan"},{"first_name":"Weiliang","full_name":"Ma, Weiliang","last_name":"Ma"},{"first_name":"Qiaoliang","full_name":"Bao, Qiaoliang","last_name":"Bao"},{"first_name":"Valentyn S.","last_name":"Volkov","full_name":"Volkov, Valentyn S."},{"last_name":"Hillenbrand","full_name":"Hillenbrand, Rainer","first_name":"Rainer"},{"last_name":"Nikitin","full_name":"Nikitin, Alexey Y.","first_name":"Alexey Y."},{"full_name":"Alonso-González, Pablo","last_name":"Alonso-González","first_name":"Pablo"}],"oa_version":"Published Version","external_id":{"arxiv":["2103.10852"],"isi":["000704912700024"]},"arxiv":1,"issue":"41","article_number":"abj0127","publication_status":"published","intvolume":"         7","type":"journal_article","year":"2021","publication_identifier":{"eissn":["2375-2548"]},"file_date_updated":"2021-10-27T14:16:06Z","date_updated":"2026-04-02T13:15:46Z","day":"08","has_accepted_license":"1","department":[{"_id":"NanoFab"}],"language":[{"iso":"eng"}],"date_published":"2021-10-08T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_processing_charge":"Yes","volume":7,"title":"Focusing of in-plane hyperbolic polaritons in van der Waals crystals with tailored infrared nanoantennas","citation":{"short":"J. Martín-Sánchez, J. Duan, J. Taboada-Gutiérrez, G. Álvarez-Pérez, K.V. Voronin, I. Prieto Gonzalez, W. Ma, Q. Bao, V.S. Volkov, R. Hillenbrand, A.Y. Nikitin, P. Alonso-González, Science Advances 7 (2021).","mla":"Martín-Sánchez, Javier, et al. “Focusing of In-Plane Hyperbolic Polaritons in van Der Waals Crystals with Tailored Infrared Nanoantennas.” <i>Science Advances</i>, vol. 7, no. 41, abj0127, American Association for the Advancement of Science, 2021, doi:<a href=\"https://doi.org/10.1126/sciadv.abj0127\">10.1126/sciadv.abj0127</a>.","ista":"Martín-Sánchez J, Duan J, Taboada-Gutiérrez J, Álvarez-Pérez G, Voronin KV, Prieto Gonzalez I, Ma W, Bao Q, Volkov VS, Hillenbrand R, Nikitin AY, Alonso-González P. 2021. Focusing of in-plane hyperbolic polaritons in van der Waals crystals with tailored infrared nanoantennas. Science Advances. 7(41), abj0127.","ieee":"J. Martín-Sánchez <i>et al.</i>, “Focusing of in-plane hyperbolic polaritons in van der Waals crystals with tailored infrared nanoantennas,” <i>Science Advances</i>, vol. 7, no. 41. American Association for the Advancement of Science, 2021.","ama":"Martín-Sánchez J, Duan J, Taboada-Gutiérrez J, et al. Focusing of in-plane hyperbolic polaritons in van der Waals crystals with tailored infrared nanoantennas. <i>Science Advances</i>. 2021;7(41). doi:<a href=\"https://doi.org/10.1126/sciadv.abj0127\">10.1126/sciadv.abj0127</a>","apa":"Martín-Sánchez, J., Duan, J., Taboada-Gutiérrez, J., Álvarez-Pérez, G., Voronin, K. V., Prieto Gonzalez, I., … Alonso-González, P. (2021). Focusing of in-plane hyperbolic polaritons in van der Waals crystals with tailored infrared nanoantennas. <i>Science Advances</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/sciadv.abj0127\">https://doi.org/10.1126/sciadv.abj0127</a>","chicago":"Martín-Sánchez, Javier, Jiahua Duan, Javier Taboada-Gutiérrez, Gonzalo Álvarez-Pérez, Kirill V. Voronin, Ivan Prieto Gonzalez, Weiliang Ma, et al. “Focusing of In-Plane Hyperbolic Polaritons in van Der Waals Crystals with Tailored Infrared Nanoantennas.” <i>Science Advances</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/sciadv.abj0127\">https://doi.org/10.1126/sciadv.abj0127</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png"},"_id":"10177","scopus_import":"1","date_created":"2021-10-24T22:01:33Z","abstract":[{"text":"Phonon polaritons (PhPs)—light coupled to lattice vibrations—with in-plane hyperbolic dispersion exhibit ray-like propagation with large wave vectors and enhanced density of optical states along certain directions on a surface. As such, they have raised a surge of interest, promising unprecedented manipulation of infrared light at the nanoscale in a planar circuitry. Here, we demonstrate focusing of in-plane hyperbolic PhPs propagating along thin slabs of α-MoO3. To that end, we developed metallic nanoantennas of convex geometries for both efficient launching and focusing of the polaritons. The foci obtained exhibit enhanced near-field confinement and absorption compared to foci produced by in-plane isotropic PhPs. Foci sizes as small as λp/4.5 = λ0/50 were achieved (λp is the polariton wavelength and λ0 is the photon wavelength). Focusing of in-plane hyperbolic polaritons introduces a first and most basic building block developing planar polariton optics using in-plane anisotropic van der Waals materials.","lang":"eng"}],"acknowledgement":"J.M.-S. acknowledges financial support from the Ramón y Cajal Program of the Government of Spain and FSE (RYC2018-026196-I) and the Spanish Ministry of Science and Innovation (State Plan for Scientific and Technical Research and Innovation grant number PID2019-110308GA-I00). P.A.-G. acknowledges support from the European Research Council under starting grant no. 715496, 2DNANOPTICA, and the Spanish Ministry of Science and Innovation (State Plan for Scientific and Technical Research and Innovation grant number PID2019-111156GB-I00). J.T.-G. acknowledges support through the Severo Ochoa Program from the Government of the Principality of Asturias (PA-18-PF-BP17-126). G.A.-P. acknowledges support through the Severo Ochoa Program from the Government of the Principality of Asturias (PA-20-PF-BP19-053). K.V.V. and V.S.V. acknowledge the financial support from the Ministry of Science and Higher Education of the Russian Federation (agreement no. 075-15-2021-606). A.Y.N. acknowledges the Spanish Ministry of Science, Innovation, and Universities (national projects MAT2017-88358-C3-3-R and PID2020-115221GB-C42) and the Basque Department of Education (PIBA-2020-1-0014). R.H. acknowledges financial support from the Spanish Ministry of Science, Innovation, and Universities (national project number RTI2018-094830-B-100 and project number MDM-2016-0618 of the Marie de Maeztu Units of Excellence Program) and the Basque Government (grant number IT1164-19).","article_type":"original","publisher":"American Association for the Advancement of Science","isi":1,"publication":"Science Advances","month":"10","oa":1,"status":"public","ddc":["530"],"quality_controlled":"1"},{"arxiv":1,"issue":"9","article_number":"093043","publication_status":"published","intvolume":"        23","doi":"10.1088/1367-2630/ac23f1","author":[{"first_name":"Preeti","id":"55BA52EE-A185-11EA-88FD-18AD3DDC885E","last_name":"Sahu","full_name":"Sahu, Preeti"},{"last_name":"Schwarz","full_name":"Schwarz, J. M.","first_name":"J. M."},{"full_name":"Manning, M. Lisa","last_name":"Manning","first_name":"M. Lisa"}],"file":[{"checksum":"ace603e8f0962b3ba55f23fa34f57764","content_type":"application/pdf","file_size":2215016,"file_id":"10193","access_level":"open_access","relation":"main_file","creator":"cziletti","file_name":"2021_NewJPhys_Sahu.pdf","date_created":"2021-10-28T12:06:01Z","date_updated":"2021-10-28T12:06:01Z","success":1}],"oa_version":"Published Version","external_id":{"isi":["000702042400001"],"arxiv":["2102.05397"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"10178","date_created":"2021-10-24T22:01:34Z","scopus_import":"1","acknowledgement":"We thank Paula Sanematsu, Matthias Merkel, Daniel Sussman, Cristina Marchetti and Edouard Hannezo for helpful discussions, and M Merkel for developing and sharing the original version of the 3D Voronoi code. This work was primarily funded by NSF-PHY-1607416, NSF-PHY-2014192 , and are in the division of physics at the National Science Foundation. PS and MLM acknowledge additional support from Simons Grant No. 454947.\r\n","abstract":[{"lang":"eng","text":"In dense biological tissues, cell types performing different roles remain segregated by maintaining sharp interfaces. To better understand the mechanisms for such sharp compartmentalization, we study the effect of an imposed heterotypic tension at the interface between two distinct cell types in a fully 3D Voronoi model for confluent tissues. We find that cells rapidly sort and self-organize to generate a tissue-scale interface between cell types, and cells adjacent to this interface exhibit signature geometric features including nematic-like ordering, bimodal facet areas, and registration, or alignment, of cell centers on either side of the two-tissue interface. The magnitude of these features scales directly with the magnitude of the imposed tension, suggesting that biologists can estimate the magnitude of tissue surface tension between two tissue types simply by segmenting a 3D tissue. To uncover the underlying physical mechanisms driving these geometric features, we develop two minimal, ordered models using two different underlying lattices that identify an energetic competition between bulk cell shapes and tissue interface area. When the interface area dominates, changes to neighbor topology are costly and occur less frequently, which generates the observed geometric features."}],"article_type":"original","publisher":"IOP Publishing","isi":1,"publication":"New Journal of Physics","month":"09","status":"public","oa":1,"quality_controlled":"1","ddc":["570"],"publication_identifier":{"eissn":["1367-2630"]},"year":"2021","type":"journal_article","file_date_updated":"2021-10-28T12:06:01Z","day":"29","date_updated":"2026-04-02T13:54:56Z","has_accepted_license":"1","department":[{"_id":"EdHa"}],"language":[{"iso":"eng"}],"date_published":"2021-09-29T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_processing_charge":"Yes","volume":23,"title":"Geometric signatures of tissue surface tension in a three-dimensional model of confluent tissue","citation":{"ieee":"P. Sahu, J. M. Schwarz, and M. L. Manning, “Geometric signatures of tissue surface tension in a three-dimensional model of confluent tissue,” <i>New Journal of Physics</i>, vol. 23, no. 9. IOP Publishing, 2021.","ama":"Sahu P, Schwarz JM, Manning ML. Geometric signatures of tissue surface tension in a three-dimensional model of confluent tissue. <i>New Journal of Physics</i>. 2021;23(9). doi:<a href=\"https://doi.org/10.1088/1367-2630/ac23f1\">10.1088/1367-2630/ac23f1</a>","apa":"Sahu, P., Schwarz, J. M., &#38; Manning, M. L. (2021). Geometric signatures of tissue surface tension in a three-dimensional model of confluent tissue. <i>New Journal of Physics</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1367-2630/ac23f1\">https://doi.org/10.1088/1367-2630/ac23f1</a>","chicago":"Sahu, Preeti, J. M. Schwarz, and M. Lisa Manning. “Geometric Signatures of Tissue Surface Tension in a Three-Dimensional Model of Confluent Tissue.” <i>New Journal of Physics</i>. IOP Publishing, 2021. <a href=\"https://doi.org/10.1088/1367-2630/ac23f1\">https://doi.org/10.1088/1367-2630/ac23f1</a>.","ista":"Sahu P, Schwarz JM, Manning ML. 2021. Geometric signatures of tissue surface tension in a three-dimensional model of confluent tissue. New Journal of Physics. 23(9), 093043.","mla":"Sahu, Preeti, et al. “Geometric Signatures of Tissue Surface Tension in a Three-Dimensional Model of Confluent Tissue.” <i>New Journal of Physics</i>, vol. 23, no. 9, 093043, IOP Publishing, 2021, doi:<a href=\"https://doi.org/10.1088/1367-2630/ac23f1\">10.1088/1367-2630/ac23f1</a>.","short":"P. Sahu, J.M. Schwarz, M.L. Manning, New Journal of Physics 23 (2021)."}},{"oa_version":"Published Version","file":[{"checksum":"78d2d02e775322297e774f72810a41a4","file_size":7819881,"content_type":"application/pdf","file_id":"10541","relation":"main_file","access_level":"open_access","date_updated":"2021-12-13T14:54:14Z","date_created":"2021-12-13T14:54:14Z","success":1,"file_name":"2021_EMBO_Bajaj.pdf","creator":"alisjak"}],"author":[{"first_name":"Sunanjay","full_name":"Bajaj, Sunanjay","last_name":"Bajaj"},{"last_name":"Bagley","full_name":"Bagley, Joshua A.","first_name":"Joshua A."},{"id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph M","full_name":"Sommer, Christoph M","last_name":"Sommer","orcid":"0000-0003-1216-9105"},{"first_name":"Abel","last_name":"Vertesy","full_name":"Vertesy, Abel"},{"last_name":"Nagumo Wong","full_name":"Nagumo Wong, Sakurako","first_name":"Sakurako"},{"first_name":"Veronica","full_name":"Krenn, Veronica","last_name":"Krenn"},{"last_name":"Lévi-Strauss","full_name":"Lévi-Strauss, Julie","first_name":"Julie"},{"first_name":"Juergen A.","last_name":"Knoblich","full_name":"Knoblich, Juergen A."}],"doi":"10.15252/embj.2021108714","pmid":1,"external_id":{"isi":["000708012800001"],"pmid":["34661293"]},"intvolume":"        40","issue":"23","article_number":"e108714","publication_status":"published","date_published":"2021-10-18T00:00:00Z","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"Bio"}],"file_date_updated":"2021-12-13T14:54:14Z","date_updated":"2023-08-14T08:05:23Z","day":"18","publication_identifier":{"eissn":["1460-2075"],"issn":["0261-4189"]},"year":"2021","type":"journal_article","title":"Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration","citation":{"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>","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>","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).","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.","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>."},"volume":40,"article_processing_charge":"Yes (in subscription journal)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Embo Press","article_type":"original","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."}],"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).","_id":"10179","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"date_created":"2021-10-24T22:01:34Z","scopus_import":"1","quality_controlled":"1","ddc":["610"],"month":"10","publication":"EMBO Journal","status":"public","oa":1,"isi":1},{"page":"1-124","scopus_import":"1","date_created":"2021-10-24T22:01:34Z","OA_place":"publisher","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"10180","abstract":[{"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.","lang":"eng"}],"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.","article_type":"original","publisher":"ML Research Press","corr_author":"1","status":"public","oa":1,"month":"09","publication":"Journal of Machine Learning Research","quality_controlled":"1","ddc":["000"],"publication_identifier":{"issn":["1532-4435"],"eissn":["1533-7928"]},"year":"2021","type":"journal_article","date_updated":"2025-06-26T11:53:12Z","day":"01","file_date_updated":"2021-10-27T15:34:18Z","department":[{"_id":"DaAl"}],"has_accepted_license":"1","date_published":"2021-09-01T00:00:00Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://www.jmlr.org/papers/v22/21-0366.html","open_access":"1"}],"article_processing_charge":"No","volume":22,"citation":{"ama":"Hoefler T, Alistarh D-A, Ben-Nun T, Dryden N, Krumes 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 Alexandra Krumes. “Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks.” <i>Journal of Machine Learning Research</i>. ML Research Press, 2021.","ieee":"T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, and A. Krumes, “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. ML Research Press, pp. 1–124, 2021.","apa":"Hoefler, T., Alistarh, D.-A., Ben-Nun, T., Dryden, N., &#38; Krumes, A. (2021). Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. <i>Journal of Machine Learning Research</i>. ML Research Press.","ista":"Hoefler T, Alistarh D-A, Ben-Nun T, Dryden N, Krumes 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.","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, ML Research Press, 2021, pp. 1–124.","short":"T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, A. Krumes, Journal of Machine Learning Research 22 (2021) 1–124."},"title":"Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks","arxiv":1,"publication_status":"published","issue":"241","intvolume":"        22","file":[{"checksum":"3389d9d01fc58f8fb4c1a53e14a8abbf","content_type":"application/pdf","file_size":3527521,"file_id":"10192","relation":"main_file","access_level":"open_access","file_name":"2021_JMachLearnRes_Hoefler.pdf","creator":"cziletti","date_created":"2021-10-27T15:34:18Z","date_updated":"2021-10-27T15:34:18Z","success":1}],"author":[{"full_name":"Hoefler, Torsten","last_name":"Hoefler","first_name":"Torsten"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tal","last_name":"Ben-Nun","full_name":"Ben-Nun, Tal"},{"first_name":"Nikoli","full_name":"Dryden, Nikoli","last_name":"Dryden"},{"id":"32D78294-F248-11E8-B48F-1D18A9856A87","first_name":"Elena-Alexandra","full_name":"Peste, Elena-Alexandra","last_name":"Peste"}],"oa_version":"Published Version","external_id":{"arxiv":["2102.00554"]}},{"file":[{"file_name":"rigidmolds-authorversion.pdf","creator":"bbickel","date_updated":"2021-10-27T07:08:07Z","date_created":"2021-10-27T07:08:07Z","access_level":"open_access","relation":"main_file","file_id":"10185","file_size":107708317,"content_type":"application/pdf","checksum":"384ece7a9ad1026787ba9560b04336d5"}],"author":[{"full_name":"Alderighi, Thomas","last_name":"Alderighi","first_name":"Thomas"},{"full_name":"Malomo, Luigi","last_name":"Malomo","first_name":"Luigi"},{"full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"last_name":"Cignoni","full_name":"Cignoni, Paolo","first_name":"Paolo"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"}],"doi":"10.1145/3478513.3480555","oa_version":"Submitted Version","external_id":{"isi":["000729846700077"]},"issue":"6","article_number":"272","publication_status":"published","intvolume":"        40","file_date_updated":"2021-10-27T07:08:07Z","date_updated":"2025-04-14T07:28:57Z","day":"01","type":"journal_article","publication_identifier":{"eissn":["1557-7368 "],"issn":["0730-0301"]},"year":"2021","language":[{"iso":"eng"}],"date_published":"2021-12-01T00:00:00Z","department":[{"_id":"BeBi"}],"has_accepted_license":"1","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"http://vcg.isti.cnr.it/Publications/2021/AMBCP21"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Volume decomposition for two-piece rigid casting","citation":{"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>.","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.","short":"T. Alderighi, L. Malomo, B. Bickel, P. Cignoni, N. Pietroni, ACM Transactions on Graphics 40 (2021).","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>","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.","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>","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>."},"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"volume":40,"_id":"10184","scopus_import":"1","date_created":"2021-10-27T07:08:19Z","publisher":"Association for Computing Machinery","ec_funded":1,"article_type":"original","abstract":[{"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.","lang":"eng"}],"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).","month":"12","publication":"ACM Transactions on Graphics","oa":1,"status":"public","isi":1,"ddc":["000"],"quality_controlled":"1"},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"volume":5,"title":"The reads-from equivalence for the TSO and PSO memory models","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>.","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.","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>","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>","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.","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>."},"type":"journal_article","year":"2021","publication_identifier":{"eissn":["2475-1421"]},"file_date_updated":"2021-11-04T07:24:48Z","day":"15","date_updated":"2026-04-08T07:00:31Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"has_accepted_license":"1","date_published":"2021-10-15T00:00:00Z","language":[{"iso":"eng"}],"publication":"Proceedings of the ACM on Programming Languages","month":"10","oa":1,"status":"public","quality_controlled":"1","ddc":["000"],"keyword":["safety","risk","reliability and quality","software"],"_id":"10191","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"scopus_import":"1","date_created":"2021-10-27T15:05:34Z","ec_funded":1,"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"}],"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.","article_type":"original","publisher":"Association for Computing Machinery","external_id":{"arxiv":["2011.11763"]},"related_material":{"record":[{"id":"10199","status":"public","relation":"dissertation_contains"}]},"doi":"10.1145/3485541","author":[{"last_name":"Bui","full_name":"Bui, Truc Lam","first_name":"Truc Lam"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Gautam, Tushar","last_name":"Gautam","first_name":"Tushar"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722"},{"full_name":"Toman, Viktor","last_name":"Toman","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor"}],"file":[{"checksum":"9d6dce7b611853c529bb7b1915ac579e","file_id":"10215","content_type":"application/pdf","file_size":2903485,"relation":"main_file","access_level":"open_access","success":1,"date_created":"2021-11-04T07:24:48Z","date_updated":"2021-11-04T07:24:48Z","creator":"cchlebak","file_name":"2021_ProcACMPL_Bui.pdf"}],"oa_version":"Published Version","issue":"OOPSLA","publication_status":"published","article_number":"164","intvolume":"         5","arxiv":1},{"supervisor":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","abstract":[{"lang":"eng","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."}],"ec_funded":1,"date_created":"2021-10-29T20:09:01Z","page":"166","OA_place":"publisher","_id":"10199","degree_awarded":"PhD","keyword":["concurrency","verification","model checking"],"acknowledged_ssus":[{"_id":"SSU"}],"ddc":["000"],"status":"public","oa":1,"month":"10","corr_author":"1","date_published":"2021-10-31T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"has_accepted_license":"1","date_updated":"2026-04-08T07:00:31Z","day":"31","file_date_updated":"2021-11-09T09:00:50Z","publication_identifier":{"issn":["2663-337X"]},"year":"2021","type":"dissertation","citation":{"short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.","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>","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>.","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>","ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021."},"title":"Improved verification techniques for concurrent systems","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"article_processing_charge":"No","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","author":[{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","last_name":"Toman"}],"file":[{"date_created":"2021-11-08T14:12:22Z","date_updated":"2021-11-08T14:12:22Z","creator":"vtoman","file_name":"toman_th_final.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"10225","file_size":2915234,"checksum":"4f412a1ee60952221b499a4b1268df35"},{"date_created":"2021-11-08T14:12:46Z","date_updated":"2021-11-09T09:00:50Z","creator":"vtoman","file_name":"toman_thesis.zip","checksum":"9584943f99127be2dd2963f6784c37d4","file_size":8616056,"file_id":"10226","content_type":"application/zip","relation":"source_file","access_level":"closed"}],"doi":"10.15479/at:ista:10199","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9987"},{"id":"10191","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"141"},{"id":"10190","status":"public","relation":"part_of_dissertation"}]}},{"related_material":{"link":[{"description":"Preprint","url":"https://doi.org/10.1101/2020.11.23.394171 ","relation":"earlier_version"}]},"pmid":1,"external_id":{"pmid":["34667153"],"isi":["000709050300016"]},"oa_version":"Published Version","author":[{"last_name":"Pradhan","full_name":"Pradhan, Saurabh J.","first_name":"Saurabh J."},{"first_name":"Puli Chandramouli","full_name":"Reddy, Puli Chandramouli","last_name":"Reddy"},{"full_name":"Smutny, Michael","orcid":"0000-0002-5920-9090","last_name":"Smutny","id":"3FE6E4E8-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"},{"first_name":"Ankita","last_name":"Sharma","full_name":"Sharma, Ankita"},{"first_name":"Keisuke","id":"3BED66BE-F248-11E8-B48F-1D18A9856A87","last_name":"Sako","orcid":"0000-0002-6453-8075","full_name":"Sako, Keisuke"},{"first_name":"Meghana S.","full_name":"Oak, Meghana S.","last_name":"Oak"},{"first_name":"Rini","last_name":"Shah","full_name":"Shah, Rini"},{"full_name":"Pal, Mrinmoy","last_name":"Pal","first_name":"Mrinmoy"},{"last_name":"Deshpande","full_name":"Deshpande, Ojas","first_name":"Ojas"},{"first_name":"Greg","last_name":"Dsilva","full_name":"Dsilva, Greg"},{"first_name":"Yin","full_name":"Tang, Yin","last_name":"Tang"},{"last_name":"Mishra","full_name":"Mishra, Rakesh","first_name":"Rakesh"},{"last_name":"Deshpande","full_name":"Deshpande, Girish","first_name":"Girish"},{"last_name":"Giraldez","full_name":"Giraldez, Antonio J.","first_name":"Antonio J."},{"last_name":"Sonawane","full_name":"Sonawane, Mahendra","first_name":"Mahendra"},{"full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"},{"full_name":"Galande, Sanjeev","last_name":"Galande","first_name":"Sanjeev"}],"file":[{"success":1,"date_updated":"2021-11-09T13:59:26Z","date_created":"2021-11-09T13:59:26Z","file_name":"2021_NatureComm_Pradhan.pdf","creator":"cziletti","checksum":"c40a69ae94435ecd3a30c9874a11ef2b","content_type":"application/pdf","file_size":7144437,"file_id":"10262","access_level":"open_access","relation":"main_file"}],"doi":"10.1038/s41467-021-26234-7","intvolume":"        12","issue":"1","article_number":"6094","publication_status":"published","title":"Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis","citation":{"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).","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.","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>.","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>","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.","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>","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>."},"volume":12,"article_processing_charge":"Yes","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"date_published":"2021-10-19T00:00:00Z","has_accepted_license":"1","department":[{"_id":"CaHe"}],"file_date_updated":"2021-11-09T13:59:26Z","day":"19","date_updated":"2026-04-02T11:57:41Z","year":"2021","publication_identifier":{"eissn":["2041-1723"]},"type":"journal_article","quality_controlled":"1","ddc":["570"],"month":"10","publication":"Nature Communications","oa":1,"status":"public","corr_author":"1","isi":1,"publisher":"Springer Nature","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."}],"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).","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"10202","scopus_import":"1","date_created":"2021-10-31T23:01:29Z"},{"intvolume":"        12","article_number":"6063","publication_status":"published","arxiv":1,"external_id":{"arxiv":["2103.16986"],"isi":["000708601800015"]},"oa_version":"Published Version","file":[{"date_created":"2021-11-03T11:31:24Z","success":1,"date_updated":"2021-11-03T11:31:24Z","file_name":"2021_NatComm_Sortino.pdf","creator":"cchlebak","content_type":"application/pdf","file_id":"10212","file_size":1434201,"relation":"main_file","access_level":"open_access","checksum":"8580d128389860f732028c521cd5949e"}],"author":[{"last_name":"Sortino","full_name":"Sortino, Luca","first_name":"Luca"},{"last_name":"Zotev","full_name":"Zotev, Panaiot G.","first_name":"Panaiot G."},{"first_name":"Catherine L.","full_name":"Phillips, Catherine L.","last_name":"Phillips"},{"last_name":"Brash","full_name":"Brash, Alistair J.","first_name":"Alistair J."},{"full_name":"Cambiasso, Javier","last_name":"Cambiasso","first_name":"Javier"},{"full_name":"Marensi, Elena","orcid":"0000-0001-7173-4923","last_name":"Marensi","id":"0BE7553A-1004-11EA-B805-18983DDC885E","first_name":"Elena"},{"last_name":"Fox","full_name":"Fox, A. Mark","first_name":"A. Mark"},{"last_name":"Maier","full_name":"Maier, Stefan A.","first_name":"Stefan A."},{"last_name":"Sapienza","full_name":"Sapienza, Riccardo","first_name":"Riccardo"},{"first_name":"Alexander I.","full_name":"Tartakovskii, Alexander I.","last_name":"Tartakovskii"}],"doi":"10.1038/s41467-021-26262-3","ddc":["530"],"quality_controlled":"1","oa":1,"status":"public","month":"10","publication":"Nature Communications","isi":1,"publisher":"Springer Nature","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.","abstract":[{"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.","lang":"eng"}],"article_type":"original","scopus_import":"1","date_created":"2021-10-31T23:01:30Z","_id":"10203","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"citation":{"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>","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>.","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>","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.","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.","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)."},"title":"Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas","volume":12,"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-10-18T00:00:00Z","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"BjHo"}],"day":"18","date_updated":"2023-08-14T08:12:12Z","file_date_updated":"2021-11-03T11:31:24Z","publication_identifier":{"eissn":["2041-1723"]},"year":"2021","type":"journal_article"},{"related_material":{"record":[{"id":"13234","relation":"extended_version","status":"public"}]},"external_id":{"arxiv":["2009.06429"],"isi":["000719383800003"]},"oa_version":"Preprint","author":[{"id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","first_name":"Anna","full_name":"Lukina, Anna","last_name":"Lukina"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","full_name":"Schilling, Christian","last_name":"Schilling","orcid":"0000-0003-3658-1065"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"doi":"10.1007/978-3-030-88494-9_3","publication_status":"published","alternative_title":["LNCS"],"arxiv":1,"citation":{"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.","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>","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>.","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>","short":"A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.","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.","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>."},"title":"Into the unknown: active monitoring of neural networks","volume":"12974 ","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"conference":{"name":"RV: Runtime Verification","end_date":"2021-10-14","location":"Virtual","start_date":"2021-10-11"},"article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/2009.06429","open_access":"1"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"date_published":"2021-10-06T00:00:00Z","department":[{"_id":"ToHe"}],"place":"Cham","date_updated":"2025-04-15T06:26:14Z","day":"06","publication_identifier":{"isbn":["9-783-0308-8493-2"],"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["978-3-030-88494-9"]},"year":"2021","type":"conference","quality_controlled":"1","oa":1,"status":"public","publication":"21st International Conference on Runtime Verification","month":"10","isi":1,"corr_author":"1","publisher":"Springer Nature","abstract":[{"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.","lang":"eng"}],"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.","ec_funded":1,"scopus_import":"1","date_created":"2021-10-31T23:01:31Z","page":"42-61","_id":"10206","keyword":["monitoring","neural networks","novelty detection"]},{"volume":209,"citation":{"short":"B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","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.","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>.","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>.","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>","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.","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>"},"title":"Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2021-10-08","name":"DISC: Distributed Computing","location":"Freiburg, Germany","start_date":"2021-10-04"},"article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"date_published":"2021-10-04T00:00:00Z","publication_identifier":{"isbn":["9-783-9597-7210-5"],"issn":["1868-8969"]},"type":"conference","year":"2021","date_updated":"2025-05-14T10:54:39Z","day":"04","file_date_updated":"2021-11-12T09:23:22Z","ddc":["000"],"quality_controlled":"1","status":"public","oa":1,"month":"10","publication":"35th International Symposium on Distributed Computing","abstract":[{"lang":"eng","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."}],"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","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":"1","date_created":"2021-11-07T23:01:23Z","_id":"10216","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2003.01697"]},"oa_version":"Published Version","doi":"10.4230/LIPIcs.DISC.2021.52","author":[{"orcid":"0000-0002-2742-4028","last_name":"Chatterjee","full_name":"Chatterjee, Bapi","first_name":"Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sathya","full_name":"Peri, Sathya","last_name":"Peri"},{"first_name":"Muktikanta","full_name":"Sa, Muktikanta","last_name":"Sa"}],"file":[{"date_updated":"2021-11-12T09:23:22Z","date_created":"2021-11-12T09:23:22Z","success":1,"file_name":"2021_LIPIcsDISC_BChatterjee.pdf","creator":"cchlebak","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":795860,"file_id":"10276","checksum":"76546df112a0ba1166c864d33d7834e2"}],"intvolume":"       209","publication_status":"published","article_number":"52","alternative_title":["LIPIcs"],"arxiv":1},{"alternative_title":["LIPIcs"],"publication_status":"published","article_number":"4","intvolume":"       209","doi":"10.4230/LIPIcs.DISC.2021.4","author":[{"orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rati","full_name":"Gelashvili, Rati","last_name":"Gelashvili"},{"id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi","full_name":"Nadiradze, Giorgi","orcid":"0000-0001-5634-0731","last_name":"Nadiradze"}],"file":[{"date_created":"2021-11-12T09:33:26Z","date_updated":"2021-11-12T09:33:26Z","success":1,"creator":"cchlebak","file_name":"2021_LIPIcsDISC_Alistarh.pdf","file_size":706791,"file_id":"10277","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"b4cdc6668c899a601c5e6a96b8ca54d9"}],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"10217","scopus_import":"1","date_created":"2021-11-07T23:01:23Z","ec_funded":1,"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.","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"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"10","publication":"35th International Symposium on Distributed Computing","oa":1,"status":"public","quality_controlled":"1","ddc":["000"],"publication_identifier":{"isbn":["9-783-9597-7210-5"],"issn":["1868-8969"]},"type":"conference","year":"2021","file_date_updated":"2021-11-12T09:33:26Z","date_updated":"2025-05-14T10:54:30Z","day":"04","department":[{"_id":"DaAl"}],"has_accepted_license":"1","date_published":"2021-10-04T00:00:00Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","conference":{"start_date":"2021-10-04","name":"DISC: Distributed Computing","end_date":"2021-10-08","location":"Freiburg, Germany"},"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"volume":209,"title":"Lower bounds for shared-memory leader election under bounded write contention","citation":{"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.","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>","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.","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>"}},{"alternative_title":["LIPIcs"],"article_number":"43","publication_status":"published","intvolume":"       209","arxiv":1,"external_id":{"arxiv":["2102.08808"]},"doi":"10.4230/LIPIcs.DISC.2021.43","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"},{"first_name":"Rati","full_name":"Gelashvili, Rati","last_name":"Gelashvili"},{"first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","last_name":"Rybicki","full_name":"Rybicki, Joel"}],"file":[{"file_size":534219,"content_type":"application/pdf","file_id":"10274","relation":"main_file","access_level":"open_access","checksum":"fd2a690f6856d21247e9aa952b0e2885","date_created":"2021-11-12T08:16:44Z","success":1,"date_updated":"2021-11-12T08:16:44Z","creator":"cchlebak","file_name":"2021_LIPIcsDISC_Alistarh.pdf"}],"oa_version":"Published Version","month":"10","publication":"35th International Symposium on Distributed Computing","status":"public","oa":1,"quality_controlled":"1","ddc":["000"],"_id":"10218","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"scopus_import":"1","date_created":"2021-11-07T23:01:24Z","ec_funded":1,"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.","abstract":[{"lang":"eng","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."}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","conference":{"start_date":"2021-10-04","location":"Freiburg, Germany","name":"DISC: Distributed Computing ","end_date":"2021-10-08"},"project":[{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"840605","name":"Coordination in constrained and natural distributed systems"}],"volume":209,"title":"Brief announcement: Fast graphical population protocols","citation":{"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.","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.","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>","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>.","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>"},"publication_identifier":{"issn":["1868-8969"],"isbn":["9-783-9597-7210-5"]},"year":"2021","type":"conference","file_date_updated":"2021-11-12T08:16:44Z","date_updated":"2025-04-14T07:50:55Z","day":"04","has_accepted_license":"1","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"date_published":"2021-10-04T00:00:00Z"},{"quality_controlled":"1","ddc":["000"],"publication":"35th International Symposium on Distributed Computing","month":"10","oa":1,"status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ec_funded":1,"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","abstract":[{"lang":"eng","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)."}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"10219","scopus_import":"1","date_created":"2021-11-07T23:01:24Z","title":"Brief announcement: Sinkless orientation is hard also in the supported LOCAL model","citation":{"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.","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.","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>","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.","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>","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>."},"project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"volume":209,"article_processing_charge":"No","conference":{"start_date":"2021-10-04","location":"Freiburg, Germany","end_date":"2021-10-08","name":"DISC: Distributed Computing "},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_published":"2021-10-04T00:00:00Z","has_accepted_license":"1","department":[{"_id":"DaAl"}],"file_date_updated":"2021-11-12T08:27:42Z","date_updated":"2025-05-14T10:54:13Z","day":"04","publication_identifier":{"isbn":["9-783-9597-7210-5"],"issn":["1868-8969"]},"year":"2021","type":"conference","intvolume":"       209","alternative_title":["LIPIcs"],"article_number":"58","publication_status":"published","arxiv":1,"external_id":{"arxiv":["2108.02655"]},"oa_version":"Published Version","file":[{"date_created":"2021-11-12T08:27:42Z","date_updated":"2021-11-12T08:27:42Z","success":1,"creator":"cchlebak","file_name":"2021_LIPIcsDISC_Korhonen.pdf","relation":"main_file","access_level":"open_access","file_id":"10275","file_size":474242,"content_type":"application/pdf","checksum":"c43188dc2070bbd2bf5fd6fdaf9ce36d"}],"author":[{"first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen","full_name":"Korhonen, Janne"},{"first_name":"Ami","full_name":"Paz, Ami","last_name":"Paz"},{"full_name":"Rybicki, Joel","last_name":"Rybicki","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"full_name":"Suomela, Jukka","last_name":"Suomela","first_name":"Jukka"}],"doi":"10.4230/LIPIcs.DISC.2021.58"},{"isi":1,"corr_author":"1","oa":1,"status":"public","month":"10","publication":"Israel Journal of Mathematics","quality_controlled":"1","date_created":"2021-11-07T23:01:24Z","scopus_import":"1","page":"501–534 ","_id":"10220","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.","article_type":"original","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."}],"publisher":"Springer Nature","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"url":"https://arxiv.org/abs/1511.03501","open_access":"1"}],"article_processing_charge":"No","volume":245,"project":[{"_id":"26611F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory"}],"citation":{"short":"S. Avvakumov, I. Mabillard, A.B. Skopenkov, U. Wagner, Israel Journal of Mathematics 245 (2021) 501–534.","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>.","ista":"Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. 2021. Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. 245, 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>.","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.","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>"},"title":"Eliminating higher-multiplicity intersections. III. Codimension 2","type":"journal_article","year":"2021","publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"day":"30","date_updated":"2025-07-02T10:54:52Z","department":[{"_id":"UlWa"}],"date_published":"2021-10-30T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published","intvolume":"       245","arxiv":1,"external_id":{"isi":["000712942100013"],"arxiv":["1511.03501"]},"related_material":{"record":[{"id":"9308","status":"public","relation":"earlier_version"},{"status":"public","relation":"earlier_version","id":"8183"}]},"doi":"10.1007/s11856-021-2216-z","author":[{"full_name":"Avvakumov, Sergey","orcid":"0000-0002-7840-5062","last_name":"Avvakumov","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey"},{"last_name":"Mabillard","full_name":"Mabillard, Isaac","first_name":"Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arkadiy B.","full_name":"Skopenkov, Arkadiy B.","last_name":"Skopenkov"},{"last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Preprint"},{"author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio","full_name":"Cipolloni, Giorgio","orcid":"0000-0002-4901-7992","last_name":"Cipolloni"},{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder"}],"file":[{"content_type":"application/pdf","file_size":841426,"file_id":"10715","relation":"main_file","access_level":"open_access","checksum":"a2c7b6f5d23b5453cd70d1261272283b","creator":"cchlebak","file_name":"2021_CommunMathPhys_Cipolloni.pdf","date_created":"2022-02-02T10:19:55Z","success":1,"date_updated":"2022-02-02T10:19:55Z"}],"doi":"10.1007/s00220-021-04239-z","oa_version":"Published Version","external_id":{"isi":["000712232700001"],"arxiv":["2012.13215"]},"arxiv":1,"issue":"2","publication_status":"published","intvolume":"       388","file_date_updated":"2022-02-02T10:19:55Z","date_updated":"2025-04-15T06:53:08Z","day":"29","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"type":"journal_article","year":"2021","date_published":"2021-10-29T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Eigenstate thermalization hypothesis for Wigner matrices","citation":{"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>.","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>","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.","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>","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Communications in Mathematical Physics 388 (2021) 1005–1048.","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>.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2021. Eigenstate thermalization hypothesis for Wigner matrices. Communications in Mathematical Physics. 388(2), 1005–1048."},"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"volume":388,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"10221","scopus_import":"1","date_created":"2021-11-07T23:01:25Z","page":"1005–1048","publisher":"Springer Nature","article_type":"original","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","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"}],"month":"10","publication":"Communications in Mathematical Physics","oa":1,"status":"public","corr_author":"1","isi":1,"quality_controlled":"1","ddc":["510"]},{"external_id":{"pmid":["34707283"],"isi":["000713338100006"]},"pmid":1,"related_material":{"record":[{"id":"10095","status":"public","relation":"earlier_version"}],"link":[{"description":"News on IST Webpage","relation":"press_release","url":"https://ist.ac.at/en/news/stop-and-grow/"}]},"doi":"10.1038/s41586-021-04037-6","author":[{"first_name":"Lanxin","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","last_name":"Li","orcid":"0000-0002-5607-272X","full_name":"Li, Lanxin"},{"first_name":"Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge"},{"last_name":"Roosjen","full_name":"Roosjen, Mark","first_name":"Mark"},{"first_name":"Koji","full_name":"Takahashi, Koji","last_name":"Takahashi"},{"orcid":"0000-0002-7244-7237","last_name":"Rodriguez Solovey","full_name":"Rodriguez Solovey, Lesia","first_name":"Lesia","id":"3922B506-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Merrin, Jack","last_name":"Merrin","orcid":"0000-0001-5145-4609","id":"4515C308-F248-11E8-B48F-1D18A9856A87","first_name":"Jack"},{"first_name":"Jian","last_name":"Chen","full_name":"Chen, Jian"},{"full_name":"Shabala, Lana","last_name":"Shabala","first_name":"Lana"},{"first_name":"Wouter","full_name":"Smet, Wouter","last_name":"Smet"},{"first_name":"Hong","full_name":"Ren, Hong","last_name":"Ren"},{"first_name":"Steffen","full_name":"Vanneste, Steffen","last_name":"Vanneste"},{"first_name":"Sergey","last_name":"Shabala","full_name":"Shabala, Sergey"},{"last_name":"De Rybel","full_name":"De Rybel, Bert","first_name":"Bert"},{"first_name":"Dolf","full_name":"Weijers, Dolf","last_name":"Weijers"},{"last_name":"Kinoshita","full_name":"Kinoshita, Toshinori","first_name":"Toshinori"},{"full_name":"Gray, William M.","last_name":"Gray","first_name":"William M."},{"full_name":"Friml, Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří"}],"oa_version":"Preprint","issue":"7884","publication_status":"published","intvolume":"       599","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://www.doi.org/10.21203/rs.3.rs-266395/v3"}],"project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","grant_number":"742985","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425"},{"_id":"26538374-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I03630","name":"Molecular mechanisms of endocytic cargo recognition in plants"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"},{"name":"A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root","grant_number":"25351","_id":"26B4D67E-B435-11E9-9278-68D0E5697425"}],"volume":599,"title":"Cell surface and intracellular auxin signalling for H<sup>+</sup> fluxes in root growth","citation":{"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.","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.","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>.","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>.","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.","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>","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>"},"publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"year":"2021","type":"journal_article","day":"11","date_updated":"2025-07-10T11:49:46Z","department":[{"_id":"JiFr"},{"_id":"NanoFab"}],"date_published":"2021-11-11T00:00:00Z","language":[{"iso":"eng"}],"corr_author":"1","isi":1,"month":"11","publication":"Nature","status":"public","oa":1,"quality_controlled":"1","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"M-Shop"},{"_id":"Bio"}],"keyword":["Multidisciplinary"],"_id":"10223","page":"273-277","scopus_import":"1","date_created":"2021-11-07T23:01:25Z","ec_funded":1,"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.","abstract":[{"lang":"eng","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."}],"article_type":"original","publisher":"Springer Nature"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"10224","page":"1835–1906","scopus_import":"1","date_created":"2021-11-07T23:01:26Z","ec_funded":1,"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).","article_type":"original","abstract":[{"lang":"eng","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."}],"publisher":"Springer Nature","isi":1,"publication":"Archive for Rational Mechanics and Analysis","month":"10","oa":1,"status":"public","quality_controlled":"1","ddc":["530"],"publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"type":"journal_article","year":"2021","file_date_updated":"2021-12-14T08:35:42Z","day":"25","date_updated":"2025-04-14T09:11:09Z","has_accepted_license":"1","department":[{"_id":"RoSe"}],"date_published":"2021-10-25T00:00:00Z","language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"Yes (via OA deal)","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"volume":242,"title":"The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics","citation":{"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>","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>.","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.","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>","short":"D. Feliciangeli, R. Seiringer, Archive for Rational Mechanics and Analysis 242 (2021) 1835–1906.","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.","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>."},"arxiv":1,"issue":"3","publication_status":"published","intvolume":"       242","doi":"10.1007/s00205-021-01715-7","author":[{"id":"41A639AA-F248-11E8-B48F-1D18A9856A87","first_name":"Dario","full_name":"Feliciangeli, Dario","orcid":"0000-0003-0754-8530","last_name":"Feliciangeli"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"file":[{"checksum":"672e9c21b20f1a50854b7c821edbb92f","file_size":990529,"file_id":"10544","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"2021_Springer_Feliciangeli.pdf","creator":"alisjak","date_updated":"2021-12-14T08:35:42Z","success":1,"date_created":"2021-12-14T08:35:42Z"}],"oa_version":"Published Version","external_id":{"isi":["000710850600001"],"arxiv":["2101.12566"]},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"9787"}]}},{"pmid":1,"external_id":{"pmid":["34647246"]},"oa_version":"None","doi":"10.1007/978-1-0716-1677-2_2","author":[{"last_name":"Zhang","orcid":"0000-0003-2627-6956","full_name":"Zhang, Yuzhou","first_name":"Yuzhou","id":"3B6137F2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Li, Lanxin","orcid":"0000-0002-5607-272X","last_name":"Li","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","first_name":"Lanxin"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jiří","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"      2368","alternative_title":["Methods in Molecular Biology"],"publication_status":"published","project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"I03630","name":"Molecular mechanisms of endocytic cargo recognition in plants","_id":"26538374-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"volume":2368,"title":"Evaluation of gravitropism in non-seed plants","citation":{"ista":"Zhang Y, Li L, Friml J. 2021.Evaluation of gravitropism in non-seed plants. In: Plant Gravitropism. Methods in Molecular Biology, vol. 2368, 43–51.","mla":"Zhang, Yuzhou, et al. “Evaluation of Gravitropism in Non-Seed Plants.” <i>Plant Gravitropism</i>, edited by Elison B Blancaflor, vol. 2368, Springer Nature, 2021, pp. 43–51, doi:<a href=\"https://doi.org/10.1007/978-1-0716-1677-2_2\">10.1007/978-1-0716-1677-2_2</a>.","short":"Y. Zhang, L. Li, J. Friml, in:, E.B. Blancaflor (Ed.), Plant Gravitropism, Springer Nature, 2021, pp. 43–51.","chicago":"Zhang, Yuzhou, Lanxin Li, and Jiří Friml. “Evaluation of Gravitropism in Non-Seed Plants.” In <i>Plant Gravitropism</i>, edited by Elison B Blancaflor, 2368:43–51. MIMB. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-1-0716-1677-2_2\">https://doi.org/10.1007/978-1-0716-1677-2_2</a>.","apa":"Zhang, Y., Li, L., &#38; Friml, J. (2021). Evaluation of gravitropism in non-seed plants. In E. B. Blancaflor (Ed.), <i>Plant Gravitropism</i> (Vol. 2368, pp. 43–51). Springer Nature. <a href=\"https://doi.org/10.1007/978-1-0716-1677-2_2\">https://doi.org/10.1007/978-1-0716-1677-2_2</a>","ieee":"Y. Zhang, L. Li, and J. Friml, “Evaluation of gravitropism in non-seed plants,” in <i>Plant Gravitropism</i>, vol. 2368, E. B. Blancaflor, Ed. Springer Nature, 2021, pp. 43–51.","ama":"Zhang Y, Li L, Friml J. Evaluation of gravitropism in non-seed plants. In: Blancaflor EB, ed. <i>Plant Gravitropism</i>. Vol 2368. MIMB. Springer Nature; 2021:43-51. doi:<a href=\"https://doi.org/10.1007/978-1-0716-1677-2_2\">10.1007/978-1-0716-1677-2_2</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"date_published":"2021-10-14T00:00:00Z","year":"2021","publication_identifier":{"isbn":["978-1-0716-1676-5"],"eisbn":["978-1-0716-1677-2"]},"type":"book_chapter","day":"14","date_updated":"2025-04-14T07:45:00Z","quality_controlled":"1","corr_author":"1","month":"10","series_title":"MIMB","publication":"Plant Gravitropism","status":"public","ec_funded":1,"acknowledgement":"The Ceratopteris richardii spores were obtained from the lab of Jo Ann Banks at Purdue University. This work was supported by funding from the European Union’s Horizon 2020 research and innovation program (ERC grant agreement number 742985), Austrian Science Fund (FWF, grant number I 3630-B25), IST Fellow program and DOC Fellowship of the Austrian Academy of Sciences.","abstract":[{"text":"Tropisms are among the most important growth responses for plant adaptation to the surrounding environment. One of the most common tropisms is root gravitropism. Root gravitropism enables the plant to anchor securely to the soil enabling the absorption of water and nutrients. Most of the knowledge related to the plant gravitropism has been acquired from the flowering plants, due to limited research in non-seed plants. Limited research on non-seed plants is due in large part to the lack of standard research methods. Here, we describe the experimental methods to evaluate gravitropism in representative non-seed plant species, including the non-vascular plant moss Physcomitrium patens, the early diverging extant vascular plant lycophyte Selaginella moellendorffii and fern Ceratopteris richardii. In addition, we introduce the methods used for statistical analysis of the root gravitropism in non-seed plant species.","lang":"eng"}],"publisher":"Springer Nature","editor":[{"full_name":"Blancaflor, Elison B","last_name":"Blancaflor","first_name":"Elison B"}],"_id":"10267","page":"43-51","date_created":"2021-11-11T09:26:10Z","scopus_import":"1"}]