{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WVGYUFJNKMYEWQD7PT2OS3ZWWI","short_pith_number":"pith:WVGYUFJN","canonical_record":{"source":{"id":"1906.06594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-15T17:39:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"919bc767723715b0fbde857470f2052ade56f0fede9eb7f0e36c0de8ca9c2ccf","abstract_canon_sha256":"ed6961f71ef265392ab29391142dd2d04d940634715a06d2234e0a575acdf5d5"},"schema_version":"1.0"},"canonical_sha256":"b54d8a152d53304b407f7cf4e96f36b23d8e3e412f46706f863ab8aa60830593","source":{"kind":"arxiv","id":"1906.06594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06594","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06594v1","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06594","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"pith_short_12","alias_value":"WVGYUFJNKMYE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WVGYUFJNKMYEWQD7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WVGYUFJN","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WVGYUFJNKMYEWQD7PT2OS3ZWWI","target":"record","payload":{"canonical_record":{"source":{"id":"1906.06594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-15T17:39:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"919bc767723715b0fbde857470f2052ade56f0fede9eb7f0e36c0de8ca9c2ccf","abstract_canon_sha256":"ed6961f71ef265392ab29391142dd2d04d940634715a06d2234e0a575acdf5d5"},"schema_version":"1.0"},"canonical_sha256":"b54d8a152d53304b407f7cf4e96f36b23d8e3e412f46706f863ab8aa60830593","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:13.256048Z","signature_b64":"I1idQLr/CnKJq36gRCCOWBwFhblviol4TrutqBrn82vh8x3tV9+wRGW3zQq6uPC1bHKdtrM1RJxMxdlRji5oCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b54d8a152d53304b407f7cf4e96f36b23d8e3e412f46706f863ab8aa60830593","last_reissued_at":"2026-05-17T23:43:13.255496Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:13.255496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.06594","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-17T23:43:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oI4g0iTU+/gkB/NEm1eyz3GSWplnmc9CC0QPCqZr0tDIFqUz7KK/Fih2ghKwhgQH2+cX9uu47GXFZI5FlJhhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:10:21.892720Z"},"content_sha256":"3f0f801e73bdde338886276d4a319b506ab9abff8355793b7fbf2b733133c314","schema_version":"1.0","event_id":"sha256:3f0f801e73bdde338886276d4a319b506ab9abff8355793b7fbf2b733133c314"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WVGYUFJNKMYEWQD7PT2OS3ZWWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The True Sample Complexity of Identifying Good Arms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Julian Katz-Samuels, Kevin Jamieson","submitted_at":"2019-06-15T17:39:18Z","abstract_excerpt":"We consider two multi-armed bandit problems with $n$ arms: (i) given an $\\epsilon > 0$, identify an arm with mean that is within $\\epsilon$ of the largest mean and (ii) given a threshold $\\mu_0$ and integer $k$, identify $k$ arms with means larger than $\\mu_0$. Existing lower bounds and algorithms for the PAC framework suggest that both of these problems require $\\Omega(n)$ samples. However, we argue that these definitions not only conflict with how these algorithms are used in practice, but also that these results disagree with intuition that says (i) requires only $\\Theta(\\frac{n}{m})$ sampl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06594","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-17T23:43:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgP1UjiWxpg4+PBn+W0HYfpdymrMmbRSZUcD36NNqJYBo3ca+zBbnuHPgFGpZDVO2lG+bB1bc4OOhOLcGNtKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:10:21.893072Z"},"content_sha256":"d4c9943e3055808585335618a34bb9d6c8061cadf97d40f9dbc30bfa59f084c9","schema_version":"1.0","event_id":"sha256:d4c9943e3055808585335618a34bb9d6c8061cadf97d40f9dbc30bfa59f084c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVGYUFJNKMYEWQD7PT2OS3ZWWI/bundle.json","state_url":"https://pith.science/pith/WVGYUFJNKMYEWQD7PT2OS3ZWWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVGYUFJNKMYEWQD7PT2OS3ZWWI/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-01T03:10:21Z","links":{"resolver":"https://pith.science/pith/WVGYUFJNKMYEWQD7PT2OS3ZWWI","bundle":"https://pith.science/pith/WVGYUFJNKMYEWQD7PT2OS3ZWWI/bundle.json","state":"https://pith.science/pith/WVGYUFJNKMYEWQD7PT2OS3ZWWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVGYUFJNKMYEWQD7PT2OS3ZWWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WVGYUFJNKMYEWQD7PT2OS3ZWWI","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":"ed6961f71ef265392ab29391142dd2d04d940634715a06d2234e0a575acdf5d5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-15T17:39:18Z","title_canon_sha256":"919bc767723715b0fbde857470f2052ade56f0fede9eb7f0e36c0de8ca9c2ccf"},"schema_version":"1.0","source":{"id":"1906.06594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06594","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06594v1","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06594","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"pith_short_12","alias_value":"WVGYUFJNKMYE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WVGYUFJNKMYEWQD7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WVGYUFJN","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:d4c9943e3055808585335618a34bb9d6c8061cadf97d40f9dbc30bfa59f084c9","target":"graph","created_at":"2026-05-17T23:43:13Z","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":"We consider two multi-armed bandit problems with $n$ arms: (i) given an $\\epsilon > 0$, identify an arm with mean that is within $\\epsilon$ of the largest mean and (ii) given a threshold $\\mu_0$ and integer $k$, identify $k$ arms with means larger than $\\mu_0$. Existing lower bounds and algorithms for the PAC framework suggest that both of these problems require $\\Omega(n)$ samples. However, we argue that these definitions not only conflict with how these algorithms are used in practice, but also that these results disagree with intuition that says (i) requires only $\\Theta(\\frac{n}{m})$ sampl","authors_text":"Julian Katz-Samuels, Kevin Jamieson","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-15T17:39:18Z","title":"The True Sample Complexity of Identifying Good Arms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06594","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:3f0f801e73bdde338886276d4a319b506ab9abff8355793b7fbf2b733133c314","target":"record","created_at":"2026-05-17T23:43:13Z","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":"ed6961f71ef265392ab29391142dd2d04d940634715a06d2234e0a575acdf5d5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-15T17:39:18Z","title_canon_sha256":"919bc767723715b0fbde857470f2052ade56f0fede9eb7f0e36c0de8ca9c2ccf"},"schema_version":"1.0","source":{"id":"1906.06594","kind":"arxiv","version":1}},"canonical_sha256":"b54d8a152d53304b407f7cf4e96f36b23d8e3e412f46706f863ab8aa60830593","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b54d8a152d53304b407f7cf4e96f36b23d8e3e412f46706f863ab8aa60830593","first_computed_at":"2026-05-17T23:43:13.255496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:13.255496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I1idQLr/CnKJq36gRCCOWBwFhblviol4TrutqBrn82vh8x3tV9+wRGW3zQq6uPC1bHKdtrM1RJxMxdlRji5oCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:13.256048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f0f801e73bdde338886276d4a319b506ab9abff8355793b7fbf2b733133c314","sha256:d4c9943e3055808585335618a34bb9d6c8061cadf97d40f9dbc30bfa59f084c9"],"state_sha256":"9cbb25b219ed969ce521d124d47de70d8b111429f337ce46a4d5162f298e0217"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87mXtvSewltNduNj8YNc7RZpUNz4ii+PIz7U//hSPjJdKIPZ1wwXROjtTTlmskxhvEZZsqhJARq++74HQ95bAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:10:21.895196Z","bundle_sha256":"2128ec3b5e7fe0400da24ca8371eeb4de39af2065e84093b8ebcb261bb31eeeb"}}