{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OJODRY7ZHGQXPS6EDHB2KS4FO3","short_pith_number":"pith:OJODRY7Z","schema_version":"1.0","canonical_sha256":"725c38e3f939a177cbc419c3a54b8576face7c420888c4edfdd71909e41f6692","source":{"kind":"arxiv","id":"2407.19183","version":2},"attestation_state":"computed","paper":{"title":"Graph Memory Learning: Imitating Lifelong Remembering and Forgetting of Brain Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Jiaxing Miao, Liang Hu, Longbing Cao, Qi Zhang","submitted_at":"2024-07-27T05:50:54Z","abstract_excerpt":"Graph data in real-world scenarios undergo rapid and frequent changes, making it challenging for existing graph models to effectively handle the continuous influx of new data and accommodate data withdrawal requests. The approach to frequently retraining graph models is resource intensive and impractical. To address this pressing challenge, this paper introduces a new concept of graph memory learning. Its core idea is to enable a graph model to selectively remember new knowledge but forget old knowledge. Building on this approach, the paper presents a novel graph memory learning framework - Br"},"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":"2407.19183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-27T05:50:54Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"9642545cb23252ac778c47fab002bf0b832713f116f1f6470c9dad6e7aec047c","abstract_canon_sha256":"4cb4b3d89efd058b8782535a38a1a6abf5be67fa36ce2f0dca00503fdd85806f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:19.873897Z","signature_b64":"DIruJY7Q5Vje2lTeJkfTM3rp3oBM6yGeUs8s/W5bSVOnCbJVangQqVld+h7EzrkSQjNlC+v8uuUXsfVMAWYUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"725c38e3f939a177cbc419c3a54b8576face7c420888c4edfdd71909e41f6692","last_reissued_at":"2026-07-05T11:58:19.873456Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:19.873456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Memory Learning: Imitating Lifelong Remembering and Forgetting of Brain Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Jiaxing Miao, Liang Hu, Longbing Cao, Qi Zhang","submitted_at":"2024-07-27T05:50:54Z","abstract_excerpt":"Graph data in real-world scenarios undergo rapid and frequent changes, making it challenging for existing graph models to effectively handle the continuous influx of new data and accommodate data withdrawal requests. The approach to frequently retraining graph models is resource intensive and impractical. To address this pressing challenge, this paper introduces a new concept of graph memory learning. Its core idea is to enable a graph model to selectively remember new knowledge but forget old knowledge. Building on this approach, the paper presents a novel graph memory learning framework - Br"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.19183","kind":"arxiv","version":2},"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/2407.19183/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":"2407.19183","created_at":"2026-07-05T11:58:19.873510+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.19183v2","created_at":"2026-07-05T11:58:19.873510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.19183","created_at":"2026-07-05T11:58:19.873510+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJODRY7ZHGQX","created_at":"2026-07-05T11:58:19.873510+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJODRY7ZHGQXPS6E","created_at":"2026-07-05T11:58:19.873510+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJODRY7Z","created_at":"2026-07-05T11:58:19.873510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19486","citing_title":"Recalling The Forgotten Class Memberships: Unlearned Models Can Be Noisy Labelers to Leak Privacy","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3","json":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3.json","graph_json":"https://pith.science/api/pith-number/OJODRY7ZHGQXPS6EDHB2KS4FO3/graph.json","events_json":"https://pith.science/api/pith-number/OJODRY7ZHGQXPS6EDHB2KS4FO3/events.json","paper":"https://pith.science/paper/OJODRY7Z"},"agent_actions":{"view_html":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3","download_json":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3.json","view_paper":"https://pith.science/paper/OJODRY7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.19183&json=true","fetch_graph":"https://pith.science/api/pith-number/OJODRY7ZHGQXPS6EDHB2KS4FO3/graph.json","fetch_events":"https://pith.science/api/pith-number/OJODRY7ZHGQXPS6EDHB2KS4FO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/action/storage_attestation","attest_author":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/action/author_attestation","sign_citation":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/action/citation_signature","submit_replication":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/action/replication_record"}},"created_at":"2026-07-05T11:58:19.873510+00:00","updated_at":"2026-07-05T11:58:19.873510+00:00"}