{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QUYU3SGQHTPN2VXC5YBFPR7F3I","short_pith_number":"pith:QUYU3SGQ","schema_version":"1.0","canonical_sha256":"85314dc8d03cdedd56e2ee0257c7e5da0beab81d82c5fd38f3360703cacb3b7c","source":{"kind":"arxiv","id":"1207.2456","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.2456","created_at":"2026-05-18T03:03:22.190196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2456v2","created_at":"2026-05-18T03:03:22.190196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2456","created_at":"2026-05-18T03:03:22.190196+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUYU3SGQHTPN","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUYU3SGQHTPN2VXC","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUYU3SGQ","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I","json":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I.json","graph_json":"https://pith.science/api/pith-number/QUYU3SGQHTPN2VXC5YBFPR7F3I/graph.json","events_json":"https://pith.science/api/pith-number/QUYU3SGQHTPN2VXC5YBFPR7F3I/events.json","paper":"https://pith.science/paper/QUYU3SGQ"},"agent_actions":{"view_html":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I","download_json":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I.json","view_paper":"https://pith.science/paper/QUYU3SGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2456&json=true","fetch_graph":"https://pith.science/api/pith-number/QUYU3SGQHTPN2VXC5YBFPR7F3I/graph.json","fetch_events":"https://pith.science/api/pith-number/QUYU3SGQHTPN2VXC5YBFPR7F3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/action/storage_attestation","attest_author":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/action/author_attestation","sign_citation":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/action/citation_signature","submit_replication":"https://pith.science/pith/QUYU3SGQHTPN2VXC5YBFPR7F3I/action/replication_record"}},"created_at":"2026-05-18T03:03:22.190196+00:00","updated_at":"2026-05-18T03:03:22.190196+00:00"}