{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:53:24Z","timestamp":1772502804815,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T00:00:00Z","timestamp":1739318400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T00:00:00Z","timestamp":1739318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB\/TRR 109 - 281071066"],"award-info":[{"award-number":["SFB\/TRR 109 - 281071066"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB\/TRR 109 - 281071066"],"award-info":[{"award-number":["SFB\/TRR 109 - 281071066"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB\/TRR 109 - 281071066"],"award-info":[{"award-number":["SFB\/TRR 109 - 281071066"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 33765-N"],"award-info":[{"award-number":["P 33765-N"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005713","name":"Technische Universit\u00e4t M\u00fcnchen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005713","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Appl. and Comput. Topology"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We establish tight bi-Lipschitz bounds certifying quasi-universality (universality up to a constant factor) for various distances between Reeb graphs: the interleaving distance, the functional distortion distance, and the functional contortion distance. The definition of the latter distance is a novel contribution, and for the special case of contour trees we also prove strict universality of this distance. Furthermore, we prove that for the special case of merge trees the functional contortion distance coincides with the interleaving distance, yielding universality of all four distances in this case.\n<\/jats:p>","DOI":"10.1007\/s41468-025-00203-1","type":"journal-article","created":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T14:22:52Z","timestamp":1739370172000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Tight quasi-universality of Reeb graph distances"],"prefix":"10.1007","volume":"9","author":[{"given":"Ulrich","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e5vard Bakke","family":"Bjerkevik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benedikt","family":"Fluhr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,12]]},"reference":[{"issue":"3","key":"203_CR1","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s41468-024-00184-7","volume":"8","author":"U Bauer","year":"2024","unstructured":"Bauer, U., Botnan, M.B., Fluhr, B.: Universal distances for extended persistence. J. Appl. Comput. Topol. 8(3), 475\u2013530 (2024). https:\/\/doi.org\/10.1007\/s41468-024-00184-7","journal-title":"J. Appl. Comput. Topol."},{"key":"203_CR2","doi-asserted-by":"crossref","unstructured":"Bauer, U., Ge, X., Wang, Y.: Measuring distance between Reeb graphs. In: Symposium on Computational Geometry (SoCG\u201914), ACM, New York, (2014)","DOI":"10.1145\/2582112.2582169"},{"key":"203_CR3","unstructured":"Bauer, U., Ge, X., Wang, Y.: Measuring distance between Reeb graphs. Extended version of conference paper, (2016). arXiv:1307.2839v2"},{"issue":"5","key":"203_CR4","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1007\/s10208-020-09488-3","volume":"21","author":"U Bauer","year":"2021","unstructured":"Bauer, U., Landi, C., M\u00e9moli, F.: The Reeb graph edit distance is universal. Found. Comput. Math. 21(5), 1441\u20131464 (2021). https:\/\/doi.org\/10.1007\/s10208-020-09488-3","journal-title":"Found. Comput. Math."},{"key":"203_CR5","unstructured":"Bauer, U., Munch, E., Wang, Y.: Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs. In 31st International Symposium on Computational Geometry (SoCG 2015), volume\u00a034 of LIPIcs. Leibniz Int. Proc. Inform., pages 461\u2013475. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2015"},{"key":"203_CR6","unstructured":"Bjerkevik, H\u00e5Vard, B., Lesnick, M.: $$\\ell ^p$$-Distances on Multiparameter Persistence Modules. June (2021). arXiv:2106.13589"},{"key":"203_CR7","doi-asserted-by":"publisher","unstructured":"Cardona, R., Curry, J., Lam, T., Lesnick, M.: The Universal $$\\ell ^p$$-Metric on Merge Trees. In: 38th International Symposium on Computational Geometry (SoCG: volume 224 of LIPIcs, pages 24:1\u201324:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik 2022,(2022). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2022.24","DOI":"10.4230\/LIPIcs.SoCG.2022.24"},{"key":"203_CR8","doi-asserted-by":"publisher","unstructured":"Chambers, E. W., Munch, E., Ophelders, T.: A Family of Metrics from the Truncated Smoothing of Reeb Graphs. In: 37th International Symposium on Computational Geometry (SoCG: volume 189 of LIPIcs, pages 22:1\u201322:17, Dagstuhl, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2021.22","DOI":"10.4230\/LIPIcs.SoCG.2021.22"},{"issue":"1","key":"203_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00454-006-1276-5","volume":"37","author":"D Cohen-Steiner","year":"2007","unstructured":"Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Discrete Comput. Geom. 37(1), 103\u2013120 (2007). https:\/\/doi.org\/10.1007\/s00454-006-1276-5","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"203_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10208-008-9027-z","volume":"9","author":"D Cohen-Steiner","year":"2009","unstructured":"Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Extending persistence using Poincar\u00e9 and Lefschetz duality. Found. Comput. Math. 9(1), 79\u2013103 (2009). https:\/\/doi.org\/10.1007\/s10208-008-9027-z","journal-title":"Found. Comput. Math."},{"issue":"2","key":"203_CR11","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10440-008-9332-1","volume":"109","author":"M d\u2019Amico","year":"2010","unstructured":"d\u2019Amico, M., Frosini, P., Landi, C.: Natural pseudo-distance and optimal matching between reduced size functions. Acta Appl. Math. 109(2), 527\u2013554 (2010). https:\/\/doi.org\/10.1007\/s10440-008-9332-1","journal-title":"Acta Appl. Math."},{"issue":"4","key":"203_CR12","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1007\/s00454-016-9763-9","volume":"55","author":"V de Silva","year":"2016","unstructured":"de Silva, V., Munch, E., Patel, A.: Categorified Reeb graphs. Discrete Comput. Geom. 55(4), 854\u2013906 (2016). https:\/\/doi.org\/10.1007\/s00454-016-9763-9","journal-title":"Discrete Comput. Geom."},{"key":"203_CR13","doi-asserted-by":"publisher","unstructured":"Hilaga, M., Shinagawa, Y., Komura, T., Kunii, T.: Topology matching for fully automatic similarity estimation of 3d shapes. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2001, pages 203\u2013212. ACM, (2001). https:\/\/doi.org\/10.1145\/383259.383282","DOI":"10.1145\/383259.383282"},{"issue":"3","key":"203_CR14","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10208-015-9255-y","volume":"15","author":"M Lesnick","year":"2015","unstructured":"Lesnick, M.: The theory of the interleaving distance on multidimensional persistence modules. Found. Comput. Math. 15(3), 613\u2013650 (2015). https:\/\/doi.org\/10.1007\/s10208-015-9255-y","journal-title":"Found. Comput. Math."},{"key":"203_CR15","doi-asserted-by":"crossref","unstructured":"Morozov, D., Beketayev, K., Weber, G.: Interleaving distance between merge trees. Presented at TopoInVis\u201913. Manuscript, (2013). URL: https:\/\/www.mrzv.org\/publications\/interleaving-distance-merge-trees\/","DOI":"10.1007\/978-3-319-04099-8_10"},{"key":"203_CR16","first-page":"847","volume":"222","author":"G Reeb","year":"1946","unstructured":"Reeb, G.: Sur les points singuliers d\u2019une forme de Pfaff compl\u00e8tement int\u00e9grable ou d\u2019une fonction num\u00e9rique. C. R. Acad. Sci. Paris 222, 847\u2013849 (1946)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"203_CR17","unstructured":"Scoccola, L.: Locally persistent categories and metric properties of interleaving distances. PhD thesis, The University of Western Ontario, (2020). URL: https:\/\/ir.lib.uwo.ca\/etd\/7119"},{"issue":"6","key":"203_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/38.103393","volume":"11","author":"Y Shinagawa","year":"1991","unstructured":"Shinagawa, Y., Kunii, T.L.: Constructing a Reeb graph automatically from cross sections. IEEE Comput. Graphics Appl. 11(6), 44\u201351 (1991). https:\/\/doi.org\/10.1109\/38.103393","journal-title":"IEEE Comput. Graphics Appl."},{"key":"203_CR19","doi-asserted-by":"publisher","unstructured":"Singh, G., M\u00e9moli, F., Carlsson, G.: Topological methods for the analysis of high dimensional data sets and 3D object recognition. In: 4th Symposium on Point Based Graphics (PBG). Eurographics Association, (2007). https:\/\/doi.org\/10.2312\/SPBG\/SPBG07\/091-100","DOI":"10.2312\/SPBG\/SPBG07\/091-100"}],"container-title":["Journal of Applied and Computational Topology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-025-00203-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41468-025-00203-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-025-00203-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T07:30:30Z","timestamp":1743751830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41468-025-00203-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["203"],"URL":"https:\/\/doi.org\/10.1007\/s41468-025-00203-1","relation":{},"ISSN":["2367-1726","2367-1734"],"issn-type":[{"value":"2367-1726","type":"print"},{"value":"2367-1734","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,12]]},"assertion":[{"value":"18 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"7"}}