{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HQ3GRIQUJTJGO6EX7QJOIJZEZF","short_pith_number":"pith:HQ3GRIQU","canonical_record":{"source":{"id":"1502.03475","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-11T22:35:50Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"60931c6dcff174dc93e27f2fa01628023aabd537464afc3291b74876daadc782","abstract_canon_sha256":"295d7d27eeea929b745c60a0969195aab4885888e37b88f63b98ac548fe9139b"},"schema_version":"1.0"},"canonical_sha256":"3c3668a2144cd2677897fc12e42724c972ee2350425e8d88101de02a50f5bbd4","source":{"kind":"arxiv","id":"1502.03475","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03475","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03475v3","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03475","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"HQ3GRIQUJTJG","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HQ3GRIQUJTJGO6EX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HQ3GRIQU","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HQ3GRIQUJTJGO6EX7QJOIJZEZF","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03475","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-11T22:35:50Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"60931c6dcff174dc93e27f2fa01628023aabd537464afc3291b74876daadc782","abstract_canon_sha256":"295d7d27eeea929b745c60a0969195aab4885888e37b88f63b98ac548fe9139b"},"schema_version":"1.0"},"canonical_sha256":"3c3668a2144cd2677897fc12e42724c972ee2350425e8d88101de02a50f5bbd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:39.398214Z","signature_b64":"KZlVzoZnAxW5t384zlZMQ1+XLgNhy9ahVslKI3kwQnHBrcWpm5PjaxSBurG0HsqyA4lKHj6sAumvlHrsr/naDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3668a2144cd2677897fc12e42724c972ee2350425e8d88101de02a50f5bbd4","last_reissued_at":"2026-05-18T01:27:39.397678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:39.397678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03475","source_version":3,"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-18T01:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSQBOcjh707vd3pAukDGTDb0QfTX9S0FWCb3/NBROt8NF89fb7UuoUSl/xCEeBbYiG0IAF7NaONAr/72BHUdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:29:34.107745Z"},"content_sha256":"105a328ecd3506ff4781cc7f9ba2bdf32323c7f3581fc3129ef73c99c39d5172","schema_version":"1.0","event_id":"sha256:105a328ecd3506ff4781cc7f9ba2bdf32323c7f3581fc3129ef73c99c39d5172"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HQ3GRIQUJTJGO6EX7QJOIJZEZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Bandits Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre Proutiere, Marc Lelarge, M. Sadegh Talebi, Richard Combes","submitted_at":"2015-02-11T22:35:50Z","abstract_excerpt":"This paper investigates stochastic and adversarial combinatorial multi-armed bandit problems. In the stochastic setting under semi-bandit feedback, we derive a problem-specific regret lower bound, and discuss its scaling with the dimension of the decision space. We propose ESCB, an algorithm that efficiently exploits the structure of the problem and provide a finite-time analysis of its regret. ESCB has better performance guarantees than existing algorithms, and significantly outperforms these algorithms in practice. In the adversarial setting under bandit feedback, we propose \\textsc{CombEXP}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03475","kind":"arxiv","version":3},"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-18T01:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYZbM0pFzQCZaIhbvtKt3/IntkaBugvkyrVttNzgecB1k4bd8t10RF6GQjIwo/PNpiLQ1iV6OeorbV9y83XFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:29:34.108403Z"},"content_sha256":"2f5a33d1d49a64b129bc2c98722576d00d206fa6cd62f3a3e4c136243bdbbac6","schema_version":"1.0","event_id":"sha256:2f5a33d1d49a64b129bc2c98722576d00d206fa6cd62f3a3e4c136243bdbbac6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/bundle.json","state_url":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/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-26T15:29:34Z","links":{"resolver":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF","bundle":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/bundle.json","state":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HQ3GRIQUJTJGO6EX7QJOIJZEZF","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":"295d7d27eeea929b745c60a0969195aab4885888e37b88f63b98ac548fe9139b","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-11T22:35:50Z","title_canon_sha256":"60931c6dcff174dc93e27f2fa01628023aabd537464afc3291b74876daadc782"},"schema_version":"1.0","source":{"id":"1502.03475","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03475","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03475v3","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03475","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"HQ3GRIQUJTJG","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HQ3GRIQUJTJGO6EX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HQ3GRIQU","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:2f5a33d1d49a64b129bc2c98722576d00d206fa6cd62f3a3e4c136243bdbbac6","target":"graph","created_at":"2026-05-18T01:27:39Z","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":"This paper investigates stochastic and adversarial combinatorial multi-armed bandit problems. In the stochastic setting under semi-bandit feedback, we derive a problem-specific regret lower bound, and discuss its scaling with the dimension of the decision space. We propose ESCB, an algorithm that efficiently exploits the structure of the problem and provide a finite-time analysis of its regret. ESCB has better performance guarantees than existing algorithms, and significantly outperforms these algorithms in practice. In the adversarial setting under bandit feedback, we propose \\textsc{CombEXP}","authors_text":"Alexandre Proutiere, Marc Lelarge, M. Sadegh Talebi, Richard Combes","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-11T22:35:50Z","title":"Combinatorial Bandits Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03475","kind":"arxiv","version":3},"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:105a328ecd3506ff4781cc7f9ba2bdf32323c7f3581fc3129ef73c99c39d5172","target":"record","created_at":"2026-05-18T01:27:39Z","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":"295d7d27eeea929b745c60a0969195aab4885888e37b88f63b98ac548fe9139b","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-11T22:35:50Z","title_canon_sha256":"60931c6dcff174dc93e27f2fa01628023aabd537464afc3291b74876daadc782"},"schema_version":"1.0","source":{"id":"1502.03475","kind":"arxiv","version":3}},"canonical_sha256":"3c3668a2144cd2677897fc12e42724c972ee2350425e8d88101de02a50f5bbd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c3668a2144cd2677897fc12e42724c972ee2350425e8d88101de02a50f5bbd4","first_computed_at":"2026-05-18T01:27:39.397678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:39.397678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KZlVzoZnAxW5t384zlZMQ1+XLgNhy9ahVslKI3kwQnHBrcWpm5PjaxSBurG0HsqyA4lKHj6sAumvlHrsr/naDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:39.398214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03475","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:105a328ecd3506ff4781cc7f9ba2bdf32323c7f3581fc3129ef73c99c39d5172","sha256:2f5a33d1d49a64b129bc2c98722576d00d206fa6cd62f3a3e4c136243bdbbac6"],"state_sha256":"444d2235933a07809a54e487c15d50d1d736e2bfd9359ca832c10f951b901dfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"taQOreKAaHxj+UYyy8tsKg1SvIksFKaANFkT9LVApOA5r4uQfyI0XqPvH5AaOkyetXRmuGxsgEIUfXeFWh+mBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:29:34.111697Z","bundle_sha256":"54b8a87fb956524de9bce8da1d20039e77f3bb63610cfe6c973781a00c8ec03e"}}