{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T06:47:13Z","timestamp":1765608433751,"version":"3.41.0"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:00:00Z","timestamp":1398902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Czech Ministry of Education","award":["MSM 0021622409"],"award-info":[{"award-number":["MSM 0021622409"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["267165"],"award-info":[{"award-number":["267165"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"project GAUK 49209"},{"name":"project 1M0545 by the Ministry of Education of the Czech Republic and by Center of Excellence -- Institute for Theoretical Computer Science"},{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Prague"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2014,5]]},"abstract":"<jats:p>\n            Given topological spaces\n            <jats:italic>X<\/jats:italic>\n            ,\n            <jats:italic>Y<\/jats:italic>\n            , a fundamental problem of algebraic topology is understanding the structure of all continuous maps\n            <jats:italic>X<\/jats:italic>\n            \u2192\n            <jats:italic>Y<\/jats:italic>\n            . We consider a computational version, where\n            <jats:italic>X<\/jats:italic>\n            ,\n            <jats:italic>Y<\/jats:italic>\n            are given as finite simplicial complexes, and the goal is to compute [\n            <jats:italic>X<\/jats:italic>\n            ,\n            <jats:italic>Y<\/jats:italic>\n            ], that is, all homotopy classes of such maps. We solve this problem in the\n            <jats:italic>stable range<\/jats:italic>\n            , where for some\n            <jats:italic>d<\/jats:italic>\n            \u2265 2, we have dim\n            <jats:italic>X<\/jats:italic>\n            \u2264 2\n            <jats:italic>d<\/jats:italic>\n            \u22122 and\n            <jats:italic>Y<\/jats:italic>\n            is (\n            <jats:italic>d<\/jats:italic>\n            -1)-\n            <jats:italic>connected<\/jats:italic>\n            ; in particular,\n            <jats:italic>Y<\/jats:italic>\n            can be the\n            <jats:italic>d<\/jats:italic>\n            -dimensional sphere\n            <jats:italic>S<\/jats:italic>\n            <jats:sup>\n              <jats:italic>d<\/jats:italic>\n            <\/jats:sup>\n            . The algorithm combines classical tools and ideas from homotopy theory (obstruction theory, Postnikov systems, and simplicial sets) with algorithmic tools from effective algebraic topology (locally effective simplicial sets and objects with effective homology). In contrast, [\n            <jats:italic>X<\/jats:italic>\n            ,\n            <jats:italic>Y<\/jats:italic>\n            ] is known to be uncomputable for general\n            <jats:italic>X<\/jats:italic>\n            ,\n            <jats:italic>Y<\/jats:italic>\n            , since for\n            <jats:italic>X<\/jats:italic>\n            =\n            <jats:italic>S<\/jats:italic>\n            <jats:sup>1<\/jats:sup>\n            it includes a well known undecidable problem: testing triviality of the fundamental group of\n            <jats:italic>Y<\/jats:italic>\n            .\n          <\/jats:p>\n          <jats:p>\n            In follow-up papers, the algorithm is shown to run in polynomial time for\n            <jats:italic>d<\/jats:italic>\n            fixed, and extended to other problems, such as the\n            <jats:italic>extension problem<\/jats:italic>\n            , where we are given a subspace\n            <jats:italic>A<\/jats:italic>\n            \u2282\n            <jats:italic>X<\/jats:italic>\n            and a map\n            <jats:italic>A<\/jats:italic>\n            \u2192\n            <jats:italic>Y<\/jats:italic>\n            and ask whether it extends to a map\n            <jats:italic>X<\/jats:italic>\n            \u2192\n            <jats:italic>Y<\/jats:italic>\n            , or computing the \u2124\n            <jats:sub>2<\/jats:sub>\n            -\n            <jats:italic>index<\/jats:italic>\n            \u2014everything in the stable range. Outside the stable range, the extension problem is undecidable.\n          <\/jats:p>","DOI":"10.1145\/2597629","type":"journal-article","created":{"date-parts":[[2014,5,27]],"date-time":"2014-05-27T12:56:59Z","timestamp":1401195419000},"page":"1-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Computing All Maps into a Sphere"],"prefix":"10.1145","volume":"61","author":[{"given":"Martin","family":"\u010cadek","sequence":"first","affiliation":[{"name":"Masaryk University, Czech Republic"}]},{"given":"Marek","family":"Kr\u010d\u00e1l","sequence":"additional","affiliation":[{"name":"Charles University and IST Austria, Klosterneuburg, Austria"}]},{"given":"Ji\u0159\u00ed","family":"Matou\u0161ek","sequence":"additional","affiliation":[{"name":"Charles University, Czech Republic and ETH Z\u00fcrich, Switzerland"}]},{"given":"Francis","family":"Sergeraert","sequence":"additional","affiliation":[{"name":"Institut Fourier, France"}]},{"given":"Luk\u00e1\u0161","family":"Vok\u0159\u00ednek","sequence":"additional","affiliation":[{"name":"Masaryk University, Czech Republic"}]},{"given":"Uli","family":"Wagner","sequence":"additional","affiliation":[{"name":"IST Austria, Austria"}]}],"member":"320","published-online":{"date-parts":[[2014,6,2]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the Conference on Computers in Geometry and Topology","volume":"114","author":"Anick D. J.","year":"1989","unstructured":"D. J. Anick . 1989 . The computation of rational homotopy groups is &num;&weierp;-hard . In Proceedings of the Conference on Computers in Geometry and Topology ( Chicago, IL). Lecture Notes in Pure Applied Mathematics , vol. 114 , Springer, 1--56. D. J. Anick. 1989. The computation of rational homotopy groups is &num;&weierp;-hard. In Proceedings of the Conference on Computers in Geometry and Topology (Chicago, IL). Lecture Notes in Pure Applied Mathematics, vol. 114, Springer, 1--56."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(54)50033-8"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(54)50061-2"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(55)50032-1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/1969664"},{"key":"e_1_2_1_6_1","unstructured":"M. \u010cadek M. Kr\u010d\u00e1l J. Matou\u0161ek L. Vok\u0159\u00ednek and U. Wagner. 2012. Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension. arXiv:1211.3093.  M. \u010cadek M. Kr\u010d\u00e1l J. Matou\u0161ek L. Vok\u0159\u00ednek and U. Wagner. 2012. Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension. arXiv:1211.3093."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-013-9551-8"},{"key":"e_1_2_1_8_1","unstructured":"M. \u010cadek M. Kr\u010d\u00e1l and L. Vok\u0159\u00ednek. 2013. Algorithmic solvability of the lifting-extension problem. arXiv:1307.6444.  M. \u010cadek M. Kr\u010d\u00e1l and L. Vok\u0159\u00ednek. 2013. Algorithmic solvability of the lifting-extension problem. arXiv:1307.6444."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-09-01249-X"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(71)90015-6"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner and J. Harer. 2008. Persistent homology\u2014a survey. In Surveys on Discrete and Computational Geometry. Contemp. Math. 453. American Mathematics Society Providence RI 257--282.  H. Edelsbrunner and J. Harer. 2008. Persistent homology\u2014a survey. In Surveys on Discrete and Computational Geometry. Contemp. Math. 453. American Mathematics Society Providence RI 257--282.","DOI":"10.1090\/conm\/453\/08802"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner and J. L. Harer. 2010. Computational Topology. American Mathematical Society Providence RI.  H. Edelsbrunner and J. L. Harer. 2010. Computational Topology. American Mathematical Society Providence RI.","DOI":"10.1090\/mbk\/069"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/1968828"},{"key":"e_1_2_1_14_1","unstructured":"M. Filakovsk\u00fd and L. Vok\u0159\u00ednek. 2013. Are two given maps homotopic&quest; An algorithmic viewpoint. arXiv:1312.2337.  M. Filakovsk\u00fd and L. Vok\u0159\u00ednek. 2013. Are two given maps homotopic&quest; An algorithmic viewpoint. arXiv:1312.2337."},{"volume-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Franek P.","key":"e_1_2_1_15_1","unstructured":"P. Franek and M. Kr\u010d\u00e1l . 2014. Robust satisfiability of systems of equations . In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). P. Franek and M. Kr\u010d\u00e1l. 2014. Robust satisfiability of systems of equations. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Nnotes in Computer Science","volume":"6907","author":"Franek P.","unstructured":"P. Franek , S. Ratschan , and P. Zgliczynski . 2011. Satisfiability of systems of equations of real analytic functions is quasi-decidable . In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Nnotes in Computer Science , vol. 6907 , Springer, Berlin, 315--326. P. Franek, S. Ratschan, and P. Zgliczynski. 2011. Satisfiability of systems of equations of real analytic functions is quasi-decidable. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Nnotes in Computer Science, vol. 6907, Springer, Berlin, 315--326."},{"key":"e_1_2_1_17_1","unstructured":"M. Freedman and V. Krushkal. 2013. Geometric complexity of embeddings in &reals;d. arXiv:1311.2667.  M. Freedman and V. Krushkal. 2013. Geometric complexity of embeddings in &reals; d . arXiv:1311.2667."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1216\/RMJ-2012-42-2-353"},{"key":"e_1_2_1_19_1","volume-title":"Polymake: A framework for analyzing convex polytopes. In Polytopes -- Combinatorics and Computation","author":"Gawrilow E.","year":"2000","unstructured":"E. Gawrilow and M. Joswig . 2000 . Polymake: A framework for analyzing convex polytopes. In Polytopes -- Combinatorics and Computation , G. Kalai and G. M. Ziegler (Eds.), Birkh\u00e4user , Basel , 43--74. E. Gawrilow and M. Joswig. 2000. Polymake: A framework for analyzing convex polytopes. In Polytopes -- Combinatorics and Computation, G. Kalai and G. M. Ziegler (Eds.), Birkh\u00e4user, Basel, 43--74."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"P. G. Goerss and J. F. Jardine. 1999. Simplicial Homotopy Theory. Birkh\u00e4user Basel.  P. G. Goerss and J. F. Jardine. 1999. Simplicial Homotopy Theory. Birkh\u00e4user Basel.","DOI":"10.1007\/978-3-0348-8707-6"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4310\/HHA.2003.v5.n2.a4"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2004.04.008"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02559591"},{"volume-title":"Cambridge University Press","author":"Hatcher A.","key":"e_1_2_1_24_1","unstructured":"A. Hatcher . 2001. Algebraic Topology . Cambridge University Press , Cambridge, UK . http:\/\/math.cornell.edu\/hatcher&num;AT1. A. Hatcher. 2001. Algebraic Topology. Cambridge University Press, Cambridge, UK. http:\/\/math.cornell.edu\/hatcher&num;AT1."},{"volume-title":"Homotopy Theory","author":"S. Hu.","key":"e_1_2_1_25_1","unstructured":"S. Hu. 1959. Homotopy Theory . Academic Press , New York . S. Hu. 1959. Homotopy Theory. Academic Press, New York."},{"key":"e_1_2_1_26_1","series-title":"Lecture Notes in Mathematics","volume-title":"Stable homotopy groups of spheres. A computer-assisted approach","author":"Kochman S. O.","unstructured":"S. O. Kochman . 1990. Stable homotopy groups of spheres. A computer-assisted approach . Lecture Notes in Mathematics , vol. 1423 . Springer-Verlag , Berlin . S. O. Kochman. 1990. Stable homotopy groups of spheres. A computer-assisted approach. Lecture Notes in Mathematics, vol. 1423. Springer-Verlag, Berlin."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9159-7"},{"volume-title":"Using the Borsuk-Ulam Theorem (revised 2nd printing)","author":"Matou\u0161ek J.","key":"e_1_2_1_29_1","unstructured":"J. Matou\u0161ek . 2007. Using the Borsuk-Ulam Theorem (revised 2nd printing) , Springer-Verlag , Berlin . J. Matou\u0161ek. 2007. Using the Borsuk-Ulam Theorem (revised 2nd printing), Springer-Verlag, Berlin."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS\/252"},{"key":"e_1_2_1_31_1","unstructured":"J. Matou\u0161ek. 2014. Computing higher homotopy groups is W{1}-hard. Fund. Inf. To appear.  J. Matou\u0161ek. 2014. Computing higher homotopy groups is W {1}-hard. Fund. Inf. To appear."},{"key":"e_1_2_1_32_1","volume-title":"Algorithmic Topology and Classification of 3-Manifolds","author":"Matveev S.","unstructured":"S. Matveev . 2007. Algorithmic Topology and Classification of 3-Manifolds ( 2 nd Ed.). Algorithms and Computat. Math., 9, Springer , Berlin. S. Matveev. 2007. Algorithmic Topology and Classification of 3-Manifolds (2nd Ed.). Algorithms and Computat. Math., 9, Springer, Berlin.","edition":"2"},{"volume-title":"Simplicial Objects in Algebraic Topology","author":"May J. P.","key":"e_1_2_1_33_1","unstructured":"J. P. May . 1967. Simplicial Objects in Algebraic Topology . Chicago University Press . J. P. May. 1967. Simplicial Objects in Algebraic Topology. Chicago University Press."},{"key":"e_1_2_1_34_1","unstructured":"R. E. Mosher and M. C. Tangora. 1968. Cohomology Operations and Applications in Homotopy Theory. Harper & Row Publishers New York.  R. E. Mosher and M. C. Tangora. 1968. Cohomology Operations and Applications in Homotopy Theory. Harper & Row Publishers New York."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02566428"},{"key":"e_1_2_1_36_1","volume-title":"Tel Aviv Topology Conference: Rothenberg Festschrift","author":"Nabutovsky A.","year":"1998","unstructured":"A. Nabutovsky and S. Weinberger . 1999. Algorithmic aspects of homeomorphism problems . In Tel Aviv Topology Conference: Rothenberg Festschrift ( 1998 ). Contemp. Math. 231, American Mathematical Society, Providence, RI, 245--250. A. Nabutovsky and S. Weinberger. 1999. Algorithmic aspects of homeomorphism problems. In Tel Aviv Topology Conference: Rothenberg Festschrift (1998). Contemp. Math. 231, American Mathematical Society, Providence, RI, 245--250."},{"key":"e_1_2_1_37_1","first-page":"1","article-title":"Ob algoritmi\u010desko\u012d nerazre\u0161imosti problemy to\u017edestva slov v teorii grupp (On the algorithmic unsolvability of the word problem in group theory)","volume":"44","author":"Novikov P. S.","year":"1955","unstructured":"P. S. Novikov . 1955 . Ob algoritmi\u010desko\u012d nerazre\u0161imosti problemy to\u017edestva slov v teorii grupp (On the algorithmic unsolvability of the word problem in group theory) . Trudy Mat. Inst. Im. Steklova 44 , 1 -- 143 . P. S. Novikov. 1955. Ob algoritmi\u010desko\u012d nerazre\u0161imosti problemy to\u017edestva slov v teorii grupp (On the algorithmic unsolvability of the word problem in group theory). Trudy Mat. Inst. Im. Steklova 44, 1--143.","journal-title":"Trudy Mat. Inst. Im. Steklova"},{"key":"e_1_2_1_38_1","volume-title":"Complex Cobordism and Stable Homotopy Groups of Spheres","author":"Ravenel D. C.","unstructured":"D. C. Ravenel . 2004. Complex Cobordism and Stable Homotopy Groups of Spheres ( 2 nd ed.). American Mathematical Society , Providence, RI . D. C. Ravenel. 2004. Complex Cobordism and Stable Homotopy Groups of Spheres (2nd ed.). American Mathematical Society, Providence, RI.","edition":"2"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4754(96)00021-3"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2006.06.002"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0007-4497(02)01119-3"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.4310\/HHA.2005.v7.n2.a8"},{"key":"e_1_2_1_43_1","unstructured":"J. Rubio and F. Sergeraert. 2012. Constructive homological algebra and applications. Preprint arXiv:1208. 3816. (2012). (Written in 2006 for a MAP Summer School at the University of Genova.)  J. Rubio and F. Sergeraert. 2012. Constructive homological algebra and applications. Preprint arXiv:1208. 3816. (2012). (Written in 2006 for a MAP Summer School at the University of Genova.)"},{"volume-title":"Effective algebraic topology. Mem. Am. Math. Soc. 451, 63","author":"Sch\u00f6n R.","key":"e_1_2_1_44_1","unstructured":"R. Sch\u00f6n . 1991. Effective algebraic topology. Mem. Am. Math. Soc. 451, 63 p. R. Sch\u00f6n. 1991. Effective algebraic topology. Mem. Am. Math. Soc. 451, 63 p."},{"volume-title":"Theory of Linear and Integer Programming","author":"Schrijver A.","key":"e_1_2_1_45_1","unstructured":"A. Schrijver . 1986. Theory of Linear and Integer Programming . Wiley , New York . A. Schrijver. 1986. Theory of Linear and Integer Programming. Wiley, New York."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1994.1018"},{"key":"e_1_2_1_47_1","unstructured":"F. Sergeraert. 2009. Effective exact couples. Univ. Grenoble. http:\/\/www-fourier.ujf-grenoble.fr\/&sim;sergerar\/Papers\/.  F. Sergeraert. 2009. Effective exact couples. Univ. Grenoble. http:\/\/www-fourier.ujf-grenoble.fr\/&sim;sergerar\/Papers\/."},{"volume-title":"Surveys in Contemporary Mathematics","author":"Skopenkov A. B.","key":"e_1_2_1_48_1","unstructured":"A. B. Skopenkov . 2008. Embedding and knotting of manifolds in Euclidean spaces . In Surveys in Contemporary Mathematics , London Mathematical Society, Lecture Note Series, vol. 347 , Cambridge University Press , Cambridge, UK, 248--342. A. B. Skopenkov. 2008. Embedding and knotting of manifolds in Euclidean spaces. In Surveys in Contemporary Mathematics, London Mathematical Society, Lecture Note Series, vol. 347, Cambridge University Press, Cambridge, UK, 248--342."},{"key":"e_1_2_1_49_1","unstructured":"J. R. Smith. 1998. m-Structures determine integral homotopy type. Preprint arXiv:math\/9809151v1.  J. R. Smith. 1998. m-Structures determine integral homotopy type. Preprint arXiv:math\/9809151v1."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1102083758"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.2307\/1969172"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(72)90004-7"},{"key":"e_1_2_1_53_1","volume-title":"Classical Topology and Combinatorial Group Theory","author":"Stillwell J.","unstructured":"J. Stillwell . 1993. Classical Topology and Combinatorial Group Theory ( 2 nd Ed.). Springer , New York . J. Stillwell. 1993. Classical Topology and Combinatorial Group Theory (2nd Ed.). Springer, New York.","edition":"2"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/236869.237084"},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","unstructured":"L. Vok\u0159\u00ednek. 2013. Constructing homotopy equivalences of chain complexes of free &integers;G-modules. arXiv:1304. 6771.  L. Vok\u0159\u00ednek. 2013. Constructing homotopy equivalences of chain complexes of free &integers; G -modules. arXiv:1304. 6771.","DOI":"10.1090\/conm\/617\/12311"},{"volume-title":"Elements of Homotopy Theory. Graduate Texts in Mathematics","author":"Whitehead G. W.","key":"e_1_2_1_56_1","unstructured":"G. W. Whitehead . 1978. Elements of Homotopy Theory. Graduate Texts in Mathematics , Vol. 61 , Springer-Verlag , New York . G. W. Whitehead. 1978. Elements of Homotopy Theory. Graduate Texts in Mathematics, Vol. 61, Springer-Verlag, New York."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/1050943"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2597629","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2597629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:09:58Z","timestamp":1750234198000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2597629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["10.1145\/2597629"],"URL":"https:\/\/doi.org\/10.1145\/2597629","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"type":"print","value":"0004-5411"},{"type":"electronic","value":"1557-735X"}],"subject":[],"published":{"date-parts":[[2014,5]]},"assertion":[{"value":"2011-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}