{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:FQBMJINXXJCVG4HUC3KATXJ7HY","short_pith_number":"pith:FQBMJINX","schema_version":"1.0","canonical_sha256":"2c02c4a1b7ba455370f416d409dd3f3e24536af0d362b9d94d16b5ba67160086","source":{"kind":"arxiv","id":"0910.1943","version":1},"attestation_state":"computed","paper":{"title":"Construction of a Large Class of Deterministic Sensing Matrices that Satisfy a Statistical Isometry Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Robert Calderbank, Sina Jafarpour, Stephen Howard","submitted_at":"2009-10-10T20:39:44Z","abstract_excerpt":"Compressed Sensing aims to capture attributes of $k$-sparse signals using very few measurements. In the standard Compressed Sensing paradigm, the $\\m\\times \\n$ measurement matrix $\\A$ is required to act as a near isometry on the set of all $k$-sparse signals (Restricted Isometry Property or RIP). Although it is known that certain probabilistic processes generate $\\m \\times \\n$ matrices that satisfy RIP with high probability, there is no practical algorithm for verifying whether a given sensing matrix $\\A$ has this property, crucial for the feasibility of the standard recovery algorithms. In co"},"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":"0910.1943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-10T20:39:44Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"0fcbdeff29bb5c7a3b7b9b7341f9bd884edd4525b8f9ba6c96196abb3321a288","abstract_canon_sha256":"607b3561326fdd1135c24d231eae4a7225fc314d7b26ed462e084b69eafb532a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:24.881610Z","signature_b64":"14guMbzJ1kAGySvRfHT9IVouFUDqnOC0S7b6iVfZut4tV7XMoZJJNMxhx8nsfciW3L9d6PCIJybgWixiEATRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c02c4a1b7ba455370f416d409dd3f3e24536af0d362b9d94d16b5ba67160086","last_reissued_at":"2026-05-18T02:11:24.880775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:24.880775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of a Large Class of Deterministic Sensing Matrices that Satisfy a Statistical Isometry Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Robert Calderbank, Sina Jafarpour, Stephen Howard","submitted_at":"2009-10-10T20:39:44Z","abstract_excerpt":"Compressed Sensing aims to capture attributes of $k$-sparse signals using very few measurements. In the standard Compressed Sensing paradigm, the $\\m\\times \\n$ measurement matrix $\\A$ is required to act as a near isometry on the set of all $k$-sparse signals (Restricted Isometry Property or RIP). Although it is known that certain probabilistic processes generate $\\m \\times \\n$ matrices that satisfy RIP with high probability, there is no practical algorithm for verifying whether a given sensing matrix $\\A$ has this property, crucial for the feasibility of the standard recovery algorithms. In co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1943","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":"0910.1943","created_at":"2026-05-18T02:11:24.880903+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.1943v1","created_at":"2026-05-18T02:11:24.880903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1943","created_at":"2026-05-18T02:11:24.880903+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQBMJINXXJCV","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQBMJINXXJCVG4HU","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQBMJINX","created_at":"2026-05-18T12:25:59.703012+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/FQBMJINXXJCVG4HUC3KATXJ7HY","json":"https://pith.science/pith/FQBMJINXXJCVG4HUC3KATXJ7HY.json","graph_json":"https://pith.science/api/pith-number/FQBMJINXXJCVG4HUC3KATXJ7HY/graph.json","events_json":"https://pith.science/api/pith-number/FQBMJINXXJCVG4HUC3KATXJ7HY/events.json","paper":"https://pith.science/paper/FQBMJINX"},"agent_actions":{"view_html":"https://pith.science/pith/FQBMJINXXJCVG4HUC3KATXJ7HY","download_json":"https://pith.science/pith/FQBMJINXXJCVG4HUC3KATXJ7HY.json","view_paper":"https://pith.science/paper/FQBMJINX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.1943&json=true","fetch_graph":"https://pith.science/api/pith-number/FQBMJINXXJCVG4HUC3KATXJ7HY/graph.json","fetch_events":"https://pith.science/api/pith-number/FQBMJINXXJCVG4HUC3KATXJ7HY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQBMJINXXJCVG4HUC3KATXJ7HY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQBMJINXXJCVG4HUC3KATXJ7HY/action/storage_attestation","attest_author":"https://pith.science/pith/FQBMJINXXJCVG4HUC3KATXJ7HY/action/author_attestation","sign_citation":"https://pith.science/pith/FQBMJINXXJCVG4HUC3KATXJ7HY/action/citation_signature","submit_replication":"https://pith.science/pith/FQBMJINXXJCVG4HUC3KATXJ7HY/action/replication_record"}},"created_at":"2026-05-18T02:11:24.880903+00:00","updated_at":"2026-05-18T02:11:24.880903+00:00"}