{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EHU6YNP3YAYVNSU3C72J3KKB5P","short_pith_number":"pith:EHU6YNP3","schema_version":"1.0","canonical_sha256":"21e9ec35fbc03156ca9b17f49da941ebcf8ebc5e1d710bc36c94437485f4af7a","source":{"kind":"arxiv","id":"1012.0602","version":2},"attestation_state":"computed","paper":{"title":"LDPC Codes for Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Pascal O. Vontobel, Roxana Smarandache","submitted_at":"2010-12-02T22:56:59Z","abstract_excerpt":"We present a mathematical connection between channel coding and compressed sensing. In particular, we link, on the one hand, \\emph{channel coding linear programming decoding (CC-LPD)}, which is a well-known relaxation o  maximum-likelihood channel decoding for binary linear codes, and, on the other hand, \\emph{compressed sensing linear programming decoding (CS-LPD)}, also known as basis pursuit, which is a widely used linear programming relaxation for the problem of finding the sparsest solution of an under-determined system of linear equations. More specifically, we establis a tight connectio"},"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":"1012.0602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T22:56:59Z","cross_cats_sorted":["math.IT","math.NA"],"title_canon_sha256":"7625df285719570289c6d16121a85409c04536b090e8af9fcbcb143e67a8ee60","abstract_canon_sha256":"b4b3976d5b0e22e93d682a02c32a8bbb3b3932201fbf6471a9d33ffcc7161f47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.756963Z","signature_b64":"f/vbHNgTqFLJ2T2KBPhQIj01pKjV74EaHduCPH4g90SGd5y3EPdy6aHJJO67JUyjOdUi4NHND2V/ow3BcTDiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21e9ec35fbc03156ca9b17f49da941ebcf8ebc5e1d710bc36c94437485f4af7a","last_reissued_at":"2026-05-18T00:58:43.756514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.756514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LDPC Codes for Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Pascal O. Vontobel, Roxana Smarandache","submitted_at":"2010-12-02T22:56:59Z","abstract_excerpt":"We present a mathematical connection between channel coding and compressed sensing. In particular, we link, on the one hand, \\emph{channel coding linear programming decoding (CC-LPD)}, which is a well-known relaxation o  maximum-likelihood channel decoding for binary linear codes, and, on the other hand, \\emph{compressed sensing linear programming decoding (CS-LPD)}, also known as basis pursuit, which is a widely used linear programming relaxation for the problem of finding the sparsest solution of an under-determined system of linear equations. More specifically, we establis a tight connectio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0602","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":"1012.0602","created_at":"2026-05-18T00:58:43.756582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.0602v2","created_at":"2026-05-18T00:58:43.756582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0602","created_at":"2026-05-18T00:58:43.756582+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHU6YNP3YAYV","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHU6YNP3YAYVNSU3","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHU6YNP3","created_at":"2026-05-18T12:26:06.534383+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/EHU6YNP3YAYVNSU3C72J3KKB5P","json":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P.json","graph_json":"https://pith.science/api/pith-number/EHU6YNP3YAYVNSU3C72J3KKB5P/graph.json","events_json":"https://pith.science/api/pith-number/EHU6YNP3YAYVNSU3C72J3KKB5P/events.json","paper":"https://pith.science/paper/EHU6YNP3"},"agent_actions":{"view_html":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P","download_json":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P.json","view_paper":"https://pith.science/paper/EHU6YNP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.0602&json=true","fetch_graph":"https://pith.science/api/pith-number/EHU6YNP3YAYVNSU3C72J3KKB5P/graph.json","fetch_events":"https://pith.science/api/pith-number/EHU6YNP3YAYVNSU3C72J3KKB5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/action/storage_attestation","attest_author":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/action/author_attestation","sign_citation":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/action/citation_signature","submit_replication":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/action/replication_record"}},"created_at":"2026-05-18T00:58:43.756582+00:00","updated_at":"2026-05-18T00:58:43.756582+00:00"}