{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DOD7LH6S523XT4CWAXEJBRYSKT","short_pith_number":"pith:DOD7LH6S","canonical_record":{"source":{"id":"1704.04612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-15T09:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"277c25f4b0d73cf76c0e0576079a8f5a39a4317efd96fe76320f16f92f0452b5","abstract_canon_sha256":"20dc8d8f4a95a05ac590baff6bf7223f056c11593fda61e409161742b5fffa9c"},"schema_version":"1.0"},"canonical_sha256":"1b87f59fd2eeb779f05605c890c71254fd6ff02016efcd5efd8324b9fcee0a25","source":{"kind":"arxiv","id":"1704.04612","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04612","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04612v2","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04612","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"DOD7LH6S523X","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DOD7LH6S523XT4CW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DOD7LH6S","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DOD7LH6S523XT4CWAXEJBRYSKT","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-15T09:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"277c25f4b0d73cf76c0e0576079a8f5a39a4317efd96fe76320f16f92f0452b5","abstract_canon_sha256":"20dc8d8f4a95a05ac590baff6bf7223f056c11593fda61e409161742b5fffa9c"},"schema_version":"1.0"},"canonical_sha256":"1b87f59fd2eeb779f05605c890c71254fd6ff02016efcd5efd8324b9fcee0a25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:11.777306Z","signature_b64":"yPOTb/xa2eWQLJd7LYwsUEpHvttaxu1tdn7nbfrWIM9hSaa8WjcFnyWUTdaMnDLZ2knmSIw7KjT8b7rz7/EkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b87f59fd2eeb779f05605c890c71254fd6ff02016efcd5efd8324b9fcee0a25","last_reissued_at":"2026-05-18T00:25:11.775862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:11.775862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04612","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W25Ni24rry3VzR5WYuLKjgquWx57cp5XgE2+lt2csJeIfotdxfRyXi77lF7ZcJm1yBcMkToEVW8Jt49hZ6HbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:02:26.905764Z"},"content_sha256":"c52b3f0558ce6d81cbf0bf4e6bcd3240d343f23db1dd42dab31f3edcbbc14905","schema_version":"1.0","event_id":"sha256:c52b3f0558ce6d81cbf0bf4e6bcd3240d343f23db1dd42dab31f3edcbbc14905"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DOD7LH6S523XT4CWAXEJBRYSKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Monte-Carlo tree search for deterministic games with alternate moves and complete information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Nicolas Fournier, Sylvain Delattre","submitted_at":"2017-04-15T09:35:49Z","abstract_excerpt":"We consider a deterministic game with alternate moves and complete information, of which the issue is always the victory of one of the two opponents. We assume that this game is the realization of a random model enjoying some independence properties. We consider algorithms in the spirit of Monte-Carlo Tree Search, to estimate at best the minimax value of a given position: it consists in simulating, successively, $n$ well-chosen matches, starting from this position. We build an algorithm, which is optimal, step by step, in some sense: once the $n$ first matches are simulated, the algorithm deci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04612","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Q1wf5Z3nb81FsvakPBkO9PWVBgoJ4psa+Zz9kYyz9LxwOndHA2olsGJTQhJSzYHirtPmNaW2PyGAAfqiX+wAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:02:26.906109Z"},"content_sha256":"ec714d877ff3ec96dea0b6363bba61c97140c51089968e2a7df6fd6476165f03","schema_version":"1.0","event_id":"sha256:ec714d877ff3ec96dea0b6363bba61c97140c51089968e2a7df6fd6476165f03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOD7LH6S523XT4CWAXEJBRYSKT/bundle.json","state_url":"https://pith.science/pith/DOD7LH6S523XT4CWAXEJBRYSKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOD7LH6S523XT4CWAXEJBRYSKT/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-28T13:02:26Z","links":{"resolver":"https://pith.science/pith/DOD7LH6S523XT4CWAXEJBRYSKT","bundle":"https://pith.science/pith/DOD7LH6S523XT4CWAXEJBRYSKT/bundle.json","state":"https://pith.science/pith/DOD7LH6S523XT4CWAXEJBRYSKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOD7LH6S523XT4CWAXEJBRYSKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DOD7LH6S523XT4CWAXEJBRYSKT","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":"20dc8d8f4a95a05ac590baff6bf7223f056c11593fda61e409161742b5fffa9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-15T09:35:49Z","title_canon_sha256":"277c25f4b0d73cf76c0e0576079a8f5a39a4317efd96fe76320f16f92f0452b5"},"schema_version":"1.0","source":{"id":"1704.04612","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04612","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04612v2","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04612","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"DOD7LH6S523X","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DOD7LH6S523XT4CW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DOD7LH6S","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:ec714d877ff3ec96dea0b6363bba61c97140c51089968e2a7df6fd6476165f03","target":"graph","created_at":"2026-05-18T00:25:11Z","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 consider a deterministic game with alternate moves and complete information, of which the issue is always the victory of one of the two opponents. We assume that this game is the realization of a random model enjoying some independence properties. We consider algorithms in the spirit of Monte-Carlo Tree Search, to estimate at best the minimax value of a given position: it consists in simulating, successively, $n$ well-chosen matches, starting from this position. We build an algorithm, which is optimal, step by step, in some sense: once the $n$ first matches are simulated, the algorithm deci","authors_text":"Nicolas Fournier, Sylvain Delattre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-15T09:35:49Z","title":"On Monte-Carlo tree search for deterministic games with alternate moves and complete information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04612","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:c52b3f0558ce6d81cbf0bf4e6bcd3240d343f23db1dd42dab31f3edcbbc14905","target":"record","created_at":"2026-05-18T00:25:11Z","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":"20dc8d8f4a95a05ac590baff6bf7223f056c11593fda61e409161742b5fffa9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-15T09:35:49Z","title_canon_sha256":"277c25f4b0d73cf76c0e0576079a8f5a39a4317efd96fe76320f16f92f0452b5"},"schema_version":"1.0","source":{"id":"1704.04612","kind":"arxiv","version":2}},"canonical_sha256":"1b87f59fd2eeb779f05605c890c71254fd6ff02016efcd5efd8324b9fcee0a25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b87f59fd2eeb779f05605c890c71254fd6ff02016efcd5efd8324b9fcee0a25","first_computed_at":"2026-05-18T00:25:11.775862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:11.775862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yPOTb/xa2eWQLJd7LYwsUEpHvttaxu1tdn7nbfrWIM9hSaa8WjcFnyWUTdaMnDLZ2knmSIw7KjT8b7rz7/EkCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:11.777306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04612","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c52b3f0558ce6d81cbf0bf4e6bcd3240d343f23db1dd42dab31f3edcbbc14905","sha256:ec714d877ff3ec96dea0b6363bba61c97140c51089968e2a7df6fd6476165f03"],"state_sha256":"39915f123cc32c72fb9c6b347ad865fc881872efe6e15ef05607650e009526cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ETAn/R+I9XXhRmk87Gw9mAtRNDPOTQdrQhKB6h4l07WfwbMUvXvZKFcV6p+7XO+h81Sn+fIuecSkQmrmXLVKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:02:26.908188Z","bundle_sha256":"8df5d367687d7f07cbb166d89cad94e394eb9ae1b693baa711ed6116e0da2e24"}}