{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T17:55:37Z","timestamp":1784829337791,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3520023","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"450-463","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Near-optimal distributed degree+1 coloring"],"prefix":"10.1145","author":[{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[{"name":"Reykjavik University, Iceland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[{"name":"University of Freiburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandre","family":"Nolin","sequence":"additional","affiliation":[{"name":"Reykjavik University, Iceland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tigran","family":"Tonoyan","sequence":"additional","affiliation":[{"name":"Krisp Technologies, Armenia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Palette Sparsification Beyond (\u0394 +1) Vertex Coloring. In APPROX\/RANDOM (LIPIcs, Vol. 176)","volume":"6","author":"Alon Noga","year":"2020","unstructured":"Noga Alon and Sepehr Assadi . 2020 . Palette Sparsification Beyond (\u0394 +1) Vertex Coloring. In APPROX\/RANDOM (LIPIcs, Vol. 176) . LZI , 6 : 1 \u2013 6 :22. Noga Alon and Sepehr Assadi. 2020. Palette Sparsification Beyond (\u0394 +1) Vertex Coloring. In APPROX\/RANDOM (LIPIcs, Vol. 176). LZI, 6:1\u20136:22.","journal-title":"LZI"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_3_1","volume-title":"Sublinear algorithms for (\u0394 + 1) vertex coloring","author":"Assadi Sepehr","unstructured":"Sepehr Assadi , Yu Chen , and Sanjeev Khanna . 2019. Sublinear algorithms for (\u0394 + 1) vertex coloring . In SODA. SIAM , 767\u2013786. Sepehr Assadi, Yu Chen, and Sanjeev Khanna. 2019. Sublinear algorithms for (\u0394 + 1) vertex coloring. In SODA. SIAM, 767\u2013786."},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions. In ITCS (LIPIcs, Vol. 215)","volume":"10","author":"Assadi Sepehr","year":"2022","unstructured":"Sepehr Assadi and Chen Wang . 2022 . Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions. In ITCS (LIPIcs, Vol. 215) . LZI , 10 : 1 \u2013 10 :20. Sepehr Assadi and Chen Wang. 2022. Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions. In ITCS (LIPIcs, Vol. 215). LZI, 10:1\u201310:20.","journal-title":"LZI"},{"key":"e_1_3_2_1_5_1","volume-title":"Plotkin","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. IEEE Computer Society , 364\u2013369. Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, and Serge A. Plotkin. 1989. Network Decomposition and Locality in Distributed Computation. In FOCS. IEEE Computer Society, 364\u2013369."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Alkida Balliu Fabian Kuhn and Dennis Olivetti. 2020. Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta. In PODC. ACM.  Alkida Balliu Fabian Kuhn and Dennis Olivetti. 2020. Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta. In PODC. ACM.","DOI":"10.1145\/3382734.3405710"},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Distributed Coloring of Graphs with an Optimal Number of Colors. In STACS (LIPIcs, Vol. 126)","volume":"10","author":"Bamas \u00c9tienne","year":"2019","unstructured":"\u00c9tienne Bamas and Louis Esperet . 2019 . Distributed Coloring of Graphs with an Optimal Number of Colors. In STACS (LIPIcs, Vol. 126) . LZI , 10 : 1 \u2013 10 :15. \u00c9tienne Bamas and Louis Esperet. 2019. Distributed Coloring of Graphs with an Optimal Number of Colors. In STACS (LIPIcs, Vol. 126). LZI, 10:1\u201310:15.","journal-title":"LZI"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2979675"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2027216.2027221"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Leonid Barenboim and Michael Elkin. 2011. Distributed deterministic edge coloring using bounded neighborhood independence. In PODC. ACM 129\u2013138.  Leonid Barenboim and Michael Elkin. 2011. Distributed deterministic edge coloring using bounded neighborhood independence. In PODC. ACM 129\u2013138.","DOI":"10.1145\/1993806.1993825"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Leonid Barenboim Michael Elkin and Uri Goldenberg. 2018. Locally-Iterative Distributed (\u0394 +1)-Coloring below Szegedy-Vishwanathan Barrier and Applications to Self-Stabilization and to Restricted-Bandwidth Models. In PODC. ACM 437\u2013446.  Leonid Barenboim Michael Elkin and Uri Goldenberg. 2018. Locally-Iterative Distributed (\u0394 +1)-Coloring below Szegedy-Vishwanathan Barrier and Applications to Self-Stabilization and to Restricted-Bandwidth Models. In PODC. ACM 437\u2013446.","DOI":"10.1145\/3212734.3212769"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/12088848X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2903137"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020402"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Yi-Jun Chang Manuela Fischer Mohsen Ghaffari Jara Uitto and Yufan Zheng. 2019. The Complexity of (\u0394 +1) Coloring in Congested Clique Massively Parallel Computation and Centralized Local Computation. In PODC. ACM 471\u2013480.  Yi-Jun Chang Manuela Fischer Mohsen Ghaffari Jara Uitto and Yufan Zheng. 2019. The Complexity of (\u0394 +1) Coloring in Congested Clique Massively Parallel Computation and Centralized Local Computation. In PODC. ACM 471\u2013480.","DOI":"10.1145\/3293611.3331607"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1117537"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1249527"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Artur Czumaj Peter Davies and Merav Parter. 2020. Simple Deterministic Constant-Round Coloring in the Congested Clique. In PODC. ACM 309\u2013318.  Artur Czumaj Peter Davies and Merav Parter. 2020. Simple Deterministic Constant-Round Coloring in the Congested Clique. In PODC. ACM 309\u2013318.","DOI":"10.1145\/3382734.3405751"},{"key":"e_1_3_2_1_19_1","volume-title":"Probabilistic Tools for the Analysis of Randomized Optimization Heuristics","author":"Doerr Benjamin","unstructured":"Benjamin Doerr . 2020. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics . Springer International Publishing , 1\u201387. isbn:978-3-030-29414-4 Benjamin Doerr. 2020. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. Springer International Publishing, 1\u201387. isbn:978-3-030-29414-4"},{"key":"e_1_3_2_1_20_1","volume-title":"Dubhashi and Alessandro Panconesi","author":"Devdatt","year":"2009","unstructured":"Devdatt P. Dubhashi and Alessandro Panconesi . 2009 . Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press . isbn:978-0-521-88427-3 Devdatt P. Dubhashi and Alessandro Panconesi. 2009. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press. isbn:978-0-521-88427-3"},{"key":"e_1_3_2_1_21_1","volume-title":"SODA","author":"Elkin Michael","unstructured":"Michael Elkin , Seth Pettie , and Hsin-Hao Su. 2015. (2\u0394 -1)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting . In SODA . SIAM , 355\u2013370. Michael Elkin, Seth Pettie, and Hsin-Hao Su. 2015. (2\u0394 -1)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. In SODA. SIAM, 355\u2013370."},{"key":"e_1_3_2_1_22_1","volume-title":"Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching","author":"Fischer Manuela","unstructured":"Manuela Fischer , Mohsen Ghaffari , and Fabian Kuhn . 2017. Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching . In FOCS. IEEE Computer Society , 180\u2013191. Manuela Fischer, Mohsen Ghaffari, and Fabian Kuhn. 2017. Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. In FOCS. IEEE Computer Society, 180\u2013191."},{"key":"e_1_3_2_1_23_1","volume-title":"Local Conflict Coloring","author":"Fraigniaud Pierre","unstructured":"Pierre Fraigniaud , Marc Heinrich , and Adrian Kosowski . 2016. Local Conflict Coloring . In FOCS. IEEE Computer Society , 625\u2013634. Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski. 2016. Local Conflict Coloring. In FOCS. IEEE Computer Society, 625\u2013634."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20532"},{"key":"e_1_3_2_1_25_1","volume-title":"On Derandomizing Local Distributed Algorithms","author":"Ghaffari Mohsen","unstructured":"Mohsen Ghaffari , David G. Harris , and Fabian Kuhn . 2018. On Derandomizing Local Distributed Algorithms . In FOCS. IEEE Computer Society , 662\u2013673. Mohsen Ghaffari, David G. Harris, and Fabian Kuhn. 2018. On Derandomizing Local Distributed Algorithms. In FOCS. IEEE Computer Society, 662\u2013673."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari Juho Hirvonen Fabian Kuhn and Yannic Maus. 2018. Improved Distributed Delta-Coloring. In PODC. ACM 427\u2013436.  Mohsen Ghaffari Juho Hirvonen Fabian Kuhn and Yannic Maus. 2018. Improved Distributed Delta-Coloring. In PODC. ACM 427\u2013436.","DOI":"10.1145\/3212734.3212764"},{"key":"e_1_3_2_1_27_1","volume-title":"Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition","author":"Ghaffari Mohsen","unstructured":"Mohsen Ghaffari and Fabian Kuhn . 2021. Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition . In FOCS. IEEE Computer Society , 1009\u20131020. Mohsen Ghaffari and Fabian Kuhn. 2021. Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. In FOCS. IEEE Computer Society, 1009\u20131020."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0401044"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Magn\u00fas M. Halld\u00f3rsson Fabian Kuhn and Yannic Maus. 2020. Distance-2 Coloring in the CONGEST Model. In PODC. ACM 233\u2013242.  Magn\u00fas M. Halld\u00f3rsson Fabian Kuhn and Yannic Maus. 2020. Distance-2 Coloring in the CONGEST Model. In PODC. ACM 233\u2013242.","DOI":"10.1145\/3382734.3405706"},{"key":"e_1_3_2_1_30_1","first-page":"1","article-title":"Coloring Fast Without Learning Your Neighbors\u2019 Colors","volume":"39","author":"Halld\u00f3rsson Magn\u00fas M.","year":"2020","unstructured":"Magn\u00fas M. Halld\u00f3rsson , Fabian Kuhn , Yannic Maus , and Alexandre Nolin . 2020 . Coloring Fast Without Learning Your Neighbors\u2019 Colors . In DISC. LZI , 39 : 1 \u2013 39 :17. Magn\u00fas M. Halld\u00f3rsson, Fabian Kuhn, Yannic Maus, and Alexandre Nolin. 2020. Coloring Fast Without Learning Your Neighbors\u2019 Colors. In DISC. LZI, 39:1\u201339:17.","journal-title":"DISC. LZI"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Magn\u00fas M. Halld\u00f3rsson Fabian Kuhn Yannic Maus and Tigran Tonoyan. 2021. Efficient Randomized Distributed Coloring in CONGEST. In STOC. ACM 1180\u20131193.  Magn\u00fas M. Halld\u00f3rsson Fabian Kuhn Yannic Maus and Tigran Tonoyan. 2021. Efficient Randomized Distributed Coloring in CONGEST. In STOC. ACM 1180\u20131193.","DOI":"10.1145\/3406325.3451089"},{"key":"e_1_3_2_1_32_1","volume-title":"Near-Optimal Distributed Degree+1 Coloring. CoRR, abs\/2112.00604","author":"Halld\u00f3rsson Magn\u00fas M.","year":"2021","unstructured":"Magn\u00fas M. Halld\u00f3rsson , Fabian Kuhn , Alexandre Nolin , and Tigran Tonoyan . 2021. Near-Optimal Distributed Degree+1 Coloring. CoRR, abs\/2112.00604 ( 2021 ), (full version of this paper). Magn\u00fas M. Halld\u00f3rsson, Fabian Kuhn, Alexandre Nolin, and Tigran Tonoyan. 2021. Near-Optimal Distributed Degree+1 Coloring. CoRR, abs\/2112.00604 (2021), (full version of this paper)."},{"key":"e_1_3_2_1_33_1","volume-title":"Ultrafast Distributed Coloring of High Degree Graphs. CoRR, abs\/2105.04700","author":"Halld\u00f3rsson Magn\u00fas M.","year":"2021","unstructured":"Magn\u00fas M. Halld\u00f3rsson , Alexandre Nolin , and Tigran Tonoyan . 2021. Ultrafast Distributed Coloring of High Degree Graphs. CoRR, abs\/2105.04700 ( 2021 ). Magn\u00fas M. Halld\u00f3rsson, Alexandre Nolin, and Tigran Tonoyan. 2021. Ultrafast Distributed Coloring of High Degree Graphs. CoRR, abs\/2105.04700 (2021)."},{"key":"e_1_3_2_1_34_1","volume-title":"Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs","author":"Harris David G.","unstructured":"David G. Harris . 2019. Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs . In FOCS. IEEE Computer Society , 700\u2013724. David G. Harris. 2019. Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs. In FOCS. IEEE Computer Society, 700\u2013724."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178120"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00064-2"},{"key":"e_1_3_2_1_38_1","volume-title":"Distributed coloring in ~ O( ologn) bit rounds","author":"Kothapalli Kishore","unstructured":"Kishore Kothapalli , Christian Scheideler , Melih Onus , and Christian Schindelhauer . 2006. Distributed coloring in ~ O( ologn) bit rounds . In IPDPS. IEEE. Kishore Kothapalli, Christian Scheideler, Melih Onus, and Christian Schindelhauer. 2006. Distributed coloring in ~ O( ologn) bit rounds. In IPDPS. IEEE."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Fabian Kuhn. 2009. Weak graph colorings: distributed algorithms and applications. In SPAA. ACM 138\u2013144.  Fabian Kuhn. 2009. Weak graph colorings: distributed algorithms and applications. In SPAA. ACM 138\u2013144.","DOI":"10.1145\/1583991.1584032"},{"key":"e_1_3_2_1_40_1","volume-title":"Faster Deterministic Distributed Coloring Through Recursive List Coloring","author":"Kuhn Fabian","unstructured":"Fabian Kuhn . 2020. Faster Deterministic Distributed Coloring Through Recursive List Coloring . In SODA. SIAM , 1244\u20131259. Fabian Kuhn. 2020. Faster Deterministic Distributed Coloring Through Recursive List Coloring. In SODA. SIAM, 1244\u20131259."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Fabian Kuhn and Roger Wattenhofer. 2006. On the complexity of distributed graph coloring. In PODC. ACM 7\u201315.  Fabian Kuhn and Roger Wattenhofer. 2006. On the complexity of distributed graph coloring. In PODC. ACM 7\u201315.","DOI":"10.1145\/1146381.1146387"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_44_1","first-page":"1","article-title":"Local Conflict Coloring Revisited","volume":"16","author":"Maus Yannic","year":"2020","unstructured":"Yannic Maus and Tigran Tonoyan . 2020 . Local Conflict Coloring Revisited : Linial for Lists. In DISC. LZI , 16 : 1 \u2013 16 :18. Yannic Maus and Tigran Tonoyan. 2020. Local Conflict Coloring Revisited: Linial for Lists. In DISC. LZI, 16:1\u201316:18.","journal-title":"Linial for Lists. In DISC. LZI"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404036"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Alessandro Panconesi and Aravind Srinivasan. 1992. Improved Distributed Algorithms for Coloring and Network Decomposition Problems. In STOC. ACM 581\u2013592.  Alessandro Panconesi and Aravind Srinivasan. 1992. Improved Distributed Algorithms for Coloring and Network Decomposition Problems. In STOC. ACM 581\u2013592.","DOI":"10.1145\/129712.129769"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200759"},{"key":"e_1_3_2_1_48_1","first-page":"1","article-title":"Randomized (\u0394 +1)-Coloring in O( olog^* \u0394 ) Congested Clique Rounds. In DISC (LIPIcs, Vol. 121)","volume":"39","author":"Parter Merav","year":"2018","unstructured":"Merav Parter and Hsin-Hao Su . 2018 . Randomized (\u0394 +1)-Coloring in O( olog^* \u0394 ) Congested Clique Rounds. In DISC (LIPIcs, Vol. 121) . LZI , 39 : 1 \u2013 39 :18. Merav Parter and Hsin-Hao Su. 2018. Randomized (\u0394 +1)-Coloring in O( olog^* \u0394 ) Congested Clique Rounds. In DISC (LIPIcs, Vol. 121). LZI, 39:1\u201339:18.","journal-title":"LZI"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/1378762.1378763"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"V\u00e1clav Rozho\u0148 and Mohsen Ghaffari. 2020. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In STOC. ACM 350\u2013363.  V\u00e1clav Rozho\u0148 and Mohsen Ghaffari. 2020. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In STOC. ACM 350\u2013363.","DOI":"10.1145\/3357713.3384298"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Johannes Schneider and Roger Wattenhofer. 2010. A new technique for distributed symmetry breaking. In PODC. ACM 257\u2013266.  Johannes Schneider and Roger Wattenhofer. 2010. A new technique for distributed symmetry breaking. In PODC. ACM 257\u2013266.","DOI":"10.1145\/1835698.1835760"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Mario Szegedy and Sundar Vishwanathan. 1993. Locality based graph coloring. In STOC. ACM 201\u2013207.  Mario Szegedy and Sundar Vishwanathan. 1993. Locality based graph coloring. In STOC. ACM 201\u2013207.","DOI":"10.1145\/167088.167156"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520023","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:15Z","timestamp":1750188675000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":53,"alternative-id":["10.1145\/3519935.3520023","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520023","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}