{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:59:28Z","timestamp":1773511168126,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":73,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-2020-221"],"award-info":[{"award-number":["W911NF-2020-221"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2038986,CNS-2038566"],"award-info":[{"award-number":["CNS-2038986,CNS-2038566"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670326","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"2621-2635","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Random Beacons in Monte Carlo: Efficient Asynchronous Random Beacon\n            <i>without<\/i>\n            Threshold Cryptography"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9669-5788","authenticated-orcid":false,"given":"Akhil","family":"Bandarupalli","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4099-4014","authenticated-orcid":false,"given":"Adithya","family":"Bhat","sequence":"additional","affiliation":[{"name":"Visa Research, Foster City, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4239-5632","authenticated-orcid":false,"given":"Saurabh","family":"Bagchi","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2246-8416","authenticated-orcid":false,"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[{"name":"Purdue University \/ Supra Research, West Lafayette, IN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7007-8274","authenticated-orcid":false,"given":"Michael K.","family":"Reiter","sequence":"additional","affiliation":[{"name":"Duke University \/ Chainlink Labs, Durham, NC, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Optimal Resilience Asynchronous Approximate Agreement (OPODIS'04)","author":"Abraham Ittai","unstructured":"Ittai Abraham, Yonatan Amit, and Danny Dolev. 2004. Optimal Resilience Asynchronous Approximate Agreement (OPODIS'04). Springer-Verlag, Berlin, Heidelberg, 229--239."},{"key":"e_1_3_2_1_2_1","unstructured":"Ittai Abraham Gilad Asharov Arpita Patra and Gilad Stern. 2023. Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC. Cryptology ePrint Archive Paper 2023\/1130. https:\/\/eprint.iacr.org\/2023\/1130 https:\/\/eprint.iacr.org\/2023\/1130."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538426"},{"key":"e_1_3_2_1_4_1","volume-title":"Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation. In CRYPTO 2023","author":"Abraham Ittai","year":"2023","unstructured":"Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, and Gilad Stern. 2023. Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation. In CRYPTO 2023 (Santa Barbara, CA, USA). 39--70."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_1_7_1","volume-title":"Information Theoretic HotStuff. In OPODIS","volume":"184","author":"Abraham Ittai","year":"2020","unstructured":"Ittai Abraham and Gilad Stern. [n.,d.]. Information Theoretic HotStuff. In OPODIS 2020, Vol. 184. 11:1--11:16."},{"key":"e_1_3_2_1_8_1","unstructured":"Ittai Abraham and Gilad Stern. 2019. Trusted Setup assumptions https:\/\/decentralizedthoughts.github.io\/2019-07-19-setup-assumptions\/."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_32"},{"key":"e_1_3_2_1_10_1","volume-title":"Reiter","author":"Bandarupalli Akhil","year":"2024","unstructured":"Akhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate, Chen-Da Liu-Zhang, and Michael K. Reiter. 2024. Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles. In IEEE\/IFIP DSN 2024. 14 pages."},{"key":"e_1_3_2_1_11_1","unstructured":"Akhil Bandarupalli Adithya Bhat Saurabh Bagchi Aniket Kate and Michael Reiter. 2023. HashRand: Efficient Asynchronous Random Beacon without Threshold Cryptographic Setup. Cryptology ePrint Archive Paper 2023\/1755. https:\/\/eprint.iacr.org\/2023\/1755"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_15"},{"key":"e_1_3_2_1_13_1","volume-title":"OptRand: Optimistically Responsive Reconfigurable Distributed Randomness. In NDSS","author":"Bhat Adithya","year":"2023","unstructured":"Adithya Bhat, Nibesh Shrestha, Aniket Kate, and Kartik Nayak. 2023. OptRand: Optimistically Responsive Reconfigurable Distributed Randomness. In NDSS 2023. The Internet Society."},{"key":"e_1_3_2_1_14_1","first-page":"3502","article-title":"RandPiper","volume":"2021","author":"Bhat Adithya","year":"2021","unstructured":"Adithya Bhat, Nibesh Shrestha, Zhongtang Luo, Aniket Kate, and Kartik Nayak. 2021. RandPiper: Reconfiguration-Friendly Random Beacons with Quadratic Communication. In CCS 2021. 3502--3524.","journal-title":"Reconfiguration-Friendly Random Beacons with Quadratic Communication. In CCS"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36288-6_3"},{"key":"e_1_3_2_1_16_1","unstructured":"Dan Boneh \u00d6zg\u00fcr Dagdelen Marc Fischlin Anja Lehmann Christian Schaffner and Mark Zhandry. 2010. Random Oracles in a Quantum World. Cryptology ePrint Archive Paper 2010\/428. https:\/\/eprint.iacr.org\/2010\/428."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343531"},{"key":"e_1_3_2_1_18_1","volume-title":"24th IEEE Symposium on Reliable Distributed Systems (SRDS'05)","author":"Cachin C.","unstructured":"C. Cachin and S. Tessaro. 2005. Asynchronous verifiable information dispersal. In 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05). 191--201."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"e_1_3_2_1_21_1","unstructured":"Chainlink. 2023. 35+ Blockchain RNG Use Cases Enabled by Chainlink VRF. https:\/\/chain.link\/education-hub\/rng-in-blockchain-use-cases"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133997"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614685"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"e_1_3_2_1_27_1","first-page":"34","article-title":"Narwhal and Tusk","volume":"2022","author":"Danezis George","year":"2022","unstructured":"George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. 2022. Narwhal and Tusk: A DAG-Based Mempool and Efficient BFT Consensus. In Eurosys 2022. 34--50.","journal-title":"A DAG-Based Mempool and Efficient BFT Consensus. In Eurosys"},{"key":"e_1_3_2_1_28_1","volume-title":"Spurt: Scalable Distributed Randomness Beacon with Transparent Setup. In 2022 IEEE Symposium on Security and Privacy (SP). 2502--2517","author":"Das Sourav","year":"2022","unstructured":"Sourav Das, Vinith Krishnan, Irene Miriam Isaac, and Ling Ren. 2022. Spurt: Scalable Distributed Randomness Beacon with Transparent Setup. In 2022 IEEE Symposium on Security and Privacy (SP). 2502--2517."},{"key":"e_1_3_2_1_29_1","unstructured":"Sourav Das Zhuolun Xiang Lefteris Kokoris-Kogias and Ling Ren. 2023. Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling. https:\/\/eprint.iacr.org\/2022\/1389 https:\/\/eprint.iacr.org\/2022\/1389."},{"key":"e_1_3_2_1_30_1","volume-title":"Asynchronous Data Dissemination and Its Applications. In CCS","author":"Das Sourav","year":"2021","unstructured":"Sourav Das, Zhuolun Xiang, and Ling Ren. 2021. Asynchronous Data Dissemination and Its Applications. In CCS 2021. 2705--2721."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833584"},{"key":"e_1_3_2_1_32_1","volume-title":"Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT","volume":"10821","author":"David Bernardo","year":"2018","unstructured":"Bernardo David, Peter Gazi, Aggelos Kiayias, and Alexander Russell. 2018. Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT 2018, Vol. 10821. 66--98."},{"key":"e_1_3_2_1_33_1","volume-title":"CCS","author":"David Bernardo","year":"2022","unstructured":"Bernardo David, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, and Daniel Tschudi. 2022. GearBox: Optimal-Size Shard Committees by Leveraging the Safety-Liveness Dichotomy. In CCS 2022. 683--696."},{"key":"e_1_3_2_1_34_1","volume-title":"DISC","volume":"246","author":"de Souza Luciano Freitas","year":"2022","unstructured":"Luciano Freitas de Souza, Petr Kuznetsov, and Andrei Tonkikh. 2022. Distributed Randomness from Approximate Agreement. In DISC 2022, Vol. 246. 24:1--24:21."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5931"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_37_1","volume-title":"SSS","author":"Dolev Shlomi","year":"2021","unstructured":"Shlomi Dolev and Ziyu Wang. 2021. SodsBC\/SodsBC++; SodsMPC: Post-Quantum Asynchronous Blockchain Suite for Consensus and Smart Contracts. In Stabilization, Safety, and Security of Distributed Systems: 23rd International Symposium, SSS 2021. 510--515."},{"key":"e_1_3_2_1_38_1","volume-title":"CCS","author":"Duan Sisi","year":"2023","unstructured":"Sisi Duan, Xin Wang, and Haibin Zhang. 2023. Fin: Practical signature-free asynchronous common subset in constant time. In CCS 2023. 815--829."},{"key":"e_1_3_2_1_39_1","volume-title":"Crystals-dilithium: A lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems","author":"Ducas L\u00e9o","year":"2018","unstructured":"L\u00e9o Ducas, Eike Kiltz, Tancrede Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, and Damien Stehl\u00e9. 2018. Crystals-dilithium: A lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems (2018), 238--268."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559379"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS54860.2022.00032"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0347-3"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24385"},{"key":"e_1_3_2_1_47_1","volume-title":"Dumbo: Faster Asynchronous BFT Protocols. 803--818.","author":"Guo Bingyong","year":"2020","unstructured":"Bingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2020. Dumbo: Faster Asynchronous BFT Protocols. 803--818."},{"key":"e_1_3_2_1_48_1","unstructured":"Christoph U. G\u00fcnther Sourav Das and Lefteris Kokoris-Kogias. 2022. Practical Asynchronous Proactive Secret Sharing and Key Refresh. Cryptology ePrint Archive Paper 2022\/1586. https:\/\/eprint.iacr.org\/2022\/1586."},{"key":"e_1_3_2_1_49_1","volume-title":"random. org: Introduction to Randomness and Random Numbers. Statistics, (June)","author":"Haahr Mads","year":"1999","unstructured":"Mads Haahr. 1999. random. org: Introduction to Randomness and Random Numbers. Statistics, (June) (1999), 1--4."},{"key":"e_1_3_2_1_50_1","unstructured":"Runchao Han Haoyu Lin and Jiangshan Yu. 2020. RandChain: A Scalable and Fair Decentralised Randomness Beacon. Cryptology ePrint Archive Paper 2020\/1033. https:\/\/eprint.iacr.org\/2020\/1033 https:\/\/eprint.iacr.org\/2020\/1033."},{"key":"e_1_3_2_1_51_1","volume-title":"Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548","author":"Hanke Timo","year":"2018","unstructured":"Timo Hanke, Mahnush Movahedi, and Dominic Williams. 2018. Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548 (2018)."},{"key":"e_1_3_2_1_52_1","volume-title":"Proactive secret sharing or: How to cope with perpetual leakage. In annual international cryptology conference","author":"Herzberg Amir","unstructured":"Amir Herzberg, Stanis\u0142aw Jarecki, Hugo Krawczyk, and Moti Yung. 1995. Proactive secret sharing or: How to cope with perpetual leakage. In annual international cryptology conference. Springer, 339--352."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch165"},{"key":"e_1_3_2_1_54_1","first-page":"377","article-title":"Distributed Key Generation in the Wild","volume":"2012","author":"Kate Aniket","year":"2012","unstructured":"Aniket Kate, Yizhou Huang, and Ian Goldberg. 2012. Distributed Key Generation in the Wild. IACR Cryptol. ePrint Arch., Vol. 2012 (2012), 377.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_2_1_56_1","volume-title":"Rene Peralta, and Harold Booth.","author":"Kelsey John","year":"2019","unstructured":"John Kelsey, Lu\u00eds TAN Brand\u00e3o, Rene Peralta, and Harold Booth. 2019. A reference for randomness beacons: Format and protocol version 2. Technical Report. National Institute of Standards and Technology."},{"key":"e_1_3_2_1_57_1","volume-title":"CCS","author":"Kogias Eleftherios Kokoris","year":"2020","unstructured":"Eleftherios Kokoris Kogias, Dahlia Malkhi, and Alexander Spiegelman. 2020. Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.. In CCS 2020. 1751--1767."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_1_59_1","volume-title":"CCS","author":"Miller Andrew","year":"2016","unstructured":"Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. 2016. The honey badger of BFT protocols. In CCS 2016. 31--42."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785953"},{"key":"e_1_3_2_1_61_1","volume-title":"International Conference on Information Theoretic Security. Springer, 74--92","author":"Patra Arpita","year":"2009","unstructured":"Arpita Patra, Ashish Choudhary, and C Pandu Rangan. 2009. Efficient statistical asynchronous verifiable secret sharing with optimal resilience. In International Conference on Information Theoretic Security. Springer, 74--92."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_24"},{"key":"e_1_3_2_1_63_1","volume-title":"OSDI","author":"Satija Sambhav","year":"2020","unstructured":"Sambhav Satija, Apurv Mehra, Sudheesh Singanamalla, Karan Grover, Muthian Sivathanu, Nishanth Chandran, Divya Gupta, and Satya Lokam. 2020. Blockene: A high-throughput blockchain over mobile devices. In OSDI 2020. 567--582."},{"key":"e_1_3_2_1_64_1","volume-title":"HydRand: Efficient Continuous Distributed Randomness. In 2020 IEEE Symposium on Security and Privacy (SP). 73--89","author":"Schindler Philipp","year":"2020","unstructured":"Philipp Schindler, Aljosha Judmayer, Nicholas Stifter, and Edgar Weippl. 2020. HydRand: Efficient Continuous Distributed Randomness. In 2020 IEEE Symposium on Security and Privacy (SP). 73--89."},{"key":"e_1_3_2_1_65_1","unstructured":"Victor Shoup. 2024. A Theoretical Take on a Practical Consensus Protocol. Cryptology ePrint Archive Paper 2024\/696. https:\/\/eprint.iacr.org\/2024\/696"},{"key":"e_1_3_2_1_66_1","volume-title":"Smart","author":"Shoup Victor","year":"2023","unstructured":"Victor Shoup and Nigel P. Smart. 2023. Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience. Cryptology ePrint Archive, Paper 2023\/536. https:\/\/eprint.iacr.org\/2023\/536"},{"key":"e_1_3_2_1_67_1","volume-title":"CCS","author":"Shrestha Nibesh","year":"2020","unstructured":"Nibesh Shrestha, Ittai Abraham, Ling Ren, and Kartik Nayak. 2020. On the optimality of optimistic responsiveness. In CCS 2020. 839--857."},{"key":"e_1_3_2_1_68_1","unstructured":"Open source contributors. 2019. DRand - A Distributed Randomness Beacon Daemon - https:\/\/github.com\/drand\/drand. https:\/\/github.com\/drand\/drand"},{"key":"e_1_3_2_1_69_1","volume-title":"Scalable Bias-Resistant Distributed Randomness. In 2017 IEEE Symposium on Security and Privacy (SP). 444--460","author":"Syta Ewa","year":"2017","unstructured":"Ewa Syta, Philipp Jovanovic, Eleftherios Kokoris Kogias, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, and Bryan Ford. 2017. Scalable Bias-Resistant Distributed Randomness. In 2017 IEEE Symposium on Security and Privacy (SP). 444--460."},{"key":"e_1_3_2_1_70_1","volume-title":"CCS 2023","author":"Wang Xuechao","year":"2023","unstructured":"Xuechao Wang, Peiyao Sheng, Sreeram Kannan, Kartik Nayak, and Pramod Viswanath. 2023. TrustBoost: Boosting Trust among Interoperable Blockchains. In CCS 2023. 1--15. https:\/\/eprint.iacr.org\/2022\/1428."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_3_2_1_72_1","unstructured":"Thomas Yurek Zhuolun Xiang Yu Xia and Andrew Miller. 2023. Long live the honey badger: Robust asynchronous dpss and its applications. (2023)."},{"key":"e_1_3_2_1_73_1","volume-title":"WaterBear: Practical Asynchronous BFT Matching Security Guarantees of Partially Synchronous BFT. In USENIX Security Symposium'23","author":"Zhang Haibin","year":"2023","unstructured":"Haibin Zhang, Sisi Duan, Boxin Zhao, and Liehuang Zhu. 2023. WaterBear: Practical Asynchronous BFT Matching Security Guarantees of Partially Synchronous BFT. In USENIX Security Symposium'23. 1--16."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670326","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:19:59Z","timestamp":1755843599000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":73,"alternative-id":["10.1145\/3658644.3670326","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670326","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}