{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2VWRUUBTAVMOWCQYNSBAFRNSER","short_pith_number":"pith:2VWRUUBT","canonical_record":{"source":{"id":"1505.01918","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-08T03:15:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3bb1687f9ab61d2cb3fc6f468c21e98bf47ef5e32ebe848cb32fc002d4b20c55","abstract_canon_sha256":"f2d4f645b63886f009de4e55ae5695610923e9ca49e39e86f7fc8eeb9bdac0f2"},"schema_version":"1.0"},"canonical_sha256":"d56d1a50330558eb0a186c8202c5b2244de3ac7ec4fdfba0f9be5f893843ba3c","source":{"kind":"arxiv","id":"1505.01918","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01918","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01918v3","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01918","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"pith_short_12","alias_value":"2VWRUUBTAVMO","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2VWRUUBTAVMOWCQY","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2VWRUUBT","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2VWRUUBTAVMOWCQYNSBAFRNSER","target":"record","payload":{"canonical_record":{"source":{"id":"1505.01918","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-08T03:15:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3bb1687f9ab61d2cb3fc6f468c21e98bf47ef5e32ebe848cb32fc002d4b20c55","abstract_canon_sha256":"f2d4f645b63886f009de4e55ae5695610923e9ca49e39e86f7fc8eeb9bdac0f2"},"schema_version":"1.0"},"canonical_sha256":"d56d1a50330558eb0a186c8202c5b2244de3ac7ec4fdfba0f9be5f893843ba3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:10.335835Z","signature_b64":"7ZDIHf5qUNwrYTKL8CUKLnE9rLcubc0o96A1+4WFMwbPww5YckLoLAN8eOvBgq24Gnok3r4E1m/5NCfMnq79AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d56d1a50330558eb0a186c8202c5b2244de3ac7ec4fdfba0f9be5f893843ba3c","last_reissued_at":"2026-05-18T01:32:10.335158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:10.335158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.01918","source_version":3,"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-18T01:32:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dg2CVdaEzdbcC6I4LjcR7Nza+60xKI6HfvND6XctDEmy+XQEqvY1BMGkqXdYUvFmzvIbMkcnrCs8MWGpWiQ7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:47:12.091393Z"},"content_sha256":"1261dc74b2469c76fb280825cee9ab47bda0549a09611a99a2b9314561e7e195","schema_version":"1.0","event_id":"sha256:1261dc74b2469c76fb280825cee9ab47bda0549a09611a99a2b9314561e7e195"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2VWRUUBTAVMOWCQYNSBAFRNSER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Asymptotically Optimal Policy for Uniform Bandits of Unknown Support","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Michael N. Katehakis, Wesley Cowan","submitted_at":"2015-05-08T03:15:49Z","abstract_excerpt":"Consider the problem of a controller sampling sequentially from a finite number of $N \\geq 2$ populations, specified by random variables $X^i_k$, $ i = 1,\\ldots , N,$ and $k = 1, 2, \\ldots$; where $X^i_k$ denotes the outcome from population $i$ the $k^{th}$ time it is sampled. It is assumed that for each fixed $i$, $\\{ X^i_k \\}_{k \\geq 1}$ is a sequence of i.i.d. uniform random variables over some interval $[a_i, b_i]$, with the support (i.e., $a_i, b_i$) unknown to the controller. The objective is to have a policy $\\pi$ for deciding, based on available data, from which of the $N$ populations "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01918","kind":"arxiv","version":3},"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-18T01:32:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGKwkOq57F5zgDsqeRFcBc0HMYPxT41pVxsipIpecyHukrfBKYUWwp3WzEVvv6bNbYogoHXVKPGVcnOiVkkzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:47:12.091741Z"},"content_sha256":"6af1319b8eb101e881e859d57c4fb3b48f8aabf1a8792e7763206a70fec1a8a5","schema_version":"1.0","event_id":"sha256:6af1319b8eb101e881e859d57c4fb3b48f8aabf1a8792e7763206a70fec1a8a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/bundle.json","state_url":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/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-08T23:47:12Z","links":{"resolver":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER","bundle":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/bundle.json","state":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2VWRUUBTAVMOWCQYNSBAFRNSER","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":"f2d4f645b63886f009de4e55ae5695610923e9ca49e39e86f7fc8eeb9bdac0f2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-08T03:15:49Z","title_canon_sha256":"3bb1687f9ab61d2cb3fc6f468c21e98bf47ef5e32ebe848cb32fc002d4b20c55"},"schema_version":"1.0","source":{"id":"1505.01918","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01918","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01918v3","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01918","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"pith_short_12","alias_value":"2VWRUUBTAVMO","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2VWRUUBTAVMOWCQY","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2VWRUUBT","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:6af1319b8eb101e881e859d57c4fb3b48f8aabf1a8792e7763206a70fec1a8a5","target":"graph","created_at":"2026-05-18T01:32:10Z","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":"Consider the problem of a controller sampling sequentially from a finite number of $N \\geq 2$ populations, specified by random variables $X^i_k$, $ i = 1,\\ldots , N,$ and $k = 1, 2, \\ldots$; where $X^i_k$ denotes the outcome from population $i$ the $k^{th}$ time it is sampled. It is assumed that for each fixed $i$, $\\{ X^i_k \\}_{k \\geq 1}$ is a sequence of i.i.d. uniform random variables over some interval $[a_i, b_i]$, with the support (i.e., $a_i, b_i$) unknown to the controller. The objective is to have a policy $\\pi$ for deciding, based on available data, from which of the $N$ populations ","authors_text":"Michael N. Katehakis, Wesley Cowan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-08T03:15:49Z","title":"An Asymptotically Optimal Policy for Uniform Bandits of Unknown Support"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01918","kind":"arxiv","version":3},"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:1261dc74b2469c76fb280825cee9ab47bda0549a09611a99a2b9314561e7e195","target":"record","created_at":"2026-05-18T01:32:10Z","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":"f2d4f645b63886f009de4e55ae5695610923e9ca49e39e86f7fc8eeb9bdac0f2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-08T03:15:49Z","title_canon_sha256":"3bb1687f9ab61d2cb3fc6f468c21e98bf47ef5e32ebe848cb32fc002d4b20c55"},"schema_version":"1.0","source":{"id":"1505.01918","kind":"arxiv","version":3}},"canonical_sha256":"d56d1a50330558eb0a186c8202c5b2244de3ac7ec4fdfba0f9be5f893843ba3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d56d1a50330558eb0a186c8202c5b2244de3ac7ec4fdfba0f9be5f893843ba3c","first_computed_at":"2026-05-18T01:32:10.335158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:10.335158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ZDIHf5qUNwrYTKL8CUKLnE9rLcubc0o96A1+4WFMwbPww5YckLoLAN8eOvBgq24Gnok3r4E1m/5NCfMnq79AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:10.335835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01918","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1261dc74b2469c76fb280825cee9ab47bda0549a09611a99a2b9314561e7e195","sha256:6af1319b8eb101e881e859d57c4fb3b48f8aabf1a8792e7763206a70fec1a8a5"],"state_sha256":"835061470a14c4007143f81313d218de5be03aa313ccf80e24eaa300e6bb4023"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JIchs4suTxgoMrPCrawOQUFkHHj82ctWYazB1PQLTJWhEZbE5KakPSmJnYuStne2lMlZYe9D9N6emH3SVyqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:47:12.093804Z","bundle_sha256":"75d75f31ea811f1bc0dbe1745b77c059f448c79e04775867a7b8dc4e03652b5f"}}