{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HPZUBAFR2ZZKCPJRZIWPZEO6MX","short_pith_number":"pith:HPZUBAFR","schema_version":"1.0","canonical_sha256":"3bf34080b1d672a13d31ca2cfc91de65dbd1c156a35b49405dfd3b0475c582e8","source":{"kind":"arxiv","id":"1207.2335","version":2},"attestation_state":"computed","paper":{"title":"SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Mayank Bakshi, Minghua Chen, Sheng Cai, Sidharth Jaggi","submitted_at":"2012-07-10T13:01:40Z","abstract_excerpt":"Suppose x is any exactly k-sparse vector in R^n. We present a class of sparse matrices A, and a corresponding algorithm that we call SHO-FA (for Short and Fast) that, with high probability over A, can reconstruct x from Ax. The SHO-FA algorithm is related to the Invertible Bloom Lookup Tables recently introduced by Goodrich et al., with two important distinctions - SHO-FA relies on linear measurements, and is robust to noise. The SHO-FA algorithm is the first to simultaneously have the following properties: (a) it requires only O(k) measurements, (b) the bit-precision of each measurement and e"},"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":"1207.2335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-10T13:01:40Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"f6e9f0ccb10642086faed68d4a46f7d7bb34a658240fcf9683c57b693569857d","abstract_canon_sha256":"6e51af34afbe2adbd91c6849c8d7de2bed6cc5b255ba2dd98dc47af33f9b34cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:49.286941Z","signature_b64":"Hm7nf6IYjTPpCYPoTFthQESeM5N77RMavEIsBPP7+bm9YEsm8NOOHOPXX8cn+7AljzW5KWUiOnYgvATVQxTXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bf34080b1d672a13d31ca2cfc91de65dbd1c156a35b49405dfd3b0475c582e8","last_reissued_at":"2026-05-18T03:40:49.286158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:49.286158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Mayank Bakshi, Minghua Chen, Sheng Cai, Sidharth Jaggi","submitted_at":"2012-07-10T13:01:40Z","abstract_excerpt":"Suppose x is any exactly k-sparse vector in R^n. We present a class of sparse matrices A, and a corresponding algorithm that we call SHO-FA (for Short and Fast) that, with high probability over A, can reconstruct x from Ax. The SHO-FA algorithm is related to the Invertible Bloom Lookup Tables recently introduced by Goodrich et al., with two important distinctions - SHO-FA relies on linear measurements, and is robust to noise. The SHO-FA algorithm is the first to simultaneously have the following properties: (a) it requires only O(k) measurements, (b) the bit-precision of each measurement and e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2335","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":"1207.2335","created_at":"2026-05-18T03:40:49.286279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2335v2","created_at":"2026-05-18T03:40:49.286279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2335","created_at":"2026-05-18T03:40:49.286279+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPZUBAFR2ZZK","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPZUBAFR2ZZKCPJR","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPZUBAFR","created_at":"2026-05-18T12:27:09.501522+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/HPZUBAFR2ZZKCPJRZIWPZEO6MX","json":"https://pith.science/pith/HPZUBAFR2ZZKCPJRZIWPZEO6MX.json","graph_json":"https://pith.science/api/pith-number/HPZUBAFR2ZZKCPJRZIWPZEO6MX/graph.json","events_json":"https://pith.science/api/pith-number/HPZUBAFR2ZZKCPJRZIWPZEO6MX/events.json","paper":"https://pith.science/paper/HPZUBAFR"},"agent_actions":{"view_html":"https://pith.science/pith/HPZUBAFR2ZZKCPJRZIWPZEO6MX","download_json":"https://pith.science/pith/HPZUBAFR2ZZKCPJRZIWPZEO6MX.json","view_paper":"https://pith.science/paper/HPZUBAFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2335&json=true","fetch_graph":"https://pith.science/api/pith-number/HPZUBAFR2ZZKCPJRZIWPZEO6MX/graph.json","fetch_events":"https://pith.science/api/pith-number/HPZUBAFR2ZZKCPJRZIWPZEO6MX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPZUBAFR2ZZKCPJRZIWPZEO6MX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPZUBAFR2ZZKCPJRZIWPZEO6MX/action/storage_attestation","attest_author":"https://pith.science/pith/HPZUBAFR2ZZKCPJRZIWPZEO6MX/action/author_attestation","sign_citation":"https://pith.science/pith/HPZUBAFR2ZZKCPJRZIWPZEO6MX/action/citation_signature","submit_replication":"https://pith.science/pith/HPZUBAFR2ZZKCPJRZIWPZEO6MX/action/replication_record"}},"created_at":"2026-05-18T03:40:49.286279+00:00","updated_at":"2026-05-18T03:40:49.286279+00:00"}