{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Q34PTAL4ZUHJGG65N6WVTAGFAC","short_pith_number":"pith:Q34PTAL4","schema_version":"1.0","canonical_sha256":"86f8f9817ccd0e931bdd6fad5980c500a0ccc6f4fe7ff6b04c9226b4f9bd9296","source":{"kind":"arxiv","id":"2010.12082","version":1},"attestation_state":"computed","paper":{"title":"A Multilinear Sampling Algorithm to Estimate Shapley Values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aldo Lipani, Ramin Okhrati","submitted_at":"2020-10-22T21:47:16Z","abstract_excerpt":"Shapley values are great analytical tools in game theory to measure the importance of a player in a game. Due to their axiomatic and desirable properties such as efficiency, they have become popular for feature importance analysis in data science and machine learning. However, the time complexity to compute Shapley values based on the original formula is exponential, and as the number of features increases, this becomes infeasible. Castro et al. [1] developed a sampling algorithm, to estimate Shapley values. In this work, we propose a new sampling method based on a multilinear extension techni"},"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":"2010.12082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-22T21:47:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a6ffeab622baa236c7aab788d81fb2c45cc7003002626a3ae66946916d67e2a0","abstract_canon_sha256":"e6a8af23d56d216440b4280af99bc0361323ef20d782b3c7d3623f50f72036bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:33.571354Z","signature_b64":"JFfn/Y0IL1IdEwR8kbTTng0TPgPNUI86yvp+IbsF+a18EbXmTai2FRyTbzSFZor0db9HCBlmVCYxqYU95qDYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86f8f9817ccd0e931bdd6fad5980c500a0ccc6f4fe7ff6b04c9226b4f9bd9296","last_reissued_at":"2026-07-05T01:45:33.570998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:33.570998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Multilinear Sampling Algorithm to Estimate Shapley Values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aldo Lipani, Ramin Okhrati","submitted_at":"2020-10-22T21:47:16Z","abstract_excerpt":"Shapley values are great analytical tools in game theory to measure the importance of a player in a game. Due to their axiomatic and desirable properties such as efficiency, they have become popular for feature importance analysis in data science and machine learning. However, the time complexity to compute Shapley values based on the original formula is exponential, and as the number of features increases, this becomes infeasible. Castro et al. [1] developed a sampling algorithm, to estimate Shapley values. In this work, we propose a new sampling method based on a multilinear extension techni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12082","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/2010.12082/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":"2010.12082","created_at":"2026-07-05T01:45:33.571056+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.12082v1","created_at":"2026-07-05T01:45:33.571056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12082","created_at":"2026-07-05T01:45:33.571056+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q34PTAL4ZUHJ","created_at":"2026-07-05T01:45:33.571056+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q34PTAL4ZUHJGG65","created_at":"2026-07-05T01:45:33.571056+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q34PTAL4","created_at":"2026-07-05T01:45:33.571056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01450","citing_title":"ShaTS: A Shapley-based Explainability Method for Time Series Artificial Intelligence Models applied to Anomaly Detection in Industrial Internet of Things","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q34PTAL4ZUHJGG65N6WVTAGFAC","json":"https://pith.science/pith/Q34PTAL4ZUHJGG65N6WVTAGFAC.json","graph_json":"https://pith.science/api/pith-number/Q34PTAL4ZUHJGG65N6WVTAGFAC/graph.json","events_json":"https://pith.science/api/pith-number/Q34PTAL4ZUHJGG65N6WVTAGFAC/events.json","paper":"https://pith.science/paper/Q34PTAL4"},"agent_actions":{"view_html":"https://pith.science/pith/Q34PTAL4ZUHJGG65N6WVTAGFAC","download_json":"https://pith.science/pith/Q34PTAL4ZUHJGG65N6WVTAGFAC.json","view_paper":"https://pith.science/paper/Q34PTAL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.12082&json=true","fetch_graph":"https://pith.science/api/pith-number/Q34PTAL4ZUHJGG65N6WVTAGFAC/graph.json","fetch_events":"https://pith.science/api/pith-number/Q34PTAL4ZUHJGG65N6WVTAGFAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q34PTAL4ZUHJGG65N6WVTAGFAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q34PTAL4ZUHJGG65N6WVTAGFAC/action/storage_attestation","attest_author":"https://pith.science/pith/Q34PTAL4ZUHJGG65N6WVTAGFAC/action/author_attestation","sign_citation":"https://pith.science/pith/Q34PTAL4ZUHJGG65N6WVTAGFAC/action/citation_signature","submit_replication":"https://pith.science/pith/Q34PTAL4ZUHJGG65N6WVTAGFAC/action/replication_record"}},"created_at":"2026-07-05T01:45:33.571056+00:00","updated_at":"2026-07-05T01:45:33.571056+00:00"}