{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XGG4U3EHWSS7VNNYW36QYAZMMN","short_pith_number":"pith:XGG4U3EH","canonical_record":{"source":{"id":"1902.04813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-13T09:46:52Z","cross_cats_sorted":[],"title_canon_sha256":"2f8441c5333388f988260bc996e8f69facb743257a13888940aa81816adbe480","abstract_canon_sha256":"a51bbffa834622a529fa9f61f1bd19ae62f3c60bce26fd8cd30938ecaaf3b317"},"schema_version":"1.0"},"canonical_sha256":"b98dca6c87b4a5fab5b8b6fd0c032c635423394c8653f6b15b7f7885a235d528","source":{"kind":"arxiv","id":"1902.04813","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04813","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04813v1","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04813","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"XGG4U3EHWSS7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XGG4U3EHWSS7VNNY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XGG4U3EH","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XGG4U3EHWSS7VNNYW36QYAZMMN","target":"record","payload":{"canonical_record":{"source":{"id":"1902.04813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-13T09:46:52Z","cross_cats_sorted":[],"title_canon_sha256":"2f8441c5333388f988260bc996e8f69facb743257a13888940aa81816adbe480","abstract_canon_sha256":"a51bbffa834622a529fa9f61f1bd19ae62f3c60bce26fd8cd30938ecaaf3b317"},"schema_version":"1.0"},"canonical_sha256":"b98dca6c87b4a5fab5b8b6fd0c032c635423394c8653f6b15b7f7885a235d528","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:05.843205Z","signature_b64":"mx+aCEA2Gl8KBMoRgunvuX/tYE3PWFdxbIu7SIOvuaL/pBsLvUMgrkIbfM3S5BzhyV3sijl/3YDDvInBMMvAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b98dca6c87b4a5fab5b8b6fd0c032c635423394c8653f6b15b7f7885a235d528","last_reissued_at":"2026-05-17T23:54:05.842749Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:05.842749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.04813","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-05-17T23:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfUF2P03vIC5V3JFx/HRLTI3BPWciiU2SLBF2LIz97ZVTyYiZSM9yQ+g2nZJizeDdMMpA6k/I7P0M7pv1ZztBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:56:38.234994Z"},"content_sha256":"7717d823936d947ede9b79e8886f12d77fb1acf5d285068166eb33978c9c3b97","schema_version":"1.0","event_id":"sha256:7717d823936d947ede9b79e8886f12d77fb1acf5d285068166eb33978c9c3b97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XGG4U3EHWSS7VNNYW36QYAZMMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bound Convex Programs for Exact Sparse Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Philippe Chancelier (CERMICS), Michel de Lara (CERMICS), Ponts Paristech","submitted_at":"2019-02-13T09:46:52Z","abstract_excerpt":"In exact sparse optimization problems on Rd (also known as sparsity constrained problems), one looks for solution that have few nonzero components. In this paper, we consider problems where sparsity is exactly measured either by the nonconvex l0 pseudonorm (and not by substitute penalty terms) or by the belonging of the solution to a finite union of subsets. Due to the combinatorial nature of the sparsity constraint, such problems do not generally display convexity properties, even if the criterion to minimize is convex. In the most common approach to tackle them, one replaces the sparsity con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04813","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":""},"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-05-17T23:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/R0PZhqsA6xBcyJY0Hu4N4FkbFJeWl4n2o8Ka1SLMtATlzBVCOBuGrjJahZBqujP4YGhoGcwFqpiQo0DE7KDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:56:38.235828Z"},"content_sha256":"cea1a9054889b2abbbeae832b45484dd11b0438321fccc8fe89a6f74146dd79c","schema_version":"1.0","event_id":"sha256:cea1a9054889b2abbbeae832b45484dd11b0438321fccc8fe89a6f74146dd79c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGG4U3EHWSS7VNNYW36QYAZMMN/bundle.json","state_url":"https://pith.science/pith/XGG4U3EHWSS7VNNYW36QYAZMMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGG4U3EHWSS7VNNYW36QYAZMMN/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-05-30T10:56:38Z","links":{"resolver":"https://pith.science/pith/XGG4U3EHWSS7VNNYW36QYAZMMN","bundle":"https://pith.science/pith/XGG4U3EHWSS7VNNYW36QYAZMMN/bundle.json","state":"https://pith.science/pith/XGG4U3EHWSS7VNNYW36QYAZMMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGG4U3EHWSS7VNNYW36QYAZMMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XGG4U3EHWSS7VNNYW36QYAZMMN","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":"a51bbffa834622a529fa9f61f1bd19ae62f3c60bce26fd8cd30938ecaaf3b317","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-13T09:46:52Z","title_canon_sha256":"2f8441c5333388f988260bc996e8f69facb743257a13888940aa81816adbe480"},"schema_version":"1.0","source":{"id":"1902.04813","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04813","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04813v1","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04813","created_at":"2026-05-17T23:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"XGG4U3EHWSS7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XGG4U3EHWSS7VNNY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XGG4U3EH","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:cea1a9054889b2abbbeae832b45484dd11b0438321fccc8fe89a6f74146dd79c","target":"graph","created_at":"2026-05-17T23:54:05Z","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"},"paper":{"abstract_excerpt":"In exact sparse optimization problems on Rd (also known as sparsity constrained problems), one looks for solution that have few nonzero components. In this paper, we consider problems where sparsity is exactly measured either by the nonconvex l0 pseudonorm (and not by substitute penalty terms) or by the belonging of the solution to a finite union of subsets. Due to the combinatorial nature of the sparsity constraint, such problems do not generally display convexity properties, even if the criterion to minimize is convex. In the most common approach to tackle them, one replaces the sparsity con","authors_text":"Jean-Philippe Chancelier (CERMICS), Michel de Lara (CERMICS), Ponts Paristech","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-13T09:46:52Z","title":"Lower Bound Convex Programs for Exact Sparse Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04813","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:7717d823936d947ede9b79e8886f12d77fb1acf5d285068166eb33978c9c3b97","target":"record","created_at":"2026-05-17T23:54:05Z","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":"a51bbffa834622a529fa9f61f1bd19ae62f3c60bce26fd8cd30938ecaaf3b317","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-13T09:46:52Z","title_canon_sha256":"2f8441c5333388f988260bc996e8f69facb743257a13888940aa81816adbe480"},"schema_version":"1.0","source":{"id":"1902.04813","kind":"arxiv","version":1}},"canonical_sha256":"b98dca6c87b4a5fab5b8b6fd0c032c635423394c8653f6b15b7f7885a235d528","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b98dca6c87b4a5fab5b8b6fd0c032c635423394c8653f6b15b7f7885a235d528","first_computed_at":"2026-05-17T23:54:05.842749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:05.842749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mx+aCEA2Gl8KBMoRgunvuX/tYE3PWFdxbIu7SIOvuaL/pBsLvUMgrkIbfM3S5BzhyV3sijl/3YDDvInBMMvAAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:05.843205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04813","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7717d823936d947ede9b79e8886f12d77fb1acf5d285068166eb33978c9c3b97","sha256:cea1a9054889b2abbbeae832b45484dd11b0438321fccc8fe89a6f74146dd79c"],"state_sha256":"c85e58376828bdab8503989987a614bf5d4201b1396cbdbfbc4b656ea505e244"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/J1M249MBa8ZjESWA22pLR/xGhHncaN0jH3Mov1oyAYBHTzsmxVO23OyfCGnj03lrtT8x8JMFa7+F6Tx4T1jDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:56:38.240497Z","bundle_sha256":"d850cfce5af612b7f2ead85a747f98c6c726d1e4f62da48d142fa41ccf955a16"}}