{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:52Z","timestamp":1777954612163,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":71,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2338816"],"award-info":[{"award-number":["CCF-2338816"]}],"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":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743356","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8611-6896","authenticated-orcid":false,"given":"Jan","family":"van den Brand","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, Georgia, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7328-3034","authenticated-orcid":false,"given":"Hossein","family":"Gholizadeh","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8485-6676","authenticated-orcid":false,"given":"Yonggang","family":"Jiang","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics and Saarland, University Saarb\u00fccken, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1417-6387","authenticated-orcid":false,"given":"Tjin","family":"de Vos","sequence":"additional","affiliation":[{"name":"TU Graz, Graz, Austria"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"32nd Annual European Symposium on Algorithms, ESA 2024","volume":"308","author":"Ashvinkumar Vikrant","year":"2024","unstructured":"[ABC+24] Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, and Hsin-Hao Su. Parallel, distributed, and quantum exact single-source shortest paths with negative edge weights. In Timothy M. Chan, Johannes Fischer, John Iacono, and Grzegorz Herman, editors, 32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom, volume 308 of LIPIcs, pages 13:1--13:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2024."},{"key":"e_1_3_2_1_2_1","first-page":"3997","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024","author":"Agarwal Arpit","year":"2024","unstructured":"[AKL+24] Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil, Chen Wang, Nathan White, and Peilin Zhong. Parallel approximate maximum flows in near-linear work and polylogarithmic depth. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pages 3997--4061. SIAM, 2024."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00137"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00018"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384321"},{"key":"e_1_3_2_1_6_1","series-title":"LIPIcs","first-page":"1","volume-title":"Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, and He Sun. Fully-dynamic graph sparsifiers against an adaptive adversary. In ICALP","author":"Bernstein Aaron","year":"2022","unstructured":"[BBG+22] Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, and He Sun. Fully-dynamic graph sparsifiers against an adaptive adversary. In ICALP, volume 229 of LIPIcs, pages 20:1--20:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2022."},{"key":"e_1_3_2_1_7_1","first-page":"503","volume-title":"64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023","year":"2023","unstructured":"[BCP+23] Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, and Aaron Sidford. A deterministic almost-linear time algorithm for minimum-cost flow. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pages 503--514. IEEE, 2023."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9444-5"},{"key":"e_1_3_2_1_9_1","first-page":"859","volume-title":"Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang. Minimum cost flows, mdps, and ℓ1 -regression in nearly linear time for dense instances","author":"van den Brand Jan","year":"2021","unstructured":"[BLL+21] Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang. Minimum cost flows, mdps, and ℓ1 -regression in nearly linear time for dense instances. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 859--869. ACM, 2021."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1109\/FOCS46700.2020.00090","volume-title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)","year":"2020","unstructured":"[BLN+20] Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang. Bipartite matching in nearly-linear time on moderately dense graphs. 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 919--930, 2020."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3631536"},{"key":"e_1_3_2_1_12_1","first-page":"259","volume-title":"Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020","year":"2020","unstructured":"[Bra20] Jan van den Brand. A deterministic linear program solver in current matrix multiplication time. In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 259--278. SIAM, 2020."},{"key":"e_1_3_2_1_13_1","first-page":"4354","volume-title":"Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023","author":"Cao Nairen","year":"2023","unstructured":"[CF23] Nairen Cao and Jeremy T. Fineman. Parallel exact shortest paths in almost linear work and square root depth. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 4354--4372. SIAM, 2023."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538583"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"e_1_3_2_1_16_1","first-page":"343","volume-title":"Proc. of the Symposium on Theory of Computing, STOC 2014","author":"Cohen Michael B.","year":"2014","unstructured":"[CKM+14] Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, and Shen Chen Xu. Solving SDD linear systems in nearly mlog 1\/2 n time. In Proc. of the Symposium on Theory of Computing, STOC 2014, pages 343--352. ACM, 2014."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3424305"},{"key":"e_1_3_2_1_18_1","first-page":"1705","volume-title":"SODA","author":"Chen Daoyuan","year":"2025","unstructured":"[CMGS25] Daoyuan Chen, Simon Meierhans, Maximilian Probst Gutenberg, and Thatchaphol Saranurak. Parallel and distributed expander decomposition: Simple, fast, and near-optimal. In SODA, pages 1705--1719. SIAM, 2025."},{"key":"e_1_3_2_1_19_1","first-page":"752","volume-title":"Proc. of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017","author":"Cohen Michael B.","year":"2017","unstructured":"[CMSV17] Michael B. Cohen, Aleksander Madry, Piotr Sankowski, and Adrian Vladu. Negative-weight shortest paths and unit capacity minimum cost flow in \u00f5(m10\/7 log w) time (extended abstract). In Proc. of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, pages 752--771. SIAM, 2017."},{"key":"e_1_3_2_1_20_1","first-page":"183","volume-title":"Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015","author":"Michael","year":"2015","unstructured":"[CP15] Michael B. Cohen and Richard Peng. Lp row sampling by lewis weights. In Rocco A. Servedio and Ronitt Rubinfeld, editors, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 183--192. ACM, 2015."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331618"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00043"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-32733-9_18"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00130"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538436"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594577"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00099"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978315.17"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1197850"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90039-X"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792231179"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218069"},{"key":"e_1_3_2_1_33_1","first-page":"1664","volume-title":"60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019","author":"Jambulapati Arun","year":"2019","unstructured":"[JLS19] Arun Jambulapati, Yang P. Liu, and Aaron Sidford. Parallel reachability in almost linear work and square root depth. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pages 1664--1686. IEEE Computer Society, 2019."},{"key":"e_1_3_2_1_34_1","first-page":"861","volume-title":"FOCS","author":"Jin Wenyu","year":"2021","unstructured":"[JS21] Wenyu Jin and Xiaorui Sun. Fully dynamic s-t edge connectivity in subpolynomial time (extended abstract). In FOCS, pages 861--872. IEEE, 2021."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451058"},{"key":"e_1_3_2_1_36_1","first-page":"217","volume-title":"Proc. of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014","author":"Kelner Jonathan A.","year":"2014","unstructured":"[KLOS14] Jonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, and Aaron Sidford. An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multi-commodity generalizations. In Proc. of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pages 217--226. SIAM, 2014."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897640"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1383525"},{"key":"e_1_3_2_1_39_1","first-page":"1002","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007","author":"Koutis Ioannis","year":"2007","unstructured":"[KM07] Ioannis Koutis and Gary L. Miller. A linear work, o(n 1\/6) time, parallel algorithm for solving planar laplacians. In Nikhil Bansal, Kirk Pruhs, and Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pages 1002--1011. SIAM, 2007."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.85"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/110845914"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488724"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274663"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579407"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451114"},{"key":"e_1_3_2_1_46_1","first-page":"317","volume-title":"Vertex connectivity in poly-logarithmic maxflows","author":"Li Jason","year":"2021","unstructured":"[LNP+21] Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, and Sorrachai Yingchareontha-wornchai. Vertex connectivity in poly-logarithmic maxflows. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 317--329. ACM, 2021. [Lov79] L\u00e1szl\u00f3 Lov\u00e1sz. On determinants, matchings, and random algorithms. In Lothar Budach, editor, Fundamentals of Computation Theory, FCT 1979, Proceedings of the Conference on Algebraic, Arthmetic, and Categorial Methods in Computation Theory, Berlin\/Wendisch-Rietz, Germany, September 17-21, 1979, pages 565--574. Akademie-Verlag, Berlin, 1979."},{"key":"e_1_3_2_1_47_1","volume-title":"Sparsified cholesky solvers for SDD linear systems. CoRR, abs\/1506.08204","author":"Lee Yin Tat","year":"2015","unstructured":"[LPS15] Yin Tat Lee, Richard Peng, and Daniel A. Spielman. Sparsified cholesky solvers for SDD linear systems. CoRR, abs\/1506.08204, 2015."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"e_1_3_2_1_49_1","volume-title":"Solving linear programs with sqrt(rank) linear system solves","author":"Lee Yin Tat","year":"2019","unstructured":"[LS19] Yin Tat Lee and Aaron Sidford. Solving linear programs with sqrt(rank) linear system solves, 2019."},{"key":"e_1_3_2_1_50_1","volume-title":"Liu and Aaron Sidford. Faster divergence maximization for faster maximum flow. CoRR, abs\/2003.08929","author":"Yang","year":"2020","unstructured":"[LS20a] Yang P. Liu and Aaron Sidford. Faster divergence maximization for faster maximum flow. CoRR, abs\/2003.08929, 2020."},{"key":"e_1_3_2_1_51_1","first-page":"803","volume-title":"Proc. of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020","author":"Yang","year":"2020","unstructured":"[LS20b] Yang P. Liu and Aaron Sidford. Faster energy maximization for faster maximum flow. In Proc. of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pages 803--814. ACM, 2020."},{"key":"e_1_3_2_1_52_1","series-title":"Proceedings of Machine Learning Research","first-page":"2140","volume-title":"Conference on Learning Theory, COLT","author":"Lee Yin Tat","year":"2019","unstructured":"[LSZ19] Yin Tat Lee, Zhao Song, and Qiuyi Zhang. Solving empirical risk minimization in the current matrix multiplication time. In Alina Beygelzimer and Daniel Hsu, editors, Conference on Learning Theory, COLT 2019, 25--28 June 2019, Phoenix, AZ, USA, volume 99 of Proceedings of Machine Learning Research, pages 2140--2157. PMLR, 2019."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.35"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.70"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579206"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.92"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90068-R"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch130"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2022.07.003"},{"key":"e_1_3_2_1_60_1","volume-title":"An efficient parallel solver for sdd linear systems","author":"Peng Richard","year":"2013","unstructured":"[PS13] Richard Peng and Daniel A. Spielman. An efficient parallel solver for sdd linear systems, 2013."},{"key":"e_1_3_2_1_61_1","first-page":"869","volume-title":"Algorithms and Complexity","author":"Vijaya Ramachandran","year":"1990","unstructured":"[R+90] Vijaya Ramachandran et al. Parallel algorithms for shared-memory machines. In Algorithms and Complexity, pages 869--941. Elsevier, 1990."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520074"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.36"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/265910.265923"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"crossref","unstructured":"[SS91] Maria J. Serna and Paul G. Spirakis. Tight RNC approximations to max flow. In Christian Choffrut and Matthias Jantzen editors STACS 91 8th Annual Symposium on Theoretical Aspects of Computer Science Hamburg Germany February 14-16 1991 Proceedings volume 480 of Lecture Notes in Computer Science pages 118--126. Springer 1991.","DOI":"10.1007\/BFb0020792"},{"key":"e_1_3_2_1_66_1","first-page":"81","volume-title":"Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004","author":"Daniel","year":"2004","unstructured":"[ST04] Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pages 81--90. ACM, 2004."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90013-X"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.162"},{"key":"e_1_3_2_1_69_1","first-page":"315","volume-title":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023","author":"Sachdeva Sushant","year":"2023","unstructured":"[SZ23] Sushant Sachdeva and Yibin Zhao. A simple and efficient parallel laplacian solver. In Kunal Agrawal and Julian Shun, editors, Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023, pages 315--325. ACM, 2023."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220006"},{"key":"e_1_3_2_1_71_1","first-page":"3792","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024","author":"Williams Virginia Vassilevska","year":"2024","unstructured":"[VXXZ24] Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, and Renfei Zhou. New bounds for matrix multiplication: from alpha to omega. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pages 3792--3835. SIAM, 2024."}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:19:31Z","timestamp":1777922371000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":71,"alternative-id":["10.1145\/3694906.3743356","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743356","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}