{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:N4PKSFCGKASB44FZ3BYQZTZ7C5","short_pith_number":"pith:N4PKSFCG","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"},"canonical_sha256":"6f1ea9144650241e70b9d8710ccf3f177d23f048fc5e7cf0f89a5089f4eeebfb","source":{"kind":"arxiv","id":"1301.0878","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0878","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0878v2","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0878","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"pith_short_12","alias_value":"N4PKSFCGKASB","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N4PKSFCGKASB44FZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N4PKSFCG","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:N4PKSFCGKASB44FZ3BYQZTZ7C5","target":"record","payload":{"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"},"canonical_sha256":"6f1ea9144650241e70b9d8710ccf3f177d23f048fc5e7cf0f89a5089f4eeebfb","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"},"source_kind":"arxiv","source_id":"1301.0878","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bnp5fdQdDxfatuAd6QzvAiHo7y+ap0ysq+4v/x6bcEpLAxkbTN1oFLgKjOWcmYCPMULxNTvuvMpiI18HTQXzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:08.680250Z"},"content_sha256":"1889c5f12117079a361b5a6279e6c9993c7305e5a3e3bbe1c94ba9a0046fb681","schema_version":"1.0","event_id":"sha256:1889c5f12117079a361b5a6279e6c9993c7305e5a3e3bbe1c94ba9a0046fb681"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:N4PKSFCGKASB44FZ3BYQZTZ7C5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0CthuwWId5tPcmqKq+c7XDjT76LmSQ1wwcYDP/poR6mAnrd0l6Ri4UEzB6tzJfP0LLuhMor9mf2NsXVmL/0UAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:08.680619Z"},"content_sha256":"cd1b0cd7789f2299aeb1dcc4729d7a17d1540295361c055e7dd6ec43457acf69","schema_version":"1.0","event_id":"sha256:cd1b0cd7789f2299aeb1dcc4729d7a17d1540295361c055e7dd6ec43457acf69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/bundle.json","state_url":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T19:38:08Z","links":{"resolver":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5","bundle":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/bundle.json","state":"https://pith.science/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4PKSFCGKASB44FZ3BYQZTZ7C5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:N4PKSFCGKASB44FZ3BYQZTZ7C5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1dba1c9365411e7f68e462bbf9f17ec213668d571031854330144e6ebfa7c7b6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-01-05T07:39:15Z","title_canon_sha256":"739db02678d4f479aee2b07e2ac4ee48606c3a7fd101ecc33a94d486774ac7ac"},"schema_version":"1.0","source":{"id":"1301.0878","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0878","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0878v2","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0878","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"pith_short_12","alias_value":"N4PKSFCGKASB","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N4PKSFCGKASB44FZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N4PKSFCG","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:cd1b0cd7789f2299aeb1dcc4729d7a17d1540295361c055e7dd6ec43457acf69","target":"graph","created_at":"2026-05-18T03:33:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Holger Rauhut, Nir Ailon","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-01-05T07:39:15Z","title":"Fast and RIP-optimal transforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0878","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1889c5f12117079a361b5a6279e6c9993c7305e5a3e3bbe1c94ba9a0046fb681","target":"record","created_at":"2026-05-18T03:33:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1dba1c9365411e7f68e462bbf9f17ec213668d571031854330144e6ebfa7c7b6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-01-05T07:39:15Z","title_canon_sha256":"739db02678d4f479aee2b07e2ac4ee48606c3a7fd101ecc33a94d486774ac7ac"},"schema_version":"1.0","source":{"id":"1301.0878","kind":"arxiv","version":2}},"canonical_sha256":"6f1ea9144650241e70b9d8710ccf3f177d23f048fc5e7cf0f89a5089f4eeebfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f1ea9144650241e70b9d8710ccf3f177d23f048fc5e7cf0f89a5089f4eeebfb","first_computed_at":"2026-05-18T03:33:25.276436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:25.276436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m+3zBqaTS+VNcREExTu63LzqlieO5GzOg/Nx3wQceUAb28L/7oJki7TWB7DZpFAVh0/u+shBteKr9n0S/rPyAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:25.276984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0878","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1889c5f12117079a361b5a6279e6c9993c7305e5a3e3bbe1c94ba9a0046fb681","sha256:cd1b0cd7789f2299aeb1dcc4729d7a17d1540295361c055e7dd6ec43457acf69"],"state_sha256":"c6992d641833d08bc708968411c0d96f027e4eca34d1bc87fcd1a0d42f4d28e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhWmFhrfPq6NZ89Rd41/L53aXLnn86xoJH1CdQ8HbNWz76t/5TCPAAuSDHkaFWbNWuzTsQ/oF+Oq2+vuMo/GDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:38:08.682597Z","bundle_sha256":"1a48ad853193a7c40784a7c4792963ec3ded9a11851e4403621f46e6dc9e9d5c"}}