{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TRYC5IXEOLPQBRIUVX7T4KAWT4","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":"9f06d08e3110b00ae045bca22a30fafe44b2b6f2f8e9d0592ae99b2d8fc2805c","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-26T15:47:45Z","title_canon_sha256":"5553daa5904076e2c119b996f7450e9a4cea8eb6f9e6f1579ab8f5e165881b0c"},"schema_version":"1.0","source":{"id":"2601.18608","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.18608","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2601.18608v3","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.18608","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"TRYC5IXEOLPQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TRYC5IXEOLPQBRIU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TRYC5IXE","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2ea858ea32daf16330beacaab08643fab1bd0acbbb33ac59e39cb0c346239406","target":"graph","created_at":"2026-05-18T02:44:31Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that paired sampling outputs exactly the same Shapley value approximations as second-order PolySHAP, without ever fitting a degree 2 polynomial. To the best of our knowledge, this finding provides the first strong theoretical justification for the excellent practical performance of the paired sampling heuristic."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the underlying cooperative game value function admits a useful low-degree polynomial approximation under the sampling distribution used for KernelSHAP-style estimation."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PolySHAP approximates Shapley values via polynomial regression and proves paired sampling equals its quadratic version, providing the first theoretical justification for that heuristic."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"PolySHAP shows that the paired sampling heuristic in KernelSHAP produces exactly the same Shapley approximations as fitting a second-degree polynomial."}],"snapshot_sha256":"3b87e386a29c35b620689411f500761762e7b57e6d20dea2032b05a1c53eb9a0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8020b9188bd46df9dc350218c84d4e15f64dad05abd3b817cdb8bb828bff3a14"},"paper":{"abstract_excerpt":"Shapley values have emerged as a central game-theoretic tool in explainable AI (XAI). However, computing Shapley values exactly requires $2^d$ game evaluations for a model with $d$ features. Lundberg and Lee's KernelSHAP algorithm has emerged as a leading method for avoiding this exponential cost. KernelSHAP approximates Shapley values by approximating the game as a linear function, which is fit using a small number of game evaluations for random feature subsets.\n  In this work, we extend KernelSHAP by approximating the game via higher degree polynomials, which capture non-linear interactions ","authors_text":"Christopher Musco, Fabian Fumagalli, R. Teal Witter","cross_cats":["cs.LG"],"headline":"PolySHAP shows that the paired sampling heuristic in KernelSHAP produces exactly the same Shapley approximations as fitting a second-degree polynomial.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-26T15:47:45Z","title":"PolySHAP: Extending KernelSHAP with Interaction-Informed Polynomial Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.18608","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T11:14:21.184479Z","id":"a598b375-7a5d-4235-aaac-0e4905a637bc","model_set":{"reader":"grok-4.3"},"one_line_summary":"PolySHAP approximates Shapley values via polynomial regression and proves paired sampling equals its quadratic version, providing the first theoretical justification for that heuristic.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"PolySHAP shows that the paired sampling heuristic in KernelSHAP produces exactly the same Shapley approximations as fitting a second-degree polynomial.","strongest_claim":"We prove that paired sampling outputs exactly the same Shapley value approximations as second-order PolySHAP, without ever fitting a degree 2 polynomial. To the best of our knowledge, this finding provides the first strong theoretical justification for the excellent practical performance of the paired sampling heuristic.","weakest_assumption":"That the underlying cooperative game value function admits a useful low-degree polynomial approximation under the sampling distribution used for KernelSHAP-style estimation."}},"verdict_id":"a598b375-7a5d-4235-aaac-0e4905a637bc"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0cfc3d4af70c6248d98531fc8191176221888a9ecd201d44f199698ba46bc07d","target":"record","created_at":"2026-05-18T02:44:31Z","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":"9f06d08e3110b00ae045bca22a30fafe44b2b6f2f8e9d0592ae99b2d8fc2805c","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-26T15:47:45Z","title_canon_sha256":"5553daa5904076e2c119b996f7450e9a4cea8eb6f9e6f1579ab8f5e165881b0c"},"schema_version":"1.0","source":{"id":"2601.18608","kind":"arxiv","version":3}},"canonical_sha256":"9c702ea2e472df00c514adff3e28169f1bc2c8060bf23ed748e469c62228e6fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c702ea2e472df00c514adff3e28169f1bc2c8060bf23ed748e469c62228e6fc","first_computed_at":"2026-05-18T02:44:31.853597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:31.853597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GFuYqG/HQzQ+wHy231nUMotdoOW3I2wey+GfEWP96SNdm6MlYF+VpBYFiWkNhOT89r+H3aRy0S8dQNsjEAk7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:31.854098Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.18608","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cfc3d4af70c6248d98531fc8191176221888a9ecd201d44f199698ba46bc07d","sha256:2ea858ea32daf16330beacaab08643fab1bd0acbbb33ac59e39cb0c346239406"],"state_sha256":"58fc686c1ce2586bd2481530b524232da833b613010187a6e0ba87969012081e"}