{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:10Z","timestamp":1770993970732,"version":"3.50.1"},"reference-count":75,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["DMS-1750319"],"award-info":[{"award-number":["DMS-1750319"]}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP200100950"],"award-info":[{"award-number":["DP200100950"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Theory"],"published-print":{"date-parts":[[2024,3,31]]},"abstract":"<jats:p>\n            In this article, we study some classical complexity-theoretic questions regarding\n            <jats:sc>Group Isomorphism<\/jats:sc>\n            (\n            <jats:sc>GpI<\/jats:sc>\n            ). We focus on\n            <jats:italic>p<\/jats:italic>\n            -groups (groups of prime power order) with odd\n            <jats:italic>p<\/jats:italic>\n            , which are believed to be a bottleneckcase for\n            <jats:sc>GpI<\/jats:sc>\n            , and work in the model of matrix groups over finite fields. Our main results are as follows:\n            <jats:list list-type=\"bullet\">\n              <jats:list-item>\n                <jats:label>\u2022<\/jats:label>\n                <jats:p>\n                  Although search-to-decision and counting-to-decision reductions have been known for more than four decades for\n                  <jats:sc>Graph Isomorphism<\/jats:sc>\n                  , they had remained open for\n                  <jats:sc>GpI<\/jats:sc>\n                  , explicitly asked by Arvind and Tor\u00e1n (\n                  <jats:italic>EATCS Bull.<\/jats:italic>\n                  , 2005). Extending methods from\n                  <jats:sc>Tensor Isomorphism<\/jats:sc>\n                  (TI) (Grochow and Qiao, ITCS 2021), we show moderately exponential-time such reductions within\n                  <jats:italic>p<\/jats:italic>\n                  -groups of class 2 and exponent\n                  <jats:italic>p<\/jats:italic>\n                  .\n                <\/jats:p>\n              <\/jats:list-item>\n              <jats:list-item>\n                <jats:label>\u2022<\/jats:label>\n                <jats:p>\n                  Despite the widely held belief that\n                  <jats:italic>p<\/jats:italic>\n                  -groups of class 2 and exponent\n                  <jats:italic>p<\/jats:italic>\n                  are the hardest cases of\n                  <jats:sc>GpI<\/jats:sc>\n                  , there was no reduction to these groups from\n                  <jats:italic>any<\/jats:italic>\n                  larger class of groups. Again using methods from TI (ibid.), we show the first such reduction, namely from isomorphismtesting of\n                  <jats:italic>p<\/jats:italic>\n                  -groups of \u201csmall\u201d class and exponent\n                  <jats:italic>p<\/jats:italic>\n                  to those of class\n                  <jats:italic>two<\/jats:italic>\n                  and exponent\n                  <jats:italic>p<\/jats:italic>\n                  .\n                <\/jats:p>\n              <\/jats:list-item>\n            <\/jats:list>\n          <\/jats:p>\n          <jats:p>\n            For the first results, our main innovation is to develop linear-algebraic analogues of classical graph coloring gadgets, a key technique in studying the structural complexity of\n            <jats:sc>Graph Isomorphism<\/jats:sc>\n            . Unlike the graph coloring gadgets, which support restricting to various subgroups of the symmetric group, the problems we study require restricting to various subgroups of the general linear group, which entails significantly different and more complicated gadgets. The analysis of one of our gadgets relies on a classical result from group theory regarding random generation of classical groups (Kantor and Lubotzky,\n            <jats:italic>Geom. Dedicata<\/jats:italic>\n            , 1990). For the nilpotency class reduction, we combine a runtime analysis of the Lazard correspondence with TI-completeness results (Grochow and Qiao, ibid.).\n          <\/jats:p>","DOI":"10.1145\/3625308","type":"journal-article","created":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T08:11:50Z","timestamp":1695543110000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["On\n            <i>p<\/i>\n            -Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors"],"prefix":"10.1145","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6466-0476","authenticated-orcid":false,"given":"Joshua A.","family":"Grochow","sequence":"first","affiliation":[{"name":"Departments of Computer Science and Mathematics, University of Colorado Boulder, Boulder, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4334-1449","authenticated-orcid":false,"given":"Youming","family":"Qiao","sequence":"additional","affiliation":[{"name":"Centre for Quantum Software and Information, University of Technology Sydney, Ultimo, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2004.160.781"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.04.004"},{"key":"e_1_3_3_4_2","first-page":"66","article-title":"Isomorphism testing: Perspective and open problems","volume":"86","author":"Arvind Vikraman","year":"2005","unstructured":"Vikraman Arvind and Jacobo Tor\u00e1n. 2005. Isomorphism testing: Perspective and open problems. EATCS Bull. 86 (2005), 66\u201384.","journal-title":"EATCS Bull."},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.107"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","unstructured":"L\u00e1szl\u00f3 Babai Paolo Codenotti and Youming Qiao. 2012. Polynomial-time isomorphism test for groups with no abelian normal subgroups (extended abstract). In Automata Languages and Programming. Lecture Notes in Computer Science Vol. 7391. Springer 51\u201362. DOI:10.1007\/978-3-642-31594-7_5","DOI":"10.1007\/978-3-642-31594-7_5"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","unstructured":"L\u00e1szl\u00f3 Babai and Youming Qiao. 2012. Polynomial-time isomorphism test for groups with abelian Sylow towers. In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS\u201912). DOI:10.4230\/LIPIcs.STACS.2012.453","DOI":"10.4230\/LIPIcs.STACS.2012.453"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1938-1501972-1"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792228289"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1998.0258"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196702001115"},{"key":"e_1_3_3_13_2","volume-title":"Error-Correcting Linear Codes: Classification by Isometry and Applications","author":"Betten Anton","year":"2006","unstructured":"Anton Betten, Michael Braun, Harald Fripertinger, Adalbert Kerber, Axel Kohnert, and Alfred Wassermann. 2006. Error-Correcting Linear Codes: Classification by Isometry and Applications. Vol. 18. Springer Science and Business Media."},{"key":"e_1_3_3_14_2","unstructured":"Peter A. Brooksbank Joshua A. Grochow Yinan Li Youming Qiao and James B. Wilson. 2019. Incorporating Weisfeiler\u2013Leman into algorithms for group isomorphism. arXiv:1905.02518 [cs.CC] (2019)."},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","unstructured":"Peter A. Brooksbank Yinan Li Youming Qiao and James B. Wilson. 2020. Improved algorithms for alternating matrix space isometry: From theory to practice. In 28th Annual European Symposium on Algorithms (ESA 2020) Fabrizio Grandoni Grzegorz Herman and Peter Sanders (Eds.) Vol. 173. Leibniz International Proceedings in Informatics. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik Dagstuhl Germany Article 26 15 pages. DOI:10.4230\/LIPIcs.ESA.2020.26","DOI":"10.4230\/LIPIcs.ESA.2020.26"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2008.07.014"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2016.12.007"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1142\/S021819670800441X"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(02)00133-5"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258751"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2011.11.031"},{"issue":"6","key":"e_1_3_3_23_2","first-page":"487","article-title":"Projective geometry over  \\(\\mathbb {F}_1\\)  and the Gaussian binomial coefficients","volume":"111","author":"Cohn Henry","year":"2004","unstructured":"Henry Cohn. 2004. Projective geometry over \\(\\mathbb {F}_1\\) and the Gaussian binomial coefficients. Amer. Math. Monthly 111, 6 (2004), 487\u2013495.","journal-title":"Amer. Math. Monthly"},{"issue":"1","key":"e_1_3_3_24_2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/S0021-9800(66)80009-1","article-title":"The M\u00f6bius function of a lattice","volume":"1","author":"Crapo Henry H.","year":"1966","unstructured":"Henry H. Crapo. 1966. The M\u00f6bius function of a lattice. J. Comb. Theory 1, 1 (1966), 126\u2013131.","journal-title":"J. Comb. Theory"},{"key":"e_1_3_3_25_2","series-title":"North-Holland Mathematical Library","volume-title":"Lie Algebras: Theory and Algorithms","author":"Graaf W. A. de","year":"2000","unstructured":"W. A. de Graaf. 2000. Lie Algebras: Theory and Algorithms. North-Holland Mathematical Library, Vol. 56. Elsevier Science."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2635812"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/8009"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1999.0308"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1081\/AGB-120003468"},{"key":"e_1_3_3_30_2","first-page":"59","volume-title":"Computational Problems in Abstract Algebra (Proceedings of a Conference on Computational Problems in Algebra, Oxford, 1967)","author":"Felsch V.","year":"1970","unstructured":"V. Felsch and J. Neub\u00fcser. 1970. On a programme for the determination of the automorphism group of a finite group. In Computational Problems in Abstract Algebra (Proceedings of a Conference on Computational Problems in Algebra, Oxford, 1967), Pergamon J. Leech (Ed.). Oxford, 59\u201360."},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22162"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2018.12.022"},{"key":"e_1_3_3_33_2","article-title":"Answer to \u201cWhat Is the Hardest Instance for the Group Isomorphism Problem?\u201d on Theoretical Computer Science StackExchange","author":"Grochow Joshua A.","year":"2019","unstructured":"Joshua A. Grochow. 2019. Answer to \u201cWhat Is the Hardest Instance for the Group Isomorphism Problem?\u201d on Theoretical Computer Science StackExchange. Retrieved September 29, 2023 from https:\/\/cstheory.stackexchange.com\/a\/42551\/129","journal-title":"https:\/\/cstheory.stackexchange.com\/a\/42551\/129"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","unstructured":"Joshua A. Grochow and Youming Qiao. 2015. Polynomial-time isomorphism test of groups that are tame extensions (extended abstract). In Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC\u201915). 578\u2013589. DOI:10.1007\/978-3-662-48971-0_49","DOI":"10.1007\/978-3-662-48971-0_49"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009767"},{"key":"e_1_3_3_36_2","volume-title":"Proceedings of the 12th Innovations in Theoretical Computer Science (ITCS\u201921)","author":"Grochow Joshua A.","year":"2021","unstructured":"Joshua A. Grochow and Youming Qiao. 2021. On the complexity of isomorphism problems for tensors, groups, and polynomials I: Tensor isomorphism-completeness. In Proceedings of the 12th Innovations in Theoretical Computer Science (ITCS\u201921)."},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3372123"},{"key":"e_1_3_3_38_2","unstructured":"Xiaoyu He and Youming Qiao. 2020. On the Baer\u2013Lov\u00e1sz\u2013Tutte construction of groups from graphs: Isomorphism types and homomorphism notions. arXiv:2003.07200 [math.CO] (2020)."},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1727"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/345542.345620"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1137\/090781231"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03891-8_5"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","unstructured":"Zhengfeng Ji Youming Qiao Fang Song and Aaram Yun. 2019. General linear group action on tensors: A candidate for post-quantum cryptography. In Theory of Cryptography. Lecture Notes in Computer Science Vol. 11891. Springer 251\u2013281. DOI:10.1007\/978-3-030-36030-6_11","DOI":"10.1007\/978-3-030-36030-6_11"},{"key":"e_1_3_3_44_2","article-title":"Some topics in asymptotic group theory","author":"Kantor William M.","year":"1990","unstructured":"William M. Kantor. 1990. Some topics in asymptotic group theory. In Groups, Combinatorics and Geometry, Martin W. Liebeck and Jan Saxl (Eds.). Cambridge University Press, 403\u2013421.","journal-title":"Groups, Combinatorics and Geometry, Martin W. Liebeck and Jan Saxl (Eds.). Cambridge University Press, 403\u2013421."},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00181465"},{"key":"e_1_3_3_46_2","doi-asserted-by":"crossref","unstructured":"Neeraj Kayal and Timur Nezhmetdinov. 2009. Factoring groups efficiently. In Automata Languages and Programming. Lecture Notes in Computer Science Vol. 5555. Springer 585\u2013596.","DOI":"10.1007\/978-3-642-02927-1_49"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526008"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0333-9"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.24033\/asens.1021"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","unstructured":"Fran\u00e7ois Le Gall. 2009. Efficient isomorphism testing for a class of group extensions. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS\u201909). 625\u2013636. DOI:10.4230\/LIPIcs.STACS.2009.1830","DOI":"10.4230\/LIPIcs.STACS.2009.1830"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1515\/gcc-2012-0008"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.49"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267813"},{"key":"e_1_3_3_55_2","doi-asserted-by":"crossref","unstructured":"Eugene M. Luks. 1993. Permutation groups and polynomial-time computation. In Groups and Computation. DIMACS Series on Discrete Mathematics and Theoretical Computer Science Vol. 11. American Mathematical Society Providence RI 139\u2013175.","DOI":"10.1090\/dimacs\/011\/11"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301427"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90004-8"},{"key":"e_1_3_3_58_2","first-page":"45","article-title":"Practical graph isomorphism","author":"McKay Brendan D.","year":"1981","unstructured":"Brendan D. McKay. 1981. Practical graph isomorphism. Congr. Numer. 30 (1981), 45\u201387.","journal-title":"Congr. Numer."},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.2307\/2273227"},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804331"},{"key":"e_1_3_3_62_2","article-title":"Luks\u2019s Reduction of Graph Isomorphism to Code Equivalence","author":"Miyazaki Takunari","year":"1996","unstructured":"Takunari Miyazaki. 1996. Luks\u2019s Reduction of Graph Isomorphism to Code Equivalence. Comment to E. W. Clark. Retrieved September 29, 2023 from https:\/\/groups.google.com\/forum\/#!msg\/sci.math.research\/puZxGj9HXKI\/CeyH2yyyNFUJ","journal-title":"Comment to E. W. Clark"},{"key":"e_1_3_3_63_2","volume-title":"Lazard Correspondence up to Isoclinism","author":"Naik Vipul","year":"2013","unstructured":"Vipul Naik. 2013. Lazard Correspondence up to Isoclinism. Ph.D. Dissertation. University of Chicago. https:\/\/vipulnaik.com\/thesis\/"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","unstructured":"Jacques Patarin. 1996. Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms. In Advances in Cryptology\u2014EUROCRYPT\u201996. Lecture Notes in Computer Science Vol. 1070. Springer 33\u201348. DOI:10.1007\/3-540-68339-9_4","DOI":"10.1007\/3-540-68339-9_4"},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.623157"},{"key":"e_1_3_3_66_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2011.567"},{"key":"e_1_3_3_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80017-X"},{"key":"e_1_3_3_68_2","article-title":"Bidirectional collision detection and faster deterministic isomorphism testing","author":"Rosenbaum David J.","year":"2013","unstructured":"David J. Rosenbaum. 2013. Bidirectional collision detection and faster deterministic isomorphism testing. arXiv preprint arXiv:1304.3935 [cs.DS] (2013).","journal-title":"arXiv preprint arXiv:1304.3935 [cs.DS]"},{"key":"e_1_3_3_69_2","first-page":"1054","volume-title":"Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Rosenbaum David J.","year":"2013","unstructured":"David J. Rosenbaum. 2013. Breaking the \\(n^{\\log n}\\) barrier for solvable-group isomorphism. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms. 1054\u20131073."},{"key":"e_1_3_3_70_2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-642-38616-9_14","volume-title":"Proceedings of the International Workshop on Post-Quantum Cryptography","author":"Sendrier Nicolas","year":"2013","unstructured":"Nicolas Sendrier and Dimitris E. Simos. 2013. The hardness of code equivalence over \\(\\mathbb {F}_q\\) and its application to code-based cryptography. In Proceedings of the International Workshop on Post-Quantum Cryptography. 203\u2013216."},{"key":"e_1_3_3_71_2","doi-asserted-by":"publisher","DOI":"10.1137\/0220053"},{"key":"e_1_3_3_72_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90097-1"},{"key":"e_1_3_3_73_2","article-title":"2014 Conference on Groups, Computation, and Geometry at Colorado State University, Co-organized by P. Brooksbank, A. Hulpke, T. Penttila, J. Wilson, and W. Kantor","author":"Wilson James","year":"2014","unstructured":"James Wilson. 2014. 2014 Conference on Groups, Computation, and Geometry at Colorado State University, Co-organized by P. Brooksbank, A. Hulpke, T. Penttila, J. Wilson, and W. Kantor. Personal communication.","journal-title":"Personal communication"},{"key":"e_1_3_3_74_2","article-title":"Finding direct product decompositions in polynomial time","author":"Wilson James B.","year":"2010","unstructured":"James B. Wilson. 2010. Finding direct product decompositions in polynomial time. arXiv:1005.0548 [math.GR] (2010).","journal-title":"arXiv:1005.0548 [math.GR]"},{"key":"e_1_3_3_75_2","doi-asserted-by":"publisher","DOI":"10.1515\/gcc-2012-0007"},{"key":"e_1_3_3_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02104746"}],"container-title":["ACM Transactions on Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3625308","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3625308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:33Z","timestamp":1750178193000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3625308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,12]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,31]]}},"alternative-id":["10.1145\/3625308"],"URL":"https:\/\/doi.org\/10.1145\/3625308","relation":{},"ISSN":["1942-3454","1942-3462"],"issn-type":[{"value":"1942-3454","type":"print"},{"value":"1942-3462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,12]]},"assertion":[{"value":"2022-05-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-09-20","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}