{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:30:50Z","timestamp":1792787450684,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":65,"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":[{"name":"Protocol Labs","award":["RFP-012"],"award-info":[{"award-number":["RFP-012"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690253","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"2636-2650","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Scalable and Adaptively Secure Any-Trust Distributed Key Generation and All-hands Checkpointing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7069-5165","authenticated-orcid":false,"given":"Hanwen","family":"Feng","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Sydney, Darlington, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1945-1069","authenticated-orcid":false,"given":"Tiancheng","family":"Mai","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Sydney, Darlington, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1113-6352","authenticated-orcid":false,"given":"Qiang","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Sydney, Darlington, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation. In CRYPTO (1) (LNCS","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 (1) (LNCS, Vol. 14081). Springer, 39--70."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560829.3563563"},{"key":"e_1_3_2_1_3_1","volume-title":"GRandLine: Adaptively Secure DKG and Randomness Beacon with (Almost) Quadratic Communication Complexity. IACR Cryptol. ePrint Arch. (2023)","author":"Bacho Renas","year":"1887","unstructured":"Renas Bacho, Christoph Lenzen, Julian Loss, Simon Ochsenreither, and Dimitrios Papachristoudis. 2023. GRandLine: Adaptively Secure DKG and Randomness Beacon with (Almost) Quadratic Communication Complexity. IACR Cryptol. ePrint Arch. (2023), 1887. https:\/\/eprint.iacr.org\/2023\/1887"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Renas Bacho and Julian Loss. 2022. On the Adaptive Security of the Threshold BLS Signature Scheme. In CCS. ACM 193--207.","DOI":"10.1145\/3548606.3560656"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Renas Bacho and Julian Loss. 2023. Adaptively Secure (Aggregatable) PVSS and Application to Distributed Randomness Beacons. In CCS. ACM 1791--1804.","DOI":"10.1145\/3576915.3623106"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243848"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907471"},{"key":"e_1_3_2_1_8_1","volume-title":"CRYPTO (4) (LNCS","author":"Bellare Mihir","unstructured":"Mihir Bellare, Elizabeth C. Crites, Chelsea Komlo, Mary Maller, Stefano Tessaro, and Chenzhi Zhu. 2022. Better than Advertised Security for Non-interactive Threshold Signatures. In CRYPTO (4) (LNCS, Vol. 13510). Springer, 517--550."},{"key":"e_1_3_2_1_9_1","volume-title":"TCC (1) (LNCS","author":"Benhamouda Fabrice","unstructured":"Fabrice Benhamouda, Craig Gentry, Sergey Gorbunov, Shai Halevi, Hugo Krawczyk, Chengyu Lin, Tal Rabin, and Leonid Reyzin. 2020. Can a Public Blockchain Keep a Secret?. In TCC (1) (LNCS, Vol. 12550). Springer, 260--290."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Fabrice Benhamouda Shai Halevi Hugo Krawczyk Alex Miao and Tal Rabin. 2022. Threshold Cryptography as a Service (in the Multiserver and YOSO Models). In CCS. ACM 323--336.","DOI":"10.1145\/3548606.3559397"},{"key":"e_1_3_2_1_11_1","unstructured":"Aptos Blockchain. [n. d.]. Aptosan. https:\/\/aptoscan.com."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_30"},{"key":"e_1_3_2_1_13_1","volume-title":"PKC (4) (LNCS","author":"Brunetta Carlo","unstructured":"Carlo Brunetta, Hans Heum, and Martijn Stam. 2024. SoK: Public Key Encryption with Openings. In PKC (4) (LNCS, Vol. 14604). Springer, 35--68."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"e_1_3_2_1_16_1","unstructured":"Andrea Cerulli Aisling Connolly Gregory Neven Franz-Stefan Preiss and Victor Shoup. 2023. vetKeys: How a Blockchain Can Keep Many Secrets. Cryptology ePrint Archive Paper 2023\/616. https:\/\/eprint.iacr.org\/2023\/616."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_5"},{"key":"e_1_3_2_1_18_1","volume-title":"Pedersen","author":"Chaum David","year":"1992","unstructured":"David Chaum and Torben P. Pedersen. 1992. Wallet Databases with Observers. In CRYPTO (LNCS, Vol. 740). Springer, 89--105."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"e_1_3_2_1_20_1","volume-title":"SoK: Distributed Randomness Beacons","author":"Choi Kevin","unstructured":"Kevin Choi, Aathira Manoj, and Joseph Bonneau. 2023. SoK: Distributed Randomness Beacons. In SP. IEEE, 75--92."},{"key":"e_1_3_2_1_21_1","volume-title":"CRYPTO (2) (LNCS","author":"Choudhuri Arka Rai","unstructured":"Arka Rai Choudhuri, Aarushi Goel, Matthew Green, Abhishek Jain, and Gabriel Kaptchuk. 2021. Fluid MPC: Secure Multiparty Computation with Dynamic Participants. In CRYPTO (2) (LNCS, Vol. 12826). Springer, 94--123."},{"key":"e_1_3_2_1_22_1","unstructured":"Cosmos. [n. d.]. https:\/\/cosmos.network."},{"key":"e_1_3_2_1_23_1","volume-title":"CRYPTO (1) (LNCS","author":"Crites Elizabeth C.","unstructured":"Elizabeth C. Crites, Chelsea Komlo, and Mary Maller. 2023. Fully Adaptive Schnorr Threshold Signatures. In CRYPTO (1) (LNCS, Vol. 14081). Springer, 678--709."},{"key":"e_1_3_2_1_24_1","volume-title":"Practical Asynchronous Distributed Key Generation","author":"Das Sourav","unstructured":"Sourav Das, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, and Ling Ren. 2022. Practical Asynchronous Distributed Key Generation. In SP. IEEE, 2518--2534."},{"key":"e_1_3_2_1_25_1","volume-title":"CRYPTO (1) (LNCS","author":"David Bernardo","unstructured":"Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, and Varun Narayanan. 2023. Perfect MPC over Layered Graphs. In CRYPTO (1) (LNCS, Vol. 14081). Springer, 360--392."},{"key":"e_1_3_2_1_26_1","volume-title":"Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT (2) (LNCS","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 (2) (LNCS, Vol. 10821). Springer, 66--98."},{"key":"e_1_3_2_1_27_1","volume-title":"Swiper and Dora: efficient solutions to weighted distributed problems. CoRR","author":"de Souza Luciano Freitas","year":"2023","unstructured":"Luciano Freitas de Souza and Andrei Tonkikh. 2023. Swiper and Dora: efficient solutions to weighted distributed problems. CoRR, Vol. abs\/2307.15561 (2023)."},{"key":"e_1_3_2_1_28_1","volume-title":"A Practical Scheme for Non-interactive Verifiable Secret Sharing","author":"Feldman Paul","unstructured":"Paul Feldman. 1987. A Practical Scheme for Non-interactive Verifiable Secret Sharing. In FOCS. IEEE Computer Society, 427--437."},{"key":"e_1_3_2_1_29_1","unstructured":"Hanwen Feng Zhenliang Lu and Qiang Tang. 2023. Breaking the Cubic Barrier: Distributed Key and Randomness Generation through Deterministic Sharding. Cryptology ePrint Archive Paper 2024\/168. https:\/\/eprint.iacr.org\/2024\/168."},{"key":"e_1_3_2_1_30_1","unstructured":"Hanwen Feng Tiancheng Mai and Qiang Tang. 2024. Scalable and Adaptively Secure Any-Trust Distributed Key Generation and All-hands Checkpointing. Technical Report 2023\/1773. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2023\/1773. Full version of this paper."},{"key":"e_1_3_2_1_31_1","unstructured":"Filecoin. [n. d.]. https:\/\/filecoin.io\/."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_22"},{"key":"e_1_3_2_1_33_1","volume-title":"Efficient Asynchronous Byzantine Agreement without Private Setups","author":"Gao Yingzi","unstructured":"Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2022. Efficient Asynchronous Byzantine Agreement without Private Setups. In ICDCS. IEEE, 246--257."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0347-3"},{"key":"e_1_3_2_1_35_1","volume-title":"Tal Rabin, and Sophia Yakoubov.","author":"Gentry Craig","year":"2021","unstructured":"Craig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri, Jesper Buus Nielsen, Tal Rabin, and Sophia Yakoubov. 2021. YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral Roles. In CRYPTO (2) (LNCS, Vol. 12826). Springer, 64--93."},{"key":"e_1_3_2_1_36_1","volume-title":"EUROCRYPT (1) (LNCS","author":"Gentry Craig","unstructured":"Craig Gentry, Shai Halevi, and Vadim Lyubashevsky. 2022. Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. In EUROCRYPT (1) (LNCS, Vol. 13275). Springer, 458--487."},{"key":"e_1_3_2_1_37_1","volume-title":"Jesper Buus Nielsen, and Sophia Yakoubov","author":"Gentry Craig","year":"2021","unstructured":"Craig Gentry, Shai Halevi, Bernardo Magri, Jesper Buus Nielsen, and Sophia Yakoubov. 2021. Random-Index PIR and Applications. In TCC (3) (LNCS, Vol. 13044). Springer, 32--61."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Sharon Goldberg Moni Naor Dimitrios Papadopoulos and Leonid Reyzin. 2016. NSEC5 from Elliptic Curves: Provably Preventing DNSSEC Zone Enumeration with Shorter Responses. IACR Cryptol. ePrint Arch. (2016) 83.","DOI":"10.14722\/ndss.2015.23211"},{"key":"e_1_3_2_1_40_1","unstructured":"Jens Groth. 2023. Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive Paper 2021\/339. https:\/\/eprint.iacr.org\/2021\/339."},{"key":"e_1_3_2_1_41_1","volume-title":"Dumbo: Faster Asynchronous BFT Protocols. In CCS. ACM, 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. In CCS. ACM, 803--818."},{"key":"e_1_3_2_1_42_1","volume-title":"EUROCRYPT (1) (LNCS","author":"Gurkan Kobi","unstructured":"Kobi Gurkan, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. 2021. Aggregatable Distributed Key Generation. In EUROCRYPT (1) (LNCS, Vol. 12696). Springer, 147--176."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_20"},{"key":"e_1_3_2_1_44_1","volume-title":"Pratyay Mukherjee, Hamza Saleem, and Sri Aravinda Krishnan Thyagarajan.","author":"Kate Aniket","year":"2023","unstructured":"Aniket Kate, Easwar Vivek Mangipudi, Pratyay Mukherjee, Hamza Saleem, and Sri Aravinda Krishnan Thyagarajan. 2023. Non-interactive VSS using Class Groups and Application to DKG. Cryptology ePrint Archive, Paper 2023\/451. https:\/\/eprint.iacr.org\/2023\/451."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_46_1","volume-title":"SAC (LNCS","volume":"65","author":"Komlo Chelsea","year":"2020","unstructured":"Chelsea Komlo and Ian Goldberg. 2020. FROST: Flexible Round-Optimized Schnorr Threshold Signatures. In SAC (LNCS, Vol. 12804). Springer, 34--65."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243788"},{"key":"e_1_3_2_1_48_1","volume-title":"Pratik Soni, and Sri Aravinda Krishnan Thyagarajan.","author":"Liu-Zhang Chen-Da","year":"2024","unstructured":"Chen-Da Liu-Zhang, Elisaweta Masserova, Jo ao Ribeiro, Pratik Soni, and Sri Aravinda Krishnan Thyagarajan. 2024. Improved YOSO Randomness Generation with Worst-Case Corruptions. IACR Cryptol. ePrint Arch. (2024), 1268."},{"key":"e_1_3_2_1_49_1","first-page":"1","article-title":"Maximal Extractable Value (MEV) Protection on a DAG. In Tokenomics (OASIcs, Vol. 110)","volume":"6","author":"Malkhi Dahlia","year":"2022","unstructured":"Dahlia Malkhi and Pawel Szalachowski. 2022. Maximal Extractable Value (MEV) Protection on a DAG. In Tokenomics (OASIcs, Vol. 110). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 6:1--6:17.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Andrew Miller Yu Xia Kyle Croman Elaine Shi and Dawn Song. 2016. The Honey Badger of BFT Protocols. In CCS. ACM 31--42.","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Moni Naor and Moti Yung. 1990. Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In STOC. ACM 427--437.","DOI":"10.1145\/100216.100273"},{"key":"e_1_3_2_1_52_1","first-page":"1","article-title":"Improved Extension Protocols for Byzantine Broadcast and Agreement. In DISC (LIPIcs, Vol. 179)","volume":"28","author":"Nayak Kartik","year":"2020","unstructured":"Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, and Zhuolun Xiang. 2020. Improved Extension Protocols for Byzantine Broadcast and Agreement. In DISC (LIPIcs, Vol. 179). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 28:1--28:17.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_8"},{"key":"e_1_3_2_1_54_1","volume-title":"CRYPTO (LNCS","volume":"140","author":"Pedersen Torben P.","year":"1991","unstructured":"Torben P. Pedersen. 1991. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO (LNCS, Vol. 576). Springer, 129--140."},{"key":"e_1_3_2_1_55_1","unstructured":"Polkadot. [n. d.]. https:\/\/www.polkadot.network\/."},{"key":"e_1_3_2_1_56_1","unstructured":"Ruby.Exchange. 2021. How SKALE Solves The Front-Running Problem. https:\/\/blog.ruby.exchange\/how-skale-solves-the-front-running-problem\/?ref=blog.pantherprotocol.io."},{"key":"e_1_3_2_1_57_1","unstructured":"Victor Shoup. 2023. The many faces of Schnorr. Cryptology ePrint Archive Paper 2023\/1019. https:\/\/eprint.iacr.org\/2023\/1019."},{"key":"e_1_3_2_1_58_1","volume-title":"BMS: Secure Decentralized Reconfiguration for Blockchain and BFT Systems. CoRR","author":"Steinhoff Selma","year":"2021","unstructured":"Selma Steinhoff, Chrysoula Stathakopoulou, Matej Pavlovic, and Marko Vukolic. 2021. BMS: Secure Decentralized Reconfiguration for Blockchain and BFT Systems. CoRR, Vol. abs\/2109.03913 (2021)."},{"key":"e_1_3_2_1_59_1","volume-title":"Mohammad Ali Maddah-Ali, and Fisher Yu","author":"Tas Ertem Nusret","year":"2023","unstructured":"Ertem Nusret Tas, David Tse, Fangyu Gai, Sreeram Kannan, Mohammad Ali Maddah-Ali, and Fisher Yu. 2023. Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and Impossibilities. In SP. IEEE, 126--145."},{"key":"e_1_3_2_1_60_1","unstructured":"Tezos. [n. d.]. https:\/\/tezos.com."},{"key":"e_1_3_2_1_61_1","volume-title":"Towards Scalable Threshold Cryptosystems. In IEEE Symposium on Security and Privacy. IEEE, 877--893","author":"Tomescu Alin","year":"2020","unstructured":"Alin Tomescu, Robert Chen, Yiming Zheng, Ittai Abraham, Benny Pinkas, Guy Golan-Gueta, and Srinivas Devadas. 2020. Towards Scalable Threshold Cryptosystems. In IEEE Symposium on Security and Privacy. IEEE, 877--893."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Andrei Tonkikh and Luciano Freitas de Souza. 2024. Swiper: a new paradigm for efficient weighted distributed protocols. In PODC. ACM 283--294.","DOI":"10.1145\/3662158.3662799"},{"key":"e_1_3_2_1_63_1","volume-title":"European Workshop on System Security (EuroSec)","volume":"4","author":"Wolinsky David Isaac","year":"2012","unstructured":"David Isaac Wolinsky, Henry Corrigan-Gibbs, Bryan Ford, and Aaron Johnson. 2012. Scalable anonymous group communication in the anytrust model. In European Workshop on System Security (EuroSec), Vol. 4."},{"key":"e_1_3_2_1_64_1","volume-title":"hbACSS: How to Robustly Share Many Secrets","author":"Yurek Thomas","unstructured":"Thomas Yurek, Licheng Luo, Jaiden Fairoze, Aniket Kate, and Andrew Miller. 2022. hbACSS: How to Robustly Share Many Secrets. In NDSS. The Internet Society."},{"key":"e_1_3_2_1_65_1","volume-title":"USENIX Security Symposium. USENIX Association, 2965--2982","author":"Zhang Jiaheng","year":"2022","unstructured":"Jiaheng Zhang, Tiancheng Xie, Thang Hoang, Elaine Shi, and Yupeng Zhang. 2022. Polynomial Commitment with a One-to-Many Prover and Applications. In USENIX Security Symposium. USENIX Association, 2965--2982."}],"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.3690253","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:17:05Z","timestamp":1755843425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":65,"alternative-id":["10.1145\/3658644.3690253","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690253","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"}}]}}