{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:34:24Z","timestamp":1784241264397,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":71,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100008952","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-10-IDEX-03-02 and ANR-17-CE40-0028"],"award-info":[{"award-number":["ANR-10-IDEX-03-02 and ANR-17-CE40-0028"]}],"id":[{"id":"10.13039\/501100008952","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["683080"],"award-info":[{"award-number":["683080"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RF-2017-579"],"award-info":[{"award-number":["RF-2017-579"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2016\/21\/D\/ST6\/01376 and 2017\/27\/B\/ST6\/02093"],"award-info":[{"award-number":["2016\/21\/D\/ST6\/01376 and 2017\/27\/B\/ST6\/02093"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316369","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"24-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["The reachability problem for Petri nets is not elementary"],"prefix":"10.1145","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[{"name":"University of Warsaw, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u0142awomir","family":"Lasota","sequence":"additional","affiliation":[{"name":"University of Warsaw, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ranko","family":"Lazi\u0107","sequence":"additional","affiliation":[{"name":"University of Warwick, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"additional","affiliation":[{"name":"CNRS, France \/ University of Bordeaux, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Filip","family":"Mazowiecki","sequence":"additional","affiliation":[{"name":"University of Bordeaux, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/090779401"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-010-9180-6"},{"key":"e_1_3_2_1_3_1","unstructured":"Michael Blondin Alain Finkel Stefan G\u00f6ller Christoph Haase and Pierre McKenzie. 2015.  Michael Blondin Alain Finkel Stefan G\u00f6ller Christoph Haase and Pierre McKenzie. 2015."},{"key":"e_1_3_2_1_4_1","unstructured":"Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. In LICS. IEEE Computer Society 32\u201343.  Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. In LICS. IEEE Computer Society 32\u201343."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1970398.1970403"},{"key":"e_1_3_2_1_6_1","unstructured":"Miko\u0142aj Boja\u0144czyk Anca Muscholl Thomas Schwentick and Luc Segoufin. 2009.  Miko\u0142aj Boja\u0144czyk Anca Muscholl Thomas Schwentick and Luc Segoufin. 2009."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516515"},{"key":"e_1_3_2_1_8_1","unstructured":"Ahmed Bouajjani and Michael Emmi. 2013.  Ahmed Bouajjani and Michael Emmi. 2013."},{"key":"e_1_3_2_1_9_1","volume-title":"10:1\u201310:49","author":"Recursively Parallel Programs Analysis","year":"2013","unstructured":"Analysis of Recursively Parallel Programs . ACM Trans . Program. Lang. Syst. 35, 3 ( 2013 ), 10:1\u201310:49 . Analysis of Recursively Parallel Programs. ACM Trans. Program. Lang. Syst. 35, 3 (2013), 10:1\u201310:49."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008101416758"},{"key":"e_1_3_2_1_11_1","volume-title":"FSTTCS (LIPIcs)","volume":"29","author":"Colcombet Thomas","year":"2014","unstructured":"Thomas Colcombet and Amaldev Manuel . 2014 . Generalized Data Automata and Fixpoint Logic . In FSTTCS (LIPIcs) , Vol. 29 . Schloss Dagstuhl, 267\u2013278. TCS. 2014.267 Thomas Colcombet and Amaldev Manuel. 2014. Generalized Data Automata and Fixpoint Logic. In FSTTCS (LIPIcs), Vol. 29. Schloss Dagstuhl, 267\u2013278. TCS.2014.267"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(77)90558-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44584-6_34"},{"key":"e_1_3_2_1_14_1","unstructured":"Springer 497\u2013511. 3- 662- 44584- 6_34  Springer 497\u2013511. 3- 662- 44584- 6_34"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"St\u00e9phane Demri Diego Figueira and M. Praveen. 2016. Reasoning about Data Repetitions with Counter Systems. Logical Methods in Computer Science 12 3 (2016).  St\u00e9phane Demri Diego Figueira and M. Praveen. 2016. Reasoning about Data Repetitions with Counter Systems. Logical Methods in Computer Science 12 3 (2016).","DOI":"10.2168\/LMCS-12(3:1)2016"},{"key":"e_1_3_2_1_16_1","unstructured":"12(3:1)2016 STOC \u201919 June 23\u201326 2019 Phoenix AZ USA Wojciech Czerwi\u0144ski S\u0142awomir Lasota Ranko Lazi\u0107 J\u00e9r\u00f4me Leroux and Filip Mazowiecki  12(3:1)2016 STOC \u201919 June 23\u201326 2019 Phoenix AZ USA Wojciech Czerwi\u0144ski S\u0142awomir Lasota Ranko Lazi\u0107 J\u00e9r\u00f4me Leroux and Filip Mazowiecki"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933577"},{"key":"e_1_3_2_1_18_1","volume-title":"Lectures on Petri Nets I (LNCS)","author":"Esparza Javier","unstructured":"Javier Esparza . 1998. Decidability and Complexity of Petri Net Problems \u2014 An Introduction . In Lectures on Petri Nets I (LNCS) , Vol. 1491 . Springer , 374\u2013428. 540- 65306- 6_20 Javier Esparza. 1998. Decidability and Complexity of Petri Net Problems \u2014 An Introduction. In Lectures on Petri Nets I (LNCS), Vol. 1491. Springer, 374\u2013428. 540- 65306- 6_20"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-016-0272-3"},{"key":"e_1_3_2_1_20_1","volume-title":"Rosenberg","author":"Fischer Patrick C.","year":"1968","unstructured":"Patrick C. Fischer , Albert R. Meyer , and Arnold L . Rosenberg . 1968 . Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg. 1968."},{"key":"e_1_3_2_1_21_1","volume-title":"Mathematical Systems Theory 2, 3","author":"Machines Counter","year":"1968","unstructured":"Counter Machines and Counter Languages . Mathematical Systems Theory 2, 3 ( 1968 ), 265\u2013283. Counter Machines and Counter Languages. Mathematical Systems Theory 2, 3 (1968), 265\u2013283."},{"key":"e_1_3_2_1_22_1","unstructured":"Pierre Ganty and Rupak Majumdar. 2012.  Pierre Ganty and Rupak Majumdar. 2012."},{"key":"e_1_3_2_1_23_1","volume-title":"6:1\u20136:48","author":"Trans Algorithmic","year":"2012","unstructured":"Algorithmic verification of asynchronous programs. ACM Trans . Program. Lang. Syst. 34, 1 ( 2012 ), 6:1\u20136:48 . Algorithmic verification of asynchronous programs. ACM Trans. Program. Lang. Syst. 34, 1 (2012), 6:1\u20136:48."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146681"},{"key":"e_1_3_2_1_25_1","unstructured":"146681  146681"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90020-8"},{"key":"e_1_3_2_1_27_1","first-page":"1","article-title":"Linear Equations with Ordered Data. In CONCUR (LIPIcs), Vol. 118","volume":"24","author":"Hofman Piotr","year":"2018","unstructured":"Piotr Hofman and S\u0142awomir Lasota . 2018 . Linear Equations with Ordered Data. In CONCUR (LIPIcs), Vol. 118 . Schloss Dagstuhl , 24 : 1 \u2013 24 :17. 4230\/LIPIcs.CONCUR.2018.24 Piotr Hofman and S\u0142awomir Lasota. 2018. Linear Equations with Ordered Data. In CONCUR (LIPIcs), Vol. 118. Schloss Dagstuhl, 24:1\u201324:17. 4230\/LIPIcs.CONCUR.2018.24","journal-title":"Schloss Dagstuhl"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90041-0"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629608"},{"key":"e_1_3_2_1_30_1","unstructured":"Max I. Kanovich. 1995.  Max I. Kanovich. 1995."},{"key":"e_1_3_2_1_31_1","volume-title":"Horn Programs, Linear Logic and Vector Games. Ann. Pure Appl. Logic 75, 1\u20132","author":"Nets Petri","year":"1995","unstructured":"Petri Nets , Horn Programs, Linear Logic and Vector Games. Ann. Pure Appl. Logic 75, 1\u20132 ( 1995 ), 107\u2013135. 0168- 0072(94)00060-G Petri Nets, Horn Programs, Linear Logic and Vector Games. Ann. Pure Appl. Logic 75, 1\u20132 (1995), 107\u2013135. 0168- 0072(94)00060-G"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80011-5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802201"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90173-D"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2733375"},{"key":"e_1_3_2_1_36_1","volume-title":"Concurrency, Security, and Puzzles \u2014 Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday (LNCS)","author":"Lazi\u0107 Ranko","unstructured":"Ranko Lazi\u0107 and Patrick Totzke . 2017. What Makes Petri Nets Harder to Verify: Stack or Data? . In Concurrency, Security, and Puzzles \u2014 Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday (LNCS) , Vol. 10160 . Springer , 144\u2013161. 3- 319- 51046- 0_8 Ranko Lazi\u0107 and Patrick Totzke. 2017. What Makes Petri Nets Harder to Verify: Stack or Data?. In Concurrency, Security, and Puzzles \u2014 Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday (LNCS), Vol. 10160. Springer, 144\u2013161. 3- 319- 51046- 0_8"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2015.2435696"},{"key":"e_1_3_2_1_38_1","volume-title":"The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. Logical Methods in Computer Science 6, 3","author":"Leroux J\u00e9r\u00f4me","year":"2010","unstructured":"J\u00e9r\u00f4me Leroux . 2010. The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. Logical Methods in Computer Science 6, 3 ( 2010 ). J\u00e9r\u00f4me Leroux. 2010. The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. Logical Methods in Computer Science 6, 3 (2010)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926421"},{"key":"e_1_3_2_1_40_1","unstructured":"1926421  1926421"},{"key":"e_1_3_2_1_41_1","volume-title":"Turing-100 (EPiC Series in Computing)","author":"Leroux J\u00e9r\u00f4me","unstructured":"J\u00e9r\u00f4me Leroux . 2012. Vector Addition Systems Reachability Problem (A Simpler Solution) . In Turing-100 (EPiC Series in Computing) , Vol. 10 . EasyChair , 214\u2013228. http:\/\/www.easychair.org\/publications\/paper\/106497 J\u00e9r\u00f4me Leroux. 2012. Vector Addition Systems Reachability Problem (A Simpler Solution). In Turing-100 (EPiC Series in Computing), Vol. 10. EasyChair, 214\u2013228. http:\/\/www.easychair.org\/publications\/paper\/106497"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.16"},{"key":"e_1_3_2_1_43_1","unstructured":"J\u00e9r\u00f4me Leroux and Sylvain Schmitz. 2019.  J\u00e9r\u00f4me Leroux and Sylvain Schmitz. 2019."},{"key":"e_1_3_2_1_44_1","unstructured":"Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. In LICS. https:\/\/arxiv.org\/ abs\/1903.08575  Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. In LICS. https:\/\/arxiv.org\/ abs\/1903.08575"},{"key":"e_1_3_2_1_45_1","unstructured":"J\u00e9r\u00f4me Leroux and Philippe Schnoebelen. 2014.  J\u00e9r\u00f4me Leroux and Philippe Schnoebelen. 2014."},{"key":"e_1_3_2_1_46_1","volume-title":"RP (LNCS)","author":"Weakly On Functions","unstructured":"On Functions Weakly Computable by Petri Nets and Vector Addition Systems . In RP (LNCS) , Vol. 8762 . On Functions Weakly Computable by Petri Nets and Vector Addition Systems. In RP (LNCS), Vol. 8762."},{"key":"e_1_3_2_1_47_1","unstructured":"Springer 190\u2013202. 3- 319- 11439- 2_15  Springer 190\u2013202. 3- 319- 11439- 2_15"},{"key":"e_1_3_2_1_48_1","volume-title":"CONCUR (LNCS)","author":"Leroux J\u00e9r\u00f4me","unstructured":"J\u00e9r\u00f4me Leroux and Gr\u00e9goire Sutre . 2004. On Flatness for 2-Dimensional Vector Addition Systems with States . In CONCUR (LNCS) , Vol. 3170 . Springer , 402\u2013416. 3- 540- 28644- 8_26 J\u00e9r\u00f4me Leroux and Gr\u00e9goire Sutre. 2004. On Flatness for 2-Dimensional Vector Addition Systems with States. In CONCUR (LNCS), Vol. 3170. Springer, 402\u2013416. 3- 540- 28644- 8_26"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157798"},{"key":"e_1_3_2_1_50_1","unstructured":"Richard J. Lipton. 1976.  Richard J. Lipton. 1976."},{"key":"e_1_3_2_1_51_1","volume-title":"Technical Report 62","author":"The","unstructured":"The reachability problem requires exponential space. Technical Report 62 . Yale University . http:\/\/cpsc.yale.edu\/sites\/default\/files\/files\/ tr63.pdf The reachability problem requires exponential space. Technical Report 62. Yale University. http:\/\/cpsc.yale.edu\/sites\/default\/files\/files\/ tr63.pdf"},{"key":"e_1_3_2_1_52_1","volume-title":"Wainer","author":"L\u00f6b Martin H.","year":"1970","unstructured":"Martin H. L\u00f6b and Stanley S . Wainer . 1970 . Martin H. L\u00f6b and Stanley S. Wainer. 1970."},{"key":"e_1_3_2_1_53_1","volume-title":"Archiv f\u00fcr mathematische Logik und Grundlagenforschung 13, 1\u20132","author":"Hierarchies","year":"1970","unstructured":"Hierarchies of number-theoretic functions. I. Archiv f\u00fcr mathematische Logik und Grundlagenforschung 13, 1\u20132 ( 1970 ), 39\u201351. Hierarchies of number-theoretic functions. I. Archiv f\u00fcr mathematische Logik und Grundlagenforschung 13, 1\u20132 (1970), 39\u201351."},{"key":"e_1_3_2_1_54_1","unstructured":"Ernst W. Mayr. 1981.  Ernst W. Mayr. 1981."},{"key":"e_1_3_2_1_55_1","unstructured":"An Algorithm for the General Petri Net Reachability Problem. In STOC. ACM 238\u2013246.  An Algorithm for the General Petri Net Reachability Problem. In STOC. ACM 238\u2013246."},{"key":"e_1_3_2_1_56_1","unstructured":"Ernst W. Mayr. 1984.  Ernst W. Mayr. 1984."},{"key":"e_1_3_2_1_57_1","volume-title":"441\u2013460","author":"General Petri Net Reachability An Algorithm","year":"1984","unstructured":"An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comput . 13, 3 ( 1984 ), 441\u2013460 . An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comput. 13, 3 (1984), 441\u2013460."},{"key":"e_1_3_2_1_58_1","volume-title":"Meyer","author":"Mayr Ernst W.","year":"1981","unstructured":"Ernst W. Mayr and Albert R . Meyer . 1981 . Ernst W. Mayr and Albert R. Meyer. 1981."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322271"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-009-0091-x"},{"key":"e_1_3_2_1_61_1","unstructured":"Marvin L. Minsky. 1967.  Marvin L. Minsky. 1967."},{"key":"e_1_3_2_1_62_1","volume-title":"finite and infinite machines","author":"Computation","unstructured":"Computation : finite and infinite machines . Prentice-Hall, Inc. https:\/\/dl.acm.org\/citation.cfm?id=1095587 Computation: finite and infinite machines. Prentice-Hall, Inc. https:\/\/dl.acm.org\/citation.cfm?id=1095587"},{"key":"e_1_3_2_1_63_1","first-page":"181","article-title":"Research Paper: Using Petri Net Tools to Study Properties and Dynamics of Biological Systems","volume":"12","author":"Peleg Mor","year":"2005","unstructured":"Mor Peleg , Daniel L. Rubin , and Russ B. Altman . 2005 . Research Paper: Using Petri Net Tools to Study Properties and Dynamics of Biological Systems . JAMIA 12 , 2 (2005), 181 \u2013 199 . Mor Peleg, Daniel L. Rubin, and Russ B. Altman. 2005. Research Paper: Using Petri Net Tools to Study Properties and Dynamics of Biological Systems. JAMIA 12, 2 (2005), 181\u2013199.","journal-title":"JAMIA"},{"key":"e_1_3_2_1_64_1","unstructured":"Carl Adam Petri. 1962.  Carl Adam Petri. 1962."},{"key":"e_1_3_2_1_65_1","unstructured":"Kommunikation mit Automaten. Ph.D. Dissertation. Universit\u00c3\u010ft Hamburg. http:\/\/edoc.sub.unihamburg.de\/informatik\/volltexte\/ 2011\/160\/  Kommunikation mit Automaten. Ph.D. Dissertation. Universit\u00c3\u010ft Hamburg. http:\/\/edoc.sub.unihamburg.de\/informatik\/volltexte\/ 2011\/160\/"},{"key":"e_1_3_2_1_66_1","unstructured":"Charles Rackoff. 1978.  Charles Rackoff. 1978."},{"key":"e_1_3_2_1_67_1","volume-title":"223\u2013231. 0304- 3975(78)90036- 1","author":"Covering The","year":"1978","unstructured":"The Covering and Boundedness Problems for Vector Addition Systems . Theor. Comput. Sci. 6 ( 1978 ), 223\u2013231. 0304- 3975(78)90036- 1 The Covering and Boundedness Problems for Vector Addition Systems. Theor. Comput. Sci. 6 (1978), 223\u2013231. 0304- 3975(78)90036- 1"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803396"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858784"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2893582.2893585"},{"key":"e_1_3_2_1_71_1","unstructured":"Wil M. P. van der Aalst. 2015.  Wil M. P. van der Aalst. 2015."}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","location":"Phoenix AZ USA","acronym":"STOC '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316369","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":71,"alternative-id":["10.1145\/3313276.3316369","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316369","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}