{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:48:50Z","timestamp":1773229730946,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T00:00:00Z","timestamp":1765324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:00:00Z","timestamp":1768780800000},"content-version":"vor","delay-in-days":40,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62502010"],"award-info":[{"award-number":["62502010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007924","name":"Bengbu Medical College","doi-asserted-by":"publisher","award":["2024byzd117"],"award-info":[{"award-number":["2024byzd117"]}],"id":[{"id":"10.13039\/501100007924","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s44443-025-00391-x","type":"journal-article","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:55:04Z","timestamp":1765371304000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining Interaction-intensive cores in temporal graphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Luo","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Xueying","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Jinhu","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Yue","family":"Liang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6682-8927","authenticated-orcid":false,"given":"Huixiang","family":"Wen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,10]]},"reference":[{"key":"391_CR1","doi-asserted-by":"publisher","unstructured":"Ahmad A, Yuan L, Yan D et\u00a0al (2023) Accelerating k-core decomposition by a gpu. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, pp 1818\u20131831. https:\/\/doi.org\/10.1109\/ICDE55515.2023.00142","DOI":"10.1109\/ICDE55515.2023.00142"},{"key":"391_CR2","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.ins.2019.11.003","volume":"513","author":"W Bai","year":"2020","unstructured":"Bai W, Chen Y, Wu D (2020) Efficient temporal core maintenance of massive graphs. Inf Sci 513:324\u2013340. https:\/\/doi.org\/10.1016\/j.ins.2019.11.003","journal-title":"Inf Sci"},{"issue":"9","key":"391_CR3","doi-asserted-by":"publisher","first-page":"8919","DOI":"10.1109\/TKDE.2022.3219096","volume":"35","author":"W Bai","year":"2022","unstructured":"Bai W, Jiang Y, Tang Y et al (2022) Parallel core maintenance of dynamic graphs. IEEE Trans Knowl Data Eng 35(9):8919\u20138933. https:\/\/doi.org\/10.1109\/TKDE.2022.3219096","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"391_CR4","doi-asserted-by":"publisher","unstructured":"Cao H, Wang Q, Li X et\u00a0al (2024) Large subgraph matching: a comprehensive and efficient approach for heterogeneous graphs. In: 2024 IEEE 40th International conference on data engineering (ICDE). IEEE, pp 2972\u20132985. https:\/\/doi.org\/10.1109\/ICDE60146.2024.00231","DOI":"10.1109\/ICDE60146.2024.00231"},{"issue":"5","key":"391_CR5","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1007\/s00778-020-00602-z","volume":"29","author":"L Chang","year":"2020","unstructured":"Chang L (2020) Efficient maximum clique computation and enumeration over large sparse graphs. VLDB J 29(5):999\u20131022. https:\/\/doi.org\/10.1007\/s00778-020-00602-z","journal-title":"VLDB J"},{"issue":"3","key":"391_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3617313","volume":"1","author":"L Chang","year":"2023","unstructured":"Chang L (2023) Efficient maximum k-defective clique computation with improved time complexity. Proc ACM Manag Data 1(3):1\u201326. https:\/\/doi.org\/10.1145\/3617313","journal-title":"Proc ACM Manag Data"},{"issue":"6","key":"391_CR7","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.14778\/3648160.3648173","volume":"17","author":"X Chen","year":"2024","unstructured":"Chen X, Shi J, Peng Y et al (2024) Minimum strongly connected subgraph collection in dynamic graphs. Proc VLDB Endowment 17(6):1324\u20131336. https:\/\/doi.org\/10.14778\/3648160.3648173","journal-title":"Proc VLDB Endowment"},{"key":"391_CR8","doi-asserted-by":"publisher","unstructured":"Dhulipala L, Liu QC, Raskhodnikova S et\u00a0al (2022) Differential privacy from locally adjustable graph algorithms: k-core decomposition, low out-degree ordering, and densest subgraphs. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, pp 754\u2013765. https:\/\/doi.org\/10.1109\/FOCS54457.2022.00077","DOI":"10.1109\/FOCS54457.2022.00077"},{"key":"391_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang Y, Huang X, Qin L et al (2020) A survey of community search over big graphs. VLDB J 29:353\u2013392. https:\/\/doi.org\/10.1007\/s00778-019-00556-x","journal-title":"VLDB J"},{"issue":"1","key":"391_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3418226","volume":"15","author":"E Galimberti","year":"2020","unstructured":"Galimberti E, Ciaperoni M, Barrat A et al (2020) Span-core decomposition for temporal networks: algorithms and applications. ACM Trans Knowl Discov Data (TKDD) 15(1):1\u201344. https:\/\/doi.org\/10.1145\/3418226","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"391_CR11","doi-asserted-by":"publisher","unstructured":"Guo Y, Ma C, Fang Y (2024) Efficient core decomposition over large heterogeneous information networks. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, pp 2393\u20132406. https:\/\/doi.org\/10.1109\/ICDE60146.2024.00189","DOI":"10.1109\/ICDE60146.2024.00189"},{"key":"391_CR12","unstructured":"Hu Y, Wang Q, Christen P (2018) Developing a temporal bibliographic data set for entity resolution. arXiv:1806.07524"},{"key":"391_CR13","doi-asserted-by":"publisher","unstructured":"Hu C, Zhong M, Zhu Y et\u00a0al (2024) Querying cohesive subgraph regarding span-constrained triangles on temporal graphs. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, pp 3338\u20133350. https:\/\/doi.org\/10.1109\/ICDE60146.2024.00258","DOI":"10.1109\/ICDE60146.2024.00258"},{"issue":"12","key":"391_CR14","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/12\/125003","volume":"16","author":"D Kondor","year":"2014","unstructured":"Kondor D, Csabai I, Sz\u00fcle J et al (2014) Inferring the interplay between network structure and market effects in bitcoin. New J Phys 16(12):125003","journal-title":"New J Phys"},{"key":"391_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Governance in social media: a case study of the wikipedia promotion process. In: Proceedings of the international AAAI conference on web and social media, pp 98\u2013105","DOI":"10.1609\/icwsm.v4i1.14013"},{"key":"391_CR16","doi-asserted-by":"publisher","unstructured":"Li RH, Su J, Qin L et\u00a0al (2018) Persistent community search in temporal networks. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, pp 797\u2013808. https:\/\/doi.org\/10.1109\/ICDE.2018.00077","DOI":"10.1109\/ICDE.2018.00077"},{"key":"391_CR17","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1007\/s11280-021-00917-z","volume":"24","author":"Y Li","year":"2021","unstructured":"Li Y, Liu J, Zhao H et al (2021) Efficient continual cohesive subgraph search in large temporal graphs. World Wide Web 24:1483\u20131509. https:\/\/doi.org\/10.1007\/s11280-021-00917-z","journal-title":"World Wide Web"},{"issue":"8","key":"391_CR18","doi-asserted-by":"publisher","first-page":"1816","DOI":"10.14778\/3659437.3659440","volume":"17","author":"X Liao","year":"2024","unstructured":"Liao X, Liu Q, Huang X et al (2024) Truss-based community search over streaming directed graphs. Proc VLDB Endowment 17(8):1816\u20131829. https:\/\/doi.org\/10.14778\/3659437.3659440","journal-title":"Proc VLDB Endowment"},{"key":"391_CR19","doi-asserted-by":"publisher","unstructured":"Li Y, Chen X, Zhao Y et\u00a0al (2024a) Self-training gnn-based community search in large attributed heterogeneous information networks. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, pp 2765\u20132778. https:\/\/doi.org\/10.1109\/ICDE60146.2024.00216","DOI":"10.1109\/ICDE60146.2024.00216"},{"key":"391_CR20","doi-asserted-by":"publisher","unstructured":"Li Z, Li Y, Chen X et\u00a0al (2024b) Newsp: a new search process for continuous subgraph matching over dynamic graphs. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, pp 3324\u20133337. https:\/\/doi.org\/10.1109\/ICDE60146.2024.00257","DOI":"10.1109\/ICDE60146.2024.00257"},{"key":"391_CR21","doi-asserted-by":"crossref","unstructured":"Liu P, Benson AR, Charikar M (2019) Sampling methods for counting temporal motifs. In: Proceedings of the ACM international conference on web search and data mining","DOI":"10.1145\/3289600.3290988"},{"key":"391_CR22","doi-asserted-by":"publisher","unstructured":"Liu Y, Guo F, Xu B et\u00a0al (2023) Significant-attributed community search in heterogeneous information networks. https:\/\/doi.org\/10.48550\/arXiv.2308.13244. arXiv:2308.13244","DOI":"10.48550\/arXiv.2308.13244"},{"key":"391_CR23","doi-asserted-by":"publisher","unstructured":"Liu Y, Guo F, Xu B et\u00a0al (2024) Sach: significant-attributed community search in heterogeneous information networks. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, pp 3283\u20133296. https:\/\/doi.org\/10.1109\/ICDE60146.2024.00254","DOI":"10.1109\/ICDE60146.2024.00254"},{"key":"391_CR24","doi-asserted-by":"publisher","unstructured":"Li S, Wang K, Lin X et\u00a0al (2024c) Querying historical cohesive subgraphs over temporal bipartite graphs. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, pp 2503\u20132516. https:\/\/doi.org\/10.1109\/ICDE60146.2024.00197","DOI":"10.1109\/ICDE60146.2024.00197"},{"key":"391_CR25","doi-asserted-by":"publisher","unstructured":"Li M, Xie Z, Ding L (2023) Persistent community search over temporal bipartite graphs. In: International conference on advanced data mining and applications. Springer, pp 324\u2013339. https:\/\/doi.org\/10.1007\/978-3-031-46677-9_23","DOI":"10.1007\/978-3-031-46677-9_23"},{"key":"391_CR26","doi-asserted-by":"crossref","unstructured":"Manchanda S, Karypis G (2018) Text segmentation on multilabel documents: a distant-supervised approach. In: 2018 IEEE International Conference on Data Mining (ICDM). IEEE, pp 1170\u20131175","DOI":"10.1109\/ICDM.2018.00154"},{"key":"391_CR27","doi-asserted-by":"publisher","unstructured":"Niu Y, Li Y, Karras P et\u00a0al (2024) Discovering personalized characteristic communities in attributed graphs. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, pp 2834\u20132847. https:\/\/doi.org\/10.1109\/ICDE60146.2024.00221","DOI":"10.1109\/ICDE60146.2024.00221"},{"key":"391_CR28","doi-asserted-by":"crossref","unstructured":"Paranjape A, Benson AR, Leskovec J (2017) Motifs in temporal networks. In: Proceedings of the Tenth ACM international conference on web search and data mining, pp 601\u2013610","DOI":"10.1145\/3018661.3018731"},{"key":"391_CR29","doi-asserted-by":"publisher","unstructured":"Peng Y, Lin X, Yu M et\u00a0al (2023) Tdb: breaking all hop-constrained cycles in billion-scale directed graphs. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, pp 137\u2013150. https:\/\/doi.org\/10.1109\/ICDE55515.2023.00018","DOI":"10.1109\/ICDE55515.2023.00018"},{"key":"391_CR30","doi-asserted-by":"publisher","unstructured":"Qin H, Li RH, Wang G et\u00a0al (2019) Mining periodic cliques in temporal networks. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE). IEEE, pp 1130\u20131141. https:\/\/doi.org\/10.1109\/ICDE.2019.00104","DOI":"10.1109\/ICDE.2019.00104"},{"key":"391_CR31","doi-asserted-by":"crossref","unstructured":"Qin H, Li RH, Yuan Y et\u00a0al (2022) Mining bursting core in large temporal graphs. Proc VLDB Endowment. http:\/\/hdl.handle.net\/10453\/166488","DOI":"10.14778\/3565838.3565845"},{"issue":"9","key":"391_CR32","doi-asserted-by":"publisher","first-page":"3715","DOI":"10.1016\/j.eswa.2012.12.077","volume":"40","author":"U Redmond","year":"2013","unstructured":"Redmond U, Cunningham P (2013) A temporal network analysis reveals the unprofitability of arbitrage in the prosper marketplace. Expert Syst Appl 40(9):3715\u20133721","journal-title":"Expert Syst Appl"},{"issue":"3","key":"391_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3654960","volume":"2","author":"J Song","year":"2024","unstructured":"Song J, Wen D, Xu L et al (2024) On querying historical connectivity in temporal graphs. Proc ACM Manag Data 2(3):1\u201325. https:\/\/doi.org\/10.1145\/3654960","journal-title":"Proc ACM Manag Data"},{"issue":"2","key":"391_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3589278","volume":"1","author":"Z Sun","year":"2023","unstructured":"Sun Z, Huang X, Liu Q et al (2023) Efficient star-based truss maintenance on dynamic graphs. Proc ACM Manag Data 1(2):1\u201326. https:\/\/doi.org\/10.1145\/3589278","journal-title":"Proc ACM Manag Data"},{"issue":"9","key":"391_CR35","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.14778\/3598581.3598592","volume":"16","author":"A Tian","year":"2023","unstructured":"Tian A, Zhou A, Wang Y et al (2023) Maximal d-truss search in dynamic directed graphs. Proc VLDB Endowment 16(9):2199\u20132211. https:\/\/doi.org\/10.14778\/3598581.3598592","journal-title":"Proc VLDB Endowment"},{"issue":"6","key":"391_CR36","doi-asserted-by":"publisher","first-page":"3673","DOI":"10.1016\/j.jksuci.2022.04.009","volume":"34","author":"J Tu","year":"2022","unstructured":"Tu J, Mei G, Piccialli F (2022) An improved Nystr\u00f6m spectral graph clustering using k-core decomposition as a sampling strategy for large networks. J King Saud Univ-Comput Inf Sci 34(6):3673\u20133684. https:\/\/doi.org\/10.1016\/j.jksuci.2022.04.009","journal-title":"J King Saud Univ-Comput Inf Sci"},{"key":"391_CR37","doi-asserted-by":"publisher","unstructured":"Wang K, Cai M, Chen X et al (2024a) Efficient algorithms for reachability and path queries on temporal bipartite graphs. VLDB J 33(5):1399\u20131426. https:\/\/doi.org\/10.1007\/s00778-024-00854-z","DOI":"10.1007\/s00778-024-00854-z"},{"key":"391_CR38","doi-asserted-by":"publisher","unstructured":"Wang J, Wang K, Lin X et al (2024b) Neural attributed community search at billion scale. Proc ACM Manag Data 1(4):1\u201325. https:\/\/doi.org\/10.1145\/3626738","DOI":"10.1145\/3626738"},{"key":"391_CR39","doi-asserted-by":"publisher","unstructured":"Wang J, Yang J, Gu Z et al (2024c) Efficient maximal biclique enumeration on large signed bipartite graphs. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2024.3373654","DOI":"10.1109\/TKDE.2024.3373654"},{"key":"391_CR40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3388988","author":"D Wu","year":"2024","unstructured":"Wu D, Zhang Z, Jensen CS et al (2024) Efficient skyline keyword-based tree retrieval on attributed graphs. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2024.3388988","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"391_CR41","doi-asserted-by":"publisher","unstructured":"Wu H, Cheng J, Lu Y et\u00a0al (2015) Core decomposition in large temporal graphs. In: 2015 IEEE international conference on big data (Big data). IEEE, pp 649\u2013658. https:\/\/doi.org\/10.1109\/BigData.2015.7363809","DOI":"10.1109\/BigData.2015.7363809"},{"issue":"5","key":"391_CR42","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.14778\/3579075.3579089","volume":"16","author":"J Yang","year":"2023","unstructured":"Yang J, Zhong M, Zhu Y et al (2023) Scalable time-range k-core query on temporal graphs. Proc VLDB Endowment 16(5):1168\u20131180","journal-title":"Proc VLDB Endowment"},{"issue":"8","key":"391_CR43","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.14778\/3457390.3457407","volume":"14","author":"K Yao","year":"2021","unstructured":"Yao K, Chang L (2021) Efficient size-bounded community search over large networks. Proc VLDB Endowment 14(8):1441\u20131453. https:\/\/doi.org\/10.14778\/3457390.3457407","journal-title":"Proc VLDB Endowment"},{"key":"391_CR44","doi-asserted-by":"crossref","unstructured":"Yu M, Wen D, Qin L et\u00a0al (2021) On querying historical k-cores. Proc VLDB Endowment. http:\/\/hdl.handle.net\/10453\/153781","DOI":"10.14778\/3476249.3476260"},{"key":"391_CR45","doi-asserted-by":"publisher","unstructured":"Zhang Q, Li RH, Zheng Z et\u00a0al (2023a) Efficient maximum fair clique search over large networks. https:\/\/doi.org\/10.48550\/arXiv.2312.04088. arXiv:2312.04088","DOI":"10.48550\/arXiv.2312.04088"},{"key":"391_CR46","doi-asserted-by":"publisher","unstructured":"Zhang Z, Wang X, Zhang Z et\u00a0al (2024) Llm4dyg: can large language models solve spatial-temporal problems on dynamic graphs? In: Proceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining, pp 4350\u20134361. https:\/\/doi.org\/10.1145\/3637528.3671709","DOI":"10.1145\/3637528.3671709"},{"key":"391_CR47","doi-asserted-by":"publisher","unstructured":"Zhang Y, Yu JX, Zhang Y et al (2023b) Maintaining top-$$ t $$ cores in dynamic graphs. IEEE Trans Knowl Data Eng 36(9):4766\u20134780. https:\/\/doi.org\/10.1109\/TKDE.2023.3332638","DOI":"10.1109\/TKDE.2023.3332638"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00391-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00391-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00391-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:38:35Z","timestamp":1773153515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00391-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,10]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["391"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00391-x","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,10]]},"assertion":[{"value":"6 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2025","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":"Competing Interests"}}],"article-number":"22"}}