{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OYHQ7XXLRSDMAFKJP7UZHKIKAS","short_pith_number":"pith:OYHQ7XXL","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"},"canonical_sha256":"760f0fdeeb8c86c015497fe993a90a04a7e29b3243aa8432fb8d09c2305277ad","source":{"kind":"arxiv","id":"1805.09218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09218","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09218v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09218","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"OYHQ7XXLRSDM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYHQ7XXLRSDMAFKJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYHQ7XXL","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OYHQ7XXLRSDMAFKJP7UZHKIKAS","target":"record","payload":{"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"},"canonical_sha256":"760f0fdeeb8c86c015497fe993a90a04a7e29b3243aa8432fb8d09c2305277ad","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"},"source_kind":"arxiv","source_id":"1805.09218","source_version":1,"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:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TUeXqrdasZkVYnIHzOC/ytLwRstROxnnvw88Rj1r97dtM/4PxyslSzjm9O6J3T9FLBpZNQ1Bj+WpI8ZK7RHbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:43:21.039989Z"},"content_sha256":"4fe170977184ab64007ba7909edeb2f8c7301e1b23539d88753477d143e7f1ee","schema_version":"1.0","event_id":"sha256:4fe170977184ab64007ba7909edeb2f8c7301e1b23539d88753477d143e7f1ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OYHQ7XXLRSDMAFKJP7UZHKIKAS","target":"graph","payload":{"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"},"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:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwrLPmegjrVOpcWpDif+Q8CvftqssHKFZ/n4VVvHE8ozhOydKBmUazwrkfSTW/8s+VWFD6wdk8L9Q0tRpA1TBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:43:21.040385Z"},"content_sha256":"b1a9df314abac932855efb5f61d3fe8171bf9deeaa788c6a02f8f2c4abc59826","schema_version":"1.0","event_id":"sha256:b1a9df314abac932855efb5f61d3fe8171bf9deeaa788c6a02f8f2c4abc59826"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/bundle.json","state_url":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/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-23T14:43:21Z","links":{"resolver":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS","bundle":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/bundle.json","state":"https://pith.science/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYHQ7XXLRSDMAFKJP7UZHKIKAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OYHQ7XXLRSDMAFKJP7UZHKIKAS","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":"aa4320f9ea4db20a920b1131e3996764e3d670f2791fb65be39c194f8be2ec86","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-23T15:19:40Z","title_canon_sha256":"e18599673601e137aa74167ce494ed6fbb4d120d38bfc2a257cbddd8f24a1eee"},"schema_version":"1.0","source":{"id":"1805.09218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09218","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09218v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09218","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"OYHQ7XXLRSDM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYHQ7XXLRSDMAFKJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYHQ7XXL","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:b1a9df314abac932855efb5f61d3fe8171bf9deeaa788c6a02f8f2c4abc59826","target":"graph","created_at":"2026-05-18T00:15:08Z","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 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","authors_text":"Aske Plaat, Catholijn M. Jonker, Joost Broekens, Thomas M. Moerland","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-23T15:19:40Z","title":"Monte Carlo Tree Search for Asymmetric Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09218","kind":"arxiv","version":1},"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:4fe170977184ab64007ba7909edeb2f8c7301e1b23539d88753477d143e7f1ee","target":"record","created_at":"2026-05-18T00:15:08Z","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":"aa4320f9ea4db20a920b1131e3996764e3d670f2791fb65be39c194f8be2ec86","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-23T15:19:40Z","title_canon_sha256":"e18599673601e137aa74167ce494ed6fbb4d120d38bfc2a257cbddd8f24a1eee"},"schema_version":"1.0","source":{"id":"1805.09218","kind":"arxiv","version":1}},"canonical_sha256":"760f0fdeeb8c86c015497fe993a90a04a7e29b3243aa8432fb8d09c2305277ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"760f0fdeeb8c86c015497fe993a90a04a7e29b3243aa8432fb8d09c2305277ad","first_computed_at":"2026-05-18T00:15:08.213706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:08.213706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lbM3B1AvS35N9fuQW8EsT2KQQed+XUUfFaZby1LmiMgrql8o8wuepMAvF4WePQ3PNUHA2BJzqSbSR13z0a4NDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:08.214358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fe170977184ab64007ba7909edeb2f8c7301e1b23539d88753477d143e7f1ee","sha256:b1a9df314abac932855efb5f61d3fe8171bf9deeaa788c6a02f8f2c4abc59826"],"state_sha256":"c777e217af51a63ac043377f3a8473b76b3bae65e488b1be61f3e03ce570a0c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWeA/ErBM7d7DRBvHjnykkHkw06RvCQLL10me4J7roPdYi5p/O76iyeQKKOQWU9lv9O4ewxyWz73jLgIB9RnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:43:21.042297Z","bundle_sha256":"a1684395c8551e3e0b040d8b3058eab08693db4e3462f72aea44acd72b1e09cb"}}