{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6OH2HXAXLJKRURYUPSS5KUB5CO","short_pith_number":"pith:6OH2HXAX","canonical_record":{"source":{"id":"1608.04430","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-15T22:46:35Z","cross_cats_sorted":[],"title_canon_sha256":"3a0ea0aa8b9108cb93f9fb64be8231f849f0b96b194a699607c2b1610b34ae22","abstract_canon_sha256":"16747dec49ecdf42747c709f4cdfd4d1660df063c4b94b737aac89f8f31cdd04"},"schema_version":"1.0"},"canonical_sha256":"f38fa3dc175a551a47147ca5d5503d13b97b22e9454d5db38eafb66480a9240e","source":{"kind":"arxiv","id":"1608.04430","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04430","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04430v3","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04430","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"6OH2HXAXLJKR","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6OH2HXAXLJKRURYU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6OH2HXAX","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6OH2HXAXLJKRURYUPSS5KUB5CO","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04430","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-15T22:46:35Z","cross_cats_sorted":[],"title_canon_sha256":"3a0ea0aa8b9108cb93f9fb64be8231f849f0b96b194a699607c2b1610b34ae22","abstract_canon_sha256":"16747dec49ecdf42747c709f4cdfd4d1660df063c4b94b737aac89f8f31cdd04"},"schema_version":"1.0"},"canonical_sha256":"f38fa3dc175a551a47147ca5d5503d13b97b22e9454d5db38eafb66480a9240e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:19.773954Z","signature_b64":"vBHtY+uw7Ju5vY4mgSivR+MAEDoSphxPLunGDsvo2iLgpzBsRJQFI4DLyi1YPt65ubxJbbBep6Gxo3Iq9I7jAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f38fa3dc175a551a47147ca5d5503d13b97b22e9454d5db38eafb66480a9240e","last_reissued_at":"2026-05-17T23:57:19.773275Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:19.773275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04430","source_version":3,"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:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F29P0+LZVnXv8h2rm507bTPZnoAQu8e6lCjGzc2XPaeXH2eksF3cB/8PjgTxFqRqlXE6kuk/FmASpXqRVDRGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:57:12.480364Z"},"content_sha256":"89ea45dc04274d0f9bc04704a72cbce769e1d6446c3ff2d8b4345cbeb1cb5d15","schema_version":"1.0","event_id":"sha256:89ea45dc04274d0f9bc04704a72cbce769e1d6446c3ff2d8b4345cbeb1cb5d15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6OH2HXAXLJKRURYUPSS5KUB5CO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsity Constrained Minimization via Mathematical Programming with Equilibrium Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bernard Ghanem, Ganzhao Yuan","submitted_at":"2016-08-15T22:46:35Z","abstract_excerpt":"Sparsity constrained minimization captures a wide spectrum of applications in both machine learning and signal processing. This class of problems is difficult to solve since it is NP-hard and existing solutions are primarily based on Iterative Hard Thresholding (IHT). In this paper, we consider a class of continuous optimization techniques based on Mathematical Programs with Equilibrium Constraints (MPECs) to solve general sparsity constrained problems. Specifically, we reformulate the problem as an equivalent biconvex MPEC, which we can solve using an exact penalty method or an alternating di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04430","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":""},"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:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qgRKdFE/8kbHOhYCTaz52fUfLJAGx6IrMAzzBGwSQCAym4e20bHFPdQhVHHBFVeL8QogShNbExpFN7I1wFXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:57:12.481021Z"},"content_sha256":"0a5a711e2cf94d2144df10600c24a8a4076b189c5656cebc07174729b2e9e93d","schema_version":"1.0","event_id":"sha256:0a5a711e2cf94d2144df10600c24a8a4076b189c5656cebc07174729b2e9e93d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OH2HXAXLJKRURYUPSS5KUB5CO/bundle.json","state_url":"https://pith.science/pith/6OH2HXAXLJKRURYUPSS5KUB5CO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OH2HXAXLJKRURYUPSS5KUB5CO/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-30T11:57:12Z","links":{"resolver":"https://pith.science/pith/6OH2HXAXLJKRURYUPSS5KUB5CO","bundle":"https://pith.science/pith/6OH2HXAXLJKRURYUPSS5KUB5CO/bundle.json","state":"https://pith.science/pith/6OH2HXAXLJKRURYUPSS5KUB5CO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OH2HXAXLJKRURYUPSS5KUB5CO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6OH2HXAXLJKRURYUPSS5KUB5CO","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":"16747dec49ecdf42747c709f4cdfd4d1660df063c4b94b737aac89f8f31cdd04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-15T22:46:35Z","title_canon_sha256":"3a0ea0aa8b9108cb93f9fb64be8231f849f0b96b194a699607c2b1610b34ae22"},"schema_version":"1.0","source":{"id":"1608.04430","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04430","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04430v3","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04430","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"6OH2HXAXLJKR","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6OH2HXAXLJKRURYU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6OH2HXAX","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:0a5a711e2cf94d2144df10600c24a8a4076b189c5656cebc07174729b2e9e93d","target":"graph","created_at":"2026-05-17T23:57:19Z","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":"Sparsity constrained minimization captures a wide spectrum of applications in both machine learning and signal processing. This class of problems is difficult to solve since it is NP-hard and existing solutions are primarily based on Iterative Hard Thresholding (IHT). In this paper, we consider a class of continuous optimization techniques based on Mathematical Programs with Equilibrium Constraints (MPECs) to solve general sparsity constrained problems. Specifically, we reformulate the problem as an equivalent biconvex MPEC, which we can solve using an exact penalty method or an alternating di","authors_text":"Bernard Ghanem, Ganzhao Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-15T22:46:35Z","title":"Sparsity Constrained Minimization via Mathematical Programming with Equilibrium Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04430","kind":"arxiv","version":3},"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:89ea45dc04274d0f9bc04704a72cbce769e1d6446c3ff2d8b4345cbeb1cb5d15","target":"record","created_at":"2026-05-17T23:57:19Z","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":"16747dec49ecdf42747c709f4cdfd4d1660df063c4b94b737aac89f8f31cdd04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-15T22:46:35Z","title_canon_sha256":"3a0ea0aa8b9108cb93f9fb64be8231f849f0b96b194a699607c2b1610b34ae22"},"schema_version":"1.0","source":{"id":"1608.04430","kind":"arxiv","version":3}},"canonical_sha256":"f38fa3dc175a551a47147ca5d5503d13b97b22e9454d5db38eafb66480a9240e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f38fa3dc175a551a47147ca5d5503d13b97b22e9454d5db38eafb66480a9240e","first_computed_at":"2026-05-17T23:57:19.773275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:19.773275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vBHtY+uw7Ju5vY4mgSivR+MAEDoSphxPLunGDsvo2iLgpzBsRJQFI4DLyi1YPt65ubxJbbBep6Gxo3Iq9I7jAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:19.773954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04430","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89ea45dc04274d0f9bc04704a72cbce769e1d6446c3ff2d8b4345cbeb1cb5d15","sha256:0a5a711e2cf94d2144df10600c24a8a4076b189c5656cebc07174729b2e9e93d"],"state_sha256":"9e88c5b1a290f0a080fbb416b37963d3320895fed5afce57e3de94c88957b987"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5XcWX27Y3Cpd+FI0nwouOD1DUJlDczBLav71nq+f7KYwEHtUDyaexprcaHF/h1WTHF+8MWBm4FmKmoOMOwNcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:57:12.484443Z","bundle_sha256":"a51a63889f6dc44f10e92d5d3b1bd1ed243b808df697b1fbfc1d7d0b190c8dcd"}}