{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GROEIPBL3DNS2RAZIHKKN3SMHG","short_pith_number":"pith:GROEIPBL","canonical_record":{"source":{"id":"2205.11470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-23T17:13:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8eff871ac05cac292cd034e99588745871fe800a7d52f88bd90e2abcde0a6d26","abstract_canon_sha256":"189738e8211e202675860ef0093b4090e7bb2917dacde040dc96c1d762b6cea6"},"schema_version":"1.0"},"canonical_sha256":"345c443c2bd8db2d441941d4a6ee4c39b649fec2733a1e1640d50bbec7323076","source":{"kind":"arxiv","id":"2205.11470","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.11470","created_at":"2026-07-05T04:25:37Z"},{"alias_kind":"arxiv_version","alias_value":"2205.11470v1","created_at":"2026-07-05T04:25:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11470","created_at":"2026-07-05T04:25:37Z"},{"alias_kind":"pith_short_12","alias_value":"GROEIPBL3DNS","created_at":"2026-07-05T04:25:37Z"},{"alias_kind":"pith_short_16","alias_value":"GROEIPBL3DNS2RAZ","created_at":"2026-07-05T04:25:37Z"},{"alias_kind":"pith_short_8","alias_value":"GROEIPBL","created_at":"2026-07-05T04:25:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GROEIPBL3DNS2RAZIHKKN3SMHG","target":"record","payload":{"canonical_record":{"source":{"id":"2205.11470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-23T17:13:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8eff871ac05cac292cd034e99588745871fe800a7d52f88bd90e2abcde0a6d26","abstract_canon_sha256":"189738e8211e202675860ef0093b4090e7bb2917dacde040dc96c1d762b6cea6"},"schema_version":"1.0"},"canonical_sha256":"345c443c2bd8db2d441941d4a6ee4c39b649fec2733a1e1640d50bbec7323076","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:37.599819Z","signature_b64":"KW/yJtF+r1TBtd0cTVAuijsycyE5iEdntT96PCyN7DFCUWcbmOkZwL89U04GqIhwWGUvLZwRvPU5do/A5PFtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"345c443c2bd8db2d441941d4a6ee4c39b649fec2733a1e1640d50bbec7323076","last_reissued_at":"2026-07-05T04:25:37.599404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:37.599404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.11470","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-07-05T04:25:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74sUXEAux+N0s6Wul+jvH2Ua5iljdu1eA3zNLDmcYgvcYmZNbYqXTXBSQ52IyKazFbbB+FP2NS5NgVDxzAwsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:16:19.108103Z"},"content_sha256":"41554a15197a2b7628582948d68300cd41e89d6b5acc50aa5a53d2f22749f103","schema_version":"1.0","event_id":"sha256:41554a15197a2b7628582948d68300cd41e89d6b5acc50aa5a53d2f22749f103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GROEIPBL3DNS2RAZIHKKN3SMHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Zakaria Mhammedi","submitted_at":"2022-05-23T17:13:46Z","abstract_excerpt":"In this paper, we develop new efficient projection-free algorithms for Online Convex Optimization (OCO). Online Gradient Descent (OGD) is an example of a classical OCO algorithm that guarantees the optimal $O(\\sqrt{T})$ regret bound. However, OGD and other projection-based OCO algorithms need to perform a Euclidean projection onto the feasible set $\\mathcal{C}\\subset \\mathbb{R}^d$ whenever their iterates step outside $\\mathcal{C}$. For various sets of interests, this projection step can be computationally costly, especially when the ambient dimension is large. This has motivated the developmen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11470","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.11470/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:25:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuH+8I7f/5LwiSeEtSbmNJQdbjf36Dx2p5UHpDf2pggIp3Khb+L2cMupYRq590OfXySGukAY5bpz+vH/Hlf/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:16:19.108608Z"},"content_sha256":"1cddecb377370b06b312964047ea0a61e68d928a97cfb5493a1cc08f835991a4","schema_version":"1.0","event_id":"sha256:1cddecb377370b06b312964047ea0a61e68d928a97cfb5493a1cc08f835991a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GROEIPBL3DNS2RAZIHKKN3SMHG/bundle.json","state_url":"https://pith.science/pith/GROEIPBL3DNS2RAZIHKKN3SMHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GROEIPBL3DNS2RAZIHKKN3SMHG/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-08T13:16:19Z","links":{"resolver":"https://pith.science/pith/GROEIPBL3DNS2RAZIHKKN3SMHG","bundle":"https://pith.science/pith/GROEIPBL3DNS2RAZIHKKN3SMHG/bundle.json","state":"https://pith.science/pith/GROEIPBL3DNS2RAZIHKKN3SMHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GROEIPBL3DNS2RAZIHKKN3SMHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GROEIPBL3DNS2RAZIHKKN3SMHG","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":"189738e8211e202675860ef0093b4090e7bb2917dacde040dc96c1d762b6cea6","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-23T17:13:46Z","title_canon_sha256":"8eff871ac05cac292cd034e99588745871fe800a7d52f88bd90e2abcde0a6d26"},"schema_version":"1.0","source":{"id":"2205.11470","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.11470","created_at":"2026-07-05T04:25:37Z"},{"alias_kind":"arxiv_version","alias_value":"2205.11470v1","created_at":"2026-07-05T04:25:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11470","created_at":"2026-07-05T04:25:37Z"},{"alias_kind":"pith_short_12","alias_value":"GROEIPBL3DNS","created_at":"2026-07-05T04:25:37Z"},{"alias_kind":"pith_short_16","alias_value":"GROEIPBL3DNS2RAZ","created_at":"2026-07-05T04:25:37Z"},{"alias_kind":"pith_short_8","alias_value":"GROEIPBL","created_at":"2026-07-05T04:25:37Z"}],"graph_snapshots":[{"event_id":"sha256:1cddecb377370b06b312964047ea0a61e68d928a97cfb5493a1cc08f835991a4","target":"graph","created_at":"2026-07-05T04:25: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.11470/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we develop new efficient projection-free algorithms for Online Convex Optimization (OCO). Online Gradient Descent (OGD) is an example of a classical OCO algorithm that guarantees the optimal $O(\\sqrt{T})$ regret bound. However, OGD and other projection-based OCO algorithms need to perform a Euclidean projection onto the feasible set $\\mathcal{C}\\subset \\mathbb{R}^d$ whenever their iterates step outside $\\mathcal{C}$. For various sets of interests, this projection step can be computationally costly, especially when the ambient dimension is large. This has motivated the developmen","authors_text":"Zakaria Mhammedi","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-23T17:13:46Z","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11470","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:41554a15197a2b7628582948d68300cd41e89d6b5acc50aa5a53d2f22749f103","target":"record","created_at":"2026-07-05T04:25: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":"189738e8211e202675860ef0093b4090e7bb2917dacde040dc96c1d762b6cea6","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-23T17:13:46Z","title_canon_sha256":"8eff871ac05cac292cd034e99588745871fe800a7d52f88bd90e2abcde0a6d26"},"schema_version":"1.0","source":{"id":"2205.11470","kind":"arxiv","version":1}},"canonical_sha256":"345c443c2bd8db2d441941d4a6ee4c39b649fec2733a1e1640d50bbec7323076","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"345c443c2bd8db2d441941d4a6ee4c39b649fec2733a1e1640d50bbec7323076","first_computed_at":"2026-07-05T04:25:37.599404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:25:37.599404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KW/yJtF+r1TBtd0cTVAuijsycyE5iEdntT96PCyN7DFCUWcbmOkZwL89U04GqIhwWGUvLZwRvPU5do/A5PFtBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:25:37.599819Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.11470","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41554a15197a2b7628582948d68300cd41e89d6b5acc50aa5a53d2f22749f103","sha256:1cddecb377370b06b312964047ea0a61e68d928a97cfb5493a1cc08f835991a4"],"state_sha256":"720589879208ecde73b81e08a6ae296bd8ed630919442d09500dadd893fcaaff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x71WUoHXAv/Uwkkkcp/D8FMeD9V5Etk1djIPTPSfGZ5rGDrim7SdfxzuP5DSOtkrGQ7SQTqnxAU3csUzGjGgBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:16:19.113675Z","bundle_sha256":"9849d95f514da6e21cdf74767ba515002a4b5302198466352a01f0f6ba207494"}}