{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D3YJLBFYJC2N2PPJO3KESFESFU","short_pith_number":"pith:D3YJLBFY","schema_version":"1.0","canonical_sha256":"1ef09584b848b4dd3de976d44914922d34345ec3c04d2e2e95fc8ca823265d65","source":{"kind":"arxiv","id":"1412.6125","version":1},"attestation_state":"computed","paper":{"title":"Matrix Coherency Graph: A Tool for Improving Sparse Coding Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Zaeemzadeh, Mahdi Barzegar Khalilsarai, Mohsen Joneidi, Nazanin Rahnavard","submitted_at":"2014-11-30T08:04:09Z","abstract_excerpt":"Exact recovery of a sparse solution for an underdetermined system of linear equations implies full search among all possible subsets of the dictionary, which is computationally intractable, while l1 minimization will do the job when a Restricted Isometry Property holds for the dictionary. Yet, practical sparse recovery algorithms may fail to recover the vector of coefficients even when the dictionary deviates from the RIP only slightly. To enjoy l1 minimization guarantees in a wider sense, a method based on a combination of full-search and l1 minimization is presented. The idea is based on par"},"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":"1412.6125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-30T08:04:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53a6d3890820ddd60b8749989d06d245ce306e4800e1d123f2560eea841eb430","abstract_canon_sha256":"fa04362f255309ef030d10af7f2de7d062d10fb8a74fabcc91609d3adc406a3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:54.393614Z","signature_b64":"7umB/yRrkJGh4RPYJ8Cc2zA5yE8JyFA5xLSeeNIkHcqeNAZ7++2C36Y8c9vjhnsEn04HOOakfWn3ffxQzoYsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ef09584b848b4dd3de976d44914922d34345ec3c04d2e2e95fc8ca823265d65","last_reissued_at":"2026-05-18T02:30:54.392950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:54.392950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Coherency Graph: A Tool for Improving Sparse Coding Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Zaeemzadeh, Mahdi Barzegar Khalilsarai, Mohsen Joneidi, Nazanin Rahnavard","submitted_at":"2014-11-30T08:04:09Z","abstract_excerpt":"Exact recovery of a sparse solution for an underdetermined system of linear equations implies full search among all possible subsets of the dictionary, which is computationally intractable, while l1 minimization will do the job when a Restricted Isometry Property holds for the dictionary. Yet, practical sparse recovery algorithms may fail to recover the vector of coefficients even when the dictionary deviates from the RIP only slightly. To enjoy l1 minimization guarantees in a wider sense, a method based on a combination of full-search and l1 minimization is presented. The idea is based on par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6125","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.6125","created_at":"2026-05-18T02:30:54.393045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6125v1","created_at":"2026-05-18T02:30:54.393045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6125","created_at":"2026-05-18T02:30:54.393045+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3YJLBFYJC2N","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3YJLBFYJC2N2PPJ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3YJLBFY","created_at":"2026-05-18T12:28:25.294606+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/D3YJLBFYJC2N2PPJO3KESFESFU","json":"https://pith.science/pith/D3YJLBFYJC2N2PPJO3KESFESFU.json","graph_json":"https://pith.science/api/pith-number/D3YJLBFYJC2N2PPJO3KESFESFU/graph.json","events_json":"https://pith.science/api/pith-number/D3YJLBFYJC2N2PPJO3KESFESFU/events.json","paper":"https://pith.science/paper/D3YJLBFY"},"agent_actions":{"view_html":"https://pith.science/pith/D3YJLBFYJC2N2PPJO3KESFESFU","download_json":"https://pith.science/pith/D3YJLBFYJC2N2PPJO3KESFESFU.json","view_paper":"https://pith.science/paper/D3YJLBFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6125&json=true","fetch_graph":"https://pith.science/api/pith-number/D3YJLBFYJC2N2PPJO3KESFESFU/graph.json","fetch_events":"https://pith.science/api/pith-number/D3YJLBFYJC2N2PPJO3KESFESFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3YJLBFYJC2N2PPJO3KESFESFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3YJLBFYJC2N2PPJO3KESFESFU/action/storage_attestation","attest_author":"https://pith.science/pith/D3YJLBFYJC2N2PPJO3KESFESFU/action/author_attestation","sign_citation":"https://pith.science/pith/D3YJLBFYJC2N2PPJO3KESFESFU/action/citation_signature","submit_replication":"https://pith.science/pith/D3YJLBFYJC2N2PPJO3KESFESFU/action/replication_record"}},"created_at":"2026-05-18T02:30:54.393045+00:00","updated_at":"2026-05-18T02:30:54.393045+00:00"}