{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I6FN5WYAVI7HFDTXAJEMJGM5AC","short_pith_number":"pith:I6FN5WYA","canonical_record":{"source":{"id":"1409.5140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:26:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b45361e5c9477cbc55bfacabad2d577c8affe9f47c3d3653c2cfbb99d7d3985","abstract_canon_sha256":"bd1cd84f009a5b504789cc8df269d2036e6abadbd2b10bd2f3e909b0df52a0f6"},"schema_version":"1.0"},"canonical_sha256":"478adedb00aa3e728e770248c4999d00bce9b01b3dc0d585b9e46b8870bd5130","source":{"kind":"arxiv","id":"1409.5140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5140","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5140v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5140","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"I6FN5WYAVI7H","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I6FN5WYAVI7HFDTX","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I6FN5WYA","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I6FN5WYAVI7HFDTXAJEMJGM5AC","target":"record","payload":{"canonical_record":{"source":{"id":"1409.5140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:26:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b45361e5c9477cbc55bfacabad2d577c8affe9f47c3d3653c2cfbb99d7d3985","abstract_canon_sha256":"bd1cd84f009a5b504789cc8df269d2036e6abadbd2b10bd2f3e909b0df52a0f6"},"schema_version":"1.0"},"canonical_sha256":"478adedb00aa3e728e770248c4999d00bce9b01b3dc0d585b9e46b8870bd5130","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.502300Z","signature_b64":"EXLraWNtt1CHNiywzqjJGnuZScd6Ta2Tchz7vSWAVFRD537vks8cij/E3XqdwdB0KBrKNAuPAhjUoj49esSgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"478adedb00aa3e728e770248c4999d00bce9b01b3dc0d585b9e46b8870bd5130","last_reissued_at":"2026-05-18T00:57:51.501728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.501728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.5140","source_version":1,"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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFWgIaD3uOySL8/XulGHySPQSLABhdqJ7Lo8AAATyFdehzzkPkpKb4O/0F0RQYLYDPnFWXa0bd2jiV+U/TMNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:32:49.177340Z"},"content_sha256":"bdfbe3512b0825f9ccfdd0e619d86131c52f44b3fbbd445428819250bcf0cb37","schema_version":"1.0","event_id":"sha256:bdfbe3512b0825f9ccfdd0e619d86131c52f44b3fbbd445428819250bcf0cb37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I6FN5WYAVI7HFDTXAJEMJGM5AC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The ADMM penalized decoder for LDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Stark C. Draper, Xishuo Liu","submitted_at":"2014-09-17T20:26:25Z","abstract_excerpt":"Linear programming (LP) decoding for low-density parity-check (LDPC) codes proposed by Feldman et al. is shown to have theoretical guarantees in several regimes and empirically is not observed to suffer from an error floor. However at low signal-to-noise ratios (SNRs), LP decoding is observed to have worse error performance than belief propagation (BP) decoding. In this paper, we seek to improve LP decoding at low SNRs while still achieving good high SNR performance. We first present a new decoding framework obtained by trying to solve a non-convex optimization problem using the alternating di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5140","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"},"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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a0zR3+9U1nvfPclhRZWwEY4FkC0S5j2y7U4I7pEZGooi1ZjopFb4oP8kq98nxP+LHSAVJYNc6o9An1aGZ/1UAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:32:49.177919Z"},"content_sha256":"7c6493ff578d5386eede61d432ad1b4f1f56ab9ffdfb888dcacdcbe3b2816e04","schema_version":"1.0","event_id":"sha256:7c6493ff578d5386eede61d432ad1b4f1f56ab9ffdfb888dcacdcbe3b2816e04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6FN5WYAVI7HFDTXAJEMJGM5AC/bundle.json","state_url":"https://pith.science/pith/I6FN5WYAVI7HFDTXAJEMJGM5AC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6FN5WYAVI7HFDTXAJEMJGM5AC/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-06-05T06:32:49Z","links":{"resolver":"https://pith.science/pith/I6FN5WYAVI7HFDTXAJEMJGM5AC","bundle":"https://pith.science/pith/I6FN5WYAVI7HFDTXAJEMJGM5AC/bundle.json","state":"https://pith.science/pith/I6FN5WYAVI7HFDTXAJEMJGM5AC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6FN5WYAVI7HFDTXAJEMJGM5AC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I6FN5WYAVI7HFDTXAJEMJGM5AC","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":"bd1cd84f009a5b504789cc8df269d2036e6abadbd2b10bd2f3e909b0df52a0f6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:26:25Z","title_canon_sha256":"3b45361e5c9477cbc55bfacabad2d577c8affe9f47c3d3653c2cfbb99d7d3985"},"schema_version":"1.0","source":{"id":"1409.5140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5140","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5140v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5140","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"I6FN5WYAVI7H","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I6FN5WYAVI7HFDTX","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I6FN5WYA","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:7c6493ff578d5386eede61d432ad1b4f1f56ab9ffdfb888dcacdcbe3b2816e04","target":"graph","created_at":"2026-05-18T00:57:51Z","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":"Linear programming (LP) decoding for low-density parity-check (LDPC) codes proposed by Feldman et al. is shown to have theoretical guarantees in several regimes and empirically is not observed to suffer from an error floor. However at low signal-to-noise ratios (SNRs), LP decoding is observed to have worse error performance than belief propagation (BP) decoding. In this paper, we seek to improve LP decoding at low SNRs while still achieving good high SNR performance. We first present a new decoding framework obtained by trying to solve a non-convex optimization problem using the alternating di","authors_text":"Stark C. Draper, Xishuo Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:26:25Z","title":"The ADMM penalized decoder for LDPC codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5140","kind":"arxiv","version":1},"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:bdfbe3512b0825f9ccfdd0e619d86131c52f44b3fbbd445428819250bcf0cb37","target":"record","created_at":"2026-05-18T00:57:51Z","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":"bd1cd84f009a5b504789cc8df269d2036e6abadbd2b10bd2f3e909b0df52a0f6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:26:25Z","title_canon_sha256":"3b45361e5c9477cbc55bfacabad2d577c8affe9f47c3d3653c2cfbb99d7d3985"},"schema_version":"1.0","source":{"id":"1409.5140","kind":"arxiv","version":1}},"canonical_sha256":"478adedb00aa3e728e770248c4999d00bce9b01b3dc0d585b9e46b8870bd5130","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"478adedb00aa3e728e770248c4999d00bce9b01b3dc0d585b9e46b8870bd5130","first_computed_at":"2026-05-18T00:57:51.501728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:51.501728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EXLraWNtt1CHNiywzqjJGnuZScd6Ta2Tchz7vSWAVFRD537vks8cij/E3XqdwdB0KBrKNAuPAhjUoj49esSgBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:51.502300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdfbe3512b0825f9ccfdd0e619d86131c52f44b3fbbd445428819250bcf0cb37","sha256:7c6493ff578d5386eede61d432ad1b4f1f56ab9ffdfb888dcacdcbe3b2816e04"],"state_sha256":"6fe659b811fa815a6d228002684a42efc0c3b0934e37f2b44ba4a980f2321fa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFFXJ38aF1wLcFtJcvQepjCSojE4oFRicVZvtwamZ2KoyMfkyCv1Tr43HCQbv0qp6yE/31oKEKCuZD4JyiqOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:32:49.180359Z","bundle_sha256":"89301b6e1dd8b3782c3e16a1a80ca958f88fa88a86934fab76e065fa19d15ad8"}}