{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:77QLJ3SJCJHRHHFH4U25EWWHYP","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":"8df52814443e46992d3173f2e1ddc50601741c212a89fcdc9710ca4ba51b79cc","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-10T07:59:37Z","title_canon_sha256":"66596e51ae4c1d8898b2f3ae32e00868c405b5375abfac1cba00005eeba1b9c2"},"schema_version":"1.0","source":{"id":"1411.2344","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2344","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2344v1","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2344","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"77QLJ3SJCJHR","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"77QLJ3SJCJHRHHFH","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"77QLJ3SJ","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:121d9140942fe9cf417667d258f91429b1158e9d8a2eacd38bb2cabd14e66579","target":"graph","created_at":"2026-05-18T02:38:07Z","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":"Consider the approximate sparse recovery problem: given Ax, where A is a known m-by-n dimensional matrix and x is an unknown (approximately) sparse n-dimensional vector, recover an approximation to x. The goal is to design the matrix A such that m is small and recovery is efficient. Moreover, it is often desirable for A to have other nice properties, such as explicitness, sparsity, and discreteness.\n  In this work, we show that we can use spectral expander graphs to explicitly design binary matrices A for which the column sparsity is optimal and for which there is an efficient recovery algorit","authors_text":"Arnab Bhattacharyya, Vineet Nair","cross_cats":["cs.IT","math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-10T07:59:37Z","title":"An explicit sparse recovery scheme in the L1-norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2344","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:17a27ec90a6a2a5e16222f86473a0c154445a95c4631cec6756049ae4a2b617c","target":"record","created_at":"2026-05-18T02:38:07Z","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":"8df52814443e46992d3173f2e1ddc50601741c212a89fcdc9710ca4ba51b79cc","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-10T07:59:37Z","title_canon_sha256":"66596e51ae4c1d8898b2f3ae32e00868c405b5375abfac1cba00005eeba1b9c2"},"schema_version":"1.0","source":{"id":"1411.2344","kind":"arxiv","version":1}},"canonical_sha256":"ffe0b4ee49124f139ca7e535d25ac7c3f37f6b1db698b26147b06d1f2f55cc4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffe0b4ee49124f139ca7e535d25ac7c3f37f6b1db698b26147b06d1f2f55cc4e","first_computed_at":"2026-05-18T02:38:07.760839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:07.760839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UlrVRRNLaA1Iz9InfqiuAbpM/l7MUl1FMlQYqzDNejztWCAOLSpJtvrbuOHHDE1jJngYCf4IrL1kvVK4JWc6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:07.761466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2344","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17a27ec90a6a2a5e16222f86473a0c154445a95c4631cec6756049ae4a2b617c","sha256:121d9140942fe9cf417667d258f91429b1158e9d8a2eacd38bb2cabd14e66579"],"state_sha256":"d921e8a19d84d1fc715172f4aba23ff5e79baf4ddc87e5ce462e5e498a1a9bb3"}