{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:V37VJOSPUW5I2KAW6BOZN4OVCX","short_pith_number":"pith:V37VJOSP","schema_version":"1.0","canonical_sha256":"aeff54ba4fa5ba8d2816f05d96f1d515e96dcb46a188751debb23602e8211e42","source":{"kind":"arxiv","id":"math/0701131","version":2},"attestation_state":"computed","paper":{"title":"Compressed Sensing and Redundant Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.PR","authors_text":"Holger Rauhut, Karin Schnass, Pierre Vandergheynst","submitted_at":"2007-01-04T09:13:40Z","abstract_excerpt":"This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministic dictionary, has small restricted isometry constants. Thus, signals that are sparse with respect to the dictionary can be recovered via Basis Pursuit from a small number of random measurements. Further, thresholding is investigated as recovery algorithm for compressed sensing and conditions are provided that guarantee reconstruction with high pro"},"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":"math/0701131","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-01-04T09:13:40Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"97cf66519f59b2b3b43c44831adac61c4434e39113790f3bc28aa3a7c596a115","abstract_canon_sha256":"ed9e525764f757de308c07d04db129b40d72ffd72daea11776ac1a4d68212073"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:42.381027Z","signature_b64":"QUKxciOlaQlQi46f+XhVw9lSNyHE0iPGe/w9j9wYXU7IJqkmaQeS5NQKSMjlUszAUKQh/y48jfqWkPFFxf9/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeff54ba4fa5ba8d2816f05d96f1d515e96dcb46a188751debb23602e8211e42","last_reissued_at":"2026-05-18T04:36:42.380149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:42.380149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Sensing and Redundant Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.PR","authors_text":"Holger Rauhut, Karin Schnass, Pierre Vandergheynst","submitted_at":"2007-01-04T09:13:40Z","abstract_excerpt":"This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministic dictionary, has small restricted isometry constants. Thus, signals that are sparse with respect to the dictionary can be recovered via Basis Pursuit from a small number of random measurements. Further, thresholding is investigated as recovery algorithm for compressed sensing and conditions are provided that guarantee reconstruction with high pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0701131","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":"math/0701131","created_at":"2026-05-18T04:36:42.380217+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0701131v2","created_at":"2026-05-18T04:36:42.380217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0701131","created_at":"2026-05-18T04:36:42.380217+00:00"},{"alias_kind":"pith_short_12","alias_value":"V37VJOSPUW5I","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"V37VJOSPUW5I2KAW","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"V37VJOSP","created_at":"2026-05-18T12:25:56.245647+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/V37VJOSPUW5I2KAW6BOZN4OVCX","json":"https://pith.science/pith/V37VJOSPUW5I2KAW6BOZN4OVCX.json","graph_json":"https://pith.science/api/pith-number/V37VJOSPUW5I2KAW6BOZN4OVCX/graph.json","events_json":"https://pith.science/api/pith-number/V37VJOSPUW5I2KAW6BOZN4OVCX/events.json","paper":"https://pith.science/paper/V37VJOSP"},"agent_actions":{"view_html":"https://pith.science/pith/V37VJOSPUW5I2KAW6BOZN4OVCX","download_json":"https://pith.science/pith/V37VJOSPUW5I2KAW6BOZN4OVCX.json","view_paper":"https://pith.science/paper/V37VJOSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0701131&json=true","fetch_graph":"https://pith.science/api/pith-number/V37VJOSPUW5I2KAW6BOZN4OVCX/graph.json","fetch_events":"https://pith.science/api/pith-number/V37VJOSPUW5I2KAW6BOZN4OVCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V37VJOSPUW5I2KAW6BOZN4OVCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V37VJOSPUW5I2KAW6BOZN4OVCX/action/storage_attestation","attest_author":"https://pith.science/pith/V37VJOSPUW5I2KAW6BOZN4OVCX/action/author_attestation","sign_citation":"https://pith.science/pith/V37VJOSPUW5I2KAW6BOZN4OVCX/action/citation_signature","submit_replication":"https://pith.science/pith/V37VJOSPUW5I2KAW6BOZN4OVCX/action/replication_record"}},"created_at":"2026-05-18T04:36:42.380217+00:00","updated_at":"2026-05-18T04:36:42.380217+00:00"}