{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D6WSRW765PURQYKAQJSDHPCVO3","short_pith_number":"pith:D6WSRW76","canonical_record":{"source":{"id":"1802.04697","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-13T16:10:10Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7ff2e3946452cc4d071796c3c54c30af1641d838ae99ffa79791a962492dda4a","abstract_canon_sha256":"9777412d881cb0b5b61c856eadbc3f32e4babc43387fb606940b3c8cfb6c246f"},"schema_version":"1.0"},"canonical_sha256":"1fad28dbfeebe9186140826433bc5576f25cceec6855ff1d845878c7a3d59f6e","source":{"kind":"arxiv","id":"1802.04697","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04697","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04697v2","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04697","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"D6WSRW765PUR","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6WSRW765PURQYKA","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6WSRW76","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D6WSRW765PURQYKAQJSDHPCVO3","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04697","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-13T16:10:10Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7ff2e3946452cc4d071796c3c54c30af1641d838ae99ffa79791a962492dda4a","abstract_canon_sha256":"9777412d881cb0b5b61c856eadbc3f32e4babc43387fb606940b3c8cfb6c246f"},"schema_version":"1.0"},"canonical_sha256":"1fad28dbfeebe9186140826433bc5576f25cceec6855ff1d845878c7a3d59f6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:38.478017Z","signature_b64":"lKR1xe3jYE4TQBKs+Uwq7LgacOiXasLpB96MacqfvaqKmAi+82EeH+N6wsZiaEFG8MuyKu6aL7Y80X/nQsa1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fad28dbfeebe9186140826433bc5576f25cceec6855ff1d845878c7a3d59f6e","last_reissued_at":"2026-05-18T00:10:38.477519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:38.477519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04697","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-18T00:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TPKgeDUq/5YwGMgamSL60RHmVnfuHAJYlah4pJgZokL8wR4EWyn+0hpvg6w7TZo4Fkc6TjQrL1Jp32wuDd/cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:12:08.210989Z"},"content_sha256":"a69128b3b89ba0b1ec84e25dd072163be7e519dd06a6401d8a85dc5b16bbca03","schema_version":"1.0","event_id":"sha256:a69128b3b89ba0b1ec84e25dd072163be7e519dd06a6401d8a85dc5b16bbca03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D6WSRW765PURQYKAQJSDHPCVO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Search with MCTSnets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Arthur Guez, Daan Wierstra, David Silver, Ioannis Antonoglou, Karen Simonyan, Oriol Vinyals, R\\'emi Munos, Th\\'eophane Weber","submitted_at":"2018-02-13T16:10:10Z","abstract_excerpt":"Planning problems are among the most important and well-studied problems in artificial intelligence. They are most typically solved by tree search algorithms that simulate ahead into the future, evaluate future states, and back-up those evaluations to the root of a search tree. Among these algorithms, Monte-Carlo tree search (MCTS) is one of the most general, powerful and widely used. A typical implementation of MCTS uses cleverly designed rules, optimized to the particular characteristics of the domain. These rules control where the simulation traverses, what to evaluate in the states that ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04697","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-18T00:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xl8pXCD4eb+dT3jTx48aWNM3YSUrZskTozX8AKwdvxbTGla4wmAaL7EgJWuXVnQTazrlByB3en/T7wQkkyJhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:12:08.211408Z"},"content_sha256":"64200e64806572ed291233dad4c46d3e722c8e8d9b810a876aa3bb06b7306aba","schema_version":"1.0","event_id":"sha256:64200e64806572ed291233dad4c46d3e722c8e8d9b810a876aa3bb06b7306aba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6WSRW765PURQYKAQJSDHPCVO3/bundle.json","state_url":"https://pith.science/pith/D6WSRW765PURQYKAQJSDHPCVO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6WSRW765PURQYKAQJSDHPCVO3/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-05-27T02:12:08Z","links":{"resolver":"https://pith.science/pith/D6WSRW765PURQYKAQJSDHPCVO3","bundle":"https://pith.science/pith/D6WSRW765PURQYKAQJSDHPCVO3/bundle.json","state":"https://pith.science/pith/D6WSRW765PURQYKAQJSDHPCVO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6WSRW765PURQYKAQJSDHPCVO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D6WSRW765PURQYKAQJSDHPCVO3","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":"9777412d881cb0b5b61c856eadbc3f32e4babc43387fb606940b3c8cfb6c246f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-13T16:10:10Z","title_canon_sha256":"7ff2e3946452cc4d071796c3c54c30af1641d838ae99ffa79791a962492dda4a"},"schema_version":"1.0","source":{"id":"1802.04697","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04697","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04697v2","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04697","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"D6WSRW765PUR","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6WSRW765PURQYKA","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6WSRW76","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:64200e64806572ed291233dad4c46d3e722c8e8d9b810a876aa3bb06b7306aba","target":"graph","created_at":"2026-05-18T00:10:38Z","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":"Planning problems are among the most important and well-studied problems in artificial intelligence. They are most typically solved by tree search algorithms that simulate ahead into the future, evaluate future states, and back-up those evaluations to the root of a search tree. Among these algorithms, Monte-Carlo tree search (MCTS) is one of the most general, powerful and widely used. A typical implementation of MCTS uses cleverly designed rules, optimized to the particular characteristics of the domain. These rules control where the simulation traverses, what to evaluate in the states that ar","authors_text":"Arthur Guez, Daan Wierstra, David Silver, Ioannis Antonoglou, Karen Simonyan, Oriol Vinyals, R\\'emi Munos, Th\\'eophane Weber","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-13T16:10:10Z","title":"Learning to Search with MCTSnets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04697","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:a69128b3b89ba0b1ec84e25dd072163be7e519dd06a6401d8a85dc5b16bbca03","target":"record","created_at":"2026-05-18T00:10:38Z","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":"9777412d881cb0b5b61c856eadbc3f32e4babc43387fb606940b3c8cfb6c246f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-13T16:10:10Z","title_canon_sha256":"7ff2e3946452cc4d071796c3c54c30af1641d838ae99ffa79791a962492dda4a"},"schema_version":"1.0","source":{"id":"1802.04697","kind":"arxiv","version":2}},"canonical_sha256":"1fad28dbfeebe9186140826433bc5576f25cceec6855ff1d845878c7a3d59f6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fad28dbfeebe9186140826433bc5576f25cceec6855ff1d845878c7a3d59f6e","first_computed_at":"2026-05-18T00:10:38.477519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:38.477519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lKR1xe3jYE4TQBKs+Uwq7LgacOiXasLpB96MacqfvaqKmAi+82EeH+N6wsZiaEFG8MuyKu6aL7Y80X/nQsa1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:38.478017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04697","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a69128b3b89ba0b1ec84e25dd072163be7e519dd06a6401d8a85dc5b16bbca03","sha256:64200e64806572ed291233dad4c46d3e722c8e8d9b810a876aa3bb06b7306aba"],"state_sha256":"79573d865460b5be1c97fdd86823b8765ab50cc94e168296e4571248eb32a739"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sbbPbhwdx8K6b5KsiGHB7Nc2uss6RiNLwTuXZgacBA9g0CuGufR24oDjU7yxn9LTgxBa67PfKkpYFsZqiZhpDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:12:08.214009Z","bundle_sha256":"b7a41b70db75dcba58f3c6be5624865078e05488b1a44b6c3d4ac9cbddf33206"}}