{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:54:03Z","timestamp":1765371243818,"version":"3.46.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T00:00:00Z","timestamp":1764374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T00:00:00Z","timestamp":1764374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"European Union's Research and Innovation programme","award":["101126560"],"award-info":[{"award-number":["101126560"]}]},{"name":"University of Bergen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Appl. and Comput. Topology"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The motivation of this paper is to recognize a geometric shape from a noisy sample in the form of a point cloud. Inspired by the HDBSCAN clustering algorithm, we introduce the core dissimilarity, from which we construct the core bifiltration. We also consider the Delaunay core bifiltration by intersecting with Voronoi cells, giving us a filtered simplicial complex of smaller size. A major advantage of the (Delaunay) core bifiltration is that, for each filtration value, it admits a good cover of balls. By the persistent nerve theorem, the nerve of this cover is homotopy equivalent to the (Delaunay) core bifiltration. We show that the multicover-, core- and Delaunay core bifiltrations are all interleaved, and that they enjoy similar stability properties with respect to the Prohorov distance. We have performed experiments with the Delaunay core bifiltration. In the experiments, we calculated persistent homology along lines in the two-dimensional persistence parameter space, as well as multipersistence module approximations and Hilbert functions for the full Delaunay core bifiltration.<\/jats:p>","DOI":"10.1007\/s41468-025-00226-8","type":"journal-article","created":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T05:23:36Z","timestamp":1764393816000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Core Bifiltration"],"prefix":"10.1007","volume":"9","author":[{"given":"Nello","family":"Blaser","sequence":"first","affiliation":[]},{"given":"Morten","family":"Brun","sequence":"additional","affiliation":[]},{"given":"Odin Hoff","family":"Gardaa","sequence":"additional","affiliation":[]},{"given":"Lars M.","family":"Salbu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,29]]},"reference":[{"key":"226_CR1","doi-asserted-by":"crossref","unstructured":"Alonso, \u00c1.J., Kerber, M., Lam, T., Lesnick, M.: Delaunay bifiltrations of functions on point clouds. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 4872\u20134891 (2024). SIAM","DOI":"10.1137\/1.9781611977912.173"},{"key":"226_CR2","doi-asserted-by":"publisher","unstructured":"Alonso, A.J., Kerber, M., Skraba, P.: Probabilistic Analysis of Multiparameter Persistence Decompositions into Intervals. In: 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol. 293. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2024.6","DOI":"10.4230\/LIPIcs.SoCG.2024.6"},{"key":"226_CR3","doi-asserted-by":"publisher","unstructured":"Buchet, M., B.\u00a0Dornelas, B., Kerber, M.: Sparse Higher Order \u010cech Filtrations. In: 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol. 258. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2023.20","DOI":"10.4230\/LIPIcs.SoCG.2023.20"},{"issue":"4","key":"226_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.exmath.2023.04.005","volume":"41","author":"U Bauer","year":"2023","unstructured":"Bauer, U., Kerber, M., Roll, F., Rolle, A.: A unified view on the functorial nerve theorem and its variations. Expo. Math. 41(4), 125503 (2023). https:\/\/doi.org\/10.1016\/j.exmath.2023.04.005","journal-title":"Expo. Math."},{"key":"226_CR5","doi-asserted-by":"crossref","unstructured":"Botnan, M.B., Lesnick, M.: An Introduction to Multiparameter Persistence (2023)","DOI":"10.4171\/ecr\/19\/4"},{"issue":"2","key":"226_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10208-022-09576-6","volume":"24","author":"AJ Blumberg","year":"2024","unstructured":"Blumberg, A.J., Lesnick, M.: Stability of 2-Parameter Persistent Homology. Found. Comput. Math. 24(2), 385\u2013427 (2024). https:\/\/doi.org\/10.1007\/s10208-022-09576-6","journal-title":"Found. Comput. Math."},{"key":"226_CR7","unstructured":"Chaudhuri, K., Dasgupta, S.: Rates of convergence for the cluster tree. In: Advances in Neural Information Processing Systems, vol. 23, pp. 343\u2013351. Curran Associates, Inc., Red Hook, NY, USA (2010)"},{"issue":"2","key":"226_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/s00454-022-00476-8","volume":"70","author":"R Corbet","year":"2023","unstructured":"Corbet, R., Kerber, M., Lesnick, M., Osang, G.: Computing the Multicover Bifiltration. Discrete & Computational Geometry 70(2), 376\u2013405 (2023). https:\/\/doi.org\/10.1007\/s00454-022-00476-8","journal-title":"Discrete & Computational Geometry"},{"key":"226_CR9","doi-asserted-by":"publisher","unstructured":"Campello, R.J.G.B., Moulavi, D., Sander, J.: Density-Based Clustering Based on Hierarchical Density Estimates. In: Advances in Knowledge Discovery and Data Mining, pp. 160\u2013172. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37456-2_14","DOI":"10.1007\/978-3-642-37456-2_14"},{"issue":"1","key":"226_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00454-009-9176-0","volume":"42","author":"G Carlsson","year":"2009","unstructured":"Carlsson, G., Zomorodian, A.: The Theory of Multidimensional Persistence. Discrete & Computational Geometry 42(1), 71\u201393 (2009). https:\/\/doi.org\/10.1007\/s00454-009-9176-0","journal-title":"Discrete & Computational Geometry"},{"issue":"4","key":"226_CR11","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1007\/s00454-021-00281-9","volume":"65","author":"H Edelsbrunner","year":"2021","unstructured":"Edelsbrunner, H., Osang, G.: The Multi-Cover Persistence of Euclidean Balls. Discrete & Computational Geometry 65(4), 1296\u20131313 (2021). https:\/\/doi.org\/10.1007\/s00454-021-00281-9","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"226_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00453-022-01027-6","volume":"85","author":"H Edelsbrunner","year":"2023","unstructured":"Edelsbrunner, H., Osang, G.: A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes. Algorithmica 85(1), 277\u2013295 (2023). https:\/\/doi.org\/10.1007\/s00453-022-01027-6","journal-title":"Algorithmica"},{"key":"226_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.4153\/CJM-1964-067-6","volume":"16","author":"V Klee","year":"1964","unstructured":"Klee, V.: On the Number of Vertices of a Convex Polytope. Canadian Journal of Mathematics 16, 701\u2013720 (1964). https:\/\/doi.org\/10.4153\/CJM-1964-067-6","journal-title":"Canadian Journal of Mathematics"},{"key":"226_CR14","unstructured":"Loiseaux, D., Carriere, M., Blumberg, A.J.: Fast, stable and efficient approximation of multi-parameter persistence modules with MMA. arXiv preprint arXiv:2206.02026 (2022)"},{"key":"226_CR15","unstructured":"Lesnick, M.: Notes on Multiparameter Persistence (for AMAT 840). Accessed 2024\u201306-03 (2023)"},{"key":"226_CR16","doi-asserted-by":"crossref","unstructured":"Loiseaux, D.: Multiparameter topological persistence for machine learning. PhD thesis, Universit\u00e9 C\u00f4te d\u2019Azur (2024)","DOI":"10.21105\/joss.06773"},{"issue":"103","key":"226_CR17","doi-asserted-by":"publisher","first-page":"6773","DOI":"10.21105\/joss.06773","volume":"9","author":"D Loiseaux","year":"2024","unstructured":"Loiseaux, D., Schreiber, H.: Multipers: Multiparameter Persistence for Machine Learning. Journal of Open Source Software 9(103), 6773 (2024). https:\/\/doi.org\/10.21105\/joss.06773","journal-title":"Journal of Open Source Software"},{"key":"226_CR18","unstructured":"Lesnick, M., Wright, M.: Interactive Visualization of 2-D Persistence Modules (2015)"},{"key":"226_CR19","unstructured":"Maria, C.: Filtered Complexes. GUDHI Editorial Board (2015). http:\/\/gudhi.gforge.inria.fr\/doc\/latest\/group__simplex__tree.html"},{"issue":"11","key":"226_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.21105\/joss.00205","volume":"2","author":"L McInnes","year":"2017","unstructured":"McInnes, L., Healy, J., Astels, S.: hdbscan: Hierarchical density based clustering. J. Open Source Softw. 2(11), 205 (2017)","journal-title":"J. Open Source Softw."},{"key":"226_CR21","unstructured":"Rouvreau, V.: Alpha complex. GUDHI Editorial Board (2015). http:\/\/gudhi.gforge.inria.fr\/doc\/latest\/group__alpha__complex.html"},{"issue":"258","key":"226_CR22","first-page":"1","volume":"25","author":"A Rolle","year":"2024","unstructured":"Rolle, A., Scoccola, L.: Stable and consistent density-based clustering via multiparameter persistence. J. Mach. Learn. Res. 25(258), 1\u201374 (2024)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"226_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0925-7721(95)00013-Y","volume":"5","author":"R Seidel","year":"1995","unstructured":"Seidel, R.: The upper bound theorem for polytopes: an easy proof of its asymptotic version. Comput. Geom. 5(2), 115\u2013116 (1995). https:\/\/doi.org\/10.1016\/0925-7721(95)00013-Y","journal-title":"Comput. Geom."},{"key":"226_CR24","unstructured":"Sheehy, D.R.: A Multicover Nerve for Geometric Inference. In: Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, pp. 309\u2013314 (2012). http:\/\/2012.cccg.ca\/papers\/paper52.pdf"},{"key":"226_CR25","unstructured":"The GUDHI Project: GUDHI User and Reference Manual. GUDHI Editorial Board (2015). http:\/\/gudhi.gforge.inria.fr\/doc\/latest\/"}],"container-title":["Journal of Applied and Computational Topology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-025-00226-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41468-025-00226-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-025-00226-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:52:32Z","timestamp":1765360352000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41468-025-00226-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,29]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s41468-025-00226-8","relation":{},"ISSN":["2367-1726","2367-1734"],"issn-type":[{"type":"print","value":"2367-1726"},{"type":"electronic","value":"2367-1734"}],"subject":[],"published":{"date-parts":[[2025,11,29]]},"assertion":[{"value":"19 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 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 relevant financial or non-financial conflicts of interest to disclose related to the content of this publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"30"}}