{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T05:30:19Z","timestamp":1781847019942,"version":"3.54.5"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2107808"],"award-info":[{"award-number":["DMS-2107808"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1910733"],"award-info":[{"award-number":["IIS-1910733"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"Department of Energy","doi-asserted-by":"crossref","award":["DE-SC0021015"],"award-info":[{"award-number":["DE-SC0021015"]}],"id":[{"id":"10.13039\/100000015","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":[[2024,10]]},"DOI":"10.1007\/s41468-023-00142-9","type":"journal-article","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T16:02:41Z","timestamp":1696089761000},"page":"1171-1230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Hypergraph co-optimal transport: metric and categorical properties"],"prefix":"10.1007","volume":"8","author":[{"given":"Samir","family":"Chowdhury","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom","family":"Needham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ethan","family":"Semrad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youjia","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"key":"142_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Lim, J., Zelnik-Manor, L., Perona, P., Kriegman, D., Belongie, S.: Beyond pairwise clustering. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), vol. 2, pp. 838\u2013845 (2005)","DOI":"10.1109\/CVPR.2005.89"},{"key":"142_CR2","volume-title":"Gradient Flows: In Metric Spaces and in the Space of Probability Measures","author":"L Ambrosio","year":"2005","unstructured":"Ambrosio, L., Gigli, N., Savar\u00e9, G.: Gradient Flows: In Metric Spaces and in the Space of Probability Measures. Birkh\u00e4user Verlag, Basel (2005)"},{"key":"142_CR3","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.laa.2016.12.022","volume":"1","author":"A Banerjee","year":"2017","unstructured":"Banerjee, A., Char, A., Mondal, B.: Spectra of general hypergraphs. Linear Algebra Appl. 1, 14\u201330 (2017)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"142_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(77)90127-3","volume":"18","author":"J-C Bermond","year":"1977","unstructured":"Bermond, J.-C., Heydemann, M.-C., Sotteau, D.: Line graphs of hypergraphs I. Discrete Math. 18(3), 235\u2013241 (1977)","journal-title":"Discrete Math."},{"key":"142_CR5","unstructured":"Blumberg, A.J., Carriere, M., Mandell, M.A., Rabadan, R., Villar, S.: MREC: a fast and versatile framework for aligning and matching point clouds with applications to single cell molecular data. arXiv preprint arXiv:2001.01666 (2020)"},{"key":"142_CR6","volume-title":"Harmonic Analysis and the Theory of Probability","author":"S Bochner","year":"2020","unstructured":"Bochner, S.: Harmonic Analysis and the Theory of Probability. University of California Press, Berkeley (2020)"},{"key":"142_CR7","volume-title":"Handbook of Categorical Algebra: Basic Category Theory","author":"F Borceux","year":"1994","unstructured":"Borceux, F.: Handbook of Categorical Algebra: Basic Category Theory, vol. 1. Cambridge University Press, Cambridge (1994)"},{"key":"142_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-00080-0","volume-title":"Hypergraph Theory: An Introduction","author":"A Bretto","year":"2013","unstructured":"Bretto, A.: Hypergraph Theory: An Introduction. Springer, New York (2013)"},{"key":"142_CR9","volume-title":"Numerical Geometry of Non-rigid Shapes","author":"AM Bronstein","year":"2008","unstructured":"Bronstein, A.M., Bronstein, M.M., Kimmel, R.: Numerical Geometry of Non-rigid Shapes. Springer, New York (2008)"},{"key":"142_CR10","unstructured":"Carlsson, G., M\u00e9moli, F.: Persistent clustering and a theorem of J. Kleinberg. arXiv preprint arXiv:0808.2241 (2008)"},{"key":"142_CR11","first-page":"1425","volume":"11","author":"G Carlsson","year":"2010","unstructured":"Carlsson, G., M\u00e9moli, F.: Characterization, stability and convergence of hierarchical clustering methods. J. Mach. Learn. Res. 11, 1425\u20131470 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"142_CR12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10208-012-9141-9","volume":"13","author":"G Carlsson","year":"2013","unstructured":"Carlsson, G., M\u00e9moli, F.: Classifying clustering schemes. Found. Comput. Math. 13(2), 221\u2013252 (2013)","journal-title":"Found. Comput. Math."},{"key":"142_CR13","doi-asserted-by":"crossref","unstructured":"Carlsson, G., M\u00e9moli, F., Ribeiro, A., Segarra, S.: Axiomatic construction of hierarchical clustering in asymmetric networks. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 5219\u20135223 (2013)","DOI":"10.1109\/ICASSP.2013.6638658"},{"issue":"1","key":"142_CR14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s11634-017-0299-5","volume":"12","author":"G Carlsson","year":"2018","unstructured":"Carlsson, G., M\u00e9moli, F., Ribeiro, A., Segarra, S.: Hierarchical clustering of asymmetric networks. Adv. Data Anal. Classif. 12(1), 65\u2013105 (2018)","journal-title":"Adv. Data Anal. Classif."},{"issue":"4","key":"142_CR15","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/20M1359201","volume":"5","author":"G Carlsson","year":"2021","unstructured":"Carlsson, G., M\u00e9moli, F., Segarra, S.: Robust hierarchical clustering for directed networks: an axiomatic approach. SIAM J. Appl. Algebra Geom. 5(4), 675\u2013700 (2021)","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"142_CR16","doi-asserted-by":"crossref","first-page":"7028","DOI":"10.1038\/s41598-021-86469-8","volume":"11","author":"G Cencetti","year":"2021","unstructured":"Cencetti, G., Battiston, F., Lepri, B., Karsai, M.: Temporal properties of higher-order interactions in social networks. Sci. Rep. 11, 7028 (2021)","journal-title":"Sci. Rep."},{"issue":"12","key":"142_CR17","doi-asserted-by":"crossref","first-page":"2205","DOI":"10.1109\/TPAMI.2010.51","volume":"32","author":"M Chertok","year":"2010","unstructured":"Chertok, M., Keller, Y.: Efficient high order matching. IEEE Trans. Pattern Anal. Mach. Intell. 32(12), 2205\u20132215 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"142_CR18","doi-asserted-by":"crossref","unstructured":"Chowdhury, S., Miller, D., Needham, T.: Quantized Gromov\u2013Wasserstein. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 811\u2013827 (2021)","DOI":"10.1007\/978-3-030-86523-8_49"},{"key":"142_CR19","first-page":"48","volume":"25","author":"S Chowdhury","year":"2018","unstructured":"Chowdhury, S., M\u00e9moli, F.: Explicit geodesics in Gromov\u2013Hausdorff space. Electron. Res. Announc. Math. Sci. 25, 48 (2018)","journal-title":"Electron. Res. Announc. Math. Sci."},{"issue":"4","key":"142_CR20","first-page":"757","volume":"8","author":"S Chowdhury","year":"2019","unstructured":"Chowdhury, S., M\u00e9moli, F.: The Gromov\u2013Wasserstein distance between networks and stable network invariants. Inf. Inference J. IMA 8(4), 757\u2013787 (2019)","journal-title":"Inf. Inference J. IMA"},{"key":"142_CR21","doi-asserted-by":"crossref","unstructured":"Chowdhury, S., Needham, T.: Gromov\u2013Wasserstein averaging in a Riemannian framework. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition Workshops, pp. 842\u2013843 (2020)","DOI":"10.1109\/CVPRW50498.2020.00429"},{"key":"142_CR22","unstructured":"Chowdhury, S., Needham, T.: Generalized spectral clustering via Gromov\u2013Wasserstein learning. In: International Conference on Artificial Intelligence and Statistics, pp. 712\u2013720 (2021)"},{"key":"142_CR23","unstructured":"Culbertson, J., Guralnik, D.P., Hansen, J., Stiller, P.F.: Consistency constraints for overlapping data clustering. arXiv preprint arXiv:1608.04331 (2016)"},{"key":"142_CR24","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.dam.2017.10.015","volume":"236","author":"J Culbertson","year":"2018","unstructured":"Culbertson, J., Guralnik, D.P., Stiller, P.F.: Functorial hierarchical clustering with overlaps. Discrete Appl. Math. 236, 108\u2013123 (2018)","journal-title":"Discrete Appl. Math."},{"key":"142_CR25","doi-asserted-by":"crossref","unstructured":"Dey, T.K., M\u00e9moli, F., Wang, Y.: Multiscale mapper: topological summarization via codomain covers. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 997\u20131013 (2016)","DOI":"10.1137\/1.9781611974331.ch71"},{"issue":"1","key":"142_CR26","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01224952","volume":"34","author":"W D\u00f6rfler","year":"1980","unstructured":"D\u00f6rfler, W., Waller, D.: A category-theoretical approach to hypergraphs. Arch. Math. 34(1), 185\u2013192 (1980)","journal-title":"Arch. Math."},{"issue":"12","key":"142_CR27","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1109\/TPAMI.2011.110","volume":"33","author":"O Duchenne","year":"2011","unstructured":"Duchenne, O., Bach, F., Kweon, I.-S., Ponce, J.: A tensor-based algorithm for high-order graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 33(12), 2383\u20132395 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"142_CR28","unstructured":"Flamary, R., Courty, N.: POT: Python Optimal Transport library (2017)"},{"issue":"78","key":"142_CR29","first-page":"1","volume":"22","author":"R Flamary","year":"2021","unstructured":"Flamary, R., Courty, N., Gramfort, A., Alaya, M.Z., Boisbunon, A., Chambon, S., Chapel, L., Corenflos, A., Fatras, K., Fournier, N., Gautheron, L., Gayraud, N.T.H., Janati, H., Rakotomamonjy, A., Redko, I., Rolet, A., Schutz, A., Seguy, V., Sutherland, D.J., Tavenard, R., Tong, A., Vayer, T.: Pot: Python optimal transport. J. Mach. Learn. Res. 22(78), 1\u20138 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"142_CR30","volume-title":"Real Analysis: Modern Techniques and Their Applications","author":"GB Folland","year":"1999","unstructured":"Folland, G.B.: Real Analysis: Modern Techniques and Their Applications. Wiley, Hoboken (1999)"},{"issue":"1","key":"142_CR31","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01593787","volume":"12","author":"G Gallo","year":"1977","unstructured":"Gallo, G., \u00dclk\u00fcc\u00fc, A.: Bilinear programming: an exact algorithm. Math. Program. 12(1), 173\u2013194 (1977)","journal-title":"Math. Program."},{"issue":"4","key":"142_CR32","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 18(4), 377\u2013388 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"142_CR33","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P Hell","year":"2004","unstructured":"Hell, P., Nesetril, J.: Graphs and Homomorphisms, vol. 28. OUP, Oxford (2004)"},{"key":"142_CR34","unstructured":"Hendrikson, R.: Using Gromov\u2013Wasserstein distance to explore sets of networks. Master\u2019s thesis, University of Tartu (2016)"},{"issue":"1","key":"142_CR35","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF02566944","volume":"39","author":"JR Isbell","year":"1964","unstructured":"Isbell, J.R.: Six theorems about injective metric spaces. Commentarii Mathematici Helvetici 39(1), 65\u201376 (1964)","journal-title":"Commentarii Mathematici Helvetici"},{"issue":"1","key":"142_CR36","doi-asserted-by":"crossref","first-page":"47","DOI":"10.4064\/am-16-1-47-57","volume":"16","author":"M Karo\u0144ski","year":"1977","unstructured":"Karo\u0144ski, M., Palka, Z.: On Marczewski\u2013Steinhaus type distance between hypergraphs. Applicationes Mathematicae 16(1), 47\u201357 (1977)","journal-title":"Applicationes Mathematicae"},{"key":"142_CR37","doi-asserted-by":"crossref","first-page":"e1000385","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt, S., Haus, U.-U., Theis, F.: Hypergraphs and cellular networks. PLoS Comput. Biol. 5, e1000385 (2009)","journal-title":"PLoS Comput. Biol."},{"key":"142_CR38","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"DE Knuth","year":"1994","unstructured":"Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, New York (1994)"},{"issue":"1\u20133","key":"142_CR39","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0012-365X(00)00290-9","volume":"235","author":"EV Konstantinova","year":"2001","unstructured":"Konstantinova, E.V., Skorobogatov, V.A.: Application of hypergraph theory in chemistry. Discrete Math. 235(1\u20133), 365\u2013383 (2001)","journal-title":"Discrete Math."},{"key":"142_CR40","doi-asserted-by":"crossref","unstructured":"Kountouras, A., Kintis, P., Lever, C., Chen, Y., Nadji, Y., Dagon, D., Antonakakis, M., Joffe, R.: Enabling network security through active DNS datasets. In: International Symposium on Research in Attacks, Intrusions, and Defenses, pp. 188\u2013208 (2016)","DOI":"10.1007\/978-3-319-45719-2_9"},{"key":"142_CR41","unstructured":"Lawvere, F.W.: The category of probabilistic mappings. Preprint (1962)"},{"key":"142_CR42","doi-asserted-by":"crossref","unstructured":"Lee, J., Cho, M., Lee, K.M.: Hyper-graph matching via reweighted random walks. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2011)","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"142_CR43","unstructured":"Li, M., Palande, S., Yan, L., Wang, B.: Sketching merge trees for scientific data visualization. arXiv preprint arXiv:2101.03196 (2021)"},{"key":"142_CR44","doi-asserted-by":"crossref","unstructured":"Lin, C.-L.: Hardness of approximating graph transformation problem. In: Algorithms and Computation: 5th International Symposium, pp. 74\u201382 (1994)","DOI":"10.1007\/3-540-58325-4_168"},{"key":"142_CR45","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1038\/s42005-022-00858-7","volume":"5","author":"QF Lotito","year":"2022","unstructured":"Lotito, Q.F., Musciotto, F., Montresor, A., Battiston, F.: Higher-order motif analysis in hypergraphs. Commun. Phys. 5, 79 (2022)","journal-title":"Commun. Phys."},{"key":"142_CR46","unstructured":"M\u00e9moli, F.: On the use of Gromov-Hausdorff distances for shape comparison. In: Eurographics Symposium on Point-Based Graphics, pp. 81\u201390 (2007)"},{"key":"142_CR47","doi-asserted-by":"crossref","unstructured":"M\u00e9moli, F.: Gromov\u2013Wasserstein distances and the metric approach to object matching. Found. Comput. Math. 11(4), 417\u2013487 (2011a)","DOI":"10.1007\/s10208-011-9093-5"},{"key":"142_CR48","doi-asserted-by":"crossref","unstructured":"M\u00e9moli, F.: A spectral notion of Gromov\u2013Wasserstein distance and related methods. Appl. Comput. Harmon. Anal. 30(3), 363\u2013401 (2011b)","DOI":"10.1016\/j.acha.2010.09.005"},{"issue":"9","key":"142_CR49","doi-asserted-by":"crossref","first-page":"5362","DOI":"10.22436\/jnsa.009.09.05","volume":"9","author":"A Mutlu","year":"2016","unstructured":"Mutlu, A., G\u00fcrdal, U.: Bipolar metric spaces and some fixed point theorems. J. Nonlinear Sci. Appl. 9(9), 5362\u20135373 (2016)","journal-title":"J. Nonlinear Sci. Appl."},{"key":"142_CR50","first-page":"18","volume":"6","author":"A Patania","year":"2017","unstructured":"Patania, A., Petri, G., Vaccarino, F.: The shape of collaborations. PJ Data Sci. 6, 18 (2017)","journal-title":"PJ Data Sci."},{"key":"142_CR51","unstructured":"Perrone, P.: Lifting couplings in wasserstein spaces. arXiv preprint arXiv: 2110.06591 (2021)"},{"key":"142_CR52","unstructured":"Peyr\u00e9, G., Cuturi, M., Solomon, J.: Gromov\u2013Wasserstein averaging of kernel and distance matrices. In: International Conference on Machine Learning, pp. 2664\u20132672 (2016)"},{"issue":"5\u20136","key":"142_CR53","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9, G., Cuturi, M., et al.: Computational optimal transport: with applications to data science. Found. Trends Mach. Learn. 11(5\u20136), 355\u2013607 (2019)","journal-title":"Found. Trends Mach. Learn."},{"key":"142_CR54","doi-asserted-by":"crossref","unstructured":"Pu, L., Faltings, B.: Hypergraph learning with hyperedge expansion. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 410\u2013425 (2012)","DOI":"10.1007\/978-3-642-33460-3_32"},{"key":"142_CR55","unstructured":"Redko, I., Vayer, T., Flamary, R., Courty, N.: Co-optimal transport. In: Advances in Neural Information Processing Systems, vol. 33, pp. 17559\u201317570 (2020)"},{"issue":"4","key":"142_CR56","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.cad.2005.10.011","volume":"38","author":"M Reuter","year":"2006","unstructured":"Reuter, M., Wolter, F.-E., Peinecke, N.: Laplace-Beltrami spectra as \u2018Shape-DNA\u2019 of surfaces and solids. Comput. Aided Des. 38(4), 342\u2013366 (2006)","journal-title":"Comput. Aided Des."},{"issue":"1","key":"142_CR57","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/03081080290011692","volume":"50","author":"JA Rodri\u2019guez","year":"2002","unstructured":"Rodri\u2019guez, J.A.: On the Laplacian eigenvalues and metric parameters of hypergraphs. Linear Multilinear Algebra 50(1), 1\u201314 (2002)","journal-title":"Linear Multilinear Algebra"},{"key":"142_CR58","unstructured":"Scetbon, M., Peyr\u00e9, G., Cuturi, M.: Linear-time gromov wasserstein distances using low rank couplings and costs. In: International Conference on Machine Learning, pp. 19347\u201319365 (2022)"},{"key":"142_CR59","volume-title":"Relations and Graphs: Discrete Mathematics for Computer Scientists","author":"G Schmidt","year":"2012","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer, Berlin (2012)"},{"key":"142_CR60","unstructured":"Singh, G., M\u00e9moli, F., Carlsson, G.E.: Topological methods for the analysis of high dimensional data sets and 3d object recognition. In: The IEEE Eurographics Symposium on Point-Based Graphics (PBG), vol. 2, pp. 091\u2013100 (2007)"},{"key":"142_CR61","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.patrec.2021.06.007","volume":"149","author":"S Smaniotto","year":"2021","unstructured":"Smaniotto, S., Pelillo, M.: Two metrics for attributed hypergraphs. Pattern Recogn. Lett. 149, 143\u2013149 (2021)","journal-title":"Pattern Recogn. Lett."},{"key":"142_CR62","unstructured":"Solomon, J.: Optimal transport on discrete domains. AMS Short Course on Discrete Differential Geometry (2018)"},{"issue":"4","key":"142_CR63","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2897824.2925903","volume":"35","author":"J Solomon","year":"2016","unstructured":"Solomon, J., Peyr\u00e9, G., Kim, V.G., Sra, S.: Entropic metric alignment for correspondence problems. ACM Trans. Graph. (TOG) 35(4), 1\u201313 (2016)","journal-title":"ACM Trans. Graph. (TOG)"},{"issue":"1","key":"142_CR64","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s11511-006-0002-8","volume":"196","author":"K-T Sturm","year":"2006","unstructured":"Sturm, K.-T.: On the geometry of metric measure spaces. Acta Math. 196(1), 65\u2013131 (2006)","journal-title":"Acta Math."},{"key":"142_CR65","unstructured":"Sturm, K.-T.: The space of spaces: curvature bounds and gradient flows on the space of metric measure spaces. arXiv preprint arXiv:1208.0434 (2012)"},{"key":"142_CR66","doi-asserted-by":"crossref","unstructured":"Sun, L., Ji, S., Ye, J.: Hypergraph spectral learning for multi-label classification. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 668\u2013676 (2008)","DOI":"10.1145\/1401890.1401971"},{"key":"142_CR67","unstructured":"Surana, A., Chen, C., Rajapakse, I.: Hypergraph dissimilarity measures. arXiv preprint arXiv:2106.08206 (2021)"},{"key":"142_CR68","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: ArnetMiner: extraction and mining of academic social networks. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 990\u2013998 (2008)","DOI":"10.1145\/1401890.1402008"},{"key":"142_CR69","first-page":"227","volume":"1","author":"SM Ulam","year":"1972","unstructured":"Ulam, S.M.: Some ideas and prospects in biomathematics. Annu. Rev. Biophys. Bioeng. 1, 227\u2013292 (1972)","journal-title":"Annu. Rev. Biophys. Bioeng."},{"issue":"5","key":"142_CR70","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S Umeyama","year":"1988","unstructured":"Umeyama, S.: An eigen decomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell. 10(5), 695\u2013703 (1988)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"142_CR71","unstructured":"Vayer, T., Courty, N., Tavenard, R., Flamary, R.: Optimal transport for structured data with application on graphs. In: International Conference on Machine Learning, pp. 6275\u20136284 (2019)"},{"key":"142_CR72","volume-title":"Topics in Optimal Transportation","author":"C Villani","year":"2003","unstructured":"Villani, C.: Topics in Optimal Transportation, vol. 58. American Mathematical Society, Providence, Rhode Island (2003)"},{"key":"142_CR73","doi-asserted-by":"crossref","unstructured":"Xia, X., Yin, H., Yu, J., Wang, Q., Cui, L., Zhang, X.: Self-supervised hypergraph convolutional networks for session-based recommendation. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 4503\u20134511 (2021)","DOI":"10.1609\/aaai.v35i5.16578"},{"key":"142_CR74","unstructured":"Xu, H., Luo, D., Carin, L.: Scalable Gromov\u2013Wasserstein learning for graph partitioning and matching. In: Advances in Neural Information Processing Systems, pp. 3046\u20133056 (2019a)"},{"key":"142_CR75","unstructured":"Xu, H., Luo, D., Zha, H., Carin, L.: Gromov\u2013Wasserstein learning for graph matching and node embedding. In: International Conference on Machine Learning, pp. 6932\u20136941 (2019b)"},{"key":"142_CR76","doi-asserted-by":"crossref","unstructured":"Xu, H.: Gromov\u2013Wasserstein factorization models for graph clustering. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 6478\u20136485 (2020)","DOI":"10.1609\/aaai.v34i04.6120"},{"issue":"1","key":"142_CR77","doi-asserted-by":"crossref","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. Proc. VLDB Endow. 2(1), 25\u201336 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"142_CR78","doi-asserted-by":"publisher","unstructured":"Zhou, Y., Rathore, A., Purvine, E., Wang, B.: Topological simplifications of hypergraphs. IEEE Trans. Visual Comput. Graphics 29(7), 3209\u20133225 (2023). https:\/\/doi.org\/10.1109\/TVCG.2022.3153895","DOI":"10.1109\/TVCG.2022.3153895"},{"key":"142_CR79","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1109\/43.784130","volume":"18","author":"J Zien","year":"1999","unstructured":"Zien, J., Schlag, M., Chan, P.K.: Multi-level spectral hypergraph partitioning with arbitrary vertex sizes. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18, 1389\u20131399 (1999)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."}],"container-title":["Journal of Applied and Computational Topology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-023-00142-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41468-023-00142-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-023-00142-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T10:13:02Z","timestamp":1729591982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41468-023-00142-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,30]]},"references-count":79,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["142"],"URL":"https:\/\/doi.org\/10.1007\/s41468-023-00142-9","relation":{},"ISSN":["2367-1726","2367-1734"],"issn-type":[{"value":"2367-1726","type":"print"},{"value":"2367-1734","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,30]]},"assertion":[{"value":"22 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}