{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MKIMEQFVSV5462QB3BMDTAYDBG","short_pith_number":"pith:MKIMEQFV","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"},"canonical_sha256":"6290c240b5957bcf6a01d85839830309ba4917f25664ac6278b810ec8b9bbffc","source":{"kind":"arxiv","id":"1504.05823","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05823","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05823v2","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05823","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"MKIMEQFVSV54","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MKIMEQFVSV5462QB","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MKIMEQFV","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MKIMEQFVSV5462QB3BMDTAYDBG","target":"record","payload":{"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"},"canonical_sha256":"6290c240b5957bcf6a01d85839830309ba4917f25664ac6278b810ec8b9bbffc","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"},"source_kind":"arxiv","source_id":"1504.05823","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-18T01:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqBNwkr2PlZUHyuzRj2H97nQWBUENbIlDnPevMmgw6TrniA9ql1fmKCB5zmWdimxuN464RakQfHHcE2YBO58BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:58:47.075832Z"},"content_sha256":"8b1e9b9fc1794af72a6533b5bda26baaa31525eb1079bca279bb8e007a3cab9b","schema_version":"1.0","event_id":"sha256:8b1e9b9fc1794af72a6533b5bda26baaa31525eb1079bca279bb8e007a3cab9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MKIMEQFVSV5462QB3BMDTAYDBG","target":"graph","payload":{"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"},"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:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQvhMM5ph/Wx14IAug7M0lNnYZmBTbwRUq10PYwDNxhhhNIsninh8Z0rb1Y0zvWly4e/9y80lju4w0pT5yzkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:58:47.076393Z"},"content_sha256":"f4d079a8f2fd460d0aef4822ea42ae7242d63d27b57d09539f9671d3675a8e77","schema_version":"1.0","event_id":"sha256:f4d079a8f2fd460d0aef4822ea42ae7242d63d27b57d09539f9671d3675a8e77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG/bundle.json","state_url":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKIMEQFVSV5462QB3BMDTAYDBG/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-08T17:58:47Z","links":{"resolver":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG","bundle":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG/bundle.json","state":"https://pith.science/pith/MKIMEQFVSV5462QB3BMDTAYDBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKIMEQFVSV5462QB3BMDTAYDBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MKIMEQFVSV5462QB3BMDTAYDBG","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":"9f4e076d54981f3eca49cbdd1954d2731e43e2241504327606b110e92841ff77","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-22T14:30:13Z","title_canon_sha256":"28a939b9a3fec5d05a295cd708702bce5427f3162ec85626f46e2b3a2ebda19a"},"schema_version":"1.0","source":{"id":"1504.05823","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05823","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05823v2","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05823","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"MKIMEQFVSV54","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MKIMEQFVSV5462QB","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MKIMEQFV","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:f4d079a8f2fd460d0aef4822ea42ae7242d63d27b57d09539f9671d3675a8e77","target":"graph","created_at":"2026-05-18T01:58:26Z","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 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","authors_text":"Junya Honda, 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-04-22T14:30:13Z","title":"Normal Bandits of Unknown Means and Variances: Asymptotic Optimality, Finite Horizon Regret Bounds, and a Solution to an Open Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05823","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:8b1e9b9fc1794af72a6533b5bda26baaa31525eb1079bca279bb8e007a3cab9b","target":"record","created_at":"2026-05-18T01:58:26Z","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":"9f4e076d54981f3eca49cbdd1954d2731e43e2241504327606b110e92841ff77","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-22T14:30:13Z","title_canon_sha256":"28a939b9a3fec5d05a295cd708702bce5427f3162ec85626f46e2b3a2ebda19a"},"schema_version":"1.0","source":{"id":"1504.05823","kind":"arxiv","version":2}},"canonical_sha256":"6290c240b5957bcf6a01d85839830309ba4917f25664ac6278b810ec8b9bbffc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6290c240b5957bcf6a01d85839830309ba4917f25664ac6278b810ec8b9bbffc","first_computed_at":"2026-05-18T01:58:26.694980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:26.694980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dj5F992NZD9Zsh7n2j+R3QN5VuOlVHugbc+Vx19Dplku5jWbwAVDTFrs5o8cOiJAIui+G9qY+PwKrfh8LuMaCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:26.695726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05823","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b1e9b9fc1794af72a6533b5bda26baaa31525eb1079bca279bb8e007a3cab9b","sha256:f4d079a8f2fd460d0aef4822ea42ae7242d63d27b57d09539f9671d3675a8e77"],"state_sha256":"dcf875e41127cea08435428fa72a4e26d08e6e17ce320de4806fa416a1d3c552"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WZ0SaibQFDGWk08tAr/fMVEqi1hClOxI/nulTlYhLyAb4LCr1KBSYjlrta49ZCswCfCXLqV5Zjg6StomCF5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:58:47.079446Z","bundle_sha256":"4b41101885e0ff45b3bcfb6a375febc9018dc14316154fb75bd26abd36569f84"}}