{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T06:49:47Z","timestamp":1782370187941,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Institute of Information & communications Technology Planning & Evaluation(IITP)","award":["Korea government (MSIT) (No. 2020-0-01336)"],"award-info":[{"award-number":["Korea government (MSIT) (No. 2020-0-01336)"]}]},{"name":"The Settlement Research Fund UNIST(Ulsan National Institute of Science & Technology)","award":["1.220138.01"],"award-info":[{"award-number":["1.220138.01"]}]},{"name":"National Research Foundation of Korea (NRF)","award":["Korea government (MSIT) (No. RS-2023-00214065)"],"award-info":[{"award-number":["Korea government (MSIT) (No. RS-2023-00214065)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3615275","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:42Z","timestamp":1697874342000},"page":"4013-4017","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core Approach"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9239-7396","authenticated-orcid":false,"given":"Dahee","family":"Kim","sequence":"first","affiliation":[{"name":"Ulsan National Institute of Science & Technology, Ulsan, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4905-2704","authenticated-orcid":false,"given":"Junghoon","family":"Kim","sequence":"additional","affiliation":[{"name":"Ulsan National Institute of Science & Technology, Ulsan, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5924-3398","authenticated-orcid":false,"given":"Sungsu","family":"Lim","sequence":"additional","affiliation":[{"name":"Chungnam National University, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9230-7244","authenticated-orcid":false,"given":"Hyun Ji","family":"Jeong","sequence":"additional","affiliation":[{"name":"Kongju National University, Cheonan, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23--27, 2013, Proceedings, Part I 13","author":"Adiga Abhijin","year":"2013","unstructured":"Abhijin Adiga and Anil Kumar S Vullikanti . 2013 . How robust is the core of a network? . In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23--27, 2013, Proceedings, Part I 13 . Springer, 541--556. Abhijin Adiga and Anil Kumar S Vullikanti. 2013. How robust is the core of a network?. In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23--27, 2013, Proceedings, Part I 13. Springer, 541--556."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3598581.3598582"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.20429\/tag.2015.020205"},{"key":"e_1_3_2_1_4_1","volume-title":"An o (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik . 2003. An o (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 ( 2003 ). Vladimir Batagelj and Matjaz Zaversnik. 2003. An o (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-010-0079-y"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"e_1_3_2_1_7_1","volume-title":"Hypergraphs: combinatorics of finite sets","author":"Berge Claude","unstructured":"Claude Berge . 1984. Hypergraphs: combinatorics of finite sets . Vol. 45 . Elsevier . Claude Berge. 1984. Hypergraphs: combinatorics of finite sets. Vol. 45. Elsevier."},{"key":"e_1_3_2_1_8_1","volume-title":"Empirical analysis of predictive algorithms for collaborative filtering. arXiv preprint arXiv:1301.7363","author":"Breese John S","year":"2013","unstructured":"John S Breese , David Heckerman , and Carl Kadie . 2013. Empirical analysis of predictive algorithms for collaborative filtering. arXiv preprint arXiv:1301.7363 ( 2013 ). John S Breese, David Heckerman, and Carl Kadie. 2013. Empirical analysis of predictive algorithms for collaborative filtering. arXiv preprint arXiv:1301.7363 (2013)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133130"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Song Feng Emily Heath Brett Jefferson Cliff Joslyn Henry Kvinge Hugh D Mitchell Brenda Praggastis Amie J Eisfeld Amy C Sims Larissa B Thackray etal 2021. Hypergraph models of biological networks to identify genes critical to pathogenic viral response. BMC bioinformatics 22 1 (2021) 1--21.  Song Feng Emily Heath Brett Jefferson Cliff Joslyn Henry Kvinge Hugh D Mitchell Brenda Praggastis Amie J Eisfeld Amy C Sims Larissa B Thackray et al. 2021. Hypergraph models of biological networks to identify genes critical to pathogenic viral response. BMC bioinformatics 22 1 (2021) 1--21.","DOI":"10.1186\/s12859-021-04197-2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.65"},{"key":"e_1_3_2_1_15_1","unstructured":"RL Graham M Gr\u00f6tschel and L Lov\u00e1sz. 1996. Handbook of combinatorics (vol. .  RL Graham M Gr\u00f6tschel and L Lov\u00e1sz. 1996. Handbook of combinatorics (vol. ."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.33"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3547305.3547318"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.06.020"},{"key":"e_1_3_2_1_20_1","volume-title":"Identification of influential spreaders in complex networks. Nature physics 6, 11","author":"Kitsak Maksim","year":"2010","unstructured":"Maksim Kitsak , Lazaros K Gallos , Shlomo Havlin , Fredrik Liljeros , Lev Muchnik , H Eugene Stanley , and Hern\u00e1n A Makse . 2010. Identification of influential spreaders in complex networks. Nature physics 6, 11 ( 2010 ), 888--893. Maksim Kitsak, Lazaros K Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H Eugene Stanley, and Hern\u00e1n A Makse. 2010. Identification of influential spreaders in complex networks. Nature physics 6, 11 (2010), 888--893."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394231.3397903"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557505"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2023.113645"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-018-2908-2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00199"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"key":"e_1_3_2_1_27_1","volume-title":"Network structure and minimum degree. Social networks 5, 3","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman . 1983. Network structure and minimum degree. Social networks 5, 3 ( 1983 ), 269--287. Stephen B Seidman. 1983. Network structure and minimum degree. Social networks 5, 3 (1983), 269--287."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-20891-1_21"},{"key":"e_1_3_2_1_29_1","unstructured":"Douglas Brent West etal 2001. Introduction to graph theory. Vol. 2. Prentice hall Upper Saddle River.  Douglas Brent West et al. 2001. Introduction to graph theory. Vol. 2. Prentice hall Upper Saddle River."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16578"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449844"}],"event":{"name":"CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management","location":"Birmingham United Kingdom","acronym":"CIKM '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3615275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3615275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:58Z","timestamp":1750178218000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3615275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":30,"alternative-id":["10.1145\/3583780.3615275","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3615275","relation":{},"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"2023-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}