{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RUGDMCXAC67OMTUC774BNEB47Y","short_pith_number":"pith:RUGDMCXA","schema_version":"1.0","canonical_sha256":"8d0c360ae017bee64e82fff816903cfe1d353d92a33e4d429b50fb0c25587d35","source":{"kind":"arxiv","id":"1508.02028","version":1},"attestation_state":"computed","paper":{"title":"Reduce the Complexity of List Decoding of Polar Codes by Tree-Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, David Tse, Hui Shen, Jie Jin, Kai Chen","submitted_at":"2015-08-09T14:26:48Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1508.02028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-09T14:26:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e7ee5b6b199297cb39ff50fbc357991b055b39ea6631f557279092b01dd651e0","abstract_canon_sha256":"2015412e65c6b4fb43434b6f363c245dc6441acf0776768500510c905acf6dc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:34.440607Z","signature_b64":"oS0rwQc/JkH7IdL3RxsPzQQf3r4F3oGsg4PZ7h3bO6m5WS6Msh3gtv8j/Gxc3sbw5iNq3KWz9JB6fEIGy5CIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d0c360ae017bee64e82fff816903cfe1d353d92a33e4d429b50fb0c25587d35","last_reissued_at":"2026-05-18T01:35:34.440101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:34.440101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduce the Complexity of List Decoding of Polar Codes by Tree-Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, David Tse, Hui Shen, Jie Jin, Kai Chen","submitted_at":"2015-08-09T14:26:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02028","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.02028","created_at":"2026-05-18T01:35:34.440178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02028v1","created_at":"2026-05-18T01:35:34.440178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02028","created_at":"2026-05-18T01:35:34.440178+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUGDMCXAC67O","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUGDMCXAC67OMTUC","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUGDMCXA","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RUGDMCXAC67OMTUC774BNEB47Y","json":"https://pith.science/pith/RUGDMCXAC67OMTUC774BNEB47Y.json","graph_json":"https://pith.science/api/pith-number/RUGDMCXAC67OMTUC774BNEB47Y/graph.json","events_json":"https://pith.science/api/pith-number/RUGDMCXAC67OMTUC774BNEB47Y/events.json","paper":"https://pith.science/paper/RUGDMCXA"},"agent_actions":{"view_html":"https://pith.science/pith/RUGDMCXAC67OMTUC774BNEB47Y","download_json":"https://pith.science/pith/RUGDMCXAC67OMTUC774BNEB47Y.json","view_paper":"https://pith.science/paper/RUGDMCXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02028&json=true","fetch_graph":"https://pith.science/api/pith-number/RUGDMCXAC67OMTUC774BNEB47Y/graph.json","fetch_events":"https://pith.science/api/pith-number/RUGDMCXAC67OMTUC774BNEB47Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUGDMCXAC67OMTUC774BNEB47Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUGDMCXAC67OMTUC774BNEB47Y/action/storage_attestation","attest_author":"https://pith.science/pith/RUGDMCXAC67OMTUC774BNEB47Y/action/author_attestation","sign_citation":"https://pith.science/pith/RUGDMCXAC67OMTUC774BNEB47Y/action/citation_signature","submit_replication":"https://pith.science/pith/RUGDMCXAC67OMTUC774BNEB47Y/action/replication_record"}},"created_at":"2026-05-18T01:35:34.440178+00:00","updated_at":"2026-05-18T01:35:34.440178+00:00"}