{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W4RNY4EFMYO6QHYQOF27FOXXNJ","short_pith_number":"pith:W4RNY4EF","canonical_record":{"source":{"id":"1706.01081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T14:27:17Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"0c40c551fc200d66ef145a79b040587b8e6449900b7ab54e056e19478200f0ec","abstract_canon_sha256":"20e9d92cdb37fb311215e07f5a0a6c5e269ad1fe09aa15ce46ffcabf7ba6a5bd"},"schema_version":"1.0"},"canonical_sha256":"b722dc7085661de81f107175f2baf76a511f1063e27172286397fc665cc0dc24","source":{"kind":"arxiv","id":"1706.01081","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01081","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01081v1","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01081","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"pith_short_12","alias_value":"W4RNY4EFMYO6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W4RNY4EFMYO6QHYQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W4RNY4EF","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W4RNY4EFMYO6QHYQOF27FOXXNJ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T14:27:17Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"0c40c551fc200d66ef145a79b040587b8e6449900b7ab54e056e19478200f0ec","abstract_canon_sha256":"20e9d92cdb37fb311215e07f5a0a6c5e269ad1fe09aa15ce46ffcabf7ba6a5bd"},"schema_version":"1.0"},"canonical_sha256":"b722dc7085661de81f107175f2baf76a511f1063e27172286397fc665cc0dc24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:04.570164Z","signature_b64":"aaP6Vt6Wf3Bjqkw8s7M6maMUm2UiXz+8TgJ4uJ4KckxvM/hq/eqs5OrevLZzsC+eMFpbXQoY5vRgbVXZLfhkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b722dc7085661de81f107175f2baf76a511f1063e27172286397fc665cc0dc24","last_reissued_at":"2026-05-18T00:43:04.569396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:04.569396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01081","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:43:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOmh3yMvJB4n625vHA4YEJL1w2lwwQcCnrrjMqIHQnAOR6Rbx71YCEcpqF9DgIMviEIz0eMkzPkRecyRmY13Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:17:01.384081Z"},"content_sha256":"091204316907e30795d45cae7fd1ef500afdbe9de53592dc616bcf5bd52c3939","schema_version":"1.0","event_id":"sha256:091204316907e30795d45cae7fd1ef500afdbe9de53592dc616bcf5bd52c3939"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W4RNY4EFMYO6QHYQOF27FOXXNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anupam Gupta, Jian Li, Lijie Chen, Mingda Qiao, Ruosong Wang","submitted_at":"2017-06-04T14:27:17Z","abstract_excerpt":"We study the combinatorial pure exploration problem Best-Set in stochastic multi-armed bandits. In a Best-Set instance, we are given $n$ arms with unknown reward distributions, as well as a family $\\mathcal{F}$ of feasible subsets over the arms. Our goal is to identify the feasible subset in $\\mathcal{F}$ with the maximum total mean using as few samples as possible. The problem generalizes the classical best arm identification problem and the top-$k$ arm identification problem, both of which have attracted significant attention in recent years. We provide a novel instance-wise lower bound for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01081","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:43:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7n2vJdh/TmtbbYNSzrr9eSy92miEX2xcShIR4uRtv7BtBSqXXcrx9gkQOrr4dGCVcfvsSvFBYFSHkT0lyuhXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:17:01.384641Z"},"content_sha256":"c4bdde25aabd24a880dfeb71862ed4022374d3634befa0e1a6204b879189d7df","schema_version":"1.0","event_id":"sha256:c4bdde25aabd24a880dfeb71862ed4022374d3634befa0e1a6204b879189d7df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4RNY4EFMYO6QHYQOF27FOXXNJ/bundle.json","state_url":"https://pith.science/pith/W4RNY4EFMYO6QHYQOF27FOXXNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4RNY4EFMYO6QHYQOF27FOXXNJ/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-05T03:17:01Z","links":{"resolver":"https://pith.science/pith/W4RNY4EFMYO6QHYQOF27FOXXNJ","bundle":"https://pith.science/pith/W4RNY4EFMYO6QHYQOF27FOXXNJ/bundle.json","state":"https://pith.science/pith/W4RNY4EFMYO6QHYQOF27FOXXNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4RNY4EFMYO6QHYQOF27FOXXNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W4RNY4EFMYO6QHYQOF27FOXXNJ","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":"20e9d92cdb37fb311215e07f5a0a6c5e269ad1fe09aa15ce46ffcabf7ba6a5bd","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T14:27:17Z","title_canon_sha256":"0c40c551fc200d66ef145a79b040587b8e6449900b7ab54e056e19478200f0ec"},"schema_version":"1.0","source":{"id":"1706.01081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01081","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01081v1","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01081","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"pith_short_12","alias_value":"W4RNY4EFMYO6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W4RNY4EFMYO6QHYQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W4RNY4EF","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:c4bdde25aabd24a880dfeb71862ed4022374d3634befa0e1a6204b879189d7df","target":"graph","created_at":"2026-05-18T00:43:04Z","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 study the combinatorial pure exploration problem Best-Set in stochastic multi-armed bandits. In a Best-Set instance, we are given $n$ arms with unknown reward distributions, as well as a family $\\mathcal{F}$ of feasible subsets over the arms. Our goal is to identify the feasible subset in $\\mathcal{F}$ with the maximum total mean using as few samples as possible. The problem generalizes the classical best arm identification problem and the top-$k$ arm identification problem, both of which have attracted significant attention in recent years. We provide a novel instance-wise lower bound for ","authors_text":"Anupam Gupta, Jian Li, Lijie Chen, Mingda Qiao, Ruosong Wang","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T14:27:17Z","title":"Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01081","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:091204316907e30795d45cae7fd1ef500afdbe9de53592dc616bcf5bd52c3939","target":"record","created_at":"2026-05-18T00:43:04Z","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":"20e9d92cdb37fb311215e07f5a0a6c5e269ad1fe09aa15ce46ffcabf7ba6a5bd","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T14:27:17Z","title_canon_sha256":"0c40c551fc200d66ef145a79b040587b8e6449900b7ab54e056e19478200f0ec"},"schema_version":"1.0","source":{"id":"1706.01081","kind":"arxiv","version":1}},"canonical_sha256":"b722dc7085661de81f107175f2baf76a511f1063e27172286397fc665cc0dc24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b722dc7085661de81f107175f2baf76a511f1063e27172286397fc665cc0dc24","first_computed_at":"2026-05-18T00:43:04.569396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:04.569396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aaP6Vt6Wf3Bjqkw8s7M6maMUm2UiXz+8TgJ4uJ4KckxvM/hq/eqs5OrevLZzsC+eMFpbXQoY5vRgbVXZLfhkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:04.570164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:091204316907e30795d45cae7fd1ef500afdbe9de53592dc616bcf5bd52c3939","sha256:c4bdde25aabd24a880dfeb71862ed4022374d3634befa0e1a6204b879189d7df"],"state_sha256":"aa502d17752a9ada87f3d2062bcff9f4b7ad334bc8debe158a89832de86f3a62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lteKD1D9amyKkrU7yN0KJaRo/J/51vHzG/gwS+rk049qny1OYRAAwGI4ziPM+YWICbq0oJSTi0rCyu5h2piFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:17:01.387357Z","bundle_sha256":"37cf867196a31cea2e9366b854d122672d7ad520a019cd2f58f4210c665cfa44"}}