{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PNAD7F5M6JF3I2GVFB2GBCJ3MW","short_pith_number":"pith:PNAD7F5M","canonical_record":{"source":{"id":"2505.12614","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-19T01:56:55Z","cross_cats_sorted":[],"title_canon_sha256":"938c7509ff6271d2465b7cc4f6bc32e915515b67862342cc3f178f839e3b83c3","abstract_canon_sha256":"11a9e00afbd05fff89f2680c30859096de227878671c9628eec00d69b4c9f1d9"},"schema_version":"1.0"},"canonical_sha256":"7b403f97acf24bb468d5287460893b659dea49476b7cf16d704f89a554432f1e","source":{"kind":"arxiv","id":"2505.12614","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12614","created_at":"2026-07-05T11:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12614v1","created_at":"2026-07-05T11:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12614","created_at":"2026-07-05T11:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"PNAD7F5M6JF3","created_at":"2026-07-05T11:05:06Z"},{"alias_kind":"pith_short_16","alias_value":"PNAD7F5M6JF3I2GV","created_at":"2026-07-05T11:05:06Z"},{"alias_kind":"pith_short_8","alias_value":"PNAD7F5M","created_at":"2026-07-05T11:05:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PNAD7F5M6JF3I2GVFB2GBCJ3MW","target":"record","payload":{"canonical_record":{"source":{"id":"2505.12614","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-19T01:56:55Z","cross_cats_sorted":[],"title_canon_sha256":"938c7509ff6271d2465b7cc4f6bc32e915515b67862342cc3f178f839e3b83c3","abstract_canon_sha256":"11a9e00afbd05fff89f2680c30859096de227878671c9628eec00d69b4c9f1d9"},"schema_version":"1.0"},"canonical_sha256":"7b403f97acf24bb468d5287460893b659dea49476b7cf16d704f89a554432f1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:06.977078Z","signature_b64":"xhSq1qaReK+nj7qJKFsB7W9KBz/U0YLWxnzLz+IhfsE6RQCwylyUls/d9wSWqd0tsf7ayH2/5d1YNJCN6ffvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b403f97acf24bb468d5287460893b659dea49476b7cf16d704f89a554432f1e","last_reissued_at":"2026-07-05T11:05:06.976581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:06.976581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.12614","source_version":1,"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:05:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yHbh/P8TSLYKn+0Yy3VdFLsQXf62DS83k9YJMiViJyd+ASTwgWXkM0N9C1bULviNSzNhWBLfNSY7pqTMlBwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T04:36:08.771555Z"},"content_sha256":"d65ac55d5d0ffb157698dcbcd8623402a176c83910def67e9774b0b10473e990","schema_version":"1.0","event_id":"sha256:d65ac55d5d0ffb157698dcbcd8623402a176c83910def67e9774b0b10473e990"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PNAD7F5M6JF3I2GVFB2GBCJ3MW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Graph Unlearning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guanfeng Liu, Jiajie Zhu, Pengfei Ding, Yan Wang","submitted_at":"2025-05-19T01:56:55Z","abstract_excerpt":"Graph unlearning, which deletes graph elements such as nodes and edges from trained graph neural networks (GNNs), is crucial for real-world applications where graph data may contain outdated, inaccurate, or privacy-sensitive information. However, existing methods often suffer from (1) incomplete or over unlearning due to neglecting the distinct objectives of different unlearning tasks, and (2) inaccurate identification of neighbors affected by deleted elements across various GNN architectures. To address these limitations, we propose AGU, a novel Adaptive Graph Unlearning framework that flexib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12614","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/2505.12614/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:05:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9FFqmVWwh/bBZ9lyxJQydjeK/61DjALhN1gxepecgKFHwiwpu3X49GI+fCiQLgwt5T2Fefk74yRRt+L7kcXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T04:36:08.771918Z"},"content_sha256":"470388d34371c3e333519f2b87eb780bf19544dc97e7037b14a261d770f82480","schema_version":"1.0","event_id":"sha256:470388d34371c3e333519f2b87eb780bf19544dc97e7037b14a261d770f82480"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNAD7F5M6JF3I2GVFB2GBCJ3MW/bundle.json","state_url":"https://pith.science/pith/PNAD7F5M6JF3I2GVFB2GBCJ3MW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNAD7F5M6JF3I2GVFB2GBCJ3MW/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-18T04:36:08Z","links":{"resolver":"https://pith.science/pith/PNAD7F5M6JF3I2GVFB2GBCJ3MW","bundle":"https://pith.science/pith/PNAD7F5M6JF3I2GVFB2GBCJ3MW/bundle.json","state":"https://pith.science/pith/PNAD7F5M6JF3I2GVFB2GBCJ3MW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNAD7F5M6JF3I2GVFB2GBCJ3MW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PNAD7F5M6JF3I2GVFB2GBCJ3MW","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":"11a9e00afbd05fff89f2680c30859096de227878671c9628eec00d69b4c9f1d9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-19T01:56:55Z","title_canon_sha256":"938c7509ff6271d2465b7cc4f6bc32e915515b67862342cc3f178f839e3b83c3"},"schema_version":"1.0","source":{"id":"2505.12614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12614","created_at":"2026-07-05T11:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12614v1","created_at":"2026-07-05T11:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12614","created_at":"2026-07-05T11:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"PNAD7F5M6JF3","created_at":"2026-07-05T11:05:06Z"},{"alias_kind":"pith_short_16","alias_value":"PNAD7F5M6JF3I2GV","created_at":"2026-07-05T11:05:06Z"},{"alias_kind":"pith_short_8","alias_value":"PNAD7F5M","created_at":"2026-07-05T11:05:06Z"}],"graph_snapshots":[{"event_id":"sha256:470388d34371c3e333519f2b87eb780bf19544dc97e7037b14a261d770f82480","target":"graph","created_at":"2026-07-05T11:05:06Z","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/2505.12614/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph unlearning, which deletes graph elements such as nodes and edges from trained graph neural networks (GNNs), is crucial for real-world applications where graph data may contain outdated, inaccurate, or privacy-sensitive information. However, existing methods often suffer from (1) incomplete or over unlearning due to neglecting the distinct objectives of different unlearning tasks, and (2) inaccurate identification of neighbors affected by deleted elements across various GNN architectures. To address these limitations, we propose AGU, a novel Adaptive Graph Unlearning framework that flexib","authors_text":"Guanfeng Liu, Jiajie Zhu, Pengfei Ding, Yan Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12614","kind":"arxiv","version":1},"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:d65ac55d5d0ffb157698dcbcd8623402a176c83910def67e9774b0b10473e990","target":"record","created_at":"2026-07-05T11:05:06Z","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":"11a9e00afbd05fff89f2680c30859096de227878671c9628eec00d69b4c9f1d9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-19T01:56:55Z","title_canon_sha256":"938c7509ff6271d2465b7cc4f6bc32e915515b67862342cc3f178f839e3b83c3"},"schema_version":"1.0","source":{"id":"2505.12614","kind":"arxiv","version":1}},"canonical_sha256":"7b403f97acf24bb468d5287460893b659dea49476b7cf16d704f89a554432f1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b403f97acf24bb468d5287460893b659dea49476b7cf16d704f89a554432f1e","first_computed_at":"2026-07-05T11:05:06.976581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:05:06.976581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xhSq1qaReK+nj7qJKFsB7W9KBz/U0YLWxnzLz+IhfsE6RQCwylyUls/d9wSWqd0tsf7ayH2/5d1YNJCN6ffvCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:05:06.977078Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.12614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d65ac55d5d0ffb157698dcbcd8623402a176c83910def67e9774b0b10473e990","sha256:470388d34371c3e333519f2b87eb780bf19544dc97e7037b14a261d770f82480"],"state_sha256":"8cb4e2bd2123ea8e9390f9c4e8909c3d5957e60dc39e8a3c1b7196a12b7de226"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Se0cTOSBBSAr0tzQDZVbsALhGAmQSrF2RWn/o0iIKycuDAKIxELT36iCfOy7zk8AI7ND9IoE3XP7nfFKaTa4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T04:36:08.775603Z","bundle_sha256":"05a8322ace662ea3816892128eb556681339affa997ba56de0ffa2d059c0093f"}}