{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SWLKK7SYLZFEUVUWESUTMM4USJ","short_pith_number":"pith:SWLKK7SY","schema_version":"1.0","canonical_sha256":"9596a57e585e4a4a569624a93633949257f4541e42df15109270a05cc1cd695d","source":{"kind":"arxiv","id":"2308.05588","version":1},"attestation_state":"computed","paper":{"title":"Banzhaf Values for Facts in Query Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmet Kara, Daniel Deutch, Dan Olteanu, Nave Frost, Omer Abramovich","submitted_at":"2023-08-10T13:52:44Z","abstract_excerpt":"Quantifying the contribution of database facts to query answers has been studied as means of explanation. The Banzhaf value, originally developed in Game Theory, is a natural measure of fact contribution, yet its efficient computation for select-project-join-union queries is challenging. In this paper, we introduce three algorithms to compute the Banzhaf value of database facts: an exact algorithm, an anytime deterministic approximation algorithm with relative error guarantees, and an algorithm for ranking and top-$k$. They have three key building blocks: compilation of query lineage into an e"},"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":"2308.05588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-08-10T13:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"6c829d99ce226bb09199cf70b2a18d5d40f86e72b681f4712a1738d595aa686d","abstract_canon_sha256":"98239728ff9f0797fcf4e24cb446156fc224d46b602014c1d9ce7be2f1db9733"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:02.723645Z","signature_b64":"7THYvnmKHXMrjYCVZtkkfmJlD9K+ngh8hgv5EhcTZGbKYY+iTI7jIlo0EtKnfe3SFub27aGnr3H307cGycI/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9596a57e585e4a4a569624a93633949257f4541e42df15109270a05cc1cd695d","last_reissued_at":"2026-07-05T06:40:02.723249Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:02.723249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Banzhaf Values for Facts in Query Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmet Kara, Daniel Deutch, Dan Olteanu, Nave Frost, Omer Abramovich","submitted_at":"2023-08-10T13:52:44Z","abstract_excerpt":"Quantifying the contribution of database facts to query answers has been studied as means of explanation. The Banzhaf value, originally developed in Game Theory, is a natural measure of fact contribution, yet its efficient computation for select-project-join-union queries is challenging. In this paper, we introduce three algorithms to compute the Banzhaf value of database facts: an exact algorithm, an anytime deterministic approximation algorithm with relative error guarantees, and an algorithm for ranking and top-$k$. They have three key building blocks: compilation of query lineage into an e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.05588","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/2308.05588/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":"2308.05588","created_at":"2026-07-05T06:40:02.723306+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.05588v1","created_at":"2026-07-05T06:40:02.723306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.05588","created_at":"2026-07-05T06:40:02.723306+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWLKK7SYLZFE","created_at":"2026-07-05T06:40:02.723306+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWLKK7SYLZFEUVUW","created_at":"2026-07-05T06:40:02.723306+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWLKK7SY","created_at":"2026-07-05T06:40:02.723306+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SWLKK7SYLZFEUVUWESUTMM4USJ","json":"https://pith.science/pith/SWLKK7SYLZFEUVUWESUTMM4USJ.json","graph_json":"https://pith.science/api/pith-number/SWLKK7SYLZFEUVUWESUTMM4USJ/graph.json","events_json":"https://pith.science/api/pith-number/SWLKK7SYLZFEUVUWESUTMM4USJ/events.json","paper":"https://pith.science/paper/SWLKK7SY"},"agent_actions":{"view_html":"https://pith.science/pith/SWLKK7SYLZFEUVUWESUTMM4USJ","download_json":"https://pith.science/pith/SWLKK7SYLZFEUVUWESUTMM4USJ.json","view_paper":"https://pith.science/paper/SWLKK7SY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.05588&json=true","fetch_graph":"https://pith.science/api/pith-number/SWLKK7SYLZFEUVUWESUTMM4USJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SWLKK7SYLZFEUVUWESUTMM4USJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWLKK7SYLZFEUVUWESUTMM4USJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWLKK7SYLZFEUVUWESUTMM4USJ/action/storage_attestation","attest_author":"https://pith.science/pith/SWLKK7SYLZFEUVUWESUTMM4USJ/action/author_attestation","sign_citation":"https://pith.science/pith/SWLKK7SYLZFEUVUWESUTMM4USJ/action/citation_signature","submit_replication":"https://pith.science/pith/SWLKK7SYLZFEUVUWESUTMM4USJ/action/replication_record"}},"created_at":"2026-07-05T06:40:02.723306+00:00","updated_at":"2026-07-05T06:40:02.723306+00:00"}