{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NUNNOAUZFCPO7SXKQFUUOZARXG","short_pith_number":"pith:NUNNOAUZ","schema_version":"1.0","canonical_sha256":"6d1ad70299289eefcaea8169476411b98c3a0ea9c2da4445a85951874b969b58","source":{"kind":"arxiv","id":"1701.08126","version":1},"attestation_state":"computed","paper":{"title":"Fast Simplified Successive-Cancellation List Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross","submitted_at":"2017-01-27T17:39:53Z","abstract_excerpt":"Polar codes are capacity achieving error correcting codes that can be decoded through the successive-cancellation algorithm. To improve its error-correction performance, a list-based version called successive-cancellation list (SCL) has been proposed in the past, that however substantially increases the number of time-steps in the decoding process. The simplified SCL (SSCL) decoding algorithm exploits constituent codes within the polar code structure to greatly reduce the required number of time-steps without introducing any error-correction performance loss. In this paper, we propose a faster"},"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":"1701.08126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-27T17:39:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15dd6fd02f93a1c5928f5260147483e0ca29d63c40b3a1bf68f26117083a7afb","abstract_canon_sha256":"7466066fd7b0a02d51057c224aadb7e96b189bac9d7654cc8957708aa4dab500"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:58.784772Z","signature_b64":"+lK4h+/bxHFYTUrIVfbXVq3x6J9cV+gfGtQdNNDpBkOqevudjg8Hnka0Op0cW6barWwDjk7xx6xJAJFSdiKjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d1ad70299289eefcaea8169476411b98c3a0ea9c2da4445a85951874b969b58","last_reissued_at":"2026-05-18T00:51:58.784229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:58.784229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Simplified Successive-Cancellation List Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross","submitted_at":"2017-01-27T17:39:53Z","abstract_excerpt":"Polar codes are capacity achieving error correcting codes that can be decoded through the successive-cancellation algorithm. To improve its error-correction performance, a list-based version called successive-cancellation list (SCL) has been proposed in the past, that however substantially increases the number of time-steps in the decoding process. The simplified SCL (SSCL) decoding algorithm exploits constituent codes within the polar code structure to greatly reduce the required number of time-steps without introducing any error-correction performance loss. In this paper, we propose a faster"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08126","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":"1701.08126","created_at":"2026-05-18T00:51:58.784332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08126v1","created_at":"2026-05-18T00:51:58.784332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08126","created_at":"2026-05-18T00:51:58.784332+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUNNOAUZFCPO","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUNNOAUZFCPO7SXK","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUNNOAUZ","created_at":"2026-05-18T12:31:34.259226+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/NUNNOAUZFCPO7SXKQFUUOZARXG","json":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG.json","graph_json":"https://pith.science/api/pith-number/NUNNOAUZFCPO7SXKQFUUOZARXG/graph.json","events_json":"https://pith.science/api/pith-number/NUNNOAUZFCPO7SXKQFUUOZARXG/events.json","paper":"https://pith.science/paper/NUNNOAUZ"},"agent_actions":{"view_html":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG","download_json":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG.json","view_paper":"https://pith.science/paper/NUNNOAUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08126&json=true","fetch_graph":"https://pith.science/api/pith-number/NUNNOAUZFCPO7SXKQFUUOZARXG/graph.json","fetch_events":"https://pith.science/api/pith-number/NUNNOAUZFCPO7SXKQFUUOZARXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/action/storage_attestation","attest_author":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/action/author_attestation","sign_citation":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/action/citation_signature","submit_replication":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/action/replication_record"}},"created_at":"2026-05-18T00:51:58.784332+00:00","updated_at":"2026-05-18T00:51:58.784332+00:00"}