{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O5YFNEHICDY3XI5DHSCE5CURQP","short_pith_number":"pith:O5YFNEHI","canonical_record":{"source":{"id":"1112.6272","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-29T11:07:58Z","cross_cats_sorted":[],"title_canon_sha256":"15e87fbdcec3de8aba73760ed52ee3962e6a30c6cfdc1b02e992993918869df9","abstract_canon_sha256":"6635af8c121761c54d062a3b84991774dd514176a473ef559995f4fedde0d870"},"schema_version":"1.0"},"canonical_sha256":"77705690e810f1bba3a33c844e8a9183fd22adcacd02319461570a293f3249e8","source":{"kind":"arxiv","id":"1112.6272","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6272","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6272v4","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6272","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"O5YFNEHICDY3","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O5YFNEHICDY3XI5D","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O5YFNEHI","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O5YFNEHICDY3XI5DHSCE5CURQP","target":"record","payload":{"canonical_record":{"source":{"id":"1112.6272","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-29T11:07:58Z","cross_cats_sorted":[],"title_canon_sha256":"15e87fbdcec3de8aba73760ed52ee3962e6a30c6cfdc1b02e992993918869df9","abstract_canon_sha256":"6635af8c121761c54d062a3b84991774dd514176a473ef559995f4fedde0d870"},"schema_version":"1.0"},"canonical_sha256":"77705690e810f1bba3a33c844e8a9183fd22adcacd02319461570a293f3249e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:06.727339Z","signature_b64":"IRljzTGhDISPP4cPfP7buvXfiGNZbgy12jHU2hlrPupgHljdKOGJTWRysQ6OGNHz1aS4bzxT7OHZcBK4UpazBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77705690e810f1bba3a33c844e8a9183fd22adcacd02319461570a293f3249e8","last_reissued_at":"2026-05-18T03:15:06.726565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:06.726565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.6272","source_version":4,"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-18T03:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qx3xw0BI2Mc6Pvcp7K9WHi6jdOpIWl38+vlaUmrfRm/HlS8WTuyhXEwK1+idVkAt6ooH38zzbJ+eds9TlzQKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T08:49:20.835872Z"},"content_sha256":"a420f5686869563633e3a7bdefc111678b210dbd163d9c9706e0da2db2c85c71","schema_version":"1.0","event_id":"sha256:a420f5686869563633e3a7bdefc111678b210dbd163d9c9706e0da2db2c85c71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O5YFNEHICDY3XI5DHSCE5CURQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Majorize-Minimize subspace approach for l2-l0 image regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anna Jezierska, Emilie Chouzenoux, Hugues Talbot, Jean-Christophe Pesquet","submitted_at":"2011-12-29T11:07:58Z","abstract_excerpt":"In this work, we consider a class of differentiable criteria for sparse image computing problems, where a nonconvex regularization is applied to an arbitrary linear transform of the target image. As special cases, it includes edge-preserving measures or frame-analysis potentials commonly used in image processing. As shown by our asymptotic results, the l2-l0 penalties we consider may be employed to provide approximate solutions to l0-penalized optimization problems. One of the advantages of the proposed approach is that it allows us to derive an efficient Majorize-Minimize subspace algorithm. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6272","kind":"arxiv","version":4},"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-18T03:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHGiN60wHaACg3WHr/lQ/SCpHA0zVYahySlIw37iaaBrae5y+NilkxzNJn+SxeT7KJcM95D8JPzINWqtVvdGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T08:49:20.836347Z"},"content_sha256":"ab6ecc8195a896363df9388d148ccd355eb8d1f6121d878992e4178950a8c270","schema_version":"1.0","event_id":"sha256:ab6ecc8195a896363df9388d148ccd355eb8d1f6121d878992e4178950a8c270"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5YFNEHICDY3XI5DHSCE5CURQP/bundle.json","state_url":"https://pith.science/pith/O5YFNEHICDY3XI5DHSCE5CURQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5YFNEHICDY3XI5DHSCE5CURQP/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-24T08:49:20Z","links":{"resolver":"https://pith.science/pith/O5YFNEHICDY3XI5DHSCE5CURQP","bundle":"https://pith.science/pith/O5YFNEHICDY3XI5DHSCE5CURQP/bundle.json","state":"https://pith.science/pith/O5YFNEHICDY3XI5DHSCE5CURQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5YFNEHICDY3XI5DHSCE5CURQP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O5YFNEHICDY3XI5DHSCE5CURQP","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":"6635af8c121761c54d062a3b84991774dd514176a473ef559995f4fedde0d870","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-29T11:07:58Z","title_canon_sha256":"15e87fbdcec3de8aba73760ed52ee3962e6a30c6cfdc1b02e992993918869df9"},"schema_version":"1.0","source":{"id":"1112.6272","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6272","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6272v4","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6272","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"O5YFNEHICDY3","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O5YFNEHICDY3XI5D","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O5YFNEHI","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:ab6ecc8195a896363df9388d148ccd355eb8d1f6121d878992e4178950a8c270","target":"graph","created_at":"2026-05-18T03:15:06Z","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 this work, we consider a class of differentiable criteria for sparse image computing problems, where a nonconvex regularization is applied to an arbitrary linear transform of the target image. As special cases, it includes edge-preserving measures or frame-analysis potentials commonly used in image processing. As shown by our asymptotic results, the l2-l0 penalties we consider may be employed to provide approximate solutions to l0-penalized optimization problems. One of the advantages of the proposed approach is that it allows us to derive an efficient Majorize-Minimize subspace algorithm. ","authors_text":"Anna Jezierska, Emilie Chouzenoux, Hugues Talbot, Jean-Christophe Pesquet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-29T11:07:58Z","title":"A Majorize-Minimize subspace approach for l2-l0 image regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6272","kind":"arxiv","version":4},"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:a420f5686869563633e3a7bdefc111678b210dbd163d9c9706e0da2db2c85c71","target":"record","created_at":"2026-05-18T03:15:06Z","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":"6635af8c121761c54d062a3b84991774dd514176a473ef559995f4fedde0d870","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-29T11:07:58Z","title_canon_sha256":"15e87fbdcec3de8aba73760ed52ee3962e6a30c6cfdc1b02e992993918869df9"},"schema_version":"1.0","source":{"id":"1112.6272","kind":"arxiv","version":4}},"canonical_sha256":"77705690e810f1bba3a33c844e8a9183fd22adcacd02319461570a293f3249e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77705690e810f1bba3a33c844e8a9183fd22adcacd02319461570a293f3249e8","first_computed_at":"2026-05-18T03:15:06.726565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:06.726565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IRljzTGhDISPP4cPfP7buvXfiGNZbgy12jHU2hlrPupgHljdKOGJTWRysQ6OGNHz1aS4bzxT7OHZcBK4UpazBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:06.727339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.6272","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a420f5686869563633e3a7bdefc111678b210dbd163d9c9706e0da2db2c85c71","sha256:ab6ecc8195a896363df9388d148ccd355eb8d1f6121d878992e4178950a8c270"],"state_sha256":"35c4202676e3bf666c45b7af2350fb349b12108c1cef0a071c17dca769da8bb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdUdUUq47BFCBetgSW58QGl2+WTcwVC7siDNGPjjcoeJXnYrj1ThutQMSdQZivKfKg3YVGSWaS0FWkf3IM2zDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T08:49:20.839573Z","bundle_sha256":"7e5b26965bdca5a38a32768ae4df482627efcdbafdd2459bc033a529d7d9e2e3"}}