{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LMSAOFZZRDQRFDA5UIL6QOYAJO","short_pith_number":"pith:LMSAOFZZ","schema_version":"1.0","canonical_sha256":"5b2407173988e1128c1da217e83b004b87bb1eed8b0591cf1b12439b8f3deae2","source":{"kind":"arxiv","id":"1306.3529","version":1},"attestation_state":"computed","paper":{"title":"Scalable Successive-Cancellation Hardware Decoder for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre J. Raymond, Warren J. Gross","submitted_at":"2013-06-14T23:38:58Z","abstract_excerpt":"Polar codes, discovered by Ar{\\i}kan, are the first error-correcting codes with an explicit construction to provably achieve channel capacity, asymptotically. However, their error-correction performance at finite lengths tends to be lower than existing capacity-approaching schemes. Using the successive-cancellation algorithm, polar decoders can be designed for very long codes, with low hardware complexity, leveraging the regular structure of such codes. We present an architecture and an implementation of a scalable hardware decoder based on this algorithm. This design is shown to scale to code"},"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":"1306.3529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-14T23:38:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d87ce91099900b51cb3a86f395cc74f46aad2712ec56dd08a4262dca1d4e52bf","abstract_canon_sha256":"7d82782456deb0d95fdde0ffd14223decdc7cf931247eb26857a9436b3ac6431"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:16.685199Z","signature_b64":"CjMO86B2Rctzr+kqXf+JnPmNdHTr8RDHQMDrmEDwjBm+fyNrzZu4UzjQvj3v7mTY4OPnSDUUrRcR/lishsTyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b2407173988e1128c1da217e83b004b87bb1eed8b0591cf1b12439b8f3deae2","last_reissued_at":"2026-05-18T01:49:16.684669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:16.684669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Successive-Cancellation Hardware Decoder for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre J. Raymond, Warren J. Gross","submitted_at":"2013-06-14T23:38:58Z","abstract_excerpt":"Polar codes, discovered by Ar{\\i}kan, are the first error-correcting codes with an explicit construction to provably achieve channel capacity, asymptotically. However, their error-correction performance at finite lengths tends to be lower than existing capacity-approaching schemes. Using the successive-cancellation algorithm, polar decoders can be designed for very long codes, with low hardware complexity, leveraging the regular structure of such codes. We present an architecture and an implementation of a scalable hardware decoder based on this algorithm. This design is shown to scale to code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3529","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":"1306.3529","created_at":"2026-05-18T01:49:16.684750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3529v1","created_at":"2026-05-18T01:49:16.684750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3529","created_at":"2026-05-18T01:49:16.684750+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMSAOFZZRDQR","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMSAOFZZRDQRFDA5","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMSAOFZZ","created_at":"2026-05-18T12:27:51.066281+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/LMSAOFZZRDQRFDA5UIL6QOYAJO","json":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO.json","graph_json":"https://pith.science/api/pith-number/LMSAOFZZRDQRFDA5UIL6QOYAJO/graph.json","events_json":"https://pith.science/api/pith-number/LMSAOFZZRDQRFDA5UIL6QOYAJO/events.json","paper":"https://pith.science/paper/LMSAOFZZ"},"agent_actions":{"view_html":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO","download_json":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO.json","view_paper":"https://pith.science/paper/LMSAOFZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3529&json=true","fetch_graph":"https://pith.science/api/pith-number/LMSAOFZZRDQRFDA5UIL6QOYAJO/graph.json","fetch_events":"https://pith.science/api/pith-number/LMSAOFZZRDQRFDA5UIL6QOYAJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/action/storage_attestation","attest_author":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/action/author_attestation","sign_citation":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/action/citation_signature","submit_replication":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/action/replication_record"}},"created_at":"2026-05-18T01:49:16.684750+00:00","updated_at":"2026-05-18T01:49:16.684750+00:00"}