{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WW2SGWGG52AATVYSUEVMCHEDDX","short_pith_number":"pith:WW2SGWGG","canonical_record":{"source":{"id":"1304.6057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-22T19:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"c610e3157a38afe3b183108a0a7df85c7429d72ab2432e1ec9961ef011594e63","abstract_canon_sha256":"22b4b470024028c85a362cf684b24cd81385f683074cd2f26c74009a51cad5c5"},"schema_version":"1.0"},"canonical_sha256":"b5b52358c6ee8009d712a12ac11c831dd0c01a3c724b9a870ce02391a6a365cf","source":{"kind":"arxiv","id":"1304.6057","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6057","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6057v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6057","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"WW2SGWGG52AA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WW2SGWGG52AATVYS","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WW2SGWGG","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WW2SGWGG52AATVYSUEVMCHEDDX","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-22T19:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"c610e3157a38afe3b183108a0a7df85c7429d72ab2432e1ec9961ef011594e63","abstract_canon_sha256":"22b4b470024028c85a362cf684b24cd81385f683074cd2f26c74009a51cad5c5"},"schema_version":"1.0"},"canonical_sha256":"b5b52358c6ee8009d712a12ac11c831dd0c01a3c724b9a870ce02391a6a365cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:23.462820Z","signature_b64":"d1wGESmnBMdQSbOZkjlCGBvxUrP2g+c5zaS8vAl74uIJ9irGwURohP2sQeVIxaeEQb5pkTrBrv4nOeiClT8LBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5b52358c6ee8009d712a12ac11c831dd0c01a3c724b9a870ce02391a6a365cf","last_reissued_at":"2026-05-18T03:27:23.462345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:23.462345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6057","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-18T03:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTFAa2UY2wEam8JfbXmNf1zgIme0pbadUZk5SXrFEPjs3CSr5Ocrb6ZzpH4uF3CqxILRxcxcOk4DEPErCL/DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T21:33:05.846496Z"},"content_sha256":"078b701a5e2ef5f08815edf62a3c127931382f2309122ab5b14d2db07e7e8aa8","schema_version":"1.0","event_id":"sha256:078b701a5e2ef5f08815edf62a3c127931382f2309122ab5b14d2db07e7e8aa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WW2SGWGG52AATVYSUEVMCHEDDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monte Carlo *-Minimax Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Abdallah Saffidine, Christopher Archibald, Joel Veness, Marc Lanctot, Mark H.M. Winands","submitted_at":"2013-04-22T19:00:13Z","abstract_excerpt":"This paper introduces Monte Carlo *-Minimax Search (MCMS), a Monte Carlo search algorithm for turned-based, stochastic, two-player, zero-sum games of perfect information. The algorithm is designed for the class of of densely stochastic games; that is, games where one would rarely expect to sample the same successor state multiple times at any particular chance node. Our approach combines sparse sampling techniques from MDP planning with classic pruning techniques developed for adversarial expectimax planning. We compare and contrast our algorithm to the traditional *-Minimax approaches, as wel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6057","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-18T03:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q1rx6mxRJn9gAdfE0Y4mHs6VQ6XJVh121YITa1YM10kmIqo7Jaoza0O6q3PqdUYvgkCBQp0zAJyU7zHpjQ1JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T21:33:05.847046Z"},"content_sha256":"8ef86a0177bb956e85ede8f1d8e7b045ac08d6383a48980f57e2adbe3159fd45","schema_version":"1.0","event_id":"sha256:8ef86a0177bb956e85ede8f1d8e7b045ac08d6383a48980f57e2adbe3159fd45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WW2SGWGG52AATVYSUEVMCHEDDX/bundle.json","state_url":"https://pith.science/pith/WW2SGWGG52AATVYSUEVMCHEDDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WW2SGWGG52AATVYSUEVMCHEDDX/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-18T21:33:05Z","links":{"resolver":"https://pith.science/pith/WW2SGWGG52AATVYSUEVMCHEDDX","bundle":"https://pith.science/pith/WW2SGWGG52AATVYSUEVMCHEDDX/bundle.json","state":"https://pith.science/pith/WW2SGWGG52AATVYSUEVMCHEDDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WW2SGWGG52AATVYSUEVMCHEDDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WW2SGWGG52AATVYSUEVMCHEDDX","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":"22b4b470024028c85a362cf684b24cd81385f683074cd2f26c74009a51cad5c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-22T19:00:13Z","title_canon_sha256":"c610e3157a38afe3b183108a0a7df85c7429d72ab2432e1ec9961ef011594e63"},"schema_version":"1.0","source":{"id":"1304.6057","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6057","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6057v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6057","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"WW2SGWGG52AA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WW2SGWGG52AATVYS","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WW2SGWGG","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:8ef86a0177bb956e85ede8f1d8e7b045ac08d6383a48980f57e2adbe3159fd45","target":"graph","created_at":"2026-05-18T03:27:23Z","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":"This paper introduces Monte Carlo *-Minimax Search (MCMS), a Monte Carlo search algorithm for turned-based, stochastic, two-player, zero-sum games of perfect information. The algorithm is designed for the class of of densely stochastic games; that is, games where one would rarely expect to sample the same successor state multiple times at any particular chance node. Our approach combines sparse sampling techniques from MDP planning with classic pruning techniques developed for adversarial expectimax planning. We compare and contrast our algorithm to the traditional *-Minimax approaches, as wel","authors_text":"Abdallah Saffidine, Christopher Archibald, Joel Veness, Marc Lanctot, Mark H.M. Winands","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-22T19:00:13Z","title":"Monte Carlo *-Minimax Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6057","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:078b701a5e2ef5f08815edf62a3c127931382f2309122ab5b14d2db07e7e8aa8","target":"record","created_at":"2026-05-18T03:27:23Z","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":"22b4b470024028c85a362cf684b24cd81385f683074cd2f26c74009a51cad5c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-22T19:00:13Z","title_canon_sha256":"c610e3157a38afe3b183108a0a7df85c7429d72ab2432e1ec9961ef011594e63"},"schema_version":"1.0","source":{"id":"1304.6057","kind":"arxiv","version":1}},"canonical_sha256":"b5b52358c6ee8009d712a12ac11c831dd0c01a3c724b9a870ce02391a6a365cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5b52358c6ee8009d712a12ac11c831dd0c01a3c724b9a870ce02391a6a365cf","first_computed_at":"2026-05-18T03:27:23.462345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:23.462345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d1wGESmnBMdQSbOZkjlCGBvxUrP2g+c5zaS8vAl74uIJ9irGwURohP2sQeVIxaeEQb5pkTrBrv4nOeiClT8LBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:23.462820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6057","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:078b701a5e2ef5f08815edf62a3c127931382f2309122ab5b14d2db07e7e8aa8","sha256:8ef86a0177bb956e85ede8f1d8e7b045ac08d6383a48980f57e2adbe3159fd45"],"state_sha256":"2c05079ea555dfa58db7ba35278542b4a067b7445b9f6a0ea2403cf9ce0407a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iu+71V89FRLybCu3tRRVjx4tNpFmdQ0ChxxSkuUD8sZQ5adLBnciThYhnLSq1rt/kEyoE6N1Bf2+vKkBlpO7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T21:33:05.848734Z","bundle_sha256":"f1aa41cf70a1b45573dfe133a72636269d72d5c4a092bd8c621ae4b77489e2dc"}}