{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LVUSEL3RPGEGJ37T3P6RNK3BLZ","short_pith_number":"pith:LVUSEL3R","schema_version":"1.0","canonical_sha256":"5d69222f71798864eff3dbfd16ab615e62cf4ed222dca4db3537ff23716501d5","source":{"kind":"arxiv","id":"2405.02936","version":2},"attestation_state":"computed","paper":{"title":"On the Tractability of SHAP Explanations under Markovian Distributions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Colin de la Higuera, Reda Marzouk","submitted_at":"2024-05-05T13:56:12Z","abstract_excerpt":"Thanks to its solid theoretical foundation, the SHAP framework is arguably one the most widely utilized frameworks for local explainability of ML models. Despite its popularity, its exact computation is known to be very challenging, proven to be NP-Hard in various configurations. Recent works have unveiled positive complexity results regarding the computation of the SHAP score for specific model families, encompassing decision trees, random forests, and some classes of boolean circuits. Yet, all these positive results hinge on the assumption of feature independence, often simplistic in real-wo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.02936","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-05T13:56:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"582010bda5a391fa0871542f387c55bcce7f20bdc0b2511d9ed9d04e05e70a65","abstract_canon_sha256":"05351fe1ccfe2f9fcbc651491abd26fcf383e2a737b8718a6f1ff3d9faf2ce05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:55.977130Z","signature_b64":"ObPKkMx7R9LOq2qUuuFZCB8dP3A7NbKVKkDm/psn7s9dSKFbpVLKzNYKEjwFQaxGwU1Ss1mevfsHqqE4MZNXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d69222f71798864eff3dbfd16ab615e62cf4ed222dca4db3537ff23716501d5","last_reissued_at":"2026-07-05T08:22:55.976686Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:55.976686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Tractability of SHAP Explanations under Markovian Distributions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Colin de la Higuera, Reda Marzouk","submitted_at":"2024-05-05T13:56:12Z","abstract_excerpt":"Thanks to its solid theoretical foundation, the SHAP framework is arguably one the most widely utilized frameworks for local explainability of ML models. Despite its popularity, its exact computation is known to be very challenging, proven to be NP-Hard in various configurations. Recent works have unveiled positive complexity results regarding the computation of the SHAP score for specific model families, encompassing decision trees, random forests, and some classes of boolean circuits. Yet, all these positive results hinge on the assumption of feature independence, often simplistic in real-wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.02936","kind":"arxiv","version":2},"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/2405.02936/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.02936","created_at":"2026-07-05T08:22:55.976742+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.02936v2","created_at":"2026-07-05T08:22:55.976742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.02936","created_at":"2026-07-05T08:22:55.976742+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVUSEL3RPGEG","created_at":"2026-07-05T08:22:55.976742+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVUSEL3RPGEGJ37T","created_at":"2026-07-05T08:22:55.976742+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVUSEL3R","created_at":"2026-07-05T08:22:55.976742+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25103","citing_title":"Beyond Shapley: Efficient Computation of Asymmetric Shapley Values","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LVUSEL3RPGEGJ37T3P6RNK3BLZ","json":"https://pith.science/pith/LVUSEL3RPGEGJ37T3P6RNK3BLZ.json","graph_json":"https://pith.science/api/pith-number/LVUSEL3RPGEGJ37T3P6RNK3BLZ/graph.json","events_json":"https://pith.science/api/pith-number/LVUSEL3RPGEGJ37T3P6RNK3BLZ/events.json","paper":"https://pith.science/paper/LVUSEL3R"},"agent_actions":{"view_html":"https://pith.science/pith/LVUSEL3RPGEGJ37T3P6RNK3BLZ","download_json":"https://pith.science/pith/LVUSEL3RPGEGJ37T3P6RNK3BLZ.json","view_paper":"https://pith.science/paper/LVUSEL3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.02936&json=true","fetch_graph":"https://pith.science/api/pith-number/LVUSEL3RPGEGJ37T3P6RNK3BLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LVUSEL3RPGEGJ37T3P6RNK3BLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVUSEL3RPGEGJ37T3P6RNK3BLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVUSEL3RPGEGJ37T3P6RNK3BLZ/action/storage_attestation","attest_author":"https://pith.science/pith/LVUSEL3RPGEGJ37T3P6RNK3BLZ/action/author_attestation","sign_citation":"https://pith.science/pith/LVUSEL3RPGEGJ37T3P6RNK3BLZ/action/citation_signature","submit_replication":"https://pith.science/pith/LVUSEL3RPGEGJ37T3P6RNK3BLZ/action/replication_record"}},"created_at":"2026-07-05T08:22:55.976742+00:00","updated_at":"2026-07-05T08:22:55.976742+00:00"}