{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:262N5FQT7BOSUGSGQSJ7JJ7ERC","short_pith_number":"pith:262N5FQT","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"},"canonical_sha256":"d7b4de9613f85d2a1a468493f4a7e488ac49d4d8f9c5c6bc35baeaa7f8e26a93","source":{"kind":"arxiv","id":"1211.0986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0986","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0986v1","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0986","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"262N5FQT7BOS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"262N5FQT7BOSUGSG","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"262N5FQT","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:262N5FQT7BOSUGSGQSJ7JJ7ERC","target":"record","payload":{"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"},"canonical_sha256":"d7b4de9613f85d2a1a468493f4a7e488ac49d4d8f9c5c6bc35baeaa7f8e26a93","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"},"source_kind":"arxiv","source_id":"1211.0986","source_version":1,"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:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lN+PEJldyb1wp4K9Eyl0Ddx4ifCFf/+QJgNqKY/0ht+PDzPholy4n6fstZlKM1/J/SqTvlYfRztUXolmKGzGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:57:29.196497Z"},"content_sha256":"358e2beb4b1159b269477e94bd811460818e298eee77f6431eea52bd473cf150","schema_version":"1.0","event_id":"sha256:358e2beb4b1159b269477e94bd811460818e298eee77f6431eea52bd473cf150"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:262N5FQT7BOSUGSGQSJ7JJ7ERC","target":"graph","payload":{"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"},"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:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+D/N8bsql3l0nYg4dRe8rBD0pxakAFkEBRgS7wqi3YBPPWRvrV3t3havmgWBkka8xV3w3R30KWJ/Pyo+bjSEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:57:29.197224Z"},"content_sha256":"69a6db61459f5af89c915f8da92e84d7d3c9883dd5c4ba8452b711c13fd1e113","schema_version":"1.0","event_id":"sha256:69a6db61459f5af89c915f8da92e84d7d3c9883dd5c4ba8452b711c13fd1e113"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/bundle.json","state_url":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/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-05-27T18:57:29Z","links":{"resolver":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC","bundle":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/bundle.json","state":"https://pith.science/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/262N5FQT7BOSUGSGQSJ7JJ7ERC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:262N5FQT7BOSUGSGQSJ7JJ7ERC","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":"6bc152b47ee00fbb41ef13841e482c4458c26018faff868310e3d17e29fbb4dd","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-05T19:58:27Z","title_canon_sha256":"d6cc512b60ddcab6ee3e545b0b31c241cca89732e59c3324d1ebd3f7d133c72f"},"schema_version":"1.0","source":{"id":"1211.0986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0986","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0986v1","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0986","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"262N5FQT7BOS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"262N5FQT7BOSUGSG","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"262N5FQT","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:69a6db61459f5af89c915f8da92e84d7d3c9883dd5c4ba8452b711c13fd1e113","target":"graph","created_at":"2026-05-18T03:41:28Z","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":"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","authors_text":"Eric Price, Jelani Nelson, Mary Wootters","cross_cats":["cs.IT","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-05T19:58:27Z","title":"New constructions of RIP matrices with fast multiplication and fewer rows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0986","kind":"arxiv","version":1},"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:358e2beb4b1159b269477e94bd811460818e298eee77f6431eea52bd473cf150","target":"record","created_at":"2026-05-18T03:41:28Z","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":"6bc152b47ee00fbb41ef13841e482c4458c26018faff868310e3d17e29fbb4dd","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-05T19:58:27Z","title_canon_sha256":"d6cc512b60ddcab6ee3e545b0b31c241cca89732e59c3324d1ebd3f7d133c72f"},"schema_version":"1.0","source":{"id":"1211.0986","kind":"arxiv","version":1}},"canonical_sha256":"d7b4de9613f85d2a1a468493f4a7e488ac49d4d8f9c5c6bc35baeaa7f8e26a93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7b4de9613f85d2a1a468493f4a7e488ac49d4d8f9c5c6bc35baeaa7f8e26a93","first_computed_at":"2026-05-18T03:41:28.797865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:28.797865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f+v5NUHQAXWMPBTSAS+f+4A/ujhA4lsUotuXdu2P4IeKAtj2nxyotP39pogqQCYUcqRhvRmpQFgwx/G2J3NgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:28.798514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:358e2beb4b1159b269477e94bd811460818e298eee77f6431eea52bd473cf150","sha256:69a6db61459f5af89c915f8da92e84d7d3c9883dd5c4ba8452b711c13fd1e113"],"state_sha256":"cc74fa8222dee6e61ad458d16fcf7caba1394e3517b71bf65fbfce4d1648a1a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gy5dbh0AkPiAm/iYtgu32ok3GqBzP6Pm4sjYgkefAs2Qoi/j2WFgxp7pdGMLPiWfp0a0MgtKluD28OVu/92BBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:57:29.200963Z","bundle_sha256":"ef328e97f34e6a6bee7909761c2b58dd9d358dbf9e420af7f2129d3be93f8490"}}