{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:A3WNE6CX5U5XVPC4DTOHZUZWDB","short_pith_number":"pith:A3WNE6CX","canonical_record":{"source":{"id":"1310.8613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-31T17:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"615ba47b441320f60e6f28371672ed0f7b3b06d118e034404530db30367db8d6","abstract_canon_sha256":"25c056ab9d86769ebc0c5385ba8f728975d5e3674fbb280fbca02e5a8aecdbba"},"schema_version":"1.0"},"canonical_sha256":"06ecd27857ed3b7abc5c1cdc7cd3361879e1bfbc6ca8b2e186efd4f21e0cf651","source":{"kind":"arxiv","id":"1310.8613","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8613","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8613v2","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8613","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"A3WNE6CX5U5X","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A3WNE6CX5U5XVPC4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A3WNE6CX","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:A3WNE6CX5U5XVPC4DTOHZUZWDB","target":"record","payload":{"canonical_record":{"source":{"id":"1310.8613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-31T17:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"615ba47b441320f60e6f28371672ed0f7b3b06d118e034404530db30367db8d6","abstract_canon_sha256":"25c056ab9d86769ebc0c5385ba8f728975d5e3674fbb280fbca02e5a8aecdbba"},"schema_version":"1.0"},"canonical_sha256":"06ecd27857ed3b7abc5c1cdc7cd3361879e1bfbc6ca8b2e186efd4f21e0cf651","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:48.178310Z","signature_b64":"EXmiZwlOe+92q3Kl7lNXGYUHLKD3SHCOFwGfYlCJG+QMJHbLUQJf5Ye7IL3niPXN0MkWMYXzYPB+Sd3vTdPUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06ecd27857ed3b7abc5c1cdc7cd3361879e1bfbc6ca8b2e186efd4f21e0cf651","last_reissued_at":"2026-05-18T03:04:48.177600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:48.177600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.8613","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-18T03:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2HDdN82vJZSWCcoVS25e1CectvNOsHKy1MmcxG1xs/LBbCQl0F+A/DE24AGzxF8OVUyyhJLF7IJIqAnsvTVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:57:39.788114Z"},"content_sha256":"f6ebc752cf470d5fc663d69a04f933300c42217387ade04f2244b1b0145371dd","schema_version":"1.0","event_id":"sha256:f6ebc752cf470d5fc663d69a04f933300c42217387ade04f2244b1b0145371dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:A3WNE6CX5U5XVPC4DTOHZUZWDB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of Monte Carlo Tree Search in Simultaneous Move Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Branislav Bo\\v{s}ansk\\'y, Marc Lanctot, Viliam Lis\\'y, Vojt\\v{e}ch Kova\\v{r}\\'ik","submitted_at":"2013-10-31T17:41:51Z","abstract_excerpt":"We study Monte Carlo tree search (MCTS) in zero-sum extensive-form games with perfect information and simultaneous moves. We present a general template of MCTS algorithms for these games, which can be instantiated by various selection methods. We formally prove that if a selection method is $\\epsilon$-Hannan consistent in a matrix game and satisfies additional requirements on exploration, then the MCTS algorithm eventually converges to an approximate Nash equilibrium (NE) of the extensive-form game. We empirically evaluate this claim using regret matching and Exp3 as the selection methods on r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8613","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-18T03:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pwQMVK+y0OVcPLbyP/7Z28TBZQziuu9rh7WT+dLXFLJtnOQMpSHeZZU5i/xyucTwy1iwCo1gtp3Qu9RBQjnICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:57:39.788476Z"},"content_sha256":"6e009325235861ef25605533cf081a94d6ce1d2a1de3f18c9b1d818bbc056e18","schema_version":"1.0","event_id":"sha256:6e009325235861ef25605533cf081a94d6ce1d2a1de3f18c9b1d818bbc056e18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/bundle.json","state_url":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/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-01T17:57:39Z","links":{"resolver":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB","bundle":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/bundle.json","state":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:A3WNE6CX5U5XVPC4DTOHZUZWDB","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":"25c056ab9d86769ebc0c5385ba8f728975d5e3674fbb280fbca02e5a8aecdbba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-31T17:41:51Z","title_canon_sha256":"615ba47b441320f60e6f28371672ed0f7b3b06d118e034404530db30367db8d6"},"schema_version":"1.0","source":{"id":"1310.8613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8613","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8613v2","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8613","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"A3WNE6CX5U5X","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A3WNE6CX5U5XVPC4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A3WNE6CX","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:6e009325235861ef25605533cf081a94d6ce1d2a1de3f18c9b1d818bbc056e18","target":"graph","created_at":"2026-05-18T03:04:48Z","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":"We study Monte Carlo tree search (MCTS) in zero-sum extensive-form games with perfect information and simultaneous moves. We present a general template of MCTS algorithms for these games, which can be instantiated by various selection methods. We formally prove that if a selection method is $\\epsilon$-Hannan consistent in a matrix game and satisfies additional requirements on exploration, then the MCTS algorithm eventually converges to an approximate Nash equilibrium (NE) of the extensive-form game. We empirically evaluate this claim using regret matching and Exp3 as the selection methods on r","authors_text":"Branislav Bo\\v{s}ansk\\'y, Marc Lanctot, Viliam Lis\\'y, Vojt\\v{e}ch Kova\\v{r}\\'ik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-31T17:41:51Z","title":"Convergence of Monte Carlo Tree Search in Simultaneous Move Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8613","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:f6ebc752cf470d5fc663d69a04f933300c42217387ade04f2244b1b0145371dd","target":"record","created_at":"2026-05-18T03:04:48Z","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":"25c056ab9d86769ebc0c5385ba8f728975d5e3674fbb280fbca02e5a8aecdbba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-31T17:41:51Z","title_canon_sha256":"615ba47b441320f60e6f28371672ed0f7b3b06d118e034404530db30367db8d6"},"schema_version":"1.0","source":{"id":"1310.8613","kind":"arxiv","version":2}},"canonical_sha256":"06ecd27857ed3b7abc5c1cdc7cd3361879e1bfbc6ca8b2e186efd4f21e0cf651","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06ecd27857ed3b7abc5c1cdc7cd3361879e1bfbc6ca8b2e186efd4f21e0cf651","first_computed_at":"2026-05-18T03:04:48.177600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:48.177600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EXmiZwlOe+92q3Kl7lNXGYUHLKD3SHCOFwGfYlCJG+QMJHbLUQJf5Ye7IL3niPXN0MkWMYXzYPB+Sd3vTdPUCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:48.178310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.8613","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6ebc752cf470d5fc663d69a04f933300c42217387ade04f2244b1b0145371dd","sha256:6e009325235861ef25605533cf081a94d6ce1d2a1de3f18c9b1d818bbc056e18"],"state_sha256":"a5a542a9771781ae4ec05446c4b2bb8befc969684ef45ce4905f5453ccec93b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TjimhsscQmx854P6KjP4Ith4Hf+Z6N1PQk1iVKEzoGM+wYsLkqTYowZj8YHLS+ESgeUrHMVive+vNm1/bTqYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:57:39.790362Z","bundle_sha256":"7fa9745fb1dfc1f45c157dbd784d351527e1ae39392ed65d8b0598c9965b57f7"}}