{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MTYLL5YGHOHA5IYGE7CAFVGZWO","short_pith_number":"pith:MTYLL5YG","canonical_record":{"source":{"id":"1702.07539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-24T11:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"49511d19b799564cb6b87279e8a432226b0352652cca75053372434077f0ef26","abstract_canon_sha256":"052e41fa45e9995657fd5034f4e8594df1f37ebe11d3d47828b68f118b8c9779"},"schema_version":"1.0"},"canonical_sha256":"64f0b5f7063b8e0ea30627c402d4d9b3879ee781b2fb93b89ee3f4d8f7b44946","source":{"kind":"arxiv","id":"1702.07539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07539","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07539v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07539","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"MTYLL5YGHOHA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MTYLL5YGHOHA5IYG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MTYLL5YG","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MTYLL5YGHOHA5IYGE7CAFVGZWO","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-24T11:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"49511d19b799564cb6b87279e8a432226b0352652cca75053372434077f0ef26","abstract_canon_sha256":"052e41fa45e9995657fd5034f4e8594df1f37ebe11d3d47828b68f118b8c9779"},"schema_version":"1.0"},"canonical_sha256":"64f0b5f7063b8e0ea30627c402d4d9b3879ee781b2fb93b89ee3f4d8f7b44946","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.979328Z","signature_b64":"b1z0ieXD1/abRgGNnbFHREIDU8tymhApBFLAjtWWf+Ft49XhHhkbriAb9nm6yf7+iiHulFp2Zo6567zOY4EeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64f0b5f7063b8e0ea30627c402d4d9b3879ee781b2fb93b89ee3f4d8f7b44946","last_reissued_at":"2026-05-18T00:50:02.978380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.978380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07539","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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGp05dwUkOZWNtHraI6q+cXk6ekobhissZnGSiQDYlCOtXKLJih+ZJZINRdhy4opVVaxfkYBIg96YErgUnzWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:01:29.499282Z"},"content_sha256":"cde2d9bab406a8beb114489f9320cd8986eae8d97845a90d29bc46379a9a8dab","schema_version":"1.0","event_id":"sha256:cde2d9bab406a8beb114489f9320cd8986eae8d97845a90d29bc46379a9a8dab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MTYLL5YGHOHA5IYGE7CAFVGZWO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Bounds for Bandit Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alon Cohen, Tamir Hazan, Tomer Koren","submitted_at":"2017-02-24T11:17:33Z","abstract_excerpt":"We revisit the study of optimal regret rates in bandit combinatorial optimization---a fundamental framework for sequential decision making under uncertainty that abstracts numerous combinatorial prediction problems. We prove that the attainable regret in this setting grows as $\\widetilde{\\Theta}(k^{3/2}\\sqrt{dT})$ where $d$ is the dimension of the problem and $k$ is a bound over the maximal instantaneous loss, disproving a conjecture of Audibert, Bubeck, and Lugosi (2013) who argued that the optimal rate should be of the form $\\widetilde{\\Theta}(k\\sqrt{dT})$. Our bounds apply to several import"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07539","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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWnET9TYS7LsLZb+ehM9QcgD/lm/x8OeSqQHiYNH8VNocyoIXtkJBKUvIxXTeENgeWY94NGUtPMtdaoErWTNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:01:29.499820Z"},"content_sha256":"a6caf06ec01d45c3621760a657dfee4458ba1fa0f095bc490dab27d84f464cb5","schema_version":"1.0","event_id":"sha256:a6caf06ec01d45c3621760a657dfee4458ba1fa0f095bc490dab27d84f464cb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/bundle.json","state_url":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/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-07T12:01:29Z","links":{"resolver":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO","bundle":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/bundle.json","state":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MTYLL5YGHOHA5IYGE7CAFVGZWO","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":"052e41fa45e9995657fd5034f4e8594df1f37ebe11d3d47828b68f118b8c9779","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-24T11:17:33Z","title_canon_sha256":"49511d19b799564cb6b87279e8a432226b0352652cca75053372434077f0ef26"},"schema_version":"1.0","source":{"id":"1702.07539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07539","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07539v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07539","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"MTYLL5YGHOHA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MTYLL5YGHOHA5IYG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MTYLL5YG","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:a6caf06ec01d45c3621760a657dfee4458ba1fa0f095bc490dab27d84f464cb5","target":"graph","created_at":"2026-05-18T00:50:02Z","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 revisit the study of optimal regret rates in bandit combinatorial optimization---a fundamental framework for sequential decision making under uncertainty that abstracts numerous combinatorial prediction problems. We prove that the attainable regret in this setting grows as $\\widetilde{\\Theta}(k^{3/2}\\sqrt{dT})$ where $d$ is the dimension of the problem and $k$ is a bound over the maximal instantaneous loss, disproving a conjecture of Audibert, Bubeck, and Lugosi (2013) who argued that the optimal rate should be of the form $\\widetilde{\\Theta}(k\\sqrt{dT})$. Our bounds apply to several import","authors_text":"Alon Cohen, Tamir Hazan, Tomer Koren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-24T11:17:33Z","title":"Tight Bounds for Bandit Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07539","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:cde2d9bab406a8beb114489f9320cd8986eae8d97845a90d29bc46379a9a8dab","target":"record","created_at":"2026-05-18T00:50:02Z","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":"052e41fa45e9995657fd5034f4e8594df1f37ebe11d3d47828b68f118b8c9779","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-24T11:17:33Z","title_canon_sha256":"49511d19b799564cb6b87279e8a432226b0352652cca75053372434077f0ef26"},"schema_version":"1.0","source":{"id":"1702.07539","kind":"arxiv","version":1}},"canonical_sha256":"64f0b5f7063b8e0ea30627c402d4d9b3879ee781b2fb93b89ee3f4d8f7b44946","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64f0b5f7063b8e0ea30627c402d4d9b3879ee781b2fb93b89ee3f4d8f7b44946","first_computed_at":"2026-05-18T00:50:02.978380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.978380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b1z0ieXD1/abRgGNnbFHREIDU8tymhApBFLAjtWWf+Ft49XhHhkbriAb9nm6yf7+iiHulFp2Zo6567zOY4EeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.979328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cde2d9bab406a8beb114489f9320cd8986eae8d97845a90d29bc46379a9a8dab","sha256:a6caf06ec01d45c3621760a657dfee4458ba1fa0f095bc490dab27d84f464cb5"],"state_sha256":"698d0f36883ab78667ef59806e0d63f7317e0d08116b2a6bfe1d2c3e90c11081"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5tMkuZSgReIEmN/FjYlgT/ZfTaN1zycdv05L75nUlIgqYt0oeQUhIyzldUb3rBebM0Ly9zQkhAA/y9WBD6TxCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:01:29.502701Z","bundle_sha256":"0f50482f061f40ac828106388a265896bb3341f092dba782dd739bd307fd4da0"}}