{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T23:40:07Z","timestamp":1750117207794,"version":"3.41.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T00:00:00Z","timestamp":1743724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T00:00:00Z","timestamp":1743724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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-02397-3","type":"journal-article","created":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T04:22:51Z","timestamp":1743826971000},"page":"5731-5750","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Correlation clustering algorithm for dynamic complete signed graphs: an index-based approach"],"prefix":"10.1007","volume":"67","author":[{"given":"Ali","family":"Shakiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,4]]},"reference":[{"issue":"1","key":"2397_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal N, Blum A, Chawla S (2004) Correlation clustering. Mach Learn 56(1):89\u2013113","journal-title":"Mach Learn"},{"issue":"1","key":"2397_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba N, Nishizeki T (1985) Arboricity and subgraph listing algorithms. SIAM J Comput 14(1):210\u2013223","journal-title":"SIAM J Comput"},{"key":"2397_CR3","unstructured":"Cohen-Addad V, Lattanzi S, Maggiori A, Parotsidis N (2022) Online and consistent correlation clustering. In: Chaudhuri K, Jegelka S, Song L, Szepesvari C, Niu G, Sabato S, editors. In: Proceedings of the 39th international conference on machine learning. volume 162 of Proceedings of machine learning research, pages 4157\u20134179. PMLR, 17\u201323 Jul"},{"key":"2397_CR4","unstructured":"Cohen-Addad V, Lattanzi S, Mitrovi\u0107 S, Norouzi-Fard A, Parotsidis N, Tarnawski J (2021) Correlation clustering in constant many parallel rounds. In: International conference on machine learning (ICML), pages 2069\u20132078. PMLR"},{"key":"2397_CR5","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2022","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2022) Introduction to algorithms. MIT Press"},{"key":"2397_CR6","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"2397_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"L Jure","year":"2007","unstructured":"Jure L, Jon K, Christos F (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):2","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2397_CR8","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"issue":"1","key":"2397_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"key":"2397_CR10","unstructured":"Mathieu C, Sankur O, Schudy W (2010) Online correlation clustering. In: 27th international symposium on theoretical aspects of computer science-STACS 2010, pp 573\u2013584"},{"key":"2397_CR11","unstructured":"Rozemberczki B, Allen C, Sarkar R (2019) Multi-scale attributed node embedding"},{"key":"2397_CR12","doi-asserted-by":"crossref","unstructured":"Shakiba A (2022) Online correlation clustering for dynamic complete signed graphs. arXiv preprint arXiv:2211.07000","DOI":"10.2139\/ssrn.4367188"},{"key":"2397_CR13","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD workshop on mining data semantics, pp 1\u20138","DOI":"10.1145\/2350190.2350193"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02397-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02397-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02397-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T23:02:00Z","timestamp":1750114920000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02397-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,4]]},"references-count":13,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2397"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02397-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2025,4,4]]},"assertion":[{"value":"6 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2024","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":"4 April 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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}