{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:YDGUMKTIROYLOB2DFNXBBJH74U","short_pith_number":"pith:YDGUMKTI","schema_version":"1.0","canonical_sha256":"c0cd462a688bb0b707432b6e10a4ffe51110a70026faa1bc645efc6b246240ed","source":{"kind":"arxiv","id":"0804.0041","version":1},"attestation_state":"computed","paper":{"title":"On the reconstruction of block-sparse signals with an optimal number of measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, Farzad Parvaresh, Mihailo Stojnic","submitted_at":"2008-03-31T23:00:33Z","abstract_excerpt":"Let A be an M by N matrix (M < N) which is an instance of a real random Gaussian ensemble. In compressed sensing we are interested in finding the sparsest solution to the system of equations A x = y for a given y. In general, whenever the sparsity of x is smaller than half the dimension of y then with overwhelming probability over A the sparsest solution is unique and can be found by an exhaustive search over x with an exponential time complexity for any y. The recent work of Cand\\'es, Donoho, and Tao shows that minimization of the L_1 norm of x subject to A x = y results in the sparsest solut"},"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":"0804.0041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-31T23:00:33Z","cross_cats_sorted":["cs.NA","math.IT"],"title_canon_sha256":"9034fed062f67c5901d83f15ea116cbbdd0bfb94287ddbbaddb127bc2b615e2c","abstract_canon_sha256":"92cb723b19674f372b8c144603b99b4442f44a17c8ca648da786dc9955b07e90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:16.504695Z","signature_b64":"WJJ65TDloQ1fUnlCFhFBBfL3OGe0EI8zjYOcbJn7NuOju5TBr11udeoncWZVOMDHdn5IGsA2xp4lOjjoYLhtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0cd462a688bb0b707432b6e10a4ffe51110a70026faa1bc645efc6b246240ed","last_reissued_at":"2026-05-18T04:27:16.504035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:16.504035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the reconstruction of block-sparse signals with an optimal number of measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, Farzad Parvaresh, Mihailo Stojnic","submitted_at":"2008-03-31T23:00:33Z","abstract_excerpt":"Let A be an M by N matrix (M < N) which is an instance of a real random Gaussian ensemble. In compressed sensing we are interested in finding the sparsest solution to the system of equations A x = y for a given y. In general, whenever the sparsity of x is smaller than half the dimension of y then with overwhelming probability over A the sparsest solution is unique and can be found by an exhaustive search over x with an exponential time complexity for any y. The recent work of Cand\\'es, Donoho, and Tao shows that minimization of the L_1 norm of x subject to A x = y results in the sparsest solut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.0041","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":"0804.0041","created_at":"2026-05-18T04:27:16.504136+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.0041v1","created_at":"2026-05-18T04:27:16.504136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.0041","created_at":"2026-05-18T04:27:16.504136+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDGUMKTIROYL","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDGUMKTIROYLOB2D","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDGUMKTI","created_at":"2026-05-18T12:25:58.018023+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/YDGUMKTIROYLOB2DFNXBBJH74U","json":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U.json","graph_json":"https://pith.science/api/pith-number/YDGUMKTIROYLOB2DFNXBBJH74U/graph.json","events_json":"https://pith.science/api/pith-number/YDGUMKTIROYLOB2DFNXBBJH74U/events.json","paper":"https://pith.science/paper/YDGUMKTI"},"agent_actions":{"view_html":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U","download_json":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U.json","view_paper":"https://pith.science/paper/YDGUMKTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.0041&json=true","fetch_graph":"https://pith.science/api/pith-number/YDGUMKTIROYLOB2DFNXBBJH74U/graph.json","fetch_events":"https://pith.science/api/pith-number/YDGUMKTIROYLOB2DFNXBBJH74U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U/action/storage_attestation","attest_author":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U/action/author_attestation","sign_citation":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U/action/citation_signature","submit_replication":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U/action/replication_record"}},"created_at":"2026-05-18T04:27:16.504136+00:00","updated_at":"2026-05-18T04:27:16.504136+00:00"}