{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:13:23Z","timestamp":1778498003452,"version":"3.51.4"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T00:00:00Z","timestamp":1695772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T00:00:00Z","timestamp":1695772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001655","name":"Deutscher Akademischer Austauschdienst","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Netherlands Organisation for Scientific Research","doi-asserted-by":"crossref","award":["016.Veni.192.250"],"award-info":[{"award-number":["016.Veni.192.250"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for the complexity class <jats:inline-formula><jats:alternatives><jats:tex-math>$${ \\forall \\exists _{&lt;}\\mathbb {R}} $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>\u2200<\/mml:mo>\n                    <mml:msub>\n                      <mml:mo>\u2203<\/mml:mo>\n                      <mml:mo>&lt;<\/mml:mo>\n                    <\/mml:msub>\n                    <mml:mi>R<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. This implies that the problem is -, -, <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\exists \\mathbb {R} $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>\u2203<\/mml:mo>\n                    <mml:mi>R<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-, and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\forall \\mathbb {R} $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>\u2200<\/mml:mo>\n                    <mml:mi>R<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-hard.<\/jats:p>","DOI":"10.1007\/s00454-023-00562-5","type":"journal-article","created":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T15:02:10Z","timestamp":1695826930000},"page":"177-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The Complexity of the Hausdorff Distance"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8241-2102","authenticated-orcid":false,"given":"Paul","family":"Jungeblut","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3786-916X","authenticated-orcid":false,"given":"Linda","family":"Kleist","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Tillmann","family":"Miltzow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,27]]},"reference":[{"key":"562_CR1","unstructured":"Abel, Z., Demaine, E.D., Demaine, M.L., Eisenstat, S., Lynch, J., Schardl, T.B.: Who needs crossings? Hardness of plane graph rigidity. In: 32nd International Symposium on Computational Geometry (Boston 2016). Leibniz International Proceedings in Informatics, vol. 51, #\u00a03. Leibniz-Zent. Inform., Wadern (2016)"},{"key":"562_CR2","doi-asserted-by":"crossref","unstructured":"Abrahamsen, M.: Covering polygons is even harder. In: 62nd Annual Symposium on Foundations of Computer Science (2021), pp. 375\u2013386. IEEE, Los Alamitos (2022)","DOI":"10.1109\/FOCS52979.2021.00045"},{"issue":"1","key":"562_CR3","doi-asserted-by":"publisher","first-page":"#\u00a04","DOI":"10.1145\/3486220","volume":"69","author":"M Abrahamsen","year":"2022","unstructured":"Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\\exists {\\mathbb{R}}$$-complete. J. ACM 69(1), #\u00a04 (2022)","journal-title":"J. ACM"},{"key":"562_CR4","unstructured":"Abrahamsen, M., Kleist, L., Miltzow, T.: Training neural networks is ER-complete. In: Advances in Neural Information Processing Systems (NeurIPS), vol.\u00a034, pp. 18293\u201318306. Curran Associates, Red Hook (2021)"},{"key":"562_CR5","unstructured":"Abrahamsen, M., Kleist, L., Miltzow, T.: Geometric embeddability of complexes is $$\\exists \\mathbb{R}$$-complete. In: 39th International Symposium on Computational Geometry (Dallas 2023). Leibniz International Proceedings in Informatics, vol. 258, #\u00a01. Leibniz-Zent. Inform., Wadern (2023)"},{"key":"562_CR6","doi-asserted-by":"crossref","unstructured":"Abrahamsen, M., Miltzow, T., Seiferth, N.: Framework for ER-completeness of two-dimensional packing problems. In: 61st Annual Symposium on Foundations of Computer Science (Durham 2020), pp. 1014\u20131021. IEEE, Los Alamitos (2020)","DOI":"10.1109\/FOCS46700.2020.00098"},{"issue":"3","key":"562_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01530830","volume":"13","author":"H Alt","year":"1995","unstructured":"Alt, H., Behrends, B., Bl\u00f6mer, J.: Approximate matching of polygonal shapes. Ann. Math. Artif. Intell. 13(3), 251\u2013265 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"key":"562_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-55566-4_4","volume-title":"Discrete and Computational Geometry: The Goodman\u2013Pollack Festschrift. Algorithms and Combinatorics","author":"H Alt","year":"2003","unstructured":"Alt, H., Bra\u00df, P., Godau, M., Knauer, C., Wenk, C.: Computing the Hausdorff distance of geometric patterns and shapes. In: Discrete and Computational Geometry: The Goodman\u2013Pollack Festschrift. Algorithms and Combinatorics, vol. 25, pp. 65\u201376. Springer, Berlin (2003)"},{"key":"562_CR9","doi-asserted-by":"crossref","unstructured":"Alt, H., Guibas, L.J.: Discrete geometric shapes: matching, interpolation, and approximation. In: Handbook of Computational Geometry, pp. 121\u2013153. Elsevier, Amsterdam (2000)","DOI":"10.1016\/B978-044482537-7\/50004-8"},{"issue":"4","key":"562_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(83)90042-X","volume":"17","author":"MJ Atallah","year":"1983","unstructured":"Atallah, M.J.: A linear time algorithm for the Hausdorff distance between convex polygons. Inform. Process. Lett. 17(4), 207\u2013209 (1983)","journal-title":"Inform. Process. Lett."},{"key":"562_CR11","doi-asserted-by":"crossref","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics, vol.\u00a010. Springer, Berlin (2006)","DOI":"10.1007\/3-540-33099-2"},{"issue":"12","key":"562_CR12","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1016\/j.jsc.2010.06.009","volume":"45","author":"S Basu","year":"2010","unstructured":"Basu, S., Roy, M.-F.: Bounding the radii of balls meeting every connected component of semi-algebraic sets. J. Symb. Comput. 45(12), 1270\u20131279 (2010)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"562_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00454-006-1285-4","volume":"37","author":"M Belk","year":"2007","unstructured":"Belk, M.: Realizability of graphs in three dimensions. Discrete Comput. Geom. 37(2), 139\u2013162 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"562_CR14","unstructured":"Bertschinger, D., Hertrich, C., Jungeblut, P., Miltzow, T., Weber, S.: Training fully connected neural networks is $$\\exists \\mathbb{R}$$-complete (2022). arXiv:2204.01368"},{"key":"562_CR15","unstructured":"Bil\u00f2, V., Mavronicolas, M.: A catalog of $$\\exists \\mathbb{R}$$-complete decision problems about Nash equilibria in multi-player games. In: 33rd Symposium on Theoretical Aspects of Computer Science (Orl\u00e9ans 2016). Leibniz International Proceedings in Informatics, vol. 47, #\u00a017. Leibniz-Zent. Inform., Wadern (2016)"},{"key":"562_CR16","doi-asserted-by":"crossref","unstructured":"Blanc, M., Hansen, K.A.: Computational complexity of multi-player evolutionarily stable strategies. In: Computer Science\u2014Theory and Applications (Sochi 2021). Lecture Notes in Computer Science, vol. 12730, pp. 1\u201317. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-79416-3_1"},{"key":"562_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Am. Math. Soc. 21, 1\u201346 (1989)","journal-title":"Bull. Am. Math. Soc."},{"key":"562_CR18","volume-title":"Topology and Geometry. Graduate Texts in Mathematics","author":"GE Bredon","year":"1993","unstructured":"Bredon, G.E.: Topology and Geometry. Graduate Texts in Mathematics, vol. 139. Springer, New York (1993)"},{"key":"562_CR19","unstructured":"Bringmann, K., Nusser, A.: Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation. In: 37th International Symposium on Computational Geometry (2021). Leibniz International Proceedings in Informatics, vol. 189, #\u00a018. Leibniz-Zent. Inform., Wadern (2021)"},{"issue":"2","key":"562_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10208-007-9006-9","volume":"9","author":"P B\u00fcrgisser","year":"2009","unstructured":"B\u00fcrgisser, P., Cucker, F.: Exotic quantifiers, complexity classes, and complete problems. Found. Comput. Math. 9(2), 135\u2013170 (2009)","journal-title":"Found. Comput. Math."},{"key":"562_CR21","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In: 20th Annual ACM Symposium on Theory of Computing (Chicago 1988), pp. 460\u2013467. ACM, New York (1988)","DOI":"10.1145\/62212.62257"},{"issue":"4","key":"562_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/2852040.2852053","volume":"46","author":"J Cardinal","year":"2015","unstructured":"Cardinal, J.: Computational geometry column 62. ACM SIGACT News 46(4), 69\u201378 (2015)","journal-title":"ACM SIGACT News"},{"issue":"1","key":"562_CR23","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/s00454-016-9831-1","volume":"57","author":"J Cardinal","year":"2017","unstructured":"Cardinal, J., Hoffmann, U.: Recognition and complexity of point visibility graphs. Discrete Comput. Geom. 57(1), 164\u2013178 (2017)","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20132","key":"562_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","volume":"5","author":"JH Davenport","year":"1988","unstructured":"Davenport, J.H., Heintz, J.: Real quantifier elimination is doubly exponential. J. Symb. Comput. 5(1\u20132), 29\u201335 (1988)","journal-title":"J. Symb. Comput."},{"key":"562_CR25","unstructured":"D\u2019Costa, J., Lefaucheux, E., Neumann, E., Ouaknine, J., Worrel, J.: On the complexity of the escape problem for linear dynamical systems over compact semialgebraic sets. In: 46th International Symposium on Mathematical Foundations of Computer Science (Tallinn 2021). Leibniz International Proceedings in Informatics, vol. 202, #\u00a033. Leibniz-Zent. Inform., Wadern (2021)"},{"key":"562_CR26","unstructured":"Dobbins, M.G., Holmsen, A., Miltzow, T.: A universality theorem for nested polytopes (2019). arXiv:1908.02213"},{"key":"562_CR27","doi-asserted-by":"crossref","unstructured":"Dobbins, M.G., Kleist, L., Miltzow, T., Rz\u0105\u017cewski, P.: $$\\forall \\exists \\mathbb{R}$$-completeness and area-universality. In: Graph-Theoretic Concepts in Computer Science (Cottbus 2018). Lecture Notes in Computer Science, vol. 11159, pp. 164\u2013175. Springer, Cham (2018)","DOI":"10.1007\/978-3-030-00256-5_14"},{"issue":"1","key":"562_CR28","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/s00454-022-00381-0","volume":"70","author":"MG Dobbins","year":"2023","unstructured":"Dobbins, M.G., Kleist, L., Miltzow, T., Rz\u0105\u017cewski, P.: Completeness for the complexity class $$\\forall \\exists \\mathbb{R} $$ and area-universality. Discrete Comput. Geom. 70(1), 154\u2013188 (2023)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"562_CR29","doi-asserted-by":"publisher","first-page":"#\u00a01","DOI":"10.1145\/3175494","volume":"6","author":"J Garg","year":"2018","unstructured":"Garg, J., Mehta, R., Vazirani, V.V., Yazdanbod, S.: $$\\exists \\mathbb{R} $$-completeness for decision versions of multi-player (symmetric) Nash equilibria. ACM Trans. Econ. Comput. 6(1), #\u00a01 (2018)","journal-title":"ACM Trans. Econ. Comput."},{"key":"562_CR30","doi-asserted-by":"crossref","unstructured":"Grigor\u2019ev, D.Yu., Vorobjov, N.N., Jr.: Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput. 5(1\u20132), 37\u201364 (1988)","DOI":"10.1016\/S0747-7171(88)80005-1"},{"key":"562_CR31","volume-title":"Grundz\u00fcge der Mengenlehre","author":"F Hausdorff","year":"1914","unstructured":"Hausdorff, F.: Grundz\u00fcge der Mengenlehre. Von Veit & Company, Leipzig (1914)"},{"issue":"4","key":"562_CR32","doi-asserted-by":"publisher","first-page":"421","DOI":"10.7155\/jgaa.00602","volume":"26","author":"A Lubiw","year":"2022","unstructured":"Lubiw, A., Miltzow, T., Mondal, D.: The complexity of drawing a graph in a polygonal region. J. Gr. Algorithms Appl. 26(4), 421\u2013446 (2022)","journal-title":"J. Gr. Algorithms Appl."},{"key":"562_CR33","unstructured":"Matou\u0161ek, J.: Intersection graphs of segments and $$\\exists \\mathbb{R}$$ (2014). arXiv:1406.2636"},{"issue":"1","key":"562_CR34","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2012.09.004","volume":"103","author":"C McDiarmid","year":"2013","unstructured":"McDiarmid, C., M\u00fcller, T.: Integer realizations of disk and segment graphs. J. Comb. Theory Ser. B 103(1), 114\u2013143 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"key":"562_CR35","doi-asserted-by":"crossref","unstructured":"Miltzow, T., Schmiermann, R.F.: On classifying continuous constraint satisfaction problems. In: 62nd Annual Symposium on Foundations of Computer Science (2021), pp. 781\u2013791. IEEE, Los Alamitos (2022)","DOI":"10.1109\/FOCS52979.2021.00081"},{"issue":"4","key":"562_CR36","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1080\/13658810601073315","volume":"21","author":"D Min","year":"2007","unstructured":"Min, D., Zhilin, L., Xiaoyong, C.: Extended Hausdorff distance for spatial objects in GIS. Int. J. Geogr. Inform. Sci. 21(4), 459\u2013475 (2007)","journal-title":"Int. J. Geogr. Inform. Sci."},{"key":"562_CR37","doi-asserted-by":"crossref","unstructured":"Mn\u00ebv, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Topology and Geometry\u2014Rohlin Seminar. Lecture Notes in Mathematics, vol. 1346, pp. 527\u2013543. Springer, Berlin (1988)","DOI":"10.1007\/BFb0082792"},{"key":"562_CR38","unstructured":"Ophelders, T., Rutter, I., Speckmann, B., Verbeek, K.: Polygon-universal graphs. In: 37th International Symposium on Computational Geometry (2021). Leibniz International Proceedings in Informatics, vol. 189, #\u00a055. Leibniz-Zent. Inform., Wadern (2021)"},{"issue":"3","key":"562_CR39","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. I. Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. J. Symb. Comput. 13(3), 255\u2013299 (1992)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"562_CR40","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0747-7171(10)80004-5","volume":"13","author":"J Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. II. The general decision problem. Preliminaries for quantifier elimination. J. Symb. Comput. 13(3), 301\u2013327 (1992)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"562_CR41","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0747-7171(10)80005-7","volume":"13","author":"J Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. III. Quantifier elimination. J. Symb. Comput. 13(3), 329\u2013352 (1992)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"562_CR42","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1090\/S0273-0979-1995-00604-X","volume":"32","author":"J Richter-Gebert","year":"1995","unstructured":"Richter-Gebert, J., Ziegler, G.M.: Realization spaces of $$4$$-polytopes are universal. Bull. Am. Math. Soc. 32(4), 403\u2013412 (1995)","journal-title":"Bull. Am. Math. Soc."},{"key":"562_CR43","doi-asserted-by":"crossref","unstructured":"Rucklidge, W.: Efficient Visual Recognition Using the Hausdorff Distance. Lecture Notes in Computer Science, vol. 1173. Springer, Berlin (1996)","DOI":"10.1007\/BFb0015091"},{"key":"562_CR44","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Graph Drawing (Chicago 2009). Lecture Notes in Computer Science, vol. 5849, pp. 334\u2013344. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-11805-0_32"},{"key":"562_CR45","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: Realizability of graphs and linkages. In: Thirty Essays on Geometric Graph Theory, pp. 461\u2013482. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-0110-0_24"},{"issue":"2","key":"562_CR46","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00224-015-9662-0","volume":"60","author":"M Schaefer","year":"2017","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Fixed points, Nash equilibria, and the existential theory of the reals. Theory Comput. Syst. 60(2), 172\u2013193 (2017)","journal-title":"Theory Comput. Syst."},{"key":"562_CR47","doi-asserted-by":"crossref","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Beyond the existential theory of the reals (2022). arXiv:2210.00571","DOI":"10.1007\/s00224-023-10151-x"},{"key":"562_CR48","unstructured":"Shitov, Y.: A universality theorem for nonnegative matrix factorizations (2016). arXiv:1606.09068"},{"key":"562_CR49","first-page":"531","volume-title":"Applied Geometry and Discrete Mathematics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"PW Shor","year":"1991","unstructured":"Shor, P.W.: Stretchability of pseudolines is NP-hard. In: Applied Geometry and Discrete Mathematics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, pp. 531\u2013554. American Mathematical Society, Providence (1991)"},{"issue":"3","key":"562_CR50","doi-asserted-by":"publisher","first-page":"#\u00a029","DOI":"10.1145\/3510002","volume":"41","author":"F Verhoeven","year":"2022","unstructured":"Verhoeven, F., Vaxman, A., Hoffmann, T., Sorkine-Hornung, O.: Dev2PQ: Planar quadrilateral strip remeshing of developable surfaces. ACM Trans. Gr. 41(3), #\u00a029 (2022)","journal-title":"ACM Trans. Gr."},{"issue":"4","key":"562_CR51","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1007\/BF01095637","volume":"34","author":"NN Vorob\u2019ev","year":"1986","unstructured":"Vorob\u2019ev, N.N.: Estimates of real roots of a system of algebraic equations. J. Soviet Math. 34(4), 1754\u20131762 (1986)","journal-title":"J. Soviet Math."},{"key":"562_CR52","unstructured":"Wiki Community: Homotopy. https:\/\/en.wikipedia.org\/wiki\/Homotopy (November 2021)"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00562-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00562-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00562-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T20:01:57Z","timestamp":1704571317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00562-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,27]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["562"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00562-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,27]]},"assertion":[{"value":"24 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}