{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UVPIYMV3HKKAHCRSEJQNIXGUPU","short_pith_number":"pith:UVPIYMV3","schema_version":"1.0","canonical_sha256":"a55e8c32bb3a94038a322260d45cd47d3e9ad589772390d3e9b512f1c7135cdf","source":{"kind":"arxiv","id":"2605.12998","version":2},"attestation_state":"computed","paper":{"title":"DRIFT: A Benchmark for Task-Free Continual Graph Learning with Continuous Distribution Shifts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Many existing continual graph learning methods implicitly depend on task boundaries and degrade under continuous distribution shifts in task-free streams.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dongjin Song, Guiquan Sun, Jingchao Ni, Xikun Zhang","submitted_at":"2026-05-13T04:54:46Z","abstract_excerpt":"Continual graph learning (CGL) aims to learn from dynamically evolving graphs while mitigating catastrophic forgetting. Existing CGL approaches typically adopt a task-based formulation, where the data stream is partitioned into a sequence of discrete tasks with pre-defined boundaries. However, such assumptions rarely hold in real-world environments, where data distributions evolve continuously and task identity is often unavailable. To better reflect realistic non-stationary environments, we revisit continual graph learning from a task-free perspective. We propose a unified formulation that mo"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.12998","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T04:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"e66405226b3f233c78297d8164d3ad69b66251c9a8344dce723edb5bb20a71b1","abstract_canon_sha256":"2e085b0040a60160621ff1492320a58627da50bec6e5a08459d01650b8ecc192"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:00.468908Z","signature_b64":"ZJzsoS8gCPhCZh8cn+gmRTzAh2XaI5SHMT+gLbtDLyRejxWvQDciNw9Qj+MByk2HKssgvxUkhZYKYzLFx55aDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a55e8c32bb3a94038a322260d45cd47d3e9ad589772390d3e9b512f1c7135cdf","last_reissued_at":"2026-05-18T03:09:00.468382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:00.468382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DRIFT: A Benchmark for Task-Free Continual Graph Learning with Continuous Distribution Shifts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Many existing continual graph learning methods implicitly depend on task boundaries and degrade under continuous distribution shifts in task-free streams.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dongjin Song, Guiquan Sun, Jingchao Ni, Xikun Zhang","submitted_at":"2026-05-13T04:54:46Z","abstract_excerpt":"Continual graph learning (CGL) aims to learn from dynamically evolving graphs while mitigating catastrophic forgetting. Existing CGL approaches typically adopt a task-based formulation, where the data stream is partitioned into a sequence of discrete tasks with pre-defined boundaries. However, such assumptions rarely hold in real-world environments, where data distributions evolve continuously and task identity is often unavailable. To better reflect realistic non-stationary environments, we revisit continual graph learning from a task-free perspective. We propose a unified formulation that mo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our findings indicate that many existing approaches implicitly rely on task boundary information and struggle under realistic task-free graph streams.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The Gaussian parameterization of transition dynamics between latent task distributions accurately captures the spectrum of real-world continuous distribution shifts in graph data.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"DRIFT benchmark shows substantial performance degradation for continual graph learning methods under task-free continuous distribution shifts modeled via Gaussian mixtures.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Many existing continual graph learning methods implicitly depend on task boundaries and degrade under continuous distribution shifts in task-free streams.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b7e567077d7062c3d3d931e9e87470aa1258a55f80f6ccb8f9283abc454d2da7"},"source":{"id":"2605.12998","kind":"arxiv","version":2},"verdict":{"id":"086289f7-17a4-4c91-a067-95e44fb45f61","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T05:42:58.834938Z","strongest_claim":"Our findings indicate that many existing approaches implicitly rely on task boundary information and struggle under realistic task-free graph streams.","one_line_summary":"DRIFT benchmark shows substantial performance degradation for continual graph learning methods under task-free continuous distribution shifts modeled via Gaussian mixtures.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The Gaussian parameterization of transition dynamics between latent task distributions accurately captures the spectrum of real-world continuous distribution shifts in graph data.","pith_extraction_headline":"Many existing continual graph learning methods implicitly depend on task boundaries and degrade under continuous distribution shifts in task-free streams."},"references":{"count":51,"sample":[{"doi":"","year":2017,"title":"Inductive representation learning on large graphs","work_id":"ee217072-19c9-4225-b00c-43701e678a27","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Open graph benchmark: Datasets for machine learning on graphs","work_id":"39cc4a5f-a4c0-4922-a15f-e07bc2f727e8","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Knowledge graph embedding: A survey of approaches and applications.IEEE transactions on knowledge and data engineering, 29:2724– 2743, 2017","work_id":"f7234f26-5339-4a43-866a-dc905f24ca7a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Overcoming catastrophic forgetting in neural networks.Proceedings of the national academy of sciences, 114(13):3521–3526","work_id":"68b7964f-cd25-47e6-a060-52bbc86a995d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1902,"title":"Chaudhry et al","work_id":"001da84d-4329-4699-85e9-5431d143af9b","ref_index":5,"cited_arxiv_id":"1902.10486","is_internal_anchor":true}],"resolved_work":51,"snapshot_sha256":"b27d8fa8dbd02e8bdd2bfecf74b652ce5d94dd97daba7999229cbed6fac04de3","internal_anchors":4},"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":"2605.12998","created_at":"2026-05-18T03:09:00.468467+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12998v2","created_at":"2026-05-18T03:09:00.468467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12998","created_at":"2026-05-18T03:09:00.468467+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVPIYMV3HKKA","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVPIYMV3HKKAHCRS","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVPIYMV3","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UVPIYMV3HKKAHCRSEJQNIXGUPU","json":"https://pith.science/pith/UVPIYMV3HKKAHCRSEJQNIXGUPU.json","graph_json":"https://pith.science/api/pith-number/UVPIYMV3HKKAHCRSEJQNIXGUPU/graph.json","events_json":"https://pith.science/api/pith-number/UVPIYMV3HKKAHCRSEJQNIXGUPU/events.json","paper":"https://pith.science/paper/UVPIYMV3"},"agent_actions":{"view_html":"https://pith.science/pith/UVPIYMV3HKKAHCRSEJQNIXGUPU","download_json":"https://pith.science/pith/UVPIYMV3HKKAHCRSEJQNIXGUPU.json","view_paper":"https://pith.science/paper/UVPIYMV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12998&json=true","fetch_graph":"https://pith.science/api/pith-number/UVPIYMV3HKKAHCRSEJQNIXGUPU/graph.json","fetch_events":"https://pith.science/api/pith-number/UVPIYMV3HKKAHCRSEJQNIXGUPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVPIYMV3HKKAHCRSEJQNIXGUPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVPIYMV3HKKAHCRSEJQNIXGUPU/action/storage_attestation","attest_author":"https://pith.science/pith/UVPIYMV3HKKAHCRSEJQNIXGUPU/action/author_attestation","sign_citation":"https://pith.science/pith/UVPIYMV3HKKAHCRSEJQNIXGUPU/action/citation_signature","submit_replication":"https://pith.science/pith/UVPIYMV3HKKAHCRSEJQNIXGUPU/action/replication_record"}},"created_at":"2026-05-18T03:09:00.468467+00:00","updated_at":"2026-05-18T03:09:00.468467+00:00"}