{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:55:18Z","timestamp":1771959318442,"version":"3.50.1"},"reference-count":72,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DST, Govt of India, through the Data Science cluster of the ICPS program","award":["DST\/ICPS\/CLUSTER\/Data Science\/2018\/General"],"award-info":[{"award-number":["DST\/ICPS\/CLUSTER\/Data Science\/2018\/General"]}]},{"name":"NSM research grant","award":["MeitY\/R&D\/ HPC\/2(1)\/2014"],"award-info":[{"award-number":["MeitY\/R&D\/ HPC\/2(1)\/2014"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2023,3,31]]},"abstract":"<jats:p>For Affine Control Programs or Static Control Programs (SCoP), symbolic counting of reuse distances could induce polynomials for each reuse pair. These polynomials along with cache capacity constraints lead to non-affine (semi-algebraic) sets; and counting these sets is considered to be a hard problem. The state-of-the-art methods use various exact enumeration techniques relying on existing cardinality algorithms that can efficiently count affine sets.<\/jats:p>\n          <jats:p>\n            We propose\n            <jats:sc>BullsEye<\/jats:sc>\n            , a novel, scalable, accurate, and problem-size independent approximation framework. It is an analytical cache model for fully associative caches with LRU replacement policy focusing on sampling and linearization of non-affine stack distance polynomials. First, we propose a simple domain sampling method that can improve the scalability of exact enumeration. Second, we propose linearization techniques relying on\n            <jats:italic>Handelman\u2019s theorem<\/jats:italic>\n            and\n            <jats:italic>Bernstein\u2019s representation<\/jats:italic>\n            . To improve the scalability of the\n            <jats:italic>Handelman\u2019s theorem<\/jats:italic>\n            linearization technique, we propose template (Interval or Octagon) sub-polyhedral approximations.\n          <\/jats:p>\n          <jats:p>\n            Our methods obtain significant compile-time improvements with high-accuracy when compared to\n            <jats:sc>HayStack<\/jats:sc>\n            on important polyhedral compilation kernels such as\n            <jats:monospace>nussinov<\/jats:monospace>\n            ,\n            <jats:monospace>cholesky<\/jats:monospace>\n            , and\n            <jats:monospace>adi<\/jats:monospace>\n            from\n            <jats:sc>PolyBench<\/jats:sc>\n            , and\n            <jats:monospace>harris<\/jats:monospace>\n            ,\n            <jats:monospace>gaussianblur<\/jats:monospace>\n            from\n            <jats:sc>LLVM<\/jats:sc>\n            -TestSuite. Overall, on\n            <jats:sc>PolyBench<\/jats:sc>\n            kernels, our methods show up to 3.31\u00d7 (geomean) speedup with errors below \u2248 0.08% (geomean) for the octagon sub-polyhedral approximation.\n          <\/jats:p>","DOI":"10.1145\/3558003","type":"journal-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T11:12:41Z","timestamp":1661253161000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["<scp>BullsEye<\/scp>\n            : Scalable and Accurate Approximation Framework for Cache Miss Calculation"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7631-0644","authenticated-orcid":false,"given":"Nilesh Rajendra","family":"Shah","sequence":"first","affiliation":[{"name":"Department of CSE, IIT Hyderabad, India and Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2523-5856","authenticated-orcid":false,"given":"Ashitabh","family":"Misra","sequence":"additional","affiliation":[{"name":"Department of CSE, IIT Hyderabad, India and Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6375-3179","authenticated-orcid":false,"given":"Antoine","family":"Min\u00e9","sequence":"additional","affiliation":[{"name":"Department of CSE, IIT Hyderabad, India and Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0764-4602","authenticated-orcid":false,"given":"Rakesh","family":"Venkat","sequence":"additional","affiliation":[{"name":"Department of CSE, IIT Hyderabad, India and Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5290-3266","authenticated-orcid":false,"given":"Ramakrishna","family":"Upadrasta","sequence":"additional","affiliation":[{"name":"Department of CSE, IIT Hyderabad, India and Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2022,11,17]]},"reference":[{"key":"e_1_3_2_2_2","volume-title":"A User\u2019s Guide for LattE Integrale v1.7.2","author":"Baldoni V.","year":"2013","unstructured":"V. Baldoni, N. Berline, J. A. De Loera, B. Dutra, M. Koppe, S. Moreinis, G. Pinto, M. Vergne, and J. Wu. 2013. A User\u2019s Guide for LattE Integrale v1.7.2. Retrieved from http:\/\/www.math.ucdavis.edu\/latte\/."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3158120"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.4.769"},{"key":"e_1_3_2_5_2","article-title":"Collected works, vol. 1","author":"Bernstein S.","year":"1952","unstructured":"S. Bernstein. 1952. Collected works, vol. 1. USSR Acad. Sci. (1952).","journal-title":"USSR Acad. Sci."},{"key":"e_1_3_2_6_2","article-title":"Collected works, vol. 2","author":"Bernstein S.","year":"1954","unstructured":"S. Bernstein. 1954. Collected works, vol. 2. USSR Acad. Sci. (1954).","journal-title":"USSR Acad. Sci."},{"key":"e_1_3_2_7_2","first-page":"617","volume-title":"IASTED International Conference on Parallel and Distributed Computing and Systems","author":"Beyls Kristof","year":"2001","unstructured":"Kristof Beyls and Erik D\u2019Hollander. 2001. Reuse distance as a metric for cache behavior. In IASTED International Conference on Parallel and Distributed Computing and Systems. 617\u2013622."},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2004.09.004."},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/SYNASC.2018.00014","volume-title":"20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","author":"Boulm\u00e9 S.","year":"2018","unstructured":"S. Boulm\u00e9, A. Mar\u00e9chaly, D. Monniaux, M. P\u00e9rin, and H. Yu. 2018. The verified polyhedron library: An overview. In 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). 9\u201317."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3372393."},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378859."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3296979.3192402."},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(65)90045-5"},{"key":"e_1_3_2_14_2","first-page":"237","volume-title":"ACM International Conference on Supercomputing 25th Anniversary Volume","author":"Clauss Philippe","year":"1996","unstructured":"Philippe Clauss. 1996. Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs. In ACM International Conference on Supercomputing 25th Anniversary Volume. Association for Computing Machinery, New York, NY, 237\u2013244."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2002049"},{"key":"e_1_3_2_16_2","volume-title":"Energy-aware Memory Management for Embedded Multimedia Systems: A Computer-aided Design Approach","author":"Clauss P.","year":"2011","unstructured":"P. Clauss, D. Garbervetsky, V. Loechner, and S. Verdoolaege. 2011. Polyhedral techniques for parametric memory requirement estimation. In Energy-aware Memory Management for Embedded Multimedia Systems: A Computer-aided Design Approach. Taylor and Francis."},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008069920230"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24723-4_9"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2003.04.003"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/780822.781159"},{"key":"e_1_3_2_22_2","first-page":"616","article-title":"Sur les poly\u00e9dres rationnels homoth\u00e9tiques \u00e0 n dimensions","volume":"254","author":"Ehrhart Eug\u00e9ne","year":"1962","unstructured":"Eug\u00e9ne Ehrhart. 1962. Sur les poly\u00e9dres rationnels homoth\u00e9tiques \u00e0 n dimensions. Comptes rendus de l\u2019Acad\u00e9mie des Sciences 254 (1962), 616\u2013618.","journal-title":"Comptes rendus de l\u2019Acad\u00e9mie des Sciences"},{"key":"e_1_3_2_23_2","first-page":"1","article-title":"Sur un probl\u00e9me de g\u00e9om\u00e9trie diophantienne lin\u00e9aire. I","volume":"226","author":"Ehrhart Eug\u00e9ne","year":"1967","unstructured":"Eug\u00e9ne Ehrhart. 1967. Sur un probl\u00e9me de g\u00e9om\u00e9trie diophantienne lin\u00e9aire. I. Poly\u00e9dres et r\u00e9seaux, J. Reine Angew. Math 226 (1967), 1\u201329.","journal-title":"Poly\u00e9dres et r\u00e9seaux, J. Reine Angew. Math"},{"key":"e_1_3_2_24_2","first-page":"25","article-title":"Sur un probl\u00e9me de g\u00e9om\u00e9trie diophantienne lin\u00e9aire. II","volume":"227","author":"Ehrhart Eug\u00e9ne","year":"1967","unstructured":"Eug\u00e9ne Ehrhart. 1967. Sur un probl\u00e9me de g\u00e9om\u00e9trie diophantienne lin\u00e9aire. II. Syst\u00e9mes diophantiens lin\u00e9aires, J. Reine Angew. Math 227 (1967), 25\u201349.","journal-title":"Syst\u00e9mes diophantiens lin\u00e9aires, J. Reine Angew. Math"},{"key":"e_1_3_2_25_2","first-page":"165","article-title":"Polyn\u00f4mes arithm\u00e9tiques et m\u00e9thode des poly\u00e9dres en combinatoire","volume":"35","author":"Ehrhart Eug\u00e9ne","year":"1977","unstructured":"Eug\u00e9ne Ehrhart. 1977. Polyn\u00f4mes arithm\u00e9tiques et m\u00e9thode des poly\u00e9dres en combinatoire. Int. Series Numer. Math. 35 (1977), 165.","journal-title":"Int. Series Numer. Math."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2010.5452069"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2012.03.001"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_3_2_29_2","volume-title":"5th International Workshop on Polyhedral Compilation Techniques (IMPACT\u201915), in Conjunction with HiPEAC\u201915","author":"Feautrier Paul","year":"2015","unstructured":"Paul Feautrier. 2015. The power of polynomials. In 5th International Workshop on Polyhedral Compilation Techniques (IMPACT\u201915), in Conjunction with HiPEAC\u201915. Retrieved from https:\/\/acohen.gitlabpages.inria.fr\/impact\/impact2015\/."},{"key":"e_1_3_2_30_2","first-page":"328","volume-title":"4th International Workshop on Languages and Compilers for Parallel Computing","author":"Ferrante Jeanne","year":"1991","unstructured":"Jeanne Ferrante, Vivek Sarkar, and W. Thrash. 1991. On estimating and enhancing cache effectiveness. In 4th International Workshop on Languages and Compilers for Parallel Computing. Springer-Verlag, Berlin, 328\u2013343."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9459-1_5"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/291069.291051"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/325478.325479"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007516818651"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626412500107"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314606"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3242953.3242964"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1988.132.35"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44743-1_5"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2013.6669862"},{"key":"e_1_3_2_41_2","unstructured":"Jan Edler and Mark D. Hill. 1999. Dinero IV Trace-Driven Uniprocessor Cache Simulator. Retrieved from http:\/\/pages.cs.wisc.edu\/markhill\/DineroIV\/."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_2_43_2","first-page":"2","volume-title":"IEEE\/ACM International Symposium on Code Generation and Optimization","author":"Lattner C.","year":"2021","unstructured":"C. Lattner, M. Amini, U. Bondhugula, A. Cohen, A. Davis, J. A. Pienaar, R. Riddle, T. Shpeisman, N. Vasilache, and O. Zinenko. 2021. MLIR: Scaling compiler infrastructure for domain specific computation. In IEEE\/ACM International Symposium on Code Generation and Optimization. IEEE, 2\u201314."},{"key":"e_1_3_2_44_2","first-page":"99","volume-title":"3rd International Workshop on Worst-Case Execution Time Analysis","author":"Lisper B.","year":"2003","unstructured":"B. Lisper. 2003. Fully automatic, parametric worst-case execution time analysis. In 3rd International Workshop on Worst-Case Execution Time Analysis, Vol. MDH-MRTC-116\/2003-1-SE. 99\u2013102."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025117523902"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49122-5_8"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_3_2_48_2","volume-title":"Weakly Relational Numerical Abstract Domains","author":"Min\u00e9 A.","year":"2004","unstructured":"A. Min\u00e9. 2004. Weakly Relational Numerical Abstract Domains. Ph.D. Dissertation. \u00c9cole Polytechnique, Palaiseau, France. Retrieved from http:\/\/www.di.ens.fr\/mine\/these\/these-color.pdf."},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8609-1"},{"key":"e_1_3_2_50_2","volume-title":"9th International Workshop on Polyhedral Compilation Techniques (IMPACT\u201919), in conjunction with HiPEAC\u201919","author":"Patwardhan Abhishek","year":"2019","unstructured":"Abhishek Patwardhan and Ramakrishna Upadrasta. 2019. Some efficient algorithms for the tightest U-TVPI polyhedral over-approximation problem. In 9th International Workshop on Polyhedral Compilation Techniques (IMPACT\u201919), in conjunction with HiPEAC\u201919. Retrieved from https:\/\/acohen.gitlabpages.inria.fr\/impact\/impact2019\/."},{"key":"e_1_3_2_51_2","unstructured":"Louis-No\u00ebl Pouchet Tomofumi Yuki et\u00a0al. 2018. PolyBench 4.2 Benchmarks. Retrieved from http:\/\/sourceforge.net\/projects\/polybench\/."},{"key":"e_1_3_2_52_2","unstructured":"Moj\u017cesz Presburger. 1929. \u00dcber die Vollstandigkeit eines gewissen systems der Arithmetik ganzer Zahlen in Welchem die Addition als einzige Operation hervortritt. Comptes-Rendus du ler Congres des Mathematiciens des Pays Slavs (1929). https:\/\/cir.nii.ac.jp\/crid\/1571698599431503232."},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125848"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178254"},{"key":"e_1_3_2_55_2","first-page":"111","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"Sankaranarayanan Sriram","year":"2006","unstructured":"Sriram Sankaranarayanan, Michael A. Col\u00f3n, Henny Sipma, and Zohar Manna. 2006. Efficient strongly relational polyhedral analysis. In Verification, Model Checking, and Abstract Interpretation, E. Allen Emerson and Kedar S. Namjoshi (Eds.). Springer, Berlin, 111\u2013125."},{"key":"e_1_3_2_56_2","first-page":"53","volume-title":"SAS (Lecture Notes in Computer Science)","author":"Sankaranarayanan Sriram","year":"2004","unstructured":"Sriram Sankaranarayanan, Henny B. Sipma, and Zohar Manna. 2004. Constraint-based linear-relations analysis. In SAS (Lecture Notes in Computer Science), Vol. 3148. Springer, 53\u201368."},{"key":"e_1_3_2_57_2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-30579-8_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"Sankaranarayanan Sriram","year":"2005","unstructured":"Sriram Sankaranarayanan, Henny B. Sipma, and Zohar Manna. 2005. Scalable analysis of linear systems using mathematical programming. In Verification, Model Checking, and Abstract Interpretation. Springer, Berlin, 25\u201341."},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.5555\/17634"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(01)00041-X"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11261-4_11"},{"key":"e_1_3_2_61_2","volume-title":"Sub-polyhedral Compilation Using (Unit-)Two-variable-per-inequality Polyhedra or Scalability Challenges in the Polyhedral Model: An Algorithmic Approach Using (Unit-)Two-variable per Inequality Sub-polyhedra","author":"Upadrasta Ramakrishna","year":"2013","unstructured":"Ramakrishna Upadrasta. 2013. Sub-polyhedral Compilation Using (Unit-)Two-variable-per-inequality Polyhedra or Scalability Challenges in the Polyhedral Model: An Algorithmic Approach Using (Unit-)Two-variable per Inequality Sub-polyhedra. Ph.D. Dissertation. Universit\u00e9 Paris-Sud (11), Orsay, France. Retrieved from http:\/\/tel.archives-ouvertes.fr\/tel-00818764."},{"key":"e_1_3_2_62_2","volume-title":"40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201913)","author":"Upadrasta Ramakrishna","year":"2013","unstructured":"Ramakrishna Upadrasta and Albert Cohen. 2013. Sub-polyhedral scheduling using (Unit-)two-variable-per-inequality polyhedra. In 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201913)."},{"key":"e_1_3_2_63_2","unstructured":"Sven Verdoolaege. 2007. Barvinok a library for counting the integer points in parametric and non-parametric polytopes. Retrieved from https:\/\/repo.or.cz\/barvinok.git."},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15582-6_49"},{"key":"e_1_3_2_65_2","unstructured":"Sven Verdoolaege and Tobias Grosser. 2012. Polyhedral extraction tool. In 2nd International Workshop on Polyhedral Compilation Techniques (IMPACT\u201912) ."},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/1023833.1023868"},{"key":"e_1_3_2_67_2","volume-title":"A Note on Chernikova\u2019s Algorithm","author":"Verge H. Le","year":"1992","unstructured":"H. Le Verge. 1992. A Note on Chernikova\u2019s Algorithm. Technical Report 635. IRISA, Rennes, France."},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113449"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/2451116.2451153"},{"key":"e_1_3_2_70_2","volume-title":"Towards an Efficient Parallel Parametric Linear Programming Solver","author":"Yu Hang","year":"2019","unstructured":"Hang Yu. 2019. Towards an Efficient Parallel Parametric Linear Programming Solver. Ph.D. Dissertation. Universit\u00e9 Grenoble Alpes."},{"key":"e_1_3_2_71_2","volume-title":"9th International Workshop on Polyhedral Compilation Techniques (IMPACT\u201919), in conjunction with HiPEAC\u201919","author":"Yuki Tomofumi","year":"2019","unstructured":"Tomofumi Yuki. 2019. The limit of polynomials. In 9th International Workshop on Polyhedral Compilation Techniques (IMPACT\u201919), in conjunction with HiPEAC\u201919. Retrieved from https:\/\/acohen.gitlabpages.inria.fr\/impact\/impact2019\/."},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/1552309.1552310"},{"key":"e_1_3_2_73_2","volume-title":"Lectures on Polytopes","author":"Ziegler G. M.","year":"2006","unstructured":"G. M. Ziegler. 2006. Lectures on Polytopes. Springer Science."}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558003","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:32Z","timestamp":1750182572000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,17]]},"references-count":72,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3,31]]}},"alternative-id":["10.1145\/3558003"],"URL":"https:\/\/doi.org\/10.1145\/3558003","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,17]]},"assertion":[{"value":"2021-11-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}