{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:19Z","timestamp":1750220179373,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["950398"],"award-info":[{"award-number":["950398"]}],"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,8,2]]},"DOI":"10.1145\/3531130.3533336","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The boundedness and zero isolation problems for weighted automata over nonnegative rationals"],"prefix":"10.1145","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[{"name":"University of Warsaw, Poland"}]},{"given":"Engel","family":"Lefaucheux","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lorraine, Inria, LORIA, Nancy, France"}]},{"given":"Filip","family":"Mazowiecki","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems, Saarland Informatics Campus, Germany"}]},{"given":"David","family":"Purser","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems, Saarland Informatics Campus, Germany"}]},{"given":"Markus","family":"Whiteland","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems, Saarland Informatics Campus, Belgium and University of Li\u00e8ge, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054120410026"},{"key":"e_1_3_2_1_2_1","volume-title":"Regular Functions and Cost Register Automata. In 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013","author":"Alur Rajeev","year":"2013","unstructured":"Rajeev Alur , Loris D\u2019Antoni , Jyotirmoy\u00a0 V. Deshmukh , Mukund Raghothaman , and Yifei Yuan . 2013 . Regular Functions and Cost Register Automata. In 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013 , New Orleans, LA, USA , June 25-28, 2013. 13\u201322. https:\/\/doi.org\/10.1109\/LICS.2013.65 10.1109\/LICS.2013.65 Rajeev Alur, Loris D\u2019Antoni, Jyotirmoy\u00a0V. Deshmukh, Mukund Raghothaman, and Yifei Yuan. 2013. Regular Functions and Cost Register Automata. In 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013. 13\u201322. https:\/\/doi.org\/10.1109\/LICS.2013.65"},{"key":"e_1_3_2_1_3_1","volume-title":"28th EACSL Annual Conference on Computer Science Logic, CSL 2020","author":"Barloy Corentin","year":"2020","unstructured":"Corentin Barloy , Nathana\u00ebl Fijalkow , Nathan Lhote , and Filip Mazowiecki . 2020 . A Robust Class of Linear Recurrence Sequences . In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020 , January 13-16, 2020, Barcelona, Spain(LIPIcs, Vol.\u00a0152), Maribel Fern\u00e1ndez and Anca Muscholl (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 9:1\u20139:16. https:\/\/doi.org\/10.4230\/LIPIcs.CSL. 2020.9 10.4230\/LIPIcs.CSL.2020.9 Corentin Barloy, Nathana\u00ebl Fijalkow, Nathan Lhote, and Filip Mazowiecki. 2020. A Robust Class of Linear Recurrence Sequences. In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain(LIPIcs, Vol.\u00a0152), Maribel Fern\u00e1ndez and Anca Muscholl (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 9:1\u20139:16. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/337244.337257"},{"volume-title":"Vol.\u00a012","author":"Berstel Jean","key":"e_1_3_2_1_5_1","unstructured":"Jean Berstel and Christophe Reutenauer . 1988. Rational series and their languages. EATCS monographs on theoretical computer science , Vol.\u00a012 . Springer . https:\/\/www.worldcat.org\/oclc\/17841475 Jean Berstel and Christophe Reutenauer. 1988. Rational series and their languages. EATCS monographs on theoretical computer science, Vol.\u00a012. Springer. https:\/\/www.worldcat.org\/oclc\/17841475"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6911(00)00049-9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3105908"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.29"},{"key":"e_1_3_2_1_9_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbr\u00fccken, Germany (Virtual Conference)(LIPIcs, Vol.\u00a0168)","author":"Bumpus Georgina","year":"2020","unstructured":"Georgina Bumpus , Christoph Haase , Stefan Kiefer , Paul-Ioan Stoienescu , and Jonathan Tanner . 2020 . On the Size of Finite Rational Matrix Semigroups. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbr\u00fccken, Germany (Virtual Conference)(LIPIcs, Vol.\u00a0168) , Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 133:1\u2013133:19. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP. 2020.133 10.4230\/LIPIcs.ICALP.2020.133 Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, and Jonathan Tanner. 2020. On the Size of Finite Rational Matrix Semigroups. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbr\u00fccken, Germany (Virtual Conference)(LIPIcs, Vol.\u00a0168), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 133:1\u2013133:19. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.133"},{"key":"e_1_3_2_1_10_1","volume-title":"The Big-O Problem for Labelled Markov Chains and Weighted Automata. In 31st International Conference on Concurrency Theory, CONCUR 2020(LIPIcs, Vol.\u00a0171)","author":"Chistikov Dmitry","year":"2020","unstructured":"Dmitry Chistikov , Stefan Kiefer , Andrzej\u00a0 S. Murawski , and David Purser . 2020 . The Big-O Problem for Labelled Markov Chains and Weighted Automata. In 31st International Conference on Concurrency Theory, CONCUR 2020(LIPIcs, Vol.\u00a0171) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 41:1\u201341:19. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR. 2020.41 10.4230\/LIPIcs.CONCUR.2020.41 Dmitry Chistikov, Stefan Kiefer, Andrzej\u00a0S. Murawski, and David Purser. 2020. The Big-O Problem for Labelled Markov Chains and Weighted Automata. In 31st International Conference on Concurrency Theory, CONCUR 2020(LIPIcs, Vol.\u00a0171). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 41:1\u201341:19. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.41"},{"key":"e_1_3_2_1_11_1","volume-title":"The Big-O Problem. Log. Methods Comput. Sci. 18, 1","author":"Chistikov Dmitry","year":"2022","unstructured":"Dmitry Chistikov , Stefan Kiefer , Andrzej\u00a0 S. Murawski , and David Purser . 2022. The Big-O Problem. Log. Methods Comput. Sci. 18, 1 ( 2022 ). https:\/\/doi.org\/10.46298\/lmcs-18(1:40)2022 Extended journal version of [10]. 10.46298\/lmcs-18(1:40)2022 Dmitry Chistikov, Stefan Kiefer, Andrzej\u00a0S. Murawski, and David Purser. 2022. The Big-O Problem. Log. Methods Comput. Sci. 18, 1 (2022). https:\/\/doi.org\/10.46298\/lmcs-18(1:40)2022 Extended journal version of [10]."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63519"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3422822"},{"key":"e_1_3_2_1_14_1","unstructured":"Wojciech Czerwi\u0144ski Engel Lefaucheux Filip Mazowiecki David Purser and Markus\u00a0A. Whiteland. 2022. The boundedness and zero isolation problems for weighted automata over nonnegative rationals. CoRR abs\/2205.13516(2022). arXiv:2205.13516https:\/\/arxiv.org\/abs\/2205.13516 Full version of this paper.  Wojciech Czerwi\u0144ski Engel Lefaucheux Filip Mazowiecki David Purser and Markus\u00a0A. Whiteland. 2022. The boundedness and zero isolation problems for weighted automata over nonnegative rationals. CoRR abs\/2205.13516(2022). arXiv:2205.13516https:\/\/arxiv.org\/abs\/2205.13516 Full version of this paper."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54458-7_13"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2021.01.006"},{"volume-title":"Handbook of weighted automata","author":"Droste Manfred","key":"e_1_3_2_1_17_1","unstructured":"Manfred Droste , Werner Kuich , and Heiko Vogler . 2009. Handbook of weighted automata . Springer Science & Business Media . Manfred Droste, Werner Kuich, and Heiko Vogler. 2009. Handbook of weighted automata. Springer Science & Business Media."},{"key":"e_1_3_2_1_18_1","volume-title":"Deciding the value 1 problem for probabilistic leaktight automata. Logical Methods in Computer Science 11, 2","author":"Fijalkow Nathana\u00ebl","year":"2015","unstructured":"Nathana\u00ebl Fijalkow , Hugo Gimbert , Edon Kelmendi , and Youssouf Oualhadj . 2015. Deciding the value 1 problem for probabilistic leaktight automata. Logical Methods in Computer Science 11, 2 ( 2015 ). https:\/\/doi.org\/10.2168\/LMCS-11(2:12)2015 10.2168\/LMCS-11(2:12)2015 Nathana\u00ebl Fijalkow, Hugo Gimbert, Edon Kelmendi, and Youssouf Oualhadj. 2015. Deciding the value 1 problem for probabilistic leaktight automata. Logical Methods in Computer Science 11, 2 (2015). https:\/\/doi.org\/10.2168\/LMCS-11(2:12)2015"},{"key":"e_1_3_2_1_19_1","volume-title":"Probabilistic Automata of Bounded Ambiguity. In 28th International Conference on Concurrency Theory, CONCUR 2017","author":"Fijalkow Nathana\u00ebl","year":"2017","unstructured":"Nathana\u00ebl Fijalkow , Cristian Riveros , and James Worrell . 2017 . Probabilistic Automata of Bounded Ambiguity. In 28th International Conference on Concurrency Theory, CONCUR 2017 , September 5-8, 2017, Berlin, Germany(LIPIcs, Vol.\u00a085), Roland Meyer and Uwe Nestmann (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 19:1\u201319:14. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR. 2017.19 10.4230\/LIPIcs.CONCUR.2017.19 Nathana\u00ebl Fijalkow, Cristian Riveros, and James Worrell. 2017. Probabilistic Automata of Bounded Ambiguity. In 28th International Conference on Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany(LIPIcs, Vol.\u00a085), Roland Meyer and Uwe Nestmann (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 19:1\u201319:14. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.19"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2019.05.005"},{"key":"e_1_3_2_1_21_1","first-page":"197","article-title":"Matrices de hankel","volume":"53","author":"Fliess Michel","year":"1974","unstructured":"Michel Fliess . 1974 . Matrices de hankel . J. Math. Pures Appl 53 , 9 (1974), 197 \u2013 222 . Michel Fliess. 1974. Matrices de hankel. J. Math. Pures Appl 53, 9 (1974), 197\u2013222.","journal-title":"J. Math. Pures Appl"},{"key":"e_1_3_2_1_22_1","volume-title":"37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II(Lecture Notes in Computer Science, Vol.\u00a06199)","author":"Gimbert Hugo","year":"2010","unstructured":"Hugo Gimbert and Youssouf Oualhadj . 2010 . Probabilistic Automata on Finite Words: Decidable and Undecidable Problems. In Automata, Languages and Programming , 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II(Lecture Notes in Computer Science, Vol.\u00a06199) , Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm\u00a0Meyer auf\u00a0der Heide, and Paul\u00a0G. Spirakis (Eds.). Springer, 527\u2013538. https:\/\/doi.org\/10.1007\/978-3-642-14162-1_44 10.1007\/978-3-642-14162-1_44 Hugo Gimbert and Youssouf Oualhadj. 2010. Probabilistic Automata on Finite Words: Decidable and Undecidable Problems. In Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II(Lecture Notes in Computer Science, Vol.\u00a06199), Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm\u00a0Meyer auf\u00a0der Heide, and Paul\u00a0G. Spirakis (Eds.). Springer, 527\u2013538. https:\/\/doi.org\/10.1007\/978-3-642-14162-1_44"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80006-3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01700692"},{"key":"e_1_3_2_1_25_1","volume-title":"RP 2014, Oxford, UK, September 22-24, 2014. Proceedings. 112\u2013124","author":"Haase Christoph","year":"2014","unstructured":"Christoph Haase and Simon Halfon . 2014 . Integer Vector Addition Systems with States. In Reachability Problems - 8th International Workshop , RP 2014, Oxford, UK, September 22-24, 2014. Proceedings. 112\u2013124 . https:\/\/doi.org\/10.1007\/978-3-319-11439-2_9 10.1007\/978-3-319-11439-2_9 Christoph Haase and Simon Halfon. 2014. Integer Vector Addition Systems with States. In Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings. 112\u2013124. https:\/\/doi.org\/10.1007\/978-3-319-11439-2_9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90033-8"},{"key":"e_1_3_2_1_27_1","unstructured":"Angus Macintyre and Alex\u00a0J. Wilkie. 1996. On the decidability of the real exponential field. Kreiseliana. About and Around Georg Kreisel(1996) 441\u2013467.  Angus Macintyre and Alex\u00a0J. Wilkie. 1996. On the decidability of the real exponential field. Kreiseliana. About and Around Georg Kreisel(1996) 441\u2013467."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90001-9"},{"key":"e_1_3_2_1_29_1","volume-title":"24th EACSL Annual Conference on Computer Science Logic, CSL 2015","author":"Mazowiecki Filip","year":"2015","unstructured":"Filip Mazowiecki and Cristian Riveros . 2015 . Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata . In 24th EACSL Annual Conference on Computer Science Logic, CSL 2015 , September 7-10, 2015, Berlin, Germany(LIPIcs, Vol.\u00a041), Stephan Kreutzer (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 144\u2013159. https:\/\/doi.org\/10.4230\/LIPIcs.CSL. 2015.144 10.4230\/LIPIcs.CSL.2015.144 Filip Mazowiecki and Cristian Riveros. 2015. Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata. In 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany(LIPIcs, Vol.\u00a041), Stephan Kreutzer (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 144\u2013159. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2015.144"},{"key":"e_1_3_2_1_30_1","volume-title":"Pumping Lemmas for Weighted Automata. In 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018","author":"Mazowiecki Filip","year":"2018","unstructured":"Filip Mazowiecki and Cristian Riveros . 2018 . Pumping Lemmas for Weighted Automata. In 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 , February 28 to March 3, 2018, Caen, France(LIPIcs, Vol.\u00a096), Rolf Niedermeier and Brigitte Vall\u00e9e (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 50:1\u201350:14. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2018.50 10.4230\/LIPIcs.STACS.2018.50 Filip Mazowiecki and Cristian Riveros. 2018. Pumping Lemmas for Weighted Automata. In 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France(LIPIcs, Vol.\u00a096), Rolf Niedermeier and Brigitte Vall\u00e9e (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 50:1\u201350:14. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2018.50"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2018.07.002"},{"volume-title":"Introduction to probabilistic automata","author":"Paz Azaria","key":"e_1_3_2_1_32_1","unstructured":"Azaria Paz . 1971. Introduction to probabilistic automata . Academic Press . Azaria Paz. 1971. Introduction to probabilistic automata. Academic Press."},{"volume-title":"Diophantine Approximation","author":"Schmidt M.","key":"e_1_3_2_1_33_1","unstructured":"Wolfgang\u00a0 M. Schmidt . 1980. Simultaneous Approximation . In: Diophantine Approximation . Springer Berlin Heidelberg , Berlin, Heidelberg , 27\u201347. https:\/\/doi.org\/10.1007\/978-3-540-38645-2_2 10.1007\/978-3-540-38645-2_2 Wolfgang\u00a0M. Schmidt. 1980. Simultaneous Approximation. In: Diophantine Approximation. Springer Berlin Heidelberg, Berlin, Heidelberg, 27\u201347. https:\/\/doi.org\/10.1007\/978-3-540-38645-2_2"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(61)80020-X"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90047-L"},{"key":"e_1_3_2_1_36_1","first-page":"3","article-title":"On Semigroups of Matrices over the Tropical Semiring","volume":"28","author":"Simon Imre","year":"1994","unstructured":"Imre Simon . 1994 . On Semigroups of Matrices over the Tropical Semiring . RAIRO Theor. Informatics Appl. 28 , 3 - 4 (1994), 277\u2013294. https:\/\/doi.org\/10.1051\/ita\/1994283-402771 10.1051\/ita Imre Simon. 1994. On Semigroups of Matrices over the Tropical Semiring. RAIRO Theor. Informatics Appl. 28, 3-4 (1994), 277\u2013294. https:\/\/doi.org\/10.1051\/ita\/1994283-402771","journal-title":"RAIRO Theor. Informatics Appl."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1969-0242596-1"},{"volume-title":"Vol.\u00a0326","author":"Waldschmidt Michel","key":"e_1_3_2_1_38_1","unstructured":"Michel Waldschmidt . 2000. Diophantine Approximation on Linear Algebraic Groups. Grundlehren der mathematischen Wissenschaften (A Series of Comprehensive Studies in Mathematics) , Vol.\u00a0326 . Springer, Berlin , Heidelberg . Michel Waldschmidt. 2000. Diophantine Approximation on Linear Algebraic Groups. Grundlehren der mathematischen Wissenschaften (A Series of Comprehensive Studies in Mathematics), Vol.\u00a0326. Springer, Berlin, Heidelberg."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90381-B"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Haifa Israel","acronym":"LICS '22"},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533336","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":39,"alternative-id":["10.1145\/3531130.3533336","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533336","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}