{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:34:23Z","timestamp":1784241263865,"version":"3.55.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,12,22]],"date-time":"2020-12-22T00:00:00Z","timestamp":1608595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANR","award":["ANR-10-IDEX-03-02"],"award-info":[{"award-number":["ANR-10-IDEX-03-02"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["683080"],"award-info":[{"award-number":["683080"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Leverhulme Trust Research Fellowship","award":["RF-2017-579"],"award-info":[{"award-number":["RF-2017-579"]}]},{"name":"National Science Center","award":["2017\/27\/B\/ST6\/02093"],"award-info":[{"award-number":["2017\/27\/B\/ST6\/02093"]}]},{"name":"ANR'","award":["ANR-17-CE40-0028"],"award-info":[{"award-number":["ANR-17-CE40-0028"]}]},{"name":"NCN","award":["2016\/21\/D\/ST6\/01376"],"award-info":[{"award-number":["2016\/21\/D\/ST6\/01376"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2021,2,28]]},"abstract":"<jats:p>Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modeling and analysis of hardware, software, and database systems, as well as chemical, biological, and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained unsettled since the 1960s, and it is one of the most prominent open questions in the theory of verification. Decidability was proved by Mayr in his seminal STOC 1981 work, and, currently, the best published upper bound is non-primitive recursive Ackermannian of Leroux and Schmitz from Symposium on Logic in Computer Science 2019. We establish a non-elementary lower bound, i.e., that the reachability problem needs a tower of exponentials of time and space. Until this work, the best lower bound has been exponential space, due to Lipton in 1976. The new lower bound is a major breakthrough for several reasons. Firstly, it shows that the reachability problem is much harder than the coverability (i.e., state reachability) problem, which is also ubiquitous but has been known to be complete for exponential space since the late 1970s. Secondly, it implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi, and other areas, which are known to admit reductions from the Petri nets reachability problem, are also not elementary. Thirdly, it makes obsolete the current best lower bounds for the reachability problems for two key extensions of Petri nets: with branching and with a pushdown stack.<\/jats:p><jats:p>We develop a construction that uses arbitrarily large pairs of values with ratio<jats:italic>R<\/jats:italic>to provide zero testable counters that are bounded by\u00a0<jats:italic>R<\/jats:italic>. At the heart of our proof is then a novel gadget, the so-called factorial amplifier that, assuming availability of counters that are zero testable and bounded by\u00a0<jats:italic>k<\/jats:italic>, guarantees to produce arbitrarily large pairs of values whose ratio is exactly the factorial of\u00a0<jats:italic>k<\/jats:italic>. Repeatedly composing the factorial amplifier with itself by means of the former construction enables us to compute, in linear time, Petri nets that simulate Minsky machines whose counters are bounded by a tower of exponentials, which yields the non-elementary lower bound. By refining this scheme further, we, in fact, already establish hardness for<jats:italic>h<\/jats:italic>-exponential space for Petri nets with<jats:italic>h<\/jats:italic>+ 13 counters.<\/jats:p>","DOI":"10.1145\/3422822","type":"journal-article","created":{"date-parts":[[2020,12,22]],"date-time":"2020-12-22T22:20:37Z","timestamp":1608675637000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["The Reachability Problem for Petri Nets Is Not Elementary"],"prefix":"10.1145","volume":"68","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[{"name":"University of Warsaw, Warszawa, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u0142awomir","family":"Lasota","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warszawa, 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\u00c9r\u00f4me","family":"Leroux","sequence":"additional","affiliation":[{"name":"University of Bordeaux, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Filip","family":"Mazowiecki","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,12,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/090779401"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-010-9180-6"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.14"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1970398.1970403"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516515"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2518188"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743436"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008101416758"},{"key":"e_1_2_1_9_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--278. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS. 2014.267 10.4230\/LIPIcs.FSTTCS.2014.267 Thomas Colcombet and Amaldev Manuel. 2014. Generalized data automata and fixpoint logic. In FSTTCS (LIPIcs), Vol. 29. Schloss Dagstuhl, 267--278. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2014.267"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(77)90558-7"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), September 1--4, 2020, Vienna, Austria (Virtual Conference). 48:1--48:21","author":"Czerwi\u0144ski Wojciech","year":"2020","unstructured":"Wojciech Czerwi\u0144ski , S\u0142awomir Lasota , Ranko Lazi\u0107 , J\u00e9r\u00f4me Leroux , and Filip Mazowiecki . 2020 . Reachability in fixed dimension vector addition systems with states . In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), September 1--4, 2020, Vienna, Austria (Virtual Conference). 48:1--48:21 . DOI:10.4230\/LIPIcs.CONCUR.2020.48 10.4230\/LIPIcs.CONCUR.2020.48 Wojciech Czerwi\u0144ski, S\u0142awomir Lasota, Ranko Lazi\u0107, J\u00e9r\u00f4me Leroux, and Filip Mazowiecki. 2020. Reachability in fixed dimension vector addition systems with states. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), September 1--4, 2020, Vienna, Austria (Virtual Conference). 48:1--48:21. DOI:10.4230\/LIPIcs.CONCUR.2020.48"},{"key":"e_1_2_1_12_1","volume-title":"CONCUR (LNCS)","author":"Decker Normann","unstructured":"Normann Decker , Peter Habermehl , Martin Leucker , and Daniel Thoma . 2014. Ordered navigation on multi-attributed data words . In CONCUR (LNCS) , Vol. 8704 . Springer , 497--511. https:\/\/doi.org\/10.1007\/978-3-662-44584-6_34 10.1007\/978-3-662-44584-6_34 Normann Decker, Peter Habermehl, Martin Leucker, and Daniel Thoma. 2014. Ordered navigation on multi-attributed data words. In CONCUR (LNCS), Vol. 8704. Springer, 497--511. https:\/\/doi.org\/10.1007\/978-3-662-44584-6_34"},{"key":"#cr-split#-e_1_2_1_13_1.1","doi-asserted-by":"crossref","unstructured":"St\u00e9phane Demri Diego Figueira and M. Praveen. 2016. Reasoning about data repetitions with counter systems. Logical Methods Comput. Sci. 12 3 (2016). https:\/\/doi.org\/10.2168\/LMCS-12(3:1)2016 10.2168\/LMCS-12(3:1)2016","DOI":"10.2168\/LMCS-12(3:1)2016"},{"key":"#cr-split#-e_1_2_1_13_1.2","doi-asserted-by":"crossref","unstructured":"St\u00e9phane Demri Diego Figueira and M. Praveen. 2016. Reasoning about data repetitions with counter systems. Logical Methods Comput. Sci. 12 3 (2016). https:\/\/doi.org\/10.2168\/LMCS-12(3:1)2016","DOI":"10.2168\/LMCS-12(3:1)2016"},{"key":"e_1_2_1_14_1","unstructured":"Matthias Englert Ranko Lazi\u0107 and Patrick Totzke. 2016. Reachability in two-dimensional unary vector addition systems with states is NL-complete. In LICS. ACM 477--484. http:\/\/doi.acm.org\/10.1145\/2933575.2933577 Matthias Englert Ranko Lazi\u0107 and Patrick Totzke. 2016. Reachability in two-dimensional unary vector addition systems with states is NL-complete. In LICS. ACM 477--484. http:\/\/doi.acm.org\/10.1145\/2933575.2933577"},{"key":"e_1_2_1_15_1","volume-title":"Lectures on Petri Nets I (LNCS)","author":"Esparza Javier","unstructured":"Javier Esparza . 1998. Decidability and complexity of Petri net problems\u2014An introduction . In Lectures on Petri Nets I (LNCS) , Vol. 1491 . Springer , 374--428. https:\/\/doi.org\/10.1007\/3-540-65306-6_20 10.1007\/3-540-65306-6_20 Javier Esparza. 1998. Decidability and complexity of Petri net problems\u2014An introduction. In Lectures on Petri Nets I (LNCS), Vol. 1491. Springer, 374--428. https:\/\/doi.org\/10.1007\/3-540-65306-6_20"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-016-0272-3"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01694011"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160910.2160915"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146681"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90020-8"},{"key":"e_1_2_1_21_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 -- 24 :17. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.24 10.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--24:17. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.24","journal-title":"Schloss Dagstuhl"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90041-0"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.06.003"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629608"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)00060-G"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80011-5"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"S. Rao Kosaraju. 1982. Decidability of reachability in vector addition systems (preliminary version). In STOC. ACM 267--281. http:\/\/doi.acm.org\/10.1145\/800070.802201 S. Rao Kosaraju. 1982. Decidability of reachability in vector addition systems (preliminary version). In STOC. ACM 267--281. http:\/\/doi.acm.org\/10.1145\/800070.802201","DOI":"10.1145\/800070.802201"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90173-D"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2733375"},{"key":"e_1_2_1_30_1","volume-title":"Concurrency, Security, and Puzzles\u2014Essays 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\u2014Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday (LNCS) , Vol. 10160 . Springer , 144--161. https:\/\/doi.org\/10.1007\/978-3-319-51046-0_8 10.1007\/978-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\u2014Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday (LNCS), Vol. 10160. Springer, 144--161. https:\/\/doi.org\/10.1007\/978-3-319-51046-0_8"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2015.2435696"},{"key":"e_1_2_1_32_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 ). https:\/\/doi.org\/10.2168\/LMCS-6(3:22)2010 10.2168\/LMCS-6(3:22)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). https:\/\/doi.org\/10.2168\/LMCS-6(3:22)2010"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"J\u00e9r\u00f4me Leroux. 2011. Vector addition system reachability problem: A short self-contained proof. In POPL. ACM 307--316. http:\/\/doi.acm.org\/10.1145\/1926385.1926421 J\u00e9r\u00f4me Leroux. 2011. Vector addition system reachability problem: A short self-contained proof. In POPL. ACM 307--316. http:\/\/doi.acm.org\/10.1145\/1926385.1926421","DOI":"10.1145\/1925844.1926421"},{"key":"e_1_2_1_34_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--228. 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--228. http:\/\/www.easychair.org\/publications\/paper\/106497"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.16"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785796"},{"key":"e_1_2_1_37_1","volume-title":"RP (LNCS)","author":"Leroux J\u00e9r\u00f4me","unstructured":"J\u00e9r\u00f4me Leroux and Philippe Schnoebelen . 2014. On functions weakly computable by Petri nets and vector addition systems . In RP (LNCS) , Vol. 8762 . Springer , 190--202. https:\/\/doi.org\/10.1007\/978-3-319-11439-2_15 10.1007\/978-3-319-11439-2_15 J\u00e9r\u00f4me Leroux and Philippe Schnoebelen. 2014. On functions weakly computable by Petri nets and vector addition systems. In RP (LNCS), Vol. 8762. Springer, 190--202. https:\/\/doi.org\/10.1007\/978-3-319-11439-2_15"},{"key":"e_1_2_1_38_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--416. https:\/\/doi.org\/10.1007\/978-3-540-28644-8_26 10.1007\/978-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--416. https:\/\/doi.org\/10.1007\/978-3-540-28644-8_26"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157798"},{"key":"e_1_2_1_41_1","first-page":"1","article-title":"Hierarchies of number-theoretic functions","volume":"13","author":"L\u00f6b Martin H.","year":"1970","unstructured":"Martin H. L\u00f6b and Stanley S. Wainer . 1970 . Hierarchies of number-theoretic functions . I. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung 13 , 1 -- 2 (1970), 39--51. https:\/\/doi.org\/10.1007\/BF01967649 10.1007\/BF01967649 Martin H. L\u00f6b and Stanley S. Wainer. 1970. Hierarchies of number-theoretic functions. I. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung 13, 1--2 (1970), 39--51. https:\/\/doi.org\/10.1007\/BF01967649","journal-title":"I. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Ernst W. Mayr. 1981. An algorithm for the general Petri net reachability problem. In STOC. ACM 238--246. http:\/\/doi.acm.org\/10.1145\/800076.802477 Ernst W. Mayr. 1981. An algorithm for the general Petri net reachability problem. In STOC. ACM 238--246. http:\/\/doi.acm.org\/10.1145\/800076.802477","DOI":"10.1145\/800076.802477"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213029"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322271"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-009-0091-x"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/1095587"},{"key":"e_1_2_1_47_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 -- 199 . https:\/\/doi.org\/10.1197\/jamia.M1637 10.1197\/jamia.M1637 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--199. https:\/\/doi.org\/10.1197\/jamia.M1637","journal-title":"JAMIA"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90036-1"},{"key":"e_1_2_1_50_1","volume-title":"Tenney","author":"Sacerdote George S.","year":"1977","unstructured":"George S. Sacerdote and Richard L . Tenney . 1977 . The decidability of the reachability problem for vector addition systems (preliminary version). In STOC. ACM , 61--76. http:\/\/doi.acm.org\/10.1145\/800105.803396 George S. Sacerdote and Richard L. Tenney. 1977. The decidability of the reachability problem for vector addition systems (preliminary version). In STOC. ACM, 61--76. http:\/\/doi.acm.org\/10.1145\/800105.803396"},{"key":"e_1_2_1_51_1","volume-title":"Complexity hierarchies beyond elementary. TOCT 8, 1","author":"Schmitz Sylvain","year":"2016","unstructured":"Sylvain Schmitz . 2016. Complexity hierarchies beyond elementary. TOCT 8, 1 ( 2016 ), 3:1--3:36. http:\/\/doi.acm.org\/10.1145\/2858784 Sylvain Schmitz. 2016. Complexity hierarchies beyond elementary. TOCT 8, 1 (2016), 3:1--3:36. http:\/\/doi.acm.org\/10.1145\/2858784"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2893582.2893585"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-014-0424-2"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316369"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3422822","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3422822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:56Z","timestamp":1750195496000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3422822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,22]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2,28]]}},"alternative-id":["10.1145\/3422822"],"URL":"https:\/\/doi.org\/10.1145\/3422822","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,22]]},"assertion":[{"value":"2019-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}