{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OYHQ7XXLRSDMAFKJP7UZHKIKAS","short_pith_number":"pith:OYHQ7XXL","schema_version":"1.0","canonical_sha256":"760f0fdeeb8c86c015497fe993a90a04a7e29b3243aa8432fb8d09c2305277ad","source":{"kind":"arxiv","id":"1805.09218","version":1},"attestation_state":"computed","paper":{"title":"Monte Carlo Tree Search for Asymmetric Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Aske Plaat, Catholijn M. Jonker, Joost Broekens, Thomas M. Moerland","submitted_at":"2018-05-23T15:19:40Z","abstract_excerpt":"We present an extension of Monte Carlo Tree Search (MCTS) that strongly increases its efficiency for trees with asymmetry and/or loops. Asymmetric termination of search trees introduces a type of uncertainty for which the standard upper confidence bound (UCB) formula does not account. Our first algorithm (MCTS-T), which assumes a non-stochastic environment, backs-up tree structure uncertainty and leverages it for exploration in a modified UCB formula. Results show vastly improved efficiency in a well-known asymmetric domain in which MCTS performs arbitrarily bad. Next, we connect the ideas abo"},"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":"1805.09218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-23T15:19:40Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"e18599673601e137aa74167ce494ed6fbb4d120d38bfc2a257cbddd8f24a1eee","abstract_canon_sha256":"aa4320f9ea4db20a920b1131e3996764e3d670f2791fb65be39c194f8be2ec86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:08.214358Z","signature_b64":"lbM3B1AvS35N9fuQW8EsT2KQQed+XUUfFaZby1LmiMgrql8o8wuepMAvF4WePQ3PNUHA2BJzqSbSR13z0a4NDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"760f0fdeeb8c86c015497fe993a90a04a7e29b3243aa8432fb8d09c2305277ad","last_reissued_at":"2026-05-18T00:15:08.213706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:08.213706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monte Carlo Tree Search for Asymmetric Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Aske Plaat, Catholijn M. Jonker, Joost Broekens, Thomas M. Moerland","submitted_at":"2018-05-23T15:19:40Z","abstract_excerpt":"We present an extension of Monte Carlo Tree Search (MCTS) that strongly increases its efficiency for trees with asymmetry and/or loops. Asymmetric termination of search trees introduces a type of uncertainty for which the standard upper confidence bound (UCB) formula does not account. Our first algorithm (MCTS-T), which assumes a non-stochastic environment, backs-up tree structure uncertainty and leverages it for exploration in a modified UCB formula. Results show vastly improved efficiency in a well-known asymmetric domain in which MCTS performs arbitrarily bad. Next, we connect the ideas abo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09218","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":"1805.09218","created_at":"2026-05-18T00:15:08.213797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09218v1","created_at":"2026-05-18T00:15:08.213797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09218","created_at":"2026-05-18T00:15:08.213797+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYHQ7XXLRSDM","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYHQ7XXLRSDMAFKJ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYHQ7XXL","created_at":"2026-05-18T12:32:43.782077+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/OYHQ7XXLRSDMAFKJP7UZHKIKAS","json":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS.json","graph_json":"https://pith.science/api/pith-number/OYHQ7XXLRSDMAFKJP7UZHKIKAS/graph.json","events_json":"https://pith.science/api/pith-number/OYHQ7XXLRSDMAFKJP7UZHKIKAS/events.json","paper":"https://pith.science/paper/OYHQ7XXL"},"agent_actions":{"view_html":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS","download_json":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS.json","view_paper":"https://pith.science/paper/OYHQ7XXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09218&json=true","fetch_graph":"https://pith.science/api/pith-number/OYHQ7XXLRSDMAFKJP7UZHKIKAS/graph.json","fetch_events":"https://pith.science/api/pith-number/OYHQ7XXLRSDMAFKJP7UZHKIKAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/action/storage_attestation","attest_author":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/action/author_attestation","sign_citation":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/action/citation_signature","submit_replication":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/action/replication_record"}},"created_at":"2026-05-18T00:15:08.213797+00:00","updated_at":"2026-05-18T00:15:08.213797+00:00"}