{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TCY4GIIJHGI3LOGUHDDY2AE2DJ","short_pith_number":"pith:TCY4GIIJ","schema_version":"1.0","canonical_sha256":"98b1c321093991b5b8d438c78d009a1a59a138c8bbca61769d2a0b1eb3ef74d7","source":{"kind":"arxiv","id":"1505.01466","version":2},"attestation_state":"computed","paper":{"title":"Fast List Decoders for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Claude Thibeault, Gabi Sarkis, Pascal Giard, Warren J. Gross","submitted_at":"2015-05-06T19:15:44Z","abstract_excerpt":"Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many methods to improve the error-correction performance of polar codes, list decoding yields the best results, especially when the polar code is concatenated with a cyclic redundancy check (CRC). List decoding involves exploring several decoding paths with SC decoding, and therefore tends to be slower "},"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":"1505.01466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-06T19:15:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d6aa895bcc61c02889151e75a1ae64176c1b0332243a65db68504ce80330e45a","abstract_canon_sha256":"797e62b69a6696c04f59e4dbf67b074cdb85fd1fb9fb243354435d129d67ba2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:48.274427Z","signature_b64":"IshR1D/i8LVpSdPXuxyd87oy/fEMKA+5Z3rFJYx9pBQnfEthqrAorl55JmS6knowCU6pG0IBQdMXKRFEgkQfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98b1c321093991b5b8d438c78d009a1a59a138c8bbca61769d2a0b1eb3ef74d7","last_reissued_at":"2026-05-18T01:23:48.273781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:48.273781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast List Decoders for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Claude Thibeault, Gabi Sarkis, Pascal Giard, Warren J. Gross","submitted_at":"2015-05-06T19:15:44Z","abstract_excerpt":"Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many methods to improve the error-correction performance of polar codes, list decoding yields the best results, especially when the polar code is concatenated with a cyclic redundancy check (CRC). List decoding involves exploring several decoding paths with SC decoding, and therefore tends to be slower "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01466","kind":"arxiv","version":2},"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":"1505.01466","created_at":"2026-05-18T01:23:48.273896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01466v2","created_at":"2026-05-18T01:23:48.273896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01466","created_at":"2026-05-18T01:23:48.273896+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCY4GIIJHGI3","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCY4GIIJHGI3LOGU","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCY4GIIJ","created_at":"2026-05-18T12:29:42.218222+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/TCY4GIIJHGI3LOGUHDDY2AE2DJ","json":"https://pith.science/pith/TCY4GIIJHGI3LOGUHDDY2AE2DJ.json","graph_json":"https://pith.science/api/pith-number/TCY4GIIJHGI3LOGUHDDY2AE2DJ/graph.json","events_json":"https://pith.science/api/pith-number/TCY4GIIJHGI3LOGUHDDY2AE2DJ/events.json","paper":"https://pith.science/paper/TCY4GIIJ"},"agent_actions":{"view_html":"https://pith.science/pith/TCY4GIIJHGI3LOGUHDDY2AE2DJ","download_json":"https://pith.science/pith/TCY4GIIJHGI3LOGUHDDY2AE2DJ.json","view_paper":"https://pith.science/paper/TCY4GIIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01466&json=true","fetch_graph":"https://pith.science/api/pith-number/TCY4GIIJHGI3LOGUHDDY2AE2DJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TCY4GIIJHGI3LOGUHDDY2AE2DJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCY4GIIJHGI3LOGUHDDY2AE2DJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCY4GIIJHGI3LOGUHDDY2AE2DJ/action/storage_attestation","attest_author":"https://pith.science/pith/TCY4GIIJHGI3LOGUHDDY2AE2DJ/action/author_attestation","sign_citation":"https://pith.science/pith/TCY4GIIJHGI3LOGUHDDY2AE2DJ/action/citation_signature","submit_replication":"https://pith.science/pith/TCY4GIIJHGI3LOGUHDDY2AE2DJ/action/replication_record"}},"created_at":"2026-05-18T01:23:48.273896+00:00","updated_at":"2026-05-18T01:23:48.273896+00:00"}