{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NMIPJTUNU37WHGJH5Q6RGAL67P","short_pith_number":"pith:NMIPJTUN","schema_version":"1.0","canonical_sha256":"6b10f4ce8da6ff639927ec3d13017efbf1f397e3c92168b286e2e2a925bd8319","source":{"kind":"arxiv","id":"2402.11565","version":1},"attestation_state":"computed","paper":{"title":"Continual Learning on Graphs: Challenges, Solutions, and Opportunities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Dongjin Song, Xikun Zhang","submitted_at":"2024-02-18T12:24:45Z","abstract_excerpt":"Continual learning on graph data has recently attracted paramount attention for its aim to resolve the catastrophic forgetting problem on existing tasks while adapting the sequentially updated model to newly emerged graph tasks. While there have been efforts to summarize progress on continual learning research over Euclidean data, e.g., images and texts, a systematic review of progress in continual learning on graphs, a.k.a, continual graph learning (CGL) or lifelong graph learning, is still demanding. Graph data are far more complex in terms of data structures and application scenarios, makin"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2402.11565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-18T12:24:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2c5b6d6d80e431100f0dc12ba6852c67feb2285449b80f9adcea3effa26fcf11","abstract_canon_sha256":"5aaa6c3b8a55361029f701de2ef83824fde4c13329a21173cdf7d23c12492329"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:41.160221Z","signature_b64":"yisHA9W4btMg8rxa8zBEMMEo2uSVYmliOzmfHlvyZiHZSSMHAoTp2sY2NXDTlFLLlTcnqexSBF6/USM+1VfrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b10f4ce8da6ff639927ec3d13017efbf1f397e3c92168b286e2e2a925bd8319","last_reissued_at":"2026-07-05T07:46:41.159828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:41.159828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continual Learning on Graphs: Challenges, Solutions, and Opportunities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Dongjin Song, Xikun Zhang","submitted_at":"2024-02-18T12:24:45Z","abstract_excerpt":"Continual learning on graph data has recently attracted paramount attention for its aim to resolve the catastrophic forgetting problem on existing tasks while adapting the sequentially updated model to newly emerged graph tasks. While there have been efforts to summarize progress on continual learning research over Euclidean data, e.g., images and texts, a systematic review of progress in continual learning on graphs, a.k.a, continual graph learning (CGL) or lifelong graph learning, is still demanding. Graph data are far more complex in terms of data structures and application scenarios, makin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11565","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.11565/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.11565","created_at":"2026-07-05T07:46:41.159881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.11565v1","created_at":"2026-07-05T07:46:41.159881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11565","created_at":"2026-07-05T07:46:41.159881+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMIPJTUNU37W","created_at":"2026-07-05T07:46:41.159881+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMIPJTUNU37WHGJH","created_at":"2026-07-05T07:46:41.159881+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMIPJTUN","created_at":"2026-07-05T07:46:41.159881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01873","citing_title":"G2LoRA: Gradient Orthogonal Low-Rank Adaptation Framework for Graph Continual Learning on Text-Attributed Graphs","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12998","citing_title":"DRIFT: A Benchmark for Task-Free Continual Graph Learning with Continuous Distribution Shifts","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16085","citing_title":"Towards Foundation Models for Relational Databases with Language Models and Graph Neural Networks","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12998","citing_title":"DRIFT: A Benchmark for Task-Free Continual Graph Learning with Continuous Distribution Shifts","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12998","citing_title":"DRIFT: A Benchmark for Task-Free Continual Graph Learning with Continuous Distribution Shifts","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09862","citing_title":"UFO: A Unified Flow-Oriented Framework for Robust Continual Graph Learning","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04916","citing_title":"Empowering Power Outage Prediction with Spatially Aware Hybrid Graph Neural Networks and Contrastive Learning","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NMIPJTUNU37WHGJH5Q6RGAL67P","json":"https://pith.science/pith/NMIPJTUNU37WHGJH5Q6RGAL67P.json","graph_json":"https://pith.science/api/pith-number/NMIPJTUNU37WHGJH5Q6RGAL67P/graph.json","events_json":"https://pith.science/api/pith-number/NMIPJTUNU37WHGJH5Q6RGAL67P/events.json","paper":"https://pith.science/paper/NMIPJTUN"},"agent_actions":{"view_html":"https://pith.science/pith/NMIPJTUNU37WHGJH5Q6RGAL67P","download_json":"https://pith.science/pith/NMIPJTUNU37WHGJH5Q6RGAL67P.json","view_paper":"https://pith.science/paper/NMIPJTUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.11565&json=true","fetch_graph":"https://pith.science/api/pith-number/NMIPJTUNU37WHGJH5Q6RGAL67P/graph.json","fetch_events":"https://pith.science/api/pith-number/NMIPJTUNU37WHGJH5Q6RGAL67P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMIPJTUNU37WHGJH5Q6RGAL67P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMIPJTUNU37WHGJH5Q6RGAL67P/action/storage_attestation","attest_author":"https://pith.science/pith/NMIPJTUNU37WHGJH5Q6RGAL67P/action/author_attestation","sign_citation":"https://pith.science/pith/NMIPJTUNU37WHGJH5Q6RGAL67P/action/citation_signature","submit_replication":"https://pith.science/pith/NMIPJTUNU37WHGJH5Q6RGAL67P/action/replication_record"}},"created_at":"2026-07-05T07:46:41.159881+00:00","updated_at":"2026-07-05T07:46:41.159881+00:00"}