{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SBDKNCXNBZVH6E6SPXWGFJXGRY","short_pith_number":"pith:SBDKNCXN","canonical_record":{"source":{"id":"2408.09212","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-17T14:41:02Z","cross_cats_sorted":[],"title_canon_sha256":"f508fd2c034da0b0b2ccc01494d772eb3799cbb9dd3c31ff85f716b94e51ea4e","abstract_canon_sha256":"c786ad55503e1f3d4e02cf412dd62e63ad0d6325264cee425bd598053cf16442"},"schema_version":"1.0"},"canonical_sha256":"9046a68aed0e6a7f13d27dec62a6e68e2da28db0a99fea80642938cc5c58dc39","source":{"kind":"arxiv","id":"2408.09212","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.09212","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"2408.09212v3","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.09212","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"SBDKNCXNBZVH","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_16","alias_value":"SBDKNCXNBZVH6E6S","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_8","alias_value":"SBDKNCXN","created_at":"2026-07-05T10:15:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SBDKNCXNBZVH6E6SPXWGFJXGRY","target":"record","payload":{"canonical_record":{"source":{"id":"2408.09212","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-17T14:41:02Z","cross_cats_sorted":[],"title_canon_sha256":"f508fd2c034da0b0b2ccc01494d772eb3799cbb9dd3c31ff85f716b94e51ea4e","abstract_canon_sha256":"c786ad55503e1f3d4e02cf412dd62e63ad0d6325264cee425bd598053cf16442"},"schema_version":"1.0"},"canonical_sha256":"9046a68aed0e6a7f13d27dec62a6e68e2da28db0a99fea80642938cc5c58dc39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:45.231574Z","signature_b64":"25Fe0wWbeXR+qrJtSCy0sAPAvCkFdW6ClAgPYMdqmd8c7vnO5wDSNaJo+/DLiTv6HlXmf7f7k38roD79sa0vDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9046a68aed0e6a7f13d27dec62a6e68e2da28db0a99fea80642938cc5c58dc39","last_reissued_at":"2026-07-05T10:15:45.230957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:45.230957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.09212","source_version":3,"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-05T10:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JN1Z8+c6nfT4HKvfinQxSbojl/A7S0uVaC+D7K0/U5+Qh5gmOPIhIo4DuwqFYmd3Zd65fjjkeexFAWr5zB5aAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T15:38:10.774473Z"},"content_sha256":"6ae95aabc2e553f20763e962ebfabb1bbd1d064c6762ff6efec3d24806bbafd6","schema_version":"1.0","event_id":"sha256:6ae95aabc2e553f20763e962ebfabb1bbd1d064c6762ff6efec3d24806bbafd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SBDKNCXNBZVH6E6SPXWGFJXGRY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable and Certifiable Graph Unlearning: Overcoming the Approximation Error Barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lu Yi, Zhewei Wei","submitted_at":"2024-08-17T14:41:02Z","abstract_excerpt":"Graph unlearning has emerged as a pivotal research area for ensuring privacy protection, given the widespread adoption of Graph Neural Networks (GNNs) in applications involving sensitive user data. Among existing studies, certified graph unlearning is distinguished by providing robust privacy guarantees. However, current certified graph unlearning methods are impractical for large-scale graphs because they necessitate the costly re-computation of graph propagation for each unlearning request. Although numerous scalable techniques have been developed to accelerate graph propagation for GNNs, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.09212","kind":"arxiv","version":3},"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/2408.09212/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-05T10:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5O5fsXrxm1B6f5XuO7ZzlRHHKNxJgDKI6cBpkKchuKZ8Vm/AI8c6e0P4oV+wAuL86QAq22gYqRC9YetN9P5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T15:38:10.775012Z"},"content_sha256":"bbae053f4baca3820297f5dffc0fc682d1e4ddebad1f9c90bef7ea846cdd1c91","schema_version":"1.0","event_id":"sha256:bbae053f4baca3820297f5dffc0fc682d1e4ddebad1f9c90bef7ea846cdd1c91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBDKNCXNBZVH6E6SPXWGFJXGRY/bundle.json","state_url":"https://pith.science/pith/SBDKNCXNBZVH6E6SPXWGFJXGRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBDKNCXNBZVH6E6SPXWGFJXGRY/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-20T15:38:10Z","links":{"resolver":"https://pith.science/pith/SBDKNCXNBZVH6E6SPXWGFJXGRY","bundle":"https://pith.science/pith/SBDKNCXNBZVH6E6SPXWGFJXGRY/bundle.json","state":"https://pith.science/pith/SBDKNCXNBZVH6E6SPXWGFJXGRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBDKNCXNBZVH6E6SPXWGFJXGRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SBDKNCXNBZVH6E6SPXWGFJXGRY","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":"c786ad55503e1f3d4e02cf412dd62e63ad0d6325264cee425bd598053cf16442","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-17T14:41:02Z","title_canon_sha256":"f508fd2c034da0b0b2ccc01494d772eb3799cbb9dd3c31ff85f716b94e51ea4e"},"schema_version":"1.0","source":{"id":"2408.09212","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.09212","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"2408.09212v3","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.09212","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"SBDKNCXNBZVH","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_16","alias_value":"SBDKNCXNBZVH6E6S","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_8","alias_value":"SBDKNCXN","created_at":"2026-07-05T10:15:45Z"}],"graph_snapshots":[{"event_id":"sha256:bbae053f4baca3820297f5dffc0fc682d1e4ddebad1f9c90bef7ea846cdd1c91","target":"graph","created_at":"2026-07-05T10:15:45Z","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/2408.09212/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph unlearning has emerged as a pivotal research area for ensuring privacy protection, given the widespread adoption of Graph Neural Networks (GNNs) in applications involving sensitive user data. Among existing studies, certified graph unlearning is distinguished by providing robust privacy guarantees. However, current certified graph unlearning methods are impractical for large-scale graphs because they necessitate the costly re-computation of graph propagation for each unlearning request. Although numerous scalable techniques have been developed to accelerate graph propagation for GNNs, th","authors_text":"Lu Yi, Zhewei Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-17T14:41:02Z","title":"Scalable and Certifiable Graph Unlearning: Overcoming the Approximation Error Barrier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.09212","kind":"arxiv","version":3},"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:6ae95aabc2e553f20763e962ebfabb1bbd1d064c6762ff6efec3d24806bbafd6","target":"record","created_at":"2026-07-05T10:15:45Z","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":"c786ad55503e1f3d4e02cf412dd62e63ad0d6325264cee425bd598053cf16442","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-17T14:41:02Z","title_canon_sha256":"f508fd2c034da0b0b2ccc01494d772eb3799cbb9dd3c31ff85f716b94e51ea4e"},"schema_version":"1.0","source":{"id":"2408.09212","kind":"arxiv","version":3}},"canonical_sha256":"9046a68aed0e6a7f13d27dec62a6e68e2da28db0a99fea80642938cc5c58dc39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9046a68aed0e6a7f13d27dec62a6e68e2da28db0a99fea80642938cc5c58dc39","first_computed_at":"2026-07-05T10:15:45.230957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:45.230957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"25Fe0wWbeXR+qrJtSCy0sAPAvCkFdW6ClAgPYMdqmd8c7vnO5wDSNaJo+/DLiTv6HlXmf7f7k38roD79sa0vDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:45.231574Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.09212","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ae95aabc2e553f20763e962ebfabb1bbd1d064c6762ff6efec3d24806bbafd6","sha256:bbae053f4baca3820297f5dffc0fc682d1e4ddebad1f9c90bef7ea846cdd1c91"],"state_sha256":"5eea500099e8ca8444c238d483ff6559ef4cbd335636fe64ddc43b24e32fcf1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DAHN0jkVGw+pHB33YiGdnkdDuQg8W5zuC0cxLelnOCKzTrtUqI06Nw3GzLvc533KCIauYTgRTL1IdCIEEhPHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T15:38:10.782296Z","bundle_sha256":"fb521ae2946f95db1e2fa887950e60492964319f7bca57c6dc23d697cd0079b3"}}