{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5IJ5RLUNA7JRLMNUZKORFTJQ2S","short_pith_number":"pith:5IJ5RLUN","schema_version":"1.0","canonical_sha256":"ea13d8ae8d07d315b1b4ca9d12cd30d482b4d529b87b4fe82f478d1d0293c11a","source":{"kind":"arxiv","id":"2406.18282","version":3},"attestation_state":"computed","paper":{"title":"Frank-Wolfe meets Shapley-Folkman: a systematic approach for solving nonconvex separable problems with linear constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Benjamin Dubois-Taine","submitted_at":"2024-06-26T12:08:44Z","abstract_excerpt":"We consider separable nonconvex optimization problems under affine constraints. For these problems, the Shapley-Folkman theorem provides an upper bound on the duality gap as a function of the nonconvexity of the objective functions, but does not provide a systematic way to construct primal solutions satisfying that bound. In this work, we develop a two-stage approach to do so. The first stage approximates the optimal dual value with a large set of primal feasible solutions. In the second stage, this set is trimmed down to a primal solution by computing (approximate) Caratheodory representation"},"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":"2406.18282","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-26T12:08:44Z","cross_cats_sorted":[],"title_canon_sha256":"618f7baedef286cd4f455b62434a9f9f0b0b41dcccc0b235c4147a121f3f79ab","abstract_canon_sha256":"db812d4a0a74f65cc9ac81b37536c4d3654041f05b59dcc4494620c385481f51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:22.006384Z","signature_b64":"PcGb0BWMOzISiKh9051VpsPhcgZ9z+Q/NjwT7vsAEUVd9VLK639/JmRRDun77hHO5JbxTFQiwBhwFPshBN4qBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea13d8ae8d07d315b1b4ca9d12cd30d482b4d529b87b4fe82f478d1d0293c11a","last_reissued_at":"2026-07-05T11:06:22.005901Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:22.005901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frank-Wolfe meets Shapley-Folkman: a systematic approach for solving nonconvex separable problems with linear constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Benjamin Dubois-Taine","submitted_at":"2024-06-26T12:08:44Z","abstract_excerpt":"We consider separable nonconvex optimization problems under affine constraints. For these problems, the Shapley-Folkman theorem provides an upper bound on the duality gap as a function of the nonconvexity of the objective functions, but does not provide a systematic way to construct primal solutions satisfying that bound. In this work, we develop a two-stage approach to do so. The first stage approximates the optimal dual value with a large set of primal feasible solutions. In the second stage, this set is trimmed down to a primal solution by computing (approximate) Caratheodory representation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18282","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/2406.18282/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":"2406.18282","created_at":"2026-07-05T11:06:22.005953+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18282v3","created_at":"2026-07-05T11:06:22.005953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18282","created_at":"2026-07-05T11:06:22.005953+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IJ5RLUNA7JR","created_at":"2026-07-05T11:06:22.005953+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IJ5RLUNA7JRLMNU","created_at":"2026-07-05T11:06:22.005953+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IJ5RLUN","created_at":"2026-07-05T11:06:22.005953+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21354","citing_title":"Restart and Adaptive Acceleration in Stochastic Gradient Methods","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5IJ5RLUNA7JRLMNUZKORFTJQ2S","json":"https://pith.science/pith/5IJ5RLUNA7JRLMNUZKORFTJQ2S.json","graph_json":"https://pith.science/api/pith-number/5IJ5RLUNA7JRLMNUZKORFTJQ2S/graph.json","events_json":"https://pith.science/api/pith-number/5IJ5RLUNA7JRLMNUZKORFTJQ2S/events.json","paper":"https://pith.science/paper/5IJ5RLUN"},"agent_actions":{"view_html":"https://pith.science/pith/5IJ5RLUNA7JRLMNUZKORFTJQ2S","download_json":"https://pith.science/pith/5IJ5RLUNA7JRLMNUZKORFTJQ2S.json","view_paper":"https://pith.science/paper/5IJ5RLUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18282&json=true","fetch_graph":"https://pith.science/api/pith-number/5IJ5RLUNA7JRLMNUZKORFTJQ2S/graph.json","fetch_events":"https://pith.science/api/pith-number/5IJ5RLUNA7JRLMNUZKORFTJQ2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IJ5RLUNA7JRLMNUZKORFTJQ2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IJ5RLUNA7JRLMNUZKORFTJQ2S/action/storage_attestation","attest_author":"https://pith.science/pith/5IJ5RLUNA7JRLMNUZKORFTJQ2S/action/author_attestation","sign_citation":"https://pith.science/pith/5IJ5RLUNA7JRLMNUZKORFTJQ2S/action/citation_signature","submit_replication":"https://pith.science/pith/5IJ5RLUNA7JRLMNUZKORFTJQ2S/action/replication_record"}},"created_at":"2026-07-05T11:06:22.005953+00:00","updated_at":"2026-07-05T11:06:22.005953+00:00"}