{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LMGFO6OKF6WYV3R3AFL5RE64O6","short_pith_number":"pith:LMGFO6OK","canonical_record":{"source":{"id":"1706.01383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-05T15:46:52Z","cross_cats_sorted":[],"title_canon_sha256":"31778f543ca5b2f46ab39e382f492cbb53516781d732e1dd21dfa7b4e5902ce8","abstract_canon_sha256":"f00077217934f728a5486c9eca20a5ffe10fdc030e1204a2214c8a5e2e046526"},"schema_version":"1.0"},"canonical_sha256":"5b0c5779ca2fad8aee3b0157d893dc77b08a379ae7250a603cdb0b86445b85ec","source":{"kind":"arxiv","id":"1706.01383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01383","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01383v1","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01383","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"LMGFO6OKF6WY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LMGFO6OKF6WYV3R3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LMGFO6OK","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LMGFO6OKF6WYV3R3AFL5RE64O6","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-05T15:46:52Z","cross_cats_sorted":[],"title_canon_sha256":"31778f543ca5b2f46ab39e382f492cbb53516781d732e1dd21dfa7b4e5902ce8","abstract_canon_sha256":"f00077217934f728a5486c9eca20a5ffe10fdc030e1204a2214c8a5e2e046526"},"schema_version":"1.0"},"canonical_sha256":"5b0c5779ca2fad8aee3b0157d893dc77b08a379ae7250a603cdb0b86445b85ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:03.714654Z","signature_b64":"hvwyqZmtaZWU2drV5VhARkmxkOnzc0+mTmJP2xhTTPq83DgYgV39N/DH3JepBqaJRYz7ARRs0zQ74vs+c5N0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b0c5779ca2fad8aee3b0157d893dc77b08a379ae7250a603cdb0b86445b85ec","last_reissued_at":"2026-05-18T00:43:03.714149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:03.714149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01383","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:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXSTMJWcfywad0e6GUw0ZgmwPniw8n1Mwzzrrz4V3OrwZhM+av6cTlVhYztUcolY1pywshaOInrqAkT1vl0GCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:06:25.257220Z"},"content_sha256":"f431436dac2b56cd46c3482c0558a433509ce1544043f4f1ea3579086656a6ad","schema_version":"1.0","event_id":"sha256:f431436dac2b56cd46c3482c0558a433509ce1544043f4f1ea3579086656a6ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LMGFO6OKF6WYV3R3AFL5RE64O6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Stochastic Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Claire Vernade, Joon Kwon, Vianney Perchet","submitted_at":"2017-06-05T15:46:52Z","abstract_excerpt":"In the classical multi-armed bandit problem, d arms are available to the decision maker who pulls them sequentially in order to maximize his cumulative reward. Guarantees can be obtained on a relative quantity called regret, which scales linearly with d (or with sqrt(d) in the minimax sense). We here consider the sparse case of this classical problem in the sense that only a small number of arms, namely s < d, have a positive expected reward. We are able to leverage this additional assumption to provide an algorithm whose regret scales with s instead of d. Moreover, we prove that this algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01383","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:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MfwisyCVT8GG7cpU7JNayTjm7UDvs1GdHvDRrTJEZPY7Mj6sqZ9od1t+avHaWXyPcaEyUmDM4c6kQNh6IvxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:06:25.257693Z"},"content_sha256":"90ccc99ba2f409d3ccc91abeacc3d7bbf1cf7b085245edfcf01a8caed8e7a677","schema_version":"1.0","event_id":"sha256:90ccc99ba2f409d3ccc91abeacc3d7bbf1cf7b085245edfcf01a8caed8e7a677"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMGFO6OKF6WYV3R3AFL5RE64O6/bundle.json","state_url":"https://pith.science/pith/LMGFO6OKF6WYV3R3AFL5RE64O6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMGFO6OKF6WYV3R3AFL5RE64O6/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-26T02:06:25Z","links":{"resolver":"https://pith.science/pith/LMGFO6OKF6WYV3R3AFL5RE64O6","bundle":"https://pith.science/pith/LMGFO6OKF6WYV3R3AFL5RE64O6/bundle.json","state":"https://pith.science/pith/LMGFO6OKF6WYV3R3AFL5RE64O6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMGFO6OKF6WYV3R3AFL5RE64O6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LMGFO6OKF6WYV3R3AFL5RE64O6","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":"f00077217934f728a5486c9eca20a5ffe10fdc030e1204a2214c8a5e2e046526","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-05T15:46:52Z","title_canon_sha256":"31778f543ca5b2f46ab39e382f492cbb53516781d732e1dd21dfa7b4e5902ce8"},"schema_version":"1.0","source":{"id":"1706.01383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01383","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01383v1","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01383","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"LMGFO6OKF6WY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LMGFO6OKF6WYV3R3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LMGFO6OK","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:90ccc99ba2f409d3ccc91abeacc3d7bbf1cf7b085245edfcf01a8caed8e7a677","target":"graph","created_at":"2026-05-18T00:43:03Z","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 classical multi-armed bandit problem, d arms are available to the decision maker who pulls them sequentially in order to maximize his cumulative reward. Guarantees can be obtained on a relative quantity called regret, which scales linearly with d (or with sqrt(d) in the minimax sense). We here consider the sparse case of this classical problem in the sense that only a small number of arms, namely s < d, have a positive expected reward. We are able to leverage this additional assumption to provide an algorithm whose regret scales with s instead of d. Moreover, we prove that this algorith","authors_text":"Claire Vernade, Joon Kwon, Vianney Perchet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-05T15:46:52Z","title":"Sparse Stochastic Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01383","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:f431436dac2b56cd46c3482c0558a433509ce1544043f4f1ea3579086656a6ad","target":"record","created_at":"2026-05-18T00:43:03Z","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":"f00077217934f728a5486c9eca20a5ffe10fdc030e1204a2214c8a5e2e046526","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-05T15:46:52Z","title_canon_sha256":"31778f543ca5b2f46ab39e382f492cbb53516781d732e1dd21dfa7b4e5902ce8"},"schema_version":"1.0","source":{"id":"1706.01383","kind":"arxiv","version":1}},"canonical_sha256":"5b0c5779ca2fad8aee3b0157d893dc77b08a379ae7250a603cdb0b86445b85ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b0c5779ca2fad8aee3b0157d893dc77b08a379ae7250a603cdb0b86445b85ec","first_computed_at":"2026-05-18T00:43:03.714149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:03.714149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hvwyqZmtaZWU2drV5VhARkmxkOnzc0+mTmJP2xhTTPq83DgYgV39N/DH3JepBqaJRYz7ARRs0zQ74vs+c5N0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:03.714654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f431436dac2b56cd46c3482c0558a433509ce1544043f4f1ea3579086656a6ad","sha256:90ccc99ba2f409d3ccc91abeacc3d7bbf1cf7b085245edfcf01a8caed8e7a677"],"state_sha256":"8115e564d6c5962a397f461a6bb68c7a6a1c12293c59f85b7d9d41c3a62849df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QN9gSZ19HvhXvsq2AeePd/ceyvnQiuh6loinY9gSMJaiBzmewJnsymeLgTFcYD8r7RBQyfgTVA0QjvE3fZ/vAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:06:25.260628Z","bundle_sha256":"1bd523d36e53673dfcf048de0530c6488b74491827787074392689e8f69fa7c2"}}