{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VHJVUXK4GARADW2MA2KWREC4U5","short_pith_number":"pith:VHJVUXK4","canonical_record":{"source":{"id":"1702.03605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-13T01:31:46Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"b375c224a4e18ee88fd3ac5fc40ba3ee58cd4db78a1b4b6ba94627ad9e8d790a","abstract_canon_sha256":"5d18fc839411f7f6102de3021d06e16609d885a1f46505a469aa8f0558a4867c"},"schema_version":"1.0"},"canonical_sha256":"a9d35a5d5c302201db4c069568905ca764d7f7e3775011b0c02e99b4b238c059","source":{"kind":"arxiv","id":"1702.03605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03605","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03605v1","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03605","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"VHJVUXK4GARA","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VHJVUXK4GARADW2M","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VHJVUXK4","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VHJVUXK4GARADW2MA2KWREC4U5","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-13T01:31:46Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"b375c224a4e18ee88fd3ac5fc40ba3ee58cd4db78a1b4b6ba94627ad9e8d790a","abstract_canon_sha256":"5d18fc839411f7f6102de3021d06e16609d885a1f46505a469aa8f0558a4867c"},"schema_version":"1.0"},"canonical_sha256":"a9d35a5d5c302201db4c069568905ca764d7f7e3775011b0c02e99b4b238c059","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:51.612210Z","signature_b64":"lzcPjV3xOZzxESP1M36F4qFDalNrAQQDEqCBzYT2qNdGUuDfBlN0op4A+w8fAYCqt+uGqTbZitSjKN3+tDQfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d35a5d5c302201db4c069568905ca764d7f7e3775011b0c02e99b4b238c059","last_reissued_at":"2026-05-18T00:50:51.611578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:51.611578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03605","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:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"woHLv5plryeZl34O/j01i6znYW+sBQTGSfuAl4pKOlwlw4CglB5TE6USUmm9kpm4xQ+bcqMvbGz5ri7xVc5QBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:36:33.507999Z"},"content_sha256":"8e67d308fe26fa69bacc6badce43aaeda6bb05b044cba371cf44224a5649b6ea","schema_version":"1.0","event_id":"sha256:8e67d308fe26fa69bacc6badce43aaeda6bb05b044cba371cf44224a5649b6ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VHJVUXK4GARADW2MA2KWREC4U5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian Li, Lijie Chen, Mingda Qiao","submitted_at":"2017-02-13T01:31:46Z","abstract_excerpt":"In the Best-$k$-Arm problem, we are given $n$ stochastic bandit arms, each associated with an unknown reward distribution. We are required to identify the $k$ arms with the largest means by taking as few samples as possible. In this paper, we make progress towards a complete characterization of the instance-wise sample complexity bounds for the Best-$k$-Arm problem. On the lower bound side, we obtain a novel complexity term to measure the sample complexity that every Best-$k$-Arm instance requires. This is derived by an interesting and nontrivial reduction from the Best-$1$-Arm problem. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03605","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:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phb06RRGLYBDxLCynVSMGX8+x7SiYZuIJ+WozKiBqaX1Tqv3pldaZ3rtxMIeA49j7m4ZL5FoD0Tz4XHOh4RBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:36:33.508358Z"},"content_sha256":"8bf0c3a53f8097f645467cf0b55bb7f375746c7595b09b10c95bae9cece883df","schema_version":"1.0","event_id":"sha256:8bf0c3a53f8097f645467cf0b55bb7f375746c7595b09b10c95bae9cece883df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5/bundle.json","state_url":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHJVUXK4GARADW2MA2KWREC4U5/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-20T16:36:33Z","links":{"resolver":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5","bundle":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5/bundle.json","state":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHJVUXK4GARADW2MA2KWREC4U5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VHJVUXK4GARADW2MA2KWREC4U5","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":"5d18fc839411f7f6102de3021d06e16609d885a1f46505a469aa8f0558a4867c","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-13T01:31:46Z","title_canon_sha256":"b375c224a4e18ee88fd3ac5fc40ba3ee58cd4db78a1b4b6ba94627ad9e8d790a"},"schema_version":"1.0","source":{"id":"1702.03605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03605","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03605v1","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03605","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"VHJVUXK4GARA","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VHJVUXK4GARADW2M","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VHJVUXK4","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:8bf0c3a53f8097f645467cf0b55bb7f375746c7595b09b10c95bae9cece883df","target":"graph","created_at":"2026-05-18T00:50:51Z","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":"In the Best-$k$-Arm problem, we are given $n$ stochastic bandit arms, each associated with an unknown reward distribution. We are required to identify the $k$ arms with the largest means by taking as few samples as possible. In this paper, we make progress towards a complete characterization of the instance-wise sample complexity bounds for the Best-$k$-Arm problem. On the lower bound side, we obtain a novel complexity term to measure the sample complexity that every Best-$k$-Arm instance requires. This is derived by an interesting and nontrivial reduction from the Best-$1$-Arm problem. We als","authors_text":"Jian Li, Lijie Chen, Mingda Qiao","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-13T01:31:46Z","title":"Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03605","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:8e67d308fe26fa69bacc6badce43aaeda6bb05b044cba371cf44224a5649b6ea","target":"record","created_at":"2026-05-18T00:50:51Z","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":"5d18fc839411f7f6102de3021d06e16609d885a1f46505a469aa8f0558a4867c","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-13T01:31:46Z","title_canon_sha256":"b375c224a4e18ee88fd3ac5fc40ba3ee58cd4db78a1b4b6ba94627ad9e8d790a"},"schema_version":"1.0","source":{"id":"1702.03605","kind":"arxiv","version":1}},"canonical_sha256":"a9d35a5d5c302201db4c069568905ca764d7f7e3775011b0c02e99b4b238c059","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9d35a5d5c302201db4c069568905ca764d7f7e3775011b0c02e99b4b238c059","first_computed_at":"2026-05-18T00:50:51.611578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:51.611578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lzcPjV3xOZzxESP1M36F4qFDalNrAQQDEqCBzYT2qNdGUuDfBlN0op4A+w8fAYCqt+uGqTbZitSjKN3+tDQfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:51.612210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e67d308fe26fa69bacc6badce43aaeda6bb05b044cba371cf44224a5649b6ea","sha256:8bf0c3a53f8097f645467cf0b55bb7f375746c7595b09b10c95bae9cece883df"],"state_sha256":"10c50a552579e1e97e00b25744a6a740c73089922faed2643ae52a38c91dd353"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgLuineh4ltNgFiZKvJigLvE2+/5O/RjAEnq8QyusnP9a34nWp/HQ8z3Rk4SnOhqHmOEgpHriNnTjVGTRmKaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T16:36:33.510329Z","bundle_sha256":"85e23cf701139670add1cde36d653d93316f44ad5c703f788f6f2ad73d56c5f8"}}