{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:44:57Z","timestamp":1768286697212,"version":"3.49.0"},"reference-count":75,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF","doi-asserted-by":"publisher","award":["CNS-2007115, CCF-2324941, CCF-2326609, CNS-2146814, CPS-2136197, CNS-2106403, and NGSDI-2105648"],"award-info":[{"award-number":["CNS-2007115, CCF-2324941, CCF-2326609, CNS-2146814, CPS-2136197, CNS-2106403, and NGSDI-2105648"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Resnick Sustainability Institute for Science, Energy and Sustainability, California Institute of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2024,12,10]]},"abstract":"<jats:p>This paper studies learning-augmented decentralized online convex optimization in a networked multi-agent system, a challenging setting that has remained under-explored. We first consider a linear learning-augmented decentralized online algorithm (LADO-Lin) that combines a machine learning (ML) policy with a baseline expert policy in a linear manner. We show that, while LADO-Lin can exploit the potential of ML predictions to improve the average cost performance, it cannot have guaranteed worst-case performance. To address this limitation, we propose a novel online algorithm (LADO) that adaptively combines the ML policy and expert policy to safeguard the ML predictions to achieve strong competitiveness guarantees. We also prove the average cost bound for LADO, revealing the tradeoff between average performance and worst-case robustness and demonstrating the advantage of training the ML policy by explicitly considering the robustness requirement. Finally, we run an experiment on decentralized battery management. Our results highlight the potential of ML augmentation to improve the average performance as well as the guaranteed worst-case performance of LADO.<\/jats:p>","DOI":"10.1145\/3700420","type":"journal-article","created":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T12:12:12Z","timestamp":1734091932000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Learning-Augmented Decentralized Online Convex Optimization in Networks"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3257-9929","authenticated-orcid":false,"given":"Pengfei","family":"Li","sequence":"first","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4041-4211","authenticated-orcid":false,"given":"Jianyi","family":"Yang","sequence":"additional","affiliation":[{"name":"University of Houston, Houston, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5923-0199","authenticated-orcid":false,"given":"Adam","family":"Wierman","sequence":"additional","affiliation":[{"name":"California Institute of Technology, Pasadena, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9003-4324","authenticated-orcid":false,"given":"Shaolei","family":"Ren","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.35833\/MPCE.2018.000628"},{"key":"e_1_2_1_2_1","volume-title":"Stability constrained reinforcement learning for real-time voltage control. arXiv preprint arXiv:2109.14854","author":"Shi Yuanyuan","year":"2021","unstructured":"Yuanyuan Shi, Guannan Qu, Steven Low, Anima Anandkumar, and Adam Wierman. Stability constrained reinforcement learning for real-time voltage control. arXiv preprint arXiv:2109.14854, 2021."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2525928"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3063822"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2933973"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2019.2904486"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2448473.2448474"},{"issue":"4","key":"e_1_2_1_8_1","first-page":"883","article-title":"Optimal pricing in networks with externalities","volume":"60","author":"Candogan Ozan","year":"2012","unstructured":"Ozan Candogan, Kostas Bimpikis, and Asuman Ozdaglar. Optimal pricing in networks with externalities. OperationsResearch, 60(4):883--905, 2012.","journal-title":"OperationsResearch"},{"key":"e_1_2_1_9_1","volume-title":"Collaborative deep reinforcement learning. arXiv preprint arXiv:1702.05796","author":"Lin Kaixiang","year":"2017","unstructured":"Kaixiang Lin, Shu Wang, and Jiayu Zhou. Collaborative deep reinforcement learning. arXiv preprint arXiv:1702.05796, 2017."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3092562"},{"key":"e_1_2_1_11_1","volume-title":"COLT","author":"Christianson Nicolas","year":"2022","unstructured":"Nicolas Christianson, Tinashe Handina, and Adam Wierman. Chasing convex bodies and functions with black-box advice. In COLT, 2022."},{"key":"e_1_2_1_12_1","volume-title":"NeurIPS","volume":"32","author":"Goel Gautam","year":"2019","unstructured":"Gautam Goel, Yiheng Lin, Haoyuan Sun, and Adam Wierman. Beyond online balanced descent: An optimal algorithm for smoothed online optimization. In NeurIPS, volume 32, 2019."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2503322"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3374888.3374892"},{"key":"e_1_2_1_15_1","volume-title":"Advances in Neural Information Processing Systems","author":"Zhang Lijun","year":"2021","unstructured":"Lijun Zhang, Wei Jiang, Shiyin Lu, and Tianbao Yang. Revisiting smoothed online learning. In A. Beygelzimer, Y. Dauphin, P. Liang, and J. Wortman Vaughan, editors, Advances in Neural Information Processing Systems, 2021."},{"key":"e_1_2_1_16_1","first-page":"20636","article-title":"Online optimization with memory and competitive control","volume":"33","author":"Shi Guanya","year":"2020","unstructured":"Guanya Shi, Yiheng Lin, Soon-Jo Chung, Yisong Yue, and Adam Wierman. Online optimization with memory and competitive control. Advances in Neural Information Processing Systems, 33:20636--20647, 2020.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3489048.3522657"},{"key":"e_1_2_1_18_1","volume-title":"COLT","author":"Chen Niangjun","year":"2018","unstructured":"Niangjun Chen, Gautam Goel, and Adam Wierman. Smoothed online convex optimization in high dimensions via online balanced descent. In COLT, 2018."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449255"},{"key":"e_1_2_1_20_1","article-title":"Distributed online convex optimization with an aggregative variable","author":"Li Xiuxian","year":"2021","unstructured":"Xiuxian Li, Xinlei Yi, and Lihua Xie. Distributed online convex optimization with an aggregative variable. IEEE Transactions on Control of Network Systems, 2021.","journal-title":"IEEE Transactions on Control of Network Systems"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.109676"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2525928"},{"key":"e_1_2_1_23_1","volume-title":"ICLR","author":"Kong Weiwei","year":"2019","unstructured":"Weiwei Kong, Christopher Liaw, Aranyak Mehta, and D. Sivakumar. A new dog learns old tricks: RL finds classic optimization algorithms. In ICLR, 2019."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737649"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796715"},{"key":"e_1_2_1_27_1","first-page":"5872","volume-title":"International Conference on Machine Learning","author":"Zhang Kaiqing","year":"2018","unstructured":"Kaiqing Zhang, Zhuoran Yang, Han Liu, Tong Zhang, and Tamer Basar. Fully decentralized multi-agent reinforcement learning with networked agents. In International Conference on Machine Learning, pages 5872--5881. PMLR, 2018."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60990-0_12"},{"key":"e_1_2_1_29_1","first-page":"1","volume-title":"Applied Intelligence","author":"Oroojlooy Afshin","year":"2022","unstructured":"Afshin Oroojlooy and Davood Hajinezhad. A review of cooperative multi-agent deep reinforcement learning. Applied Intelligence, pages 1--46, 2022."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228998"},{"key":"e_1_2_1_31_1","volume-title":"NeurIPS","author":"Wei Alexander","year":"2020","unstructured":"Alexander Wei and Fred Zhang. Optimal robustness-consistency trade-offs for learning-augmented online algorithms. In NeurIPS, 2020."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2993749.2993766"},{"key":"e_1_2_1_33_1","first-page":"20083","article-title":"The primal-dual method for learning augmented algorithms","volume":"33","author":"Bamas \u00c9tienne","year":"2020","unstructured":"\u00c9tienne Bamas, Andreas Maggiori, and Ola Svensson. The primal-dual method for learning augmented algorithms. Advances in Neural Information Processing Systems, 33:20083--20094, 2020.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447579"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3578338.3593570"},{"key":"e_1_2_1_36_1","series-title":"Proceedings of Machine Learning Research","first-page":"13356","volume-title":"Kamalika Chaudhuri","author":"Lin Yiheng","year":"2022","unstructured":"Yiheng Lin, Judy Gan, Guannan Qu, Yash Kanoria, and Adam Wierman. Decentralized online convex optimization in networked systems. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato, editors, Proceedings of the 39th International Conference on Machine Learning, volume 162 of Proceedings of Machine Learning Research, pages 13356--13393. PMLR, 17--23 Jul 2022."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934885"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2016.2535201"},{"key":"e_1_2_1_39_1","volume-title":"Sustainability report. https:\/\/sustainability.fb.com\/","year":"2021","unstructured":"Meta. Sustainability report. https:\/\/sustainability.fb.com\/, 2021."},{"key":"e_1_2_1_40_1","first-page":"32","article-title":"Beyond online balanced descent: An optimal algorithm for smoothed online optimization","author":"Goel Gautam","year":"2019","unstructured":"Gautam Goel, Yiheng Lin, Haoyuan Sun, and Adam Wierman. Beyond online balanced descent: An optimal algorithm for smoothed online optimization. Advances in Neural Information Processing Systems, 32, 2019.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_41_1","series-title":"Proceedings of Machine Learning Research","first-page":"1141","volume-title":"Proceedings of the 36th International Conference on Machine Learning","author":"Cheng Richard","year":"2019","unstructured":"Richard Cheng, Abhinav Verma, Gabor Orosz, Swarat Chaudhuri, Yisong Yue, and Joel Burdick. Control regularization for reduced variance reinforcement learning. In Kamalika Chaudhuri and Ruslan Salakhutdinov, editors, Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 1141--1150. PMLR, 09--15 Jun 2019."},{"key":"e_1_2_1_42_1","volume-title":"ICML","author":"Le Hoang M.","year":"2016","unstructured":"Hoang M. Le, Andrew Kang, Yisong Yue, and Peter Carr. Smooth imitation learning for online sequence prediction. In ICML, 2016."},{"key":"e_1_2_1_43_1","volume-title":"ICML","author":"Li Pengfei","year":"2023","unstructured":"Pengfei Li, Jianyi Yang, and Shaolei Ren. Learning for edge-weighted online bipartite matching with robustness guarantees. In ICML, 2023."},{"key":"e_1_2_1_44_1","volume-title":"International Conference on Learning Representations","author":"Yang Yunchang","year":"2022","unstructured":"Yunchang Yang, Tianhao Wu, Han Zhong, Evrard Garcelon, Matteo Pirotta, Alessandro Lazaric, Liwei Wang, and Simon Shaolei Du. A reduction-based framework for conservative bandits and reinforcement learning. In International Conference on Learning Representations, 2022."},{"key":"e_1_2_1_45_1","volume-title":"ICML","author":"Chdowski Jakub","year":"2021","unstructured":"Jakub Chdowski, Adam Polak, Bartosz Szabucki, and Konrad Tomasz ona. Robust learning-augmented caching: An experimental study. In ICML, 2021."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSTE.2015.2487223"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2022.3173250"},{"key":"e_1_2_1_48_1","volume-title":"Towards environmentally equitable AI via geographical load balancing. In e-Energy","author":"Li Pengfei","year":"2024","unstructured":"Pengfei Li, Jianyi Yang, Adam Wierman, and Shaolei Ren. Towards environmentally equitable AI via geographical load balancing. In e-Energy, 2024."},{"key":"e_1_2_1_49_1","volume-title":"AI Now 2023 landscape: Confronting tech power","author":"Kak Amba","year":"2023","unstructured":"Amba Kak and Sarah Myers West. AI Now 2023 landscape: Confronting tech power. AI Now Institute, April 2023."},{"key":"e_1_2_1_50_1","volume-title":"July","author":"Acosta Alejandro Garofali","year":"2023","unstructured":"Alejandro Garofali Acosta, Shaun Riordan, and Mario Torres Jarr\u00edn. The environmental and ethical challenges of artificial intelligence. ThinkTwenty (T20) Policy Brief, July 2023."},{"key":"e_1_2_1_51_1","volume-title":"Policy Recommendation","author":"UNESCO.","year":"2022","unstructured":"UNESCO. Recommendation on the ethics of artificial intelligence. In Policy Recommendation, 2022."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"e_1_2_1_53_1","volume-title":"Advances in Neural Information Processing Systems","author":"Anand Keerti","year":"2021","unstructured":"Keerti Anand, Rong Ge, Amit Kumar, and Debmalya Panigrahi. A regression approach to learning-augmented online algorithms. In A. Beygelzimer, Y. Dauphin, P. Liang, and J. Wortman Vaughan, editors, Advances in Neural Information Processing Systems, 2021."},{"key":"e_1_2_1_54_1","volume-title":"NeurIPS","author":"Purohit Manish","year":"2018","unstructured":"Manish Purohit, Zoya Svitkina, and Ravi Kumar. Improving online algorithms via ml predictions. In NeurIPS, 2018."},{"key":"e_1_2_1_55_1","volume-title":"Learning robust algorithms for online allocation problems using adversarial training. In https:\/\/arxiv.org\/abs\/2010.08418","author":"Zuzic Goran","year":"2020","unstructured":"Goran Zuzic, Di Wang, Aranyak Mehta, and D. Sivakumar. Learning robust algorithms for online allocation problems using adversarial training. In https:\/\/arxiv.org\/abs\/2010.08418, 2020."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3489048.3530961"},{"key":"e_1_2_1_57_1","volume-title":"ICML","author":"Antoniadis Antonios","year":"2020","unstructured":"Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, and Bertrand Simon. Online metric algorithms with untrusted predictions. In ICML, 2020."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3604930.3605705"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132772"},{"key":"e_1_2_1_60_1","volume-title":"The national solar radiation data base (nsrdb). Renewable and sustainable energy reviews, 89:51--60","author":"Sengupta Manajit","year":"2018","unstructured":"Manajit Sengupta, Yu Xie, Anthony Lopez, Aron Habte, Galen Maclaurin, and James Shelby. The national solar radiation data base (nsrdb). Renewable and sustainable energy reviews, 89:51--60, 2018."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.17775\/CSEEJPES.2015.00046"},{"issue":"2","key":"e_1_2_1_62_1","first-page":"1","article-title":"Wind turbine blade efficiency and power calculation with electrical analogy","volume":"2","author":"Sarkar Asis","year":"2012","unstructured":"Asis Sarkar and Dhiren Kumar Behera. Wind turbine blade efficiency and power calculation with electrical analogy. International Journal of Scientific and Research Publications, 2(2):1--5, 2012.","journal-title":"International Journal of Scientific and Research Publications"},{"key":"e_1_2_1_63_1","first-page":"34492","volume-title":"Advances in Neural Information Processing Systems","volume":"35","author":"Tu Zhipeng","year":"2022","unstructured":"Zhipeng Tu, Xi Wang, Yiguang Hong, Lei Wang, Deming Yuan, and Guodong Shi. Distributed online convex optimization with compressed communication. In S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh, editors, Advances in Neural Information Processing Systems, volume 35, pages 34492--34504. Curran Associates, Inc., 2022."},{"key":"e_1_2_1_64_1","volume-title":"Online optimization with untrusted predictions. CoRR, abs\/2202.03519","author":"Rutten Daan","year":"2022","unstructured":"Daan Rutten, Nico Christianson, Debankur Mukherjee, and Adam Wierman. Online optimization with untrusted predictions. CoRR, abs\/2202.03519, 2022."},{"key":"e_1_2_1_65_1","first-page":"1254","volume-title":"International Conference on Machine Learning","author":"Wu Yifan","year":"2016","unstructured":"Yifan Wu, Roshan Shariff, Tor Lattimore, and Csaba Szepesv\u00e1ri. Conservative bandits. In International Conference on Machine Learning, pages 1254--1262. PMLR, 2016."},{"key":"e_1_2_1_66_1","volume-title":"International Conference on Learning Representations","author":"Yang Yunchang","year":"2021","unstructured":"Yunchang Yang, Tianhao Wu, Han Zhong, Evrard Garcelon, Matteo Pirotta, Alessandro Lazaric, Liwei Wang, and Simon Shaolei Du. A reduction-based framework for conservative bandits and reinforcement learning. In International Conference on Learning Representations, 2021."},{"key":"e_1_2_1_67_1","volume-title":"Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics","volume":"108","author":"Garcelon Evrard","year":"2020","unstructured":"Evrard Garcelon, Mohammad Ghavamzadeh, Alessandro Lazaric, and Matteo Pirotta. Conservative exploration in reinforcement learning. In Silvia Chiappa and Roberto Calandra, editors, Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, volume 108 of Proceedings of Machine Learning Research, pages 1431--1441. PMLR, 26--28 Aug 2020."},{"key":"e_1_2_1_68_1","volume-title":"H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc","author":"Agrawal Akshay","year":"2019","unstructured":"Akshay Agrawal, Brandon Amos, Shane Barratt, Stephen Boyd, Steven Diamond, and J. Zico Kolter. Differentiable convex optimization layers. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc, E. Fox, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 32. Curran Associates, Inc., 2019."},{"key":"e_1_2_1_69_1","volume-title":"Microsoft Azure Blog","author":"Walsh Noelle","year":"2022","unstructured":"Noelle Walsh. How Microsoft measures datacenter water and energy use to improve Azure Cloud sustainability. Microsoft Azure Blog, April 2022."},{"key":"e_1_2_1_70_1","unstructured":"Tesla. Tesla powerwall 2 datasheet - North America. https:\/\/www.tesla.com\/sites\/default\/files\/pdfs\/powerwall\/Powerwall%202_AC_Datasheet_en_northamerica.pdf."},{"key":"e_1_2_1_71_1","unstructured":"LG Electronics. LG electronics home series energy storage system datasheet. https:\/\/www.lg.com\/us\/ess\/pdf\/Resi_LGEUS_Home_8_Spec_0524.pdf."},{"key":"e_1_2_1_72_1","unstructured":"SolarEdge. Solaredge energy bank datasheet. https:\/\/knowledge-center.solaredge.com\/sites\/kc\/files\/se-energy-bank-battery-datasheet-nam.pdf."},{"key":"e_1_2_1_73_1","unstructured":"IQ Battery System. IQ battery 10t datasheet. https:\/\/www.switchsolarusa.com\/wp-content\/uploads\/2023\/02\/IQ-Battery-10T-DS-EN-US-10--25--2021.pdf."},{"key":"e_1_2_1_74_1","unstructured":"FranklinWH. Franklin home power datasheet https:\/\/www.franklinwh.com\/document\/franklin-home-power-v11-datasheet."},{"key":"e_1_2_1_75_1","volume-title":"Convex optimization and approximation. https:\/\/ee227c.github.io\/notes\/ee227c-notes.pdf","author":"Hardt Moritz","year":"2018","unstructured":"Moritz Hardt and Max Simchowitz. Convex optimization and approximation. https:\/\/ee227c.github.io\/notes\/ee227c-notes.pdf, 2018."}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700420","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:13:04Z","timestamp":1755907984000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,10]]},"references-count":75,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,12,10]]}},"alternative-id":["10.1145\/3700420"],"URL":"https:\/\/doi.org\/10.1145\/3700420","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,10]]},"assertion":[{"value":"2024-12-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}