{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QUYU3SGQHTPN2VXC5YBFPR7F3I","short_pith_number":"pith:QUYU3SGQ","canonical_record":{"source":{"id":"1207.2456","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2012-07-10T19:56:43Z","cross_cats_sorted":[],"title_canon_sha256":"8e7f9088578730747b847e95bc5926c6ed0982c3b0819b2df7bd73937c05cfe4","abstract_canon_sha256":"b93e1b14b7ebf1457de536849af7fd5a426959dfa0cabace9aef9849e39dfa1c"},"schema_version":"1.0"},"canonical_sha256":"85314dc8d03cdedd56e2ee0257c7e5da0beab81d82c5fd38f3360703cacb3b7c","source":{"kind":"arxiv","id":"1207.2456","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2456","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2456v2","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2456","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"QUYU3SGQHTPN","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QUYU3SGQHTPN2VXC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QUYU3SGQ","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QUYU3SGQHTPN2VXC5YBFPR7F3I","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2456","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2012-07-10T19:56:43Z","cross_cats_sorted":[],"title_canon_sha256":"8e7f9088578730747b847e95bc5926c6ed0982c3b0819b2df7bd73937c05cfe4","abstract_canon_sha256":"b93e1b14b7ebf1457de536849af7fd5a426959dfa0cabace9aef9849e39dfa1c"},"schema_version":"1.0"},"canonical_sha256":"85314dc8d03cdedd56e2ee0257c7e5da0beab81d82c5fd38f3360703cacb3b7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:22.190739Z","signature_b64":"OwS8av6jjxj3Q3txlH8skXi7nvwzY56MP8qkGwxK24RzlM3vaxUJ2n3FKm/Z+QQWrJg4WGerWUonIjp/0zCUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85314dc8d03cdedd56e2ee0257c7e5da0beab81d82c5fd38f3360703cacb3b7c","last_reissued_at":"2026-05-18T03:03:22.190102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:22.190102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2456","source_version":2,"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:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQB99hrX2Uw4wPZi4GVCcz/DI8k9bL+SkwIVaGiolUlGz+WmyRRWplC+YtcR9nURwBDVRzsG4RFJplk2ZypJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:39:43.690884Z"},"content_sha256":"a24ee59e90e20419a3c0885fa14bf5a69afe89f19ec797c3075641722ece8c33","schema_version":"1.0","event_id":"sha256:a24ee59e90e20419a3c0885fa14bf5a69afe89f19ec797c3075641722ece8c33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QUYU3SGQHTPN2VXC5YBFPR7F3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy-Like Algorithms for the Cosparse Analysis Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"INRIA - IRISA), Michael Elad, Mike E. Davies, Raja Giryes, R\\'emi Gribonval (INRIA - IRISA, Sangnam Nam (INRIA - IRISA)","submitted_at":"2012-07-10T19:56:43Z","abstract_excerpt":"The cosparse analysis model has been introduced recently as an interesting alternative to the standard sparse synthesis approach. A prominent question brought up by this new construction is the analysis pursuit problem -- the need to find a signal belonging to this model, given a set of corrupted measurements of it. Several pursuit methods have already been proposed based on $\\ell_1$ relaxation and a greedy approach. In this work we pursue this question further, and propose a new family of pursuit algorithms for the cosparse analysis model, mimicking the greedy-like methods -- compressive samp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2456","kind":"arxiv","version":2},"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:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqtHd6R7KHAuT74tp4QTFL2VoafS8lIqf3cwBLO+9dMOm80iWRjr2WqN+45K+CtzY4Dgbo66sYeEPFvj69BxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:39:43.691500Z"},"content_sha256":"5b433a988684b12b493a1d58c86eb9afcefd5499609dc492c170d5ecc2fba40b","schema_version":"1.0","event_id":"sha256:5b433a988684b12b493a1d58c86eb9afcefd5499609dc492c170d5ecc2fba40b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/bundle.json","state_url":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/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-27T10:39:43Z","links":{"resolver":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I","bundle":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/bundle.json","state":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QUYU3SGQHTPN2VXC5YBFPR7F3I","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":"b93e1b14b7ebf1457de536849af7fd5a426959dfa0cabace9aef9849e39dfa1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2012-07-10T19:56:43Z","title_canon_sha256":"8e7f9088578730747b847e95bc5926c6ed0982c3b0819b2df7bd73937c05cfe4"},"schema_version":"1.0","source":{"id":"1207.2456","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2456","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2456v2","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2456","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"QUYU3SGQHTPN","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QUYU3SGQHTPN2VXC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QUYU3SGQ","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:5b433a988684b12b493a1d58c86eb9afcefd5499609dc492c170d5ecc2fba40b","target":"graph","created_at":"2026-05-18T03:03:22Z","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":"The cosparse analysis model has been introduced recently as an interesting alternative to the standard sparse synthesis approach. A prominent question brought up by this new construction is the analysis pursuit problem -- the need to find a signal belonging to this model, given a set of corrupted measurements of it. Several pursuit methods have already been proposed based on $\\ell_1$ relaxation and a greedy approach. In this work we pursue this question further, and propose a new family of pursuit algorithms for the cosparse analysis model, mimicking the greedy-like methods -- compressive samp","authors_text":"INRIA - IRISA), Michael Elad, Mike E. Davies, Raja Giryes, R\\'emi Gribonval (INRIA - IRISA, Sangnam Nam (INRIA - IRISA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2012-07-10T19:56:43Z","title":"Greedy-Like Algorithms for the Cosparse Analysis Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2456","kind":"arxiv","version":2},"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:a24ee59e90e20419a3c0885fa14bf5a69afe89f19ec797c3075641722ece8c33","target":"record","created_at":"2026-05-18T03:03:22Z","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":"b93e1b14b7ebf1457de536849af7fd5a426959dfa0cabace9aef9849e39dfa1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2012-07-10T19:56:43Z","title_canon_sha256":"8e7f9088578730747b847e95bc5926c6ed0982c3b0819b2df7bd73937c05cfe4"},"schema_version":"1.0","source":{"id":"1207.2456","kind":"arxiv","version":2}},"canonical_sha256":"85314dc8d03cdedd56e2ee0257c7e5da0beab81d82c5fd38f3360703cacb3b7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85314dc8d03cdedd56e2ee0257c7e5da0beab81d82c5fd38f3360703cacb3b7c","first_computed_at":"2026-05-18T03:03:22.190102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:22.190102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OwS8av6jjxj3Q3txlH8skXi7nvwzY56MP8qkGwxK24RzlM3vaxUJ2n3FKm/Z+QQWrJg4WGerWUonIjp/0zCUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:22.190739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2456","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a24ee59e90e20419a3c0885fa14bf5a69afe89f19ec797c3075641722ece8c33","sha256:5b433a988684b12b493a1d58c86eb9afcefd5499609dc492c170d5ecc2fba40b"],"state_sha256":"4f8a1246395c6f46342c7c96468ddc5890385f1672f3aa16b1c4ab5455c0a9ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACOl7HjeOEKDz9arn6CSPSEJPhKrNmL5EbAJmYmNhNulPvrS362ZfkJN4MSFMnrgXM84XG0KWGVE/W3MYZ7TCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:39:43.695034Z","bundle_sha256":"9bbc8e8aae78edf2ad83fbb26daff2bf5b2718dd8ddf96e9085b65cf4b80faee"}}