{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D3PXHKGCNJ4IOWPKHSGADTHYU4","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":"bb0da99d47343fa8df81a98e19d2c83a786b458a5bb8be70ec5070d8296bba87","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T21:41:13Z","title_canon_sha256":"f512b13d74ae1da3db2f790cf73eb64935d4b1add63df173e718dfc1b4112e71"},"schema_version":"1.0","source":{"id":"1406.7036","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7036","created_at":"2026-05-18T02:42:25Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7036v2","created_at":"2026-05-18T02:42:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7036","created_at":"2026-05-18T02:42:25Z"},{"alias_kind":"pith_short_12","alias_value":"D3PXHKGCNJ4I","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D3PXHKGCNJ4IOWPK","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D3PXHKGC","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:2ca6d70c6f30355ec80eb77ee3172a897e7eb03bc679213601895cf86acec41e","target":"graph","created_at":"2026-05-18T02:42:25Z","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":"Polar codes, as the first provable capacity-achieving error-correcting codes, have received much attention in recent years. However, the decoding performance of polar codes with traditional successive-cancellation (SC) algorithm cannot match that of the low-density parity-check (LDPC) or turbo codes. Because SC list (SCL) decoding algorithm can significantly improve the error-correcting performance of polar codes, design of SCL decoders is important for polar codes to be deployed in practical applications. However, because the prior latency reduction approaches for SC decoders are not applicab","authors_text":"Bo Yuan, Keshab K. Parhi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T21:41:13Z","title":"Low-Latency Successive-Cancellation List Decoders for Polar Codes with Multi-bit Decision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7036","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:f1b7cd188759a3130a25fdbf04a7fcc5904f9c304b5e7c63f4007878e025b32e","target":"record","created_at":"2026-05-18T02:42:25Z","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":"bb0da99d47343fa8df81a98e19d2c83a786b458a5bb8be70ec5070d8296bba87","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T21:41:13Z","title_canon_sha256":"f512b13d74ae1da3db2f790cf73eb64935d4b1add63df173e718dfc1b4112e71"},"schema_version":"1.0","source":{"id":"1406.7036","kind":"arxiv","version":2}},"canonical_sha256":"1edf73a8c26a788759ea3c8c01ccf8a700c05dee89033f37f380fc3d1b6065bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1edf73a8c26a788759ea3c8c01ccf8a700c05dee89033f37f380fc3d1b6065bc","first_computed_at":"2026-05-18T02:42:25.729330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:25.729330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2vo5lRtvMuWWZbGztFSEdt6nE+fJzcosQ0UrPbRkDZqKSrPdz+umyZM893+f8ZgVu/+4FbdkIB1CFjfWOuRwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:25.729805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7036","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1b7cd188759a3130a25fdbf04a7fcc5904f9c304b5e7c63f4007878e025b32e","sha256:2ca6d70c6f30355ec80eb77ee3172a897e7eb03bc679213601895cf86acec41e"],"state_sha256":"c26bbc99e80efa23d830944063a9a27c4a27d42c32f6fc37ecd62346394183f6"}