{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:D4EB6LDTGAJ2ISTYGCTK5CKLV4","short_pith_number":"pith:D4EB6LDT","canonical_record":{"source":{"id":"2102.06742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-12T19:53:15Z","cross_cats_sorted":[],"title_canon_sha256":"1a7e76626c86bfcd44083119398972a85d3fa5e1e44461851351b6d8f6ecb1fd","abstract_canon_sha256":"e5862d668717c4bd47a8450263f763cf73de757afe75b34501342da326ded2d9"},"schema_version":"1.0"},"canonical_sha256":"1f081f2c733013a44a7830a6ae894baf3a946e604d5a934d20517d65db9018a8","source":{"kind":"arxiv","id":"2102.06742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.06742","created_at":"2026-07-05T02:14:57Z"},{"alias_kind":"arxiv_version","alias_value":"2102.06742v1","created_at":"2026-07-05T02:14:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06742","created_at":"2026-07-05T02:14:57Z"},{"alias_kind":"pith_short_12","alias_value":"D4EB6LDTGAJ2","created_at":"2026-07-05T02:14:57Z"},{"alias_kind":"pith_short_16","alias_value":"D4EB6LDTGAJ2ISTY","created_at":"2026-07-05T02:14:57Z"},{"alias_kind":"pith_short_8","alias_value":"D4EB6LDT","created_at":"2026-07-05T02:14:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:D4EB6LDTGAJ2ISTYGCTK5CKLV4","target":"record","payload":{"canonical_record":{"source":{"id":"2102.06742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-12T19:53:15Z","cross_cats_sorted":[],"title_canon_sha256":"1a7e76626c86bfcd44083119398972a85d3fa5e1e44461851351b6d8f6ecb1fd","abstract_canon_sha256":"e5862d668717c4bd47a8450263f763cf73de757afe75b34501342da326ded2d9"},"schema_version":"1.0"},"canonical_sha256":"1f081f2c733013a44a7830a6ae894baf3a946e604d5a934d20517d65db9018a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:14:57.984234Z","signature_b64":"+EF0+Xtpki1A1gRHfRYtMRX3RSf8Thtr/k2ApD3PTDMQZpj2t0r806js8q0wsvzy0L1nKgp20cxC/IroJ5w+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f081f2c733013a44a7830a6ae894baf3a946e604d5a934d20517d65db9018a8","last_reissued_at":"2026-07-05T02:14:57.983862Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:14:57.983862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.06742","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:14:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJwaQ26eOXDB8H3jfDNxUp7cJs1kw3TM+foIPX0ovb6xeyIybRkCPLM6RWEZ9DrhGKKpftFQ27wM5dPrGc+tCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:45:38.583234Z"},"content_sha256":"6e578469efdb1117cf8715faa94bf00c65f0aa338d631f895a99f64fe4013250","schema_version":"1.0","event_id":"sha256:6e578469efdb1117cf8715faa94bf00c65f0aa338d631f895a99f64fe4013250"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:D4EB6LDTGAJ2ISTYGCTK5CKLV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Bounds for Sparse Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Armin Askari, Laurent El Ghaoui","submitted_at":"2021-02-12T19:53:15Z","abstract_excerpt":"We show that sparsity constrained optimization problems over low dimensional spaces tend to have a small duality gap. We use the Shapley-Folkman theorem to derive both data-driven bounds on the duality gap, and an efficient primalization procedure to recover feasible points satisfying these bounds. These error bounds are proportional to the rate of growth of the objective with the target cardinality, which means in particular that the relaxation is nearly tight as soon as the target cardinality is large enough so that only uninformative features are added."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06742","kind":"arxiv","version":1},"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/2102.06742/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:14:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+07pyJmkmMX8GOrlLqmRJAAXWSc1ugksGok+T46nikayX5kWf0fFsDA/SWtwLDXsIMrKgQnAq5iXGy8a7L6dAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:45:38.584135Z"},"content_sha256":"ab692ec7fba1d658d4d8cb2bcd5b8263ab50c3195c19a62e38fc4cb1562d0541","schema_version":"1.0","event_id":"sha256:ab692ec7fba1d658d4d8cb2bcd5b8263ab50c3195c19a62e38fc4cb1562d0541"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4EB6LDTGAJ2ISTYGCTK5CKLV4/bundle.json","state_url":"https://pith.science/pith/D4EB6LDTGAJ2ISTYGCTK5CKLV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4EB6LDTGAJ2ISTYGCTK5CKLV4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T19:45:38Z","links":{"resolver":"https://pith.science/pith/D4EB6LDTGAJ2ISTYGCTK5CKLV4","bundle":"https://pith.science/pith/D4EB6LDTGAJ2ISTYGCTK5CKLV4/bundle.json","state":"https://pith.science/pith/D4EB6LDTGAJ2ISTYGCTK5CKLV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4EB6LDTGAJ2ISTYGCTK5CKLV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:D4EB6LDTGAJ2ISTYGCTK5CKLV4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e5862d668717c4bd47a8450263f763cf73de757afe75b34501342da326ded2d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-12T19:53:15Z","title_canon_sha256":"1a7e76626c86bfcd44083119398972a85d3fa5e1e44461851351b6d8f6ecb1fd"},"schema_version":"1.0","source":{"id":"2102.06742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.06742","created_at":"2026-07-05T02:14:57Z"},{"alias_kind":"arxiv_version","alias_value":"2102.06742v1","created_at":"2026-07-05T02:14:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06742","created_at":"2026-07-05T02:14:57Z"},{"alias_kind":"pith_short_12","alias_value":"D4EB6LDTGAJ2","created_at":"2026-07-05T02:14:57Z"},{"alias_kind":"pith_short_16","alias_value":"D4EB6LDTGAJ2ISTY","created_at":"2026-07-05T02:14:57Z"},{"alias_kind":"pith_short_8","alias_value":"D4EB6LDT","created_at":"2026-07-05T02:14:57Z"}],"graph_snapshots":[{"event_id":"sha256:ab692ec7fba1d658d4d8cb2bcd5b8263ab50c3195c19a62e38fc4cb1562d0541","target":"graph","created_at":"2026-07-05T02:14:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.06742/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that sparsity constrained optimization problems over low dimensional spaces tend to have a small duality gap. We use the Shapley-Folkman theorem to derive both data-driven bounds on the duality gap, and an efficient primalization procedure to recover feasible points satisfying these bounds. These error bounds are proportional to the rate of growth of the objective with the target cardinality, which means in particular that the relaxation is nearly tight as soon as the target cardinality is large enough so that only uninformative features are added.","authors_text":"Alexandre d'Aspremont, Armin Askari, Laurent El Ghaoui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-12T19:53:15Z","title":"Approximation Bounds for Sparse Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06742","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e578469efdb1117cf8715faa94bf00c65f0aa338d631f895a99f64fe4013250","target":"record","created_at":"2026-07-05T02:14:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e5862d668717c4bd47a8450263f763cf73de757afe75b34501342da326ded2d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-12T19:53:15Z","title_canon_sha256":"1a7e76626c86bfcd44083119398972a85d3fa5e1e44461851351b6d8f6ecb1fd"},"schema_version":"1.0","source":{"id":"2102.06742","kind":"arxiv","version":1}},"canonical_sha256":"1f081f2c733013a44a7830a6ae894baf3a946e604d5a934d20517d65db9018a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f081f2c733013a44a7830a6ae894baf3a946e604d5a934d20517d65db9018a8","first_computed_at":"2026-07-05T02:14:57.983862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:14:57.983862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+EF0+Xtpki1A1gRHfRYtMRX3RSf8Thtr/k2ApD3PTDMQZpj2t0r806js8q0wsvzy0L1nKgp20cxC/IroJ5w+Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:14:57.984234Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.06742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e578469efdb1117cf8715faa94bf00c65f0aa338d631f895a99f64fe4013250","sha256:ab692ec7fba1d658d4d8cb2bcd5b8263ab50c3195c19a62e38fc4cb1562d0541"],"state_sha256":"387de95527e35305dfac86b1ca3e01f9dc59925030970d4efce52d0aee341deb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hH/a4bDMxH5ISYdnNa/gYt5mzCF1mMcSSrgxTQBDzJEVPKT4yR3V8D1M2jTL5KZ/0l4GJP3yHHWnNqDMD4bjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T19:45:38.589185Z","bundle_sha256":"1c646b87eeb108958b0fdf11978a193143b0d7f6334d6178a16e26437c0f5e5c"}}