{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RUGDMCXAC67OMTUC774BNEB47Y","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":"2015412e65c6b4fb43434b6f363c245dc6441acf0776768500510c905acf6dc6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-09T14:26:48Z","title_canon_sha256":"e7ee5b6b199297cb39ff50fbc357991b055b39ea6631f557279092b01dd651e0"},"schema_version":"1.0","source":{"id":"1508.02028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02028","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02028v1","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02028","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"RUGDMCXAC67O","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RUGDMCXAC67OMTUC","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RUGDMCXA","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:d24f06ec388e88cb00d70be751683c6fd7355c5fb4d2baf552b2ca61c329f621","target":"graph","created_at":"2026-05-18T01:35:34Z","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 under cyclic redundancy check aided successive cancellation list (CA-SCL) decoding can outperform the turbo codes and the LDPC codes when code lengths are configured to be several kilobits. In order to reduce the decoding complexity, a novel tree-pruning scheme for the \\mbox{SCL/CA-SCL} decoding algorithms is proposed in this paper. In each step of the decoding procedure, the candidate paths with metrics less than a threshold are dropped directly to avoid the unnecessary computations for the path searching on the descendant branches of them. Given a candidate path, an upper bound o","authors_text":"Bin Li, David Tse, Hui Shen, Jie Jin, Kai Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-09T14:26:48Z","title":"Reduce the Complexity of List Decoding of Polar Codes by Tree-Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02028","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:d745b1ef5ed7e85a7317429c36654a0a6c105688de3e0605f907e4337193a9aa","target":"record","created_at":"2026-05-18T01:35:34Z","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":"2015412e65c6b4fb43434b6f363c245dc6441acf0776768500510c905acf6dc6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-09T14:26:48Z","title_canon_sha256":"e7ee5b6b199297cb39ff50fbc357991b055b39ea6631f557279092b01dd651e0"},"schema_version":"1.0","source":{"id":"1508.02028","kind":"arxiv","version":1}},"canonical_sha256":"8d0c360ae017bee64e82fff816903cfe1d353d92a33e4d429b50fb0c25587d35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d0c360ae017bee64e82fff816903cfe1d353d92a33e4d429b50fb0c25587d35","first_computed_at":"2026-05-18T01:35:34.440101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:34.440101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oS0rwQc/JkH7IdL3RxsPzQQf3r4F3oGsg4PZ7h3bO6m5WS6Msh3gtv8j/Gxc3sbw5iNq3KWz9JB6fEIGy5CIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:34.440607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d745b1ef5ed7e85a7317429c36654a0a6c105688de3e0605f907e4337193a9aa","sha256:d24f06ec388e88cb00d70be751683c6fd7355c5fb4d2baf552b2ca61c329f621"],"state_sha256":"9619dfbd5404847774b84c95fd799625d0a4c860286ec84d4fb46ea67ee71658"}