{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WGHTJRMHKSCKIGJIFWHJY4P2WE","short_pith_number":"pith:WGHTJRMH","schema_version":"1.0","canonical_sha256":"b18f34c5875484a419282d8e9c71fab13a3afff563a8b851c561f9e04e42a890","source":{"kind":"arxiv","id":"1601.06899","version":1},"attestation_state":"computed","paper":{"title":"Coded Compressive Sensing: A Compute-and-Recover Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Namyoon Lee, Song-Nam Hong","submitted_at":"2016-01-26T06:09:40Z","abstract_excerpt":"In this paper, we propose \\textit{coded compressive sensing} that recovers an $n$-dimensional integer sparse signal vector from a noisy and quantized measurement vector whose dimension $m$ is far-fewer than $n$. The core idea of coded compressive sensing is to construct a linear sensing matrix whose columns consist of lattice codes. We present a two-stage decoding method named \\textit{compute-and-recover} to detect the sparse signal from the noisy and quantized measurements. In the first stage, we transform such measurements into noiseless finite-field measurements using the linearity of latti"},"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":"1601.06899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T06:09:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9899b5ae2487cac73e49c3708f996c59a21f1fff41df7cd96f8eb32a6e411b37","abstract_canon_sha256":"4c700ce2edd85ca75623bb169b4e98ca0ec8372a56011c61a8a1c80748065e83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:59.585779Z","signature_b64":"lbj5JE4V2Q5w3rf+q27N2MGzIk/TzDZJw5qTFakbuPimqMS1eV/CQKiyA2afvZywFgxDJPY5SgF0b/A3Vm1IAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b18f34c5875484a419282d8e9c71fab13a3afff563a8b851c561f9e04e42a890","last_reissued_at":"2026-05-18T01:21:59.585280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:59.585280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Compressive Sensing: A Compute-and-Recover Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Namyoon Lee, Song-Nam Hong","submitted_at":"2016-01-26T06:09:40Z","abstract_excerpt":"In this paper, we propose \\textit{coded compressive sensing} that recovers an $n$-dimensional integer sparse signal vector from a noisy and quantized measurement vector whose dimension $m$ is far-fewer than $n$. The core idea of coded compressive sensing is to construct a linear sensing matrix whose columns consist of lattice codes. We present a two-stage decoding method named \\textit{compute-and-recover} to detect the sparse signal from the noisy and quantized measurements. In the first stage, we transform such measurements into noiseless finite-field measurements using the linearity of latti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06899","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":"1601.06899","created_at":"2026-05-18T01:21:59.585352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06899v1","created_at":"2026-05-18T01:21:59.585352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06899","created_at":"2026-05-18T01:21:59.585352+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGHTJRMHKSCK","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGHTJRMHKSCKIGJI","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGHTJRMH","created_at":"2026-05-18T12:30:48.956258+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/WGHTJRMHKSCKIGJIFWHJY4P2WE","json":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE.json","graph_json":"https://pith.science/api/pith-number/WGHTJRMHKSCKIGJIFWHJY4P2WE/graph.json","events_json":"https://pith.science/api/pith-number/WGHTJRMHKSCKIGJIFWHJY4P2WE/events.json","paper":"https://pith.science/paper/WGHTJRMH"},"agent_actions":{"view_html":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE","download_json":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE.json","view_paper":"https://pith.science/paper/WGHTJRMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06899&json=true","fetch_graph":"https://pith.science/api/pith-number/WGHTJRMHKSCKIGJIFWHJY4P2WE/graph.json","fetch_events":"https://pith.science/api/pith-number/WGHTJRMHKSCKIGJIFWHJY4P2WE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/action/storage_attestation","attest_author":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/action/author_attestation","sign_citation":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/action/citation_signature","submit_replication":"https://pith.science/pith/WGHTJRMHKSCKIGJIFWHJY4P2WE/action/replication_record"}},"created_at":"2026-05-18T01:21:59.585352+00:00","updated_at":"2026-05-18T01:21:59.585352+00:00"}