{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MKIMEQFVSV5462QB3BMDTAYDBG","short_pith_number":"pith:MKIMEQFV","schema_version":"1.0","canonical_sha256":"6290c240b5957bcf6a01d85839830309ba4917f25664ac6278b810ec8b9bbffc","source":{"kind":"arxiv","id":"1504.05823","version":2},"attestation_state":"computed","paper":{"title":"Normal Bandits of Unknown Means and Variances: Asymptotic Optimality, Finite Horizon Regret Bounds, and a Solution to an Open Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Junya Honda, Michael N. Katehakis, Wesley Cowan","submitted_at":"2015-04-22T14:30:13Z","abstract_excerpt":"Consider the problem of 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$,\n  $\\{ X^i_k \\}_{k \\geq 1}$ is a sequence of i.i.d. normal random variables, with unknown mean $\\mu_i$ and unknown variance $\\sigma_i^2$.\n  The objective is to have a policy $\\pi$ for deciding from which of the $N$ populations to sample form at any time $n=1,2,\\ldots$ so as to maximize the expect"},"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":"1504.05823","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-22T14:30:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"28a939b9a3fec5d05a295cd708702bce5427f3162ec85626f46e2b3a2ebda19a","abstract_canon_sha256":"9f4e076d54981f3eca49cbdd1954d2731e43e2241504327606b110e92841ff77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:26.695726Z","signature_b64":"dj5F992NZD9Zsh7n2j+R3QN5VuOlVHugbc+Vx19Dplku5jWbwAVDTFrs5o8cOiJAIui+G9qY+PwKrfh8LuMaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6290c240b5957bcf6a01d85839830309ba4917f25664ac6278b810ec8b9bbffc","last_reissued_at":"2026-05-18T01:58:26.694980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:26.694980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Normal Bandits of Unknown Means and Variances: Asymptotic Optimality, Finite Horizon Regret Bounds, and a Solution to an Open Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Junya Honda, Michael N. Katehakis, Wesley Cowan","submitted_at":"2015-04-22T14:30:13Z","abstract_excerpt":"Consider the problem of 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$,\n  $\\{ X^i_k \\}_{k \\geq 1}$ is a sequence of i.i.d. normal random variables, with unknown mean $\\mu_i$ and unknown variance $\\sigma_i^2$.\n  The objective is to have a policy $\\pi$ for deciding from which of the $N$ populations to sample form at any time $n=1,2,\\ldots$ so as to maximize the expect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05823","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.05823","created_at":"2026-05-18T01:58:26.695069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05823v2","created_at":"2026-05-18T01:58:26.695069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05823","created_at":"2026-05-18T01:58:26.695069+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKIMEQFVSV54","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKIMEQFVSV5462QB","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKIMEQFV","created_at":"2026-05-18T12:29:32.376354+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/MKIMEQFVSV5462QB3BMDTAYDBG","json":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG.json","graph_json":"https://pith.science/api/pith-number/MKIMEQFVSV5462QB3BMDTAYDBG/graph.json","events_json":"https://pith.science/api/pith-number/MKIMEQFVSV5462QB3BMDTAYDBG/events.json","paper":"https://pith.science/paper/MKIMEQFV"},"agent_actions":{"view_html":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG","download_json":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG.json","view_paper":"https://pith.science/paper/MKIMEQFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05823&json=true","fetch_graph":"https://pith.science/api/pith-number/MKIMEQFVSV5462QB3BMDTAYDBG/graph.json","fetch_events":"https://pith.science/api/pith-number/MKIMEQFVSV5462QB3BMDTAYDBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG/action/storage_attestation","attest_author":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG/action/author_attestation","sign_citation":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG/action/citation_signature","submit_replication":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG/action/replication_record"}},"created_at":"2026-05-18T01:58:26.695069+00:00","updated_at":"2026-05-18T01:58:26.695069+00:00"}