{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FHAMT4FX7XDSBTJKPL5CRGU3UQ","short_pith_number":"pith:FHAMT4FX","schema_version":"1.0","canonical_sha256":"29c0c9f0b7fdc720cd2a7afa289a9ba430708c324e7bf897a34f1f0168b733ba","source":{"kind":"arxiv","id":"1403.5874","version":1},"attestation_state":"computed","paper":{"title":"On Compressive Sensing in Coding Problems: A Rigorous Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Shlomo Shamai (Shitz), Wasim Huleihel","submitted_at":"2014-03-24T08:12:02Z","abstract_excerpt":"We take an information theoretic perspective on a classical sparse-sampling noisy linear model and present an analytical expression for the mutual information, which plays central role in a variety of communications/processing problems. Such an expression was addressed previously either by bounds, by simulations and by the (non-rigorous) replica method. The expression of the mutual information is based on techniques used in [1], addressing the minimum mean square error (MMSE) analysis. Using these expressions, we study specifically a variety of sparse linear communications models which include"},"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":"1403.5874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T08:12:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"099a4621ac2f260a34adddc67d3ef7b67039174a1305784c3b25c46ccdda9b9c","abstract_canon_sha256":"6c9c382a65e9981e39d4e6abdb9b8849046d3a3c0982bca68a05426745ff4c0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:47.549818Z","signature_b64":"DRCilp+8oA99tNT5XRD4xXb9Fv/cubkOFSKHPDl/kpz6BPaXkq5LKY40bNxvjejatMmU4Lse1YU+wnrTPQLMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29c0c9f0b7fdc720cd2a7afa289a9ba430708c324e7bf897a34f1f0168b733ba","last_reissued_at":"2026-05-18T02:55:47.549257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:47.549257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Compressive Sensing in Coding Problems: A Rigorous Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Shlomo Shamai (Shitz), Wasim Huleihel","submitted_at":"2014-03-24T08:12:02Z","abstract_excerpt":"We take an information theoretic perspective on a classical sparse-sampling noisy linear model and present an analytical expression for the mutual information, which plays central role in a variety of communications/processing problems. Such an expression was addressed previously either by bounds, by simulations and by the (non-rigorous) replica method. The expression of the mutual information is based on techniques used in [1], addressing the minimum mean square error (MMSE) analysis. Using these expressions, we study specifically a variety of sparse linear communications models which include"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5874","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":"1403.5874","created_at":"2026-05-18T02:55:47.549344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5874v1","created_at":"2026-05-18T02:55:47.549344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5874","created_at":"2026-05-18T02:55:47.549344+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHAMT4FX7XDS","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHAMT4FX7XDSBTJK","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHAMT4FX","created_at":"2026-05-18T12:28:28.263976+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/FHAMT4FX7XDSBTJKPL5CRGU3UQ","json":"https://pith.science/pith/FHAMT4FX7XDSBTJKPL5CRGU3UQ.json","graph_json":"https://pith.science/api/pith-number/FHAMT4FX7XDSBTJKPL5CRGU3UQ/graph.json","events_json":"https://pith.science/api/pith-number/FHAMT4FX7XDSBTJKPL5CRGU3UQ/events.json","paper":"https://pith.science/paper/FHAMT4FX"},"agent_actions":{"view_html":"https://pith.science/pith/FHAMT4FX7XDSBTJKPL5CRGU3UQ","download_json":"https://pith.science/pith/FHAMT4FX7XDSBTJKPL5CRGU3UQ.json","view_paper":"https://pith.science/paper/FHAMT4FX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5874&json=true","fetch_graph":"https://pith.science/api/pith-number/FHAMT4FX7XDSBTJKPL5CRGU3UQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FHAMT4FX7XDSBTJKPL5CRGU3UQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHAMT4FX7XDSBTJKPL5CRGU3UQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHAMT4FX7XDSBTJKPL5CRGU3UQ/action/storage_attestation","attest_author":"https://pith.science/pith/FHAMT4FX7XDSBTJKPL5CRGU3UQ/action/author_attestation","sign_citation":"https://pith.science/pith/FHAMT4FX7XDSBTJKPL5CRGU3UQ/action/citation_signature","submit_replication":"https://pith.science/pith/FHAMT4FX7XDSBTJKPL5CRGU3UQ/action/replication_record"}},"created_at":"2026-05-18T02:55:47.549344+00:00","updated_at":"2026-05-18T02:55:47.549344+00:00"}