{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IJQDH27XNZJP3INKHD4ORZ3QAS","short_pith_number":"pith:IJQDH27X","schema_version":"1.0","canonical_sha256":"426033ebf76e52fda1aa38f8e8e7700499dcd6f9566c2e281822d6173cd471ba","source":{"kind":"arxiv","id":"2605.10595","version":2},"attestation_state":"computed","paper":{"title":"Curvature-Dependent Lower Bounds for Frank-Wolfe","license":"http://creativecommons.org/licenses/by/4.0/","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.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christophe Roux, Jannis Halbey, Sebastian Pokutta","submitted_at":"2026-05-11T14:01:13Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.10595","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T14:01:13Z","cross_cats_sorted":[],"title_canon_sha256":"c7afa1e1a16956f47773ee55483abf8a5346611273bd2edfe54fdd50a5bffd73","abstract_canon_sha256":"bdb693a76827e3b9247dc5bc562d90ee4282e1a47600b2b6285dc5859e51befa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:35.776951Z","signature_b64":"tbjTcx/1n4mRODV+QeXnreR39FbR/iH5/O3yKIcQPKOuMKAXM8RZyfDhYSB+MsNYoe7rL/K2RnVHz8kYF50rCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"426033ebf76e52fda1aa38f8e8e7700499dcd6f9566c2e281822d6173cd471ba","last_reissued_at":"2026-05-20T00:04:35.776014Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:35.776014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Curvature-Dependent Lower Bounds for Frank-Wolfe","license":"http://creativecommons.org/licenses/by/4.0/","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.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christophe Roux, Jannis Halbey, Sebastian Pokutta","submitted_at":"2026-05-11T14:01:13Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Matching Ω(T^{-p/(p-1)}) lower bounds are proven for Frank-Wolfe convergence on p-uniformly convex domains for p ≥ 3.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","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.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9ce6a113f47a50f0aa0c00983f4993ef359d6041a4e575a8778c674073831de6"},"source":{"id":"2605.10595","kind":"arxiv","version":2},"verdict":{"id":"a32f47b1-49db-4222-acd9-02972e1dea9c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T04:37:33.056171Z","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.","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","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.","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."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.10595/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"85b2bf7fb30e2818fc36c5cc45e9c025ef67b91bd60c6faf005d2e9f5a30ee55"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"353813df009ef0516a3bf47639049e72624edf4506bddd83e0cebd6a650d2a74"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.10595","created_at":"2026-05-20T00:04:35.776116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.10595v2","created_at":"2026-05-20T00:04:35.776116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10595","created_at":"2026-05-20T00:04:35.776116+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJQDH27XNZJP","created_at":"2026-05-20T00:04:35.776116+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJQDH27XNZJP3INK","created_at":"2026-05-20T00:04:35.776116+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJQDH27X","created_at":"2026-05-20T00:04:35.776116+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IJQDH27XNZJP3INKHD4ORZ3QAS","json":"https://pith.science/pith/IJQDH27XNZJP3INKHD4ORZ3QAS.json","graph_json":"https://pith.science/api/pith-number/IJQDH27XNZJP3INKHD4ORZ3QAS/graph.json","events_json":"https://pith.science/api/pith-number/IJQDH27XNZJP3INKHD4ORZ3QAS/events.json","paper":"https://pith.science/paper/IJQDH27X"},"agent_actions":{"view_html":"https://pith.science/pith/IJQDH27XNZJP3INKHD4ORZ3QAS","download_json":"https://pith.science/pith/IJQDH27XNZJP3INKHD4ORZ3QAS.json","view_paper":"https://pith.science/paper/IJQDH27X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.10595&json=true","fetch_graph":"https://pith.science/api/pith-number/IJQDH27XNZJP3INKHD4ORZ3QAS/graph.json","fetch_events":"https://pith.science/api/pith-number/IJQDH27XNZJP3INKHD4ORZ3QAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJQDH27XNZJP3INKHD4ORZ3QAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJQDH27XNZJP3INKHD4ORZ3QAS/action/storage_attestation","attest_author":"https://pith.science/pith/IJQDH27XNZJP3INKHD4ORZ3QAS/action/author_attestation","sign_citation":"https://pith.science/pith/IJQDH27XNZJP3INKHD4ORZ3QAS/action/citation_signature","submit_replication":"https://pith.science/pith/IJQDH27XNZJP3INKHD4ORZ3QAS/action/replication_record"}},"created_at":"2026-05-20T00:04:35.776116+00:00","updated_at":"2026-05-20T00:04:35.776116+00:00"}