{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:47:25Z","timestamp":1765500445573,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","funder":[{"name":"National Research Foundation of Korea","award":["RS-2025-00523578"],"award-info":[{"award-number":["RS-2025-00523578"]}]},{"name":"Institute of Information & communications Technology Planning & Evaluation","award":["2020-0-01336"],"award-info":[{"award-number":["2020-0-01336"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,10]]},"DOI":"10.1145\/3746252.3760845","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T18:37:32Z","timestamp":1762799852000},"page":"4879-4883","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["When User Engagement Meets Structural Cohesiveness: A Decay-Driven Approach to Hypergraph Cores"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6034-0949","authenticated-orcid":false,"given":"Hyewon","family":"Kim","sequence":"first","affiliation":[{"name":"Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1440-0016","authenticated-orcid":false,"given":"Minseok","family":"Kim","sequence":"additional","affiliation":[{"name":"Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9239-7396","authenticated-orcid":false,"given":"Dahee","family":"Kim","sequence":"additional","affiliation":[{"name":"Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4905-2704","authenticated-orcid":false,"given":"Junghoon","family":"Kim","sequence":"additional","affiliation":[{"name":"Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.14778\/3598581.3598582"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/s11634-010-0079-y"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/3159652.3159702"},{"key":"e_1_3_2_1_4_1","first-page":"209","article-title":"Hypergraph theory. An introduction","volume":"1","author":"Bretto Alain","year":"2013","unstructured":"Alain Bretto. 2013. Hypergraph theory. An introduction. Mathematical Engineering. Cham: Springer, Vol. 1 (2013), 209-216.","journal-title":"Mathematical Engineering. Cham: Springer"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/s10618-023-00956-2"},{"key":"e_1_3_2_1_6_1","volume-title":"International conference on artificial intelligence and statistics. Proceedings of Machine Learning Research, 871-879","author":"Chien I","year":"2018","unstructured":"I Chien, Chung-Yi Lin, and I-Hsiang Wang. 2018. Community detection in hypergraphs: Optimal statistical limit and efficient algorithms. In International conference on artificial intelligence and statistics. Proceedings of Machine Learning Research, 871-879."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/2020408.2020579"},{"key":"e_1_3_2_1_8_1","volume-title":"Benson","author":"Chodrow Philip S.","year":"2021","unstructured":"Philip S. Chodrow, Nate Veldt, and Austin R. Benson. 2021. Generative hypergraph clustering: From blockmodels to modularity. Science Advances, Vol. 7, 28 (2021), eabh1303."},{"key":"e_1_3_2_1_9_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. National security agency technical report","author":"Cohen Jonathan","year":"2008","unstructured":"Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, Vol. 16, 3.1 (2008), 1-29."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/3132847.3133130"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1016\/0047-2484(92)90081-J"},{"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 et al. 2021. Hypergraph models of biological networks to identify genes critical to pathogenic viral response. BMC bioinformatics Vol. 22 1 (2021) 287.","key":"e_1_3_2_1_12_1","DOI":"10.1186\/s12859-021-04197-2"},{"key":"e_1_3_2_1_13_1","first-page":"456","volume-title":"Connecting the Congress: A Study of Cosponsorship Networks. Political Analysis","volume":"14","author":"Fowler James H.","year":"2006","unstructured":"James H. Fowler. 2006a. Connecting the Congress: A Study of Cosponsorship Networks. Political Analysis, Vol. 14, 04 (2006), 456-487."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1016\/j.socnet.2005.11.003"},{"key":"e_1_3_2_1_15_1","article-title":"Hypergraph Artificial Benchmark for Community Detection (h-ABCD)","volume":"11","author":"Kami'nski Bogumi\u0142","year":"2023","unstructured":"Bogumi\u0142 Kami'nski, Pawe\u0142 Pra\u0142at, and Fran\u00e7ois Th\u00e9berge. 2023. Hypergraph Artificial Benchmark for Community Detection (h-ABCD). Journal of Complex Networks, Vol. 11, 4 (2023).","journal-title":"Journal of Complex Networks"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/3583780.3615275"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/j.ins.2024.120664"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/3637528.3671457"},{"key":"e_1_3_2_1_19_1","volume-title":"A guide to conquer the biological network era using graph theory. Frontiers in bioengineering and biotechnology","author":"Koutrouli Mikaela","year":"2020","unstructured":"Mikaela Koutrouli, Evangelos Karatzas, David Paez-Espino, and Georgios A Pavlopoulos. 2020. A guide to conquer the biological network era using graph theory. Frontiers in bioengineering and biotechnology, Vol. 8 (2020), 34."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/3719002"},{"key":"e_1_3_2_1_21_1","first-page":"2568","article-title":"An o(m) algorithm for cores decomposition of undirected hypergraph","volume":"34","author":"Leng Ming","year":"2013","unstructured":"Ming Leng, Lingyu Sun, Ji-nian Bian, and Yuchun Ma. 2013. An o(m) algorithm for cores decomposition of undirected hypergraph. Journal of Chinese Computer Systems, Vol. 34, 11 (2013), 2568-2573.","journal-title":"Journal of Chinese Computer Systems"},{"key":"e_1_3_2_1_22_1","series-title":"SIAM review","volume-title":"The structure and function of complex networks","author":"Newman Mark EJ","year":"2003","unstructured":"Mark EJ Newman. 2003. The structure and function of complex networks. SIAM review, Vol. 45, 2 (2003), 167-256."},{"key":"e_1_3_2_1_23_1","first-page":"188","article-title":"Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects. In Proceedings of the Conference on Empirical Methods in Natural Language Processing and the International Joint Conference on Natural Language Processing","author":"Ni Jianmo","year":"2019","unstructured":"Jianmo Ni, Jiacheng Li, and Julian McAuley. 2019. Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects. In Proceedings of the Conference on Empirical Methods in Natural Language Processing and the International Joint Conference on Natural Language Processing. Association for Computational Linguistics, 188-197.","journal-title":"Association for Computational Linguistics"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1007\/978-3-319-70278-0_16"},{"key":"e_1_3_2_1_25_1","volume-title":"Network structure and minimum degree. Social networks","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman. 1983. Network structure and minimum degree. Social networks, Vol. 5, 3 (1983), 269-287."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1086\/211115"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1002\/widm.1256"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/3397271.3401133"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1007\/s11192-021-03991-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/3442381.3449844"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3459637.3482426"}],"event":{"sponsor":["SIGIR ACM Special Interest Group on Information Retrieval","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"acronym":"CIKM '25","name":"CIKM '25: The 34th ACM International Conference on Information and Knowledge Management","location":"Seoul Republic of Korea"},"container-title":["Proceedings of the 34th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746252.3760845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:45:08Z","timestamp":1765500308000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746252.3760845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":31,"alternative-id":["10.1145\/3746252.3760845","10.1145\/3746252"],"URL":"https:\/\/doi.org\/10.1145\/3746252.3760845","relation":{},"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}