{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:L4LAQBKPFDKT2ZTKSPKT3OZF6W","short_pith_number":"pith:L4LAQBKP","canonical_record":{"source":{"id":"2507.20460","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-28T01:30:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"651cd124d1b32ea53e66545e8ad407f26f9847a33df680ed9662e6fccdf77404","abstract_canon_sha256":"64022504940c2935fcd596465f39a39537f755776ceacbad8a8027af54a8d24a"},"schema_version":"1.0"},"canonical_sha256":"5f1608054f28d53d666a93d53dbb25f5b28533d2660a7b14c334ab595a5c6867","source":{"kind":"arxiv","id":"2507.20460","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20460","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20460v1","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20460","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"L4LAQBKPFDKT","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_16","alias_value":"L4LAQBKPFDKT2ZTK","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_8","alias_value":"L4LAQBKP","created_at":"2026-07-05T11:44:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:L4LAQBKPFDKT2ZTKSPKT3OZF6W","target":"record","payload":{"canonical_record":{"source":{"id":"2507.20460","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-28T01:30:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"651cd124d1b32ea53e66545e8ad407f26f9847a33df680ed9662e6fccdf77404","abstract_canon_sha256":"64022504940c2935fcd596465f39a39537f755776ceacbad8a8027af54a8d24a"},"schema_version":"1.0"},"canonical_sha256":"5f1608054f28d53d666a93d53dbb25f5b28533d2660a7b14c334ab595a5c6867","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:19.679738Z","signature_b64":"2nbA5JHkdhp/ptekxbNYdz0h+5XQ/4F3gnmmUV8u/hmxCzKLVKdpUqPOpfhDfGEfRClECi0wwcZ6xe9vQjyrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f1608054f28d53d666a93d53dbb25f5b28533d2660a7b14c334ab595a5c6867","last_reissued_at":"2026-07-05T11:44:19.679221Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:19.679221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.20460","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:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1gbVofLSfI58m7Cmr2LYTya1WAG+rxGCpLNRV7wSYAUxmm+uIkCNTJFzLr6G3ZnRc4+yf7pQq6teuoyeUWQDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:23:35.095431Z"},"content_sha256":"59b0da7d241a842deb36336016651c5d02c6d734af9a3887dd9d88cc756679a8","schema_version":"1.0","event_id":"sha256:59b0da7d241a842deb36336016651c5d02c6d734af9a3887dd9d88cc756679a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:L4LAQBKPFDKT2ZTKSPKT3OZF6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shapley-Value-Based Graph Sparsification for GNN Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ariful Azad, Selahattin Akkas","submitted_at":"2025-07-28T01:30:09Z","abstract_excerpt":"Graph sparsification is a key technique for improving inference efficiency in Graph Neural Networks by removing edges with minimal impact on predictions. GNN explainability methods generate local importance scores, which can be aggregated into global scores for graph sparsification. However, many explainability methods produce only non-negative scores, limiting their applicability for sparsification. In contrast, Shapley value based methods assign both positive and negative contributions to node predictions, offering a theoretically robust and fair allocation of importance by evaluating many s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20460","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/2507.20460/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:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWBVzt8glntrlnYjRXWXD+g71Xv5moWVLXtSwj+3kzYJXmBt/m29VpyeIEnBwVYYEiIzEFm7ZLopdJfKNurWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:23:35.096097Z"},"content_sha256":"b02bccde9ddf4319dc9c793419533cd4697391a913d7e1f523793e1acfb6124e","schema_version":"1.0","event_id":"sha256:b02bccde9ddf4319dc9c793419533cd4697391a913d7e1f523793e1acfb6124e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4LAQBKPFDKT2ZTKSPKT3OZF6W/bundle.json","state_url":"https://pith.science/pith/L4LAQBKPFDKT2ZTKSPKT3OZF6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4LAQBKPFDKT2ZTKSPKT3OZF6W/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-07-07T06:23:35Z","links":{"resolver":"https://pith.science/pith/L4LAQBKPFDKT2ZTKSPKT3OZF6W","bundle":"https://pith.science/pith/L4LAQBKPFDKT2ZTKSPKT3OZF6W/bundle.json","state":"https://pith.science/pith/L4LAQBKPFDKT2ZTKSPKT3OZF6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4LAQBKPFDKT2ZTKSPKT3OZF6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:L4LAQBKPFDKT2ZTKSPKT3OZF6W","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":"64022504940c2935fcd596465f39a39537f755776ceacbad8a8027af54a8d24a","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-28T01:30:09Z","title_canon_sha256":"651cd124d1b32ea53e66545e8ad407f26f9847a33df680ed9662e6fccdf77404"},"schema_version":"1.0","source":{"id":"2507.20460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20460","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20460v1","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20460","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"L4LAQBKPFDKT","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_16","alias_value":"L4LAQBKPFDKT2ZTK","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_8","alias_value":"L4LAQBKP","created_at":"2026-07-05T11:44:19Z"}],"graph_snapshots":[{"event_id":"sha256:b02bccde9ddf4319dc9c793419533cd4697391a913d7e1f523793e1acfb6124e","target":"graph","created_at":"2026-07-05T11:44: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/2507.20460/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph sparsification is a key technique for improving inference efficiency in Graph Neural Networks by removing edges with minimal impact on predictions. GNN explainability methods generate local importance scores, which can be aggregated into global scores for graph sparsification. However, many explainability methods produce only non-negative scores, limiting their applicability for sparsification. In contrast, Shapley value based methods assign both positive and negative contributions to node predictions, offering a theoretically robust and fair allocation of importance by evaluating many s","authors_text":"Ariful Azad, Selahattin Akkas","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-28T01:30:09Z","title":"Shapley-Value-Based Graph Sparsification for GNN Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20460","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:59b0da7d241a842deb36336016651c5d02c6d734af9a3887dd9d88cc756679a8","target":"record","created_at":"2026-07-05T11:44: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":"64022504940c2935fcd596465f39a39537f755776ceacbad8a8027af54a8d24a","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-28T01:30:09Z","title_canon_sha256":"651cd124d1b32ea53e66545e8ad407f26f9847a33df680ed9662e6fccdf77404"},"schema_version":"1.0","source":{"id":"2507.20460","kind":"arxiv","version":1}},"canonical_sha256":"5f1608054f28d53d666a93d53dbb25f5b28533d2660a7b14c334ab595a5c6867","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f1608054f28d53d666a93d53dbb25f5b28533d2660a7b14c334ab595a5c6867","first_computed_at":"2026-07-05T11:44:19.679221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:19.679221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2nbA5JHkdhp/ptekxbNYdz0h+5XQ/4F3gnmmUV8u/hmxCzKLVKdpUqPOpfhDfGEfRClECi0wwcZ6xe9vQjyrAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:19.679738Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.20460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59b0da7d241a842deb36336016651c5d02c6d734af9a3887dd9d88cc756679a8","sha256:b02bccde9ddf4319dc9c793419533cd4697391a913d7e1f523793e1acfb6124e"],"state_sha256":"fd973d0d4ab92c869684ab233190d115600ab8c60fe25424392b0ce488d55ff7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XljPOwz9e+nCuvpR3WQMudEZUxNBoVSqr6K/WsmjJ9NgN581QsjU8kRjPIezHAxAo9bL+TxkvIAINP9P7OGwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:23:35.099860Z","bundle_sha256":"f93c7b8158c2c189a3b6fcff0559f0240e23f902007512299a94712d1291015b"}}