{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PZEWOH2CTEHNAM73OJQWFVXQC6","short_pith_number":"pith:PZEWOH2C","schema_version":"1.0","canonical_sha256":"7e49671f42990ed033fb726162d6f0178b2c03c6364fb20b85fd71c16b4cc546","source":{"kind":"arxiv","id":"1809.03606","version":1},"attestation_state":"computed","paper":{"title":"Towards Practical Software Stack Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Harsh Aurora, Warren J. Gross","submitted_at":"2018-09-10T21:32:09Z","abstract_excerpt":"The successive cancellation list decoding algorithm for polar codes yields near-optimal decoding performance at the cost of high implementation complexity. The successive cancellation stack algorithm has been shown to provide similar decoding performance at a much lower computational complexity, but software implementations report a sub-par T/P performance. In this technical report, the benefits of the fast simplified successive cancellation list decoder are extended to the stack algorithm, resulting in a throughput increase by two orders of magnitude over the traditional stack decoder."},"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":"1809.03606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T21:32:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eb55582394936adf1c9ea223ab9b6e19038ae0a7aafd57255c502a9de6c8b207","abstract_canon_sha256":"f52574d4980ada33a38c150152d6147cd08f2ffdd3e6fd7adcb45efa59c2d7aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:00.340223Z","signature_b64":"RQTRKRh0X/GIZUqON86WQZ4sVrJxAkElpOXthGz02ExVg/aLILVfbAutgmph8InKbOJPqYJR6EkSV/XvG+LdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e49671f42990ed033fb726162d6f0178b2c03c6364fb20b85fd71c16b4cc546","last_reissued_at":"2026-05-18T00:06:00.339625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:00.339625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Practical Software Stack Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Harsh Aurora, Warren J. Gross","submitted_at":"2018-09-10T21:32:09Z","abstract_excerpt":"The successive cancellation list decoding algorithm for polar codes yields near-optimal decoding performance at the cost of high implementation complexity. The successive cancellation stack algorithm has been shown to provide similar decoding performance at a much lower computational complexity, but software implementations report a sub-par T/P performance. In this technical report, the benefits of the fast simplified successive cancellation list decoder are extended to the stack algorithm, resulting in a throughput increase by two orders of magnitude over the traditional stack decoder."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03606","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":"1809.03606","created_at":"2026-05-18T00:06:00.339717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.03606v1","created_at":"2026-05-18T00:06:00.339717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03606","created_at":"2026-05-18T00:06:00.339717+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZEWOH2CTEHN","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZEWOH2CTEHNAM73","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZEWOH2C","created_at":"2026-05-18T12:32:46.962924+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/PZEWOH2CTEHNAM73OJQWFVXQC6","json":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6.json","graph_json":"https://pith.science/api/pith-number/PZEWOH2CTEHNAM73OJQWFVXQC6/graph.json","events_json":"https://pith.science/api/pith-number/PZEWOH2CTEHNAM73OJQWFVXQC6/events.json","paper":"https://pith.science/paper/PZEWOH2C"},"agent_actions":{"view_html":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6","download_json":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6.json","view_paper":"https://pith.science/paper/PZEWOH2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.03606&json=true","fetch_graph":"https://pith.science/api/pith-number/PZEWOH2CTEHNAM73OJQWFVXQC6/graph.json","fetch_events":"https://pith.science/api/pith-number/PZEWOH2CTEHNAM73OJQWFVXQC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/action/storage_attestation","attest_author":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/action/author_attestation","sign_citation":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/action/citation_signature","submit_replication":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/action/replication_record"}},"created_at":"2026-05-18T00:06:00.339717+00:00","updated_at":"2026-05-18T00:06:00.339717+00:00"}