{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2LK7APZOK5CIQCPWL7Z3FD4UEE","short_pith_number":"pith:2LK7APZO","canonical_record":{"source":{"id":"2605.25662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-25T10:12:43Z","cross_cats_sorted":[],"title_canon_sha256":"3c5685555bd8e19cfc4a3de1a446e889498e60d7077811e1178b4d77da76e7d2","abstract_canon_sha256":"699ebf59549956fd22a5d6bb46ea6e3e842283e89c04147822cc7c6cf4ca7b2b"},"schema_version":"1.0"},"canonical_sha256":"d2d5f03f2e57448809f65ff3b28f94213f1c31f63cd91cde0c9b5e2c759c8646","source":{"kind":"arxiv","id":"2605.25662","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25662","created_at":"2026-05-26T02:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25662v1","created_at":"2026-05-26T02:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25662","created_at":"2026-05-26T02:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"2LK7APZOK5CI","created_at":"2026-05-26T02:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"2LK7APZOK5CIQCPW","created_at":"2026-05-26T02:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"2LK7APZO","created_at":"2026-05-26T02:04:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2LK7APZOK5CIQCPWL7Z3FD4UEE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.25662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-25T10:12:43Z","cross_cats_sorted":[],"title_canon_sha256":"3c5685555bd8e19cfc4a3de1a446e889498e60d7077811e1178b4d77da76e7d2","abstract_canon_sha256":"699ebf59549956fd22a5d6bb46ea6e3e842283e89c04147822cc7c6cf4ca7b2b"},"schema_version":"1.0"},"canonical_sha256":"d2d5f03f2e57448809f65ff3b28f94213f1c31f63cd91cde0c9b5e2c759c8646","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:48.897282Z","signature_b64":"NUh0dS6pGv5PCzB4airv1qj5MN+eV5xNlft9E/JdSqmt1KYEm+LX4LZeP50IabcYaTVCMgaF92UsuGVy55hHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2d5f03f2e57448809f65ff3b28f94213f1c31f63cd91cde0c9b5e2c759c8646","last_reissued_at":"2026-05-26T02:04:48.896478Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:48.896478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.25662","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-05-26T02:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cT1HsMW0tevVAarrLLOHWtxstIwANbkVwFOCWaUGEqq3+SssLbDDr+czZuZlZHiVBWCWhjJIziYYKoA20ay7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:43:44.244160Z"},"content_sha256":"71fd9c712ef1a9edc6f37aa4197cfb290ba4172a5a8a986efa073984ef467c98","schema_version":"1.0","event_id":"sha256:71fd9c712ef1a9edc6f37aa4197cfb290ba4172a5a8a986efa073984ef467c98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2LK7APZOK5CIQCPWL7Z3FD4UEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Closed-Form Node Classification with Exact Graph Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aditya Gaur, Charu Sharma","submitted_at":"2026-05-25T10:12:43Z","abstract_excerpt":"Graph neural networks for node classification are typically trained by gradient descent over hundreds or thousands of epochs. Recent work has shown that, when properly tuned, classic GCN/SAGE/GAT architectures can match graph transformers on many node-classification benchmarks. We ask a complementary question: how much of this performance can be recovered by deterministic closed-form solvers, and what guarantees does this enable?\n  We introduce a routed closed-form framework selected by adjusted homophily. For assortative graphs, we use SGC-style propagation followed by Ridge regression; for h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25662","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/2605.25662/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-05-26T02:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2sf4eJKg177hRNeUj7jJJddg8eCmf8oiGNJB+D+lzOeVN7KjW6l5/3VGQ2bUz81SKyxR+Oz1J9L3LXbcaQACCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:43:44.244605Z"},"content_sha256":"8bd26f87a36e9f919ab1a16f5a8989ef1087fa857c59ee597356c23bc543329a","schema_version":"1.0","event_id":"sha256:8bd26f87a36e9f919ab1a16f5a8989ef1087fa857c59ee597356c23bc543329a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LK7APZOK5CIQCPWL7Z3FD4UEE/bundle.json","state_url":"https://pith.science/pith/2LK7APZOK5CIQCPWL7Z3FD4UEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LK7APZOK5CIQCPWL7Z3FD4UEE/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-05-28T20:43:44Z","links":{"resolver":"https://pith.science/pith/2LK7APZOK5CIQCPWL7Z3FD4UEE","bundle":"https://pith.science/pith/2LK7APZOK5CIQCPWL7Z3FD4UEE/bundle.json","state":"https://pith.science/pith/2LK7APZOK5CIQCPWL7Z3FD4UEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LK7APZOK5CIQCPWL7Z3FD4UEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2LK7APZOK5CIQCPWL7Z3FD4UEE","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":"699ebf59549956fd22a5d6bb46ea6e3e842283e89c04147822cc7c6cf4ca7b2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-25T10:12:43Z","title_canon_sha256":"3c5685555bd8e19cfc4a3de1a446e889498e60d7077811e1178b4d77da76e7d2"},"schema_version":"1.0","source":{"id":"2605.25662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25662","created_at":"2026-05-26T02:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25662v1","created_at":"2026-05-26T02:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25662","created_at":"2026-05-26T02:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"2LK7APZOK5CI","created_at":"2026-05-26T02:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"2LK7APZOK5CIQCPW","created_at":"2026-05-26T02:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"2LK7APZO","created_at":"2026-05-26T02:04:48Z"}],"graph_snapshots":[{"event_id":"sha256:8bd26f87a36e9f919ab1a16f5a8989ef1087fa857c59ee597356c23bc543329a","target":"graph","created_at":"2026-05-26T02:04:48Z","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/2605.25662/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks for node classification are typically trained by gradient descent over hundreds or thousands of epochs. Recent work has shown that, when properly tuned, classic GCN/SAGE/GAT architectures can match graph transformers on many node-classification benchmarks. We ask a complementary question: how much of this performance can be recovered by deterministic closed-form solvers, and what guarantees does this enable?\n  We introduce a routed closed-form framework selected by adjusted homophily. For assortative graphs, we use SGC-style propagation followed by Ridge regression; for h","authors_text":"Aditya Gaur, Charu Sharma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-25T10:12:43Z","title":"Closed-Form Node Classification with Exact Graph Unlearning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25662","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:71fd9c712ef1a9edc6f37aa4197cfb290ba4172a5a8a986efa073984ef467c98","target":"record","created_at":"2026-05-26T02:04:48Z","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":"699ebf59549956fd22a5d6bb46ea6e3e842283e89c04147822cc7c6cf4ca7b2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-25T10:12:43Z","title_canon_sha256":"3c5685555bd8e19cfc4a3de1a446e889498e60d7077811e1178b4d77da76e7d2"},"schema_version":"1.0","source":{"id":"2605.25662","kind":"arxiv","version":1}},"canonical_sha256":"d2d5f03f2e57448809f65ff3b28f94213f1c31f63cd91cde0c9b5e2c759c8646","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2d5f03f2e57448809f65ff3b28f94213f1c31f63cd91cde0c9b5e2c759c8646","first_computed_at":"2026-05-26T02:04:48.896478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:04:48.896478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NUh0dS6pGv5PCzB4airv1qj5MN+eV5xNlft9E/JdSqmt1KYEm+LX4LZeP50IabcYaTVCMgaF92UsuGVy55hHDg==","signature_status":"signed_v1","signed_at":"2026-05-26T02:04:48.897282Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71fd9c712ef1a9edc6f37aa4197cfb290ba4172a5a8a986efa073984ef467c98","sha256:8bd26f87a36e9f919ab1a16f5a8989ef1087fa857c59ee597356c23bc543329a"],"state_sha256":"b49b2fdb075c7b745e75b6c018a9a50a1e991fcaa34b964af71398813aec1d45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uLKFRmhHDXc91cDL1BVXrf6xbW8Ki9cdeCOBXHm6kkynBmBCV0x7DxzB/NrWEyXVFLyJVgJT2dMrKp9tGgU/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:43:44.247359Z","bundle_sha256":"96873ed4590ab8d73b09af74dc4be98c365a9c539839e62c1df9b7caf08cf3ec"}}