{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:UF6ZXLTHPMOBQVIAFR76ATUT7Z","short_pith_number":"pith:UF6ZXLTH","canonical_record":{"source":{"id":"0912.0229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-01T18:47:24Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"12ac0b032b2ba94ea5e3b008f08f4cf7002b5a2ff73ef3ee7f43f57088889e99","abstract_canon_sha256":"5da56754b515760b95b7e6f18b6ee939c52e83dc3b47445f43284f654480e634"},"schema_version":"1.0"},"canonical_sha256":"a17d9bae677b1c1855002c7fe04e93fe71e4f901610af462dfa7bdb14af84437","source":{"kind":"arxiv","id":"0912.0229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0229","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0229v1","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0229","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"UF6ZXLTHPMOB","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"UF6ZXLTHPMOBQVIA","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"UF6ZXLTH","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:UF6ZXLTHPMOBQVIAFR76ATUT7Z","target":"record","payload":{"canonical_record":{"source":{"id":"0912.0229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-01T18:47:24Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"12ac0b032b2ba94ea5e3b008f08f4cf7002b5a2ff73ef3ee7f43f57088889e99","abstract_canon_sha256":"5da56754b515760b95b7e6f18b6ee939c52e83dc3b47445f43284f654480e634"},"schema_version":"1.0"},"canonical_sha256":"a17d9bae677b1c1855002c7fe04e93fe71e4f901610af462dfa7bdb14af84437","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:48.844730Z","signature_b64":"BvvC56vOMw/HbVGLJtr+V08mC/p0gc769V4LOk7Itkcv/RICeXO5hcqgUOvtKp3QmcuSzUrZsVWEDGqfw/IEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a17d9bae677b1c1855002c7fe04e93fe71e4f901610af462dfa7bdb14af84437","last_reissued_at":"2026-05-18T02:59:48.843731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:48.843731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.0229","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-18T02:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QcmBmwTeFKVo3JDCN9lyZYyr94ND9vh6fUh2JuwvK+go7p7SA91d0T7a4AjHQzXOR2UQdsYyHJabZr2cHWtbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:43:55.198904Z"},"content_sha256":"e94210f32fad3f228ef2a7f4af4f3df8ba49ecb79bfcb1989816c7dea11ddce3","schema_version":"1.0","event_id":"sha256:e94210f32fad3f228ef2a7f4af4f3df8ba49ecb79bfcb1989816c7dea11ddce3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:UF6ZXLTHPMOBQVIAFR76ATUT7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Sparse Recovery: Optimizing Time and Measurements","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":"2009-12-01T18:47:24Z","abstract_excerpt":"An approximate sparse recovery system consists of parameters $k,N$, an $m$-by-$N$ measurement matrix, $\\Phi$, and a decoding algorithm, $\\mathcal{D}$. Given a vector, $x$, the system approximates $x$ by $\\widehat x =\\mathcal{D}(\\Phi x)$, which must satisfy $\\| \\widehat x - x\\|_2\\le C \\|x - x_k\\|_2$, where $x_k$ denotes the optimal $k$-term approximation to $x$. For each vector $x$, the system must succeed with probability at least 3/4. Among the goals in designing such systems are minimizing the number $m$ of measurements and the runtime of the decoding algorithm, $\\mathcal{D}$.\n  In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0229","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-18T02:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4IUjAX0lAowa+4NcjAfM8KW/n7W0HoJiCmAsREknfL8EX+byi7gLKuRB5C8NXQn1GqvNeUXyLXCyFUkLnUd7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:43:55.199599Z"},"content_sha256":"2ed244c56f7c15cd02029cf333fa565541704ee607ad6a68fe200d58c3bfc657","schema_version":"1.0","event_id":"sha256:2ed244c56f7c15cd02029cf333fa565541704ee607ad6a68fe200d58c3bfc657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UF6ZXLTHPMOBQVIAFR76ATUT7Z/bundle.json","state_url":"https://pith.science/pith/UF6ZXLTHPMOBQVIAFR76ATUT7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UF6ZXLTHPMOBQVIAFR76ATUT7Z/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-30T10:43:55Z","links":{"resolver":"https://pith.science/pith/UF6ZXLTHPMOBQVIAFR76ATUT7Z","bundle":"https://pith.science/pith/UF6ZXLTHPMOBQVIAFR76ATUT7Z/bundle.json","state":"https://pith.science/pith/UF6ZXLTHPMOBQVIAFR76ATUT7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UF6ZXLTHPMOBQVIAFR76ATUT7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:UF6ZXLTHPMOBQVIAFR76ATUT7Z","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":"5da56754b515760b95b7e6f18b6ee939c52e83dc3b47445f43284f654480e634","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-01T18:47:24Z","title_canon_sha256":"12ac0b032b2ba94ea5e3b008f08f4cf7002b5a2ff73ef3ee7f43f57088889e99"},"schema_version":"1.0","source":{"id":"0912.0229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0229","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0229v1","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0229","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"UF6ZXLTHPMOB","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"UF6ZXLTHPMOBQVIA","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"UF6ZXLTH","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:2ed244c56f7c15cd02029cf333fa565541704ee607ad6a68fe200d58c3bfc657","target":"graph","created_at":"2026-05-18T02:59:48Z","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 consists of parameters $k,N$, an $m$-by-$N$ measurement matrix, $\\Phi$, and a decoding algorithm, $\\mathcal{D}$. Given a vector, $x$, the system approximates $x$ by $\\widehat x =\\mathcal{D}(\\Phi x)$, which must satisfy $\\| \\widehat x - x\\|_2\\le C \\|x - x_k\\|_2$, where $x_k$ denotes the optimal $k$-term approximation to $x$. For each vector $x$, the system must succeed with probability at least 3/4. Among the goals in designing such systems are minimizing the number $m$ of measurements and the runtime of the decoding algorithm, $\\mathcal{D}$.\n  In this pape","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":"2009-12-01T18:47:24Z","title":"Approximate Sparse Recovery: Optimizing Time and Measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0229","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:e94210f32fad3f228ef2a7f4af4f3df8ba49ecb79bfcb1989816c7dea11ddce3","target":"record","created_at":"2026-05-18T02:59:48Z","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":"5da56754b515760b95b7e6f18b6ee939c52e83dc3b47445f43284f654480e634","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-01T18:47:24Z","title_canon_sha256":"12ac0b032b2ba94ea5e3b008f08f4cf7002b5a2ff73ef3ee7f43f57088889e99"},"schema_version":"1.0","source":{"id":"0912.0229","kind":"arxiv","version":1}},"canonical_sha256":"a17d9bae677b1c1855002c7fe04e93fe71e4f901610af462dfa7bdb14af84437","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a17d9bae677b1c1855002c7fe04e93fe71e4f901610af462dfa7bdb14af84437","first_computed_at":"2026-05-18T02:59:48.843731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:48.843731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BvvC56vOMw/HbVGLJtr+V08mC/p0gc769V4LOk7Itkcv/RICeXO5hcqgUOvtKp3QmcuSzUrZsVWEDGqfw/IEBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:48.844730Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.0229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e94210f32fad3f228ef2a7f4af4f3df8ba49ecb79bfcb1989816c7dea11ddce3","sha256:2ed244c56f7c15cd02029cf333fa565541704ee607ad6a68fe200d58c3bfc657"],"state_sha256":"d652fc290babe68a322de68daab7c2f8464248657ed711a594faca53781a6814"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vueN4GnjDz/ElQbJ+7jMxbEMWWphJY9hqmX8+jIPkfJHY2JI6HE8Jgk8fWB0of5ZPAsqyE0McNmYOJinvju9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:43:55.203375Z","bundle_sha256":"c1267a47ca4c00c53780ee590008dda4da700f8a94c52695a31e6e666abb354d"}}