{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:72ILJAFPIYIR7TZ7Q2F2VFQ57S","short_pith_number":"pith:72ILJAFP","schema_version":"1.0","canonical_sha256":"fe90b480af46111fcf3f868baa961dfc802aab972d98e6b63a7054c145205d66","source":{"kind":"arxiv","id":"2407.11760","version":3},"attestation_state":"computed","paper":{"title":"The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Elias Wirth, Mathieu Besan\\c{c}on, Sebastian Pokutta","submitted_at":"2024-07-16T14:20:33Z","abstract_excerpt":"We propose the pivoting meta algorithm (PM) to enhance optimization algorithms that generate iterates as convex combinations of vertices of a feasible region $C\\subseteq \\mathbb{R}^n$, including Frank-Wolfe (FW) variants. PM guarantees that the active set (the set of vertices in the convex combination) of the modified algorithm remains as small as $\\mathrm{dim}(C)+1$ as stipulated by Carath\\'eodory's theorem. PM achieves this by reformulating the active set expansion task into an equivalent linear program, which can be efficiently solved using a single pivot step akin to the primal simplex alg"},"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":"2407.11760","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-16T14:20:33Z","cross_cats_sorted":[],"title_canon_sha256":"a9bbb6b3db7df2369edf5f5f73c916bea340da54cc1c61867a482d283809622b","abstract_canon_sha256":"0aca7e802471b616261628da069b6c1191811972be760ce92e4647056111182e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:45.698368Z","signature_b64":"dG0kd73EqWpLpwY2yRljvUxJQgsnWUQYSpPsxS7NLbygN23jCA5zh4zFJHZ1tF8YUdIJz/NF1pm8MRcIsAeIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe90b480af46111fcf3f868baa961dfc802aab972d98e6b63a7054c145205d66","last_reissued_at":"2026-07-05T11:48:45.697951Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:45.697951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Elias Wirth, Mathieu Besan\\c{c}on, Sebastian Pokutta","submitted_at":"2024-07-16T14:20:33Z","abstract_excerpt":"We propose the pivoting meta algorithm (PM) to enhance optimization algorithms that generate iterates as convex combinations of vertices of a feasible region $C\\subseteq \\mathbb{R}^n$, including Frank-Wolfe (FW) variants. PM guarantees that the active set (the set of vertices in the convex combination) of the modified algorithm remains as small as $\\mathrm{dim}(C)+1$ as stipulated by Carath\\'eodory's theorem. PM achieves this by reformulating the active set expansion task into an equivalent linear program, which can be efficiently solved using a single pivot step akin to the primal simplex alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.11760","kind":"arxiv","version":3},"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/2407.11760/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":"2407.11760","created_at":"2026-07-05T11:48:45.698006+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.11760v3","created_at":"2026-07-05T11:48:45.698006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11760","created_at":"2026-07-05T11:48:45.698006+00:00"},{"alias_kind":"pith_short_12","alias_value":"72ILJAFPIYIR","created_at":"2026-07-05T11:48:45.698006+00:00"},{"alias_kind":"pith_short_16","alias_value":"72ILJAFPIYIR7TZ7","created_at":"2026-07-05T11:48:45.698006+00:00"},{"alias_kind":"pith_short_8","alias_value":"72ILJAFP","created_at":"2026-07-05T11:48:45.698006+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/72ILJAFPIYIR7TZ7Q2F2VFQ57S","json":"https://pith.science/pith/72ILJAFPIYIR7TZ7Q2F2VFQ57S.json","graph_json":"https://pith.science/api/pith-number/72ILJAFPIYIR7TZ7Q2F2VFQ57S/graph.json","events_json":"https://pith.science/api/pith-number/72ILJAFPIYIR7TZ7Q2F2VFQ57S/events.json","paper":"https://pith.science/paper/72ILJAFP"},"agent_actions":{"view_html":"https://pith.science/pith/72ILJAFPIYIR7TZ7Q2F2VFQ57S","download_json":"https://pith.science/pith/72ILJAFPIYIR7TZ7Q2F2VFQ57S.json","view_paper":"https://pith.science/paper/72ILJAFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.11760&json=true","fetch_graph":"https://pith.science/api/pith-number/72ILJAFPIYIR7TZ7Q2F2VFQ57S/graph.json","fetch_events":"https://pith.science/api/pith-number/72ILJAFPIYIR7TZ7Q2F2VFQ57S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72ILJAFPIYIR7TZ7Q2F2VFQ57S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72ILJAFPIYIR7TZ7Q2F2VFQ57S/action/storage_attestation","attest_author":"https://pith.science/pith/72ILJAFPIYIR7TZ7Q2F2VFQ57S/action/author_attestation","sign_citation":"https://pith.science/pith/72ILJAFPIYIR7TZ7Q2F2VFQ57S/action/citation_signature","submit_replication":"https://pith.science/pith/72ILJAFPIYIR7TZ7Q2F2VFQ57S/action/replication_record"}},"created_at":"2026-07-05T11:48:45.698006+00:00","updated_at":"2026-07-05T11:48:45.698006+00:00"}