{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:EHU6YNP3YAYVNSU3C72J3KKB5P","short_pith_number":"pith:EHU6YNP3","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"},"canonical_sha256":"21e9ec35fbc03156ca9b17f49da941ebcf8ebc5e1d710bc36c94437485f4af7a","source":{"kind":"arxiv","id":"1012.0602","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0602","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0602v2","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0602","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"EHU6YNP3YAYV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EHU6YNP3YAYVNSU3","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EHU6YNP3","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:EHU6YNP3YAYVNSU3C72J3KKB5P","target":"record","payload":{"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"},"canonical_sha256":"21e9ec35fbc03156ca9b17f49da941ebcf8ebc5e1d710bc36c94437485f4af7a","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"},"source_kind":"arxiv","source_id":"1012.0602","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6UgL2HbHh+LhWc8KbeezFPnK5vtoxpCu9biC18aeEt1mDLeSF1Mbp0znm8CLUYHQvpNYjSneMv/pGkgwtPAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:56:36.640849Z"},"content_sha256":"25a5e80cf1f4fe846314757a8c374ecdb9e075e523add282a449ed95f9427712","schema_version":"1.0","event_id":"sha256:25a5e80cf1f4fe846314757a8c374ecdb9e075e523add282a449ed95f9427712"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:EHU6YNP3YAYVNSU3C72J3KKB5P","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XG4pwNy0m3jw2SmMSTqncD4HCA6BCFWhqHuubr2D5UV7Vx/AiYxpx3Lp7p3xzfnYl6BfAQPFgGCSGwAYrvyXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:56:36.641230Z"},"content_sha256":"9671afb35c01bdeb7dd704b4ccb7244dd19a73a7f304d25a6dcdfcd98a9912f2","schema_version":"1.0","event_id":"sha256:9671afb35c01bdeb7dd704b4ccb7244dd19a73a7f304d25a6dcdfcd98a9912f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/bundle.json","state_url":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T01:56:36Z","links":{"resolver":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P","bundle":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/bundle.json","state":"https://pith.science/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHU6YNP3YAYVNSU3C72J3KKB5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:EHU6YNP3YAYVNSU3C72J3KKB5P","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":"b4b3976d5b0e22e93d682a02c32a8bbb3b3932201fbf6471a9d33ffcc7161f47","cross_cats_sorted":["math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T22:56:59Z","title_canon_sha256":"7625df285719570289c6d16121a85409c04536b090e8af9fcbcb143e67a8ee60"},"schema_version":"1.0","source":{"id":"1012.0602","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0602","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0602v2","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0602","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"EHU6YNP3YAYV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EHU6YNP3YAYVNSU3","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EHU6YNP3","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:9671afb35c01bdeb7dd704b4ccb7244dd19a73a7f304d25a6dcdfcd98a9912f2","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"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","authors_text":"Alexandros G. Dimakis, Pascal O. Vontobel, Roxana Smarandache","cross_cats":["math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T22:56:59Z","title":"LDPC Codes for Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0602","kind":"arxiv","version":2},"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:25a5e80cf1f4fe846314757a8c374ecdb9e075e523add282a449ed95f9427712","target":"record","created_at":"2026-05-18T00:58:43Z","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":"b4b3976d5b0e22e93d682a02c32a8bbb3b3932201fbf6471a9d33ffcc7161f47","cross_cats_sorted":["math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T22:56:59Z","title_canon_sha256":"7625df285719570289c6d16121a85409c04536b090e8af9fcbcb143e67a8ee60"},"schema_version":"1.0","source":{"id":"1012.0602","kind":"arxiv","version":2}},"canonical_sha256":"21e9ec35fbc03156ca9b17f49da941ebcf8ebc5e1d710bc36c94437485f4af7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21e9ec35fbc03156ca9b17f49da941ebcf8ebc5e1d710bc36c94437485f4af7a","first_computed_at":"2026-05-18T00:58:43.756514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.756514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f/vbHNgTqFLJ2T2KBPhQIj01pKjV74EaHduCPH4g90SGd5y3EPdy6aHJJO67JUyjOdUi4NHND2V/ow3BcTDiAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.756963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0602","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25a5e80cf1f4fe846314757a8c374ecdb9e075e523add282a449ed95f9427712","sha256:9671afb35c01bdeb7dd704b4ccb7244dd19a73a7f304d25a6dcdfcd98a9912f2"],"state_sha256":"bf51dd9e68d6d11f9ba90d3012c3b6f4ed238666edce2cce0484e3e8fde67e87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qFvzTwtWrqcAaqm6bWqNkA0PHqChrdzbdxkn3rC0MXrcsz9tkp8i9x/rOsMGJmZGH6xCCVqHg6Ns71ejIjLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:56:36.643356Z","bundle_sha256":"b172776ec41827d69be9111201efa0e04b6898db08bb49649145f19120f95103"}}