{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I3KRZ5AP3QGHIJ2DTSLYKYIZJA","short_pith_number":"pith:I3KRZ5AP","canonical_record":{"source":{"id":"1402.1726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-07T18:34:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ac866723a5854fc6569b5657bbc85a6dbf980454a9f836a93b920e10628a1094","abstract_canon_sha256":"0ca5c62b2db5d413571b913e98bd734e1d123053809b728877c93c2445ae1d02"},"schema_version":"1.0"},"canonical_sha256":"46d51cf40fdc0c7427439c97856119482971a2f5ed035674c1186f19773ab2e7","source":{"kind":"arxiv","id":"1402.1726","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1726","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1726v2","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1726","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"pith_short_12","alias_value":"I3KRZ5AP3QGH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I3KRZ5AP3QGHIJ2D","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I3KRZ5AP","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I3KRZ5AP3QGHIJ2DTSLYKYIZJA","target":"record","payload":{"canonical_record":{"source":{"id":"1402.1726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-07T18:34:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ac866723a5854fc6569b5657bbc85a6dbf980454a9f836a93b920e10628a1094","abstract_canon_sha256":"0ca5c62b2db5d413571b913e98bd734e1d123053809b728877c93c2445ae1d02"},"schema_version":"1.0"},"canonical_sha256":"46d51cf40fdc0c7427439c97856119482971a2f5ed035674c1186f19773ab2e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:25.385279Z","signature_b64":"7yfh90dX188/v6yMQcYh4gMZ8bftIV89iP5K0AMWxI5WTlo93t/CJCU1BksSBY+kb4ZYVFY0u/A7aX7XY7jQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46d51cf40fdc0c7427439c97856119482971a2f5ed035674c1186f19773ab2e7","last_reissued_at":"2026-05-18T00:49:25.384575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:25.384575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.1726","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-18T00:49:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFIDm4Q8erh/JynviUZSEwbcQDIRPIrenNg+Z0XGfL/LV+BakBm1VGa4Lhlh/eU4O+mv8smCh7y+44I+nPIsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:00:07.131972Z"},"content_sha256":"b26f515a101b97a8220b4bb7d5fe3258a4f57dbae1211161022063c31014d7ef","schema_version":"1.0","event_id":"sha256:b26f515a101b97a8220b4bb7d5fe3258a4f57dbae1211161022063c31014d7ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I3KRZ5AP3QGHIJ2DTSLYKYIZJA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"For-all Sparse Recovery in Near-Optimal Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Anna C. Gilbert, Ely Porat, Martin J. Strauss, Yi Li","submitted_at":"2014-02-07T18:34:37Z","abstract_excerpt":"An approximate sparse recovery system in $\\ell_1$ norm consists of parameters $k$, $\\epsilon$, $N$, an $m$-by-$N$ measurement $\\Phi$, and a recovery algorithm, $\\mathcal{R}$. Given a vector, $\\mathbf{x}$, the system approximates $x$ by $\\widehat{\\mathbf{x}} = \\mathcal{R}(\\Phi\\mathbf{x})$, which must satisfy $\\|\\widehat{\\mathbf{x}}-\\mathbf{x}\\|_1 \\leq (1+\\epsilon)\\|\\mathbf{x}-\\mathbf{x}_k\\|_1$. We consider the 'for all' model, in which a single matrix $\\Phi$, possibly 'constructed' non-explicitly using the probabilistic method, is used for all signals $\\mathbf{x}$. The best existing sublinear a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1726","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-18T00:49:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7f1Ub0r1x39u1I5kwzzkWHWL+d7djRuu7oe8AttFJOK/YbU0UjmicbZDQdJGSSrXHXNrh1clcSLjpURX5RvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:00:07.132678Z"},"content_sha256":"3970ffe2cb394069a133e2d3ad12022d1e98e0722564d0b7bd0e99c1e623f1e9","schema_version":"1.0","event_id":"sha256:3970ffe2cb394069a133e2d3ad12022d1e98e0722564d0b7bd0e99c1e623f1e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3KRZ5AP3QGHIJ2DTSLYKYIZJA/bundle.json","state_url":"https://pith.science/pith/I3KRZ5AP3QGHIJ2DTSLYKYIZJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3KRZ5AP3QGHIJ2DTSLYKYIZJA/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-12T03:00:07Z","links":{"resolver":"https://pith.science/pith/I3KRZ5AP3QGHIJ2DTSLYKYIZJA","bundle":"https://pith.science/pith/I3KRZ5AP3QGHIJ2DTSLYKYIZJA/bundle.json","state":"https://pith.science/pith/I3KRZ5AP3QGHIJ2DTSLYKYIZJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3KRZ5AP3QGHIJ2DTSLYKYIZJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I3KRZ5AP3QGHIJ2DTSLYKYIZJA","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":"0ca5c62b2db5d413571b913e98bd734e1d123053809b728877c93c2445ae1d02","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-07T18:34:37Z","title_canon_sha256":"ac866723a5854fc6569b5657bbc85a6dbf980454a9f836a93b920e10628a1094"},"schema_version":"1.0","source":{"id":"1402.1726","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1726","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1726v2","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1726","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"pith_short_12","alias_value":"I3KRZ5AP3QGH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I3KRZ5AP3QGHIJ2D","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I3KRZ5AP","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:3970ffe2cb394069a133e2d3ad12022d1e98e0722564d0b7bd0e99c1e623f1e9","target":"graph","created_at":"2026-05-18T00:49: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":"An approximate sparse recovery system in $\\ell_1$ norm consists of parameters $k$, $\\epsilon$, $N$, an $m$-by-$N$ measurement $\\Phi$, and a recovery algorithm, $\\mathcal{R}$. Given a vector, $\\mathbf{x}$, the system approximates $x$ by $\\widehat{\\mathbf{x}} = \\mathcal{R}(\\Phi\\mathbf{x})$, which must satisfy $\\|\\widehat{\\mathbf{x}}-\\mathbf{x}\\|_1 \\leq (1+\\epsilon)\\|\\mathbf{x}-\\mathbf{x}_k\\|_1$. We consider the 'for all' model, in which a single matrix $\\Phi$, possibly 'constructed' non-explicitly using the probabilistic method, is used for all signals $\\mathbf{x}$. The best existing sublinear a","authors_text":"Anna C. Gilbert, Ely Porat, Martin J. Strauss, Yi Li","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-07T18:34:37Z","title":"For-all Sparse Recovery in Near-Optimal Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1726","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:b26f515a101b97a8220b4bb7d5fe3258a4f57dbae1211161022063c31014d7ef","target":"record","created_at":"2026-05-18T00:49: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":"0ca5c62b2db5d413571b913e98bd734e1d123053809b728877c93c2445ae1d02","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-07T18:34:37Z","title_canon_sha256":"ac866723a5854fc6569b5657bbc85a6dbf980454a9f836a93b920e10628a1094"},"schema_version":"1.0","source":{"id":"1402.1726","kind":"arxiv","version":2}},"canonical_sha256":"46d51cf40fdc0c7427439c97856119482971a2f5ed035674c1186f19773ab2e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46d51cf40fdc0c7427439c97856119482971a2f5ed035674c1186f19773ab2e7","first_computed_at":"2026-05-18T00:49:25.384575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:25.384575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7yfh90dX188/v6yMQcYh4gMZ8bftIV89iP5K0AMWxI5WTlo93t/CJCU1BksSBY+kb4ZYVFY0u/A7aX7XY7jQCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:25.385279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1726","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b26f515a101b97a8220b4bb7d5fe3258a4f57dbae1211161022063c31014d7ef","sha256:3970ffe2cb394069a133e2d3ad12022d1e98e0722564d0b7bd0e99c1e623f1e9"],"state_sha256":"8a8afb7192791d26710fe1077b5a83829bf587bec66f779dd0a56cc161d38851"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CarryUnJNsQJPr/9wEGWPx3PCslRXztWzboBnkKtfmn7JEvK3uSSVMf4ZTca/ToD059KciVMBg/HiC0vjqoaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:00:07.137264Z","bundle_sha256":"81b214f308e3f76c3fe44318639f945f413388eca1d37072cc7f9db27694a046"}}