{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2VWRUUBTAVMOWCQYNSBAFRNSER","short_pith_number":"pith:2VWRUUBT","schema_version":"1.0","canonical_sha256":"d56d1a50330558eb0a186c8202c5b2244de3ac7ec4fdfba0f9be5f893843ba3c","source":{"kind":"arxiv","id":"1505.01918","version":3},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.01918","created_at":"2026-05-18T01:32:10.335246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01918v3","created_at":"2026-05-18T01:32:10.335246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01918","created_at":"2026-05-18T01:32:10.335246+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VWRUUBTAVMO","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VWRUUBTAVMOWCQY","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VWRUUBT","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER","json":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER.json","graph_json":"https://pith.science/api/pith-number/2VWRUUBTAVMOWCQYNSBAFRNSER/graph.json","events_json":"https://pith.science/api/pith-number/2VWRUUBTAVMOWCQYNSBAFRNSER/events.json","paper":"https://pith.science/paper/2VWRUUBT"},"agent_actions":{"view_html":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER","download_json":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER.json","view_paper":"https://pith.science/paper/2VWRUUBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01918&json=true","fetch_graph":"https://pith.science/api/pith-number/2VWRUUBTAVMOWCQYNSBAFRNSER/graph.json","fetch_events":"https://pith.science/api/pith-number/2VWRUUBTAVMOWCQYNSBAFRNSER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/action/storage_attestation","attest_author":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/action/author_attestation","sign_citation":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/action/citation_signature","submit_replication":"https://pith.science/pith/2VWRUUBTAVMOWCQYNSBAFRNSER/action/replication_record"}},"created_at":"2026-05-18T01:32:10.335246+00:00","updated_at":"2026-05-18T01:32:10.335246+00:00"}