{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T23:23:16Z","timestamp":1765927396617,"version":"3.48.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2025,12,15]]},"abstract":"<jats:p>In this column, we will discuss some papers in online algorithms that appeared in 2025. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact us!<\/jats:p>","DOI":"10.1145\/3785512.3785519","type":"journal-article","created":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T21:34:47Z","timestamp":1765834487000},"page":"52-65","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SIGACT News Online Algorithms Column 44: 2025 in review"],"prefix":"10.1145","volume":"56","author":[{"given":"Aflatoun","family":"Amouzandeh","sequence":"first","affiliation":[{"name":"University of Siegen, , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Hesse","sequence":"additional","affiliation":[{"name":"University of Siegen, , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f6ren","family":"Schmitt","sequence":"additional","affiliation":[{"name":"University of Siegen, , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[{"name":"University of Siegen, , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,12,15]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"1","volume-title":"32nd Annual European Symposium on Algorithms, ESA 2024, September 2--4","volume":"308","author":"Abrahamsen Mikkel","year":"2024","unstructured":"Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, and L\u00b4aszl\u00b4o Kozma. Online sorting and online TSP: randomized, stochastic, and high-dimensional. In Timothy 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 5:1--5:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2024."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095213"},{"key":"e_1_2_1_3_1","first-page":"551","volume-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19--23, 2017","author":"Azar Yossi","year":"2017","unstructured":"Yossi Azar, Arun Ganesh, Rong Ge, and Debmalya Panigrahi. Online service with delay. In Hamed Hatami, Pierre McKenzie, and Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19--23, 2017, pages 551--563. ACM, 2017."},{"key":"e_1_2_1_4_1","first-page":"1","volume-title":"49th International Colloquium on Automata, Languages, and Programming, ICALP 2022","volume":"229","author":"Azar Yossi","year":"2022","unstructured":"Yossi Azar, Chay Machluf, Boaz Patt-Shamir, and Noam Touitou. Competitive vertex recoloring. In Mikolaj Bojanczyk, Emanuela Merelli, and David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4--8, 2022, Paris, France, volume 229 of LIPIcs, pages 13:1--13:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2022."},{"key":"e_1_2_1_5_1","first-page":"434","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Babaioff Moshe","year":"2007","unstructured":"Moshe Babaioff, Nicole Immorlica, and Robert Kleinberg. Matroids, secretary problems, and online mechanisms. 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 434--443. SIAM, 2007."},{"key":"e_1_2_1_6_1","first-page":"1","volume-title":"Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference \/ Alexandria, VA, USA, January 9 - 12, 2022","author":"Banerjee Siddhartha","year":"2022","unstructured":"Siddhartha Banerjee, Vasilis Gkatzelis, Artur Gorokh, and Billy Jin. Online nash social welfare maximization with predictions. In Joseph (Seffi) Naor and Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference \/ Alexandria, VA, USA, January 9 - 12, 2022, pages 1--19. SIAM, 2022."},{"key":"e_1_2_1_7_1","first-page":"1","volume-title":"33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17","volume":"351","author":"Banihashem Kiarash","year":"2025","unstructured":"Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Danny Mittal, and Jan Olkowski. Beating competitive ratio 4 for graphic matroid secretary. In Anne Benoit, Haim Kaplan, Sebastian Wild, and Grzegorz Herman, editors, 33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17, 2025, Warsaw, Poland, volume 351 of LIPIcs, pages 52:1--52:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90209-E"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i5.20406"},{"key":"e_1_2_1_10_1","first-page":"1","volume-title":"33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17","volume":"351","author":"Basiak Mateusz","year":"2025","unstructured":"Mateusz Basiak, Marcin Bienkowski, Martin B\u00a8ohm, Marek Chrobak, Lukasz Jez, Jir\u00b4 Sgall, and Agnieszka Tatarczuk. A 3.3904-competitive online algorithm for list update with uniform costs. In Anne Benoit, Haim Kaplan, Sebastian Wild, and Grzegorz Herman, editors, 33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17, 2025, Warsaw, Poland, volume 351 of LIPIcs, pages 76:1--76:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_11_1","first-page":"1","volume-title":"33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17","volume":"351","author":"Bertram Christian","year":"2025","unstructured":"Christian Bertram. Online metric TSP. In Anne Benoit, Haim Kaplan, Sebastian Wild, and Grzegorz Herman, editors, 33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17, 2025, Warsaw, Poland, volume 351 of LIPIcs, pages 80:1--80:9. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_12_1","first-page":"1","volume-title":"30th Annual European Symposium on Algorithms, ESA 2022, September 5--9","volume":"244","author":"Bhattacharya Sayan","year":"2022","unstructured":"Sayan Bhattacharya, Thatchaphol Saranurak, and Pattara Sukprasert. Simple dynamic spanners with near-optimal recourse against an adaptive adversary. In Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, editors, 30th Annual European Symposium on Algorithms, ESA 2022, September 5--9, 2022, Berlin\/Potsdam, Germany, volume 244 of LIPIcs, pages 17:1--17:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2022."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634078"},{"key":"e_1_2_1_14_1","first-page":"1","volume-title":"42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4--7","volume":"327","author":"Bienkowski Marcin","year":"2025","unstructured":"Marcin Bienkowski, Jaroslaw Byrka, and Lukasz Jez. Online disjoint set covers: Randomization is not necessary. In Olaf Beyersdorff, Michal Pilipczuk, Elaine Pimentel, and Kim Thang Nguyen, editors, 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4--7, 2025, Jena, Germany, volume 327 of LIPIcs, pages 18:1--18:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649741"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977936.30"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.49"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.149"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.129"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-023-00597-8"},{"key":"e_1_2_1_21_1","first-page":"1","volume-title":"19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11--15","volume":"349","author":"Bose Prosenjit","year":"2025","unstructured":"Prosenjit Bose, Jean-Lou De Carufel, and John Stuart. Online routing in directed Yao? 4 graphs. In Pat Morin and Eunjin Oh, editors, 19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11--15, 2025, York University, Toronto, Canada, volume 349 of LIPIcs, pages 9:1--9:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_22_1","first-page":"952","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Buchbinder Niv","year":"2008","unstructured":"Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, and Maxim Sviridenko. Online make-to-order joint replenishment model: primal dual competitive algorithms. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20--22, 2008, pages 952--961. SIAM, 2008."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536506"},{"key":"e_1_2_1_24_1","first-page":"1","volume-title":"52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025","volume":"334","author":"Chandrasekaran Karthekeyan","year":"2025","unstructured":"Karthekeyan Chandrasekaran, Chandra Chekuri, and Weihao Zhu. Online disjoint spanning trees and polymatroid bases. In Keren Censor-Hillel, Fabrizio Grandoni, Jo\u00a8el Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, July 8--11, 2025, Aarhus, Denmark, volume 334 of LIPIcs, pages 44:1--44:20. Schloss Dagstuhl - Leibniz- Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/110839655"},{"key":"e_1_2_1_26_1","first-page":"1","volume-title":"33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17","volume":"351","author":"Coester Christian","year":"2025","unstructured":"Christian Coester and Jack Umenberger. Smoothed analysis of online metric problems. In Anne Benoit, Haim Kaplan, Sebastian Wild, and Grzegorz Herman, editors, 33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17, 2025, Warsaw, Poland, volume 351 of LIPIcs, pages 115:1-- 115:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00010"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/050630696"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20274"},{"key":"e_1_2_1_30_1","first-page":"1","volume-title":"33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17","volume":"351","author":"De Minati","year":"2025","unstructured":"Minati De, Satyam Singh, and Csaba D. T\u00b4oth. Online hitting sets for disks of bounded radii. In Anne Benoit, Haim Kaplan, Sebastian Wild, and Grzegorz Herman, editors, 33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17, 2025, Warsaw, Poland, volume 351 of LIPIcs, pages 50:1--50:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.168"},{"key":"e_1_2_1_32_1","first-page":"1","volume-title":"27th Annual European Symposium on Algorithms, ESA 2019, September 9--11","volume":"144","author":"Emek Yuval","year":"2019","unstructured":"Yuval Emek, Adam Goldbraikh, and Erez Kantor. Online disjoint set cover without prior knowledge. In Michael A. Bender, Ola Svensson, and Grzegorz Herman, editors, 27th Annual European Symposium on Algorithms, ESA 2019, September 9--11, 2019, Munich\/Garching, Germany, volume 144 of LIPIcs, pages 44:1--44:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2019."},{"key":"e_1_2_1_33_1","first-page":"1","volume-title":"33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17","volume":"351","author":"Ergen Ekin","year":"2025","unstructured":"Ekin Ergen. Online makespan scheduling under scenarios. In Anne Benoit, Haim Kaplan, Sebastian Wild, and Grzegorz Herman, editors, 33rd Annual European Symposium on Algorithms, ESA 2025, September 15--17, 2025, Warsaw, Poland, volume 351 of LIPIcs, pages 27:1--27:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680977"},{"key":"e_1_2_1_35_1","first-page":"1","volume-title":"52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025","volume":"334","author":"Fine Adi","year":"2025","unstructured":"Adi Fine, Haim Kaplan, and Uri Stemmer. Minimizing recourse in an adaptive balls and bins game. In Keren Censor-Hillel, Fabrizio Grandoni, Jo\u00a8el Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, July 8--11, 2025, Aarhus, Denmark, volume 334 of LIPIcs, pages 77:1--77:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_36_1","unstructured":"Miriam Fischer Dario Paccagnan and Cosimo Vinci. Optimal competitive ratio for optimization problems with congestion effects. In Alina Ene and Eshan Chattopadhyay editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2025 August 11--13 2025 Berkeley CA USA volume 353 of LIPIcs pages 9:1--9:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik 2025."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/14098692X"},{"key":"e_1_2_1_38_1","first-page":"1","volume-title":"52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025","volume":"334","author":"Harada Tsubasa","year":"2025","unstructured":"Tsubasa Harada and Toshiya Itoh. A nearly optimal deterministic algorithm for online transportation problem. In Keren Censor-Hillel, Fabrizio Grandoni, Jo\u00a8el Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, July 8--11, 2025, Aarhus, Denmark, volume 334 of LIPIcs, pages 94:1--94:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_39_1","first-page":"1","volume-title":"52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025","volume":"334","author":"Huang Zhiyi","year":"2025","unstructured":"Zhiyi Huang, Chui Shan Lee, Xinkai Shu, and ZhaoziWang. The long arm of nashian allocation in online p-mean welfare maximization. In Keren Censor-Hillel, Fabrizio Grandoni, Jo\u00a8el Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, July 8--11, 2025, Aarhus, Denmark, volume 334 of LIPIcs, pages 98:1--98:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_40_1","first-page":"1","volume-title":"42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4--7","volume":"327","author":"Kawase Yasushi","year":"2025","unstructured":"Yasushi Kawase and Tomohiro Nakayoshi. Online matching with delays and size-based costs. In Olaf Beyersdorff, Michal Pilipczuk, Elaine Pimentel, and Kim Thang Nguyen, editors, 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4--7, 2025, Jena, Germany, volume 327 of LIPIcs, pages 59:1--59:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/3519935.3519986","volume-title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","author":"Kulkarni Janardhan","year":"2022","unstructured":"Janardhan Kulkarni, Yang P Liu, Ashwin Sah, Mehtaab Sawhney, and Jakub Tarnawski. Online edge coloring via tree recurrences and correlation decay. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 104--116, 2022."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch59"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365674"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.130"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.100"},{"key":"e_1_2_1_46_1","first-page":"1","volume-title":"52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025","volume":"334","author":"Pabbaraju Chirag","year":"2025","unstructured":"Chirag Pabbaraju and Ali Vakilian. New and improved bounds for markov paging. In Keren Censor- Hillel, Fabrizio Grandoni, Jo\u00a8el Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, July 8--11, 2025, Aarhus, Denmark, volume 334 of LIPIcs, pages 123:1--123:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.164"},{"key":"e_1_2_1_48_1","first-page":"1","volume-title":"42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4--7","volume":"327","author":"Patt-Shamir Boaz","year":"2025","unstructured":"Boaz Patt-Shamir, Adi Ros\u00b4en, and Seeun William Umboh. Colorful vertex recoloring of bipartite graphs. In Olaf Beyersdorff, Michal Pilipczuk, Elaine Pimentel, and Kim Thang Nguyen, editors, 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4--7, 2025, Jena, Germany, volume 327 of LIPIcs, pages 70:1--70:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3694906.3743329"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175317"},{"key":"e_1_2_1_51_1","first-page":"1","volume-title":"42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4--7","volume":"327","author":"Touitou Noam","year":"2025","unstructured":"Noam Touitou. Nearly-optimal algorithm for non-clairvoyant service with delay. In Olaf Beyersdorff, Michal Pilipczuk, Elaine Pimentel, and Kim Thang Nguyen, editors, 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4--7, 2025, Jena, Germany, volume 327 of LIPIcs, pages 74:1--74:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2025."},{"key":"e_1_2_1_52_1","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing Vadim G.","year":"1964","unstructured":"Vadim G. Vizing. On an estimate of the chromatic class of a p-graph. Metody Diskret. Analiz., 3:25--30, 1964. ACM","journal-title":"Metody Diskret. Analiz."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3785512.3785519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T23:18:38Z","timestamp":1765927118000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3785512.3785519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,15]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12,15]]}},"alternative-id":["10.1145\/3785512.3785519"],"URL":"https:\/\/doi.org\/10.1145\/3785512.3785519","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2025,12,15]]},"assertion":[{"value":"2025-12-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}