{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T12:10:02Z","timestamp":1750075802937,"version":"3.41.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the National KeyR&D Program of China","award":["No.2022YFB4500800"],"award-info":[{"award-number":["No.2022YFB4500800"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62072089"],"award-info":[{"award-number":["62072089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10115-025-02396-4","type":"journal-article","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T03:55:48Z","timestamp":1743566148000},"page":"5619-5649","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient stable community search in temporal signed graphs"],"prefix":"10.1007","volume":"67","author":[{"given":"Jinyi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junchang","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhana","family":"Choudhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keqi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,31]]},"reference":[{"key":"2396_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ins.2023.03.097","volume":"634","author":"J Kim","year":"2023","unstructured":"Kim J, Jeong HJ, Lim S, Kim J (2023) Effective and efficient core computation in signed networks. Inf Sci 634:290\u2013307. https:\/\/doi.org\/10.1016\/j.ins.2023.03.097","journal-title":"Inf Sci"},{"key":"2396_CR2","doi-asserted-by":"publisher","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the 28th ACM conference on human factors in computing systems (CHI), pp 1361\u20131370. https:\/\/doi.org\/10.1145\/1753326.1753532","DOI":"10.1145\/1753326.1753532"},{"key":"2396_CR3","doi-asserted-by":"publisher","unstructured":"Giatsidis C, Cautis B, Maniu S, Thilikos DM, Vazirgiannis M (2014) Quantifying trust dynamics in signed graphs, the s-cores approach. In: Proceedings of the 14th SIAM international conference on data mining (SDM), pp 668\u2013676. https:\/\/doi.org\/10.1137\/1.9781611973440.77","DOI":"10.1137\/1.9781611973440.77"},{"key":"2396_CR4","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: Proceedings of the 19th international conference on World Wide Web (WWW), pp 641\u2013650","DOI":"10.1145\/1772690.1772756"},{"issue":"1","key":"2396_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0378-8733(02)00019-9","volume":"25","author":"NP Hummon","year":"2003","unstructured":"Hummon NP, Doreian P (2003) Some dynamics of social balance processes: bringing Heider back into balance theory. Soc Netw 25(1):17\u201349","journal-title":"Soc Netw"},{"issue":"4","key":"2396_CR6","doi-asserted-by":"publisher","first-page":"60063","DOI":"10.1371\/journal.pone.0060063","volume":"8","author":"VA Traag","year":"2013","unstructured":"Traag VA, Van Dooren P, De Leenheer P (2013) Dynamical models explaining social balance and evolution of cooperation. PLoS ONE 8(4):60063","journal-title":"PLoS ONE"},{"key":"2396_CR7","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/j.ins.2022.06.020","volume":"607","author":"J Kim","year":"2022","unstructured":"Kim J, Lim S, Kim J (2022) OCSM: finding overlapping cohesive subgraphs with minimum degree. Inf Sci 607:585\u2013602. https:\/\/doi.org\/10.1016\/j.ins.2022.06.020","journal-title":"Inf Sci"},{"key":"2396_CR8","doi-asserted-by":"publisher","first-page":"11245","DOI":"10.1007\/s00521-020-05042-y","volume":"32","author":"C Li","year":"2020","unstructured":"Li C, Zhang Y (2020) A personalized recommendation algorithm based on large-scale real micro-blog data. Neural Comput Appl 32:11245\u201311252. https:\/\/doi.org\/10.1007\/s00521-020-05042-y","journal-title":"Neural Comput Appl"},{"issue":"6","key":"2396_CR9","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TCBB.2015.2401014","volume":"12","author":"L OuYang","year":"2015","unstructured":"OuYang L, Dai D, Zhang X (2015) Detecting protein complexes from signed protein-protein interaction networks. IEEE\/ACM Trans Comput Biol Bioinform (TCBB) 12(6):1333\u20131344. https:\/\/doi.org\/10.1109\/TCBB.2015.2401014","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform (TCBB)"},{"key":"2396_CR10","doi-asserted-by":"publisher","unstructured":"Ordozgoiti B, Matakos A, Gionis A (2020) Finding large balanced subgraphs in signed networks. In: Proceedings of the 32nd international conference on World Wide Web (WWW), pp 1378\u20131388. https:\/\/doi.org\/10.1145\/3366423.3380212","DOI":"10.1145\/3366423.3380212"},{"key":"2396_CR11","doi-asserted-by":"publisher","unstructured":"Batagelj V, Zaversnik M (2003) An o(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049. https:\/\/doi.org\/10.48550\/arXiv.cs\/0310049","DOI":"10.48550\/arXiv.cs\/0310049"},{"issue":"2","key":"2396_CR12","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s11280-021-00933-z","volume":"25","author":"C Chen","year":"2022","unstructured":"Chen C, Zhang M, Sun R, Wang X, Zhu W, Wang X (2022) Locating pivotal connections: the k-truss minimization and maximization problems. World Wide Web J (WWW) 25(2):899\u2013926. https:\/\/doi.org\/10.1007\/s11280-021-00933-z","journal-title":"World Wide Web J (WWW)"},{"issue":"4","key":"2396_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2043652.2043654","volume":"36","author":"J Cheng","year":"2011","unstructured":"Cheng J, Ke Y, Fu AW-C, Yu JX, Zhu L (2011) Finding maximal cliques in massive networks. ACM Trans Database Syst (TODS) 36(4):1\u201334. https:\/\/doi.org\/10.1145\/2043652.2043654","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"5","key":"2396_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright D, Harary F (1956) Structural balance: a generalization of Heider\u2019s theory. Psychol Rev 63(5):277\u2013293. https:\/\/doi.org\/10.1037\/h0046049","journal-title":"Psychol Rev"},{"issue":"10","key":"2396_CR15","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1109\/TKDE.2020.3047224","volume":"34","author":"R Sun","year":"2022","unstructured":"Sun R, Chen C, Wang X, Zhang Y, Wang X (2022) Stable community detection in signed social networks. IEEE Trans Knowl Data Eng (TKDE) 34(10):5051\u20135055. https:\/\/doi.org\/10.1109\/TKDE.2020.3047224","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"issue":"3","key":"2396_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2956185","volume":"49","author":"J Tang","year":"2016","unstructured":"Tang J, Chang Y, Aggarwal C, Liu H (2016) A survey of signed network mining in social media. ACM Comput Surv (CSUR) 49(3):1\u201337. https:\/\/doi.org\/10.1145\/2956185","journal-title":"ACM Comput Surv (CSUR)"},{"key":"2396_CR17","doi-asserted-by":"publisher","unstructured":"Li R, Dai Q, Qin L, Wang G, Xiao X, Yu JX, Qiao S (2018) Efficient signed clique search in signed networks. In: Proceedings of the 34th IEEE international conference on data engineering (ICDE), pp 245\u2013256. https:\/\/doi.org\/10.1109\/ICDE.2018.00031","DOI":"10.1109\/ICDE.2018.00031"},{"key":"2396_CR18","doi-asserted-by":"crossref","unstructured":"Kunegis J, Lommatzsch A, Bauckhage C (2009) The slashdot zoo: mining a social network with negative edges. In: Proceedings of the 18th international conference on World Wide Web (WWW), pp 741\u2013750","DOI":"10.1145\/1526709.1526809"},{"key":"2396_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.bir.2020.09.003","volume":"20","author":"F Aslam","year":"2020","unstructured":"Aslam F, Mohmand YT, Ferreira P, Memon BA, Khan M, Khan M (2020) Network analysis of global stock markets at the beginning of the coronavirus disease (covid-19) outbreak. Borsa Istanbul Rev 20:49\u201361","journal-title":"Borsa Istanbul Rev"},{"key":"2396_CR20","doi-asserted-by":"publisher","unstructured":"Li R, Su J, Qin L, Yu JX, Dai Q (2018) Persistent community search in temporal networks. In: Proceedings of the 34th IEEE international conference on data engineering (ICDE), pp 797\u2013808. https:\/\/doi.org\/10.1109\/ICDE.2018.00077","DOI":"10.1109\/ICDE.2018.00077"},{"issue":"1","key":"2396_CR21","first-page":"1","volume":"15","author":"E Galimberti","year":"2020","unstructured":"Galimberti E, Ciaperoni M, Barrat A, Bonchi F, Cattuto C, Gullo F (2020) Span-core decomposition for temporal networks: algorithms and applications. ACM Trans Knowl Discov Data (TKDD) 15(1):1\u201344","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"3","key":"2396_CR22","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula DW, Beck LL (1983) Smallest-last ordering and clustering and graph coloring algorithms. J ACM (JACM) 30(3):417\u2013427. https:\/\/doi.org\/10.1145\/2402.322385","journal-title":"J ACM (JACM)"},{"key":"2396_CR23","doi-asserted-by":"publisher","unstructured":"Sar\u00edy\u00fcce AE, Gedik B, Jacques-Silva G, Wu K-L, \u00c7ataly\u00fcrek \u00dcV (2013) Streaming algorithms for $$k$$-core decomposition. In: Proceedings of the 39th international conference on very large data bases (VLDB), vol 6, pp 433\u2013444. https:\/\/doi.org\/10.14778\/2536336.2536344","DOI":"10.14778\/2536336.2536344"},{"key":"2396_CR24","doi-asserted-by":"publisher","unstructured":"Zhang Y, Yu JX, Zhang Y, Qin L (2017) A fast order-based approach for core maintenance. In: Proceedings of the 33rd IEEE international conference on data engineering (ICDE), pp 337\u2013348. https:\/\/doi.org\/10.1109\/ICDE.2017.93","DOI":"10.1109\/ICDE.2017.93"},{"key":"2396_CR25","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, Zhang Y, Zhang W, Cheng R, Lin X (2020) A survey of community search over big graphs. VLDB J 29:353\u2013392","journal-title":"VLDB J"},{"issue":"3","key":"2396_CR26","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. Soc Netw 5(3):269\u2013287. https:\/\/doi.org\/10.1016\/0378-8733(83)90028-X","journal-title":"Soc Netw"},{"issue":"2","key":"2396_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10115-021-01631-y","volume":"64","author":"S Goswami","year":"2022","unstructured":"Goswami S, Das AK (2022) Determining maximum cliques for community detection in weighted sparse networks. Knowl Inf Syst (KAIS) 64(2):289\u2013324. https:\/\/doi.org\/10.1007\/s10115-021-01631-y","journal-title":"Knowl Inf Syst (KAIS)"},{"key":"2396_CR28","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.ins.2023.03.009","volume":"633","author":"T Yu","year":"2023","unstructured":"Yu T, Liu M, Ren Z, Zhang J (2023) A fast approximate method for k-edge connected component detection in graphs with high accuracy. Inf Sci 633:384\u2013409. https:\/\/doi.org\/10.1016\/j.ins.2023.03.009","journal-title":"Inf Sci"},{"key":"2396_CR29","doi-asserted-by":"publisher","unstructured":"Cheng J, Ke Y, Chu S, \u00d6zsu MT (2011) Efficient core decomposition in massive networks. In: Proceedings of the 27th IEEE international conference on data engineering (ICDE), pp 51\u201362 . https:\/\/doi.org\/10.1109\/ICDE.2011.5767911","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"2396_CR30","doi-asserted-by":"publisher","unstructured":"Wen D, Qin L, Zhang Y, Lin X, Yu JX (2016) I\/O efficient core graph decomposition at web scale. In: Proceedings of the 32nd IEEE international conference on data engineering (ICDE), pp 133\u2013144. https:\/\/doi.org\/10.1109\/ICDE.2016.7498235","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"2396_CR31","doi-asserted-by":"publisher","unstructured":"Montresor A, De\u00a0Pellegrini F, Miorandi D (2011) Distributed k-core decomposition. In: Proceedings of the 30th ACM symposium on principles of distributed computing (PODC), pp 207\u2013208. https:\/\/doi.org\/10.1145\/1993806.1993836","DOI":"10.1145\/1993806.1993836"},{"issue":"10","key":"2396_CR32","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"R Li","year":"2013","unstructured":"Li R, Yu JX, Mao R (2013) Efficient core maintenance in large dynamic graphs. IEEE Trans Knowl Data Eng (TKDE) 26(10):2453\u20132465. https:\/\/doi.org\/10.1109\/TKDE.2013.158","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"2396_CR33","doi-asserted-by":"publisher","unstructured":"Zhang C, Zhang F, Zhang W, Liu B, Zhang Y, Qin L, Lin X (2020) Exploring finer granularity within the cores: efficient (k, p)-core computation. In: Proceedings of the 36th IEEE international conference on data engineering (ICDE), pp 181\u2013192. https:\/\/doi.org\/10.1109\/ICDE48307.2020.00023","DOI":"10.1109\/ICDE48307.2020.00023"},{"key":"2396_CR34","doi-asserted-by":"publisher","unstructured":"Liu B, Yuan L, Lin X, Qin L, Zhang W, Zhou J (2019) Efficient ($$\\alpha $$, $$\\beta $$)-core computation: an index-based approach. In: Proceedings of the 31st international conference on World Wide Web (WWW), pp 1130\u20131141. https:\/\/doi.org\/10.1145\/3308558.3313522","DOI":"10.1145\/3308558.3313522"},{"issue":"10","key":"2396_CR35","doi-asserted-by":"publisher","first-page":"998","DOI":"10.14778\/3115404.3115406","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang F, Zhang Y, Qin L, Zhang W, Lin X (2017) When engagement meets similarity: efficient (k, r)-core computation on social networks. VLDB J (VLDBJ) 10(10):998\u20131009. https:\/\/doi.org\/10.14778\/3115404.3115406","journal-title":"VLDB J (VLDBJ)"},{"key":"2396_CR36","doi-asserted-by":"publisher","unstructured":"Sun R, Zhu Q, Chen C, Wang X, Zhang Y, Wang X (2020) Discovering cliques in signed networks based on balance theory. In: Proceedings of the 25th international conference on database systems for advanced applications (DASFAA), pp 666\u2013674. https:\/\/doi.org\/10.1007\/978-3-030-59416-9_43","DOI":"10.1007\/978-3-030-59416-9_43"},{"key":"2396_CR37","doi-asserted-by":"publisher","unstructured":"Javari A, Derr T, Esmailian P, Tang J, Chang KC-C (2020) Rose: Role-based signed network embedding. In: Proceedings of the 32nd international conference on World Wide Web (WWW), pp 2782\u20132788 . https:\/\/doi.org\/10.1145\/3366423.3380038","DOI":"10.1145\/3366423.3380038"},{"issue":"2","key":"2396_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3172867","volume":"51","author":"G Rossetti","year":"2018","unstructured":"Rossetti G, Cazabet R (2018) Community discovery in dynamic networks: a survey. ACM Comput Surv (CSUR) 51(2):1\u201337","journal-title":"ACM Comput Surv (CSUR)"},{"key":"2396_CR39","doi-asserted-by":"publisher","unstructured":"Wu H, Cheng J, Lu Y, Ke Y, Huang Y, Yan D, Wu H (2015) Core decomposition in large temporal graphs. In: Proceedings of the 3rd IEEE international conference on big data, pp 649\u2013658. https:\/\/doi.org\/10.1109\/BigData.2015.7363809","DOI":"10.1109\/BigData.2015.7363809"},{"key":"2396_CR40","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1007\/s11280-017-0510-9","volume":"21","author":"R Wang","year":"2018","unstructured":"Wang R, Ji W, Song B (2018) Durable relationship prediction and description using a large dynamic graph. World Wide Web J (WWW) 21:1575\u20131600. https:\/\/doi.org\/10.1007\/s11280-017-0510-9","journal-title":"World Wide Web J (WWW)"},{"key":"2396_CR41","doi-asserted-by":"publisher","unstructured":"Qin H, Li R, Wang G, Qin L, Cheng Y, Yuan Y (2019) Mining periodic cliques in temporal networks. In: Proceedings of the 35th IEEE international conference on data engineering (ICDE), pp 1130\u20131141 . https:\/\/doi.org\/10.1109\/ICDE.2019.00104","DOI":"10.1109\/ICDE.2019.00104"},{"key":"2396_CR42","doi-asserted-by":"publisher","unstructured":"Chu L, Zhang Y, Yang Y, Wang L, Pei J (2019) Online density bursting subgraph detection from temporal graphs. In: Proceedings of the 45th international conference on very large data bases (VLDB), vol 12, pp 2353\u20132365 . https:\/\/doi.org\/10.14778\/3358701.3358704","DOI":"10.14778\/3358701.3358704"},{"key":"2396_CR43","doi-asserted-by":"publisher","unstructured":"Ma S, Hu R, Wang L, Lin X, Huai J (2017) Fast computation of dense temporal subgraphs. In: Proceedings of the 33rd IEEE international conference on data engineering (ICDE), pp 361\u2013372 . https:\/\/doi.org\/10.1109\/ICDE.2017.95","DOI":"10.1109\/ICDE.2017.95"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02396-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02396-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02396-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T11:54:31Z","timestamp":1750074871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02396-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,31]]},"references-count":43,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2396"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02396-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2025,3,31]]},"assertion":[{"value":"3 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2025","order":4,"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 conflict of interest to declare that are relevant to the content of this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}