[{"day":"01","year":"2017","has_accepted_license":"1","date_created":"2019-06-04T12:42:43Z","date_published":"2017-08-01T00:00:00Z","doi":"10.4230/LIPICS.CSL.2017.18","oa":1,"publisher":"Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.","mla":"Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18"},"title":"Improved set-based symbolic algorithms for parity games","article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Dvorák, Wolfgang","last_name":"Dvorák","first_name":"Wolfgang"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Veronika","full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer"}],"article_number":"18","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"language":[{"iso":"eng"}],"file":[{"file_id":"6520","checksum":"7c2c9d09970af79026d7e37d9b632ef8","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-06-04T12:56:52Z","file_name":"2017_LIPIcs-Chatterjee.pdf","date_updated":"2020-07-14T12:47:33Z","file_size":710185,"creator":"kschuh"}],"publication_status":"published","license":"https://creativecommons.org/licenses/by/3.0/","ec_funded":1,"volume":82,"oa_version":"Published Version","abstract":[{"text":"Graph games with omega-regular winning conditions provide a mathematical framework to analyze a wide range of problems in the analysis of reactive systems and programs (such as the synthesis of reactive systems, program repair, and the verification of branching time properties). Parity conditions are canonical forms to specify omega-regular winning conditions. Graph games with parity conditions are equivalent to mu-calculus model checking, and thus a very important algorithmic problem. Symbolic algorithms are of great significance because they provide scalable algorithms for the analysis of large finite-state systems, as well as algorithms for the analysis of infinite-state systems with finite quotient. A set-based symbolic algorithm uses the basic set operations and the one-step predecessor operators. We consider graph games with n vertices and parity conditions with c priorities (equivalently, a mu-calculus formula with c alternations of least and greatest fixed points). While many explicit algorithms exist for graph games with parity conditions, for set-based symbolic algorithms there are only two algorithms (notice that we use space to refer to the number of sets stored by a symbolic algorithm): (a) the basic algorithm that requires O(n^c) symbolic operations and linear space; and (b) an improved algorithm that requires O(n^{c/2+1}) symbolic operations but also O(n^{c/2+1}) space (i.e., exponential space). In this work we present two set-based symbolic algorithms for parity games: (a) our first algorithm requires O(n^{c/2+1}) symbolic operations and only requires linear space; and (b) developing on our first algorithm, we present an algorithm that requires O(n^{c/3+1}) symbolic operations and only linear space. We also present the first linear space set-based symbolic algorithm for parity games that requires at most a sub-exponential number of symbolic operations. ","lang":"eng"}],"intvolume":" 82","month":"08","scopus_import":"1","ddc":["004"],"date_updated":"2023-02-14T10:08:25Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:33Z","_id":"6519","status":"public","conference":{"name":"CSL: Conference on Computer Science Logic","end_date":"2017-08-24","location":"Stockholm, Sweden","start_date":"2017-08-20"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference"},{"article_number":"34","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281","name":"Eliminating intersections in drawings of graphs"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.","chicago":"Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,” Vol. 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ISAAC.2017.34.","apa":"Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2017.34","ama":"Fulek R. Embedding graphs into embedded graphs. In: Vol 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ISAAC.2017.34","ieee":"R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.","short":"R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34."},"title":"Embedding graphs into embedded graphs","author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","last_name":"Fulek"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"day":"01","has_accepted_license":"1","year":"2017","date_published":"2017-12-01T00:00:00Z","doi":"10.4230/LIPICS.ISAAC.2017.34","date_created":"2019-06-04T12:11:52Z","_id":"6517","status":"public","type":"conference","conference":{"name":"ISAAC: International Symposium on Algorithms and Computation","location":"Phuket, Thailand","end_date":"2017-12-22","start_date":"2017-12-09"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["510"],"date_updated":"2021-01-12T08:07:51Z","file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"UlWa"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A (possibly degenerate) drawing of a graph G in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a drawing of a planar graph G in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class, i.e., the rotation system (or equivalently the faces) of the embedding of G and the choice of outer face are fixed. In other words, we show that c-planarity with embedded pipes is tractable for graphs with fixed embeddings. To the best of our knowledge an analogous result was previously known essentially only when G is a cycle."}],"month":"12","intvolume":" 92","scopus_import":1,"file":[{"file_id":"6518","checksum":"fc7a643e29621c8bbe49d36b39081f31","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2017_LIPIcs-Fulek.pdf","date_created":"2019-06-04T12:20:35Z","file_size":588982,"date_updated":"2020-07-14T12:47:33Z","creator":"kschuh"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":92,"ec_funded":1},{"_id":"652","article_number":"7846789","conference":{"name":"ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics ","location":"Cergy-Pontoise, France","end_date":"2016-09-22","start_date":"2016-09-19"},"type":"conference","status":"public","date_updated":"2021-01-12T08:07:51Z","citation":{"ista":"Der R, Martius GS. 2017. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , 7846789.","chicago":"Der, Ralf, and Georg S Martius. “Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots.” IEEE, 2017. https://doi.org/10.1109/DEVLRN.2016.7846789.","short":"R. Der, G.S. Martius, in:, IEEE, 2017.","ieee":"R. Der and G. S. Martius, “Dynamical self consistency leads to behavioral development and emergent social interactions in robots,” presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France, 2017.","apa":"Der, R., & Martius, G. S. (2017). Dynamical self consistency leads to behavioral development and emergent social interactions in robots. Presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France: IEEE. https://doi.org/10.1109/DEVLRN.2016.7846789","ama":"Der R, Martius GS. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. In: IEEE; 2017. doi:10.1109/DEVLRN.2016.7846789","mla":"Der, Ralf, and Georg S. Martius. Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots. 7846789, IEEE, 2017, doi:10.1109/DEVLRN.2016.7846789."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Der, Ralf","last_name":"Der","first_name":"Ralf"},{"last_name":"Martius","full_name":"Martius, Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","first_name":"Georg S"}],"publist_id":"7100","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"title":"Dynamical self consistency leads to behavioral development and emergent social interactions in robots","abstract":[{"text":"We present an approach that enables robots to self-organize their sensorimotor behavior from scratch without providing specific information about neither the robot nor its environment. This is achieved by a simple neural control law that increases the consistency between external sensor dynamics and internal neural dynamics of the utterly simple controller. In this way, the embodiment and the agent-environment coupling are the only source of individual development. We show how an anthropomorphic tendon driven arm-shoulder system develops different behaviors depending on that coupling. For instance: Given a bottle half-filled with water, the arm starts to shake it, driven by the physical response of the water. When attaching a brush, the arm can be manipulated into wiping a table, and when connected to a revolvable wheel it finds out how to rotate it. Thus, the robot may be said to discover the affordances of the world. When allowing two (simulated) humanoid robots to interact physically, they engage into a joint behavior development leading to, for instance, spontaneous cooperation. More social effects are observed if the robots can visually perceive each other. Although, as an observer, it is tempting to attribute an apparent intentionality, there is nothing of the kind put in. As a conclusion, we argue that emergent behavior may be much less rooted in explicit intentions, internal motivations, or specific reward systems than is commonly believed.","lang":"eng"}],"oa_version":"None","publisher":"IEEE","quality_controlled":"1","scopus_import":1,"month":"02","publication_status":"published","year":"2017","publication_identifier":{"isbn":["978-150905069-7"]},"language":[{"iso":"eng"}],"day":"07","date_created":"2018-12-11T11:47:43Z","doi":"10.1109/DEVLRN.2016.7846789","date_published":"2017-02-07T00:00:00Z"},{"intvolume":" 541","month":"01","quality_controlled":"1","scopus_import":1,"publisher":"Nature Publishing Group","oa_version":"None","abstract":[{"text":"Superhydrophobic surfaces reduce the frictional drag between water and solid materials, but this effect is often temporary. The realization of sustained drag reduction has applications for water vehicles and pipeline flows.\r\n\r\n","lang":"eng"}],"date_created":"2018-12-11T11:47:43Z","date_published":"2017-01-11T00:00:00Z","volume":541,"doi":"10.1038/541161a","issue":"7636","page":"161 - 162","language":[{"iso":"eng"}],"publication":"Nature","day":"11","year":"2017","publication_status":"published","publication_identifier":{"issn":["00280836"]},"status":"public","type":"journal_article","_id":"651","department":[{"_id":"BjHo"}],"title":"Fluid dynamics: Water flows out of touch","publist_id":"7116","author":[{"last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:07:49Z","citation":{"short":"B. Hof, Nature 541 (2017) 161–162.","ieee":"B. Hof, “Fluid dynamics: Water flows out of touch,” Nature, vol. 541, no. 7636. Nature Publishing Group, pp. 161–162, 2017.","apa":"Hof, B. (2017). Fluid dynamics: Water flows out of touch. Nature. Nature Publishing Group. https://doi.org/10.1038/541161a","ama":"Hof B. Fluid dynamics: Water flows out of touch. Nature. 2017;541(7636):161-162. doi:10.1038/541161a","mla":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature, vol. 541, no. 7636, Nature Publishing Group, 2017, pp. 161–62, doi:10.1038/541161a.","ista":"Hof B. 2017. Fluid dynamics: Water flows out of touch. Nature. 541(7636), 161–162.","chicago":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature. Nature Publishing Group, 2017. https://doi.org/10.1038/541161a."}},{"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764.","short":"A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.","ieee":"A. Makohon Moore et al., “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” Nature Genetics, vol. 49, no. 3. Nature Publishing Group, pp. 358–366, 2017.","apa":"Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. Nature Publishing Group. https://doi.org/10.1038/ng.3764","ama":"Makohon Moore A, Zhang M, Reiter J, et al. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 2017;49(3):358-366. doi:10.1038/ng.3764","chicago":"Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics. Nature Publishing Group, 2017. https://doi.org/10.1038/ng.3764.","ista":"Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366."},"title":"Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer","external_id":{"pmid":["28092682"]},"article_processing_charge":"No","author":[{"first_name":"Alvin","full_name":"Makohon Moore, Alvin","last_name":"Makohon Moore"},{"first_name":"Ming","full_name":"Zhang, Ming","last_name":"Zhang"},{"full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353","last_name":"Reiter","first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Božić","full_name":"Božić, Ivana","first_name":"Ivana"},{"first_name":"Benjamin","last_name":"Allen","full_name":"Allen, Benjamin"},{"last_name":"Kundu","full_name":"Kundu, Deepanjan","id":"1d4c0f4f-e8a3-11ec-a351-e36772758c45","first_name":"Deepanjan"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Fay","last_name":"Wong","full_name":"Wong, Fay"},{"last_name":"Jiao","full_name":"Jiao, Yuchen","first_name":"Yuchen"},{"full_name":"Kohutek, Zachary","last_name":"Kohutek","first_name":"Zachary"},{"full_name":"Hong, Jungeui","last_name":"Hong","first_name":"Jungeui"},{"first_name":"Marc","full_name":"Attiyeh, Marc","last_name":"Attiyeh"},{"full_name":"Javier, Breanna","last_name":"Javier","first_name":"Breanna"},{"last_name":"Wood","full_name":"Wood, Laura","first_name":"Laura"},{"first_name":"Ralph","last_name":"Hruban","full_name":"Hruban, Ralph"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"},{"first_name":"Nickolas","full_name":"Papadopoulos, Nickolas","last_name":"Papadopoulos"},{"first_name":"Kenneth","last_name":"Kinzler","full_name":"Kinzler, Kenneth"},{"first_name":"Bert","full_name":"Vogelstein, Bert","last_name":"Vogelstein"},{"first_name":"Christine","last_name":"Iacobuzio Donahue","full_name":"Iacobuzio Donahue, Christine"}],"publist_id":"7092","acknowledgement":"We thank the Memorial Sloan Kettering Cancer Center Molecular Cytology core facility for immunohistochemistry staining. This work was supported by Office of Naval Research grant N00014-16-1-2914, the Bill and Melinda Gates Foundation (OPP1148627), and a gift from B. Wu and E. Larson (M.A.N.), National Institutes of Health grants CA179991 (C.A.I.-D. and I.B.), F31 CA180682 (A.P.M.-M.), CA43460 (B.V.), and P50 CA62924, the Monastra Foundation, the Virginia and D.K. Ludwig Fund for Cancer Research, the Lustgarten Foundation for Pancreatic Cancer Research, the Sol Goldman Center for Pancreatic Cancer Research, the Sol Goldman Sequencing Center, ERC Start grant 279307: Graph Games (J.G.R., D.K., and C.K.), Austrian Science Fund (FWF) grant P23499-N23 (J.G.R., D.K., and C.K.), and FWF NFN grant S11407-N23 RiSE/SHiNE (J.G.R., D.K., and C.K.).","oa":1,"publisher":"Nature Publishing Group","quality_controlled":"1","publication":"Nature Genetics","day":"01","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:47:43Z","doi":"10.1038/ng.3764","date_published":"2017-03-01T00:00:00Z","page":"358 - 366","_id":"653","status":"public","article_type":"original","type":"journal_article","ddc":["000"],"date_updated":"2022-06-10T09:55:08Z","file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"KrCh"}],"pmid":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The extent of heterogeneity among driver gene mutations present in naturally occurring metastases - that is, treatment-naive metastatic disease - is largely unknown. To address this issue, we carried out 60× whole-genome sequencing of 26 metastases from four patients with pancreatic cancer. We found that identical mutations in known driver genes were present in every metastatic lesion for each patient studied. Passenger gene mutations, which do not have known or predicted functional consequences, accounted for all intratumoral heterogeneity. Even with respect to these passenger mutations, our analysis suggests that the genetic similarity among the founding cells of metastases was higher than that expected for any two cells randomly taken from a normal tissue. The uniformity of known driver gene mutations among metastases in the same patient has critical and encouraging implications for the success of future targeted therapies in advanced-stage disease."}],"intvolume":" 49","month":"03","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"date_created":"2019-11-19T08:13:50Z","file_name":"2017_NatureGenetics_Makohon.pdf","date_updated":"2020-07-14T12:47:33Z","file_size":908099,"creator":"dernst","checksum":"e442dc3b7420a36ec805e9bb45cc1a2e","file_id":"7050","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"issn":["10614036"]},"ec_funded":1,"volume":49,"issue":"3"},{"author":[{"full_name":"Alwen, Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F"},{"last_name":"Blocki","full_name":"Blocki, Jeremiah","first_name":"Jeremiah"},{"first_name":"Ben","last_name":"Harsha","full_name":"Harsha, Ben"}],"department":[{"_id":"KrPi"}],"title":"Practical graphs for optimal side-channel resistant memory-hard functions","date_updated":"2021-01-12T08:07:53Z","citation":{"apa":"Alwen, J. F., Blocki, J., & Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1001–1017). Dallas, TX, USA: ACM Press. https://doi.org/10.1145/3133956.3134031","ama":"Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM Press; 2017:1001-1017. doi:10.1145/3133956.3134031","short":"J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.","ieee":"J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA, 2017, pp. 1001–1017.","mla":"Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–17, doi:10.1145/3133956.3134031.","ista":"Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1001–1017.","chicago":"Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 1001–17. ACM Press, 2017. https://doi.org/10.1145/3133956.3134031."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","conference":{"start_date":"2017-10-30","end_date":"2017-11-03","location":"Dallas, TX, USA","name":"CCS: Conference on Computer and Communications Security"},"status":"public","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"_id":"6527","page":"1001-1017","doi":"10.1145/3133956.3134031","date_published":"2017-10-30T00:00:00Z","date_created":"2019-06-06T13:21:29Z","ec_funded":1,"publication_identifier":{"isbn":["9781450349468"]},"publication_status":"published","year":"2017","day":"30","language":[{"iso":"eng"}],"publication":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","publisher":"ACM Press","quality_controlled":"1","scopus_import":1,"main_file_link":[{"url":"https://eprint.iacr.org/2017/443","open_access":"1"}],"oa":1,"month":"10","abstract":[{"text":"A memory-hard function (MHF) ƒn with parameter n can be computed in sequential time and space n. Simultaneously, a high amortized parallel area-time complexity (aAT) is incurred per evaluation. In practice, MHFs are used to limit the rate at which an adversary (using a custom computational device) can evaluate a security sensitive function that still occasionally needs to be evaluated by honest users (using an off-the-shelf general purpose device). The most prevalent examples of such sensitive functions are Key Derivation Functions (KDFs) and password hashing algorithms where rate limits help mitigate off-line dictionary attacks. As the honest users' inputs to these functions are often (low-entropy) passwords special attention is given to a class of side-channel resistant MHFs called iMHFs.\r\n\r\nEssentially all iMHFs can be viewed as some mode of operation (making n calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial property of a DAG has been identified (called \"depth-robustness\") which results in good provable security for an iMHF based on that DAG. Depth-robust DAGs have also proven useful in other cryptographic applications. Unfortunately, up till now, all known very depth-robust DAGs are impractically complicated and little is known about their exact (i.e. non-asymptotic) depth-robustness both in theory and in practice.\r\n\r\nIn this work we build and analyze (both formally and empirically) several exceedingly simple and efficient to navigate practical DAGs for use in iMHFs and other applications. For each DAG we:\r\n*Prove that their depth-robustness is asymptotically maximal.\r\n*Prove bounds of at least 3 orders of magnitude better on their exact depth-robustness compared to known bounds for other practical iMHF.\r\n*Implement and empirically evaluate their depth-robustness and aAT against a variety of state-of-the art (and several new) depth-reduction and low aAT attacks. \r\nWe find that, against all attacks, the new DAGs perform significantly better in practice than Argon2i, the most widely deployed iMHF in practice.\r\n\r\nAlong the way we also improve the best known empirical attacks on the aAT of Argon2i by implementing and testing several heuristic versions of a (hitherto purely theoretical) depth-reduction attack. Finally, we demonstrate practicality of our constructions by modifying the Argon2i code base to use one of the new high aAT DAGs. Experimental benchmarks on a standard off-the-shelf CPU show that the new modifications do not adversely affect the impressive throughput of Argon2i (despite seemingly enjoying significantly higher aAT).\r\n","lang":"eng"}],"oa_version":"Submitted Version"},{"page":"733 - 736","date_created":"2018-12-11T11:47:44Z","doi":"10.1242/dev.144915","date_published":"2017-03-01T00:00:00Z","year":"2017","has_accepted_license":"1","publication":"Development","day":"01","oa":1,"publisher":"Company of Biologists","quality_controlled":"1","publist_id":"7089","author":[{"orcid":"0000-0003-4509-4998","full_name":"Kicheva, Anna","last_name":"Kicheva","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","first_name":"Anna"},{"first_name":"Nicolas","last_name":"Rivron","full_name":"Rivron, Nicolas"}],"title":"Creating to understand – developmental biology meets engineering in Paris","citation":{"short":"A. Kicheva, N. Rivron, Development 144 (2017) 733–736.","ieee":"A. Kicheva and N. Rivron, “Creating to understand – developmental biology meets engineering in Paris,” Development, vol. 144, no. 5. Company of Biologists, pp. 733–736, 2017.","apa":"Kicheva, A., & Rivron, N. (2017). Creating to understand – developmental biology meets engineering in Paris. Development. Company of Biologists. https://doi.org/10.1242/dev.144915","ama":"Kicheva A, Rivron N. Creating to understand – developmental biology meets engineering in Paris. Development. 2017;144(5):733-736. doi:10.1242/dev.144915","mla":"Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental Biology Meets Engineering in Paris.” Development, vol. 144, no. 5, Company of Biologists, 2017, pp. 733–36, doi:10.1242/dev.144915.","ista":"Kicheva A, Rivron N. 2017. Creating to understand – developmental biology meets engineering in Paris. Development. 144(5), 733–736.","chicago":"Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental Biology Meets Engineering in Paris.” Development. Company of Biologists, 2017. https://doi.org/10.1242/dev.144915."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"B6FC0238-B512-11E9-945C-1524E6697425","call_identifier":"H2020","grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord"}],"ec_funded":1,"volume":144,"issue":"5","publication_status":"published","publication_identifier":{"issn":["09501991"]},"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2018-987-v1+1_2017_KichevaRivron__Creating_to.pdf","date_created":"2018-12-12T10:15:20Z","creator":"system","file_size":228206,"date_updated":"2020-07-14T12:47:33Z","checksum":"eef22a0f42a55b232cb2d1188a2322cb","file_id":"5139","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"scopus_import":1,"intvolume":" 144","month":"03","abstract":[{"text":"In November 2016, developmental biologists, synthetic biologists and engineers gathered in Paris for a meeting called ‘Engineering the embryo’. The participants shared an interest in exploring how synthetic systems can reveal new principles of embryonic development, and how the in vitro manipulation and modeling of development using stem cells can be used to integrate ideas and expertise from physics, developmental biology and tissue engineering. As we review here, the conference pinpointed some of the challenges arising at the intersection of these fields, along with great enthusiasm for finding new approaches and collaborations.","lang":"eng"}],"oa_version":"Submitted Version","department":[{"_id":"AnKi"}],"file_date_updated":"2020-07-14T12:47:33Z","date_updated":"2021-01-12T08:07:54Z","ddc":["571"],"type":"journal_article","pubrep_id":"987","status":"public","_id":"654"},{"date_updated":"2021-01-12T08:07:53Z","department":[{"_id":"KrPi"}],"_id":"6526","type":"conference","conference":{"end_date":"2017-06-30","location":"Aachen, Germany","start_date":"2017-06-25","name":"ISIT: International Symposium on Information Theory"},"status":"public","publication_identifier":{"isbn":["9781509040964"]},"publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"abstract":[{"lang":"eng","text":"This paper studies the complexity of estimating Rényi divergences of discrete distributions: p observed from samples and the baseline distribution q known a priori. Extending the results of Acharya et al. (SODA'15) on estimating Rényi entropy, we present improved estimation techniques together with upper and lower bounds on the sample complexity. We show that, contrarily to estimating Rényi entropy where a sublinear (in the alphabet size) number of samples suffices, the sample complexity is heavily dependent on events occurring unlikely in q, and is unbounded in general (no matter what an estimation technique is used). For any divergence of integer order bigger than 1, we provide upper and lower bounds on the number of samples dependent on probabilities of p and q (the lower bounds hold for non-integer orders as well). We conclude that the worst-case sample complexity is polynomial in the alphabet size if and only if the probabilities of q are non-negligible. This gives theoretical insights into heuristics used in the applied literature to handle numerical instability, which occurs for small probabilities of q. Our result shows that they should be handled with care not only because of numerical issues, but also because of a blow up in the sample complexity."}],"oa_version":"Preprint","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1702.01666","open_access":"1"}],"month":"08","citation":{"chicago":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. https://doi.org/10.1109/isit.2017.8006529.","ista":"Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory (ISIT). ISIT: International Symposium on Information Theory, 8006529.","mla":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” 2017 IEEE International Symposium on Information Theory (ISIT), 8006529, IEEE, 2017, doi:10.1109/isit.2017.8006529.","ama":"Skórski M. On the complexity of estimating Rènyi divergences. In: 2017 IEEE International Symposium on Information Theory (ISIT). IEEE; 2017. doi:10.1109/isit.2017.8006529","apa":"Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In 2017 IEEE International Symposium on Information Theory (ISIT). Aachen, Germany: IEEE. https://doi.org/10.1109/isit.2017.8006529","ieee":"M. Skórski, “On the complexity of estimating Rènyi divergences,” in 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017.","short":"M. Skórski, in:, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","full_name":"Skórski, Maciej","last_name":"Skórski"}],"external_id":{"arxiv":["1702.01666"]},"title":"On the complexity of estimating Rènyi divergences","article_number":"8006529","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"year":"2017","day":"09","publication":"2017 IEEE International Symposium on Information Theory (ISIT)","doi":"10.1109/isit.2017.8006529","date_published":"2017-08-09T00:00:00Z","date_created":"2019-06-06T12:53:09Z","publisher":"IEEE","quality_controlled":"1","oa":1},{"_id":"655","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"904","status":"public","date_updated":"2021-01-12T08:07:55Z","ddc":["579"],"department":[{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:47:33Z","abstract":[{"lang":"eng","text":"The bacterial flagellum is a self-assembling nanomachine. The external flagellar filament, several times longer than a bacterial cell body, is made of a few tens of thousands subunits of a single protein: flagellin. A fundamental problem concerns the molecular mechanism of how the flagellum grows outside the cell, where no discernible energy source is available. Here, we monitored the dynamic assembly of individual flagella using in situ labelling and real-time immunostaining of elongating flagellar filaments. We report that the rate of flagellum growth, initially ~1,700 amino acids per second, decreases with length and that the previously proposed chain mechanism does not contribute to the filament elongation dynamics. Inhibition of the proton motive force-dependent export apparatus revealed a major contribution of substrate injection in driving filament elongation. The combination of experimental and mathematical evidence demonstrates that a simple, injection-diffusion mechanism controls bacterial flagella growth outside the cell."}],"oa_version":"Published Version","scopus_import":1,"intvolume":" 6","month":"03","publication_status":"published","publication_identifier":{"issn":["2050084X"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"39e1c3e82ddac83a30422fa72fa1a383","file_id":"4716","file_size":5520359,"date_updated":"2020-07-14T12:47:33Z","creator":"system","file_name":"IST-2017-904-v1+1_elife-23136-v2.pdf","date_created":"2018-12-12T10:08:53Z"},{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"4717","checksum":"a6d542253028f52e00aa29739ddffe8f","date_updated":"2020-07-14T12:47:33Z","file_size":11242920,"creator":"system","date_created":"2018-12-12T10:08:54Z","file_name":"IST-2017-904-v1+2_elife-23136-figures-v2.pdf"}],"volume":6,"article_number":"e23136","citation":{"chicago":"Renault, Thibaud, Anthony Abraham, Tobias Bergmiller, Guillaume Paradis, Simon Rainville, Emmanuelle Charpentier, Calin C Guet, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.23136.","ista":"Renault T, Abraham A, Bergmiller T, Paradis G, Rainville S, Charpentier E, Guet CC, Tu Y, Namba K, Keener J, Minamino T, Erhardt M. 2017. Bacterial flagella grow through an injection diffusion mechanism. eLife. 6, e23136.","mla":"Renault, Thibaud, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” ELife, vol. 6, e23136, eLife Sciences Publications, 2017, doi:10.7554/eLife.23136.","short":"T. Renault, A. Abraham, T. Bergmiller, G. Paradis, S. Rainville, E. Charpentier, C.C. Guet, Y. Tu, K. Namba, J. Keener, T. Minamino, M. Erhardt, ELife 6 (2017).","ieee":"T. Renault et al., “Bacterial flagella grow through an injection diffusion mechanism,” eLife, vol. 6. eLife Sciences Publications, 2017.","apa":"Renault, T., Abraham, A., Bergmiller, T., Paradis, G., Rainville, S., Charpentier, E., … Erhardt, M. (2017). Bacterial flagella grow through an injection diffusion mechanism. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.23136","ama":"Renault T, Abraham A, Bergmiller T, et al. Bacterial flagella grow through an injection diffusion mechanism. eLife. 2017;6. doi:10.7554/eLife.23136"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Renault","full_name":"Renault, Thibaud","first_name":"Thibaud"},{"last_name":"Abraham","full_name":"Abraham, Anthony","first_name":"Anthony"},{"id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias","orcid":"0000-0001-5396-4346","full_name":"Bergmiller, Tobias","last_name":"Bergmiller"},{"first_name":"Guillaume","last_name":"Paradis","full_name":"Paradis, Guillaume"},{"last_name":"Rainville","full_name":"Rainville, Simon","first_name":"Simon"},{"last_name":"Charpentier","full_name":"Charpentier, Emmanuelle","first_name":"Emmanuelle"},{"first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C"},{"first_name":"Yuhai","last_name":"Tu","full_name":"Tu, Yuhai"},{"full_name":"Namba, Keiichi","last_name":"Namba","first_name":"Keiichi"},{"last_name":"Keener","full_name":"Keener, James","first_name":"James"},{"full_name":"Minamino, Tohru","last_name":"Minamino","first_name":"Tohru"},{"full_name":"Erhardt, Marc","last_name":"Erhardt","first_name":"Marc"}],"publist_id":"7082","title":"Bacterial flagella grow through an injection diffusion mechanism","oa":1,"publisher":"eLife Sciences Publications","quality_controlled":"1","year":"2017","has_accepted_license":"1","publication":"eLife","day":"06","date_created":"2018-12-11T11:47:44Z","date_published":"2017-03-06T00:00:00Z","doi":"10.7554/eLife.23136"},{"department":[{"_id":"JiFr"}],"date_updated":"2021-01-12T08:08:02Z","status":"public","type":"journal_article","_id":"657","issue":"12","volume":114,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00278424"]},"publication_status":"published","month":"03","intvolume":" 114","scopus_import":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5373392/","open_access":"1"}],"oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","text":"Plant organs are typically organized into three main tissue layers. The middle ground tissue layer comprises the majority of the plant body and serves a wide range of functions, including photosynthesis, selective nutrient uptake and storage, and gravity sensing. Ground tissue patterning and maintenance in Arabidopsis are controlled by a well-established gene network revolving around the key regulator SHORT-ROOT (SHR). In contrast, it is completely unknown how ground tissue identity is first specified from totipotent precursor cells in the embryo. The plant signaling molecule auxin, acting through AUXIN RESPONSE FACTOR (ARF) transcription factors, is critical for embryo patterning. The auxin effector ARF5/MONOPTEROS (MP) acts both cell-autonomously and noncell-autonomously to control embryonic vascular tissue formation and root initiation, respectively. Here we show that auxin response and ARF activity cell-autonomously control the asymmetric division of the first ground tissue cells. By identifying embryonic target genes, we show that MP transcriptionally initiates the ground tissue lineage and acts upstream of the regulatory network that controls ground tissue patterning and maintenance. Strikingly, whereas the SHR network depends on MP, this MP function is, at least in part, SHR independent. Our study therefore identifies auxin response as a regulator of ground tissue specification in the embryonic root, and reveals that ground tissue initiation and maintenance use different regulators and mechanisms. Moreover, our data provide a framework for the simultaneous formation of multiple cell types by the same transcriptional regulator."}],"title":"Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo","publist_id":"7076","author":[{"last_name":"Möller","full_name":"Möller, Barbara","first_name":"Barbara"},{"full_name":"Ten Hove, Colette","last_name":"Ten Hove","first_name":"Colette"},{"full_name":"Xiang, Daoquan","last_name":"Xiang","first_name":"Daoquan"},{"full_name":"Williams, Nerys","last_name":"Williams","first_name":"Nerys"},{"last_name":"López","full_name":"López, Lorena","first_name":"Lorena"},{"last_name":"Yoshida","full_name":"Yoshida, Saiko","first_name":"Saiko","id":"2E46069C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Smit, Margot","last_name":"Smit","first_name":"Margot"},{"full_name":"Datla, Raju","last_name":"Datla","first_name":"Raju"},{"first_name":"Dolf","last_name":"Weijers","full_name":"Weijers, Dolf"}],"external_id":{"pmid":["28265057"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Möller, Barbara, et al. “Auxin Response Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.” PNAS, vol. 114, no. 12, National Academy of Sciences, 2017, pp. E2533–39, doi:10.1073/pnas.1616493114.","short":"B. Möller, C. Ten Hove, D. Xiang, N. Williams, L. López, S. Yoshida, M. Smit, R. Datla, D. Weijers, PNAS 114 (2017) E2533–E2539.","ieee":"B. Möller et al., “Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo,” PNAS, vol. 114, no. 12. National Academy of Sciences, pp. E2533–E2539, 2017.","ama":"Möller B, Ten Hove C, Xiang D, et al. Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. 2017;114(12):E2533-E2539. doi:10.1073/pnas.1616493114","apa":"Möller, B., Ten Hove, C., Xiang, D., Williams, N., López, L., Yoshida, S., … Weijers, D. (2017). Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1616493114","chicago":"Möller, Barbara, Colette Ten Hove, Daoquan Xiang, Nerys Williams, Lorena López, Saiko Yoshida, Margot Smit, Raju Datla, and Dolf Weijers. “Auxin Response Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1616493114.","ista":"Möller B, Ten Hove C, Xiang D, Williams N, López L, Yoshida S, Smit M, Datla R, Weijers D. 2017. Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. 114(12), E2533–E2539."},"doi":"10.1073/pnas.1616493114","date_published":"2017-03-21T00:00:00Z","date_created":"2018-12-11T11:47:45Z","page":"E2533 - E2539","day":"21","publication":"PNAS","year":"2017","quality_controlled":"1","publisher":"National Academy of Sciences","oa":1}]