{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2CFYIU6TMVEUBGLICS4EUJMUSW","short_pith_number":"pith:2CFYIU6T","canonical_record":{"source":{"id":"1507.08752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-31T04:48:58Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"6748686a7c1cfea1eee23bbe9e1068ac8799b1e40bdbdee4cafc8a976711a9f3","abstract_canon_sha256":"37a07f04dd0a12d2c060176476d4e3986abfe2b844a08a6ac686ebbd9d1bd5ca"},"schema_version":"1.0"},"canonical_sha256":"d08b8453d3654940996814b84a25949581e3b9d54e82dde021b487562479781e","source":{"kind":"arxiv","id":"1507.08752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08752","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08752v1","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08752","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"pith_short_12","alias_value":"2CFYIU6TMVEU","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2CFYIU6TMVEUBGLI","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2CFYIU6T","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2CFYIU6TMVEUBGLICS4EUJMUSW","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-31T04:48:58Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"6748686a7c1cfea1eee23bbe9e1068ac8799b1e40bdbdee4cafc8a976711a9f3","abstract_canon_sha256":"37a07f04dd0a12d2c060176476d4e3986abfe2b844a08a6ac686ebbd9d1bd5ca"},"schema_version":"1.0"},"canonical_sha256":"d08b8453d3654940996814b84a25949581e3b9d54e82dde021b487562479781e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:02.951513Z","signature_b64":"SmHQvld6OGVU4qWDiVTdgaeK+0hHGpSQUVbhPWsix0ha3wUVOudlHEqU69nEg/h7V7ijwWs5b/bp7h5Sm7q1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d08b8453d3654940996814b84a25949581e3b9d54e82dde021b487562479781e","last_reissued_at":"2026-05-18T01:36:02.950817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:02.950817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08752","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-18T01:36:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHrgNgVHTiWiDL4YF6V+swniRHpxCQ0iHGY+LuEXnTLCuZtLQlkR6AMiCZgl/rfaSUV7cE3iotV6D6XbxZwGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T08:10:07.074398Z"},"content_sha256":"49d96f6be03f32e0601dcec4a0c8e9b8fba5bc895b63d4d94a6a488e05b46ac9","schema_version":"1.0","event_id":"sha256:49d96f6be03f32e0601dcec4a0c8e9b8fba5bc895b63d4d94a6a488e05b46ac9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2CFYIU6TMVEUBGLICS4EUJMUSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ohad Shamir","submitted_at":"2015-07-31T04:48:58Z","abstract_excerpt":"We consider the closely related problems of bandit convex optimization with two-point feedback, and zero-order stochastic convex optimization with two function evaluations per round. We provide a simple algorithm and analysis which is optimal for convex Lipschitz functions. This improves on \\cite{dujww13}, which only provides an optimal result for smooth functions; Moreover, the algorithm and analysis are simpler, and readily extend to non-Euclidean problems. The algorithm is based on a small but surprisingly powerful modification of the gradient estimator."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08752","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-18T01:36:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UtjgDOe3kj6zIetlOvjgQV2NXQxo7imEqE81ZyOjqtR9BivqmN/OZ/mixfUlyyN36R/28oW050sLQApxrvB7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T08:10:07.074743Z"},"content_sha256":"47d03dbccf6d4a2f06a176aa0d53afac7dc39e077dbeaf5acdc64ed33b06655b","schema_version":"1.0","event_id":"sha256:47d03dbccf6d4a2f06a176aa0d53afac7dc39e077dbeaf5acdc64ed33b06655b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CFYIU6TMVEUBGLICS4EUJMUSW/bundle.json","state_url":"https://pith.science/pith/2CFYIU6TMVEUBGLICS4EUJMUSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CFYIU6TMVEUBGLICS4EUJMUSW/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-08-21T08:10:07Z","links":{"resolver":"https://pith.science/pith/2CFYIU6TMVEUBGLICS4EUJMUSW","bundle":"https://pith.science/pith/2CFYIU6TMVEUBGLICS4EUJMUSW/bundle.json","state":"https://pith.science/pith/2CFYIU6TMVEUBGLICS4EUJMUSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CFYIU6TMVEUBGLICS4EUJMUSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2CFYIU6TMVEUBGLICS4EUJMUSW","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":"37a07f04dd0a12d2c060176476d4e3986abfe2b844a08a6ac686ebbd9d1bd5ca","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-31T04:48:58Z","title_canon_sha256":"6748686a7c1cfea1eee23bbe9e1068ac8799b1e40bdbdee4cafc8a976711a9f3"},"schema_version":"1.0","source":{"id":"1507.08752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08752","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08752v1","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08752","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"pith_short_12","alias_value":"2CFYIU6TMVEU","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2CFYIU6TMVEUBGLI","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2CFYIU6T","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:47d03dbccf6d4a2f06a176aa0d53afac7dc39e077dbeaf5acdc64ed33b06655b","target":"graph","created_at":"2026-05-18T01:36: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 consider the closely related problems of bandit convex optimization with two-point feedback, and zero-order stochastic convex optimization with two function evaluations per round. We provide a simple algorithm and analysis which is optimal for convex Lipschitz functions. This improves on \\cite{dujww13}, which only provides an optimal result for smooth functions; Moreover, the algorithm and analysis are simpler, and readily extend to non-Euclidean problems. The algorithm is based on a small but surprisingly powerful modification of the gradient estimator.","authors_text":"Ohad Shamir","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-31T04:48:58Z","title":"An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08752","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:49d96f6be03f32e0601dcec4a0c8e9b8fba5bc895b63d4d94a6a488e05b46ac9","target":"record","created_at":"2026-05-18T01:36: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":"37a07f04dd0a12d2c060176476d4e3986abfe2b844a08a6ac686ebbd9d1bd5ca","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-31T04:48:58Z","title_canon_sha256":"6748686a7c1cfea1eee23bbe9e1068ac8799b1e40bdbdee4cafc8a976711a9f3"},"schema_version":"1.0","source":{"id":"1507.08752","kind":"arxiv","version":1}},"canonical_sha256":"d08b8453d3654940996814b84a25949581e3b9d54e82dde021b487562479781e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d08b8453d3654940996814b84a25949581e3b9d54e82dde021b487562479781e","first_computed_at":"2026-05-18T01:36:02.950817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:02.950817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SmHQvld6OGVU4qWDiVTdgaeK+0hHGpSQUVbhPWsix0ha3wUVOudlHEqU69nEg/h7V7ijwWs5b/bp7h5Sm7q1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:02.951513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49d96f6be03f32e0601dcec4a0c8e9b8fba5bc895b63d4d94a6a488e05b46ac9","sha256:47d03dbccf6d4a2f06a176aa0d53afac7dc39e077dbeaf5acdc64ed33b06655b"],"state_sha256":"222b42411a5c7f639ef5c9b1695f94e8c6a6cf1fa94a9508abd18becb9b41a9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxFXN79J3bLlB5qDCVYB7STRjoUEqBWcJeTZn0JKjzCh/4xlfTATRJNZ6BSt8/WIRIwOg5UflHn/jo3D7ygQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T08:10:07.076988Z","bundle_sha256":"550c0e3129b9e642d044c8683db505251dad5e9ab08644dffc93599977175fa7"}}