{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T10:41:53Z","timestamp":1758192113096,"version":"3.44.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T00:00:00Z","timestamp":1757116800000},"content-version":"vor","delay-in-days":5,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/R018472\/1"],"award-info":[{"award-number":["EP\/R018472\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100022752","name":"Mathematical Institute, University of Oxford","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100022752","id-type":"DOI","asserted-by":"publisher"}]},{"name":"St John's College"},{"DOI":"10.13039\/501100000608","name":"London Mathematical Society","doi-asserted-by":"publisher","award":["ECF-2022-10"],"award-info":[{"award-number":["ECF-2022-10"]}],"id":[{"id":"10.13039\/501100000608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Appl. and Comput. Topology"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Consider the space of continuous functions on a geometric tree\u00a0<jats:italic>X<\/jats:italic> whose persistent homology gives rise to a finite generic barcode\u00a0<jats:italic>D<\/jats:italic>. We show that there are exactly as many path connected components in this space as there are merge trees whose barcode is\u00a0<jats:italic>D<\/jats:italic>. We find that each component is homotopy equivalent to a configuration space on\u00a0<jats:italic>X<\/jats:italic> with specialised constraints encoded by the merge tree. For barcodes\u00a0<jats:italic>D<\/jats:italic> with either one or two intervals, our method also allows us to compute the homotopy type of this space of functions.<\/jats:p>","DOI":"10.1007\/s41468-025-00213-z","type":"journal-article","created":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T09:53:37Z","timestamp":1757152417000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The fiber of persistent homology for trees"],"prefix":"10.1007","volume":"9","author":[{"given":"David","family":"Beers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Leygonie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,6]]},"reference":[{"issue":"1","key":"213_CR1","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1214\/15-AOAS886","volume":"10","author":"P Bendich","year":"2016","unstructured":"Bendich, P., Marron, J.S., Miller, E., et al.: Persistent homology analysis of brain artery trees. The annals of applied statistics 10(1), 198 (2016)","journal-title":"The annals of applied statistics"},{"issue":"3","key":"213_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s41468-020-00055-x","volume":"4","author":"MJ Catanzaro","year":"2020","unstructured":"Catanzaro, M.J., Curry, J.M., Fasy, B.T., et al.: Moduli spaces of morse functions for persistence. Journal of Applied and Computational Topology 4(3), 353\u2013385 (2020)","journal-title":"Journal of Applied and Computational Topology"},{"unstructured":"Chen, C., Ni, X., Bai, Q., et\u00a0al.: A topological regularizer for classifiers via persistent homology. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp 2573\u20132582 (2019)","key":"213_CR3"},{"issue":"1","key":"213_CR4","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 & Computational Geometry 37(1), 103\u2013120 (2007)","journal-title":"Discrete & Computational Geometry"},{"issue":"05","key":"213_CR5","doi-asserted-by":"publisher","first-page":"1550066","DOI":"10.1142\/S0219498815500668","volume":"14","author":"W Crawley-Boevey","year":"2015","unstructured":"Crawley-Boevey, W.: Decomposition of pointwise finite-dimensional persistence modules. Journal of Algebra and its Applications 14(05), 1550066 (2015)","journal-title":"Journal of Algebra and its Applications"},{"issue":"3","key":"213_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s41468-019-00024-z","volume":"2","author":"J Curry","year":"2018","unstructured":"Curry, J.: The fiber of the persistence map for functions on the interval. Journal of Applied and Computational Topology 2(3), 301\u2013321 (2018)","journal-title":"Journal of Applied and Computational Topology"},{"unstructured":"Curry, J., DeSha, J., Garin, A., et\u00a0al.: From trees to barcodes and back again ii: Combinatorial and probabilistic aspects of a topological inverse problem. arXiv preprint arXiv:2107.11212 (2021)","key":"213_CR7"},{"issue":"4","key":"213_CR8","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s41468-020-00059-7","volume":"4","author":"J Cyranka","year":"2020","unstructured":"Cyranka, J., Mischaikow, K., Weibel, C.: Contractibility of a persistence map preimage. Journal of Applied and Computational Topology 4(4), 509\u2013523 (2020)","journal-title":"Journal of Applied and Computational Topology"},{"doi-asserted-by":"crossref","unstructured":"Farber, M.: Configuration spaces and robot motion planning algorithms. In: Combinatorial And Toric Homotopy: Introductory Lectures, pp. 263\u2013303. World Scientific, Singapore (2018)","key":"213_CR9","DOI":"10.1142\/9789813226579_0005"},{"unstructured":"Gasparovic, E., Munch, E., Oudot, S., et\u00a0al.: Intrinsic interleaving distance for merge trees. arXiv preprint arXiv:1908.00063 (2022)","key":"213_CR10"},{"issue":"26","key":"213_CR11","doi-asserted-by":"publisher","first-page":"7035","DOI":"10.1073\/pnas.1520877113","volume":"113","author":"Y Hiraoka","year":"2016","unstructured":"Hiraoka, Y., Nakamura, T., Hirata, A., et al.: Hierarchical structures of amorphous solids characterized by persistent homology. Proc. Natl. Acad. Sci. 113(26), 7035\u20137040 (2016)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"213_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40687-022-00347-x","volume":"9","author":"B Johnson","year":"2022","unstructured":"Johnson, B., Scoville, N.A.: Merge trees in discrete morse theory. Research in the Mathematical Sciences 9, 1\u201317 (2022)","journal-title":"Research in the Mathematical Sciences"},{"issue":"1","key":"213_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12021-017-9341-1","volume":"16","author":"L Kanari","year":"2018","unstructured":"Kanari, L., D\u0142otko, P., Scolamiero, M., et al.: A topological representation of branching neuronal morphologies. Neuroinformatics 16(1), 3\u201313 (2018)","journal-title":"Neuroinformatics"},{"issue":"4","key":"213_CR14","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1093\/cercor\/bhy339","volume":"29","author":"L Kanari","year":"2019","unstructured":"Kanari, L., Ramaswamy, S., Shi, Y., et al.: Objective morphological classification of neocortical pyramidal cells. Cereb. Cortex 29(4), 1719\u20131735 (2019)","journal-title":"Cereb. Cortex"},{"issue":"12","key":"213_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.3390\/a13120335","volume":"13","author":"L Kanari","year":"2020","unstructured":"Kanari, L., Garin, A., Hess, K.: From trees to barcodes and back again: theoretical and statistical perspectives. Algorithms 13(12), 335 (2020)","journal-title":"Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Leygonie, J., Beers, D.: Fiber of persistent homology on morse functions. Journal of Applied and Computational Topology 1\u201314 (2022)","key":"213_CR16","DOI":"10.1007\/s41468-022-00100-x"},{"unstructured":"Leygonie, J., Henselman-Petrusek, G.: Algorithmic reconstruction of the fiber of persistent homology on cell complexes. arXiv preprint arXiv:2110.14676 (2021)","key":"213_CR17"},{"issue":"12","key":"213_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2022.107099","volume":"226","author":"J Leygonie","year":"2022","unstructured":"Leygonie, J., Tillmann, U.: The fiber of persistent homology for simplicial complexes. j. of Pure and Appl. n.a. 226(12), 107099 (2022)","journal-title":"j. of Pure and Appl. n.a."},{"doi-asserted-by":"crossref","unstructured":"Li, C., Ovsjanikov, M., Chazal, F.: Persistence-based structural recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 1995\u20132002 (2014)","key":"213_CR19","DOI":"10.1109\/CVPR.2014.257"},{"doi-asserted-by":"crossref","unstructured":"Liu, Y., Scoville, N.A.: The realization problem for discrete morse functions on trees. In: Algebra Colloquium, World Scientific, pp 455\u2013468 (2020)","key":"213_CR20","DOI":"10.1142\/S1005386720000371"},{"doi-asserted-by":"crossref","unstructured":"Mischaikow, K., Weibel, C.: Persistent homology with non-contractible preimages. arXiv preprint arXiv:2105.08130 (2021)","key":"213_CR21","DOI":"10.4310\/HHA.2022.v24.n2.a16"},{"issue":"22\u201345","key":"213_CR22","first-page":"52","volume":"49","author":"D Morozov","year":"2013","unstructured":"Morozov, D., Beketayev, K., Weber, G.: Interleaving distance between merge trees. Discret. Comput. Geom. 49(22\u201345), 52 (2013)","journal-title":"Discret. Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Munch, E., Stefanou, A.: The $$\\ell ^\\infty $$-cophenetic metric for phylogenetic trees as an interleaving distance. In: Research in Data Science. Springer, p 109\u2013127 (2019)","key":"213_CR23","DOI":"10.1007\/978-3-030-11566-1_5"},{"unstructured":"Smith, P., Kurlin, V.: Families of point sets with identical 1d persistence. arXiv preprint arXiv:2202.00577 (2022)","key":"213_CR24"},{"unstructured":"Touli, E.F., Wang, Y.: Fpt-algorithms for computing gromov-hausdorff and interleaving distances between trees. arXiv preprint arXiv:1811.02425 (2018)","key":"213_CR25"}],"container-title":["Journal of Applied and Computational Topology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-025-00213-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41468-025-00213-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-025-00213-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T11:17:13Z","timestamp":1758107833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41468-025-00213-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["213"],"URL":"https:\/\/doi.org\/10.1007\/s41468-025-00213-z","relation":{},"ISSN":["2367-1726","2367-1734"],"issn-type":[{"type":"print","value":"2367-1726"},{"type":"electronic","value":"2367-1734"}],"subject":[],"published":{"date-parts":[[2025,9]]},"assertion":[{"value":"5 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 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 have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"22"}}