{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WWRGEJ4734WK5ID2VAUJKIJ23A","short_pith_number":"pith:WWRGEJ47","canonical_record":{"source":{"id":"1806.00973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-04T06:37:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"aa437ca2f5e8101f92a60777bbad0cbb905a84a479232b1abe8dc945177f5b4e","abstract_canon_sha256":"e55058cb752a13deeaca5ee60e3276cf5875fa36d98165cfde78334db944be15"},"schema_version":"1.0"},"canonical_sha256":"b5a262279fdf2caea07aa82895213ad83f1d274359afcf938c7e42431e43c1d6","source":{"kind":"arxiv","id":"1806.00973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00973","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00973v1","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00973","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"WWRGEJ4734WK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WWRGEJ4734WK5ID2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WWRGEJ47","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WWRGEJ4734WK5ID2VAUJKIJ23A","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-04T06:37:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"aa437ca2f5e8101f92a60777bbad0cbb905a84a479232b1abe8dc945177f5b4e","abstract_canon_sha256":"e55058cb752a13deeaca5ee60e3276cf5875fa36d98165cfde78334db944be15"},"schema_version":"1.0"},"canonical_sha256":"b5a262279fdf2caea07aa82895213ad83f1d274359afcf938c7e42431e43c1d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:17.851852Z","signature_b64":"kQWdKOWTfiGcYy5NvzaOaR9E+zaay326GkCleFA4mEucDdeqKBh4/veflDJw5+wkRkLjRKRHZkcr2AozYUBzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5a262279fdf2caea07aa82895213ad83f1d274359afcf938c7e42431e43c1d6","last_reissued_at":"2026-05-18T00:14:17.851377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:17.851377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00973","source_version":1,"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:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QbsEPVE9cKSWx3qeewjs7rGRpkesJTur302zUPwvlsbwU1jUZK+hxTtWgG8ctozdYUwAYcLxEU8fCrzo0Q1lAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:57:09.095803Z"},"content_sha256":"7c576b18efb243c5db0c8fa688020f0f64ccdf6458de6407f5751add67f2d306","schema_version":"1.0","event_id":"sha256:7c576b18efb243c5db0c8fa688020f0f64ccdf6458de6407f5751add67f2d306"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WWRGEJ4734WK5ID2VAUJKIJ23A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aurelien Garivier (IMT), CNRS, CRIStAL), Emilie Kaufmann (SEQUEL, Wouter Koolen (CWI)","submitted_at":"2018-06-04T06:37:22Z","abstract_excerpt":"Learning the minimum/maximum mean among a finite set of distributions is a fundamental sub-task in planning, game tree search and reinforcement learning. We formalize this learning task as the problem of sequentially testing how the minimum mean among a finite set of distributions compares to a given threshold. We develop refined non-asymptotic lower bounds, which show that optimality mandates very different sampling behavior for a low vs high true minimum. We show that Thompson Sampling and the intuitive Lower Confidence Bounds policy each nail only one of these cases. We develop a novel appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00973","kind":"arxiv","version":1},"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:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xCSoggeQgiKf4GC4gor7Rbm1xuwyD5wFjDp60rWBNet57IfOjoUTdn1+GCyD9dJzv+Ywg8YiM1pyLU2ag+PoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:57:09.096145Z"},"content_sha256":"ba18c7999b90e60cb60fa435180fb9b9c800a81cb53392d4c91b448e353b93a3","schema_version":"1.0","event_id":"sha256:ba18c7999b90e60cb60fa435180fb9b9c800a81cb53392d4c91b448e353b93a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWRGEJ4734WK5ID2VAUJKIJ23A/bundle.json","state_url":"https://pith.science/pith/WWRGEJ4734WK5ID2VAUJKIJ23A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWRGEJ4734WK5ID2VAUJKIJ23A/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-05-31T06:57:09Z","links":{"resolver":"https://pith.science/pith/WWRGEJ4734WK5ID2VAUJKIJ23A","bundle":"https://pith.science/pith/WWRGEJ4734WK5ID2VAUJKIJ23A/bundle.json","state":"https://pith.science/pith/WWRGEJ4734WK5ID2VAUJKIJ23A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWRGEJ4734WK5ID2VAUJKIJ23A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WWRGEJ4734WK5ID2VAUJKIJ23A","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":"e55058cb752a13deeaca5ee60e3276cf5875fa36d98165cfde78334db944be15","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-04T06:37:22Z","title_canon_sha256":"aa437ca2f5e8101f92a60777bbad0cbb905a84a479232b1abe8dc945177f5b4e"},"schema_version":"1.0","source":{"id":"1806.00973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00973","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00973v1","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00973","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"WWRGEJ4734WK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WWRGEJ4734WK5ID2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WWRGEJ47","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:ba18c7999b90e60cb60fa435180fb9b9c800a81cb53392d4c91b448e353b93a3","target":"graph","created_at":"2026-05-18T00:14:17Z","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":"Learning the minimum/maximum mean among a finite set of distributions is a fundamental sub-task in planning, game tree search and reinforcement learning. We formalize this learning task as the problem of sequentially testing how the minimum mean among a finite set of distributions compares to a given threshold. We develop refined non-asymptotic lower bounds, which show that optimality mandates very different sampling behavior for a low vs high true minimum. We show that Thompson Sampling and the intuitive Lower Confidence Bounds policy each nail only one of these cases. We develop a novel appr","authors_text":"Aurelien Garivier (IMT), CNRS, CRIStAL), Emilie Kaufmann (SEQUEL, Wouter Koolen (CWI)","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-04T06:37:22Z","title":"Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00973","kind":"arxiv","version":1},"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:7c576b18efb243c5db0c8fa688020f0f64ccdf6458de6407f5751add67f2d306","target":"record","created_at":"2026-05-18T00:14:17Z","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":"e55058cb752a13deeaca5ee60e3276cf5875fa36d98165cfde78334db944be15","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-04T06:37:22Z","title_canon_sha256":"aa437ca2f5e8101f92a60777bbad0cbb905a84a479232b1abe8dc945177f5b4e"},"schema_version":"1.0","source":{"id":"1806.00973","kind":"arxiv","version":1}},"canonical_sha256":"b5a262279fdf2caea07aa82895213ad83f1d274359afcf938c7e42431e43c1d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5a262279fdf2caea07aa82895213ad83f1d274359afcf938c7e42431e43c1d6","first_computed_at":"2026-05-18T00:14:17.851377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:17.851377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kQWdKOWTfiGcYy5NvzaOaR9E+zaay326GkCleFA4mEucDdeqKBh4/veflDJw5+wkRkLjRKRHZkcr2AozYUBzDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:17.851852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c576b18efb243c5db0c8fa688020f0f64ccdf6458de6407f5751add67f2d306","sha256:ba18c7999b90e60cb60fa435180fb9b9c800a81cb53392d4c91b448e353b93a3"],"state_sha256":"25fb4aecffaef88e03389a7e51d87b12f8df8b88c56c5ffb95e183a9180e923d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gb+1Sr0RWo851v8IcMaQHAfIYRaKuNicrWv0u7lxX7KrgfeZu1ZZQRkKtsZGPuKBjahgG69Xc5N9dTJkMKnSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:57:09.098069Z","bundle_sha256":"57d8d2b6849ec7549b477f98157524000f2fb1bf65cd6bb2b13bfea0d7a780b1"}}