{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T01:49:37Z","timestamp":1775526577970,"version":"3.50.1"},"reference-count":39,"publisher":"Zhejiang University Press","issue":"8","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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":["Front Inform Technol Electron Eng"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1631\/fitee.2500162","type":"journal-article","created":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T03:33:47Z","timestamp":1757648027000},"page":"1441-1453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["E-CGL: an efficient continual graph learner","E-CGL: \u4e00\u4e2a\u9ad8\u6548\u7684\u56fe\u8fde\u7eed\u5b66\u4e60\u5668"],"prefix":"10.1631","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4285-5328","authenticated-orcid":false,"given":"Jianhao","family":"Guo","sequence":"first","affiliation":[]},{"given":"Zixuan","family":"Ni","sequence":"additional","affiliation":[]},{"given":"Yun","family":"Zhu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7356-9711","authenticated-orcid":false,"given":"Siliang","family":"Tang","sequence":"additional","affiliation":[]}],"member":"635","published-online":{"date-parts":[[2025,9,12]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01219-9_9"},{"key":"ref2","article-title":"Deep Gaussian em-bedding of graphs: unsupervised inductive learning via ranking","volume-title":"6th Int Conf on Learning Representations","author":"Bojchevski","year":"2018"},{"key":"ref3","article-title":"Dark expe-rience for general continual learning: a strong, simple baseline","volume-title":"Proc 34th Int Conf on Neural Information Processing Systems","author":"Buzzega","year":"2020"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645561"},{"key":"ref5","author":"Fan","year":"2022","journal-title":"A unified continuous learning framework for multi-modal knowledge discov-ery and pre-training"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/icde60146.2024.00237"},{"key":"ref7","first-page":"1025","article-title":"Inductive represen-tation learning on large graphs","volume-title":"Proc 31st Int Conf on Neural Information Processing Systems","author":"Hamilton","year":"2017"},{"key":"ref8","article-title":"MLPInit: em-barrassingly simple GNN training acceleration with MLP initialization","volume-title":"The 11th Int Conf on Learning Representations","author":"Han","year":"2023"},{"key":"ref9","article-title":"A topology-aware graph coarsening framework for continual graph learning","volume-title":"Proc 38th Int Conf on Neural Information Processing Systems","author":"Han","year":"2024"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018668"},{"key":"ref11","article-title":"Open graph bench-mark: datasets for machine learning on graphs","volume-title":"Proc 34th Int Conf on Neural Information Processing Systems","author":"Hu","year":"2020"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr46437.2021.00395"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/438"},{"key":"ref14","first-page":"3157","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"5th Int Conf on Learning Representations","author":"Kipf","year":"2017"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611835114"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2017.2773081"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17049"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/icdm58522.2023.00141"},{"key":"ref19","first-page":"6470","article-title":"Gradient episodic memory for continual learning","volume-title":"Proc 31st Int Conf on Neural Information Processing Systems","author":"Lopez-Paz","year":"2017"},{"key":"ref20","article-title":"Continual vision-language representation learning with off-diagonal in-formation","volume-title":"Proc 40th Int Conf on Machine Learning","author":"Ni","year":"2023"},{"key":"ref21","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","volume-title":"Proc 33rd Int Conf on Machine Learning","author":"Niepert","year":"2016"},{"key":"ref22","first-page":"SIDL-WP-1999","author":"Page","year":"1999","journal-title":"The PageRank Ci-tation Ranking: Bringing Order to the Web. Technical Report"},{"key":"ref23","first-page":"1177","article-title":"Random features for large-scale kernel machines","volume-title":"Proc 21st Int Conf on Neural Infor-mation Processing Systems","author":"Rahimi","year":"2007"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557427"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr.2017.587"},{"key":"ref26","article-title":"CLiMB: a continual learning benchmark for vision-and-language tasks","volume-title":"Proc 36th Int Conf on Neural Information Pro-cessing Systems","author":"Srinivasan","year":"2022"},{"key":"ref27","first-page":"342","article-title":"On the limitation and experience replay for G NN s in continual learning","volume-title":"Proc 3rd Conf on Lifelong Learning Agents","author":"Su","year":"2025"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/iros.1994.407413"},{"key":"ref29","author":"Velickovic","year":"2018","journal-title":"Graph attention networks"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411963"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.111093"},{"key":"ref32","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc 36th Int Conf on Machine Learning","author":"Wu","year":"2019"},{"key":"ref33","article-title":"How powerful are graph neural networks?","volume-title":"7th Int Conf on Learning Representations","author":"Xu","year":"2019"},{"key":"ref34","author":"Yang","year":"2023","journal-title":"Graph neural networks are inherently good generalizers: insights by bridging GNNs and MLPs"},{"key":"ref35","author":"Yuan","year":"2023","journal-title":"Continual graph learning: a survey"},{"key":"ref36","article-title":"CGLB: benchmark tasks for continual graph learning","volume-title":"Proc 36th Int Conf on Neural Information Processing Systems","author":"Zhang","year":"2022a"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/icdm54844.2022.00177"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16602"},{"key":"ref39","article-title":"Beyond homophily in graph neural networks: current limitations and effective designs","volume-title":"Proc 34th Int Conf on Neural Information Processing Systems","author":"Zhu","year":"2020"}],"container-title":["Frontiers of Information Technology & Electronic Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.2500162.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1631\/FITEE.2500162\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.2500162.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T06:38:24Z","timestamp":1771655904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1631\/FITEE.2500162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":39,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2077"],"URL":"https:\/\/doi.org\/10.1631\/fitee.2500162","relation":{},"ISSN":["2095-9184","2095-9230"],"issn-type":[{"value":"2095-9184","type":"print"},{"value":"2095-9230","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8]]},"assertion":[{"value":"14 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"All the authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}