{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BB3TLMN5BKYM6KRFR6H6KLI4T3","short_pith_number":"pith:BB3TLMN5","schema_version":"1.0","canonical_sha256":"087735b1bd0ab0cf2a258f8fe52d1c9ecd12840a91ce27c78c5535340fbc4043","source":{"kind":"arxiv","id":"1403.7428","version":1},"attestation_state":"computed","paper":{"title":"DValue for Boolean games is EXP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Egor Ianovski","submitted_at":"2014-03-28T16:11:42Z","abstract_excerpt":"We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean game G determine whether the value of G is at least v. The proof is via a translation of the proof of the same result for Boolean circuit games in Feigenbaum et al. (1995)."},"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":"1403.7428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-28T16:11:42Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a2c575ab5192abfd075f7512c9cc4619522face4fae922ec9a1c894f13959a8c","abstract_canon_sha256":"eb34db997a3c8ee3f030765bc4c7f0f188ebb16b1f398d5a85a9353c5e0ffbce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:19.703591Z","signature_b64":"hf1R3TvD8gUSBdUZwsmmnvEeTNdkl6Tk9IKEQWi1MG7mJ2THBxY6GX5aP92Rruw0nrlczqSJYDW/m4JDiaBYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"087735b1bd0ab0cf2a258f8fe52d1c9ecd12840a91ce27c78c5535340fbc4043","last_reissued_at":"2026-05-18T02:55:19.703105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:19.703105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DValue for Boolean games is EXP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Egor Ianovski","submitted_at":"2014-03-28T16:11:42Z","abstract_excerpt":"We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean game G determine whether the value of G is at least v. The proof is via a translation of the proof of the same result for Boolean circuit games in Feigenbaum et al. (1995)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7428","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":""},"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":"1403.7428","created_at":"2026-05-18T02:55:19.703167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.7428v1","created_at":"2026-05-18T02:55:19.703167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7428","created_at":"2026-05-18T02:55:19.703167+00:00"},{"alias_kind":"pith_short_12","alias_value":"BB3TLMN5BKYM","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BB3TLMN5BKYM6KRF","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BB3TLMN5","created_at":"2026-05-18T12:28:22.404517+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/BB3TLMN5BKYM6KRFR6H6KLI4T3","json":"https://pith.science/pith/BB3TLMN5BKYM6KRFR6H6KLI4T3.json","graph_json":"https://pith.science/api/pith-number/BB3TLMN5BKYM6KRFR6H6KLI4T3/graph.json","events_json":"https://pith.science/api/pith-number/BB3TLMN5BKYM6KRFR6H6KLI4T3/events.json","paper":"https://pith.science/paper/BB3TLMN5"},"agent_actions":{"view_html":"https://pith.science/pith/BB3TLMN5BKYM6KRFR6H6KLI4T3","download_json":"https://pith.science/pith/BB3TLMN5BKYM6KRFR6H6KLI4T3.json","view_paper":"https://pith.science/paper/BB3TLMN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.7428&json=true","fetch_graph":"https://pith.science/api/pith-number/BB3TLMN5BKYM6KRFR6H6KLI4T3/graph.json","fetch_events":"https://pith.science/api/pith-number/BB3TLMN5BKYM6KRFR6H6KLI4T3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BB3TLMN5BKYM6KRFR6H6KLI4T3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BB3TLMN5BKYM6KRFR6H6KLI4T3/action/storage_attestation","attest_author":"https://pith.science/pith/BB3TLMN5BKYM6KRFR6H6KLI4T3/action/author_attestation","sign_citation":"https://pith.science/pith/BB3TLMN5BKYM6KRFR6H6KLI4T3/action/citation_signature","submit_replication":"https://pith.science/pith/BB3TLMN5BKYM6KRFR6H6KLI4T3/action/replication_record"}},"created_at":"2026-05-18T02:55:19.703167+00:00","updated_at":"2026-05-18T02:55:19.703167+00:00"}