{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T10:03:06Z","timestamp":1763114586293,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Swiss National Science Foundation","award":["172610"],"award-info":[{"award-number":["172610"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538585","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"247-258","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Scalable Fine-Grained Parallel Cycle Enumeration Algorithms"],"prefix":"10.1145","author":[{"given":"Jovan","family":"Blanusa","sequence":"first","affiliation":[{"name":"IBM Research Europe & Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Zurich, Switzerland"}]},{"given":"Paolo","family":"Ienne","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Lausanne, Switzerland"}]},{"given":"Kubilay","family":"Atasu","sequence":"additional","affiliation":[{"name":"IBM Research Europe, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.60"},{"key":"e_1_3_2_1_2_1","volume-title":"Aggarwal and Haixun Wang (Eds.)","author":"Charu","year":"2010","unstructured":"Charu C. Aggarwal and Haixun Wang (Eds.) . 2010 . Managing and Mining Graph Data. Advances in Database Systems, Vol. 40 . Springer US , Boston, MA. doi: 10.1007\/978--1--4419--6045-0. 10.1007\/978--1--4419--6045-0 Charu C. Aggarwal and Haixun Wang (Eds.). 2010. Managing and Mining Graph Data. Advances in Database Systems, Vol. 40. Springer US, Boston, MA. doi: 10.1007\/978--1--4419--6045-0."},{"key":"e_1_3_2_1_3_1","unstructured":"Erik Altman. 2021. AML-Data. Available online: https:\/\/github.com\/IBM\/AMLData. Accessed: 2022-05--30.  Erik Altman. 2021. AML-Data. Available online: https:\/\/github.com\/IBM\/AMLData. Accessed: 2022-05--30."},{"volume-title":"Network science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","key":"e_1_3_2_1_4_1","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and M\u00e1rton P\u00f3sfai . 2016. Network science . Cambridge University Press , Cambridge, United Kingdom, Chapter The scale-free property, 1--57. Albert-L\u00e1szl\u00f3 Barab\u00e1si and M\u00e1rton P\u00f3sfai. 2016. Network science. Cambridge University Press, Cambridge, United Kingdom, Chapter The scale-free property, 1--57."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.134"},{"key":"e_1_3_2_1_6_1","first-page":"12","article-title":"Manycore clique enumeration with fast set intersections","volume":"13","author":"Blanusa Jovan","year":"2020","unstructured":"Jovan Blanusa , Radu Stoica , Paolo Ienne , and Kubilay Atasu . 2020 . Manycore clique enumeration with fast set intersections . PVLDB 13 , 12 (Aug. 2020), 2676--2690. doi: 10.14778\/3407790.3407853. 10.14778\/3407790.3407853 Jovan Blanusa, Radu Stoica, Paolo Ienne, and Kubilay Atasu. 2020. Manycore clique enumeration with fast set intersections. PVLDB 13, 12 (Aug. 2020), 2676--2690. doi: 10.14778\/3407790.3407853.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_7_1","first-page":"25","article-title":"Parallel Algorithms. CRC Press, London, England","volume":"25","author":"Blelloch Guy E.","year":"2010","unstructured":"Guy E. Blelloch and Bruce M. Maggs . 2010 . Parallel Algorithms. CRC Press, London, England , Chapter 25 , 25 .1--25.40. Guy E. Blelloch and Bruce M. Maggs. 2010. Parallel Algorithms. CRC Press, London, England, Chapter 25, 25.1--25.40.","journal-title":"Chapter"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-08746-5"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 1993 ACM\/IEEE conference on Supercomputing - Supercomputing '93","author":"Forum CORPORATE","year":"1993","unstructured":"CORPORATE The MPI Forum . 1993 . MPI: a message passing interface . In Proceedings of the 1993 ACM\/IEEE conference on Supercomputing - Supercomputing '93 . ACM Press, Portland, Oregon, United States, 878--883. doi: 10.1145\/169627.169855. 10.1145\/169627.169855 CORPORATE The MPI Forum. 1993. MPI: a message passing interface. In Proceedings of the 1993 ACM\/IEEE conference on Supercomputing - Supercomputing '93. ACM Press, Portland, Oregon, United States, 878--883. doi: 10.1145\/169627.169855."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.3390\/a10040115"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1968.1082837"},{"key":"e_1_3_2_1_15_1","volume-title":"Shared-Memory Parallel Maximal Biclique Enumeration. In 2019 IEEE 26th International Conference on High Performance Computing, Data, and Analytics (HiPC). IEEE","author":"Das Apurba","year":"2019","unstructured":"Apurba Das and Srikanta Tirthapura . 2019 . Shared-Memory Parallel Maximal Biclique Enumeration. In 2019 IEEE 26th International Conference on High Performance Computing, Data, and Analytics (HiPC). IEEE , Hyderabad, India, 34--43. doi: 10.1109\/HiPC. 2019.00016. 10.1109\/HiPC.2019.00016 Apurba Das and Srikanta Tirthapura. 2019. Shared-Memory Parallel Maximal Biclique Enumeration. In 2019 IEEE 26th International Conference on High Performance Computing, Data, and Analytics (HiPC). IEEE, Hyderabad, India, 34--43. doi: 10.1109\/HiPC.2019.00016."},{"key":"e_1_3_2_1_16_1","first-page":"3","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd's P.","year":"1959","unstructured":"P. Erd's and T. Gallai . 1959 . On maximal paths and circuits of graphs . Acta Mathematica Academiae Scientiarum Hungaricae 10 , 3 -- 4 (Sept. 1959), 337--356. doi: 10.1007\/BF02024498. 10.1007\/BF02024498 P. Erd's and T. Gallai. 1959. On maximal paths and circuits of graphs. Acta Mathematica Academiae Scientiarum Hungaricae 10, 3--4 (Sept. 1959), 337--356. doi: 10.1007\/BF02024498.","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45591-4_68"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/321541.321545"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx005"},{"volume-title":"Encyclopedia of Algorithms","author":"Grossi Roberto","key":"e_1_3_2_1_20_1","unstructured":"Roberto Grossi . 2016. Enumeration of Paths, Cycles, and Spanning Trees . In Encyclopedia of Algorithms . Springer New York , New York, NY , 640--645. doi: 10.1007\/978--1--4939--2864--4_728. 10.1007\/978--1--4939--2864--4_728 Roberto Grossi. 2016. Enumeration of Paths, Cycles, and Spanning Trees. In Encyclopedia of Algorithms. Springer New York, New York, NY, 640--645. doi: 10.1007\/978--1--4939--2864--4_728."},{"key":"e_1_3_2_1_21_1","volume-title":"IEEE\/ACM International Conference on Computer-Aided Design, 2005","author":"Gupta A.","year":"2005","unstructured":"A. Gupta and C. Selvidge . 2005. Acyclic modeling of combinational loops. In ICCAD-2005 . IEEE\/ACM International Conference on Computer-Aided Design, 2005 . IEEE, San Jose, CA, 343--348. doi: 10.1109\/ICCAD. 2005 .1560091. 10.1109\/ICCAD.2005.1560091 A. Gupta and C. Selvidge. 2005. Acyclic modeling of combinational loops. In ICCAD-2005. IEEE\/ACM International Conference on Computer-Aided Design, 2005. IEEE, San Jose, CA, 343--348. doi: 10.1109\/ICCAD.2005.1560091."},{"key":"e_1_3_2_1_22_1","unstructured":"Anshul Gupta and Toyotaro Suzumura. 2021. Finding All Bounded-Length Simple Cycles in a Directed Graph. arXiv:2105.10094 [cs.DS]  Anshul Gupta and Toyotaro Suzumura. 2021. Finding All Bounded-Length Simple Cycles in a Directed Graph. arXiv:2105.10094 [cs.DS]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-55814-7_12"},{"key":"e_1_3_2_1_24_1","volume-title":"2009 12th International Conference on Computers and Information Technology. IEEE, Dhaka, Bangladesh, 237--242","author":"Nazrul Islam Md.","year":"2009","unstructured":"Md. Nazrul Islam , S. M. Rafizul Haque , Kaji Masudul Alam , and Md. Tarikuzzaman . 2009 . An approach to improve collusion set detection using MCL algorithm . In 2009 12th International Conference on Computers and Information Technology. IEEE, Dhaka, Bangladesh, 237--242 . doi: 10.1109\/ICCIT.2009.5407133. 10.1109\/ICCIT.2009.5407133 Md. Nazrul Islam, S. M. Rafizul Haque, Kaji Masudul Alam, and Md. Tarikuzzaman. 2009. An approach to improve collusion set detection using MCL algorithm. In 2009 12th International Conference on Computers and Information Technology. IEEE, Dhaka, Bangladesh, 237--242. doi: 10.1109\/ICCIT.2009.5407133."},{"volume-title":"Introduction to parallel algorithms","author":"JaJa Joseph","key":"e_1_3_2_1_25_1","unstructured":"Joseph JaJa . 1992. Introduction to parallel algorithms . Addison Wesley, Boston , MA. Joseph JaJa. 1992. Introduction to parallel algorithms. Addison Wesley, Boston, MA."},{"key":"#cr-split#-e_1_3_2_1_26_1.1","unstructured":"Jaroslaw Jankowski Radoslaw Michalski and Piotr Br\u00f3dka. 2017. Spreading processes in multilayer complex network within virtual world. doi: 10.7910\/DVN\/V6AJRV. 10.7910\/DVN"},{"key":"#cr-split#-e_1_3_2_1_26_1.2","unstructured":"Jaroslaw Jankowski Radoslaw Michalski and Piotr Br\u00f3dka. 2017. Spreading processes in multilayer complex network within virtual world. doi: 10.7910\/DVN\/V6AJRV."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/21649502.2013.802877"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1967.1082699"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-181"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1535\/itj.1104.05"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236197"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-8-430"},{"key":"e_1_3_2_1_35_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. Available online: https:\/\/snap.stanford.edu\/data. Accessed: 2022-05--30.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. Available online: https:\/\/snap.stanford.edu\/data. Accessed: 2022-05--30."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(82)90023-8"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205007"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2576928"},{"key":"e_1_3_2_1_42_1","volume-title":"Graph algorithms : practical examples in Apache Spark and Neo4j. O'Reilly","author":"Needham Mark","year":"2047","unstructured":"Mark Needham . 2019. Graph algorithms : practical examples in Apache Spark and Neo4j. O'Reilly , Beijing . isbn: 978--149 2047 681. Mark Needham. 2019. Graph algorithms : practical examples in Apache Spark and Neo4j. O'Reilly, Beijing. isbn: 978--1492047681."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2003305"},{"key":"#cr-split#-e_1_3_2_1_44_1.1","doi-asserted-by":"crossref","unstructured":"S. Noel E. Harley K.H. Tam M. Limiero and M. Share. 2016. CyGraph: Graph-Based Analytics and Visualization for Cybersecurity. In Handbook of Statistics. Vol. 35. Elsevier Oxford England 117--167. doi: 10.1016\/bs.host.2016.07.001. 10.1016\/bs.host.2016.07.001","DOI":"10.1016\/bs.host.2016.07.001"},{"key":"#cr-split#-e_1_3_2_1_44_1.2","doi-asserted-by":"crossref","unstructured":"S. Noel E. Harley K.H. Tam M. Limiero and M. Share. 2016. CyGraph: Graph-Based Analytics and Visualization for Cybersecurity. In Handbook of Statistics. Vol. 35. Elsevier Oxford England 117--167. doi: 10.1016\/bs.host.2016.07.001.","DOI":"10.1016\/bs.host.2016.07.001"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-007-0076-8"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372720"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/0114051"},{"key":"e_1_3_2_1_49_1","volume-title":"Filed","author":"Pothukuchi Sri Harsha","year":"2021","unstructured":"Sri Harsha Pothukuchi and Amit Dhuria . 2021 . Deterministic loop breaking in multi-mode multi-corner static timing analysis of integrated circuits. Patent No. 11003821 , Filed Feb 21, 2020, Issued May 11, 2021. Sri Harsha Pothukuchi and Amit Dhuria. 2021. Deterministic loop breaking in multi-mode multi-corner static timing analysis of integrated circuits. Patent No. 11003821, Filed Feb 21, 2020, Issued May 11, 2021."},{"volume-title":"Database Systems for Advanced Applications.","author":"Qing Zhu","key":"e_1_3_2_1_50_1","unstructured":"Zhu Qing , Long Yuan , Zi Chen , Jingjing Lin , and Guojie Ma. 2020. Efficient Parallel Cycle Search in Large Graphs . In Database Systems for Advanced Applications. Vol. 12113 . Springer International Publishing , Cham, Switzerland , 349--367. doi: 10.1007\/978--3-030--59416--9_21. 10.1007\/978--3-030--59416--9_21 Zhu Qing, Long Yuan, Zi Chen, Jingjing Lin, and Guojie Ma. 2020. Efficient Parallel Cycle Search in Large Graphs. In Database Systems for Advanced Applications. Vol. 12113. Springer International Publishing, Cham, Switzerland, 349--367. doi: 10.1007\/978--3-030--59416--9_21."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"volume-title":"Parallel programming in C with MPI and openMP","author":"Quinn Michael J.","key":"e_1_3_2_1_52_1","unstructured":"Michael J. Quinn . 2004. Parallel programming in C with MPI and openMP . McGraw-Hill, Dubuque , Iowa . Michael J. Quinn. 2004. Parallel programming in C with MPI and openMP. McGraw-Hill, Dubuque, Iowa."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.3.237"},{"volume-title":"2015 Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO). SOBRAPO, Porto de Galinhas, Pernambuco, Brasil, 1--12","author":"Rocha Rodrigo Caetano","key":"e_1_3_2_1_54_1","unstructured":"Rodrigo Caetano Rocha and Bhalchandra D. Thatte . 2015. Distributed cycle detection in large-scale sparse graphs . In 2015 Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO). SOBRAPO, Porto de Galinhas, Pernambuco, Brasil, 1--12 . doi: 10.13140\/RG.2.1.1233.8640. 10.13140\/RG.2.1.1233.8640 Rodrigo Caetano Rocha and Bhalchandra D. Thatte. 2015. Distributed cycle detection in large-scale sparse graphs. In 2015 Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO). SOBRAPO, Porto de Galinhas, Pernambuco, Brasil, 1--12. doi: 10.13140\/RG.2.1.1233.8640."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_56_1","unstructured":"SAS. 2021. SAS OPTGRAPH Procedure: Graph Algorithms and Network Analysis. Available online: https:\/\/documentation.sas.com\/doc\/en\/pgmsascdc\/9.4_3.5\/ procgralg\/procgralg_optgraph_examples.htm. Accessed: 2022-05--30.  SAS. 2021. SAS OPTGRAPH Procedure: Graph Algorithms and Network Analysis. Available online: https:\/\/documentation.sas.com\/doc\/en\/pgmsascdc\/9.4_3.5\/ procgralg\/procgralg_optgraph_examples.htm. Accessed: 2022-05--30."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2015.7477467"},{"key":"e_1_3_2_1_58_1","unstructured":"Toyotaro Suzumura and Hiroki Kanezashi. 2021. Anti-Money Laundering Datasets: InPlusLab Anti-Money Laundering Datasets. Available online: https:\/\/github.com\/IBM\/AMLSim. Accessed: 2022-05--30.  Toyotaro Suzumura and Hiroki Kanezashi. 2021. Anti-Money Laundering Datasets: InPlusLab Anti-Money Laundering Datasets. Available online: https:\/\/github.com\/IBM\/AMLSim. Accessed: 2022-05--30."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01931370"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202017"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/362814.362819"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3406469"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/321679.321684"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/800197.806053"},{"key":"e_1_3_2_1_68_1","first-page":"1","article-title":"Cycle Based Network Centrality","volume":"8","author":"Zhou Xiaoping","year":"2018","unstructured":"Xiaoping Zhou , Xun Liang , Jichao Zhao , and Shusen Zhang . 2018 . Cycle Based Network Centrality . Sci Rep 8 , 1 (Dec. 2018), 11749. doi: 10.1038\/s41598-018--30249--4. 10.1038\/s41598-018--30249--4 Xiaoping Zhou, Xun Liang, Jichao Zhao, and Shusen Zhang. 2018. Cycle Based Network Centrality. Sci Rep 8, 1 (Dec. 2018), 11749. doi: 10.1038\/s41598-018--30249--4.","journal-title":"Sci Rep"}],"event":{"name":"SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538585","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:10Z","timestamp":1750186930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":68,"alternative-id":["10.1145\/3490148.3538585","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538585","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}