{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T06:26:59Z","timestamp":1769149619281,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":44,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538428","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"164-175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Balanced Allocations with the Choice of Noise"],"prefix":"10.1145","author":[{"given":"Dimitrios","family":"Los","sequence":"first","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/299633.299636"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060692"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210411"},{"key":"e_1_3_2_1_4_1","volume-title":"Fast Graphical Population Protocols. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"18","author":"Alistarh Dan","year":"2022","unstructured":"Dan Alistarh , Rati Gelashvili , and Joel Rybicki . 2022 . Fast Graphical Population Protocols. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 217), Quentin Bramas, Vincent Gramoli, and Alessia Milani (Eds.). Schloss Dagstuhl -- Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 14:1--14: 18 . https:\/\/doi. org\/10.4230\/LIPIcs.OPODIS.2021.14 Dan Alistarh, Rati Gelashvili, and Joel Rybicki. 2022. Fast Graphical Population Protocols. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 217), Quentin Bramas, Vincent Gramoli, and Alessia Milani (Eds.). Schloss Dagstuhl -- Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 14:1--14:18. https:\/\/doi. org\/10.4230\/LIPIcs.OPODIS.2021.14"},{"key":"e_1_3_2_1_5_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"16","author":"Alistarh Dan","year":"2020","unstructured":"Dan Alistarh , Giorgi Nadiradze , and Amirmojtaba Sabour . 2020 . Dynamic Averaging Load Balancing on Cycles. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 168), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 7:1--7: 16 . https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.7 10.4230\/LIPIcs.ICALP.2020.7 Dan Alistarh, Giorgi Nadiradze, and Amirmojtaba Sabour. 2020. Dynamic Averaging Load Balancing on Cycles. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 168), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 7:1--7:16. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-AAP656"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_8_1","volume-title":"The Power of Two Choices in Graphical Allocation. https:\/\/doi.org\/10.48550\/ARXIV.2106.06051 (to appear in STOC","author":"Bansal Nikhil","year":"2022","unstructured":"Nikhil Bansal and Ohad Feldheim . 2021. The Power of Two Choices in Graphical Allocation. https:\/\/doi.org\/10.48550\/ARXIV.2106.06051 (to appear in STOC 2022 ). 10.48550\/ARXIV.2106.06051 Nikhil Bansal and Ohad Feldheim. 2021. The Power of Two Choices in Graphical Allocation. https:\/\/doi.org\/10.48550\/ARXIV.2106.06051 (to appear in STOC 2022)."},{"key":"e_1_3_2_1_9_1","volume-title":"Simple Dynamics for Plurality Consensus. In SPAA '14: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures (Prague, Czech Republic) (SPAA '14)","author":"Becchetti Luca","year":"2014","unstructured":"Luca Becchetti , Andrea Clementi , Emanuele Natale , Francesco Pasquale , Riccardo Silvestri , and Luca Trevisan . 2014 . Simple Dynamics for Plurality Consensus. In SPAA '14: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures (Prague, Czech Republic) (SPAA '14) . Association for Computing Machinery, New York, NY, USA, 247--256. https:\/\/doi.org\/10.1145\/2612669.2612677 10.1145\/2612669.2612677 Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, and Luca Trevisan. 2014. Simple Dynamics for Plurality Consensus. In SPAA '14: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures (Prague, Czech Republic) (SPAA '14). Association for Computing Machinery, New York, NY, USA, 247--256. https:\/\/doi.org\/10.1145\/2612669.2612677"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0320-4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884481"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AAP804"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.10.008"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32512-0_35"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970444435X"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3288645.3288678"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347112"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129115"},{"key":"e_1_3_2_1_19_1","volume-title":"41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part II (Lecture Notes in Computer Science","volume":"446","author":"Cooper Colin","year":"2014","unstructured":"Colin Cooper , Robert Els\u00e4sser , and Tomasz Radzik . 2014 . The Power of Two Choices in Distributed Voting. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part II (Lecture Notes in Computer Science , Vol. 8573), Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.). Springer, Berlin, Heidelberg, 435-- 446 . https:\/\/doi.org\/10.1007\/978--3--662--43951--7_37 10.1007\/978--3--662--43951--7_37 Colin Cooper, Robert Els\u00e4sser, and Tomasz Radzik. 2014. The Power of Two Choices in Distributed Voting. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part II (Lecture Notes in Computer Science, Vol. 8573), Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.). Springer, Berlin, Heidelberg, 435--446. https:\/\/doi.org\/10.1007\/978--3--662--43951--7_37"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.1011"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.888643"},{"key":"e_1_3_2_1_22_1","volume-title":"Lorenz Minder, Thomas Sauerwald, and Christian Scheideler.","author":"Doerr Benjamin","year":"2011","unstructured":"Benjamin Doerr , Leslie Ann Goldberg , Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. 2011 . Stabilizing consensus with the power of two choices. In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4--6, 2011 (Co-located with FCRC 2011), Rajmohan Rajaraman and Friedhelm Meyer auf der Heide (Eds.). ACM, Dagstuhl, Germany , 149--158. https:\/\/doi.org\/10.1145\/1989493.1989516 10.1145\/1989493.1989516 Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. 2011. Stabilizing consensus with the power of two choices. In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4--6, 2011 (Co-located with FCRC 2011), Rajmohan Rajaraman and Friedhelm Meyer auf der Heide (Eds.). ACM, Dagstuhl, Germany, 149--158. https:\/\/doi.org\/10.1145\/1989493.1989516"},{"key":"#cr-split#-e_1_3_2_1_23_1.1","unstructured":"Ohad Noy Feldheim Ori Gurel-Gurevich and Jiange Li. 2021. Long-term balanced allocation via thinning. https:\/\/doi.org\/10.48550\/ARXIV.2110.05009 10.48550\/ARXIV.2110.05009"},{"key":"#cr-split#-e_1_3_2_1_23_1.2","unstructured":"Ohad Noy Feldheim Ori Gurel-Gurevich and Jiange Li. 2021. Long-term balanced allocation via thinning. https:\/\/doi.org\/10.48550\/ARXIV.2110.05009"},{"key":"e_1_3_2_1_24_1","volume-title":"Load balancing under -thinning. Electronic Communications in Probability 25","author":"Feldheim Ohad Noy","year":"2020","unstructured":"Ohad Noy Feldheim and Jiange Li. 2020. Load balancing under -thinning. Electronic Communications in Probability 25 ( 2020 ), Paper No . 1, 13. https: \/\/doi.org\/10.1214\/19-ecp282 10.1214\/19-ecp282 Ohad Noy Feldheim and Jiange Li. 2020. Load balancing under -thinning. Electronic Communications in Probability 25 (2020), Paper No. 1, 13. https: \/\/doi.org\/10.1214\/19-ecp282"},{"key":"e_1_3_2_1_25_1","volume-title":"Algorithms and Techniques (APPROX\/RANDOM 2020) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"22","author":"Greenhill Catherine","year":"2020","unstructured":"Catherine Greenhill , Bernard Mans , and Ali Pourmiri . 2020 . Balanced Allocation on Dynamic Hypergraphs. In Approximation, Randomization, and Combinatorial Optimization . Algorithms and Techniques (APPROX\/RANDOM 2020) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 176), Jaroslaw Byrka and Raghu Meka (Eds.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 11:1--11: 22 . https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2020.11 10.4230\/LIPIcs.APPROX Catherine Greenhill, Bernard Mans, and Ali Pourmiri. 2020. Balanced Allocation on Dynamic Hypergraphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2020) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 176), Jaroslaw Byrka and Raghu Meka (Eds.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 11:1--11:22. https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2020.11"},{"key":"e_1_3_2_1_26_1","volume-title":"Jr.","author":"It\u00f4 Kiyoshi","year":"1965","unstructured":"Kiyoshi It\u00f4 and Henry P . McKean , Jr. 1965 . Diffusion processes and their sample paths. Academic Press, Inc., Publishers, New York; Springer-Verlag , Berlin-New York, Berlin. xvii+321 pages. https:\/\/doi.org\/10.1007\/978--3--642--62025--6 10.1007\/978--3--642--62025--6 Kiyoshi It\u00f4 and Henry P. McKean, Jr. 1965. Diffusion processes and their sample paths. Academic Press, Inc., Publishers, New York; Springer-Verlag, Berlin-New York, Berlin. xvii+321 pages. https:\/\/doi.org\/10.1007\/978--3--642--62025--6"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940878"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109606"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323203"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993639"},{"key":"e_1_3_2_1_31_1","volume-title":"Balanced Allocations in Batches: Simplified and Generalized. https:\/\/doi.org\/10.48550\/ARXIV.2203.13902 (to appear in SPAA","author":"Los Dimitrios","year":"2022","unstructured":"Dimitrios Los and Thomas Sauerwald . 2022. Balanced Allocations in Batches: Simplified and Generalized. https:\/\/doi.org\/10.48550\/ARXIV.2203.13902 (to appear in SPAA 2022 ). 10.48550\/ARXIV.2203.13902 Dimitrios Los and Thomas Sauerwald. 2022. Balanced Allocations in Batches: Simplified and Generalized. https:\/\/doi.org\/10.48550\/ARXIV.2203.13902 (to appear in SPAA 2022)."},{"key":"e_1_3_2_1_32_1","volume-title":"13th Innovations in Theoretical Computer Science Conference (ITCS 2022) (Leibniz International Proceedings in Informatics (LIPIcs)","author":"Los Dimitrios","year":"2022","unstructured":"Dimitrios Los and Thomas Sauerwald . 2022. Balanced Allocations with Incomplete Information: The Power of Two Queries . In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 215), Mark Braverman (Ed.). Schloss Dagstuhl -- Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 103:1--103: 23 . https: \/\/doi.org\/10.4230\/LIPIcs.ITCS. 2022 .103 10.4230\/LIPIcs.ITCS.2022.103 Dimitrios Los and Thomas Sauerwald. 2022. Balanced Allocations with Incomplete Information: The Power of Two Queries. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 215), Mark Braverman (Ed.). Schloss Dagstuhl -- Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 103:1--103:23. https: \/\/doi.org\/10.4230\/LIPIcs.ITCS.2022.103"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.74"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.824633"},{"key":"e_1_3_2_1_35_1","volume-title":"Scheduling with Predictions and the Price of Misprediction. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"18","author":"Mitzenmacher Michael","year":"2020","unstructured":"Michael Mitzenmacher . 2020 . Scheduling with Predictions and the Price of Misprediction. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 151), Thomas Vidick (Ed.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 14:1--14: 18 . https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.14 10.4230\/LIPIcs.ITCS.2020.14 Michael Mitzenmacher. 2020. Scheduling with Predictions and the Price of Misprediction. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 151), Thomas Vidick (Ed.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 14:1--14:18. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.14"},{"key":"e_1_3_2_1_36_1","volume-title":"Handbook of randomized computing","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher , Andr\u00e9a W. Richa , and Ramesh Sitaraman . 2001. The power of two random choices: a survey of techniques and results . In Handbook of randomized computing , Vol. I , II. Comb. Optim., Vol. 9. Kluwer Acad . Publ., Dordrecht, Netherlands, 255--312. https:\/\/doi.org\/10.1007\/978--1--4615-0013--1_9 10.1007\/978--1--4615-0013--1_9 Michael Mitzenmacher, Andr\u00e9a W. Richa, and Ramesh Sitaraman. 2001. The power of two random choices: a survey of techniques and results. In Handbook of randomized computing, Vol. I, II. Comb. Optim., Vol. 9. Kluwer Acad. Publ., Dordrecht, Netherlands, 255--312. https:\/\/doi.org\/10.1007\/978--1--4615-0013--1_9"},{"key":"e_1_3_2_1_37_1","volume-title":"Probability and computing","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal . 2017. Probability and computing ( second ed.). Cambridge University Press , Cambridge . xx+467 pages. Randomization and probabilistic techniques in algorithms and data analysis. Michael Mitzenmacher and Eli Upfal. 2017. Probability and computing (second ed.). Cambridge University Press, Cambridge. xx+467 pages. Randomization and probabilistic techniques in algorithms and data analysis."},{"key":"e_1_3_2_1_38_1","volume-title":"Algorithms with Predictions","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Sergei Vassilvitskii . 2021. Algorithms with Predictions . Cambridge University Press , Cambridge , 646--662. https:\/\/doi.org\/10.1017\/ 9781108637435.037 Michael Mitzenmacher and Sergei Vassilvitskii. 2021. Algorithms with Predictions. Cambridge University Press, Cambridge, 646--662. https:\/\/doi.org\/10.1017\/ 9781108637435.037"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20558"},{"key":"e_1_3_2_1_41_1","volume-title":"Uniform Bounds for Scheduling with Job Size Estimates. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"30","author":"Scully Ziv","year":"2022","unstructured":"Ziv Scully , Isaac Grosof , and Michael Mitzenmacher . 2022 . Uniform Bounds for Scheduling with Job Size Estimates. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 215), Mark Braverman (Ed.). Schloss Dagstuhl -- Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 114:1--114: 30 . https:\/\/doi.org\/10.4230\/LIPIcs. ITCS.2022.114 10.4230\/LIPIcs Ziv Scully, Isaac Grosof, and Michael Mitzenmacher. 2022. Uniform Bounds for Scheduling with Job Size Estimates. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 215), Mark Braverman (Ed.). Schloss Dagstuhl -- Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 114:1--114:30. https:\/\/doi.org\/10.4230\/LIPIcs. ITCS.2022.114"},{"key":"e_1_3_2_1_42_1","series-title":"Lecture Notes in Comput. Sci.","volume-title":"Automata, languages, and programming. Part I","author":"Talwar Kunal","unstructured":"Kunal Talwar and Udi Wieder . 2014. Balanced allocations: a simple proof for the heavily loaded case . In Automata, languages, and programming. Part I . Lecture Notes in Comput. Sci. , Vol. 8572 . Springer , Heidelberg, Berlin , Heidelberg, 979-- 990. https:\/\/doi.org\/10.1007\/978--3--662--43948--7_81 10.1007\/978--3--662--43948--7_81 Kunal Talwar and Udi Wieder. 2014. Balanced allocations: a simple proof for the heavily loaded case. In Automata, languages, and programming. Part I. Lecture Notes in Comput. Sci., Vol. 8572. Springer, Heidelberg, Berlin, Heidelberg, 979-- 990. https:\/\/doi.org\/10.1007\/978--3--662--43948--7_81"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248407"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000070"}],"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.3538428","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":44,"alternative-id":["10.1145\/3519270.3538428","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538428","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"}}]}}