{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OJODRY7ZHGQXPS6EDHB2KS4FO3","short_pith_number":"pith:OJODRY7Z","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"},"canonical_sha256":"725c38e3f939a177cbc419c3a54b8576face7c420888c4edfdd71909e41f6692","source":{"kind":"arxiv","id":"2407.19183","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.19183","created_at":"2026-07-05T11:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"2407.19183v2","created_at":"2026-07-05T11:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.19183","created_at":"2026-07-05T11:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"OJODRY7ZHGQX","created_at":"2026-07-05T11:58:19Z"},{"alias_kind":"pith_short_16","alias_value":"OJODRY7ZHGQXPS6E","created_at":"2026-07-05T11:58:19Z"},{"alias_kind":"pith_short_8","alias_value":"OJODRY7Z","created_at":"2026-07-05T11:58:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OJODRY7ZHGQXPS6EDHB2KS4FO3","target":"record","payload":{"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"},"canonical_sha256":"725c38e3f939a177cbc419c3a54b8576face7c420888c4edfdd71909e41f6692","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"},"source_kind":"arxiv","source_id":"2407.19183","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQv5+X/gi8SAd8MO123rkh44bX842lh6h7GZywahTTw3XABs5TRYFgtzAStOUcc+IPa7JzLOGO30MPvQ73u7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:58:12.778035Z"},"content_sha256":"e740c440d5a00b6cf2d3f8b650c83f53ed170282f14a8b66ba506b822de28b21","schema_version":"1.0","event_id":"sha256:e740c440d5a00b6cf2d3f8b650c83f53ed170282f14a8b66ba506b822de28b21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OJODRY7ZHGQXPS6EDHB2KS4FO3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AKMUYPCT4QYoKakjRS5rcjR+RbqM6LAfIpBScHcCHfihNje2V5+L1GgINEf3KBlIsHP2XetLxZKp2/86pj7WAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:58:12.778561Z"},"content_sha256":"b8a823983dbf26579d219fc3b5c56805cf4f7ca36e350a91a6cdd9458b273c93","schema_version":"1.0","event_id":"sha256:b8a823983dbf26579d219fc3b5c56805cf4f7ca36e350a91a6cdd9458b273c93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/bundle.json","state_url":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T13:58:12Z","links":{"resolver":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3","bundle":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/bundle.json","state":"https://pith.science/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJODRY7ZHGQXPS6EDHB2KS4FO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OJODRY7ZHGQXPS6EDHB2KS4FO3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4cb4b3d89efd058b8782535a38a1a6abf5be67fa36ce2f0dca00503fdd85806f","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-27T05:50:54Z","title_canon_sha256":"9642545cb23252ac778c47fab002bf0b832713f116f1f6470c9dad6e7aec047c"},"schema_version":"1.0","source":{"id":"2407.19183","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.19183","created_at":"2026-07-05T11:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"2407.19183v2","created_at":"2026-07-05T11:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.19183","created_at":"2026-07-05T11:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"OJODRY7ZHGQX","created_at":"2026-07-05T11:58:19Z"},{"alias_kind":"pith_short_16","alias_value":"OJODRY7ZHGQXPS6E","created_at":"2026-07-05T11:58:19Z"},{"alias_kind":"pith_short_8","alias_value":"OJODRY7Z","created_at":"2026-07-05T11:58:19Z"}],"graph_snapshots":[{"event_id":"sha256:b8a823983dbf26579d219fc3b5c56805cf4f7ca36e350a91a6cdd9458b273c93","target":"graph","created_at":"2026-07-05T11:58:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.19183/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jiaxing Miao, Liang Hu, Longbing Cao, Qi Zhang","cross_cats":["cs.AI","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-27T05:50:54Z","title":"Graph Memory Learning: Imitating Lifelong Remembering and Forgetting of Brain Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.19183","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e740c440d5a00b6cf2d3f8b650c83f53ed170282f14a8b66ba506b822de28b21","target":"record","created_at":"2026-07-05T11:58:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4cb4b3d89efd058b8782535a38a1a6abf5be67fa36ce2f0dca00503fdd85806f","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-27T05:50:54Z","title_canon_sha256":"9642545cb23252ac778c47fab002bf0b832713f116f1f6470c9dad6e7aec047c"},"schema_version":"1.0","source":{"id":"2407.19183","kind":"arxiv","version":2}},"canonical_sha256":"725c38e3f939a177cbc419c3a54b8576face7c420888c4edfdd71909e41f6692","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"725c38e3f939a177cbc419c3a54b8576face7c420888c4edfdd71909e41f6692","first_computed_at":"2026-07-05T11:58:19.873456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:58:19.873456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DIruJY7Q5Vje2lTeJkfTM3rp3oBM6yGeUs8s/W5bSVOnCbJVangQqVld+h7EzrkSQjNlC+v8uuUXsfVMAWYUDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:58:19.873897Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.19183","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e740c440d5a00b6cf2d3f8b650c83f53ed170282f14a8b66ba506b822de28b21","sha256:b8a823983dbf26579d219fc3b5c56805cf4f7ca36e350a91a6cdd9458b273c93"],"state_sha256":"bb45f263731330d9397d4c611572a7a919279d00ff0441a274b98ad527fa60a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BbAQyxUmm3fSCr6qTx9VSJGUDllKOsbvgbgLpMLhxcd4QfjrJLrh5VVkpoTkFmUOkxxmGHHUzJ27et+1d//tCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:58:12.781688Z","bundle_sha256":"cb8873f2d802ed236428b9177f2f067320200a9236eddc828f66d3bef95a4930"}}