{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NFKG7W7D5MPEESD5J5R4DDTK3P","short_pith_number":"pith:NFKG7W7D","schema_version":"1.0","canonical_sha256":"69546fdbe3eb1e42487d4f63c18e6adbea59fcb9e3ec51cab1115381446e6dea","source":{"kind":"arxiv","id":"2211.14103","version":5},"attestation_state":"computed","paper":{"title":"Conditional Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Carderera, Amin Karbasi, Aryan Mokhtari, Cyrille W. Combettes, G\\'abor Braun, Hamed Hassani, Sebastian Pokutta","submitted_at":"2022-11-25T13:36:11Z","abstract_excerpt":"The purpose of this survey is to serve both as a gentle introduction and a coherent overview of state-of-the-art Frank--Wolfe algorithms, also called conditional gradient algorithms, for function minimization. These algorithms are especially useful in convex optimization when linear optimization is cheaper than projections.\n  The selection of the material has been guided by the principle of highlighting crucial ideas as well as presenting new approaches that we believe might become important in the future, with ample citations even of old works imperative in the development of newer methods. Y"},"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":"2211.14103","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-25T13:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"4c8ac2e3c625ed44a61c67c30bb99e51753e68620d44f321a84828b60b739fa7","abstract_canon_sha256":"ff9f5a7cda054a9dca6b0f36e4ff0faf04c8a157f22950539d96c922a08f66b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:32.623304Z","signature_b64":"PYINw4ae479rno4gbhnpgLVNLEtjH1Wiyr8ObOtbo95Zm8dWajesPVJdB2LBtAMs49CXryYDtU5seJo1w9APBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69546fdbe3eb1e42487d4f63c18e6adbea59fcb9e3ec51cab1115381446e6dea","last_reissued_at":"2026-07-05T11:46:32.622807Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:32.622807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Carderera, Amin Karbasi, Aryan Mokhtari, Cyrille W. Combettes, G\\'abor Braun, Hamed Hassani, Sebastian Pokutta","submitted_at":"2022-11-25T13:36:11Z","abstract_excerpt":"The purpose of this survey is to serve both as a gentle introduction and a coherent overview of state-of-the-art Frank--Wolfe algorithms, also called conditional gradient algorithms, for function minimization. These algorithms are especially useful in convex optimization when linear optimization is cheaper than projections.\n  The selection of the material has been guided by the principle of highlighting crucial ideas as well as presenting new approaches that we believe might become important in the future, with ample citations even of old works imperative in the development of newer methods. Y"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14103","kind":"arxiv","version":5},"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/2211.14103/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":"2211.14103","created_at":"2026-07-05T11:46:32.622869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.14103v5","created_at":"2026-07-05T11:46:32.622869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14103","created_at":"2026-07-05T11:46:32.622869+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFKG7W7D5MPE","created_at":"2026-07-05T11:46:32.622869+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFKG7W7D5MPEESD5","created_at":"2026-07-05T11:46:32.622869+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFKG7W7D","created_at":"2026-07-05T11:46:32.622869+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.14970","citing_title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2510.16468","citing_title":"Frank-Wolfe Algorithms for (L0, L1)-smooth functions","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2506.12876","citing_title":"MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMs","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2510.12886","citing_title":"Can outcome communication explain Bell nonlocality?","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2510.16468","citing_title":"Frank-Wolfe Algorithms for (L0, L1)-smooth functions","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2511.11237","citing_title":"An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08850","citing_title":"Local LMO: Constrained Gradient Optimization via a Local Linear Minimization Oracle","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09209","citing_title":"Select-then-differentiate: Solving Bilevel Optimization with Manifold Lower-level Solution Sets","ref_index":150,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NFKG7W7D5MPEESD5J5R4DDTK3P","json":"https://pith.science/pith/NFKG7W7D5MPEESD5J5R4DDTK3P.json","graph_json":"https://pith.science/api/pith-number/NFKG7W7D5MPEESD5J5R4DDTK3P/graph.json","events_json":"https://pith.science/api/pith-number/NFKG7W7D5MPEESD5J5R4DDTK3P/events.json","paper":"https://pith.science/paper/NFKG7W7D"},"agent_actions":{"view_html":"https://pith.science/pith/NFKG7W7D5MPEESD5J5R4DDTK3P","download_json":"https://pith.science/pith/NFKG7W7D5MPEESD5J5R4DDTK3P.json","view_paper":"https://pith.science/paper/NFKG7W7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.14103&json=true","fetch_graph":"https://pith.science/api/pith-number/NFKG7W7D5MPEESD5J5R4DDTK3P/graph.json","fetch_events":"https://pith.science/api/pith-number/NFKG7W7D5MPEESD5J5R4DDTK3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFKG7W7D5MPEESD5J5R4DDTK3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFKG7W7D5MPEESD5J5R4DDTK3P/action/storage_attestation","attest_author":"https://pith.science/pith/NFKG7W7D5MPEESD5J5R4DDTK3P/action/author_attestation","sign_citation":"https://pith.science/pith/NFKG7W7D5MPEESD5J5R4DDTK3P/action/citation_signature","submit_replication":"https://pith.science/pith/NFKG7W7D5MPEESD5J5R4DDTK3P/action/replication_record"}},"created_at":"2026-07-05T11:46:32.622869+00:00","updated_at":"2026-07-05T11:46:32.622869+00:00"}