{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IS3PG7KJXHM5FE56CD24WKI6DC","short_pith_number":"pith:IS3PG7KJ","canonical_record":{"source":{"id":"1805.07474","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-18T23:29:24Z","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"title_canon_sha256":"ad1df169fc1688ad236502e3816b29cb10e18993c50a5a9f07b990e55e362aa2","abstract_canon_sha256":"338b5167d0de56aaaf392a8e33aea346989accf427fec2da0605ba93bae1e898"},"schema_version":"1.0"},"canonical_sha256":"44b6f37d49b9d9d293be10f5cb291e18a987b66cb5d886aa4d228c0b91853dab","source":{"kind":"arxiv","id":"1805.07474","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07474","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07474v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07474","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"IS3PG7KJXHM5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IS3PG7KJXHM5FE56","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IS3PG7KJ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IS3PG7KJXHM5FE56CD24WKI6DC","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07474","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-18T23:29:24Z","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"title_canon_sha256":"ad1df169fc1688ad236502e3816b29cb10e18993c50a5a9f07b990e55e362aa2","abstract_canon_sha256":"338b5167d0de56aaaf392a8e33aea346989accf427fec2da0605ba93bae1e898"},"schema_version":"1.0"},"canonical_sha256":"44b6f37d49b9d9d293be10f5cb291e18a987b66cb5d886aa4d228c0b91853dab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:20.247419Z","signature_b64":"Hw2Yy44Td4i539zXHhk+N+KFwvJmB3EDXWH2I843BFurQN7vVNpqsgWphDKO/iEU4A+c88IyleKhJoVT5MCbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b6f37d49b9d9d293be10f5cb291e18a987b66cb5d886aa4d228c0b91853dab","last_reissued_at":"2026-05-18T00:06:20.246693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:20.246693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07474","source_version":2,"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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/SbKdfBarVTwv025sw+kvekE9svG0QoBOJLqFsRxslIHHDMjdzi4hgq5pPVKu0B3YobdsPIUIXgXmX7x8niDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:43:26.640418Z"},"content_sha256":"e8fb4e4ba743410e5a87ef34788b2eca42315c1e868690d2f962080f4f3b801b","schema_version":"1.0","event_id":"sha256:e8fb4e4ba743410e5a87ef34788b2eca42315c1e868690d2f962080f4f3b801b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IS3PG7KJXHM5FE56CD24WKI6DC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Projection-Free Bandit Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Amin Karbasi, Lin Chen, Mingrui Zhang","submitted_at":"2018-05-18T23:29:24Z","abstract_excerpt":"In this paper, we propose the first computationally efficient projection-free algorithm for bandit convex optimization (BCO). We show that our algorithm achieves a sublinear regret of $O(nT^{4/5})$ (where $T$ is the horizon and $n$ is the dimension) for any bounded convex functions with uniformly bounded gradients. We also evaluate the performance of our algorithm against baselines on both synthetic and real data sets for quadratic programming, portfolio selection and matrix completion problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07474","kind":"arxiv","version":2},"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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2aH1ifONyHH5IHMvnLTMuTVKnUphl0ijB/wDUSKKdauZ7y/DQYdTxBqr94erBd5akc/KyRJPcOJ7118/gnRUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:43:26.640770Z"},"content_sha256":"72a861947951ed5443e73ff3a424a61bfae66738bbd306aa3e2b9460340d6613","schema_version":"1.0","event_id":"sha256:72a861947951ed5443e73ff3a424a61bfae66738bbd306aa3e2b9460340d6613"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IS3PG7KJXHM5FE56CD24WKI6DC/bundle.json","state_url":"https://pith.science/pith/IS3PG7KJXHM5FE56CD24WKI6DC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IS3PG7KJXHM5FE56CD24WKI6DC/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-01T13:43:26Z","links":{"resolver":"https://pith.science/pith/IS3PG7KJXHM5FE56CD24WKI6DC","bundle":"https://pith.science/pith/IS3PG7KJXHM5FE56CD24WKI6DC/bundle.json","state":"https://pith.science/pith/IS3PG7KJXHM5FE56CD24WKI6DC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IS3PG7KJXHM5FE56CD24WKI6DC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IS3PG7KJXHM5FE56CD24WKI6DC","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":"338b5167d0de56aaaf392a8e33aea346989accf427fec2da0605ba93bae1e898","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-18T23:29:24Z","title_canon_sha256":"ad1df169fc1688ad236502e3816b29cb10e18993c50a5a9f07b990e55e362aa2"},"schema_version":"1.0","source":{"id":"1805.07474","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07474","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07474v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07474","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"IS3PG7KJXHM5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IS3PG7KJXHM5FE56","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IS3PG7KJ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:72a861947951ed5443e73ff3a424a61bfae66738bbd306aa3e2b9460340d6613","target":"graph","created_at":"2026-05-18T00:06:20Z","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 this paper, we propose the first computationally efficient projection-free algorithm for bandit convex optimization (BCO). We show that our algorithm achieves a sublinear regret of $O(nT^{4/5})$ (where $T$ is the horizon and $n$ is the dimension) for any bounded convex functions with uniformly bounded gradients. We also evaluate the performance of our algorithm against baselines on both synthetic and real data sets for quadratic programming, portfolio selection and matrix completion problems.","authors_text":"Amin Karbasi, Lin Chen, Mingrui Zhang","cross_cats":["cs.DS","cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-18T23:29:24Z","title":"Projection-Free Bandit Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07474","kind":"arxiv","version":2},"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:e8fb4e4ba743410e5a87ef34788b2eca42315c1e868690d2f962080f4f3b801b","target":"record","created_at":"2026-05-18T00:06:20Z","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":"338b5167d0de56aaaf392a8e33aea346989accf427fec2da0605ba93bae1e898","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-18T23:29:24Z","title_canon_sha256":"ad1df169fc1688ad236502e3816b29cb10e18993c50a5a9f07b990e55e362aa2"},"schema_version":"1.0","source":{"id":"1805.07474","kind":"arxiv","version":2}},"canonical_sha256":"44b6f37d49b9d9d293be10f5cb291e18a987b66cb5d886aa4d228c0b91853dab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44b6f37d49b9d9d293be10f5cb291e18a987b66cb5d886aa4d228c0b91853dab","first_computed_at":"2026-05-18T00:06:20.246693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:20.246693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hw2Yy44Td4i539zXHhk+N+KFwvJmB3EDXWH2I843BFurQN7vVNpqsgWphDKO/iEU4A+c88IyleKhJoVT5MCbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:20.247419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07474","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8fb4e4ba743410e5a87ef34788b2eca42315c1e868690d2f962080f4f3b801b","sha256:72a861947951ed5443e73ff3a424a61bfae66738bbd306aa3e2b9460340d6613"],"state_sha256":"6c365836062cb60e8a0041dcb197c2225ad31e0629107f231a5a06a9fdea951b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nX6x/S4StcO5wPuDydynTY+Da9gSzxdz0OMa6MPqWIYp/X0F6xz2KTd8P4FkLPhD2EK/CfAR7leNO8XCw2YmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:43:26.642841Z","bundle_sha256":"ad42efaca0d72f0d0de9b12d5536d88a6fec85f15461b2b095c36c7df6cf460f"}}