{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JX4FFOSH4UZF3NKBMAE2HDRYUW","short_pith_number":"pith:JX4FFOSH","canonical_record":{"source":{"id":"1706.05198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-16T09:51:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e3b018ac3315e0c105cb47470c10d79323690f299dd372d812b31d3602eeeed3","abstract_canon_sha256":"119d7279f3858fed92a83dfabf5b6df8bb1968a3e663550c507ca95cc0d4ab2d"},"schema_version":"1.0"},"canonical_sha256":"4df852ba47e5325db5416009a38e38a59d5aaade2ca24e75ee4104363707b86a","source":{"kind":"arxiv","id":"1706.05198","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05198","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05198v2","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05198","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"JX4FFOSH4UZF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JX4FFOSH4UZF3NKB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JX4FFOSH","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JX4FFOSH4UZF3NKBMAE2HDRYUW","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-16T09:51:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e3b018ac3315e0c105cb47470c10d79323690f299dd372d812b31d3602eeeed3","abstract_canon_sha256":"119d7279f3858fed92a83dfabf5b6df8bb1968a3e663550c507ca95cc0d4ab2d"},"schema_version":"1.0"},"canonical_sha256":"4df852ba47e5325db5416009a38e38a59d5aaade2ca24e75ee4104363707b86a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:11.800040Z","signature_b64":"5k0v2L8ofIJgOWQgpwBDAm/Evlh3dgS3d370HQ8+CZGISZRVfLxLXwlBywzC+SeTRWkGU00EtnNseGTZdJTECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4df852ba47e5325db5416009a38e38a59d5aaade2ca24e75ee4104363707b86a","last_reissued_at":"2026-05-18T00:42:11.799448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:11.799448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05198","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:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDblfVduv3P3wgZVi1LJCYyIofhpgXzdTdvELtFm5dLyaAh5r43th47fcmLz+f3qYbcCZ8x2kcytfq48DPdKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:12:33.696264Z"},"content_sha256":"8035ec7e9e1a77c4598a3bd4e986c98075b7a88e658145f6a454477f3cda16a1","schema_version":"1.0","event_id":"sha256:8035ec7e9e1a77c4598a3bd4e986c98075b7a88e658145f6a454477f3cda16a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JX4FFOSH4UZF3NKBMAE2HDRYUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Best Arm Identification with Fixed Confidence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Csaba Szepesv\\'ari, Martin M\\\"uller, Mohammad M. Ajallooeian, Ruitong Huang","submitted_at":"2017-06-16T09:51:36Z","abstract_excerpt":"We study the problem of identifying the best action among a set of possible options when the value of each action is given by a mapping from a number of noisy micro-observables in the so-called fixed confidence setting. Our main motivation is the application to the minimax game search, which has been a major topic of interest in artificial intelligence. In this paper we introduce an abstract setting to clearly describe the essential properties of the problem. While previous work only considered a two-move game tree search problem, our abstract setting can be applied to the general minimax game"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05198","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:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSKwg/FWGaJsOTjD08ZxxbM9SI18S9Gm8+swWHqAojFNMba+ghZDKpf9qptJkuZuB//OdA684N6BkhUBjQ8eAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:12:33.696999Z"},"content_sha256":"ca36d8ca5ba6ac47a163794583117be57f5103eb1e7e345998c4d426fb2c706d","schema_version":"1.0","event_id":"sha256:ca36d8ca5ba6ac47a163794583117be57f5103eb1e7e345998c4d426fb2c706d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/bundle.json","state_url":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/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-06T17:12:33Z","links":{"resolver":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW","bundle":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/bundle.json","state":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JX4FFOSH4UZF3NKBMAE2HDRYUW","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":"119d7279f3858fed92a83dfabf5b6df8bb1968a3e663550c507ca95cc0d4ab2d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-16T09:51:36Z","title_canon_sha256":"e3b018ac3315e0c105cb47470c10d79323690f299dd372d812b31d3602eeeed3"},"schema_version":"1.0","source":{"id":"1706.05198","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05198","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05198v2","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05198","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"JX4FFOSH4UZF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JX4FFOSH4UZF3NKB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JX4FFOSH","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:ca36d8ca5ba6ac47a163794583117be57f5103eb1e7e345998c4d426fb2c706d","target":"graph","created_at":"2026-05-18T00:42: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 study the problem of identifying the best action among a set of possible options when the value of each action is given by a mapping from a number of noisy micro-observables in the so-called fixed confidence setting. Our main motivation is the application to the minimax game search, which has been a major topic of interest in artificial intelligence. In this paper we introduce an abstract setting to clearly describe the essential properties of the problem. While previous work only considered a two-move game tree search problem, our abstract setting can be applied to the general minimax game","authors_text":"Csaba Szepesv\\'ari, Martin M\\\"uller, Mohammad M. Ajallooeian, Ruitong Huang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-16T09:51:36Z","title":"Structured Best Arm Identification with Fixed Confidence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05198","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:8035ec7e9e1a77c4598a3bd4e986c98075b7a88e658145f6a454477f3cda16a1","target":"record","created_at":"2026-05-18T00:42: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":"119d7279f3858fed92a83dfabf5b6df8bb1968a3e663550c507ca95cc0d4ab2d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-16T09:51:36Z","title_canon_sha256":"e3b018ac3315e0c105cb47470c10d79323690f299dd372d812b31d3602eeeed3"},"schema_version":"1.0","source":{"id":"1706.05198","kind":"arxiv","version":2}},"canonical_sha256":"4df852ba47e5325db5416009a38e38a59d5aaade2ca24e75ee4104363707b86a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4df852ba47e5325db5416009a38e38a59d5aaade2ca24e75ee4104363707b86a","first_computed_at":"2026-05-18T00:42:11.799448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:11.799448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5k0v2L8ofIJgOWQgpwBDAm/Evlh3dgS3d370HQ8+CZGISZRVfLxLXwlBywzC+SeTRWkGU00EtnNseGTZdJTECA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:11.800040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05198","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8035ec7e9e1a77c4598a3bd4e986c98075b7a88e658145f6a454477f3cda16a1","sha256:ca36d8ca5ba6ac47a163794583117be57f5103eb1e7e345998c4d426fb2c706d"],"state_sha256":"e678a90bfde1b35779e0502fc47e7529fb9872e4666953dfef15f29b367378f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V+AjNN5Vxdl29iXksEHIkeFK/rWw2akcygdMDF78BJ0sZR//RB4sk+isqv2Am/dMIDwXU/zn5jAd4o0afnfiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T17:12:33.700896Z","bundle_sha256":"76c55bd99402402e875334f70555384c4aaba9988829f8700096ac4363a46812"}}