{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZPU4YFD6MMAGZR2HGHUYDIEQD5","short_pith_number":"pith:ZPU4YFD6","schema_version":"1.0","canonical_sha256":"cbe9cc147e63006cc74731e981a0901f471552be60ec540919605b4991451d34","source":{"kind":"arxiv","id":"2006.08740","version":2},"attestation_state":"computed","paper":{"title":"Sound Algorithms in Imperfect Information Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Marc Lanctot, Martin Schmid, Matej Morav\\v{c}\\'ik, Michael Bowling, Michal \\v{S}ustr, Neil Burch","submitted_at":"2020-06-15T20:18:57Z","abstract_excerpt":"Search has played a fundamental role in computer game research since the very beginning. And while online search has been commonly used in perfect information games such as Chess and Go, online search methods for imperfect information games have only been introduced relatively recently. This paper addresses the question of what is a sound online algorithm in an imperfect information setting of two-player zero-sum games. We argue that the~fixed-strategy~definitions of exploitability and $\\epsilon$-Nash equilibria are ill-suited to measure an online algorithm's worst-case performance. We thus fo"},"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":"2006.08740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-06-15T20:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"bf6a1d5aa53765c9bfcd20b80626c49768ceeb9b78f27422061a34d0a616e66c","abstract_canon_sha256":"36104fd0bc86c7e8861cdc40b1822c366c58029a95095f14c85a4e7db5872719"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:19:28.333116Z","signature_b64":"TyhSTKQL5YGf4J19otw+qd/M0O6AocRncUiwlbb2Tnh7dkAx+TLOs5T1XGm5bgGKooP75XmIwbcTAjZxYpSADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbe9cc147e63006cc74731e981a0901f471552be60ec540919605b4991451d34","last_reissued_at":"2026-07-05T02:19:28.332601Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:19:28.332601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sound Algorithms in Imperfect Information Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Marc Lanctot, Martin Schmid, Matej Morav\\v{c}\\'ik, Michael Bowling, Michal \\v{S}ustr, Neil Burch","submitted_at":"2020-06-15T20:18:57Z","abstract_excerpt":"Search has played a fundamental role in computer game research since the very beginning. And while online search has been commonly used in perfect information games such as Chess and Go, online search methods for imperfect information games have only been introduced relatively recently. This paper addresses the question of what is a sound online algorithm in an imperfect information setting of two-player zero-sum games. We argue that the~fixed-strategy~definitions of exploitability and $\\epsilon$-Nash equilibria are ill-suited to measure an online algorithm's worst-case performance. We thus fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08740","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.08740/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":"2006.08740","created_at":"2026-07-05T02:19:28.332673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.08740v2","created_at":"2026-07-05T02:19:28.332673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08740","created_at":"2026-07-05T02:19:28.332673+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPU4YFD6MMAG","created_at":"2026-07-05T02:19:28.332673+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPU4YFD6MMAGZR2H","created_at":"2026-07-05T02:19:28.332673+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPU4YFD6","created_at":"2026-07-05T02:19:28.332673+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/ZPU4YFD6MMAGZR2HGHUYDIEQD5","json":"https://pith.science/pith/ZPU4YFD6MMAGZR2HGHUYDIEQD5.json","graph_json":"https://pith.science/api/pith-number/ZPU4YFD6MMAGZR2HGHUYDIEQD5/graph.json","events_json":"https://pith.science/api/pith-number/ZPU4YFD6MMAGZR2HGHUYDIEQD5/events.json","paper":"https://pith.science/paper/ZPU4YFD6"},"agent_actions":{"view_html":"https://pith.science/pith/ZPU4YFD6MMAGZR2HGHUYDIEQD5","download_json":"https://pith.science/pith/ZPU4YFD6MMAGZR2HGHUYDIEQD5.json","view_paper":"https://pith.science/paper/ZPU4YFD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.08740&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPU4YFD6MMAGZR2HGHUYDIEQD5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPU4YFD6MMAGZR2HGHUYDIEQD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPU4YFD6MMAGZR2HGHUYDIEQD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPU4YFD6MMAGZR2HGHUYDIEQD5/action/storage_attestation","attest_author":"https://pith.science/pith/ZPU4YFD6MMAGZR2HGHUYDIEQD5/action/author_attestation","sign_citation":"https://pith.science/pith/ZPU4YFD6MMAGZR2HGHUYDIEQD5/action/citation_signature","submit_replication":"https://pith.science/pith/ZPU4YFD6MMAGZR2HGHUYDIEQD5/action/replication_record"}},"created_at":"2026-07-05T02:19:28.332673+00:00","updated_at":"2026-07-05T02:19:28.332673+00:00"}