{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HXHHXDLYCA35SI6GHEMKPL62F7","short_pith_number":"pith:HXHHXDLY","schema_version":"1.0","canonical_sha256":"3dce7b8d781037d923c63918a7afda2fcde969f535dd29caffda87a5bcb95007","source":{"kind":"arxiv","id":"1306.4265","version":2},"attestation_state":"computed","paper":{"title":"Bounding the Estimation Error of Sampling-based Shapley Value Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alex Rogers, Greg Hines, Long Tran-Thanh, Sasan Maleki, Talal Rahwan","submitted_at":"2013-06-18T16:51:53Z","abstract_excerpt":"The Shapley value is arguably the most central normative solution concept in cooperative game theory. It specifies a unique way in which the reward from cooperation can be \"fairly\" divided among players. While it has a wide range of real world applications, its use is in many cases hampered by the hardness of its computation. A number of researchers have tackled this problem by (i) focusing on classes of games where the Shapley value can be computed efficiently, or (ii) proposing representation formalisms that facilitate such efficient computation, or (iii) approximating the Shapley value in c"},"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":"1306.4265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-06-18T16:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"167af2e1b11950247fa831f01698640461abb0ddb3b585c51561ffa829db4b1e","abstract_canon_sha256":"ce024bdc14586f3be2d3d06bd3a57d85c4ad7044e863a2028d7cb61192778529"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:08.671754Z","signature_b64":"M90ppgR5LnkwhO5ZrGdyWCpCabfmwNPSLMWRHV/UsuKJ/0r23P7Xhr4UdmWa8bREBgfRiWZZMLVIQ00Ev6beDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dce7b8d781037d923c63918a7afda2fcde969f535dd29caffda87a5bcb95007","last_reissued_at":"2026-05-18T02:59:08.671326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:08.671326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the Estimation Error of Sampling-based Shapley Value Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alex Rogers, Greg Hines, Long Tran-Thanh, Sasan Maleki, Talal Rahwan","submitted_at":"2013-06-18T16:51:53Z","abstract_excerpt":"The Shapley value is arguably the most central normative solution concept in cooperative game theory. It specifies a unique way in which the reward from cooperation can be \"fairly\" divided among players. While it has a wide range of real world applications, its use is in many cases hampered by the hardness of its computation. A number of researchers have tackled this problem by (i) focusing on classes of games where the Shapley value can be computed efficiently, or (ii) proposing representation formalisms that facilitate such efficient computation, or (iii) approximating the Shapley value in c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4265","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":""},"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":"1306.4265","created_at":"2026-05-18T02:59:08.671386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4265v2","created_at":"2026-05-18T02:59:08.671386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4265","created_at":"2026-05-18T02:59:08.671386+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXHHXDLYCA35","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXHHXDLYCA35SI6G","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXHHXDLY","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2502.04763","citing_title":"Shapley Value Approximation Based on k-Additive Games","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21033","citing_title":"Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HXHHXDLYCA35SI6GHEMKPL62F7","json":"https://pith.science/pith/HXHHXDLYCA35SI6GHEMKPL62F7.json","graph_json":"https://pith.science/api/pith-number/HXHHXDLYCA35SI6GHEMKPL62F7/graph.json","events_json":"https://pith.science/api/pith-number/HXHHXDLYCA35SI6GHEMKPL62F7/events.json","paper":"https://pith.science/paper/HXHHXDLY"},"agent_actions":{"view_html":"https://pith.science/pith/HXHHXDLYCA35SI6GHEMKPL62F7","download_json":"https://pith.science/pith/HXHHXDLYCA35SI6GHEMKPL62F7.json","view_paper":"https://pith.science/paper/HXHHXDLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4265&json=true","fetch_graph":"https://pith.science/api/pith-number/HXHHXDLYCA35SI6GHEMKPL62F7/graph.json","fetch_events":"https://pith.science/api/pith-number/HXHHXDLYCA35SI6GHEMKPL62F7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXHHXDLYCA35SI6GHEMKPL62F7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXHHXDLYCA35SI6GHEMKPL62F7/action/storage_attestation","attest_author":"https://pith.science/pith/HXHHXDLYCA35SI6GHEMKPL62F7/action/author_attestation","sign_citation":"https://pith.science/pith/HXHHXDLYCA35SI6GHEMKPL62F7/action/citation_signature","submit_replication":"https://pith.science/pith/HXHHXDLYCA35SI6GHEMKPL62F7/action/replication_record"}},"created_at":"2026-05-18T02:59:08.671386+00:00","updated_at":"2026-05-18T02:59:08.671386+00:00"}