{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SA3FJR47543AE2BCEODJXZOHAG","short_pith_number":"pith:SA3FJR47","schema_version":"1.0","canonical_sha256":"903654c79fef3602682223869be5c701804473df93275e55f43747fe75f52a3b","source":{"kind":"arxiv","id":"1805.03000","version":1},"attestation_state":"computed","paper":{"title":"An Implementation of List Successive Cancellation Decoder with Large List Size for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Bin Li, ChenYang Xia, Chi-Ying Tsui, ChongYang Zeng, Ji Chen, Jie Jin, YouZhe Fan","submitted_at":"2018-05-08T13:25:35Z","abstract_excerpt":"Polar codes are the first class of forward error correction (FEC) codes with a provably capacity-achieving capability. Using list successive cancellation decoding (LSCD) with a large list size, the error correction performance of polar codes exceeds other well-known FEC codes. However, the hardware complexity of LSCD rapidly increases with the list size, which incurs high usage of the resources on the field programmable gate array (FPGA) and significantly impedes the practical deployment of polar codes. To alleviate the high complexity, in this paper, two low-complexity decoding schemes and th"},"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":"1805.03000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-08T13:25:35Z","cross_cats_sorted":[],"title_canon_sha256":"16c86a51dc9f7bcf4c0863f966db7335093a694d28859fa598f5b1dbb54d7a63","abstract_canon_sha256":"387aee6e1d27fd9a3e6c50a0928cbd78c88c2d3fa18d8971b49bd4a42b0b3bc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:34.932954Z","signature_b64":"kvKHzFzsJxISM1q5JWvKtutYX/1W9BJO99zDAPN7HAI/a+31e6vIVVejmSHcyypGz/TJM4Vy0Bz/Z4oek9MIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"903654c79fef3602682223869be5c701804473df93275e55f43747fe75f52a3b","last_reissued_at":"2026-05-18T00:16:34.932270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:34.932270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Implementation of List Successive Cancellation Decoder with Large List Size for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Bin Li, ChenYang Xia, Chi-Ying Tsui, ChongYang Zeng, Ji Chen, Jie Jin, YouZhe Fan","submitted_at":"2018-05-08T13:25:35Z","abstract_excerpt":"Polar codes are the first class of forward error correction (FEC) codes with a provably capacity-achieving capability. Using list successive cancellation decoding (LSCD) with a large list size, the error correction performance of polar codes exceeds other well-known FEC codes. However, the hardware complexity of LSCD rapidly increases with the list size, which incurs high usage of the resources on the field programmable gate array (FPGA) and significantly impedes the practical deployment of polar codes. To alleviate the high complexity, in this paper, two low-complexity decoding schemes and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03000","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":"1805.03000","created_at":"2026-05-18T00:16:34.932381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03000v1","created_at":"2026-05-18T00:16:34.932381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03000","created_at":"2026-05-18T00:16:34.932381+00:00"},{"alias_kind":"pith_short_12","alias_value":"SA3FJR47543A","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"SA3FJR47543AE2BC","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"SA3FJR47","created_at":"2026-05-18T12:32:50.500415+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/SA3FJR47543AE2BCEODJXZOHAG","json":"https://pith.science/pith/SA3FJR47543AE2BCEODJXZOHAG.json","graph_json":"https://pith.science/api/pith-number/SA3FJR47543AE2BCEODJXZOHAG/graph.json","events_json":"https://pith.science/api/pith-number/SA3FJR47543AE2BCEODJXZOHAG/events.json","paper":"https://pith.science/paper/SA3FJR47"},"agent_actions":{"view_html":"https://pith.science/pith/SA3FJR47543AE2BCEODJXZOHAG","download_json":"https://pith.science/pith/SA3FJR47543AE2BCEODJXZOHAG.json","view_paper":"https://pith.science/paper/SA3FJR47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03000&json=true","fetch_graph":"https://pith.science/api/pith-number/SA3FJR47543AE2BCEODJXZOHAG/graph.json","fetch_events":"https://pith.science/api/pith-number/SA3FJR47543AE2BCEODJXZOHAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SA3FJR47543AE2BCEODJXZOHAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SA3FJR47543AE2BCEODJXZOHAG/action/storage_attestation","attest_author":"https://pith.science/pith/SA3FJR47543AE2BCEODJXZOHAG/action/author_attestation","sign_citation":"https://pith.science/pith/SA3FJR47543AE2BCEODJXZOHAG/action/citation_signature","submit_replication":"https://pith.science/pith/SA3FJR47543AE2BCEODJXZOHAG/action/replication_record"}},"created_at":"2026-05-18T00:16:34.932381+00:00","updated_at":"2026-05-18T00:16:34.932381+00:00"}