{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:N4PKSFCGKASB44FZ3BYQZTZ7C5","short_pith_number":"pith:N4PKSFCG","schema_version":"1.0","canonical_sha256":"6f1ea9144650241e70b9d8710ccf3f177d23f048fc5e7cf0f89a5089f4eeebfb","source":{"kind":"arxiv","id":"1301.0878","version":2},"attestation_state":"computed","paper":{"title":"Fast and RIP-optimal transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NA","authors_text":"Holger Rauhut, Nir Ailon","submitted_at":"2013-01-05T07:39:15Z","abstract_excerpt":"We study constructions of $k \\times n$ matrices $A$ that both (1) satisfy the restricted isometry property (RIP) at sparsity $s$ with optimal parameters, and (2) are efficient in the sense that only $O(n\\log n)$ operations are required to compute $Ax$ given a vector $x$. Our construction is based on repeated application of independent transformations of the form $DH$, where $H$ is a Hadamard or Fourier transform and $D$ is a diagonal matrix with random $\\{+1,-1\\}$ elements on the diagonal, followed by any $k \\times n$ matrix of orthonormal rows (e.g.\\ selection of $k$ coordinates). We provide "},"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":"1301.0878","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-01-05T07:39:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"739db02678d4f479aee2b07e2ac4ee48606c3a7fd101ecc33a94d486774ac7ac","abstract_canon_sha256":"1dba1c9365411e7f68e462bbf9f17ec213668d571031854330144e6ebfa7c7b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:25.276984Z","signature_b64":"m+3zBqaTS+VNcREExTu63LzqlieO5GzOg/Nx3wQceUAb28L/7oJki7TWB7DZpFAVh0/u+shBteKr9n0S/rPyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1ea9144650241e70b9d8710ccf3f177d23f048fc5e7cf0f89a5089f4eeebfb","last_reissued_at":"2026-05-18T03:33:25.276436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:25.276436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and RIP-optimal transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NA","authors_text":"Holger Rauhut, Nir Ailon","submitted_at":"2013-01-05T07:39:15Z","abstract_excerpt":"We study constructions of $k \\times n$ matrices $A$ that both (1) satisfy the restricted isometry property (RIP) at sparsity $s$ with optimal parameters, and (2) are efficient in the sense that only $O(n\\log n)$ operations are required to compute $Ax$ given a vector $x$. Our construction is based on repeated application of independent transformations of the form $DH$, where $H$ is a Hadamard or Fourier transform and $D$ is a diagonal matrix with random $\\{+1,-1\\}$ elements on the diagonal, followed by any $k \\times n$ matrix of orthonormal rows (e.g.\\ selection of $k$ coordinates). We provide "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0878","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":"1301.0878","created_at":"2026-05-18T03:33:25.276508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0878v2","created_at":"2026-05-18T03:33:25.276508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0878","created_at":"2026-05-18T03:33:25.276508+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4PKSFCGKASB","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4PKSFCGKASB44FZ","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4PKSFCG","created_at":"2026-05-18T12:27:52.871228+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/N4PKSFCGKASB44FZ3BYQZTZ7C5","json":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5.json","graph_json":"https://pith.science/api/pith-number/N4PKSFCGKASB44FZ3BYQZTZ7C5/graph.json","events_json":"https://pith.science/api/pith-number/N4PKSFCGKASB44FZ3BYQZTZ7C5/events.json","paper":"https://pith.science/paper/N4PKSFCG"},"agent_actions":{"view_html":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5","download_json":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5.json","view_paper":"https://pith.science/paper/N4PKSFCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0878&json=true","fetch_graph":"https://pith.science/api/pith-number/N4PKSFCGKASB44FZ3BYQZTZ7C5/graph.json","fetch_events":"https://pith.science/api/pith-number/N4PKSFCGKASB44FZ3BYQZTZ7C5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/action/storage_attestation","attest_author":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/action/author_attestation","sign_citation":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/action/citation_signature","submit_replication":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/action/replication_record"}},"created_at":"2026-05-18T03:33:25.276508+00:00","updated_at":"2026-05-18T03:33:25.276508+00:00"}