{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:47:51Z","timestamp":1781077671764,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":108,"publisher":"ACM","funder":[{"name":"NSF (National Science Foundation)","award":["1942010, CCF-2238138"],"award-info":[{"award-number":["1942010, CCF-2238138"]}]},{"name":"Sloan Fellowship","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Austrian Science Fund (FWF)","award":["10.55776\\\/ESP6088024"],"award-info":[{"award-number":["10.55776\\\/ESP6088024"]}]},{"name":"Google Research Fellowship","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Charles S. Baylis endowment","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Ministry of Education and Science of Bulgaria","award":[""],"award-info":[{"award-number":[""]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718153","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"132-143","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Deterministic Dynamic Maximal Matching in Sublinear Update Time"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7599-2679","authenticated-orcid":false,"given":"Aaron","family":"Bernstein","sequence":"first","affiliation":[{"name":"New York University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1612-0296","authenticated-orcid":false,"given":"Sayan","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6488-9990","authenticated-orcid":false,"given":"Peter","family":"Kiss","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8386-7168","authenticated-orcid":false,"given":"Thatchaphol","family":"Saranurak","sequence":"additional","affiliation":[{"name":"University of Michigan, Michigan, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00088"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00137"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2018.7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Sepehr Assadi. 2024. Faster Vizing and Near-Vizing Edge Coloring Algorithms. arXiv preprint arXiv:2405.13371.","DOI":"10.1137\/1.9781611978322.165"},{"key":"e_1_3_2_1_6_1","volume-title":"Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1616\u20131635","author":"Assadi Sepehr","year":"2019","unstructured":"Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab Mirrokni, and Cliff Stein. 2019. Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1616\u20131635."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.98"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585110"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 2nd Symposium on Simplicity in Algorithms (SOSA). 11:1\u201311:20","author":"Assadi Sepehr","year":"2019","unstructured":"Sepehr Assadi and Aaron Bernstein. 2019. Towards a Unified Theory of Sparsification for Matching Problems. In Proceedings of the 2nd Symposium on Simplicity in Algorithms (SOSA). 11:1\u201311:20."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2022.11"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355903"},{"key":"e_1_3_2_1_12_1","first-page":"364","article-title":"Network decomposition and locality in distributed computation","volume":"30","author":"Awerbuch Baruch","year":"1989","unstructured":"Baruch Awerbuch, Andrew V Goldberg, Michael Luby, and Serge A Plotkin. 1989. Network decomposition and locality in distributed computation. In FOCS. 30, 364\u2013369.","journal-title":"FOCS."},{"key":"e_1_3_2_1_13_1","volume-title":"50th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Azarmehr Amir","year":"2023","unstructured":"Amir Azarmehr and Soheil Behnezhad. 2023. Robust Communication Complexity of Matching: EDCS Achieves 5\/6 Approximation. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.109"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3461458"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2903137"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.89"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/130914140"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1106158"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00032"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00096"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2492\u20132508","author":"Behnezhad Soheil","year":"2020","unstructured":"Soheil Behnezhad, Jakub \u0141 \u0105cki, and Vahab Mirrokni. 2020. Fully Dynamic Matching: Beating 2-Approximation in \u0394 ^\u220a Update Time. In Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2492\u20132508."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.169"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Aaron Bernstein. 2017. Deterministic partially dynamic single source shortest paths in weighted graphs. arXiv preprint arXiv:1705.10097.","DOI":"10.1137\/1.9781611974782.29"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00224-023-10155-7"},{"key":"e_1_3_2_1_28_1","volume-title":"Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, and He Sun.","author":"Bernstein Aaron","year":"2020","unstructured":"Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, and He Sun. 2020. Fully-dynamic graph sparsifiers against an adaptive adversary. arXiv preprint arXiv:2004.08432."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897521"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039715"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Aaron Bernstein Jiale Chen Aditi Dudeja Zachary Langley Aaron Sidford and Ta-Wei Tu. 2024. Matching Composition and Efficient Weight Reduction in Dynamic Matching. arXiv preprint arXiv:2410.18936 To appear at SODA\u201925","DOI":"10.1137\/1.9781611978322.97"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451113"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469833"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00108"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_14"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Aaron Bernstein and Cliff Stein. 2015. Fully dynamic matching in bipartite graphs. In International Colloquium on Automata Languages and Programming. 167\u2013179.","DOI":"10.1007\/978-3-662-47672-7_14"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.CH50"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884485"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59250-3_8"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.1"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/140998925"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897568"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.30"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2021.27"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch1"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Sayan Bhattacharya Peter Kiss and Thatchaphol Saranurak. 2023. Sublinear Algorithms for (1.5+\u220a )-Approximate Matching. In STOC.","DOI":"10.1145\/3564246.3585252"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch5"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649648"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.113"},{"key":"e_1_3_2_1_50_1","unstructured":"Sayan Bhattacharya Thatchaphol Saranurak and Pattara Sukprasert. 2022. Simple dynamic spanners with near-optimal recourse against an adaptive adversary. arXiv preprint arXiv:2207.04954."},{"key":"e_1_3_2_1_51_1","unstructured":"Joakim Blikstad and Peter Kiss. 2023. Incremental (1-\u220a )-approximate dynamic matching in O(poly (1\/\u220a )) update time. arXiv preprint arXiv:2302.08432."},{"key":"e_1_3_2_1_52_1","volume-title":"Maximilian Probst Gutenberg, and Sushant Sachdeva","author":"van den Brand Jan","year":"2024","unstructured":"Jan van den Brand, Li Chen, Rasmus Kyng, Yang P Liu, Simon Meierhans, Maximilian Probst Gutenberg, and Sushant Sachdeva. 2024. Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. arXiv preprint arXiv:2407.10830."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2018.33"},{"key":"e_1_3_2_1_54_1","unstructured":"Jiale Chen Aaron Sidford and Ta-Wei Tu. 2023. Entropy Regularization and Faster Decremental Matching in General Graphs. arXiv preprint arXiv:2312.09077."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00109"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"e_1_3_2_1_57_1","unstructured":"Aleksander BG Christiansen Jacob Holm Ivor van der Hoog Eva Rotenberg and Chris Schwiegelshohn. 2022. Adaptive out-orientations with applications. arXiv preprint arXiv:2209.14087."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00111"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316320"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.147"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585196"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188764"},{"key":"e_1_3_2_1_63_1","first-page":"1","article-title":"On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter. In Proceedings of the 43rd International Colloquium on Automata","volume":"48","author":"Dahlgaard S\u00f8ren","year":"2016","unstructured":"S\u00f8ren Dahlgaard. 2016. On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP). 48:1\u201348:14.","journal-title":"Languages and Programming (ICALP)."},{"key":"e_1_3_2_1_64_1","unstructured":"Aditi Dudeja. 2024. A Note on Rounding Matchings in General Graphs. arXiv preprint arXiv:2402.03068."},{"key":"e_1_3_2_1_65_1","unstructured":"Michael Elkin and Ariel Khuzman. 2024. Deterministic Simple (1+\u220a )\u0394 -Edge-Coloring in Near-Linear Time. arXiv preprint arXiv:2401.10538."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0344-4"},{"key":"e_1_3_2_1_67_1","volume-title":"Algorithms for edge-coloring","author":"Gabow Harold N.","unstructured":"Harold N. Gabow, Takao Nishizeki, Oded Kariv, Daniel Leven, and Osamu Terada. 1985. Algorithms for edge-coloring. Tel Aviv University."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212743"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.172"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3659982"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.99"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.132"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.114"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977066.2"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977066.2"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.65"},{"key":"e_1_3_2_1_77_1","volume-title":"Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS). 29","author":"Gupta Manoj","year":"2014","unstructured":"Manoj Gupta, Venkatesh Raman, and SP Suresh. 2014. Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time. In Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS). 29, 227\u2013239."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.155"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.154"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"crossref","unstructured":"Bernhard Haeupler Yaowei Long and Thatchaphol Saranurak. 2024. Dynamic Deterministic Constant-Approximate Distance Oracles with n^\u220a Worst-Case Update Time. arXiv preprint arXiv:2402.18541.","DOI":"10.1109\/FOCS61266.2024.00121"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301360"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100373121"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1137\/140957299"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90144-4"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90141-9"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.5555\/647674.731515"},{"key":"e_1_3_2_1_89_1","unstructured":"Arun Jambulapati Yujia Jin Aaron Sidford and Kevin Tian. 2022. Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. In International Colloquium on Automata Languages and Programming (ICALP)."},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4226"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796487"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2022.94"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649767"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2403.02582"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22146"},{"key":"e_1_3_2_1_97_1","volume-title":"Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC). 1122\u20131129","author":"Nanongkai Danupon","year":"2017","unstructured":"Danupon Nanongkai and Thatchaphol Saranurak. 2017. Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O (n^1\/2-\u03b5 )-time. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC). 1122\u20131129."},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.92"},{"key":"e_1_3_2_1_99_1","first-page":"7","article-title":"Simple deterministic algorithms for fully dynamic maximal matching","volume":"12","author":"Neiman Ofer","year":"2016","unstructured":"Ofer Neiman and Shay Solomon. 2016. Simple deterministic algorithms for fully dynamic maximal matching. ACM Transactions on Algorithms (TALG), 12, 1 (2016), 7.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"e_1_3_2_1_100_1","volume-title":"Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS). 111:1\u2013111:23","author":"Roghani Mohammad","year":"2022","unstructured":"Mohammad Roghani, Amin Saberi, and David Wajc. 2022. Beating the Folklore Algorithm for Dynamic Matching. In Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS). 111:1\u2013111:23."},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322235"},{"key":"e_1_3_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.43"},{"key":"e_1_3_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.43"},{"key":"e_1_3_2_1_104_1","doi-asserted-by":"publisher","unstructured":"Shay Solomon. 2022. Open Problem. Report from Dagstuhl Seminar 22461 Dynamic Graph Algorithms 62. https:\/\/doi.org\/10.4230\/DagRep.12.11.45 10.4230\/DagRep.12.11.45","DOI":"10.4230\/DagRep.12.11.45"},{"key":"e_1_3_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2017.58"},{"key":"e_1_3_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520068"},{"key":"e_1_3_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384258"},{"key":"e_1_3_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055415"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","location":"Prague Czechia","acronym":"STOC '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:40:52Z","timestamp":1750693252000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":108,"alternative-id":["10.1145\/3717823.3718153","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718153","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}