{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TM6PJG6VJRVTVLZA2ZALDGTJWV","short_pith_number":"pith:TM6PJG6V","canonical_record":{"source":{"id":"1811.05831","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T15:09:39Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"e494af4e37ee1a8123c0b3a0c61ebb16a445b4862b852ee92905c1620577d1a5","abstract_canon_sha256":"ca36278056a64788af340d6225193ef21b34cc74237571162dec58f1deedbe63"},"schema_version":"1.0"},"canonical_sha256":"9b3cf49bd54c6b3aaf20d640b19a69b564aa5afe6d6e896c1b8217ac865cc81d","source":{"kind":"arxiv","id":"1811.05831","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05831","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05831v3","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05831","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"TM6PJG6VJRVT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TM6PJG6VJRVTVLZA","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TM6PJG6V","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TM6PJG6VJRVTVLZA2ZALDGTJWV","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05831","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T15:09:39Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"e494af4e37ee1a8123c0b3a0c61ebb16a445b4862b852ee92905c1620577d1a5","abstract_canon_sha256":"ca36278056a64788af340d6225193ef21b34cc74237571162dec58f1deedbe63"},"schema_version":"1.0"},"canonical_sha256":"9b3cf49bd54c6b3aaf20d640b19a69b564aa5afe6d6e896c1b8217ac865cc81d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:03.121706Z","signature_b64":"a2JFMSRxAg8QHBA/vu9mHgjMyxuKaLIHS7erggHBdrHXXFATCfFhojiTfIkiEk9THOFjvrG9Iu7xuLbnv91bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b3cf49bd54c6b3aaf20d640b19a69b564aa5afe6d6e896c1b8217ac865cc81d","last_reissued_at":"2026-05-17T23:55:03.121201Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:03.121201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05831","source_version":3,"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-17T23:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSR6K6W3LphcxgBhl6fQQ6B8Hup07AwZ0t5jZjWHzXYRJE7MLRlkUq0npdPfqdwG/dsv66N5D35PT8eKB0aqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:37:23.398130Z"},"content_sha256":"3b35510e54398df45b3ac0b1718f6ea82fdd393f215799aae8d4537a952cd9fc","schema_version":"1.0","event_id":"sha256:3b35510e54398df45b3ac0b1718f6ea82fdd393f215799aae8d4537a952cd9fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TM6PJG6VJRVTVLZA2ZALDGTJWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Barzan Mozafari, Jarrid Rector-Brooks, Jun-Kun Wang","submitted_at":"2018-11-14T15:09:39Z","abstract_excerpt":"We revisit the Frank-Wolfe (FW) optimization under strongly convex constraint sets. We provide a faster convergence rate for FW without line search, showing that a previously overlooked variant of FW is indeed faster than the standard variant. With line search, we show that FW can converge to the global optimum, even for smooth functions that are not convex, but are quasi-convex and locally-Lipschitz. We also show that, for the general case of (smooth) non-convex functions, FW with line search converges with high probability to a stationary point at a rate of $O\\left(\\frac{1}{t}\\right)$, as lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05831","kind":"arxiv","version":3},"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-17T23:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dm87CcLGov4fhisjNNhIO4s0YSgnM0qhhCNMryvNGRhPVZt0aIupqZeew+UhUSf9OmX01P6ZMxj6aujw2HEDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:37:23.398684Z"},"content_sha256":"9d860815c4505a57bea8d5c975d2da785ee1221e519c59f955ce461c9e8c9d2e","schema_version":"1.0","event_id":"sha256:9d860815c4505a57bea8d5c975d2da785ee1221e519c59f955ce461c9e8c9d2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TM6PJG6VJRVTVLZA2ZALDGTJWV/bundle.json","state_url":"https://pith.science/pith/TM6PJG6VJRVTVLZA2ZALDGTJWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TM6PJG6VJRVTVLZA2ZALDGTJWV/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-07T02:37:23Z","links":{"resolver":"https://pith.science/pith/TM6PJG6VJRVTVLZA2ZALDGTJWV","bundle":"https://pith.science/pith/TM6PJG6VJRVTVLZA2ZALDGTJWV/bundle.json","state":"https://pith.science/pith/TM6PJG6VJRVTVLZA2ZALDGTJWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TM6PJG6VJRVTVLZA2ZALDGTJWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TM6PJG6VJRVTVLZA2ZALDGTJWV","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":"ca36278056a64788af340d6225193ef21b34cc74237571162dec58f1deedbe63","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T15:09:39Z","title_canon_sha256":"e494af4e37ee1a8123c0b3a0c61ebb16a445b4862b852ee92905c1620577d1a5"},"schema_version":"1.0","source":{"id":"1811.05831","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05831","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05831v3","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05831","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"TM6PJG6VJRVT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TM6PJG6VJRVTVLZA","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TM6PJG6V","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:9d860815c4505a57bea8d5c975d2da785ee1221e519c59f955ce461c9e8c9d2e","target":"graph","created_at":"2026-05-17T23:55:03Z","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 Frank-Wolfe (FW) optimization under strongly convex constraint sets. We provide a faster convergence rate for FW without line search, showing that a previously overlooked variant of FW is indeed faster than the standard variant. With line search, we show that FW can converge to the global optimum, even for smooth functions that are not convex, but are quasi-convex and locally-Lipschitz. We also show that, for the general case of (smooth) non-convex functions, FW with line search converges with high probability to a stationary point at a rate of $O\\left(\\frac{1}{t}\\right)$, as lo","authors_text":"Barzan Mozafari, Jarrid Rector-Brooks, Jun-Kun Wang","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T15:09:39Z","title":"Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05831","kind":"arxiv","version":3},"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:3b35510e54398df45b3ac0b1718f6ea82fdd393f215799aae8d4537a952cd9fc","target":"record","created_at":"2026-05-17T23:55:03Z","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":"ca36278056a64788af340d6225193ef21b34cc74237571162dec58f1deedbe63","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T15:09:39Z","title_canon_sha256":"e494af4e37ee1a8123c0b3a0c61ebb16a445b4862b852ee92905c1620577d1a5"},"schema_version":"1.0","source":{"id":"1811.05831","kind":"arxiv","version":3}},"canonical_sha256":"9b3cf49bd54c6b3aaf20d640b19a69b564aa5afe6d6e896c1b8217ac865cc81d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b3cf49bd54c6b3aaf20d640b19a69b564aa5afe6d6e896c1b8217ac865cc81d","first_computed_at":"2026-05-17T23:55:03.121201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:03.121201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a2JFMSRxAg8QHBA/vu9mHgjMyxuKaLIHS7erggHBdrHXXFATCfFhojiTfIkiEk9THOFjvrG9Iu7xuLbnv91bCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:03.121706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05831","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b35510e54398df45b3ac0b1718f6ea82fdd393f215799aae8d4537a952cd9fc","sha256:9d860815c4505a57bea8d5c975d2da785ee1221e519c59f955ce461c9e8c9d2e"],"state_sha256":"f23ade6a4e4aa6f0a63caada275c77cb80c72c6bc0280a97c4ef9d391f27245b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qVhO2/VI+7zq5tt1JIAoETz6LTXVHIGC9LAwjzYg/tX5EOH4qxkr+WOHz7qeKGltIBOgf6x5SI+qy1vpUe0GAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:37:23.400871Z","bundle_sha256":"76bc2a0f4a7d6aac82b74a4c0741c28dd241b97732c2c63752c20b5cf9fc1d57"}}