{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:13:27Z","timestamp":1775229207728,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF- 17-2-0196"],"award-info":[{"award-number":["W911NF- 17-2-0196"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1842198"],"award-info":[{"award-number":["1842198"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467902","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"379-389","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Approximate Byzantine Fault-Tolerance in Distributed Optimization"],"prefix":"10.1145","author":[{"given":"Shuo","family":"Liu","sequence":"first","affiliation":[{"name":"Georgetown University, Washington DC, DC, USA"}]},{"given":"Nirupam","family":"Gupta","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique F\u00e9d\u00e9rale deLausanne, Lausanne, Switzerland"}]},{"given":"Nitin H.","family":"Vaidya","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington DC, DC, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Garnett (Eds.)","volume":"31","author":"Alistarh Dan","year":"2018","unstructured":"Dan Alistarh , Zeyuan Allen-Zhu , and Jerry Li . 2018 . Byzantine Stochastic Gradient Descent. In Advances in Neural Information Processing Systems, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R . Garnett (Eds.) , Vol. 31 . Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper\/ 2018\/file\/ a07c2f3b3b907aaf8436a26c6d77f0a2-Paper.pdf Dan Alistarh, Zeyuan Allen-Zhu, and Jerry Li. 2018. Byzantine Stochastic Gradient Descent. In Advances in Neural Information Processing Systems, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (Eds.), Vol. 31. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper\/2018\/file\/ a07c2f3b3b907aaf8436a26c6d77f0a2-Paper.pdf"},{"key":"e_1_3_2_2_2_1","volume-title":"Advanced econometrics","author":"Amemiya Takeshi","unstructured":"Takeshi Amemiya . 1985. Advanced econometrics . Harvard university press . Takeshi Amemiya. 1985. Advanced econometrics. Harvard university press."},{"key":"e_1_3_2_2_3_1","unstructured":"Jeremy Bernstein Jiawei Zhao Kamyar Azizzadenesheli and Anima Anandkumar. 2019. signSGD with Majority Vote is Communication Efficient And Fault Tolerant. arXiv:cs.DC\/1810.05291  Jeremy Bernstein Jiawei Zhao Kamyar Azizzadenesheli and Anima Anandkumar. 2019. signSGD with Majority Vote is Communication Efficient And Fault Tolerant. arXiv:cs.DC\/1810.05291"},{"key":"e_1_3_2_2_4_1","volume-title":"Parallel and distributed computation: numerical methods","author":"Bertsekas Dimitri P","unstructured":"Dimitri P Bertsekas and John N Tsitsiklis . 1989. Parallel and distributed computation: numerical methods . Vol. 23 . Prentice hall Englewood Cliffs, NJ. Dimitri P Bertsekas and John N Tsitsiklis. 1989. Parallel and distributed computation: numerical methods. Vol. 23. Prentice hall Englewood Cliffs, NJ."},{"key":"e_1_3_2_2_5_1","volume-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems -","volume":"1","author":"Bhatia Kush","year":"2015","unstructured":"Kush Bhatia , Prateek Jain , and Purushottam Kar . 2015 . Robust Regression via Hard Thresholding . In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1 (NIPS'15). MIT Press, Cambridge, MA, USA, 721--729. Kush Bhatia, Prateek Jain, and Purushottam Kar. 2015. Robust Regression via Hard Thresholding. In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1 (NIPS'15). MIT Press, Cambridge, MA, USA, 721--729."},{"key":"e_1_3_2_2_6_1","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS'17)","author":"Blanchard Peva","year":"2017","unstructured":"Peva Blanchard , El Mahdi El Mhamdi , Rachid Guerraoui , and Julien Stainer . 2017 . Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent . In Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS'17) . Curran Associates Inc., Red Hook, NY, USA, 118--128. Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, and Julien Stainer. 2017. Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent. In Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS'17). Curran Associates Inc., Red Hook, NY, USA, 118--128."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_3_2_2_9_1","volume-title":"Convex optimization","author":"Boyd Stephen","unstructured":"Stephen Boyd and Lieven Vandenberghe . 2004. Convex optimization . Cambridge university press . Stephen Boyd and Lieven Vandenberghe. 2004. Convex optimization. Cambridge university press."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2946020"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055491"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2813330"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2015.7171098"},{"key":"e_1_3_2_2_15_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), JenniferDy and Andreas Krause (Eds.)","volume":"80","author":"Damaskinos Georgios","year":"2018","unstructured":"Georgios Damaskinos , El Mahdi El Mhamdi , Rachid Guerraoui , Rhicheek Patra , and Mahsa Taziki . 2018 . Asynchronous Byzantine Machine Learning (the case of SGD) . In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), JenniferDy and Andreas Krause (Eds.) , Vol. 80 . PMLR, 1145--1154. http:\/\/proceedings.mlr.press\/v80\/damaskinos18a.html Georgios Damaskinos, El Mahdi El Mhamdi, Rachid Guerraoui, Rhicheek Patra, and Mahsa Taziki. 2018. Asynchronous Byzantine Machine Learning (the case of SGD). In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), JenniferDy and Andreas Krause (Eds.), Vol. 80. PMLR, 1145--1154. http:\/\/proceedings.mlr.press\/v80\/damaskinos18a.html"},{"key":"e_1_3_2_2_16_1","volume-title":"Sever: A Robust Meta-Algorithm for Stochastic Optimization. arXiv:cs.LG\/1803.02815","author":"Diakonikolas Ilias","year":"2019","unstructured":"Ilias Diakonikolas , Gautam Kamath , Daniel M. Kane , Jerry Li , Jacob Steinhardt , and Alistair Stewart . 2019 . Sever: A Robust Meta-Algorithm for Stochastic Optimization. arXiv:cs.LG\/1803.02815 Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Jacob Steinhardt, and Alistair Stewart. 2019. Sever: A Robust Meta-Algorithm for Stochastic Optimization. arXiv:cs.LG\/1803.02815"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"e_1_3_2_2_18_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), Jennifer Dy and Andreas Krause (Eds.)","volume":"80","author":"El Mhamdi El Mahdi","year":"2018","unstructured":"El Mahdi El Mhamdi , Rachid Guerraoui , and S\u00e9bastien Rouault . 2018 . The Hidden Vulnerability of Distributed Learning in Byzantium . In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), Jennifer Dy and Andreas Krause (Eds.) , Vol. 80 . PMLR, 3521--3530. http:\/\/proceedings.mlr.press\/v80\/mhamdi18a.html El Mahdi El Mhamdi, Rachid Guerraoui, and S\u00e9bastien Rouault. 2018. The Hidden Vulnerability of Distributed Learning in Byzantium. In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), Jennifer Dy and Andreas Krause (Eds.), Vol. 80. PMLR, 3521--3530. http:\/\/proceedings.mlr.press\/v80\/mhamdi18a.html"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2303233"},{"key":"e_1_3_2_2_20_1","unstructured":"Jiashi Feng Huan Xu and Shie Mannor. 2015. Distributed Robust Learning. arXiv:stat.ML\/1409.5937  Jiashi Feng Huan Xu and Shie Mannor. 2015. Distributed Robust Learning. arXiv:stat.ML\/1409.5937"},{"key":"e_1_3_2_2_21_1","volume-title":"Vaidya","author":"Gupta Nirupam","year":"2021","unstructured":"Nirupam Gupta , Shuo Liu , and Nitin H . Vaidya . 2021 . Byzantine Fault-Tolerant Distributed Machine Learning Using Stochastic Gradient Descent (SGD) and Norm-Based Comparative Gradient Elimination (CGE) . arXiv:cs.LG\/2008.04699 Nirupam Gupta, Shuo Liu, and Nitin H. Vaidya. 2021. Byzantine Fault-Tolerant Distributed Machine Learning Using Stochastic Gradient Descent (SGD) and Norm-Based Comparative Gradient Elimination (CGE). arXiv:cs.LG\/2008.04699"},{"key":"e_1_3_2_2_22_1","volume-title":"Vaidya","author":"Gupta Nirupam","year":"2019","unstructured":"Nirupam Gupta and Nitin H . Vaidya . 2019 . Byzantine Fault Tolerant Distributed Linear Regression . arXiv:cs.LG\/1903.08752 Nirupam Gupta and Nitin H. Vaidya. 2019. Byzantine Fault Tolerant Distributed Linear Regression. arXiv:cs.LG\/1903.08752"},{"key":"e_1_3_2_2_23_1","volume-title":"Byzantine Fault-Tolerant Parallelized Stochastic Gradient Descent for Linear Regression. In 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 415--420","author":"Gupta Nirupam","year":"2019","unstructured":"Nirupam Gupta and Nitin H. Vaidya . 2019 . Byzantine Fault-Tolerant Parallelized Stochastic Gradient Descent for Linear Regression. In 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 415--420 . https:\/\/doi.org\/10.1109\/ALLERTON. 2019 .8919735 Nirupam Gupta and Nitin H. Vaidya. 2019. Byzantine Fault-Tolerant Parallelized Stochastic Gradient Descent for Linear Regression. In 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 415--420. https:\/\/doi.org\/10.1109\/ALLERTON.2019.8919735"},{"key":"e_1_3_2_2_24_1","volume-title":"Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC '20)","author":"Gupta Nirupam","unstructured":"Nirupam Gupta and Nitin H. Vaidya . 2020. Fault-Tolerance in Distributed Optimization: The Case of Redundancy . In Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC '20) . Association for Computing Machinery, New York, NY, USA, 365--374. https:\/\/doi.org\/10.1145\/3382734.3405748 Nirupam Gupta and Nitin H. Vaidya. 2020. Fault-Tolerance in Distributed Optimization: The Case of Redundancy. In Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC '20). Association for Computing Machinery, New York, NY, USA, 365--374. https:\/\/doi.org\/10.1145\/3382734.3405748"},{"key":"e_1_3_2_2_25_1","volume-title":"Vaidya","author":"Gupta Nirupam","year":"2020","unstructured":"Nirupam Gupta and Nitin H . Vaidya . 2020 . Resilience in Collaborative Optimization : Redundant and Independent Cost Functions . arXiv:cs.DC\/2003.09675 Nirupam Gupta and Nitin H. Vaidya. 2020. Resilience in Collaborative Optimization: Redundant and Independent Cost Functions. arXiv:cs.DC\/2003.09675"},{"key":"e_1_3_2_2_26_1","unstructured":"Sai Praneeth Karimireddy Lie He and Martin Jaggi. 2020. Learning from History for Byzantine Robust Optimization. arXiv:cs.LG\/2012.10333  Sai Praneeth Karimireddy Lie He and Martin Jaggi. 2020. Learning from History for Byzantine Robust Optimization. arXiv:cs.LG\/2012.10333"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.23919\/ACC45564.2020.9147396"},{"key":"e_1_3_2_2_28_1","volume-title":"The Byzantine Generals Problem","author":"Lamport Leslie","unstructured":"Leslie Lamport , Robert Shostak , and Marshall Pease . 2019. The Byzantine Generals Problem . Association for Computing Machinery , New York, NY, USA , 203--226. Leslie Lamport, Robert Shostak, and Marshall Pease. 2019. The Byzantine Generals Problem. Association for Computing Machinery, New York, NY, USA, 203--226."},{"key":"e_1_3_2_2_29_1","volume-title":"Vaidya","author":"Liu Shuo","year":"2021","unstructured":"Shuo Liu , Nirupam Gupta , and Nitin H . Vaidya . 2021 . Approximate Byzantine Fault-Tolerance in Distributed Optimization . arXiv:cs.DC\/2101.09337 Shuo Liu, Nirupam Gupta, and Nitin H. Vaidya. 2021. Approximate Byzantine Fault-Tolerance in Distributed Optimization. arXiv:cs.DC\/2101.09337"},{"key":"e_1_3_2_2_30_1","volume-title":"Distributed algorithms","author":"Lynch Nancy A","unstructured":"Nancy A Lynch . 1996. Distributed algorithms . Elsevier . Nancy A Lynch. 1996. Distributed algorithms. Elsevier."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2606880"},{"key":"e_1_3_2_2_32_1","unstructured":"James R Munkres. 2000. Topology. Prentice Hall Upper Saddle River NJ.  James R Munkres. 2000. Topology. Prentice Hall Upper Saddle River NJ."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2607420"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCPS.2014.6843720"},{"key":"e_1_3_2_2_36_1","volume-title":"Sivaraman Balakrishnan, and Pradeep Ravikumar.","author":"Prasad Adarsh","year":"2018","unstructured":"Adarsh Prasad , Arun Sai Suggala , Sivaraman Balakrishnan, and Pradeep Ravikumar. 2018 . Robust Estimation via Robust Gradient Estimation . arXiv:stat.ML\/1802.06485 Adarsh Prasad, Arun Sai Suggala, Sivaraman Balakrishnan, and Pradeep Ravikumar. 2018. Robust Estimation via Robust Gradient Estimation. arXiv:stat.ML\/1802.06485"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984626"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2004.1428778"},{"key":"e_1_3_2_2_39_1","volume-title":"Proc. Int. Workshop on Satisfiability Modulo Theories.","author":"Shoukry Yasser","year":"2015","unstructured":"Yasser Shoukry , Pierluigi Nuzzo , Alberto Puggelli , Alberto L Sangiovanni- Vincentelli , Sanjit A Seshia , Mani Srivastava , and Paulo Tabuada . 2015 . Imhotep- SMT: A satisfiability modulo theory solver for secure state estimation . In Proc. Int. Workshop on Satisfiability Modulo Theories. Yasser Shoukry, Pierluigi Nuzzo, Alberto Puggelli, Alberto L Sangiovanni- Vincentelli, Sanjit A Seshia, Mani Srivastava, and Paulo Tabuada. 2015. Imhotep- SMT: A satisfiability modulo theory solver for secure state estimation. In Proc. Int. Workshop on Satisfiability Modulo Theories."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2676679"},{"key":"e_1_3_2_2_41_1","volume-title":"Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. arXiv:cs.LG\/1703.04940","author":"Steinhardt Jacob","year":"2017","unstructured":"Jacob Steinhardt , Moses Charikar , and Gregory Valiant . 2017 . Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. arXiv:cs.LG\/1703.04940 Jacob Steinhardt, Moses Charikar, and Gregory Valiant. 2017. Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. arXiv:cs.LG\/1703.04940"},{"key":"e_1_3_2_2_42_1","unstructured":"Lili Su and Shahin Shahrampour. 2018. Finite-time Guarantees for Byzantine-Resilient Distributed State Estimation with Noisy Measurements. arXiv:cs.SY\/1810.10086  Lili Su and Shahin Shahrampour. 2018. Finite-time Guarantees for Byzantine-Resilient Distributed State Estimation with Noisy Measurements. arXiv:cs.SY\/1810.10086"},{"key":"e_1_3_2_2_43_1","volume-title":"Vaidya","author":"Su Lili","year":"2016","unstructured":"Lili Su and Nitin H . Vaidya . 2016 . Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms (PODC '16). Association for Computing Machinery , New York, NY, USA, 425--434. https:\/\/doi.org\/10.1145\/2933057.2933105 Lili Su and Nitin H. Vaidya. 2016. Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms (PODC '16). Association for Computing Machinery, New York, NY, USA, 425--434. https:\/\/doi.org\/10.1145\/2933057.2933105"},{"key":"e_1_3_2_2_44_1","volume-title":"Vaidya","author":"Su Lili","year":"2016","unstructured":"Lili Su and Nitin H . Vaidya . 2016 . Non-Bayesian Learning in the Presence of Byzantine Agents. In Distributed Computing. Springer Berlin Heidelberg , Berlin, Heidelberg, 414--427. Lili Su and Nitin H. Vaidya. 2016. Non-Bayesian Learning in the Presence of Byzantine Agents. In Distributed Computing. Springer Berlin Heidelberg, Berlin, Heidelberg, 414--427."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3008139"},{"key":"e_1_3_2_2_46_1","unstructured":"Cong Xie Oluwasanmi Koyejo and Indranil Gupta. 2018. Generalized Byzantinetolerant SGD. arXiv:cs.DC\/1802.10116  Cong Xie Oluwasanmi Koyejo and Indranil Gupta. 2018. Generalized Byzantinetolerant SGD. arXiv:cs.DC\/1802.10116"},{"key":"e_1_3_2_2_47_1","volume-title":"Bajwa","author":"Yang Zhixiong","year":"2017","unstructured":"Zhixiong Yang and Waheed U . Bajwa . 2017 . ByRDiE : Byzantine-resilient distributed coordinate descent for decentralized learning. arXiv:cs.LG\/1708.08155 Zhixiong Yang and Waheed U. Bajwa. 2017. ByRDiE: Byzantine-resilient distributed coordinate descent for decentralized learning. arXiv:cs.LG\/1708.08155"},{"key":"e_1_3_2_2_48_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), Jennifer Dy and Andreas Krause (Eds.)","volume":"80","author":"Yin Dong","year":"2018","unstructured":"Dong Yin , Yudong Chen , Ramchandran Kannan , and Peter Bartlett . 2018 . Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates . In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), Jennifer Dy and Andreas Krause (Eds.) , Vol. 80 . PMLR, 5650--5659. http:\/\/proceedings.mlr.press\/v80\/yin18a.html Dong Yin, Yudong Chen, Ramchandran Kannan, and Peter Bartlett. 2018. Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates. In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), Jennifer Dy and Andreas Krause (Eds.), Vol. 80. PMLR, 5650--5659. http:\/\/proceedings.mlr.press\/v80\/yin18a.html"}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","location":"Virtual Event Italy","acronym":"PODC '21","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467902","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467902","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467902"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":48,"alternative-id":["10.1145\/3465084.3467902","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467902","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}