{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PB5V637P2ATNWKA5AOGCTBSTFU","short_pith_number":"pith:PB5V637P","canonical_record":{"source":{"id":"1901.07806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T10:33:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2718b7bac1677f72983c06c613f59114f97e2d692abaa626d0ead2adf992f5a7","abstract_canon_sha256":"ae6ce837f69961f56f3061c82725fed4018a24c2aed50aaa6a4770e50ac919f6"},"schema_version":"1.0"},"canonical_sha256":"787b5f6fefd026db281d038c2986532d11fae98454cafc9c76ffc248e1bee424","source":{"kind":"arxiv","id":"1901.07806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07806","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07806v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07806","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"PB5V637P2ATN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PB5V637P2ATNWKA5","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PB5V637P","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PB5V637P2ATNWKA5AOGCTBSTFU","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T10:33:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2718b7bac1677f72983c06c613f59114f97e2d692abaa626d0ead2adf992f5a7","abstract_canon_sha256":"ae6ce837f69961f56f3061c82725fed4018a24c2aed50aaa6a4770e50ac919f6"},"schema_version":"1.0"},"canonical_sha256":"787b5f6fefd026db281d038c2986532d11fae98454cafc9c76ffc248e1bee424","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:39.688775Z","signature_b64":"8lS1hNT3k84OYogN/eR77wVCSFenEWd/ocIgIcTXFksZUm7gxmAANb7x+CKdhM3t82z5z8sk2euy/+nTw4vGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787b5f6fefd026db281d038c2986532d11fae98454cafc9c76ffc248e1bee424","last_reissued_at":"2026-05-17T23:55:39.688425Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:39.688425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07806","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-17T23:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7N0ESfyfvbNnucUiLmQ+BRvEk2/KDnIgJgXL2k2d4SPJJ4j9zcZ8CwB3SqykZZsB50+V9lZNgAvAN3K0bhZbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:18:22.310095Z"},"content_sha256":"b5c9bfa63f9aae051ee1b58399f59797e34b1f8c326318163690d867ed142c83","schema_version":"1.0","event_id":"sha256:b5c9bfa63f9aae051ee1b58399f59797e34b1f8c326318163690d867ed142c83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PB5V637P2ATNWKA5AOGCTBSTFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum-Polytope-Based Linear Programming Decoder for LDPC Codes via ADMM Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Francis C. M. Lau, Jing Bai, Yongchao Wang","submitted_at":"2019-01-23T10:33:10Z","abstract_excerpt":"In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition. Then, to solve the resulting LP problem, we propose an efficient iterative algorithm based on the alternating direction method of multipliers (ADMM) technique. In addition, the feasibility analysis of the proposed algorithm is presented. Furthermore, through exploiting the sparsity and orthogonality structures of the LP problem, the computational complexity of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07806","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-17T23:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6yO3FhioW3sTDNMEhhRSIytxt1D1683wVLEP6JOWdJ86WO9z7J7oGS2No64KE6fVrM1kAjWP4xVa8UrsoYZfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:18:22.310463Z"},"content_sha256":"a5c5a113022750c399dbb56bef8bdeaac5eb134eb9d735b4dfd6af43799af0a5","schema_version":"1.0","event_id":"sha256:a5c5a113022750c399dbb56bef8bdeaac5eb134eb9d735b4dfd6af43799af0a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PB5V637P2ATNWKA5AOGCTBSTFU/bundle.json","state_url":"https://pith.science/pith/PB5V637P2ATNWKA5AOGCTBSTFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PB5V637P2ATNWKA5AOGCTBSTFU/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-03T00:18:22Z","links":{"resolver":"https://pith.science/pith/PB5V637P2ATNWKA5AOGCTBSTFU","bundle":"https://pith.science/pith/PB5V637P2ATNWKA5AOGCTBSTFU/bundle.json","state":"https://pith.science/pith/PB5V637P2ATNWKA5AOGCTBSTFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PB5V637P2ATNWKA5AOGCTBSTFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PB5V637P2ATNWKA5AOGCTBSTFU","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":"ae6ce837f69961f56f3061c82725fed4018a24c2aed50aaa6a4770e50ac919f6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T10:33:10Z","title_canon_sha256":"2718b7bac1677f72983c06c613f59114f97e2d692abaa626d0ead2adf992f5a7"},"schema_version":"1.0","source":{"id":"1901.07806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07806","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07806v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07806","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"PB5V637P2ATN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PB5V637P2ATNWKA5","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PB5V637P","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:a5c5a113022750c399dbb56bef8bdeaac5eb134eb9d735b4dfd6af43799af0a5","target":"graph","created_at":"2026-05-17T23:55:39Z","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":"In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition. Then, to solve the resulting LP problem, we propose an efficient iterative algorithm based on the alternating direction method of multipliers (ADMM) technique. In addition, the feasibility analysis of the proposed algorithm is presented. Furthermore, through exploiting the sparsity and orthogonality structures of the LP problem, the computational complexity of ","authors_text":"Francis C. M. Lau, Jing Bai, Yongchao Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T10:33:10Z","title":"Minimum-Polytope-Based Linear Programming Decoder for LDPC Codes via ADMM Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07806","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:b5c9bfa63f9aae051ee1b58399f59797e34b1f8c326318163690d867ed142c83","target":"record","created_at":"2026-05-17T23:55:39Z","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":"ae6ce837f69961f56f3061c82725fed4018a24c2aed50aaa6a4770e50ac919f6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T10:33:10Z","title_canon_sha256":"2718b7bac1677f72983c06c613f59114f97e2d692abaa626d0ead2adf992f5a7"},"schema_version":"1.0","source":{"id":"1901.07806","kind":"arxiv","version":1}},"canonical_sha256":"787b5f6fefd026db281d038c2986532d11fae98454cafc9c76ffc248e1bee424","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"787b5f6fefd026db281d038c2986532d11fae98454cafc9c76ffc248e1bee424","first_computed_at":"2026-05-17T23:55:39.688425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:39.688425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8lS1hNT3k84OYogN/eR77wVCSFenEWd/ocIgIcTXFksZUm7gxmAANb7x+CKdhM3t82z5z8sk2euy/+nTw4vGDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:39.688775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5c9bfa63f9aae051ee1b58399f59797e34b1f8c326318163690d867ed142c83","sha256:a5c5a113022750c399dbb56bef8bdeaac5eb134eb9d735b4dfd6af43799af0a5"],"state_sha256":"47f9dc54988df29bd3681a46351acb9f2ffa5a57b002580cb0fdba7f106a2bbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gGoJAoYltFRZ5GXUb0ExXgTZyPqA555H783soL54r3uL1F/Yhvpz/gHdnRmE07KOwZ9Qe1X+FbpCxVA+HJHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:18:22.312499Z","bundle_sha256":"67956b1f5611a372589df164b2b4cc7de4fe3a59827ce4ff369ffc59cb93e2f6"}}