{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FTUCHBITMGHQAIBOZ24QM7DGNZ","short_pith_number":"pith:FTUCHBIT","schema_version":"1.0","canonical_sha256":"2ce8238513618f00202eceb9067c666e41c11b5b27af887a8558d604b834fe6d","source":{"kind":"arxiv","id":"1608.01510","version":2},"attestation_state":"computed","paper":{"title":"Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Branislav Bosansky, Jiri Cermak, Karel Horak, Michal Pechoucek","submitted_at":"2016-08-04T12:28:58Z","abstract_excerpt":"Extensive-form games with imperfect recall are an important game-theoretic model that allows a compact representation of strategies in dynamic strategic interactions. Practical use of imperfect recall games is limited due to negative theoretical results: a Nash equilibrium does not have to exist, computing maxmin strategies is NP-hard, and they may require irrational numbers. We present the first algorithm for approximating maxmin strategies in two-player zero-sum imperfect recall games without absentmindedness. We modify the well-known sequence-form linear program to model strategies in imper"},"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":"1608.01510","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-04T12:28:58Z","cross_cats_sorted":[],"title_canon_sha256":"aecc7f8cb21e39d0e144a06824f2abd75662fd6cb83806f5ca9cc2f02ff98c6c","abstract_canon_sha256":"ff0f76a7376adf76a228aa0608d7f862b34169c9c58a1890d5b7d102fd7b7a2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:45.359523Z","signature_b64":"nbfbuCf1VBZ6b2w/QvE8asQVTHI3FnNG5B3Yh2gjUaQZBCcVkp34/Rl7Wo/TKF18XXKqE7EStt6EypTJYrXrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ce8238513618f00202eceb9067c666e41c11b5b27af887a8558d604b834fe6d","last_reissued_at":"2026-05-18T00:43:45.358870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:45.358870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Branislav Bosansky, Jiri Cermak, Karel Horak, Michal Pechoucek","submitted_at":"2016-08-04T12:28:58Z","abstract_excerpt":"Extensive-form games with imperfect recall are an important game-theoretic model that allows a compact representation of strategies in dynamic strategic interactions. Practical use of imperfect recall games is limited due to negative theoretical results: a Nash equilibrium does not have to exist, computing maxmin strategies is NP-hard, and they may require irrational numbers. We present the first algorithm for approximating maxmin strategies in two-player zero-sum imperfect recall games without absentmindedness. We modify the well-known sequence-form linear program to model strategies in imper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01510","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":"1608.01510","created_at":"2026-05-18T00:43:45.358961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01510v2","created_at":"2026-05-18T00:43:45.358961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01510","created_at":"2026-05-18T00:43:45.358961+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTUCHBITMGHQ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTUCHBITMGHQAIBO","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTUCHBIT","created_at":"2026-05-18T12:30:15.759754+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/FTUCHBITMGHQAIBOZ24QM7DGNZ","json":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ.json","graph_json":"https://pith.science/api/pith-number/FTUCHBITMGHQAIBOZ24QM7DGNZ/graph.json","events_json":"https://pith.science/api/pith-number/FTUCHBITMGHQAIBOZ24QM7DGNZ/events.json","paper":"https://pith.science/paper/FTUCHBIT"},"agent_actions":{"view_html":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ","download_json":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ.json","view_paper":"https://pith.science/paper/FTUCHBIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01510&json=true","fetch_graph":"https://pith.science/api/pith-number/FTUCHBITMGHQAIBOZ24QM7DGNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FTUCHBITMGHQAIBOZ24QM7DGNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/action/storage_attestation","attest_author":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/action/author_attestation","sign_citation":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/action/citation_signature","submit_replication":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/action/replication_record"}},"created_at":"2026-05-18T00:43:45.358961+00:00","updated_at":"2026-05-18T00:43:45.358961+00:00"}