{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:00:06Z","timestamp":1776106806901,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":66,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"vor","delay-in-days":7,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA","award":["HR00112020025"],"award-info":[{"award-number":["HR00112020025"]}]},{"name":"Hong Kong RGC","award":["16200721"],"award-info":[{"award-number":["16200721"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670316","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"4316-4330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Zero-Knowledge Proofs of Training for Deep Neural Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1867-2661","authenticated-orcid":false,"given":"Kasra","family":"Abbaszadeh","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5949-3620","authenticated-orcid":false,"given":"Christodoulos","family":"Pappas","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6084-9303","authenticated-orcid":false,"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[{"name":"Google, Washington, D.C., USA & University of Maryland, College Park, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2621-3015","authenticated-orcid":false,"given":"Dimitrios","family":"Papadopoulos","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2023. Circom Circuits Library for Machine Learning. https:\/\/github.com\/socathie\/circomlib-ml."},{"key":"e_1_3_2_1_2_1","unstructured":"2023. Increasing transparency in AI security. https:\/\/security.googleblog.com\/2023\/10\/increasing-transparency-in-ai-security.html."},{"key":"e_1_3_2_1_3_1","volume-title":"Advances in Cryptology?Asiacrypt 2016 (LNCS)","author":"Albrecht Martin","unstructured":"Martin Albrecht, Lorenzo Grassi, Christian Rechberger, Arnab Roy, and Tyge Tiessen. 2016. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In Advances in Cryptology?Asiacrypt 2016 (LNCS). Springer, 191--219."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623160"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623078"},{"key":"e_1_3_2_1_7_1","volume-title":"Intl. Colloquium on Automata, Languages, and Programming (ICALP) (LIPIcs","author":"Ben-Sasson Eli","unstructured":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2018. Fast Reed-Solomon Interactive Oracle Proofs of Proximity. In Intl. Colloquium on Automata, Languages, and Programming (ICALP) (LIPIcs, Vol. 107). Schloss Dagstuhl?Leibniz-Zentrum f\u00fcr Informatik, 14:1--14:17."},{"key":"e_1_3_2_1_8_1","volume-title":"Theory of Cryptography (TCC)","author":"Ben-Sasson Eli","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, and Nicholas Spooner. 2016. Interactive Oracle Proofs. In Theory of Cryptography (TCC). Springer, 31--60."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"e_1_3_2_1_10_1","volume-title":"Advances in Cryptology?Eurocrypt '93","author":"Benaloh Josh","unstructured":"Josh Benaloh and Michael de Mare. 1994. One-Way Accumulators: A Decentralized Alternative to Digital Signatures. In Advances in Cryptology?Eurocrypt '93, Tor Helleseth (Ed.). Springer, 274--285."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417893"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-016-9241-9"},{"key":"e_1_3_2_1_13_1","volume-title":"Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. In Symposium on Theory of Computing (STOC). ACM, 111--120","author":"Bitansky Nir","year":"2013","unstructured":"Nir Bitansky, Ran Canetti, Alessandro Chiesa, and Eran Tromer. 2013. Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. In Symposium on Theory of Computing (STOC). ACM, 111--120."},{"key":"e_1_3_2_1_14_1","volume-title":"Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. In Symposium on Theory of Computing. ACM, 111--120","author":"Bitansky Nir","year":"2013","unstructured":"Nir Bitansky, Ran Canetti, Alessandro Chiesa, and Eran Tromer. 2013. Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. In Symposium on Theory of Computing. ACM, 111--120."},{"key":"e_1_3_2_1_15_1","volume-title":"Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments. In Advances in Cryptology?Crypto","author":"Boneh Dan","year":"2021","unstructured":"Dan Boneh, Justin Drake, Ben Fisch, and Ariel Gabizon. 2021. Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments. In Advances in Cryptology?Crypto 2021, Part I. Springer, 649--680."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84242-0_26"},{"key":"e_1_3_2_1_17_1","unstructured":"Sean Bowe Jack Grigg and Daira Hopwood. 2019. Recursive Proof Composition without a Trusted Setup. Cryptology ePrint Archive Paper 2019\/1021."},{"key":"e_1_3_2_1_18_1","volume-title":"Protostar: Generic Efficient Accumulation\/Folding for Special-Sound Protocols. In Advances in Cryptology -- ASIACRYPT","author":"B\u00fcnz Benedikt","year":"2023","unstructured":"Benedikt B\u00fcnz and Binyi Chen. 2023. Protostar: Generic Efficient Accumulation\/Folding for Special-Sound Protocols. In Advances in Cryptology -- ASIACRYPT 2023, Jian Guo and Ron Steinfeld (Eds.). Springer Nature Singapore, Singapore, 77--110."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"e_1_3_2_1_20_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In IEEE Symposium on Security and Privacy. IEEE, 315--334","author":"B\u00fcnz Benedikt","year":"2018","unstructured":"Benedikt B\u00fcnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, PieterWuille, and Greg Maxwell. 2018. Bulletproofs: Short Proofs for Confidential Transactions and More. In IEEE Symposium on Security and Privacy. IEEE, 315--334."},{"key":"e_1_3_2_1_21_1","unstructured":"Benedikt B\u00fcnz and Jessica Chen. 2024. Proofs for Deep Thought: Accumulation for large memories and deterministic computations. Cryptology ePrint Archive Paper 2024\/325. https:\/\/eprint.iacr.org\/2024\/325 https:\/\/eprint.iacr.org\/2024\/325."},{"key":"e_1_3_2_1_22_1","unstructured":"Benedikt B\u00fcnz Pratyush Mishra Wilson Nguyen and William Wang. 2024. Accumulation without Homomorphism. Cryptology ePrint Archive Paper 2024\/474. https:\/\/eprint.iacr.org\/2024\/474 https:\/\/eprint.iacr.org\/2024\/474."},{"key":"e_1_3_2_1_23_1","volume-title":"A pseudo-softmax function for hardware-based high speed image classification. Sci. Reports","author":"Cardarilli Gian Carlo","year":"2021","unstructured":"Gian Carlo Cardarilli, Marco Re, and Luca Di Nunzio. 2021. A pseudo-softmax function for hardware-based high speed image classification. Sci. Reports (2021)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"e_1_3_2_1_25_1","volume-title":"Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. In Advances in Cryptology--Eurocrypt","author":"Chiesa Alessandro","year":"2020","unstructured":"Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely, and Nicholas Ward. 2020. Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. In Advances in Cryptology--Eurocrypt 2020. Springer, 738--768."},{"key":"e_1_3_2_1_26_1","volume-title":"Fractal: Post-quantum and Transparent Recursive Proofs from Holography. In Advances in Cryptology--Eurocrypt","author":"Chiesa Alessandro","year":"2020","unstructured":"Alessandro Chiesa, Dev Ojha, and Nicholas Spooner. 2020. Fractal: Post-quantum and Transparent Recursive Proofs from Holography. In Advances in Cryptology--Eurocrypt 2020. Springer, 769--793."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"e_1_3_2_1_28_1","unstructured":"Thorsten Eisenhofer Doreen Riepel Varun Chandrasekaran Esha Ghosh Olga Ohrimenko and Nicolas Papernot. 2023. Verifiable and Provably Secure Machine Unlearning. arXiv:2210.09126"},{"key":"e_1_3_2_1_29_1","volume-title":"Optimal Approximation-Smoothness Tradeoffs for Soft-Max Functions. In Neural Information Proc. Systems (NeurIPS). Curran Associates Inc.","author":"Epasto Alessandro","year":"2020","unstructured":"Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni, and Manolis Zampetakis. 2020. Optimal Approximation-Smoothness Tradeoffs for Soft-Max Functions. In Neural Information Proc. Systems (NeurIPS). Curran Associates Inc."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"Congyu Fang Hengrui Jia Anvith Thudi Mohammad Yaghini Christopher A. Choquette-Choo Natalie Dullerud Varun Chandrasekaran and Nicolas Papernot. 2022. On the Fundamental Limits of Formally (Dis)Proving Robustness in Proof-of-Learning. https:\/\/doi.org\/10.48550\/ARXIV.2208.03567","DOI":"10.48550\/ARXIV.2208.03567"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP57164.2023.00052"},{"key":"e_1_3_2_1_32_1","volume-title":"ZEN: An Optimizing Compiler for Verifiable, Zero-Knowledge Neural Network Inferences. Cryptology ePrint Archive, Paper 2021\/087.","author":"Feng Boyuan","year":"2021","unstructured":"Boyuan Feng, Lianke Qin, Zhenfei Zhang, Yufei Ding, and Shumo Chu. 2021. ZEN: An Optimizing Compiler for Verifiable, Zero-Knowledge Neural Network Inferences. Cryptology ePrint Archive, Paper 2021\/087."},{"key":"e_1_3_2_1_33_1","volume-title":"Advances in Cryptology--Crypto '86","author":"Fiat Amos","year":"1987","unstructured":"Amos Fiat and Adi Shamir. 1987. How To Prove Yourself: Practical Solutions to Identification and Signature Problems. In Advances in Cryptology--Crypto '86, Andrew M. Odlyzko (Ed.). Springer, 186--194."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Sanjam Garg Aarushi Goel Somesh Jha Saeed Mahloujifar Mohammad Mahmoody Guru-Vamsi Policharla and Mingyuan Wang. 2023. Experimenting with Zero-Knowledge Proofs of Training. http:\/\/ia.cr\/2023\/1345","DOI":"10.1145\/3576915.3623202"},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of the 25th USENIX Conference on Security Symposium","author":"Giacomelli Irene","year":"2016","unstructured":"Irene Giacomelli, Jesper Madsen, and Claudio Orlandi. 2016. ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In Proceedings of the 25th USENIX Conference on Security Symposium (Austin, TX, USA) (SEC'16). USENIX Association, USA, 1069--1083."},{"key":"e_1_3_2_1_36_1","volume-title":"Delegating Computation: Interactive Proofs for Muggles. In ACM Symposium on Theory of Computing. ACM, 113--122","author":"Goldwasser Shafi","unstructured":"Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. 2008. Delegating Computation: Interactive Proofs for Muggles. In ACM Symposium on Theory of Computing. ACM, 113--122."},{"key":"e_1_3_2_1_37_1","volume-title":"Wahby","author":"Golovnev Alexander","year":"2021","unstructured":"Alexander Golovnev, Jonathan Lee, Srinath Setty, Justin Thaler, and Riad S.Wahby. 2021. Brakedown: Linear-Time and Post-Quantum SNARKs for R1CS. Cryptology ePrint Archive, Paper 2021\/1043."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_39_1","unstructured":"Melissa Heikkil\u00e4. 2022. This Artist is Dominating AI-Generated Art. And He's not Happy About It. MIT Technology Review."},{"key":"e_1_3_2_1_40_1","volume-title":"Proof-of-Learning: Definitions and Practice. In IEEE Symposium on Security and Privacy. IEEE, 1039--1056","author":"Jia Hengrui","year":"2021","unstructured":"Hengrui Jia, Mohammad Yaghini, Christopher A. Choquette-Choo, Natalie Dullerud, Anvith Thudi, Varun Chandrasekaran, and Nicolas Papernot. 2021. Proof-of-Learning: Definitions and Practice. In IEEE Symposium on Security and Privacy. IEEE, 1039--1056."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_42_1","volume-title":"Symposium on Theory of Computing (STOC). ACM, 723--732","author":"Kilian Joe","year":"1992","unstructured":"Joe Kilian. 1992. A Note on Efficient Zero-Knowledge Proofs and Arguments. In Symposium on Theory of Computing (STOC). ACM, 723--732."},{"key":"e_1_3_2_1_43_1","unstructured":"Abhiram Kothapalli and Srinath Setty. 2023. HyperNova: Recursive arguments for customizable constraint systems. Cryptology ePrint Archive Paper 2023\/573. https:\/\/eprint.iacr.org\/2023\/573 https:\/\/eprint.iacr.org\/2023\/573."},{"key":"e_1_3_2_1_44_1","volume-title":"Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. In Advances in Cryptology?Crypto","author":"Kothapalli Abhiram","year":"2022","unstructured":"Abhiram Kothapalli, Srinath Setty, and Ioanna Tzialla. 2022. Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. In Advances in Cryptology?Crypto 2022. Springer, 359--388."},{"key":"e_1_3_2_1_45_1","volume-title":"d.]. CIFAR-10","author":"Krizhevsky Alex","unstructured":"Alex Krizhevsky, Vinod Nair, and Geoffrey Hinton. [n. d.]. CIFAR-10 (Canadian Institute for Advanced Research). Available at http:\/\/www.cs.toronto.edu\/ kriz\/cifar.html."},{"key":"e_1_3_2_1_46_1","volume-title":"Hinton","author":"Krizhevsky Alex","year":"2012","unstructured":"Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton. 2012. ImageNet Classification with Deep Convolutional Neural Networks. In Adv. in Neural Information Processing Systems, Vol. 25. Curran Associates, Inc."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_2_1_48_1","unstructured":"Seunghwan Lee Hankyung Ko Jihye Kim and Hyunok Oh. 2020. vCNN: Verifiable Convolutional Neural Network based on zk-SNARKs."},{"key":"e_1_3_2_1_49_1","volume-title":"Scaling Distributed Machine Learning with the Parameter Server. In Conference on Operating Systems Design and Implementation. USENIX Association, 583--598","author":"Li Mu","year":"2014","unstructured":"Mu Li, David G. Andersen, Jun Woo Park, Alexander J. Smola, Amr Ahmed, Vanja Josifovski, James Long, Eugene J. Shekita, and Bor-Yiing Su. 2014. Scaling Distributed Machine Learning with the Parameter Server. In Conference on Operating Systems Design and Implementation. USENIX Association, 583--598."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3485379"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48184-2_32"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_1_54_1","volume-title":"Conf. on Computer and Comm. Security. ACM, 35--52","author":"Mohassel Payman","year":"2018","unstructured":"Payman Mohassel and Peter Rindal. 2018. ABY3: A Mixed Protocol Framework for Machine Learning. In Conf. on Computer and Comm. Security. ACM, 35--52."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"e_1_3_2_1_56_1","volume-title":"Very Deep Convolutional Networks for Large-Scale Image Recognition. In Intl. Conf. on Learning Representations, ICLR.","author":"Simonyan Karen","year":"2015","unstructured":"Karen Simonyan and Andrew Zisserman. 2015. Very Deep Convolutional Networks for Large-Scale Image Recognition. In Intl. Conf. on Learning Representations, ICLR."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"e_1_3_2_1_58_1","volume-title":"USENIX Security Symposium. USENIX Association, USA, 601--618","author":"Tram\u00e8r Florian","year":"2016","unstructured":"Florian Tram\u00e8r, Fan Zhang, Ari Juels, Michael K. Reiter, and Thomas Ristenpart. 2016. Stealing Machine Learning Models via Prediction APIs. In USENIX Security Symposium. USENIX Association, USA, 601--618."},{"key":"e_1_3_2_1_59_1","volume-title":"Theory of Cryptography (TCC)","author":"Valiant Paul","unstructured":"Paul Valiant. 2008. Incrementally Verifiable Computation or Proofs of Knowledge Imply Time\/Space Efficiency. In Theory of Cryptography (TCC). Springer, 1--18."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_1_61_1","volume-title":"USENIX Security Symposium. USENIX Association, 501--518","author":"Weng Chenkai","year":"2021","unstructured":"Chenkai Weng, Kang Yang, Xiang Xie, Jonathan Katz, and Xiao Wang. 2021. Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning. In USENIX Security Symposium. USENIX Association, 501--518."},{"key":"e_1_3_2_1_62_1","volume-title":"Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In Advances in Cryptology--Crypto","author":"Xie Tiacheng","year":"2019","unstructured":"Tiacheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou, and Dawn Song. 2019. Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In Advances in Cryptology--Crypto 2019. Springer, 733--764."},{"key":"e_1_3_2_1_63_1","volume-title":"Orion: Zero Knowledge Proof with Linear Prover Time. In Adv. in Cryptology--Crypto","author":"Xie Tiancheng","year":"2022","unstructured":"Tiancheng Xie, Yupeng Zhang, and Dawn Song. 2022. Orion: Zero Knowledge Proof with Linear Prover Time. In Adv. in Cryptology--Crypto 2022. Springer, 299--328."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484556"},{"key":"e_1_3_2_1_65_1","volume-title":"Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time. In Conf. on Computer and Communications Security. ACM, 159--177","author":"Zhang Jiaheng","year":"2021","unstructured":"Jiaheng Zhang, Tianyi Liu,WeijieWang, Yinuo Zhang, Dawn Song, Xiang Xie, and Yupeng Zhang. 2021. Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time. In Conf. on Computer and Communications Security. ACM, 159--177."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"}],"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.3670316","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670316","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:17:29Z","timestamp":1755843449000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":66,"alternative-id":["10.1145\/3658644.3670316","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670316","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"}}]}}