{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T13:54:06Z","timestamp":1791294846675,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Education of Singapore","award":["MOE2016-T2-1-019 \/ R146-000-234-112"],"award-info":[{"award-number":["MOE2016-T2-1-019 \/ R146-000-234-112"]}]},{"DOI":"10.13039\/501100001509","name":"Royal Society of New Zealand","doi-asserted-by":"publisher","award":["Marsden Fund to Bakhadyr Khoussainov"],"award-info":[{"award-number":["Marsden Fund to Bakhadyr Khoussainov"]}],"id":[{"id":"10.13039\/501100001509","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","award":["C252-000-087-001"],"award-info":[{"award-number":["C252-000-087-001"]}],"id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055409","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T16:27:45Z","timestamp":1497544065000},"page":"252-263","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":90,"title":["Deciding parity games in quasipolynomial time"],"prefix":"10.1145","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[{"name":"University of Auckland, New Zealand"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bakhadyr","family":"Khoussainov","sequence":"additional","affiliation":[{"name":"University of Auckland, New Zealand"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/320613.320614"},{"key":"e_1_3_2_2_2_1","first-page":"251","article-title":"from parity games to safety games. RAIRO - Theoretical Informatics and Applications","volume":"36","author":"Bernet Julien","year":"2002","unstructured":"Julien Bernet , David Janin and Igor Walukiewicz . Permissive strategies : from parity games to safety games. RAIRO - Theoretical Informatics and Applications , EDP Sciences , 36 : 251 \u2013 275 , 2002 . Julien Bernet, David Janin and Igor Walukiewicz. Permissive strategies: from parity games to safety games. RAIRO - Theoretical Informatics and Applications, EDP Sciences, 36:251\u2013275, 2002.","journal-title":"EDP Sciences"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1147-5"},{"key":"e_1_3_2_2_4_1","volume-title":"Department of Information Technology","author":"Bj\u00f6rklund Henrik","unstructured":"Henrik Bj\u00f6rklund , Sven Sandberg and Sergei Vorobyov. On fixed-parameter complexity of infinite games. Technical report 2003-038 , Department of Information Technology , Uppsala University , Box 337, SE-751 05 Uppsala, Sweden. Henrik Bj\u00f6rklund, Sven Sandberg and Sergei Vorobyov. On fixed-parameter complexity of infinite games. Technical report 2003-038, Department of Information Technology, Uppsala University, Box 337, SE-751 05 Uppsala, Sweden."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00427-4"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45678-3_47"},{"issue":"4","key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.3233\/FUN-2002-49402","article-title":"Relaxed Update and Partition Network Games","volume":"49","author":"Bodlaender Hans L.","year":"2002","unstructured":"Hans L. Bodlaender , Michael J. Dinneen and Bakhadyr Khoussainov . Relaxed Update and Partition Network Games . Fundamenta Informaticae , 49 ( 4 ): 301 \u2013 312 , 2002 . Hans L. Bodlaender, Michael J. Dinneen and Bakhadyr Khoussainov. Relaxed Update and Partition Network Games. Fundamenta Informaticae, 49(4):301\u2013312, 2002.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00228-9"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.12.021"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"e_1_3_2_2_12_1","unstructured":"STOC 2017 19\u201323 June 2017 Montreal QC Canada Cristian S. Calude Sanjay Jain Bakhadyr Khoussainov Wei Li and Frank Stephan STOC 2017 19\u201323 June 2017 Montreal QC Canada Cristian S. Calude Sanjay Jain Bakhadyr Khoussainov Wei Li and Frank Stephan"},{"key":"e_1_3_2_2_13_1","volume-title":"Comments on the Quasipolynomial Time Algorithm. Private communication","author":"Chatterjee Krishnendu","year":"2017","unstructured":"Krishnendu Chatterjee . Comments on the Quasipolynomial Time Algorithm. Private communication , 2017 . Krishnendu Chatterjee. Comments on the Quasipolynomial Time Algorithm. Private communication, 2017."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_42"},{"key":"e_1_3_2_2_15_1","first-page":"130","volume-title":"SODA 2004, Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Chatterjee Krishnendu","year":"2004","unstructured":"Krishnendu Chatterjee , Marcin Jurdzinski and Thomas A. Henzinger . Quantitative stochastic parity games . SODA 2004, Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 121\u2013 130 , 2004 . Krishnendu Chatterjee, Marcin Jurdzinski and Thomas A. Henzinger. Quantitative stochastic parity games. SODA 2004, Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 121\u2013130, 2004."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.04.007"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800161.805151"},{"key":"e_1_3_2_2_18_1","volume-title":"Manuscript","author":"Dawar Anuj","year":"2011","unstructured":"Anuj Dawar , Florian Horn and Paul Hunter . Complexity Bounds for Muller Games . Manuscript , 2011 . Anuj Dawar, Florian Horn and Paul Hunter. Complexity Bounds for Muller Games. Manuscript, 2011."},{"key":"e_1_3_2_2_19_1","volume-title":"CIAA 2016","author":"Stasio Antonio Di","year":"2016","unstructured":"Antonio Di Stasio , Aniello Murano , Giuseppe Perelli and Moshe Y. Vardi . Solving parity games using an automata-based algorithm. Twenty first International Conference on Implementation and Application of Automata , CIAA 2016 , 19\u201322 July 2016 , Seoul, South Korea, Springer LNCS, 9705:64\u201376 , 2016. Antonio Di Stasio, Aniello Murano, Giuseppe Perelli and Moshe Y. Vardi. Solving parity games using an automata-based algorithm. Twenty first International Conference on Implementation and Application of Automata, CIAA 2016, 19\u201322 July 2016, Seoul, South Korea, Springer LNCS, 9705:64\u201376, 2016."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.11.044"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterised Complexity","author":"Downey Rodney G.","year":"1999","unstructured":"Rodney G. Downey and Michael R. Fellows . Parameterised Complexity . Springer , Heidelberg , 1999 . Rodney G. Downey and Michael R. Fellows. Parameterised Complexity. Springer, Heidelberg, 1999."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity Theory","author":"Downey Rodney G.","year":"2013","unstructured":"Rodney G. Downey and Michael R. Fellows . Fundamentals of Parameterized Complexity Theory . Springer , Heidelberg , 2013 . Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity Theory. Springer, Heidelberg, 2013."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092282.3092286"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.2478\/s11533-010-0014-7"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1327068708"},{"key":"e_1_3_2_2_26_1","volume-title":"Parameterized Complexity Theory","author":"Flum J\u00f6rg","year":"2006","unstructured":"J\u00f6rg Flum and Martin Grohe . Parameterized Complexity Theory . Springer , 2006 . J\u00f6rg Flum and Martin Grohe. Parameterized Complexity Theory. Springer, 2006."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.27"},{"key":"e_1_3_2_2_28_1","first-page":"79","article-title":"and temporal logics. Proceedings of the Workshop on Logic of Programs","volume":"193","author":"Emerson E. Allen","year":"1985","unstructured":"E. Allen Emerson . Automata, tableaux , and temporal logics. Proceedings of the Workshop on Logic of Programs , Springer LNCS , 193 : 79 \u2013 88 , 1985 . E. Allen Emerson. Automata, tableaux, and temporal logics. Proceedings of the Workshop on Logic of Programs, Springer LNCS, 193:79\u201388, 1985.","journal-title":"Springer LNCS"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185392"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00034-7"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04761-9_15"},{"key":"e_1_3_2_2_32_1","volume-title":"MFCS 2015","author":"Gajarsk\u00fd Jakub","year":"2015","unstructured":"Jakub Gajarsk\u00fd , Michael Lampis , Kazuhisa Makino , Valia Mitsou and Sebastian Ordyniak . Parameterized algorithms for parity games. Mathematical Foundations of Computer Science , MFCS 2015 . Springer LNCS, 9235: 336\u2013347 , 2015 . Jakub Gajarsk\u00fd, Michael Lampis, Kazuhisa Makino, Valia Mitsou and Sebastian Ordyniak. Parameterized algorithms for parity games. Mathematical Foundations of Computer Science, MFCS 2015. Springer LNCS, 9235:336\u2013347, 2015."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2361516.2361519"},{"key":"e_1_3_2_2_34_1","volume-title":"A short proof of correctness of the quasi-polynomial ti8me algorithm for parity games. Technical report on http:\/\/arxiv.org\/abs\/1702.01953","author":"Gimbert Hugo","year":"2017","unstructured":"Hugo Gimbert and Rasmus Ibsen-Jensen . A short proof of correctness of the quasi-polynomial ti8me algorithm for parity games. Technical report on http:\/\/arxiv.org\/abs\/1702.01953 , 2017 . Hugo Gimbert and Rasmus Ibsen-Jensen. A short proof of correctness of the quasi-polynomial ti8me algorithm for parity games. Technical report on http:\/\/arxiv.org\/abs\/1702.01953, 2017."},{"key":"e_1_3_2_2_35_1","volume-title":"Yde Venema and Scott Weinstein. Finite Model Theory and Its Applications","author":"Gr\u00e4del Erich","year":"2007","unstructured":"Erich Gr\u00e4del , Phokion G. Kolaitis , Leonid Libkin , Maarten Marx , Joel Spencer , Moshe Y. Vardi , Yde Venema and Scott Weinstein. Finite Model Theory and Its Applications . Springer , 2007 . Erich Gr\u00e4del, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema and Scott Weinstein. Finite Model Theory and Its Applications. Springer, 2007."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.11.032"},{"key":"e_1_3_2_2_37_1","first-page":"245","volume-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008","author":"Horn Florian","year":"2008","unstructured":"Florian Horn . Explicit Muller games are PTIME . IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008 , pp. 235\u2013 245 , Dagstuhl Technical Reports, 1756 , 2008 . Florian Horn. Explicit Muller games are PTIME. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, pp. 235\u2013245, Dagstuhl Technical Reports, 1756, 2008."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802177"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90039-8"},{"key":"e_1_3_2_2_41_1","volume-title":"Twenty-Eighth International Workshop, WG2002","author":"Ishihara Hajime","year":"2002","unstructured":"Hajime Ishihara , Bakhadyr Khoussainov . Complexity of some infinite games played on finite graphs. Graph-Theoretic Concepts in Computer Science , Twenty-Eighth International Workshop, WG2002 , Cesky Krumlov, Czech Republic, 13\u2013 15 June 2002 , Proceedings. Springer LNCS 2573:270\u2013281, 2002. Hajime Ishihara, Bakhadyr Khoussainov. Complexity of some infinite games played on finite graphs. Graph-Theoretic Concepts in Computer Science, Twenty-Eighth International Workshop, WG2002, Cesky Krumlov, Czech Republic, 13\u201315 June 2002, Proceedings. Springer LNCS 2573:270\u2013281, 2002."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00150-1"},{"key":"e_1_3_2_2_43_1","first-page":"290","article-title":"Small progress measures for solving parity games. STACS 2000, Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science","volume":"1770","author":"Jurdzi\u0144ski Marcin","year":"2000","unstructured":"Marcin Jurdzi\u0144ski . Small progress measures for solving parity games. STACS 2000, Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science , Springer LNCS , 1770 : 290 \u2013 301 , 2000 . Marcin Jurdzi\u0144ski. Small progress measures for solving parity games. STACS 2000, Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, Springer LNCS, 1770:290\u2013301, 2000.","journal-title":"Springer LNCS"},{"key":"e_1_3_2_2_44_1","volume-title":"LICS","author":"Jurdzi\u0144ski Marcin","year":"2017","unstructured":"Marcin Jurdzi\u0144ski and Ranko Lazi\u0107 . Succinct progress measures for solving parity games. Logic in Computer Science , LICS 2017 . See also the technical report on http:\/\/arxiv.org\/abs\/1702.05051. Marcin Jurdzi\u0144ski and Ranko Lazi\u0107. Succinct progress measures for solving parity games. Logic in Computer Science, LICS 2017. See also the technical report on http:\/\/arxiv.org\/abs\/1702.05051."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/070686652"},{"key":"e_1_3_2_2_46_1","first-page":"133","volume-title":"SOFTENG","author":"Khaliq Imran","year":"2016","unstructured":"Imran Khaliq and Gulshad Imran . Reachability games revisited. Second International Conference on Advances and Trends in Software Engineering , SOFTENG 2016 , 21\u201325 February 2016, Lisbon, Portugal, Proceedings , International Academy, Research and Industry Association (IARIA) , Wellington, DE 19810, USA, pp. 129\u2013 133 , 2016. Imran Khaliq and Gulshad Imran. Reachability games revisited. Second International Conference on Advances and Trends in Software Engineering, SOFTENG 2016, 21\u201325 February 2016, Lisbon, Portugal, Proceedings, International Academy, Research and Industry Association (IARIA), Wellington, DE 19810, USA, pp. 129\u2013 133, 2016."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/558914"},{"key":"e_1_3_2_2_48_1","volume-title":"Proceedings of Computer Science Logic, CSL 2010","author":"Kuske Dietrich","year":"2010","unstructured":"Dietrich Kuske , Jiamou Liu and Markus Lohrey . The isomorphism problem for omega-automatic trees . Proceedings of Computer Science Logic, CSL 2010 , Springer LNCS, 6247:396\u2013410 , 2010 . Dietrich Kuske, Jiamou Liu and Markus Lohrey. The isomorphism problem for omega-automatic trees. Proceedings of Computer Science Logic, CSL 2010, Springer LNCS, 6247:396\u2013410, 2010."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(93)90036-D"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/766517.766521"},{"key":"e_1_3_2_2_53_1","volume-title":"From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. Logical Methods in Computer Science, 3(3:5):1\u201321","author":"Piterman Nir","year":"2007","unstructured":"Nir Piterman . From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. Logical Methods in Computer Science, 3(3:5):1\u201321 , 2007 . Nir Piterman. From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. Logical Methods in Computer Science, 3(3:5):1\u201321, 2007."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.23"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21948"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798332518"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.10.002"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03816-7_57"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.10.002"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00130-5"},{"key":"e_1_3_2_2_61_1","volume-title":"School of Computing","author":"Stephan Frank","year":"2016","unstructured":"Frank Stephan . Methods and Theory of Automata and Languages. Lecture Notes , School of Computing , National University of Singapore , 2016 . http:\/\/www.comp.nus.edu.sg\/~fstephan\/fullautomatatheory-nov2016.ps. Frank Stephan. Methods and Theory of Automata and Languages. Lecture Notes, School of Computing, National University of Singapore, 2016. http:\/\/www.comp.nus.edu.sg\/~fstephan\/fullautomatatheory-nov2016.ps."},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/7.1.103"},{"key":"e_1_3_2_2_63_1","volume-title":"Thomas. On the Synthesis of Strategies in Infinite Games. Twelfth International Symposium on Theoretical Aspects of Computer Science, STACS 1995","author":"Wolfgang","year":"1995","unstructured":"Wolfgang Thomas. On the Synthesis of Strategies in Infinite Games. Twelfth International Symposium on Theoretical Aspects of Computer Science, STACS 1995 , Springer LNCS, 900: 1\u201313 , 1995 . Wolfgang Thomas. On the Synthesis of Strategies in Infinite Games. Twelfth International Symposium on Theoretical Aspects of Computer Science, STACS 1995, Springer LNCS, 900:1\u201313, 1995."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.36045\/bbms\/1102714178"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00009-7"},{"key":"e_1_3_2_2_66_1","unstructured":"Abstract 1 Introduction 2 The Complexity of the Parity Game 3 Parity Games versus Muller Games 4 Conclusion References Abstract 1 Introduction 2 The Complexity of the Parity Game 3 Parity Games versus Muller Games 4 Conclusion References"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055409","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T13:33:34Z","timestamp":1750340014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":62,"alternative-id":["10.1145\/3055399.3055409","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055409","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}