{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KWRA74XI2B3WGPTGCA76AHLBEC","short_pith_number":"pith:KWRA74XI","schema_version":"1.0","canonical_sha256":"55a20ff2e8d077633e66103fe01d6120855ec6c9c29e192ffe9852e514f35ced","source":{"kind":"arxiv","id":"1111.4362","version":1},"attestation_state":"computed","paper":{"title":"Hardware Implementation of Successive Cancellation Decoders for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.AR","authors_text":"Alexander Vardy, Alexandre J. Raymond, Camille Leroux, Gabi Sarkis, Ido Tal, Warren J. Gross","submitted_at":"2011-11-18T13:40:16Z","abstract_excerpt":"The recently-discovered polar codes are seen as a major breakthrough in coding theory; they provably achieve the theoretical capacity of discrete memoryless channels using the low complexity successive cancellation (SC) decoding algorithm. Motivated by recent developments in polar coding theory, we propose a family of efficient hardware implementations for SC polar decoders. We show that such decoders can be implemented with O(n) processing elements, O(n) memory elements, and can provide a constant throughput for a given target clock frequency. Furthermore, we show that SC decoding can be impl"},"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":"1111.4362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2011-11-18T13:40:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"58b342036d9c3b7735d394e1cc71cc9f2df76623a5801618f7e71c32cf8013d3","abstract_canon_sha256":"7c8871e5b51842bd1c40db4e293aaf66524f74c9a36f65002f79f3bfb8012e12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:28.808589Z","signature_b64":"cGEUx3Y7nc7ZDPTKrN8pQsessQi35k2Xp64TeomRr4PF8zX09AEBuQ+d1KphIVFWiOWtBalym0+F+9IVVFP8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a20ff2e8d077633e66103fe01d6120855ec6c9c29e192ffe9852e514f35ced","last_reissued_at":"2026-05-18T02:21:28.807906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:28.807906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardware Implementation of Successive Cancellation Decoders for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.AR","authors_text":"Alexander Vardy, Alexandre J. Raymond, Camille Leroux, Gabi Sarkis, Ido Tal, Warren J. Gross","submitted_at":"2011-11-18T13:40:16Z","abstract_excerpt":"The recently-discovered polar codes are seen as a major breakthrough in coding theory; they provably achieve the theoretical capacity of discrete memoryless channels using the low complexity successive cancellation (SC) decoding algorithm. Motivated by recent developments in polar coding theory, we propose a family of efficient hardware implementations for SC polar decoders. We show that such decoders can be implemented with O(n) processing elements, O(n) memory elements, and can provide a constant throughput for a given target clock frequency. Furthermore, we show that SC decoding can be impl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4362","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":"1111.4362","created_at":"2026-05-18T02:21:28.808016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.4362v1","created_at":"2026-05-18T02:21:28.808016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4362","created_at":"2026-05-18T02:21:28.808016+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWRA74XI2B3W","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWRA74XI2B3WGPTG","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWRA74XI","created_at":"2026-05-18T12:26:34.985390+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/KWRA74XI2B3WGPTGCA76AHLBEC","json":"https://pith.science/pith/KWRA74XI2B3WGPTGCA76AHLBEC.json","graph_json":"https://pith.science/api/pith-number/KWRA74XI2B3WGPTGCA76AHLBEC/graph.json","events_json":"https://pith.science/api/pith-number/KWRA74XI2B3WGPTGCA76AHLBEC/events.json","paper":"https://pith.science/paper/KWRA74XI"},"agent_actions":{"view_html":"https://pith.science/pith/KWRA74XI2B3WGPTGCA76AHLBEC","download_json":"https://pith.science/pith/KWRA74XI2B3WGPTGCA76AHLBEC.json","view_paper":"https://pith.science/paper/KWRA74XI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.4362&json=true","fetch_graph":"https://pith.science/api/pith-number/KWRA74XI2B3WGPTGCA76AHLBEC/graph.json","fetch_events":"https://pith.science/api/pith-number/KWRA74XI2B3WGPTGCA76AHLBEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWRA74XI2B3WGPTGCA76AHLBEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWRA74XI2B3WGPTGCA76AHLBEC/action/storage_attestation","attest_author":"https://pith.science/pith/KWRA74XI2B3WGPTGCA76AHLBEC/action/author_attestation","sign_citation":"https://pith.science/pith/KWRA74XI2B3WGPTGCA76AHLBEC/action/citation_signature","submit_replication":"https://pith.science/pith/KWRA74XI2B3WGPTGCA76AHLBEC/action/replication_record"}},"created_at":"2026-05-18T02:21:28.808016+00:00","updated_at":"2026-05-18T02:21:28.808016+00:00"}