{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:46:22Z","timestamp":1782971182647,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["853109"],"award-info":[{"award-number":["853109"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538452","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"37-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["The Landscape of Distributed Complexities on Trees and Beyond"],"prefix":"10.1145","author":[{"given":"Christoph","family":"Grunau","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V\u00e1clav","family":"Rozho\u0148","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Brandt","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.89"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331606"},{"key":"e_1_3_2_2_3_1","volume-title":"Classification of Distributed Binary Labeling Problems. In 34th International Symposium on Distributed Computing, DISC 2020, October 12--16, 2020, Virtual Conference. 17:1--17:17","author":"Balliu Alkida","year":"2020","unstructured":"Alkida Balliu , Sebastian Brandt , Yuval Efron , Juho Hirvonen , Yannic Maus , Dennis Olivetti , and Jukka Suomela . 2020 . Classification of Distributed Binary Labeling Problems. In 34th International Symposium on Distributed Computing, DISC 2020, October 12--16, 2020, Virtual Conference. 17:1--17:17 . https:\/\/doi.org\/10.4230\/LIPIcs. DISC.2020.17 arXiv:1911.13294 10.4230\/LIPIcs Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, and Jukka Suomela. 2020. Classification of Distributed Binary Labeling Problems. In 34th International Symposium on Distributed Computing, DISC 2020, October 12--16, 2020, Virtual Conference. 17:1--17:17. https:\/\/doi.org\/10.4230\/LIPIcs. DISC.2020.17 arXiv:1911.13294"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00037"},{"key":"e_1_3_2_2_5_1","volume-title":"Distributed -Coloring Plays Hide-and-Seek. CoRR abs\/2110.00643","author":"Balliu Alkida","year":"2021","unstructured":"Alkida Balliu , Sebastian Brandt , Fabian Kuhn , and Dennis Olivetti . 2021. Distributed -Coloring Plays Hide-and-Seek. CoRR abs\/2110.00643 ( 2021 ). arXiv:2110.00643 https:\/\/arxiv.org\/abs\/2110.00643 Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. 2021. Distributed -Coloring Plays Hide-and-Seek. CoRR abs\/2110.00643 (2021). arXiv:2110.00643 https:\/\/arxiv.org\/abs\/2110.00643"},{"key":"e_1_3_2_2_6_1","volume-title":"Distributed Lower Bounds for Ruling Sets. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020","author":"Balliu Alkida","year":"2020","unstructured":"Alkida Balliu , Sebastian Brandt , and Dennis Olivetti . 2020 . Distributed Lower Bounds for Ruling Sets. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 , Durham, NC, USA, November 16--19 , 2020. 365--376. https:\/\/doi.org\/10.1109\/FOCS46700.2020.00042 arXiv:2004.08282 10.1109\/FOCS46700.2020.00042 Alkida Balliu, Sebastian Brandt, and Dennis Olivetti. 2020. Distributed Lower Bounds for Ruling Sets. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16--19, 2020. 365--376. https:\/\/doi.org\/10.1109\/FOCS46700.2020.00042 arXiv:2004.08282"},{"key":"e_1_3_2_2_7_1","volume-title":"Locally Checkable Problems in Rooted Trees. In PODC '21: ACM Symposium on Principles of Distributed Computing","author":"Balliu Alkida","year":"2021","unstructured":"Alkida Balliu , Sebastian Brandt , Dennis Olivetti , Jan Studen\u00fd , Jukka Suomela , and Aleksandr Tereshchenko . 2021 . Locally Checkable Problems in Rooted Trees. In PODC '21: ACM Symposium on Principles of Distributed Computing , Virtual Event, Italy, July 26--30 , 2021, Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen (Eds.). ACM, 263--272. https:\/\/doi.org\/10.1145\/3465084.3467934 10.1145\/3465084.3467934 Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studen\u00fd, Jukka Suomela, and Aleksandr Tereshchenko. 2021. Locally Checkable Problems in Rooted Trees. In PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26--30, 2021, Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen (Eds.). ACM, 263--272. https:\/\/doi.org\/10.1145\/3465084.3467934"},{"key":"e_1_3_2_2_8_1","volume-title":"Almost global problems in the LOCAL model. Distributed Computing","author":"Balliu Alkida","year":"2020","unstructured":"Alkida Balliu , Sebastian Brandt , Dennis Olivetti , and Jukka Suomela . 2020. Almost global problems in the LOCAL model. Distributed Computing ( 2020 ), 1--23. Alkida Balliu, Sebastian Brandt, Dennis Olivetti, and Jukka Suomela. 2020. Almost global problems in the LOCAL model. Distributed Computing (2020), 1--23."},{"key":"e_1_3_2_2_9_1","volume-title":"Locally Checkable Labelings with Small Messages. In 35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs","volume":"18","author":"Balliu Alkida","year":"2021","unstructured":"Alkida Balliu , Keren Censor-Hillel , Yannic Maus , Dennis Olivetti , and Jukka Suomela . 2021 . Locally Checkable Labelings with Small Messages. In 35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs , Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 8:1--8: 18 . https: \/\/doi.org\/10.4230\/LIPIcs.DISC.2021.8 10.4230\/LIPIcs.DISC.2021.8 Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, and Jukka Suomela. 2021. Locally Checkable Labelings with Small Messages. In 35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs, Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 8:1--8:18. https: \/\/doi.org\/10.4230\/LIPIcs.DISC.2021.8"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188860"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331605"},{"key":"e_1_3_2_2_12_1","volume-title":"Distributed Algorithms, the Lov\u00e1sz Local Lemma, and Descriptive Combinatorics. arXiv preprint arXiv:2004.04905","author":"Bernshteyn Anton","year":"2020","unstructured":"Anton Bernshteyn . 2020. Distributed Algorithms, the Lov\u00e1sz Local Lemma, and Descriptive Combinatorics. arXiv preprint arXiv:2004.04905 ( 2020 ). Anton Bernshteyn. 2020. Distributed Algorithms, the Lov\u00e1sz Local Lemma, and Descriptive Combinatorics. arXiv preprint arXiv:2004.04905 (2020)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331611"},{"key":"e_1_3_2_2_14_1","volume-title":"13th Innovations in Theoretical Computer Science Conference, ITCS 2022","volume":"26","author":"Brandt Sebastian","year":"2022","unstructured":"Sebastian Brandt , Yi-Jun Chang , Jan Greb\u00edk , Christoph Grunau , V\u00e1clav Rozhon , and Zolt\u00e1n Vidny\u00e1nszky . 2022 . Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics . In 13th Innovations in Theoretical Computer Science Conference, ITCS 2022 , January 31 - February 3, 2022, Berkeley, CA, USA (LIPIcs, Vol. 215), Mark Braverman (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 29:1--29: 26 . https:\/\/doi.org\/ 10.4230\/LIPIcs.ITCS.2022.29 10.4230\/LIPIcs.ITCS.2022.29 Sebastian Brandt, Yi-Jun Chang, Jan Greb\u00edk, Christoph Grunau, V\u00e1clav Rozhon, and Zolt\u00e1n Vidny\u00e1nszky. 2022. Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. In 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA (LIPIcs, Vol. 215), Mark Braverman (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 29:1--29:26. https:\/\/doi.org\/ 10.4230\/LIPIcs.ITCS.2022.29"},{"key":"e_1_3_2_2_15_1","volume-title":"Proc. 48th ACM Symp. on Theory of Computing (STOC). 479--488","author":"Brandt S.","unstructured":"S. Brandt , O. Fischer , J. Hirvonen , B. Keller , T. Lempi\u00e4inen , J. Rybicki , J. Suomela , and J. Uitto . 2016. A lower bound for the distributed Lov\u00e1sz local lemma . In Proc. 48th ACM Symp. on Theory of Computing (STOC). 479--488 . S. Brandt, O. Fischer, J. Hirvonen, B. Keller, T. Lempi\u00e4inen, J. Rybicki, J. Suomela, and J. Uitto. 2016. A lower bound for the distributed Lov\u00e1sz local lemma. In Proc. 48th ACM Symp. on Theory of Computing (STOC). 479--488."},{"key":"e_1_3_2_2_16_1","volume-title":"The Randomized Local Computation Complexity of the Lov\u00e1sz Local Lemma. In PODC '21: ACM Symposium on Principles of Distributed Computing","author":"Brandt Sebastian","year":"2021","unstructured":"Sebastian Brandt , Christoph Grunau , and V\u00e1clav Rozhon . 2021 . The Randomized Local Computation Complexity of the Lov\u00e1sz Local Lemma. In PODC '21: ACM Symposium on Principles of Distributed Computing , Virtual Event, Italy, July 26--30 , 2021, Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen (Eds.). ACM, 307--317. https:\/\/doi.org\/10.1145\/3465084.3467931 10.1145\/3465084.3467931 Sebastian Brandt, Christoph Grunau, and V\u00e1clav Rozhon. 2021. The Randomized Local Computation Complexity of the Lov\u00e1sz Local Lemma. In PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26--30, 2021, Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen (Eds.). ACM, 307--317. https:\/\/doi.org\/10.1145\/3465084.3467931"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087833"},{"key":"e_1_3_2_2_18_1","volume-title":"28th International Colloquium, SIROCCO 2021, Wroclaw, Poland, June 28 - July 1, 2021, Proceedings (Lecture Notes in Computer Science","volume":"49","author":"Chang Yi-Jun","year":"2021","unstructured":"Yi-Jun Chang , Jan Studen\u00fd , and Jukka Suomela . 2021 . Distributed Graph Problems Through an Automata-Theoretic Lens. In Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wroclaw, Poland, June 28 - July 1, 2021, Proceedings (Lecture Notes in Computer Science , Vol. 12810), Tomasz Jurdzinski and Stefan Schmid (Eds.). Springer, 31-- 49 . https:\/\/doi.org\/10.1007\/978--3-030--79527--6_3 10.1007\/978--3-030--79527--6_3 Yi-Jun Chang, Jan Studen\u00fd, and Jukka Suomela. 2021. Distributed Graph Problems Through an Automata-Theoretic Lens. In Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wroclaw, Poland, June 28 - July 1, 2021, Proceedings (Lecture Notes in Computer Science, Vol. 12810), Tomasz Jurdzinski and Stefan Schmid (Eds.). Springer, 31--49. https:\/\/doi.org\/10.1007\/978--3-030--79527--6_3"},{"key":"e_1_3_2_2_19_1","volume-title":"34th International Symposium on Distributed Computing (DISC 2020) (Leibniz International Proceedings in Informatics (LIPIcs)","author":"Chang Yi-Jun","year":"2020","unstructured":"Yi-Jun Chang . 2020. The Complexity Landscape of Distributed Locally Checkable Problems on Trees . In 34th International Symposium on Distributed Computing (DISC 2020) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 179), Hagit Attiya (Ed.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 18:1--18: 17 . https:\/\/doi.org\/10.4230\/LIPIcs.DISC. 2020 .18 10.4230\/LIPIcs.DISC.2020.18 Yi-Jun Chang. 2020. The Complexity Landscape of Distributed Locally Checkable Problems on Trees. In 34th International Symposium on Distributed Computing (DISC 2020) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 179), Hagit Attiya (Ed.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 18:1--18:17. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2020.18"},{"key":"e_1_3_2_2_20_1","volume-title":"Proc. 29th ACM-SIAM Symp. on Discrete Algorithms. 2633--2652","author":"Chang Y.-J.","unstructured":"Y.-J. Chang , Q. He , W. Li , S. Pettie , and J. Uitto . 2018. The complexity of distributed edge coloring with small palettes . In Proc. 29th ACM-SIAM Symp. on Discrete Algorithms. 2633--2652 . Y.-J. Chang, Q. He,W. Li, S. Pettie, and J. Uitto. 2018. The complexity of distributed edge coloring with small palettes. In Proc. 29th ACM-SIAM Symp. on Discrete Algorithms. 2633--2652."},{"key":"e_1_3_2_2_21_1","volume-title":"Proc. 57th IEEE Symp. on Foundations of Computer Science (FOCS).","author":"Chang Y.-J.","unstructured":"Y.-J. Chang , T. Kopelowitz , and S. Pettie . 2016. An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model . In Proc. 57th IEEE Symp. on Foundations of Computer Science (FOCS). Y.-J. Chang, T. Kopelowitz, and S. Pettie. 2016. An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. In Proc. 57th IEEE Symp. on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.23"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80023-7"},{"key":"e_1_3_2_2_24_1","unstructured":"Clinton T. Conley Jan Greb\u00edk and Oleg Pikhurko. 2020. Divisibility of Spheres with Measurable Pieces. arXiv:2012.07567 [math.MG]  Clinton T. Conley Jan Greb\u00edk and Oleg Pikhurko. 2020. Divisibility of Spheres with Measurable Pieces. arXiv:2012.07567 [math.MG]"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.25"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.173"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00069"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00097"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.166"},{"key":"e_1_3_2_2_30_1","volume-title":"Non-local Probes Do Not Help with Many Graph Problems","author":"G\u00f6\u00f6s Mika","unstructured":"Mika G\u00f6\u00f6s , Juho Hirvonen , Reut Levi , Moti Medina , and Jukka Suomela . 2016. Non-local Probes Do Not Help with Many Graph Problems . In Distributed Computing, Cyril Gavoille and David Ilcinkas (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 201--214. Mika G\u00f6\u00f6s, Juho Hirvonen, Reut Levi, Moti Medina, and Jukka Suomela. 2016. Non-local Probes Do Not Help with Many Graph Problems. In Distributed Computing, Cyril Gavoille and David Ilcinkas (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 201--214."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2017.185.2.6"},{"key":"e_1_3_2_2_32_1","unstructured":"Jan Greb\u00edk and V\u00e1clav Rozho. 2021. Of Toasts and Tails. arXiv:2103.08394 [math.CO]  Jan Greb\u00edk and V\u00e1clav Rozho. 2021. Of Toasts and Tails. arXiv:2103.08394 [math.CO]"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Alexander Holroyd Thomas Liggett etal 2015. Symmetric 1-dependent colorings of the integers. Electronic Communications in Probability 20 (2015).  Alexander Holroyd Thomas Liggett et al. 2015. Symmetric 1-dependent colorings of the integers. Electronic Communications in Probability 20 (2015).","DOI":"10.1214\/ECP.v20-4070"},{"key":"e_1_3_2_2_34_1","volume-title":"Wilson","author":"Holroyd Alexander E.","year":"2017","unstructured":"Alexander E. Holroyd , Oded Schramm , and David B . Wilson . 2017 . Finitary coloring. Ann. Probab. 45, 5 (09 2017), 2867--2898. https:\/\/doi.org\/10.1214\/16- AOP 1127 10.1214\/16- Alexander E. Holroyd, Oded Schramm, and David B. Wilson. 2017. Finitary coloring. Ann. Probab. 45, 5 (09 2017), 2867--2898. https:\/\/doi.org\/10.1214\/16- AOP1127"},{"key":"e_1_3_2_2_35_1","first-page":"77","article-title":"Equidecomposability and discrepancy; a solution of Tarski's circle-squaring problem","volume":"404","author":"Laczkovich Mikl\u00f3s","year":"1990","unstructured":"Mikl\u00f3s Laczkovich . 1990 . Equidecomposability and discrepancy; a solution of Tarski's circle-squaring problem . J. Reine Angew. Math. 404 (1990), 77 -- 117 . Mikl\u00f3s Laczkovich. 1990. Equidecomposability and discrepancy; a solution of Tarski's circle-squaring problem. J. Reine Angew. Math. 404 (1990), 77--117.","journal-title":"J. Reine Angew. Math."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.20"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2017.186.2.4"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404036"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793254571"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405721"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384298"},{"key":"e_1_3_2_2_43_1","volume-title":"Proc. 2nd Symp. on Innovations in Computer Science (ICS). 223--238","author":"Rubinfeld R.","unstructured":"R. Rubinfeld , G. Tamir , S. Vardi , and N. Xie . 2011. Fast Local Computation Algorithms . In Proc. 2nd Symp. on Innovations in Computer Science (ICS). 223--238 . R. Rubinfeld, G. Tamir, S. Vardi, and N. Xie. 2011. Fast Local Computation Algorithms. In Proc. 2nd Symp. on Innovations in Computer Science (ICS). 223--238."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOP1417"},{"key":"e_1_3_2_2_45_1","unstructured":"Jukka Suomela. 2020. Landscape of Locality. https:\/\/jukkasuomela.fi\/landscapeof- locality\/.  Jukka Suomela. 2020. Landscape of Locality. https:\/\/jukkasuomela.fi\/landscapeof- locality\/."}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy","acronym":"PODC '22","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538452","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538452"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":45,"alternative-id":["10.1145\/3519270.3538452","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538452","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}