{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T15:09:22Z","timestamp":1784214562570,"version":"3.55.0"},"reference-count":102,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:00:00Z","timestamp":1705017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2024,5,31]]},"abstract":"<jats:p>Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness guarantees for distributed systems that must operate in the presence of arbitrary failures. Recently, numerous new BFT algorithms have been proposed, not least due to the traction blockchain technologies have garnered in the search for consensus solutions that offer high throughput, low latency, and robust system designs. In this article, we conduct a systematic survey of selected and distinguished BFT algorithms that have received extensive attention in academia and industry alike. We perform a qualitative comparison among all algorithms we review considering message and time complexities. Furthermore, we provide a comprehensive, step-by-step description of each surveyed algorithm by decomposing them into constituent subprotocols with intuitive figures to illustrate the message-passing pattern. We also elaborate on the strengths and weaknesses of each algorithm compared to the other state-of-the-art approaches.<\/jats:p>\n          <jats:p\/>","DOI":"10.1145\/3636553","type":"journal-article","created":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T12:11:02Z","timestamp":1702123862000},"page":"1-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":97,"title":["Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms"],"prefix":"10.1145","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4112-9893","authenticated-orcid":false,"given":"Gengrui","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1771-0397","authenticated-orcid":false,"given":"Fei","family":"Pan","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0557-7496","authenticated-orcid":false,"given":"Yunhao","family":"Mao","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3436-3893","authenticated-orcid":false,"given":"Sofia","family":"Tijanic","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2736-1113","authenticated-orcid":false,"given":"Michael","family":"Dang\u2019ana","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8246-2933","authenticated-orcid":false,"given":"Shashank","family":"Motepalli","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7112-2463","authenticated-orcid":false,"given":"Shiquan","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0813-0101","authenticated-orcid":false,"given":"Hans-Arno","family":"Jacobsen","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2010.70"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190538"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.5555\/983102"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.53"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.23919\/MIPRO.2018.8400278"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258486"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318041.3355458"},{"key":"e_1_3_1_9_2","article-title":"State machine replication in the libra blockchain","author":"Baudet Mathieu","year":"2019","unstructured":"Mathieu Baudet, Avery Ching, Andrey Chursin, George Danezis, Fran\u00e7ois Garillot, Zekun Li, Dahlia Malkhi, Oded Naor, Dmitri Perelman, and Alberto Sonnino. 2019. State machine replication in the libra blockchain. The Libra Assn., Tech. Rep (2019).","journal-title":"The Libra Assn., Tech. Rep"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0083-3"},{"key":"e_1_3_1_11_2","first-page":"183","volume-title":"Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing","author":"Ben-Or Michael","year":"1994","unstructured":"Michael Ben-Or, Boaz Kelmer, and Tal Rabin. 1994. Asynchronous secure computations with optimal resilience. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing. 183\u2013192."},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.43"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343502"},{"key":"e_1_3_1_15_2","volume-title":"Tendermint: Byzantine Fault Tolerance in the Age of Blockchains","author":"Buchman Ethan","year":"2016","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Ph.D. Dissertation."},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3572771"},{"key":"e_1_3_1_17_2","unstructured":"Vitalik Buterin and Virgil Griffith. 2017. Casper the friendly finality gadget. arXiv:1710.09437. Retrieved from https:\/\/arxiv.org\/abs\/1710.09437. Accessed 2017."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_1_20_2","volume-title":"Proceedings of the 31st International Symposium on Distributed Computing","author":"Cachin Christian","year":"2017","unstructured":"Christian Cachin and Marko Vukoli\u0107. 2017. Blockchain consensus protocols in the wild. In Proceedings of the 31st International Symposium on Distributed Computing."},{"key":"e_1_3_1_21_2","article-title":"Practical Byzantine Fault Tolerance","author":"Castro Miguel","year":"2001","unstructured":"Miguel Castro. 2001. Practical Byzantine Fault Tolerance. Technical Report MIT\/LCS\/TR-817. MIT Laboratory for Computer Science.","journal-title":"Technical Report MIT\/LCS\/TR-817. MIT Laboratory for Computer Science."},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_1_23_2","first-page":"173","volume-title":"Proceedings of the OSDI","year":"1999","unstructured":"Miguel Castro and Barbara Liskov. 1999. Practical byzantine fault tolerance. In Proceedings of the OSDI. 173\u2013186."},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1651946"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.5555\/1558977.1558988"},{"key":"e_1_3_1_26_2","first-page":"153","volume-title":"Proceedings of the NSDI","author":"Clement Allen","year":"2009","unstructured":"Allen Clement, Edmund L Wong, Lorenzo Alvisi, Michael Dahlin, and Mirco Marchetti. 2009. Making byzantine fault tolerant systems tolerate byzantine faults. In Proceedings of the NSDI. 153\u2013168."},{"key":"e_1_3_1_27_2","unstructured":"Tyler Crain Vincent Gramoli Mikel Larrea and Michel Raynal. 2017. DBFT: Efficient byzantine consensus with a weak coordinator and its application to consortium blockchains. arXiv:1702.03068. Retrieved from https:\/\/arxiv.org\/abs\/1702.03068. Accessed 2017."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2018.8548057"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00040"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_1_31_2","unstructured":"Diem. 2020. The Diem blockchain. Retrieved from https:\/\/developers.diem.com\/main\/docs\/the-diem-blockchain-paper"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_12"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3436728"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7533"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3054977.3055003"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2017.64"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_10"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/800215.806583"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3616537"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755950"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00063"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00124"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380757"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3573896"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281122"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_16"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2004.1311928"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.229904"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322398"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3335772.3335936"},{"key":"e_1_3_1_60_2","volume-title":"Proceedings of the NSDI","author":"Li Jinyuan","year":"2007","unstructured":"Jinyuan Li and David Mazieres. 2007. Beyond one-third faulty replicas in byzantine fault tolerant systems.. In Proceedings of the NSDI."},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-335-6.50027-1"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90109-2"},{"key":"e_1_3_1_63_2","volume-title":"The Theory of Error Correcting Codes","author":"MacWilliams Florence Jessie","year":"1977","unstructured":"Florence Jessie MacWilliams and Neil James Alexander Sloane. 1977. The Theory of Error Correcting Codes. Elsevier."},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.1997.596799"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2013.15"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611468"},{"key":"e_1_3_1_68_2","unstructured":"Shashank Motepalli and Hans-Arno Jacobsen. 2022. Decentralizing permissioned blockchain with delay towers. arXiv preprint arXiv:2203.09714."},{"key":"e_1_3_1_69_2","first-page":"21260","article-title":"Bitcoin: A peer-to-peer electronic cash system","author":"Nakamoto Satoshi","year":"2008","unstructured":"Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review (2008), 21260.","journal-title":"Decentralized Business Review"},{"key":"e_1_3_1_70_2","first-page":"305","volume-title":"Proceedings of the 2014 USENIX Annual Technical Conference (USENIX ATC 14)","author":"Ongaro Diego","year":"2014","unstructured":"Diego Ongaro and John Ousterhout. 2014. In search of an understandable consensus algorithm. In Proceedings of the 2014 USENIX Annual Technical Conference (USENIX ATC 14). 305\u2013319."},{"key":"e_1_3_1_71_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7_4"},{"key":"e_1_3_1_72_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00268134"},{"key":"e_1_3_1_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357178"},{"key":"e_1_3_1_74_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-005-2631-2"},{"key":"e_1_3_1_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_1_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11659-4_12"},{"key":"e_1_3_1_77_2","first-page":"91","volume-title":"Proceedings of the 9th Annual ACM Symposium on Theory of Computing","author":"Peterson Gary L.","year":"1977","unstructured":"Gary L. Peterson and Michael J. Fischer. 1977. Economical solutions for the critical section problem in a distributed system. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing. 91\u201397."},{"key":"e_1_3_1_78_2","unstructured":"Parth Deshmukh Sean Maginnis and Josh Chandler. 2011. Jerasure 2.0. Chancellor\u2019s Honors Program Projects. https:\/\/trace.tennessee.edu\/utk_chanhonoproj\/1362"},{"key":"e_1_3_1_79_2","doi-asserted-by":"crossref","unstructured":"Maciel M. Queiroz Renato Telles and Silvia H. Bonilla. 2020. Blockchain and supply chain management integration: a systematic review of the literature. Supply Chain Management: An International Journal 25 2 (2020) 241\u2013254.","DOI":"10.1108\/SCM-03-2018-0143"},{"key":"e_1_3_1_80_2","doi-asserted-by":"publisher","DOI":"10.1145\/177492.177745"},{"key":"e_1_3_1_81_2","doi-asserted-by":"crossref","unstructured":"Robert W. Floyd. 1967. Assigning meanings to programs. In Program Verification: Fundamental Issues in Computer Science. Springer 65\u201381.","DOI":"10.1007\/978-94-011-1793-7_4"},{"key":"e_1_3_1_82_2","doi-asserted-by":"publisher","DOI":"10.1145\/190.357399"},{"key":"e_1_3_1_83_2","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_1_84_2","volume-title":"Scrooge: Stable Speculative Byzantine Fault Tolerance Using Testifiers","author":"Serafini M.","year":"2008","unstructured":"M. Serafini, P. Bokor, and N. Suri. 2008. Scrooge: Stable Speculative Byzantine Fault Tolerance Using Testifiers. Technical Report. Darmstadt University of Technology, Department of Computer Science."},{"key":"e_1_3_1_85_2","first-page":"467","volume-title":"Proceedings of the 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201922)","year":"2022","unstructured":"Alex Shamis, Peter Pietzuch, Burcu Canakci, Miguel Castro, C\u00e9dric Fournet, Edward Ashton, Amaury Chamayou, Sylvan Clebsch, Antoine Delignat-Lavaud, and Matthew Kerner. 2022. IA-CCF: Individual accountability for permissioned ledgers. In Proceedings of the 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201922). 467\u2013491."},{"key":"e_1_3_1_86_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_1_87_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054113"},{"key":"e_1_3_1_88_2","article-title":"Fault-tolerant architectures for space and avionics applications","author":"Siewiorek Daniel P.","year":"2005","unstructured":"Daniel P. Siewiorek and Priya Narasimhan. 2005. Fault-tolerant architectures for space and avionics applications. NASA Ames Researchhttp:\/\/ic.arc.nasa.gov\/projects\/ishem\/Papers\/Siewi","journal-title":"NASA Ames Research"},{"key":"e_1_3_1_89_2","unstructured":"Alexander Spiegelman Balaji Aurn Rati Gelashvili and Zekun Li. 2023. Shoal: Improving DAG-BFT latency and robustness. arXiv:2306.03058. Retrieved from https:\/\/arxiv.org\/abs\/2306.03058. Accessed 2023."},{"key":"e_1_3_1_90_2","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559361"},{"key":"e_1_3_1_91_2","unstructured":"Chrysoula Stathakopoulou Tudor David Matej Pavlovic and Marko Vukoli\u0107. 2019. Mir-bft: High-throughput robust bft for decentralized networks. arXiv:1906.05552. Retrieved from https:\/\/arxiv.org\/abs\/1906.05552. Accessed 2019."},{"key":"e_1_3_1_92_2","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519579"},{"key":"e_1_3_1_93_2","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS53918.2021.00013"},{"key":"e_1_3_1_94_2","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2018.00034"},{"key":"e_1_3_1_95_2","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2009.36"},{"key":"e_1_3_1_96_2","doi-asserted-by":"publisher","DOI":"10.1109\/HASE.2005.23"},{"key":"e_1_3_1_97_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1978.11114"},{"key":"e_1_3_1_98_2","article-title":"Zfec 1.5. 2","author":"Wilcox-O\u2019Hearn Z.","unstructured":"Z. Wilcox-O\u2019Hearn. [n.d.]. Zfec 1.5. 2. Open Source Code Distribution:https:\/\/pypi.python.org\/pypi\/zfec. Accessed 2023.","journal-title":"Open Source Code Distribution:"},{"key":"e_1_3_1_99_2","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_3_1_100_2","doi-asserted-by":"publisher","DOI":"10.1145\/3464298.3484503"},{"key":"e_1_3_1_101_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS54860.2022.00066"},{"key":"e_1_3_1_102_2","volume-title":"Proceedings of the 2021 IEEE 40th International Conference on Data Engineering (ICDE)","author":"Zhang Gengrui","year":"2024","unstructured":"Gengrui Zhang, Fei Pan, Sofia Tijanic, and Hans-Arno Jacobsen. 2024. PrestigeBFT: Revolutionizing view changes in BFT consensus algorithms with reputation mechanisms. In Proceedings of the 2021 IEEE 40th International Conference on Data Engineering (ICDE). IEEE."},{"key":"e_1_3_1_103_2","first-page":"633","volume-title":"Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","author":"Zhang Yunhao","year":"2020","unstructured":"Yunhao Zhang, Srinath Setty, Qi Chen, Lidong Zhou, and Lorenzo Alvisi. 2020. Byzantine ordered consensus without Byzantine oligarchy. In Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20). 633\u2013649."}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3636553","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3636553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:04Z","timestamp":1750295404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3636553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,12]]},"references-count":102,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,5,31]]}},"alternative-id":["10.1145\/3636553"],"URL":"https:\/\/doi.org\/10.1145\/3636553","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,12]]},"assertion":[{"value":"2022-08-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}