{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:30:40Z","timestamp":1787502640072,"version":"build-2736575974"},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T00:00:00Z","timestamp":1713484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T00:00:00Z","timestamp":1713484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00778-024-00851-2","type":"journal-article","created":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T21:01:50Z","timestamp":1713474110000},"page":"1333-1356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hyper-distance oracles in hypergraphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Giulia","family":"Preti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gianmarco","family":"De Francisci Morales","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9464-8315","authenticated-orcid":false,"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,19]]},"reference":[{"issue":"10","key":"851_CR1","doi-asserted-by":"publisher","first-page":"2255","DOI":"10.1016\/j.patcog.2010.07.014","volume":"44","author":"Q Liu","year":"2011","unstructured":"Liu, Q., Huang, Y., Metaxas, D.N.: Hypergraph with sampling for image retrieval. Pattern Recogn. 44(10), 2255 (2011)","journal-title":"Pattern Recogn."},{"key":"851_CR2","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD, p. 349 (2013)","DOI":"10.1145\/2463676.2465315"},{"issue":"1","key":"851_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1140\/epjds\/s13688-020-00231-0","volume":"9","author":"SG Aksoy","year":"2020","unstructured":"Aksoy, S.G., Joslyn, C., Marrero, C.O., Praggastis, B., Purvine, E.: Hypernetwork science via high-order hypergraph walks. EPJ Data Sci. 9(1), 16 (2020)","journal-title":"EPJ Data Sci."},{"key":"851_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.tcs.2016.03.016","volume":"658","author":"G Ausiello","year":"2017","unstructured":"Ausiello, G., Laura, L.: Directed hypergraphs: introduction and fundamental algorithms\u2013a survey. Theor. Comput. Sci. 658, 293 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"851_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2008.10.018","volume":"410","author":"S Baswana","year":"2009","unstructured":"Baswana, S., Goyal, V., Sen, S.: All-pairs nearly 2-approximate shortest paths in o (n2polylogn) time. Theor. Comput. Sci. 410(1), 84 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"48","key":"851_CR6","doi-asserted-by":"publisher","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.: Simplicial closure and higher-order link prediction. PNAS 115(48), E11221 (2018)","journal-title":"PNAS"},{"key":"851_CR7","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets, vol. 45. Elsevier (1984)"},{"key":"851_CR8","doi-asserted-by":"crossref","unstructured":"Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixed-parameter algorithms for kemeny scores. In: AAIM, p. 60 (2008)","DOI":"10.1007\/978-3-540-68880-8_8"},{"key":"851_CR9","unstructured":"Billings, J.C.W., Hu, M., Lerda, G., Medvedev, A.N., Mottes, F., Onicas, A., Santoro, A., Petri, G.: Simplex2vec embeddings for community detection in simplicial complexes. arXiv preprint arXiv:1906.09068 (2019)"},{"issue":"11","key":"851_CR10","first-page":"1202","volume":"8","author":"B Brancotte","year":"2015","unstructured":"Brancotte, B., Yang, B., Blin, G., Cohen-Boulakia, S., Denise, A., Hamel, S.: Rank aggregation with ties: experiments and analysis. PVLDB 8(11), 1202 (2015)","journal-title":"PVLDB"},{"issue":"3","key":"851_CR11","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0031-3203(01)00067-X","volume":"35","author":"A Bretto","year":"2002","unstructured":"Bretto, A., Cherifi, H., Aboutajdine, D.: Hypergraph imaging: an overview. Pattern Recogn. 35(3), 651 (2002)","journal-title":"Pattern Recogn."},{"key":"851_CR12","doi-asserted-by":"crossref","unstructured":"Bu, J., Tan, S., Chen, C., Wang, C., Wu, H., Zhang, L., He, X.: Music recommendation by unified hypergraph: Combining social media information and music content. In: MM, p. 391 (2010)","DOI":"10.1145\/1873951.1874005"},{"key":"851_CR13","doi-asserted-by":"crossref","unstructured":"Chlamt\u00e1\u010d, E., Dinitz, M., Konrad, C., Kortsarz, G., Rabanca, G.: The densest $$k$$-subhypergraph problem. SIAM J. Discrete Math. 32(2), 1458 (2018)","DOI":"10.1137\/16M1096402"},{"key":"851_CR14","doi-asserted-by":"crossref","unstructured":"Cohen-Boulakia, S., Denise, A., Hamel, S.: Using medians to generate consensus rankings for biological data. In: SSDBM, p. 73 (2011)","DOI":"10.1007\/978-3-642-22351-8_5"},{"key":"851_CR15","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.endm.2015.06.077","volume":"49","author":"O Cooley","year":"2015","unstructured":"Cooley, O., Kang, M., Koch, C.: Evolution of high-order connected components in random hypergraphs. Electron. Not. Discrete Math. 49, 569 (2015)","journal-title":"Electron. Not. Discrete Math."},{"key":"851_CR16","doi-asserted-by":"crossref","unstructured":"Cooper, C., Lee, S.H., Radzik, T., Siantos, Y.: Random walks in recommender systems: exact computation and simulations. In: WWW, p. 811 (2014)","DOI":"10.1145\/2567948.2579244"},{"issue":"22","key":"851_CR17","doi-asserted-by":"publisher","first-page":"2615","DOI":"10.1093\/bioinformatics\/btn500","volume":"24","author":"LF De Figueiredo","year":"2008","unstructured":"De Figueiredo, L.F., Schuster, S., Kaleta, C., Fell, D.A.: Can sugars be produced from fatty acids? a test case for pathway analysis tools. Bioinformatics 24(22), 2615 (2008)","journal-title":"Bioinformatics"},{"key":"851_CR18","doi-asserted-by":"crossref","unstructured":"Draves, R., Padhye, J., Zill, B.: Routing in multi-radio, multi-hop wireless mesh networks. In: MobiCom, p. 114 (2004)","DOI":"10.1145\/1023720.1023732"},{"key":"851_CR19","unstructured":"Farhan, M., Wang, Q., Lin, Y., Mckay, B.: A highly scalable labelling approach for exact distance queries in complex networks. EDBT (2019)"},{"key":"851_CR20","doi-asserted-by":"crossref","unstructured":"Fatemi, B., Taslakian, P., Vazquez, D., Poole, D.: Knowledge hypergraphs: Prediction beyond binary relations. arXiv preprint arXiv:1906.00137 (2019)","DOI":"10.24963\/ijcai.2020\/303"},{"issue":"1","key":"851_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-021-04197-2","volume":"22","author":"S Feng","year":"2021","unstructured":"Feng, S., Heath, E., Jefferson, B., Joslyn, C., Kvinge, H., Mitchell, H.D., Praggastis, B., Eisfeld, A.J., Sims, A.C., Thackray, L.B., et al.: Hypergraph models of biological networks to identify genes critical to pathogenic viral response. BMC Bioinform. 22(1), 1 (2021)","journal-title":"BMC Bioinform."},{"key":"851_CR22","doi-asserted-by":"crossref","unstructured":"Feng, Y., You, H., Zhang, Z., Ji, R., Gao, Y.: Hypergraph neural networks. In: AAAI, p. 3558 (2019)","DOI":"10.1609\/aaai.v33i01.33013558"},{"issue":"10","key":"851_CR23","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1007384","volume":"15","author":"N Franzese","year":"2019","unstructured":"Franzese, N., Groce, A., Murali, T., Ritz, A.: Hypergraph-based connectivity measures for signaling pathway topologies. PLoS Comput. Biol. 15(10), e1007,384 (2019)","journal-title":"PLoS Comput. Biol."},{"issue":"2\u20133","key":"851_CR24","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G Gallo","year":"1993","unstructured":"Gallo, G., Longo, G., Pallottino, S., Nguyen, S.: Directed hypergraphs and applications. Discrete Appl. Math. 42(2\u20133), 177 (1993)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"851_CR25","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1109\/TNET.2014.2343914","volume":"23","author":"J Gao","year":"2014","unstructured":"Gao, J., Zhao, Q., Ren, W., Swami, A., Ramanathan, R., Bar-Noy, A.: Dynamic shortest path algorithms for hypergraphs. Trans. Netw. 23(6), 1805 (2014)","journal-title":"Trans. Netw."},{"key":"851_CR26","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V.: Point-to-point shortest path algorithms with preprocessing. In: SOFSEM, p. 88 (2007)","DOI":"10.1007\/978-3-540-69507-3_6"},{"key":"851_CR27","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA, vol.\u00a05, p. 156. Citeseer (2005)"},{"key":"851_CR28","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for a*: Efficient point-to-point shortest path algorithms. In: ALENEX, p. 129. SIAM (2006)","DOI":"10.1137\/1.9781611972863.13"},{"key":"851_CR29","unstructured":"Goldman, R., Shivakumar, N., Venkatasubramanian, S., Garcia-Molina, H.: Proximity search in databases. VLDB 98, p. 26 (1998)"},{"key":"851_CR30","doi-asserted-by":"crossref","unstructured":"Gori, M., Pucci, A.: Research paper recommender systems: A random-walk based approach. In: 2006 IEEE\/WIC\/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI\u201906), p. 778 (2006)","DOI":"10.1109\/WI.2006.149"},{"key":"851_CR31","unstructured":"Gori, M., Pucci, A., Roma, V., Siena, I.: Itemrank: A random-walk based scoring algorithm for recommender engines. In: IJCAI, vol.\u00a07, p. 2766 (2007)"},{"key":"851_CR32","doi-asserted-by":"crossref","unstructured":"Gubichev, A., Bedathur, S., Seufert, S., Weikum, G.: Fast and accurate estimation of shortest paths in large graphs. In: CIKM, p. 499 (2010)","DOI":"10.1145\/1871437.1871503"},{"key":"851_CR33","doi-asserted-by":"crossref","unstructured":"Huang, J., Zhang, R., Yu, J.X.: Scalable hypergraph learning and processing. In: ICDM, p. 775 (2015)","DOI":"10.1109\/ICDM.2015.33"},{"key":"851_CR34","unstructured":"Hwang, H., Lee, S., Shin, K.: Hyfer: A framework for making hypergraph learning easy, scalable and benchmarkable. In: GLB (2021)"},{"key":"851_CR35","unstructured":"Italiano, G.F., Nanni, U.: Online maintenance of minimal directed hypergraphs (1989)"},{"issue":"6833","key":"851_CR36","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong, H., Mason, S.P., Barab\u00e1si, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411(6833), 41 (2001)","journal-title":"Nature"},{"key":"851_CR37","doi-asserted-by":"crossref","unstructured":"Ji, S., Feng, Y., Ji, R., Zhao, X., Tang, W., Gao, Y.: Dual channel hypergraph collaborative filtering. In: KDD, p. 2020 (2020)","DOI":"10.1145\/3394486.3403253"},{"key":"851_CR38","doi-asserted-by":"crossref","unstructured":"Jiang, J., Wei, Y., Feng, Y., Cao, J., Gao, Y.: Dynamic hypergraph neural networks. In: IJCAI, p. 2635 (2019)","DOI":"10.24963\/ijcai.2019\/366"},{"key":"851_CR39","doi-asserted-by":"crossref","unstructured":"Jin, R., Peng, Z., Wu, W., Dragan, F., Agrawal, G., Ren, B.: Parallelizing pruned landmark labeling: dealing with dependencies in graph algorithms. In: ICS, p. 1 (2020)","DOI":"10.1145\/3392717.3392745"},{"key":"851_CR40","doi-asserted-by":"crossref","unstructured":"Joslyn, C.A., Aksoy, S.G., Callahan, T.J., Hunter, L.E., Jefferson, B., Praggastis, B., Purvine, E., Tripodi, I.J.: Hypernetwork science: from multidimensional networks to computational topology. In: CCS, p. 377 (2020)","DOI":"10.1007\/978-3-030-67318-5_25"},{"issue":"2","key":"851_CR41","first-page":"96","volume":"2005","author":"MP Joy","year":"2005","unstructured":"Joy, M.P., Brock, A., Ingber, D.E., Huang, S.: High-betweenness proteins in the yeast protein interaction network. J. Biomed. Biotechnol. 2005(2), 96 (2005)","journal-title":"J. Biomed. Biotechnol."},{"issue":"1","key":"851_CR42","first-page":"69","volume":"7","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in vlsi domain. VLSI 7(1), 69 (1999)","journal-title":"VLSI"},{"issue":"4","key":"851_CR43","first-page":"577","volume":"88","author":"JG Kemeny","year":"1959","unstructured":"Kemeny, J.G.: Mathematics without numbers. Daedalus 88(4), 577 (1959)","journal-title":"Daedalus"},{"issue":"2","key":"851_CR44","first-page":"297","volume":"6","author":"S Kirkland","year":"2018","unstructured":"Kirkland, S.: Two-mode networks exhibiting data loss. J. Comp. Netw. 6(2), 297 (2018)","journal-title":"J. Comp. Netw."},{"issue":"5","key":"851_CR45","doi-asserted-by":"publisher","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(5), e1000,385 (2009)","journal-title":"PLoS Comput. Biol."},{"issue":"6798","key":"851_CR46","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"JM Kleinberg","year":"2000","unstructured":"Kleinberg, J.M.: Navigation in a small world. Nature 406(6798), 845 (2000)","journal-title":"Nature"},{"issue":"4","key":"851_CR47","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.ymeth.2012.06.003","volume":"57","author":"M Kotlyar","year":"2012","unstructured":"Kotlyar, M., Fortney, K., Jurisica, I.: Network-based characterization of drug-regulated genes, drug targets, and toxicity. Methods 57(4), 499 (2012)","journal-title":"Methods"},{"key":"851_CR48","doi-asserted-by":"crossref","unstructured":"Krieger, S., Kececioglu, J.: Fast approximate shortest hyperpaths for inferring pathways in cell signaling hypergraphs. In: WABI. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)","DOI":"10.1186\/s13015-022-00217-9"},{"key":"851_CR49","doi-asserted-by":"crossref","unstructured":"Kumar, R., Vassilvitskii, S.: Generalized distances between rankings. In: WWW, p. 571(2010)","DOI":"10.1145\/1772690.1772749"},{"key":"851_CR50","doi-asserted-by":"crossref","unstructured":"Li, D., Xu, Z., Li, S., Sun, X.: Link prediction in social networks based on hypergraph. In: WWW, p. 41 (2013)","DOI":"10.1145\/2487788.2487802"},{"key":"851_CR51","doi-asserted-by":"crossref","unstructured":"Li, J., He, J., Zhu, Y.: E-tail product return prediction via hypergraph-based local graph cut. In: KDD, p. 519 (2018)","DOI":"10.1145\/3219819.3219829"},{"key":"851_CR52","doi-asserted-by":"crossref","unstructured":"Li, W., Qiao, M., Qin, L., Zhang, Y., Chang, L., Lin, X.: Scaling up distance labeling on graphs with core-periphery properties. In: SIGMOD, p. 1367 (2020)","DOI":"10.1145\/3318464.3389748"},{"key":"851_CR53","doi-asserted-by":"crossref","unstructured":"Liu, X.T., Firoz, J., Aksoy, S., Amburg, I., Lumsdaine, A., Joslyn, C., Gebremedhin, A.H., Praggastis, B.: High-order line graphs of non-uniform hypergraphs: Algorithms, applications, and experimental analysis. arXiv preprint arXiv:2201.11326 (2022)","DOI":"10.1109\/IPDPS53621.2022.00081"},{"key":"851_CR54","doi-asserted-by":"crossref","unstructured":"Liu, X.T., Firoz, J., Lumsdaine, A., Joslyn, C., Aksoy, S., Praggastis, B., Gebremedhin, A.: Parallel algorithms and heuristics for efficient computation of high-order line graphs of hypergraphs. arXiv preprint arXiv:2010.11448 (2020)","DOI":"10.1109\/HiPC53243.2021.00045"},{"key":"851_CR55","doi-asserted-by":"crossref","unstructured":"Lu, L., Peng, X.: High-ordered random walks and generalized laplacians on hypergraphs. In: International Workshop on Algorithms and Models for the Web-Graph, p. 14 (2011)","DOI":"10.1007\/978-3-642-21286-4_2"},{"key":"851_CR56","doi-asserted-by":"crossref","unstructured":"Luo, Q., Yu, D., Cai, Z., Lin, X., Wang, G., Cheng, X.: Toward maintenance of hypercores in large-scale dynamic hypergraphs. In: VLDBJ, p. 1 (2022)","DOI":"10.1007\/s00778-022-00763-z"},{"key":"851_CR57","doi-asserted-by":"crossref","unstructured":"Manne, F., Patwary, M., Ali, M.: A scalable parallel union-find algorithm for distributed memory computers. In: PPAM, p. 186 (2009)","DOI":"10.1007\/978-3-642-14390-8_20"},{"issue":"6","key":"851_CR58","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1016\/j.cor.2003.11.014","volume":"32","author":"LR Nielsen","year":"2005","unstructured":"Nielsen, L.R., Andersen, K.A., Pretolani, D.: Finding the k shortest hyperpaths. Comput. Oper. Res. 32(6), 1477 (2005)","journal-title":"Comput. Oper. Res."},{"key":"851_CR59","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: CIKM, p. 867 (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"851_CR60","doi-asserted-by":"crossref","unstructured":"Preti, G., De\u00a0Francisci\u00a0Morales, G., Bonchi, F.: Strud: Truss decomposition of simplicial complexes. In: The Web Conference, p. 3408 (2021)","DOI":"10.1145\/3442381.3450073"},{"issue":"1","key":"851_CR61","first-page":"61","volume":"7","author":"Z Qi","year":"2013","unstructured":"Qi, Z., Xiao, Y., Shao, B., Wang, H.: Toward a distance oracle for billion-node graphs. PVLDB 7(1), 61 (2013)","journal-title":"PVLDB"},{"issue":"7","key":"851_CR62","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1093\/bioinformatics\/bti116","volume":"21","author":"SA Rahman","year":"2005","unstructured":"Rahman, S.A., Advani, P., Schunk, R., Schrader, R., Schomburg, D.: Metabolic pathway analysis web service (pathway hunter tool at cubic). Bioinformatics 21(7), 1189 (2005)","journal-title":"Bioinformatics"},{"key":"851_CR63","doi-asserted-by":"crossref","unstructured":"Ritz, A., Avent, B., Murali, T.: Pathway analysis with signaling hypergraphs. TCBB 14(5), 1042 (2015)","DOI":"10.1109\/TCBB.2015.2459681"},{"issue":"7","key":"851_CR64","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.tibtech.2014.04.007","volume":"32","author":"A Ritz","year":"2014","unstructured":"Ritz, A., Tegge, A.N., Kim, H., Poirel, C.L., Murali, T.: Signaling hypergraphs. Trends Biotechnol. 32(7), 356 (2014)","journal-title":"Trends Biotechnol."},{"key":"851_CR65","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf, B., Platt, J., Hofmann, T.: Learning with hypergraphs: Clustering, classification, and embedding. In: NIPS, p. 1601 (2007)","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"851_CR66","doi-asserted-by":"crossref","unstructured":"Shun, J.: Practical parallel hypergraph algorithms. In: SIGPLAN, p. 232 (2020)","DOI":"10.1145\/3332466.3374527"},{"key":"851_CR67","doi-asserted-by":"crossref","unstructured":"Sommer, C.: Shortest-path queries in static networks. CSU 46(4), 1 (2014)","DOI":"10.1145\/2530531"},{"issue":"4","key":"851_CR68","first-page":"121","volume":"19","author":"A Soofi","year":"2020","unstructured":"Soofi, A., Taghizadeh, M., Tabatabaei, S.M., Tavirani, M.R., Shakib, H., Namaki, S., Alighiarloo, N.S.: Centrality analysis of protein-protein interaction networks and molecular docking prioritize potential drug-targets in type 1 diabetes. IJPR 19(4), 121 (2020)","journal-title":"IJPR"},{"key":"851_CR69","doi-asserted-by":"crossref","unstructured":"Sun, B., Chan, T.H.H., Sozio, M.: Fully dynamic approximate k-core decomposition in hypergraphs. TKDD 14(4) (2020)","DOI":"10.1145\/3385416"},{"key":"851_CR70","doi-asserted-by":"crossref","unstructured":"Tan, H.K., Ngo, C.W., Wu, X.: Modeling video hyperlinks with hypergraph for web video reranking. In: MM, p. 659 (2008)","DOI":"10.1145\/1459359.1459453"},{"key":"851_CR71","doi-asserted-by":"crossref","unstructured":"Tan, S., Guan, Z., Cai, D., Qin, X., Bu, J., Chen, C.: Mapping users across networks by manifold alignment on hypergraph. AAAI 28(1) (2014)","DOI":"10.1609\/aaai.v28i1.8720"},{"issue":"2","key":"851_CR72","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Van Leeuwen, J.: Worst-case analysis of set union algorithms. JACM 31(2), 245 (1984)","journal-title":"JACM"},{"key":"851_CR73","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. JACM 52(1), 1 (2005)","DOI":"10.1145\/1044731.1044732"},{"issue":"8","key":"851_CR74","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1057\/jors.2014.103","volume":"66","author":"C Tofallis","year":"2015","unstructured":"Tofallis, C.: A better measure of relative prediction accuracy for model selection and model estimation. J. Oper. Res. Soc. 66(8), 1352 (2015)","journal-title":"J. Oper. Res. Soc."},{"key":"851_CR75","doi-asserted-by":"crossref","unstructured":"Tretyakov, K., Armas-Cervantes, A., Garc\u00eda-Ba\u00f1uelos, L., Vilo, J., Dumas, M.: Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In: CIKM, p. 1785 (2011)","DOI":"10.1145\/2063576.2063834"},{"issue":"1","key":"851_CR76","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-021-04342-x","volume":"22","author":"A Viacava Follis","year":"2021","unstructured":"Viacava Follis, A.: Centrality of drug targets in protein networks. BMC Bioinform. 22(1), 1 (2021)","journal-title":"BMC Bioinform."},{"key":"851_CR77","doi-asserted-by":"crossref","unstructured":"Vieira, M.V., Fonseca, B.M., Damazio, R., Golgher, P.B., Reis, D.d.C., Ribeiro-Neto, B.: Efficient search ranking in social networks. In: CIKM, p. 563 (2007)","DOI":"10.1145\/1321440.1321520"},{"key":"851_CR78","doi-asserted-by":"crossref","unstructured":"Xu, Q., Zhang, X., Zhao, J., Wang, X., Wolf, T.: Fast shortest-path queries on large-scale graphs. In: ICNP, p. 1 (2016)","DOI":"10.1109\/ICNP.2016.7784419"},{"key":"851_CR79","doi-asserted-by":"crossref","unstructured":"Yang, D., Qu, B., Yang, J., Cudre-Mauroux, P.: Revisiting user mobility and social relationships in lbsns: A hypergraph embedding approach. In: WWW, p. 2147 (2019)","DOI":"10.1145\/3308558.3313635"},{"key":"851_CR80","doi-asserted-by":"crossref","unstructured":"Zhang, M., Cui, Z., Jiang, S., Chen, Y.: Beyond link prediction: Predicting hyperlinks in adjacency space. AAAI 32(1) (2018)","DOI":"10.1609\/aaai.v32i1.11780"},{"key":"851_CR81","doi-asserted-by":"crossref","unstructured":"Zheng, X., Luo, Y., Sun, L., Ding, X., Zhang, J.: A novel social network hybrid recommender system based on hypergraph topologic structure. WWW, p. 985 (2018)","DOI":"10.1007\/s11280-017-0494-5"},{"key":"851_CR82","doi-asserted-by":"crossref","unstructured":"Zheng, X., Luo, Y., Sun, L., Ding, X., Zhang, J.: A novel social network hybrid recommender system based on hypergraph topologic structure. WWW, p. 985 (2018)","DOI":"10.1007\/s11280-017-0494-5"},{"key":"851_CR83","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Guan, Z., Tan, S., Liu, H., Cai, D., He, X.: Heterogeneous hypergraph embedding for document recommendation. Neurocomputing 216, 150 (2016)","DOI":"10.1016\/j.neucom.2016.07.030"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00851-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00851-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00851-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T11:07:57Z","timestamp":1731755277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00851-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,19]]},"references-count":83,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["851"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00851-2","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,19]]},"assertion":[{"value":"5 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}