{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:27:34Z","timestamp":1725870454304},"reference-count":91,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2020R1C1C1008296"],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["2019-0-00075","2022-0-00871"],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10618-023-00956-2","type":"journal-article","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T17:01:42Z","timestamp":1691514102000},"page":"2389-2437","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications"],"prefix":"10.1007","volume":"37","author":[{"given":"Fanchen","family":"Bu","sequence":"first","affiliation":[]},{"given":"Geon","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,8]]},"reference":[{"issue":"4","key":"956_CR1","doi-asserted-by":"publisher","first-page":"046","DOI":"10.1103\/PhysRevE.64.046135","volume":"64","author":"LA Adamic","year":"2001","unstructured":"Adamic LA, Lukose RM, Puniyani AR et al. (2001) Search in power-law networks. Phys Rev E 64(4):046\u2013135","journal-title":"Phys Rev E"},{"issue":"1","key":"956_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47","journal-title":"Rev Mod Phys"},{"key":"956_CR3","unstructured":"Alvarez-Hamelin JI, Dall\u2019Asta L, Barrat A, et al. (2006) Large scale networks fingerprinting and visualization using the k-core decomposition. In: NeurIPS"},{"issue":"2","key":"956_CR4","doi-asserted-by":"publisher","first-page":"371","DOI":"10.3934\/nhm.2008.3.371","volume":"3","author":"JI Alvarez-Hamelin","year":"2008","unstructured":"Alvarez-Hamelin JI, Dall\u2019Asta L, Barrat A et al. (2008) K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases. Netw Heterog Media 3(2):371","journal-title":"Netw Heterog Media"},{"issue":"7","key":"956_CR5","doi-asserted-by":"publisher","first-page":"796","DOI":"10.3390\/e23070796","volume":"23","author":"A Antelmi","year":"2021","unstructured":"Antelmi A, Cordasco G, Spagnuolo C et al. (2021) Social influence maximization in hypergraphs. Entropy 23(7):796","journal-title":"Entropy"},{"key":"956_CR6","doi-asserted-by":"crossref","unstructured":"Arafat NA, Khan A, Rai AK, et al. (2023) Neighborhood-based hypergraph core decomposition. PVLDB 16","DOI":"10.14778\/3598581.3598582"},{"key":"956_CR7","unstructured":"Arya D, Gupta DK, Rudinac S, et al. (2020) Hypersage: Generalizing inductive representation learning on hypergraphs. arXiv preprint arXiv:2010.04558"},{"issue":"107","key":"956_CR8","first-page":"637","volume":"110","author":"S Bai","year":"2021","unstructured":"Bai S, Zhang F, Torr PH (2021) Hypergraph convolution and hypergraph attention. Pattern Recogn 110(107):637","journal-title":"Pattern Recogn"},{"key":"956_CR9","unstructured":"Batagelj V, Zaversnik M (2003) An $$o(m)$$ algorithm for cores decomposition of networks. In: arXiv"},{"issue":"2","key":"956_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1137\/18M1203031","volume":"1","author":"AR Benson","year":"2019","unstructured":"Benson AR (2019) Three hypergraph eigenvector centralities. SIAM J Math Data Sci 1(2):293\u2013312","journal-title":"SIAM J Math Data Sci"},{"issue":"48","key":"956_CR11","doi-asserted-by":"publisher","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson AR, Abebe R, Schaub MT et al. (2018) Simplicial closure and higher-order link prediction. PNAS 115(48):E11221\u2013E11230","journal-title":"PNAS"},{"key":"956_CR12","doi-asserted-by":"crossref","unstructured":"Benson AR, Kumar R, Tomkins A (2018b) Sequences of sets. In: KDD","DOI":"10.1145\/3219819.3220100"},{"issue":"1","key":"956_CR13","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/s10791-011-9172-x","volume":"15","author":"R Blanco","year":"2012","unstructured":"Blanco R, Lioma C (2012) Graph-based term weighting for information retrieval. Inf Retr 15(1):54\u201392","journal-title":"Inf Retr"},{"issue":"4","key":"956_CR14","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s11538-016-0158-0","volume":"78","author":"\u00c1 Bod\u00f3","year":"2016","unstructured":"Bod\u00f3 \u00c1, Katona GY, Simon PL (2016) Sis epidemic propagation on hypergraphs. Bull Math Biol 78(4):713\u2013735","journal-title":"Bull Math Biol"},{"issue":"3","key":"956_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0378-8733(01)00038-7","volume":"23","author":"P Bonacich","year":"2001","unstructured":"Bonacich P, Lloyd P (2001) Eigenvector-like measures of centrality for asymmetric relations. Social Netw 23(3):191\u2013201","journal-title":"Social Netw"},{"key":"956_CR16","doi-asserted-by":"crossref","unstructured":"Bonchi F, Khan A, Severini L (2019) Distance-generalized core decomposition. In: SIGMOD","DOI":"10.1145\/3299869.3324962"},{"key":"956_CR17","unstructured":"Bu F, Lee G, Shin K (2023) Code, datasets, and supplementary materials. https:\/\/github.com\/bokveizen\/non-fragile-hypercore"},{"key":"956_CR18","volume-title":"Graph-based knowledge representation: computational foundations of conceptual graphs","author":"M Chein","year":"2008","unstructured":"Chein M, Mugnier ML (2008) Graph-based knowledge representation: computational foundations of conceptual graphs. Springer"},{"key":"956_CR19","unstructured":"Chen Z, Yuan L, Han L, et al. (2021) Higher-order truss decomposition in graphs. In: TKDE"},{"key":"956_CR20","unstructured":"Chien E, Pan C, Peng J, et al. (2021) You are allset: a multiset function framework for hypergraph neural networks. arXiv preprint arXiv:2106.13264"},{"issue":"12","key":"956_CR21","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0112606","volume":"9","author":"B Corominas-Murtra","year":"2014","unstructured":"Corominas-Murtra B, Fuchs B, Thurner S (2014) Detection of the elite structure in a virtual multiplex social system by means of a generalised k-core. PLoS ONE 9(12):e11,2606","journal-title":"PLoS ONE"},{"key":"956_CR22","doi-asserted-by":"crossref","unstructured":"Cui H, Lu Z, Li P, et al. (2022) On positional and structural node features for graph neural networks on non-attributed graphs. In: CIKM","DOI":"10.1145\/3511808.3557661"},{"key":"956_CR23","doi-asserted-by":"crossref","unstructured":"Dai Q, Li RH, Qin L, et al. (2021) Scaling up distance-generalized core decomposition. In: CIKM","DOI":"10.1145\/3459637.3482294"},{"key":"956_CR24","doi-asserted-by":"crossref","unstructured":"Debnath S, Ganguly N, Mitra P (2008) Feature weighting in content based recommendation system using social network analysis. In: WWW","DOI":"10.1145\/1367497.1367646"},{"key":"956_CR25","doi-asserted-by":"crossref","unstructured":"Do MT, Yoon Se, Hooi B, et al. (2020) Structural patterns and generative models of real-world hypergraphs. In: KDD","DOI":"10.1145\/3394486.3403060"},{"key":"956_CR26","doi-asserted-by":"crossref","unstructured":"Feng Y, You H, Zhang Z, et al. (2019) Hypergraph neural networks. In: AAAI","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"956_CR27","doi-asserted-by":"crossref","unstructured":"Gabert K, Pinar A, \u00c7ataly\u00fcrek \u00dcV (2021a) Shared-memory scalable k-core maintenance on dynamic graphs and hypergraphs. In: IPDPSW","DOI":"10.1109\/IPDPSW52791.2021.00158"},{"key":"956_CR28","doi-asserted-by":"crossref","unstructured":"Gabert K, Pinar A, \u00c7ataly\u00fcrek \u00dcV (2021b) A unifying framework to identify dense subgraphs on streams: Graph nuclei to hypergraph cores. In: WSDM","DOI":"10.1145\/3437963.3441790"},{"key":"956_CR29","doi-asserted-by":"crossref","unstructured":"Gao Y, Feng Y, Ji S, et al. (2022) Hgnn$$^{+}$$: General hypergraph neural networks. IEEE Transactions on Pattern Analysis and Machine Intelligence","DOI":"10.1109\/TPAMI.2022.3182052"},{"key":"956_CR30","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"956_CR31","doi-asserted-by":"crossref","unstructured":"Han Z, Zheng X, Chen C, et al. (2023) Intra and inter domain hypergraph convolutional network for cross-domain recommendation. In: WWW","DOI":"10.1145\/3543507.3583402"},{"key":"956_CR32","unstructured":"He T, Ong YS, Bai L (2021) Learning conjoint attentions for graph neural nets. In: NeurIPS"},{"key":"956_CR33","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1109\/TPDS.2023.3236669","volume":"34","author":"QS Hua","year":"2023","unstructured":"Hua QS, Zhang X, Jin H et al. (2023) Revisiting core maintenance for dynamic hypergraphs. IEEE Trans Parallel Distrib Syst 34:981\u2013994","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"956_CR34","doi-asserted-by":"crossref","unstructured":"Huang J, Yang J (2021) Unignn: a unified framework for graph and hypergraph neural networks. arXiv preprint arXiv:2105.00956","DOI":"10.24963\/ijcai.2021\/353"},{"key":"956_CR35","doi-asserted-by":"crossref","unstructured":"Jiang J, Wei Y, Feng Y, et al. (2019) Dynamic hypergraph neural networks. In: IJCAI","DOI":"10.24963\/ijcai.2019\/366"},{"key":"956_CR36","doi-asserted-by":"crossref","unstructured":"Kim H, Ko J, Bu F, et al. (2023) Characterization of simplicial complexes by counting simplets beyond four nodes. In: WWW","DOI":"10.1145\/3543507.3583332"},{"key":"956_CR37","doi-asserted-by":"crossref","unstructured":"Kim J, Oh S, Cho S, et al. (2022) Equivariant hypergraph neural networks. In: ECCV","DOI":"10.1007\/978-3-031-19803-8_6"},{"issue":"11","key":"956_CR38","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S et al. (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893","journal-title":"Nat Phys"},{"issue":"11","key":"956_CR39","first-page":"2883","volume":"64","author":"J Ko","year":"2022","unstructured":"Ko J, Kook Y, Shin K (2022) Growth patterns and models of real-world hypergraphs. KAIS 64(11):2883\u20132920","journal-title":"KAIS"},{"issue":"1\u20133","key":"956_CR40","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0012-365X(00)00290-9","volume":"235","author":"EV Konstantinova","year":"2001","unstructured":"Konstantinova EV, Skorobogatov VA (2001) Application of hypergraph theory in chemistry. Discret Math 235(1\u20133):365\u2013383","journal-title":"Discret Math"},{"key":"956_CR41","doi-asserted-by":"crossref","unstructured":"Lee D, Shin K (2023) I\u2019m me, we\u2019re us, and i\u2019m us: Tri-directional contrastive learning on hypergraphs. In: AAAI","DOI":"10.1609\/aaai.v37i7.26019"},{"key":"956_CR42","doi-asserted-by":"crossref","unstructured":"Lee G, Shin K (2021) Thyme+: Temporal hypergraph motifs and fast algorithms for exact counting. In: ICDM","DOI":"10.1109\/ICDM51629.2021.00042"},{"issue":"11","key":"956_CR43","first-page":"2256","volume":"13","author":"G Lee","year":"2020","unstructured":"Lee G, Ko J, Shin K (2020) Hypergraph motifs: concepts, algorithms, and discoveries. PVLDB 13(11):2256\u20132269","journal-title":"PVLDB"},{"key":"956_CR44","doi-asserted-by":"crossref","unstructured":"Lee G, Choe M, Shin K (2021) How do hyperedges overlap in real-world hypergraphs? - patterns, measures, and generators. In: WWW","DOI":"10.1145\/3442381.3450010"},{"key":"956_CR45","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: Densification and shrinking diameters. TKDD 1(1):2\u2013es","DOI":"10.1145\/1217299.1217301"},{"key":"956_CR91","doi-asserted-by":"crossref","unstructured":"Li P, Wang H, Li K, et al. (2023) Influence without authority: Maximizing information coverage in hypergraphs. In: SDM","DOI":"10.1137\/1.9781611977653.ch2"},{"key":"956_CR46","doi-asserted-by":"crossref","unstructured":"Liao X, Xu Y, Ling H (2021) Hypergraph neural networks for hypergraph matching. In: ICCV","DOI":"10.1109\/ICCV48922.2021.00130"},{"key":"956_CR47","doi-asserted-by":"crossref","unstructured":"Limnios S, Dasoulas G, Thilikos DM, et al. (2021) Hcore-init: Neural network initialization based on graph degeneracy. In: ICPR","DOI":"10.1109\/ICPR48806.2021.9412940"},{"issue":"5","key":"956_CR48","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s00778-020-00606-9","volume":"29","author":"B Liu","year":"2020","unstructured":"Liu B, Yuan L, Lin X et al. (2020) Efficient ($$\\alpha$$, $$\\beta$$)-core computation in bipartite graphs. VLDB J 29(5):1075\u20131099","journal-title":"VLDB J"},{"issue":"1","key":"956_CR49","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1038\/s42005-022-00858-7","volume":"5","author":"QF Lotito","year":"2022","unstructured":"Lotito QF, Musciotto F, Montresor A et al. (2022) Higher-order motif analysis in hypergraphs. Commun Phys 5(1):79","journal-title":"Commun Phys"},{"key":"956_CR50","doi-asserted-by":"crossref","unstructured":"Lu Z, Zhu Y, Zhong M, et al. (2022) On time-optimal (k, p)-core community search in dynamic graphs. In: ICDE","DOI":"10.1109\/ICDE53745.2022.00109"},{"key":"956_CR51","doi-asserted-by":"crossref","unstructured":"Luo F, Li B, Wan XF, et al. (2009) Core and periphery structures in protein interaction networks. In: BMC bioinformatics","DOI":"10.1186\/1471-2105-10-S4-S8"},{"key":"956_CR52","doi-asserted-by":"crossref","unstructured":"Luo Q, Yu D, Cai Z, et al. (2021) Hypercore maintenance in dynamic hypergraphs. In: ICDE","DOI":"10.1109\/ICDE51399.2021.00199"},{"key":"956_CR53","first-page":"1","volume":"32","author":"Q Luo","year":"2022","unstructured":"Luo Q, Yu D, Cai Z et al. (2022) Toward maintenance of hypercores in large-scale dynamic hypergraphs. VLDB J 32:1\u201318","journal-title":"VLDB J"},{"key":"956_CR54","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00778-019-00587-4","volume":"29","author":"FD Malliaros","year":"2020","unstructured":"Malliaros FD, Giatsidis C, Papadopoulos AN et al. (2020) The core decomposition of networks: theory, algorithms and applications. VLDB J 29:61\u201392","journal-title":"VLDB J"},{"issue":"9","key":"956_CR55","doi-asserted-by":"publisher","first-page":"e0136497","DOI":"10.1371\/journal.pone.0136497","volume":"10","author":"R Mastrandrea","year":"2015","unstructured":"Mastrandrea R, Fournet J, Barrat A (2015) Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PloS one 10(9):e0136497","journal-title":"PloS one"},{"key":"956_CR56","doi-asserted-by":"crossref","unstructured":"McGlohon M, Akoglu L, Faloutsos C (2008) Weighted graphs and disconnected components: patterns and a generator. In: KDD","DOI":"10.1145\/1401890.1401955"},{"key":"956_CR57","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976247","volume-title":"Graph-based Natural Language Processing and Information Retrieval","author":"R Mihalcea","year":"2011","unstructured":"Mihalcea R, Radev D (2011) Graph-based Natural Language Processing and Information Retrieval. Cambridge University Press"},{"key":"956_CR58","unstructured":"Peng C, Kolda TG, Pinar A (2014) Accelerating community detection by using k-core subgraphs. In: arXiv"},{"key":"956_CR59","doi-asserted-by":"crossref","unstructured":"Peng Y, Zhang Y, Zhang W, et al. (2018) Efficient probabilistic k-core computation on uncertain graphs. In: ICDE","DOI":"10.1109\/ICDE.2018.00110"},{"key":"956_CR60","doi-asserted-by":"crossref","unstructured":"Preti G, De\u00a0Francisci\u00a0Morales G, Bonchi F (2021) Strud: Truss decomposition of simplicial complexes. In: WWW","DOI":"10.1145\/3442381.3450073"},{"issue":"9","key":"956_CR61","doi-asserted-by":"publisher","first-page":"2784","DOI":"10.3390\/s18092784","volume":"18","author":"C Qu","year":"2018","unstructured":"Qu C, Tao M, Yuan R (2018) A hypergraph-based blockchain model and application in internet of things-enabled smart homes. Sensors 18(9):2784","journal-title":"Sensors"},{"key":"956_CR62","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00116251","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan JR (1986) Induction of decision trees. Mach Learn 1:81\u2013106","journal-title":"Mach Learn"},{"key":"956_CR63","doi-asserted-by":"crossref","unstructured":"Rossi MEG, Malliaros FD, Vazirgiannis M (2015) Spread it good, spread it fast: Identification of influential nodes in social networks. In: WWW","DOI":"10.1145\/2740908.2742736"},{"key":"956_CR64","doi-asserted-by":"crossref","unstructured":"Sar\u0131y\u00fcce AE, Pinar A (2018) Peeling bipartite networks for dense subgraph discovery. In: WSDM","DOI":"10.1145\/3159652.3159678"},{"issue":"3","key":"956_CR65","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Social Netw 5(3):269\u2013287","journal-title":"Social Netw"},{"issue":"3","key":"956_CR66","first-page":"677","volume":"54","author":"K Shin","year":"2018","unstructured":"Shin K, Eliassi-Rad T, Faloutsos C (2018) Patterns and anomalies in k-cores of real-world graphs with applications. KAIS 54(3):677\u2013710","journal-title":"KAIS"},{"issue":"3","key":"956_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154414","volume":"12","author":"K Shin","year":"2018","unstructured":"Shin K, Hooi B, Faloutsos C (2018) Fast, accurate, and flexible algorithms for dense subtensor mining. TKDD 12(3):1\u201330","journal-title":"TKDD"},{"key":"956_CR68","doi-asserted-by":"crossref","unstructured":"Silva NB, Tsang R, Cavalcanti GD, et al. (2010) A graph-based friend recommendation system using genetic algorithm. In: CEC","DOI":"10.1109\/CEC.2010.5586144"},{"key":"956_CR69","doi-asserted-by":"crossref","unstructured":"Sinha A, Shen Z, Song Y, et al. (2015) An overview of microsoft academic service (mas) and applications. In: WWW","DOI":"10.1145\/2740908.2742839"},{"issue":"4","key":"956_CR70","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3385416","volume":"14","author":"B Sun","year":"2020","unstructured":"Sun B, Chan THH, Sozio M (2020) Fully dynamic approximate k-core decomposition in hypergraphs. TKDD 14(4):1\u201321","journal-title":"TKDD"},{"key":"956_CR71","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1137\/20M1355896","volume":"63","author":"L Torres","year":"2021","unstructured":"Torres L, Blevins AS, Bassett DS et al. (2021) The why, how, and when of representations for complex systems. SIAM Rev 63:435\u2013485","journal-title":"SIAM Rev"},{"issue":"1","key":"956_CR72","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s42005-020-00504-0","volume":"4","author":"F Tudisco","year":"2021","unstructured":"Tudisco F, Higham DJ (2021) Node and edge nonlinear eigenvector centrality for hypergraphs. Commun Phys 4(1):1\u201310","journal-title":"Commun Phys"},{"key":"956_CR73","doi-asserted-by":"crossref","unstructured":"Victor F, Akcora CG, Gel YR, et al. (2021) Alphacore: data depth based core decomposition. In: KDD","DOI":"10.1145\/3447548.3467322"},{"key":"956_CR74","unstructured":"Vogiatzis D (2013) Influence study on hyper-graphs. In: AAAI Symposia"},{"key":"956_CR75","doi-asserted-by":"crossref","unstructured":"Wang K, Cao X, Lin X, et al. (2018) Efficient computing of radius-bounded k-cores. In: ICDE","DOI":"10.1109\/ICDE.2018.00030"},{"issue":"6684","key":"956_CR76","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"issue":"1","key":"956_CR77","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13408-015-0027-4","volume":"5","author":"CI Wood","year":"2015","unstructured":"Wood CI, Hicks IV (2015) The minimal k-core problem for modeling k-assemblies. J Math Neurosci 5(1):1\u201319","journal-title":"J Math Neurosci"},{"key":"956_CR78","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ins.2022.12.075","volume":"624","author":"T Wu","year":"2023","unstructured":"Wu T, Ling Q (2023) Self-supervised heterogeneous hypergraph network for knowledge tracing. Inf Sci 624:200\u2013216","journal-title":"Inf Sci"},{"key":"956_CR79","doi-asserted-by":"crossref","unstructured":"Xia L, Huang C, Xu Y, et al. (2022) Hypergraph contrastive collaborative filtering. In: SIGIR","DOI":"10.1145\/3477495.3532058"},{"issue":"2","key":"956_CR90","doi-asserted-by":"publisher","first-page":"103161","DOI":"10.1016\/j.ipm.2022.103161","volume":"60","author":"Ming Xie","year":"2023","unstructured":"Xie M, Zhan X, Liu C, et al.\u00a0(2023)\u00a0An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs. Inf Process Manage 60(2):103161","journal-title":"Information Processing & Management"},{"key":"956_CR80","doi-asserted-by":"crossref","unstructured":"Yang C, Wang R, Yao S, et al. (2022) Semi-supervised hypergraph node classification on hypergraph line expansion. In: CIKM","DOI":"10.1145\/3511808.3557447"},{"key":"956_CR81","doi-asserted-by":"crossref","unstructured":"Yin H, Benson AR, Leskovec J, et al. (2017) Local higher-order graph clustering. In: KDD","DOI":"10.1145\/3097983.3098069"},{"key":"956_CR82","doi-asserted-by":"crossref","unstructured":"Zhang C, Zhang F, Zhang W, et al. (2020) Exploring finer granularity within the cores: efficient (k, p)-core computation. In: ICDE","DOI":"10.1109\/ICDE48307.2020.00023"},{"key":"956_CR83","doi-asserted-by":"crossref","unstructured":"Zhang F, Zhang Y, Qin L, et al. (2017a) Finding critical users for social network engagement: the collapsed k-core problem. In: AAAI","DOI":"10.1609\/aaai.v31i1.10482"},{"key":"956_CR84","doi-asserted-by":"crossref","unstructured":"Zhang F, Zhang Y, Qin L, et al. (2017b) When engagement meets similarity: efficient (k, r)-core computation on social networks. In: PVLDB","DOI":"10.14778\/3115404.3115406"},{"key":"956_CR85","doi-asserted-by":"crossref","unstructured":"Zhang Y, Parthasarathy S (2012) Extracting analyzing and visualizing triangle k-core motifs within networks. In: ICDE","DOI":"10.1109\/ICDE.2012.35"},{"issue":"4","key":"956_CR86","first-page":"801","volume":"6","author":"J Zhu","year":"2018","unstructured":"Zhu J, Zhu J, Ghosh S et al. (2018) Social influence maximization in hypergraph in social networks. TNSE 6(4):801\u2013811","journal-title":"TNSE"},{"key":"956_CR87","doi-asserted-by":"crossref","unstructured":"Zhu W, Chen C, Wang X, et al. (2018b) K-core minimization: an edge manipulation approach. In: CIKM","DOI":"10.1145\/3269206.3269254"},{"key":"956_CR88","doi-asserted-by":"crossref","unstructured":"Zhu W, Zhang M, Chen C, et al. (2019) Pivotal relationship identification: the k-truss minimization problem. In: IJCAI","DOI":"10.24963\/ijcai.2019\/677"},{"issue":"9","key":"956_CR89","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1109\/43.784130","volume":"18","author":"JY Zien","year":"1999","unstructured":"Zien JY, Schlag MD, Chan PK (1999) Multilevel spectral hypergraph partitioning with arbitrary vertex sizes. IEEE Trans Comput Aided Des Integr Circuits Syst 18(9):1389\u20131399","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00956-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-023-00956-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00956-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T09:23:08Z","timestamp":1697188988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-023-00956-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,8]]},"references-count":91,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["956"],"URL":"https:\/\/doi.org\/10.1007\/s10618-023-00956-2","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,8]]},"assertion":[{"value":"8 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2023","order":3,"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 interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}