{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:262N5FQT7BOSUGSGQSJ7JJ7ERC","short_pith_number":"pith:262N5FQT","schema_version":"1.0","canonical_sha256":"d7b4de9613f85d2a1a468493f4a7e488ac49d4d8f9c5c6bc35baeaa7f8e26a93","source":{"kind":"arxiv","id":"1211.0986","version":1},"attestation_state":"computed","paper":{"title":"New constructions of RIP matrices with fast multiplication and fewer rows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"cs.DS","authors_text":"Eric Price, Jelani Nelson, Mary Wootters","submitted_at":"2012-11-05T19:58:27Z","abstract_excerpt":"In compressed sensing, the \"restricted isometry property\" (RIP) is a sufficient condition for the efficient reconstruction of a nearly k-sparse vector x in C^d from m linear measurements Phi x. It is desirable for m to be small, and for Phi to support fast matrix-vector multiplication. In this work, we give a randomized construction of RIP matrices Phi in C^{m x d}, preserving the L_2 norms of all k-sparse vectors with distortion 1+eps, where the matrix-vector multiply Phi x can be computed in nearly linear time. The number of rows m is on the order of eps^{-2}klog dlog^2(klog d). Previous ana"},"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":"1211.0986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-05T19:58:27Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"d6cc512b60ddcab6ee3e545b0b31c241cca89732e59c3324d1ebd3f7d133c72f","abstract_canon_sha256":"6bc152b47ee00fbb41ef13841e482c4458c26018faff868310e3d17e29fbb4dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:28.798514Z","signature_b64":"f+v5NUHQAXWMPBTSAS+f+4A/ujhA4lsUotuXdu2P4IeKAtj2nxyotP39pogqQCYUcqRhvRmpQFgwx/G2J3NgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7b4de9613f85d2a1a468493f4a7e488ac49d4d8f9c5c6bc35baeaa7f8e26a93","last_reissued_at":"2026-05-18T03:41:28.797865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:28.797865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New constructions of RIP matrices with fast multiplication and fewer rows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"cs.DS","authors_text":"Eric Price, Jelani Nelson, Mary Wootters","submitted_at":"2012-11-05T19:58:27Z","abstract_excerpt":"In compressed sensing, the \"restricted isometry property\" (RIP) is a sufficient condition for the efficient reconstruction of a nearly k-sparse vector x in C^d from m linear measurements Phi x. It is desirable for m to be small, and for Phi to support fast matrix-vector multiplication. In this work, we give a randomized construction of RIP matrices Phi in C^{m x d}, preserving the L_2 norms of all k-sparse vectors with distortion 1+eps, where the matrix-vector multiply Phi x can be computed in nearly linear time. The number of rows m is on the order of eps^{-2}klog dlog^2(klog d). Previous ana"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0986","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":"1211.0986","created_at":"2026-05-18T03:41:28.797956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0986v1","created_at":"2026-05-18T03:41:28.797956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0986","created_at":"2026-05-18T03:41:28.797956+00:00"},{"alias_kind":"pith_short_12","alias_value":"262N5FQT7BOS","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"262N5FQT7BOSUGSG","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"262N5FQT","created_at":"2026-05-18T12:26:50.516681+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/262N5FQT7BOSUGSGQSJ7JJ7ERC","json":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC.json","graph_json":"https://pith.science/api/pith-number/262N5FQT7BOSUGSGQSJ7JJ7ERC/graph.json","events_json":"https://pith.science/api/pith-number/262N5FQT7BOSUGSGQSJ7JJ7ERC/events.json","paper":"https://pith.science/paper/262N5FQT"},"agent_actions":{"view_html":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC","download_json":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC.json","view_paper":"https://pith.science/paper/262N5FQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0986&json=true","fetch_graph":"https://pith.science/api/pith-number/262N5FQT7BOSUGSGQSJ7JJ7ERC/graph.json","fetch_events":"https://pith.science/api/pith-number/262N5FQT7BOSUGSGQSJ7JJ7ERC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/action/storage_attestation","attest_author":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/action/author_attestation","sign_citation":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/action/citation_signature","submit_replication":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/action/replication_record"}},"created_at":"2026-05-18T03:41:28.797956+00:00","updated_at":"2026-05-18T03:41:28.797956+00:00"}