{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FTUCHBITMGHQAIBOZ24QM7DGNZ","short_pith_number":"pith:FTUCHBIT","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"},"canonical_sha256":"2ce8238513618f00202eceb9067c666e41c11b5b27af887a8558d604b834fe6d","source":{"kind":"arxiv","id":"1608.01510","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01510","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01510v2","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01510","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"FTUCHBITMGHQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FTUCHBITMGHQAIBO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FTUCHBIT","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FTUCHBITMGHQAIBOZ24QM7DGNZ","target":"record","payload":{"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"},"canonical_sha256":"2ce8238513618f00202eceb9067c666e41c11b5b27af887a8558d604b834fe6d","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"},"source_kind":"arxiv","source_id":"1608.01510","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38U3Pyn3ZRk88hk+TV1uRLvef8rT3tnvfBnLWflzrXvEuzId2NBTL9G6bChLpmwiBGMfhcZH3crT6E7GJ1W3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:27:25.309558Z"},"content_sha256":"ebeda0ba29b26b344a058ebed4361fcc9d2750903c7173a5f08767e5295b883c","schema_version":"1.0","event_id":"sha256:ebeda0ba29b26b344a058ebed4361fcc9d2750903c7173a5f08767e5295b883c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FTUCHBITMGHQAIBOZ24QM7DGNZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyYGq9Vb98p+BGemabFVVGG4INDtoChZzUHxuLGeWfsQBNM1+wNZUjIopmJYLJvV3f5lodeKSMAnnYMDLtzPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:27:25.309938Z"},"content_sha256":"6838cbc4ecef63ec7cc99fa16264f8950ad86210aefc972a85cf69c50b6e53ed","schema_version":"1.0","event_id":"sha256:6838cbc4ecef63ec7cc99fa16264f8950ad86210aefc972a85cf69c50b6e53ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/bundle.json","state_url":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T20:27:25Z","links":{"resolver":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ","bundle":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/bundle.json","state":"https://pith.science/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTUCHBITMGHQAIBOZ24QM7DGNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FTUCHBITMGHQAIBOZ24QM7DGNZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ff0f76a7376adf76a228aa0608d7f862b34169c9c58a1890d5b7d102fd7b7a2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-04T12:28:58Z","title_canon_sha256":"aecc7f8cb21e39d0e144a06824f2abd75662fd6cb83806f5ca9cc2f02ff98c6c"},"schema_version":"1.0","source":{"id":"1608.01510","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01510","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01510v2","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01510","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"FTUCHBITMGHQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FTUCHBITMGHQAIBO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FTUCHBIT","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:6838cbc4ecef63ec7cc99fa16264f8950ad86210aefc972a85cf69c50b6e53ed","target":"graph","created_at":"2026-05-18T00:43:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Branislav Bosansky, Jiri Cermak, Karel Horak, Michal Pechoucek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-04T12:28:58Z","title":"Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01510","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ebeda0ba29b26b344a058ebed4361fcc9d2750903c7173a5f08767e5295b883c","target":"record","created_at":"2026-05-18T00:43:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ff0f76a7376adf76a228aa0608d7f862b34169c9c58a1890d5b7d102fd7b7a2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-04T12:28:58Z","title_canon_sha256":"aecc7f8cb21e39d0e144a06824f2abd75662fd6cb83806f5ca9cc2f02ff98c6c"},"schema_version":"1.0","source":{"id":"1608.01510","kind":"arxiv","version":2}},"canonical_sha256":"2ce8238513618f00202eceb9067c666e41c11b5b27af887a8558d604b834fe6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ce8238513618f00202eceb9067c666e41c11b5b27af887a8558d604b834fe6d","first_computed_at":"2026-05-18T00:43:45.358870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:45.358870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nbfbuCf1VBZ6b2w/QvE8asQVTHI3FnNG5B3Yh2gjUaQZBCcVkp34/Rl7Wo/TKF18XXKqE7EStt6EypTJYrXrAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:45.359523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01510","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebeda0ba29b26b344a058ebed4361fcc9d2750903c7173a5f08767e5295b883c","sha256:6838cbc4ecef63ec7cc99fa16264f8950ad86210aefc972a85cf69c50b6e53ed"],"state_sha256":"1191b3037a30a208874cb7944a292a8d5df2b46c55e38244089ca2c25672d011"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3Z0m7cc+8SH3g+wlNG+eYPKiKhG2pkU6GkcdHMDn0sMykkVjrMUHZq8P8yjJjp2n7zEMO4jiUKL9H6RMUCpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:27:25.312363Z","bundle_sha256":"677236261ee1e61fe3e07f430b2cac64cdb2367ae3b2c2107c8f5ce9a2061019"}}