{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5OXYTOX7FFPJGD352S3MUAOJTP","short_pith_number":"pith:5OXYTOX7","schema_version":"1.0","canonical_sha256":"ebaf89baff295e930f7dd4b6ca01c99bf04a96f82866f2b21c19d1f9caab49cd","source":{"kind":"arxiv","id":"1509.00149","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Hannan Consistent Selection for 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":"Viliam Lis\\'y, Vojt\\v{e}ch Kova\\v{r}\\'ik","submitted_at":"2015-09-01T05:30:04Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS) has recently been successfully used to create strategies for playing imperfect-information games. Despite its popularity, there are no theoretic results that guarantee its convergence to a well-defined solution, such as Nash equilibrium, in these games. We partially fill this gap by analysing MCTS in the class of zero-sum extensive-form games with simultaneous moves but otherwise perfect information. The lack of information about the opponent's concurrent moves already causes that optimal strategies may require randomization. We present theoretic as well as empir"},"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":"1509.00149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-09-01T05:30:04Z","cross_cats_sorted":[],"title_canon_sha256":"877324194ed4dbc2ca0b561ee60acb376415f3f8f7dfdd228b7335cedb987322","abstract_canon_sha256":"947b2ee6ba7bade5add55f386ef04709f28c815cb8e4ebd46c0c0bd83099f16a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:30.482024Z","signature_b64":"SHMmRzaSM6C+FbFIJDnXASr8fpc1dp2LhiO5BvpaC/Iq55JZY4HAk5FJlxBPSNBUkOkxUC0uyrBvjtkYm40FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebaf89baff295e930f7dd4b6ca01c99bf04a96f82866f2b21c19d1f9caab49cd","last_reissued_at":"2026-05-18T01:34:30.481556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:30.481556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Hannan Consistent Selection for 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":"Viliam Lis\\'y, Vojt\\v{e}ch Kova\\v{r}\\'ik","submitted_at":"2015-09-01T05:30:04Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS) has recently been successfully used to create strategies for playing imperfect-information games. Despite its popularity, there are no theoretic results that guarantee its convergence to a well-defined solution, such as Nash equilibrium, in these games. We partially fill this gap by analysing MCTS in the class of zero-sum extensive-form games with simultaneous moves but otherwise perfect information. The lack of information about the opponent's concurrent moves already causes that optimal strategies may require randomization. We present theoretic as well as empir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00149","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":"1509.00149","created_at":"2026-05-18T01:34:30.481625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00149v1","created_at":"2026-05-18T01:34:30.481625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00149","created_at":"2026-05-18T01:34:30.481625+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OXYTOX7FFPJ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OXYTOX7FFPJGD35","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OXYTOX7","created_at":"2026-05-18T12:29:05.191682+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/5OXYTOX7FFPJGD352S3MUAOJTP","json":"https://pith.science/pith/5OXYTOX7FFPJGD352S3MUAOJTP.json","graph_json":"https://pith.science/api/pith-number/5OXYTOX7FFPJGD352S3MUAOJTP/graph.json","events_json":"https://pith.science/api/pith-number/5OXYTOX7FFPJGD352S3MUAOJTP/events.json","paper":"https://pith.science/paper/5OXYTOX7"},"agent_actions":{"view_html":"https://pith.science/pith/5OXYTOX7FFPJGD352S3MUAOJTP","download_json":"https://pith.science/pith/5OXYTOX7FFPJGD352S3MUAOJTP.json","view_paper":"https://pith.science/paper/5OXYTOX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00149&json=true","fetch_graph":"https://pith.science/api/pith-number/5OXYTOX7FFPJGD352S3MUAOJTP/graph.json","fetch_events":"https://pith.science/api/pith-number/5OXYTOX7FFPJGD352S3MUAOJTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OXYTOX7FFPJGD352S3MUAOJTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OXYTOX7FFPJGD352S3MUAOJTP/action/storage_attestation","attest_author":"https://pith.science/pith/5OXYTOX7FFPJGD352S3MUAOJTP/action/author_attestation","sign_citation":"https://pith.science/pith/5OXYTOX7FFPJGD352S3MUAOJTP/action/citation_signature","submit_replication":"https://pith.science/pith/5OXYTOX7FFPJGD352S3MUAOJTP/action/replication_record"}},"created_at":"2026-05-18T01:34:30.481625+00:00","updated_at":"2026-05-18T01:34:30.481625+00:00"}