{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7GQSYRJ4EH2PSODUC75UB27XNX","short_pith_number":"pith:7GQSYRJ4","canonical_record":{"source":{"id":"1710.04805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-13T05:08:14Z","cross_cats_sorted":[],"title_canon_sha256":"eabe286e5a7d97bb600e69c72098f4343693fca774759e52fe6b13276f73ca9a","abstract_canon_sha256":"395956721f5fdbeb825a05bf41bf1e22233b657ebf9973fbe5eb6ef96f8e8008"},"schema_version":"1.0"},"canonical_sha256":"f9a12c453c21f4f9387417fb40ebf76dd42aa94854318fffc17908c60d6e9f4a","source":{"kind":"arxiv","id":"1710.04805","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04805","created_at":"2026-05-18T00:32:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04805v1","created_at":"2026-05-18T00:32:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04805","created_at":"2026-05-18T00:32:56Z"},{"alias_kind":"pith_short_12","alias_value":"7GQSYRJ4EH2P","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7GQSYRJ4EH2PSODU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7GQSYRJ4","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7GQSYRJ4EH2PSODUC75UB27XNX","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-13T05:08:14Z","cross_cats_sorted":[],"title_canon_sha256":"eabe286e5a7d97bb600e69c72098f4343693fca774759e52fe6b13276f73ca9a","abstract_canon_sha256":"395956721f5fdbeb825a05bf41bf1e22233b657ebf9973fbe5eb6ef96f8e8008"},"schema_version":"1.0"},"canonical_sha256":"f9a12c453c21f4f9387417fb40ebf76dd42aa94854318fffc17908c60d6e9f4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:56.662454Z","signature_b64":"pUxV0/cbMJSTUjBIGRl8MRSFG76RlDWhXO3lMpNUruk0eOCEtPGwIMUC7TSocdO+0TMtwIJmdUfet0YRUpcfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9a12c453c21f4f9387417fb40ebf76dd42aa94854318fffc17908c60d6e9f4a","last_reissued_at":"2026-05-18T00:32:56.661798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:56.661798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04805","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:32:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sioO+C5tS+AQHN8xuvtJEZDJs1pZAr+gDeXLp3wWwYUWP56ZjGmDn2Jiu5vHrjY3MbzEXy+ToUv+eq67BChFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:48:49.955033Z"},"content_sha256":"e79409f3975c378c6e4ba301c0b497a4bf1d479f3724b698f178f8082001d550","schema_version":"1.0","event_id":"sha256:e79409f3975c378c6e4ba301c0b497a4bf1d479f3724b698f178f8082001d550"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7GQSYRJ4EH2PSODUC75UB27XNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Multi-armed Bandits for Real-Time Strategy Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Santiago Onta\\~n\\'on","submitted_at":"2017-10-13T05:08:14Z","abstract_excerpt":"Games with large branching factors pose a significant challenge for game tree search algorithms. In this paper, we address this problem with a sampling strategy for Monte Carlo Tree Search (MCTS) algorithms called {\\em na\\\"{i}ve sampling}, based on a variant of the Multi-armed Bandit problem called {\\em Combinatorial Multi-armed Bandits} (CMAB). We analyze the theoretical properties of several variants of {\\em na\\\"{i}ve sampling}, and empirically compare it against the other existing strategies in the literature for CMABs. We then evaluate these strategies in the context of real-time strategy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04805","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:32:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xx6JJh2UGzagI6jDSzWoWwxfxrRG7o1HlSkrjcg7h1ljVE2oGba0o20Vx8Ti0ptecqF32rm8Tu3PCkEVSm19Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:48:49.955385Z"},"content_sha256":"b3be45777441a726cc4b38ef1c31259a69a639b49a398d7406c4af3869b3e7f2","schema_version":"1.0","event_id":"sha256:b3be45777441a726cc4b38ef1c31259a69a639b49a398d7406c4af3869b3e7f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GQSYRJ4EH2PSODUC75UB27XNX/bundle.json","state_url":"https://pith.science/pith/7GQSYRJ4EH2PSODUC75UB27XNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GQSYRJ4EH2PSODUC75UB27XNX/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-27T14:48:49Z","links":{"resolver":"https://pith.science/pith/7GQSYRJ4EH2PSODUC75UB27XNX","bundle":"https://pith.science/pith/7GQSYRJ4EH2PSODUC75UB27XNX/bundle.json","state":"https://pith.science/pith/7GQSYRJ4EH2PSODUC75UB27XNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GQSYRJ4EH2PSODUC75UB27XNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7GQSYRJ4EH2PSODUC75UB27XNX","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":"395956721f5fdbeb825a05bf41bf1e22233b657ebf9973fbe5eb6ef96f8e8008","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-13T05:08:14Z","title_canon_sha256":"eabe286e5a7d97bb600e69c72098f4343693fca774759e52fe6b13276f73ca9a"},"schema_version":"1.0","source":{"id":"1710.04805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04805","created_at":"2026-05-18T00:32:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04805v1","created_at":"2026-05-18T00:32:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04805","created_at":"2026-05-18T00:32:56Z"},{"alias_kind":"pith_short_12","alias_value":"7GQSYRJ4EH2P","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7GQSYRJ4EH2PSODU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7GQSYRJ4","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:b3be45777441a726cc4b38ef1c31259a69a639b49a398d7406c4af3869b3e7f2","target":"graph","created_at":"2026-05-18T00:32:56Z","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":"Games with large branching factors pose a significant challenge for game tree search algorithms. In this paper, we address this problem with a sampling strategy for Monte Carlo Tree Search (MCTS) algorithms called {\\em na\\\"{i}ve sampling}, based on a variant of the Multi-armed Bandit problem called {\\em Combinatorial Multi-armed Bandits} (CMAB). We analyze the theoretical properties of several variants of {\\em na\\\"{i}ve sampling}, and empirically compare it against the other existing strategies in the literature for CMABs. We then evaluate these strategies in the context of real-time strategy ","authors_text":"Santiago Onta\\~n\\'on","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-13T05:08:14Z","title":"Combinatorial Multi-armed Bandits for Real-Time Strategy Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04805","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:e79409f3975c378c6e4ba301c0b497a4bf1d479f3724b698f178f8082001d550","target":"record","created_at":"2026-05-18T00:32:56Z","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":"395956721f5fdbeb825a05bf41bf1e22233b657ebf9973fbe5eb6ef96f8e8008","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-13T05:08:14Z","title_canon_sha256":"eabe286e5a7d97bb600e69c72098f4343693fca774759e52fe6b13276f73ca9a"},"schema_version":"1.0","source":{"id":"1710.04805","kind":"arxiv","version":1}},"canonical_sha256":"f9a12c453c21f4f9387417fb40ebf76dd42aa94854318fffc17908c60d6e9f4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9a12c453c21f4f9387417fb40ebf76dd42aa94854318fffc17908c60d6e9f4a","first_computed_at":"2026-05-18T00:32:56.661798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:56.661798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pUxV0/cbMJSTUjBIGRl8MRSFG76RlDWhXO3lMpNUruk0eOCEtPGwIMUC7TSocdO+0TMtwIJmdUfet0YRUpcfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:56.662454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e79409f3975c378c6e4ba301c0b497a4bf1d479f3724b698f178f8082001d550","sha256:b3be45777441a726cc4b38ef1c31259a69a639b49a398d7406c4af3869b3e7f2"],"state_sha256":"444fe57366e28970bae78a39611d986d9fadfde2001f1c2935320562a36c87d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73c0NRHlbg62qJVbSvEyNnJaKGiHqzdzmbItXJ/R08OJHt2rgHgr0GM5ab1Pmb/9hxThpXK+NavXv+uq/ZHYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:48:49.957539Z","bundle_sha256":"ec564eed0d12d2fd9a5e91dfdf85f7e58aa3d95632c887779a468af919576f80"}}