{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ULTMOQEUCVTSR7GQP6FF2CS545","short_pith_number":"pith:ULTMOQEU","schema_version":"1.0","canonical_sha256":"a2e6c74094156728fcd07f8a5d0a5de75ccb2c61f97d409a4ee0a7856937159a","source":{"kind":"arxiv","id":"2402.12987","version":1},"attestation_state":"computed","paper":{"title":"Towards Robust Graph Incremental Learning on Evolving Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chuan Wu, Difan Zou, Junwei Su, Zijun Zhang","submitted_at":"2024-02-20T13:17:37Z","abstract_excerpt":"Incremental learning is a machine learning approach that involves training a model on a sequence of tasks, rather than all tasks at once. This ability to learn incrementally from a stream of tasks is crucial for many real-world applications. However, incremental learning is a challenging problem on graph-structured data, as many graph-related problems involve prediction tasks for each individual node, known as Node-wise Graph Incremental Learning (NGIL). This introduces non-independent and non-identically distributed characteristics in the sample data generation process, making it difficult to"},"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.12987","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-20T13:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"dfdd81a4eb072cc282fc6df1932b1e0a34b09f6d56746c0b4287a4a39b75def6","abstract_canon_sha256":"98ae3ab08b386064983750741615dd8498e690dd288b7d35b06f025d89685914"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:19.359042Z","signature_b64":"Afh4GOIohJw8FshWItWSAELiNciRJhM1Ils8PesG3eNoSbXe93OspKWKo5u9I/rNe7wI7MzYmev8lj4W8VEiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e6c74094156728fcd07f8a5d0a5de75ccb2c61f97d409a4ee0a7856937159a","last_reissued_at":"2026-07-05T07:47:19.358548Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:19.358548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Robust Graph Incremental Learning on Evolving Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chuan Wu, Difan Zou, Junwei Su, Zijun Zhang","submitted_at":"2024-02-20T13:17:37Z","abstract_excerpt":"Incremental learning is a machine learning approach that involves training a model on a sequence of tasks, rather than all tasks at once. This ability to learn incrementally from a stream of tasks is crucial for many real-world applications. However, incremental learning is a challenging problem on graph-structured data, as many graph-related problems involve prediction tasks for each individual node, known as Node-wise Graph Incremental Learning (NGIL). This introduces non-independent and non-identically distributed characteristics in the sample data generation process, making it difficult to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12987","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.12987/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.12987","created_at":"2026-07-05T07:47:19.358611+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.12987v1","created_at":"2026-07-05T07:47:19.358611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12987","created_at":"2026-07-05T07:47:19.358611+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULTMOQEUCVTS","created_at":"2026-07-05T07:47:19.358611+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULTMOQEUCVTSR7GQ","created_at":"2026-07-05T07:47:19.358611+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULTMOQEU","created_at":"2026-07-05T07:47:19.358611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00735","citing_title":"Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ULTMOQEUCVTSR7GQP6FF2CS545","json":"https://pith.science/pith/ULTMOQEUCVTSR7GQP6FF2CS545.json","graph_json":"https://pith.science/api/pith-number/ULTMOQEUCVTSR7GQP6FF2CS545/graph.json","events_json":"https://pith.science/api/pith-number/ULTMOQEUCVTSR7GQP6FF2CS545/events.json","paper":"https://pith.science/paper/ULTMOQEU"},"agent_actions":{"view_html":"https://pith.science/pith/ULTMOQEUCVTSR7GQP6FF2CS545","download_json":"https://pith.science/pith/ULTMOQEUCVTSR7GQP6FF2CS545.json","view_paper":"https://pith.science/paper/ULTMOQEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.12987&json=true","fetch_graph":"https://pith.science/api/pith-number/ULTMOQEUCVTSR7GQP6FF2CS545/graph.json","fetch_events":"https://pith.science/api/pith-number/ULTMOQEUCVTSR7GQP6FF2CS545/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULTMOQEUCVTSR7GQP6FF2CS545/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULTMOQEUCVTSR7GQP6FF2CS545/action/storage_attestation","attest_author":"https://pith.science/pith/ULTMOQEUCVTSR7GQP6FF2CS545/action/author_attestation","sign_citation":"https://pith.science/pith/ULTMOQEUCVTSR7GQP6FF2CS545/action/citation_signature","submit_replication":"https://pith.science/pith/ULTMOQEUCVTSR7GQP6FF2CS545/action/replication_record"}},"created_at":"2026-07-05T07:47:19.358611+00:00","updated_at":"2026-07-05T07:47:19.358611+00:00"}