{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:EWLC4YR7VL7YXKGGLJO3IR3XCW","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":"36242fabeb141c3ad8ac42488f5407e189b8e22f9e2e7fa69749ea51816b5271","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-01T08:31:21Z","title_canon_sha256":"0bb21c52e10439201046b893a5f08a5d5b71116698fde97d8d6d523d9005eee2"},"schema_version":"1.0","source":{"id":"2306.00443","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.00443","created_at":"2026-07-05T06:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"2306.00443v3","created_at":"2026-07-05T06:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.00443","created_at":"2026-07-05T06:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"EWLC4YR7VL7Y","created_at":"2026-07-05T06:47:01Z"},{"alias_kind":"pith_short_16","alias_value":"EWLC4YR7VL7YXKGG","created_at":"2026-07-05T06:47:01Z"},{"alias_kind":"pith_short_8","alias_value":"EWLC4YR7","created_at":"2026-07-05T06:47:01Z"}],"graph_snapshots":[{"event_id":"sha256:5159f83a0e5ed7a38133cbf4e5edc420ec80b180b3a28331de2ef4d758772dd2","target":"graph","created_at":"2026-07-05T06:47:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.00443/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose an efficient decoding algorithm for short low-density parity check (LDPC) codes by carefully combining the belief propagation (BP) decoding and order statistic decoding (OSD) algorithms. Specifically, a modified BP (mBP) algorithm is applied for a certain number of iterations prior to OSD to enhance the reliability of the received message, where an offset parameter is utilized in mBP to control the weight of the extrinsic information in message passing. By carefully selecting the offset parameter and the number of mBP iterations, the number of errors in the most relia","authors_text":"Branka Vucetic, Chentao Yue, Weiyang Zhang, Yonghui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-01T08:31:21Z","title":"Efficient Near Maximum-Likelihood Reliability-Based Decoding for Short LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.00443","kind":"arxiv","version":3},"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:43f11ef32bf981d157473e52150c768eb9bcde2bdd68cf2173bb4aa2e9091a56","target":"record","created_at":"2026-07-05T06:47:01Z","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":"36242fabeb141c3ad8ac42488f5407e189b8e22f9e2e7fa69749ea51816b5271","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-01T08:31:21Z","title_canon_sha256":"0bb21c52e10439201046b893a5f08a5d5b71116698fde97d8d6d523d9005eee2"},"schema_version":"1.0","source":{"id":"2306.00443","kind":"arxiv","version":3}},"canonical_sha256":"25962e623faaff8ba8c65a5db4477715ba414527847ce55ad9671565a4df576a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25962e623faaff8ba8c65a5db4477715ba414527847ce55ad9671565a4df576a","first_computed_at":"2026-07-05T06:47:01.875908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:47:01.875908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XWMENFgCRRgCQ/QQ2HwffskmlnmYuCwmYsTUm1aSuI6t97/Ltuwwxfcyv5IlbUs3Y/Q7OVGNPimwJYGyTkwcBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:47:01.876405Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.00443","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43f11ef32bf981d157473e52150c768eb9bcde2bdd68cf2173bb4aa2e9091a56","sha256:5159f83a0e5ed7a38133cbf4e5edc420ec80b180b3a28331de2ef4d758772dd2"],"state_sha256":"f31ee7e988f19e600f2a9afadb3450ca9a1a4f5b6f97fe0d1fcb915d90d23dcc"}