{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IEPJYJJY7TEPOAPXSRVZHM2KRT","short_pith_number":"pith:IEPJYJJY","schema_version":"1.0","canonical_sha256":"411e9c2538fcc8f701f7946b93b34a8cf835cb44740b077ac7373929dc210578","source":{"kind":"arxiv","id":"1504.03437","version":1},"attestation_state":"computed","paper":{"title":"Low-latency List Decoding Of Polar Codes With Double Thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bin Li, ChenYang Xia, Chi-Ying Tsui, Hui Shen, Ji Chen, Jie Jin, YouZhe Fan","submitted_at":"2015-04-14T07:12:24Z","abstract_excerpt":"For polar codes with short-to-medium code length, list successive cancellation decoding is used to achieve a good error-correcting performance. However, list pruning in the current list decoding is based on the sorting strategy and its timing complexity is high. This results in a long decoding latency for large list size. In this work, aiming at a low-latency list decoding implementation, a double thresholding algorithm is proposed for a fast list pruning. As a result, with a negligible performance degradation, the list pruning delay is greatly reduced. Based on the double thresholding, a low-"},"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":"1504.03437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-04-14T07:12:24Z","cross_cats_sorted":[],"title_canon_sha256":"d9e5ed5fe4bd581e3954b32edd5018bec2483609a04ed409965eeb85743ba9f6","abstract_canon_sha256":"10528438827d2346ae74266c6c69640822de0b4fcf9cf4cb66e3e0749bcadcc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:55.398085Z","signature_b64":"ddePesDiJjnZ/nCLT9SGtEeoY+rRBoR5lmbhMNVQrhGV/t5swzCWBYS1IBgaxeUAatMWHqTQKcMO97iA5wF0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"411e9c2538fcc8f701f7946b93b34a8cf835cb44740b077ac7373929dc210578","last_reissued_at":"2026-05-18T01:25:55.397286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:55.397286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-latency List Decoding Of Polar Codes With Double Thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bin Li, ChenYang Xia, Chi-Ying Tsui, Hui Shen, Ji Chen, Jie Jin, YouZhe Fan","submitted_at":"2015-04-14T07:12:24Z","abstract_excerpt":"For polar codes with short-to-medium code length, list successive cancellation decoding is used to achieve a good error-correcting performance. However, list pruning in the current list decoding is based on the sorting strategy and its timing complexity is high. This results in a long decoding latency for large list size. In this work, aiming at a low-latency list decoding implementation, a double thresholding algorithm is proposed for a fast list pruning. As a result, with a negligible performance degradation, the list pruning delay is greatly reduced. Based on the double thresholding, a low-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03437","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":"1504.03437","created_at":"2026-05-18T01:25:55.397430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03437v1","created_at":"2026-05-18T01:25:55.397430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03437","created_at":"2026-05-18T01:25:55.397430+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEPJYJJY7TEP","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEPJYJJY7TEPOAPX","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEPJYJJY","created_at":"2026-05-18T12:29:25.134429+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/IEPJYJJY7TEPOAPXSRVZHM2KRT","json":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT.json","graph_json":"https://pith.science/api/pith-number/IEPJYJJY7TEPOAPXSRVZHM2KRT/graph.json","events_json":"https://pith.science/api/pith-number/IEPJYJJY7TEPOAPXSRVZHM2KRT/events.json","paper":"https://pith.science/paper/IEPJYJJY"},"agent_actions":{"view_html":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT","download_json":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT.json","view_paper":"https://pith.science/paper/IEPJYJJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03437&json=true","fetch_graph":"https://pith.science/api/pith-number/IEPJYJJY7TEPOAPXSRVZHM2KRT/graph.json","fetch_events":"https://pith.science/api/pith-number/IEPJYJJY7TEPOAPXSRVZHM2KRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/action/storage_attestation","attest_author":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/action/author_attestation","sign_citation":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/action/citation_signature","submit_replication":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/action/replication_record"}},"created_at":"2026-05-18T01:25:55.397430+00:00","updated_at":"2026-05-18T01:25:55.397430+00:00"}