{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QKPJ5FUMU3H22U2RT4CTX73P3A","short_pith_number":"pith:QKPJ5FUM","schema_version":"1.0","canonical_sha256":"829e9e968ca6cfad53519f053bff6fd82f9efbcf744db5dbfbc386a4594bce54","source":{"kind":"arxiv","id":"1702.00938","version":1},"attestation_state":"computed","paper":{"title":"A Multi-Gbps Unrolled Hardware List Decoder for a Systematic Polar Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Claude Thibeault, Pascal Giard, Thomas Christoph M\\\"uller, Warren J. Gross","submitted_at":"2017-02-03T08:48:52Z","abstract_excerpt":"Polar codes are a new class of block codes with an explicit construction that provably achieve the capacity of various communications channels, even with the low-complexity successive-cancellation (SC) decoding algorithm. Yet, the more complex successive-cancellation list (SCL) decoding algorithm is gathering more attention lately as it significantly improves the error-correction performance of short- to moderate-length polar codes, especially when they are concatenated with a cyclic redundancy check code. However, as SCL decoding explores several decoding paths, existing hardware implementati"},"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":"1702.00938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-02-03T08:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"008dd2695772a56b51baea09fac7b5533b2622997df2584650e8ae6d903ea9a1","abstract_canon_sha256":"6bd642241a2b3592c3d08f20ef49aec3f73e33de5187debecf80bc5aba2373bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:51.637287Z","signature_b64":"YVZd6z8pnSI48XyC59IEJZJT/D0brLJFZcNBC04Bqw1EBNjOVttBjlaOnnL0kC99vNF1hfoAx+wOz+PVrxw2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"829e9e968ca6cfad53519f053bff6fd82f9efbcf744db5dbfbc386a4594bce54","last_reissued_at":"2026-05-18T00:44:51.636789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:51.636789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Multi-Gbps Unrolled Hardware List Decoder for a Systematic Polar Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Claude Thibeault, Pascal Giard, Thomas Christoph M\\\"uller, Warren J. Gross","submitted_at":"2017-02-03T08:48:52Z","abstract_excerpt":"Polar codes are a new class of block codes with an explicit construction that provably achieve the capacity of various communications channels, even with the low-complexity successive-cancellation (SC) decoding algorithm. Yet, the more complex successive-cancellation list (SCL) decoding algorithm is gathering more attention lately as it significantly improves the error-correction performance of short- to moderate-length polar codes, especially when they are concatenated with a cyclic redundancy check code. However, as SCL decoding explores several decoding paths, existing hardware implementati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00938","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":"1702.00938","created_at":"2026-05-18T00:44:51.636881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00938v1","created_at":"2026-05-18T00:44:51.636881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00938","created_at":"2026-05-18T00:44:51.636881+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKPJ5FUMU3H2","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKPJ5FUMU3H22U2R","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKPJ5FUM","created_at":"2026-05-18T12:31:39.905425+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/QKPJ5FUMU3H22U2RT4CTX73P3A","json":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A.json","graph_json":"https://pith.science/api/pith-number/QKPJ5FUMU3H22U2RT4CTX73P3A/graph.json","events_json":"https://pith.science/api/pith-number/QKPJ5FUMU3H22U2RT4CTX73P3A/events.json","paper":"https://pith.science/paper/QKPJ5FUM"},"agent_actions":{"view_html":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A","download_json":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A.json","view_paper":"https://pith.science/paper/QKPJ5FUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00938&json=true","fetch_graph":"https://pith.science/api/pith-number/QKPJ5FUMU3H22U2RT4CTX73P3A/graph.json","fetch_events":"https://pith.science/api/pith-number/QKPJ5FUMU3H22U2RT4CTX73P3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/action/storage_attestation","attest_author":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/action/author_attestation","sign_citation":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/action/citation_signature","submit_replication":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/action/replication_record"}},"created_at":"2026-05-18T00:44:51.636881+00:00","updated_at":"2026-05-18T00:44:51.636881+00:00"}