{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:P3CDKY6HFRHUDCPOZ46YYPVQDJ","short_pith_number":"pith:P3CDKY6H","canonical_record":{"source":{"id":"1502.06398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-23T11:54:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d327e519121ec6e0eb4490d55ad8c63e438c8d3aa8e0d6c306d100e226c942a0","abstract_canon_sha256":"ea4e2f7f4908cab0b6cd46d11f7c3b0495a84a3269a6c0668df81dc2502ab491"},"schema_version":"1.0"},"canonical_sha256":"7ec43563c72c4f4189eecf3d8c3eb01a5bf1313ad88017b295e3903e093e49c6","source":{"kind":"arxiv","id":"1502.06398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06398","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06398v1","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06398","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"P3CDKY6HFRHU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P3CDKY6HFRHUDCPO","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P3CDKY6H","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:P3CDKY6HFRHUDCPOZ46YYPVQDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-23T11:54:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d327e519121ec6e0eb4490d55ad8c63e438c8d3aa8e0d6c306d100e226c942a0","abstract_canon_sha256":"ea4e2f7f4908cab0b6cd46d11f7c3b0495a84a3269a6c0668df81dc2502ab491"},"schema_version":"1.0"},"canonical_sha256":"7ec43563c72c4f4189eecf3d8c3eb01a5bf1313ad88017b295e3903e093e49c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:37.374769Z","signature_b64":"WjlnvvgO57p9tUpZFBVaDZz4BFjWJFhlzlxaU2owtwB7f7Y1vqaBP38iVf6ljQnfYb/qQ/arAVsayY/MC6sECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ec43563c72c4f4189eecf3d8c3eb01a5bf1313ad88017b295e3903e093e49c6","last_reissued_at":"2026-05-18T02:26:37.374178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:37.374178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06398","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-18T02:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZRH2DK1uhY84AkBNkLkwT1w+leqXLpuCkkEOB0F5uuUIIuPV2KI7IsM4vFlJseZMgKKQzIlxVCROaC3A9xLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:17:23.474587Z"},"content_sha256":"2d814d01d21dd981acd18326fcb15b8dec1bc0494598ab0730c653697c04ff0a","schema_version":"1.0","event_id":"sha256:2d814d01d21dd981acd18326fcb15b8dec1bc0494598ab0730c653697c04ff0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:P3CDKY6HFRHUDCPOZ46YYPVQDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bandit Convex Optimization: sqrt{T} Regret in One Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Ofer Dekel, S\\'ebastien Bubeck, Tomer Koren, Yuval Peres","submitted_at":"2015-02-23T11:54:30Z","abstract_excerpt":"We analyze the minimax regret of the adversarial bandit convex optimization problem. Focusing on the one-dimensional case, we prove that the minimax regret is $\\widetilde\\Theta(\\sqrt{T})$ and partially resolve a decade-old open problem. Our analysis is non-constructive, as we do not present a concrete algorithm that attains this regret rate. Instead, we use minimax duality to reduce the problem to a Bayesian setting, where the convex loss functions are drawn from a worst-case distribution, and then we solve the Bayesian version of the problem with a variant of Thompson Sampling. Our analysis f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06398","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-18T02:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WD6j4lyiXrMuUIHPGlF6q0b3lQUmDoHfFrpaPwAQL51NSx/1TktpLJ6HAnz2VH8jglFGAE+3YAnrHxrOeqPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:17:23.475343Z"},"content_sha256":"16f99907e32687c3492ffbf389eee61d93dddb288dff85d46976c03f23a2dfb5","schema_version":"1.0","event_id":"sha256:16f99907e32687c3492ffbf389eee61d93dddb288dff85d46976c03f23a2dfb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3CDKY6HFRHUDCPOZ46YYPVQDJ/bundle.json","state_url":"https://pith.science/pith/P3CDKY6HFRHUDCPOZ46YYPVQDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3CDKY6HFRHUDCPOZ46YYPVQDJ/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-07T16:17:23Z","links":{"resolver":"https://pith.science/pith/P3CDKY6HFRHUDCPOZ46YYPVQDJ","bundle":"https://pith.science/pith/P3CDKY6HFRHUDCPOZ46YYPVQDJ/bundle.json","state":"https://pith.science/pith/P3CDKY6HFRHUDCPOZ46YYPVQDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3CDKY6HFRHUDCPOZ46YYPVQDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:P3CDKY6HFRHUDCPOZ46YYPVQDJ","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":"ea4e2f7f4908cab0b6cd46d11f7c3b0495a84a3269a6c0668df81dc2502ab491","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-23T11:54:30Z","title_canon_sha256":"d327e519121ec6e0eb4490d55ad8c63e438c8d3aa8e0d6c306d100e226c942a0"},"schema_version":"1.0","source":{"id":"1502.06398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06398","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06398v1","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06398","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"P3CDKY6HFRHU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P3CDKY6HFRHUDCPO","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P3CDKY6H","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:16f99907e32687c3492ffbf389eee61d93dddb288dff85d46976c03f23a2dfb5","target":"graph","created_at":"2026-05-18T02:26:37Z","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 analyze the minimax regret of the adversarial bandit convex optimization problem. Focusing on the one-dimensional case, we prove that the minimax regret is $\\widetilde\\Theta(\\sqrt{T})$ and partially resolve a decade-old open problem. Our analysis is non-constructive, as we do not present a concrete algorithm that attains this regret rate. Instead, we use minimax duality to reduce the problem to a Bayesian setting, where the convex loss functions are drawn from a worst-case distribution, and then we solve the Bayesian version of the problem with a variant of Thompson Sampling. Our analysis f","authors_text":"Ofer Dekel, S\\'ebastien Bubeck, Tomer Koren, Yuval Peres","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-23T11:54:30Z","title":"Bandit Convex Optimization: sqrt{T} Regret in One Dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06398","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:2d814d01d21dd981acd18326fcb15b8dec1bc0494598ab0730c653697c04ff0a","target":"record","created_at":"2026-05-18T02:26:37Z","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":"ea4e2f7f4908cab0b6cd46d11f7c3b0495a84a3269a6c0668df81dc2502ab491","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-23T11:54:30Z","title_canon_sha256":"d327e519121ec6e0eb4490d55ad8c63e438c8d3aa8e0d6c306d100e226c942a0"},"schema_version":"1.0","source":{"id":"1502.06398","kind":"arxiv","version":1}},"canonical_sha256":"7ec43563c72c4f4189eecf3d8c3eb01a5bf1313ad88017b295e3903e093e49c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ec43563c72c4f4189eecf3d8c3eb01a5bf1313ad88017b295e3903e093e49c6","first_computed_at":"2026-05-18T02:26:37.374178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:37.374178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WjlnvvgO57p9tUpZFBVaDZz4BFjWJFhlzlxaU2owtwB7f7Y1vqaBP38iVf6ljQnfYb/qQ/arAVsayY/MC6sECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:37.374769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d814d01d21dd981acd18326fcb15b8dec1bc0494598ab0730c653697c04ff0a","sha256:16f99907e32687c3492ffbf389eee61d93dddb288dff85d46976c03f23a2dfb5"],"state_sha256":"d45acbf92a90959c674e2aa2d485475cd1d52106aa015bb2c55c244717a9595d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UmY3DTcAcxU2bIgaaeUorX+AROzJB68rLmxc8eXja/svixuq9uENssdPJtobkeVr+NEQes0J7yojXdU5pqqzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:17:23.479072Z","bundle_sha256":"a8eccad88d2684472044efa3d86bb139bba3ab3c73812723030ec8a99ce337bc"}}