{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IJQDH27XNZJP3INKHD4ORZ3QAS","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":"bdb693a76827e3b9247dc5bc562d90ee4282e1a47600b2b6285dc5859e51befa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T14:01:13Z","title_canon_sha256":"c7afa1e1a16956f47773ee55483abf8a5346611273bd2edfe54fdd50a5bffd73"},"schema_version":"1.0","source":{"id":"2605.10595","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.10595","created_at":"2026-05-20T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"2605.10595v2","created_at":"2026-05-20T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10595","created_at":"2026-05-20T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"IJQDH27XNZJP","created_at":"2026-05-20T00:04:35Z"},{"alias_kind":"pith_short_16","alias_value":"IJQDH27XNZJP3INK","created_at":"2026-05-20T00:04:35Z"},{"alias_kind":"pith_short_8","alias_value":"IJQDH27X","created_at":"2026-05-20T00:04:35Z"}],"graph_snapshots":[{"event_id":"sha256:b93b92e8da1bc5fc7d6f0f0650e1274245129d8355d70c04bad03358e451cb40","target":"graph","created_at":"2026-05-20T00:04:35Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we establish a matching Ω(T^{-p/(p-1)}) lower bound for every p≥3 under exact line search or short steps, and extend the lower bound to objectives satisfying a Hölderian error bound."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The analysis relies on the dynamics of Frank-Wolfe iterates on simple instances under the assumption that the feasible set is p-uniformly convex for p≥3 and the objective satisfies standard smoothness and convexity."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Matching Ω(T^{-p/(p-1)}) lower bounds are proven for Frank-Wolfe convergence on p-uniformly convex domains for p ≥ 3."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Frank-Wolfe cannot converge faster than order T to the minus p over p minus one on p-uniformly convex sets for p at least 3."}],"snapshot_sha256":"9ce6a113f47a50f0aa0c00983f4993ef359d6041a4e575a8778c674073831de6"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"353813df009ef0516a3bf47639049e72624edf4506bddd83e0cebd6a650d2a74"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T14:40:53.433984Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T11:01:17.595274Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T09:09:07.804717Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.10595/integrity.json","findings":[],"snapshot_sha256":"85b2bf7fb30e2818fc36c5cc45e9c025ef67b91bd60c6faf005d2e9f5a30ee55","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Frank-Wolfe algorithm achieves a convergence rate of $\\mathcal{O}(1/T)$ for smooth convex optimization over compact convex domains, accelerating to $\\mathcal{O}(1/T^2)$ when both the objective and the feasible set are strongly convex. This acceleration extends beyond strong convexity: Kerdreux et al. (2021a) proved rates of $\\mathcal{O}(T^{-p/(p-1)})$ over $p$-uniformly convex feasible sets, a class that interpolates between strongly convex sets and more general curved domains such as $\\ell_p$ balls. In this work, we establish a matching $\\Omega(T^{-p/(p-1)})$ lower bound for every $p\\ge 3","authors_text":"Christophe Roux, Jannis Halbey, Sebastian Pokutta","cross_cats":[],"headline":"Frank-Wolfe cannot converge faster than order T to the minus p over p minus one on p-uniformly convex sets for p at least 3.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T14:01:13Z","title":"Curvature-Dependent Lower Bounds for Frank-Wolfe"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.10595","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T04:37:33.056171Z","id":"a32f47b1-49db-4222-acd9-02972e1dea9c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Matching Ω(T^{-p/(p-1)}) lower bounds are proven for Frank-Wolfe convergence on p-uniformly convex domains for p ≥ 3.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Frank-Wolfe cannot converge faster than order T to the minus p over p minus one on p-uniformly convex sets for p at least 3.","strongest_claim":"we establish a matching Ω(T^{-p/(p-1)}) lower bound for every p≥3 under exact line search or short steps, and extend the lower bound to objectives satisfying a Hölderian error bound.","weakest_assumption":"The analysis relies on the dynamics of Frank-Wolfe iterates on simple instances under the assumption that the feasible set is p-uniformly convex for p≥3 and the objective satisfies standard smoothness and convexity."}},"verdict_id":"a32f47b1-49db-4222-acd9-02972e1dea9c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e879cd0fc6718a7c32a58e1ed74569cff92fd2682c3130022abc9c1151d0f430","target":"record","created_at":"2026-05-20T00:04:35Z","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":"bdb693a76827e3b9247dc5bc562d90ee4282e1a47600b2b6285dc5859e51befa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T14:01:13Z","title_canon_sha256":"c7afa1e1a16956f47773ee55483abf8a5346611273bd2edfe54fdd50a5bffd73"},"schema_version":"1.0","source":{"id":"2605.10595","kind":"arxiv","version":2}},"canonical_sha256":"426033ebf76e52fda1aa38f8e8e7700499dcd6f9566c2e281822d6173cd471ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"426033ebf76e52fda1aa38f8e8e7700499dcd6f9566c2e281822d6173cd471ba","first_computed_at":"2026-05-20T00:04:35.776014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:35.776014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tbjTcx/1n4mRODV+QeXnreR39FbR/iH5/O3yKIcQPKOuMKAXM8RZyfDhYSB+MsNYoe7rL/K2RnVHz8kYF50rCg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:35.776951Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.10595","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e879cd0fc6718a7c32a58e1ed74569cff92fd2682c3130022abc9c1151d0f430","sha256:b93b92e8da1bc5fc7d6f0f0650e1274245129d8355d70c04bad03358e451cb40"],"state_sha256":"09986c78a55e42570448dd6d4ea6db0196119a6b31a7fbaa640336b6a8f0714a"}