{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:77QLJ3SJCJHRHHFH4U25EWWHYP","short_pith_number":"pith:77QLJ3SJ","schema_version":"1.0","canonical_sha256":"ffe0b4ee49124f139ca7e535d25ac7c3f37f6b1db698b26147b06d1f2f55cc4e","source":{"kind":"arxiv","id":"1411.2344","version":1},"attestation_state":"computed","paper":{"title":"An explicit sparse recovery scheme in the L1-norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA"],"primary_cat":"cs.DS","authors_text":"Arnab Bhattacharyya, Vineet Nair","submitted_at":"2014-11-10T07:59:37Z","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"},"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":"1411.2344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-10T07:59:37Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"66596e51ae4c1d8898b2f3ae32e00868c405b5375abfac1cba00005eeba1b9c2","abstract_canon_sha256":"8df52814443e46992d3173f2e1ddc50601741c212a89fcdc9710ca4ba51b79cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:07.761466Z","signature_b64":"UlrVRRNLaA1Iz9InfqiuAbpM/l7MUl1FMlQYqzDNejztWCAOLSpJtvrbuOHHDE1jJngYCf4IrL1kvVK4JWc6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffe0b4ee49124f139ca7e535d25ac7c3f37f6b1db698b26147b06d1f2f55cc4e","last_reissued_at":"2026-05-18T02:38:07.760839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:07.760839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An explicit sparse recovery scheme in the L1-norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA"],"primary_cat":"cs.DS","authors_text":"Arnab Bhattacharyya, Vineet Nair","submitted_at":"2014-11-10T07:59:37Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2344","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.2344","created_at":"2026-05-18T02:38:07.760930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2344v1","created_at":"2026-05-18T02:38:07.760930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2344","created_at":"2026-05-18T02:38:07.760930+00:00"},{"alias_kind":"pith_short_12","alias_value":"77QLJ3SJCJHR","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"77QLJ3SJCJHRHHFH","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"77QLJ3SJ","created_at":"2026-05-18T12:28:16.859392+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/77QLJ3SJCJHRHHFH4U25EWWHYP","json":"https://pith.science/pith/77QLJ3SJCJHRHHFH4U25EWWHYP.json","graph_json":"https://pith.science/api/pith-number/77QLJ3SJCJHRHHFH4U25EWWHYP/graph.json","events_json":"https://pith.science/api/pith-number/77QLJ3SJCJHRHHFH4U25EWWHYP/events.json","paper":"https://pith.science/paper/77QLJ3SJ"},"agent_actions":{"view_html":"https://pith.science/pith/77QLJ3SJCJHRHHFH4U25EWWHYP","download_json":"https://pith.science/pith/77QLJ3SJCJHRHHFH4U25EWWHYP.json","view_paper":"https://pith.science/paper/77QLJ3SJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2344&json=true","fetch_graph":"https://pith.science/api/pith-number/77QLJ3SJCJHRHHFH4U25EWWHYP/graph.json","fetch_events":"https://pith.science/api/pith-number/77QLJ3SJCJHRHHFH4U25EWWHYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77QLJ3SJCJHRHHFH4U25EWWHYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77QLJ3SJCJHRHHFH4U25EWWHYP/action/storage_attestation","attest_author":"https://pith.science/pith/77QLJ3SJCJHRHHFH4U25EWWHYP/action/author_attestation","sign_citation":"https://pith.science/pith/77QLJ3SJCJHRHHFH4U25EWWHYP/action/citation_signature","submit_replication":"https://pith.science/pith/77QLJ3SJCJHRHHFH4U25EWWHYP/action/replication_record"}},"created_at":"2026-05-18T02:38:07.760930+00:00","updated_at":"2026-05-18T02:38:07.760930+00:00"}