{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KVS3MURXTYFFSZGYIP44HLJ4TF","short_pith_number":"pith:KVS3MURX","canonical_record":{"source":{"id":"1609.02606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-08T21:46:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"17d46ef90ee8e5fa6d9793f26da83055f8fe1231781eb8c06f0611bfd7a70314","abstract_canon_sha256":"3d01a6c843765585aadccad53b8f7170801736e319cba0fcd713714b0909fdaf"},"schema_version":"1.0"},"canonical_sha256":"5565b652379e0a5964d843f9c3ad3c99470e724bf04380bef5d9bcf382f042e1","source":{"kind":"arxiv","id":"1609.02606","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02606","created_at":"2026-05-18T00:39:02Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02606v2","created_at":"2026-05-18T00:39:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02606","created_at":"2026-05-18T00:39:02Z"},{"alias_kind":"pith_short_12","alias_value":"KVS3MURXTYFF","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KVS3MURXTYFFSZGY","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KVS3MURX","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KVS3MURXTYFFSZGYIP44HLJ4TF","target":"record","payload":{"canonical_record":{"source":{"id":"1609.02606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-08T21:46:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"17d46ef90ee8e5fa6d9793f26da83055f8fe1231781eb8c06f0611bfd7a70314","abstract_canon_sha256":"3d01a6c843765585aadccad53b8f7170801736e319cba0fcd713714b0909fdaf"},"schema_version":"1.0"},"canonical_sha256":"5565b652379e0a5964d843f9c3ad3c99470e724bf04380bef5d9bcf382f042e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:02.178699Z","signature_b64":"L5FnkryLEdBZhipdXbx/ORt0+WmbUrNYr4R3Du2T7bQPnz3DhradUXEV34qbmRPeQA8Y5RY2ZLhox03FPH7DDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5565b652379e0a5964d843f9c3ad3c99470e724bf04380bef5d9bcf382f042e1","last_reissued_at":"2026-05-18T00:39:02.177935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:02.177935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.02606","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:39:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+nQ72AaYj1vY6iHzfl4FhqMZOxyDtrGC9Y8P/EXju4NT/ZVVpsTfkZ9PmN+hFylo/mYh2H/svtJjfq4NYSmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:30:55.879121Z"},"content_sha256":"03394868017ba6ccbb6b3ff90eb6b7da5b1f24cc67ae59f5bdfbcf6bf62d4d83","schema_version":"1.0","event_id":"sha256:03394868017ba6ccbb6b3ff90eb6b7da5b1f24cc67ae59f5bdfbcf6bf62d4d83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KVS3MURXTYFFSZGYIP44HLJ4TF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Sequential Elimination Algorithms for Best-Arm Identification in Multi-Armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Mohammad Noshad, Shahin Shahrampour, Vahid Tarokh","submitted_at":"2016-09-08T21:46:37Z","abstract_excerpt":"We consider the best-arm identification problem in multi-armed bandits, which focuses purely on exploration. A player is given a fixed budget to explore a finite set of arms, and the rewards of each arm are drawn independently from a fixed, unknown distribution. The player aims to identify the arm with the largest expected reward. We propose a general framework to unify sequential elimination algorithms, where the arms are dismissed iteratively until a unique arm is left. Our analysis reveals a novel performance measure expressed in terms of the sampling mechanism and number of eliminated arms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02606","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:39:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/C7eTSazYpV0VHNZh+TIedC+gtqFUdGmlNuJP+uUeoYYLAtruonFA5B5U3sHXtBgaBxfk25G+u7rBQVbNK/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:30:55.879492Z"},"content_sha256":"29e9dbe16349e9f5900a904caae59c4dfe2ed6b04707191af2c7ff14583dd5a6","schema_version":"1.0","event_id":"sha256:29e9dbe16349e9f5900a904caae59c4dfe2ed6b04707191af2c7ff14583dd5a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/bundle.json","state_url":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/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-10T14:30:55Z","links":{"resolver":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF","bundle":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/bundle.json","state":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KVS3MURXTYFFSZGYIP44HLJ4TF","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":"3d01a6c843765585aadccad53b8f7170801736e319cba0fcd713714b0909fdaf","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-08T21:46:37Z","title_canon_sha256":"17d46ef90ee8e5fa6d9793f26da83055f8fe1231781eb8c06f0611bfd7a70314"},"schema_version":"1.0","source":{"id":"1609.02606","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02606","created_at":"2026-05-18T00:39:02Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02606v2","created_at":"2026-05-18T00:39:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02606","created_at":"2026-05-18T00:39:02Z"},{"alias_kind":"pith_short_12","alias_value":"KVS3MURXTYFF","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KVS3MURXTYFFSZGY","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KVS3MURX","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:29e9dbe16349e9f5900a904caae59c4dfe2ed6b04707191af2c7ff14583dd5a6","target":"graph","created_at":"2026-05-18T00:39:02Z","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 the best-arm identification problem in multi-armed bandits, which focuses purely on exploration. A player is given a fixed budget to explore a finite set of arms, and the rewards of each arm are drawn independently from a fixed, unknown distribution. The player aims to identify the arm with the largest expected reward. We propose a general framework to unify sequential elimination algorithms, where the arms are dismissed iteratively until a unique arm is left. Our analysis reveals a novel performance measure expressed in terms of the sampling mechanism and number of eliminated arms","authors_text":"Mohammad Noshad, Shahin Shahrampour, Vahid Tarokh","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-08T21:46:37Z","title":"On Sequential Elimination Algorithms for Best-Arm Identification in Multi-Armed Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02606","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:03394868017ba6ccbb6b3ff90eb6b7da5b1f24cc67ae59f5bdfbcf6bf62d4d83","target":"record","created_at":"2026-05-18T00:39:02Z","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":"3d01a6c843765585aadccad53b8f7170801736e319cba0fcd713714b0909fdaf","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-08T21:46:37Z","title_canon_sha256":"17d46ef90ee8e5fa6d9793f26da83055f8fe1231781eb8c06f0611bfd7a70314"},"schema_version":"1.0","source":{"id":"1609.02606","kind":"arxiv","version":2}},"canonical_sha256":"5565b652379e0a5964d843f9c3ad3c99470e724bf04380bef5d9bcf382f042e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5565b652379e0a5964d843f9c3ad3c99470e724bf04380bef5d9bcf382f042e1","first_computed_at":"2026-05-18T00:39:02.177935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:02.177935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L5FnkryLEdBZhipdXbx/ORt0+WmbUrNYr4R3Du2T7bQPnz3DhradUXEV34qbmRPeQA8Y5RY2ZLhox03FPH7DDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:02.178699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.02606","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03394868017ba6ccbb6b3ff90eb6b7da5b1f24cc67ae59f5bdfbcf6bf62d4d83","sha256:29e9dbe16349e9f5900a904caae59c4dfe2ed6b04707191af2c7ff14583dd5a6"],"state_sha256":"d878e788aea250a890a007503b0c6ed06f862761cced91dc096e2064a582df12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xw+f7RKxt7O77IMlGVE9qOe6pMYRMZi9QwKxUx1rhRFRG0hjyXTJjhCAYoXgqBq6AzClBqXBzZgAjAjmyGo7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T14:30:55.881456Z","bundle_sha256":"dfb1c0c3b33be1963759c7bcb253df4c8c6974e56dfc26ebe3872373db82ea98"}}