{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EGSH7NURU2TXCM6ZHIBRXG7EUI","short_pith_number":"pith:EGSH7NUR","schema_version":"1.0","canonical_sha256":"21a47fb691a6a77133d93a031b9be4a23ffc34b768cd55cc8ba0db5d07b17a19","source":{"kind":"arxiv","id":"2004.11053","version":2},"attestation_state":"computed","paper":{"title":"Projection-Free Optimization on Uniformly Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Sebastian Pokutta, Thomas Kerdreux","submitted_at":"2020-04-23T10:20:38Z","abstract_excerpt":"The Frank-Wolfe method solves smooth constrained convex optimization problems at a generic sublinear rate of $\\mathcal{O}(1/T)$, and it (or its variants) enjoys accelerated convergence rates for two fundamental classes of constraints: polytopes and strongly-convex sets. Uniformly convex sets non-trivially subsume strongly convex sets and form a large variety of \\textit{curved} convex sets commonly encountered in machine learning and signal processing. For instance, the $\\ell_p$-balls are uniformly convex for all $p > 1$, but strongly convex for $p\\in]1,2]$ only. We show that these sets systema"},"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":false},"canonical_record":{"source":{"id":"2004.11053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-23T10:20:38Z","cross_cats_sorted":[],"title_canon_sha256":"521ec99e08e6403c369e05da466fce98b5bafa34170c29c9b7e7c33786284fee","abstract_canon_sha256":"47e032d4625957e110b4503acaa1b926c59177d5e5e5198be8ac6aeec224e26a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:36.563095Z","signature_b64":"WVtTDtK98Xq9pl1fIkEywfL9nPVHDnf2hap/mytBg7ABtNW4gSSvwG3ShhIOve6NCkiX+Mua2Y6TIDk+bACgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21a47fb691a6a77133d93a031b9be4a23ffc34b768cd55cc8ba0db5d07b17a19","last_reissued_at":"2026-07-05T01:10:36.562608Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:36.562608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projection-Free Optimization on Uniformly Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Sebastian Pokutta, Thomas Kerdreux","submitted_at":"2020-04-23T10:20:38Z","abstract_excerpt":"The Frank-Wolfe method solves smooth constrained convex optimization problems at a generic sublinear rate of $\\mathcal{O}(1/T)$, and it (or its variants) enjoys accelerated convergence rates for two fundamental classes of constraints: polytopes and strongly-convex sets. Uniformly convex sets non-trivially subsume strongly convex sets and form a large variety of \\textit{curved} convex sets commonly encountered in machine learning and signal processing. For instance, the $\\ell_p$-balls are uniformly convex for all $p > 1$, but strongly convex for $p\\in]1,2]$ only. We show that these sets systema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.11053","kind":"arxiv","version":2},"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/2004.11053/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2004.11053","created_at":"2026-07-05T01:10:36.562668+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.11053v2","created_at":"2026-07-05T01:10:36.562668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.11053","created_at":"2026-07-05T01:10:36.562668+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGSH7NURU2TX","created_at":"2026-07-05T01:10:36.562668+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGSH7NURU2TXCM6Z","created_at":"2026-07-05T01:10:36.562668+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGSH7NUR","created_at":"2026-07-05T01:10:36.562668+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EGSH7NURU2TXCM6ZHIBRXG7EUI","json":"https://pith.science/pith/EGSH7NURU2TXCM6ZHIBRXG7EUI.json","graph_json":"https://pith.science/api/pith-number/EGSH7NURU2TXCM6ZHIBRXG7EUI/graph.json","events_json":"https://pith.science/api/pith-number/EGSH7NURU2TXCM6ZHIBRXG7EUI/events.json","paper":"https://pith.science/paper/EGSH7NUR"},"agent_actions":{"view_html":"https://pith.science/pith/EGSH7NURU2TXCM6ZHIBRXG7EUI","download_json":"https://pith.science/pith/EGSH7NURU2TXCM6ZHIBRXG7EUI.json","view_paper":"https://pith.science/paper/EGSH7NUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.11053&json=true","fetch_graph":"https://pith.science/api/pith-number/EGSH7NURU2TXCM6ZHIBRXG7EUI/graph.json","fetch_events":"https://pith.science/api/pith-number/EGSH7NURU2TXCM6ZHIBRXG7EUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGSH7NURU2TXCM6ZHIBRXG7EUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGSH7NURU2TXCM6ZHIBRXG7EUI/action/storage_attestation","attest_author":"https://pith.science/pith/EGSH7NURU2TXCM6ZHIBRXG7EUI/action/author_attestation","sign_citation":"https://pith.science/pith/EGSH7NURU2TXCM6ZHIBRXG7EUI/action/citation_signature","submit_replication":"https://pith.science/pith/EGSH7NURU2TXCM6ZHIBRXG7EUI/action/replication_record"}},"created_at":"2026-07-05T01:10:36.562668+00:00","updated_at":"2026-07-05T01:10:36.562668+00:00"}