{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:B6VLTWIBINIEY2G2FOLW437VKC","short_pith_number":"pith:B6VLTWIB","schema_version":"1.0","canonical_sha256":"0faab9d90143504c68da2b976e6ff550bd05d4c4a697ad78ccf7bce6d9527c0c","source":{"kind":"arxiv","id":"2205.12838","version":10},"attestation_state":"computed","paper":{"title":"Acceleration of Frank-Wolfe Algorithms with Open-Loop Step-Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Elias Wirth, Sebastian Pokutta, Thomas Kerdreux","submitted_at":"2022-05-25T15:06:46Z","abstract_excerpt":"Frank-Wolfe algorithms (FW) are popular first-order methods for solving constrained convex optimization problems that rely on a linear minimization oracle instead of potentially expensive projection-like oracles. Many works have identified accelerated convergence rates under various structural assumptions on the optimization problem and for specific FW variants when using line-search or short-step, requiring feedback from the objective function. Little is known about accelerated convergence regimes when utilizing open-loop step-size rules, a.k.a. FW with pre-determined step-sizes, which are al"},"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":"2205.12838","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-25T15:06:46Z","cross_cats_sorted":[],"title_canon_sha256":"ba0ed06a2c12b560121cecb020a7a0c76944ddf4894631515eba6faec69a017b","abstract_canon_sha256":"ca88bdcd7f6cdbd65d3e363d818074a87ed0150ea244720ecfba2b73de2f8d1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:50:51.745656Z","signature_b64":"0wVkMRodBYyYeEAfoQlE1gWp3ogoqLec/qjuM0vW3psBDSwcLcDFwUTe6MOdFeGdf9GvCqdPxcXiJqE0c1rnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0faab9d90143504c68da2b976e6ff550bd05d4c4a697ad78ccf7bce6d9527c0c","last_reissued_at":"2026-07-05T06:50:51.745256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:50:51.745256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acceleration of Frank-Wolfe Algorithms with Open-Loop Step-Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Elias Wirth, Sebastian Pokutta, Thomas Kerdreux","submitted_at":"2022-05-25T15:06:46Z","abstract_excerpt":"Frank-Wolfe algorithms (FW) are popular first-order methods for solving constrained convex optimization problems that rely on a linear minimization oracle instead of potentially expensive projection-like oracles. Many works have identified accelerated convergence rates under various structural assumptions on the optimization problem and for specific FW variants when using line-search or short-step, requiring feedback from the objective function. Little is known about accelerated convergence regimes when utilizing open-loop step-size rules, a.k.a. FW with pre-determined step-sizes, which are al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12838","kind":"arxiv","version":10},"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.12838/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":"2205.12838","created_at":"2026-07-05T06:50:51.745321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.12838v10","created_at":"2026-07-05T06:50:51.745321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12838","created_at":"2026-07-05T06:50:51.745321+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6VLTWIBINIE","created_at":"2026-07-05T06:50:51.745321+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6VLTWIBINIEY2G2","created_at":"2026-07-05T06:50:51.745321+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6VLTWIB","created_at":"2026-07-05T06:50:51.745321+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/B6VLTWIBINIEY2G2FOLW437VKC","json":"https://pith.science/pith/B6VLTWIBINIEY2G2FOLW437VKC.json","graph_json":"https://pith.science/api/pith-number/B6VLTWIBINIEY2G2FOLW437VKC/graph.json","events_json":"https://pith.science/api/pith-number/B6VLTWIBINIEY2G2FOLW437VKC/events.json","paper":"https://pith.science/paper/B6VLTWIB"},"agent_actions":{"view_html":"https://pith.science/pith/B6VLTWIBINIEY2G2FOLW437VKC","download_json":"https://pith.science/pith/B6VLTWIBINIEY2G2FOLW437VKC.json","view_paper":"https://pith.science/paper/B6VLTWIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.12838&json=true","fetch_graph":"https://pith.science/api/pith-number/B6VLTWIBINIEY2G2FOLW437VKC/graph.json","fetch_events":"https://pith.science/api/pith-number/B6VLTWIBINIEY2G2FOLW437VKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6VLTWIBINIEY2G2FOLW437VKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6VLTWIBINIEY2G2FOLW437VKC/action/storage_attestation","attest_author":"https://pith.science/pith/B6VLTWIBINIEY2G2FOLW437VKC/action/author_attestation","sign_citation":"https://pith.science/pith/B6VLTWIBINIEY2G2FOLW437VKC/action/citation_signature","submit_replication":"https://pith.science/pith/B6VLTWIBINIEY2G2FOLW437VKC/action/replication_record"}},"created_at":"2026-07-05T06:50:51.745321+00:00","updated_at":"2026-07-05T06:50:51.745321+00:00"}