{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TWNYTIZD7JURPPRIM7RHYSH6LG","short_pith_number":"pith:TWNYTIZD","schema_version":"1.0","canonical_sha256":"9d9b89a323fa6917be2867e27c48fe598244fb92a9b7c9cbebe3298dcaa421f6","source":{"kind":"arxiv","id":"1301.7491","version":1},"attestation_state":"computed","paper":{"title":"On the Construction and Decoding of Concatenated Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Inyup Kang, Jungwon Lee, Mostafa El-Khamy","submitted_at":"2013-01-31T02:14:02Z","abstract_excerpt":"A scheme for concatenating the recently invented polar codes with interleaved block codes is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate. We show that for any $\\epsilon > 0$, and total frame length $N$, the parameters of the scheme can be set such that the frame error probability is less than $2^{-N^{1-\\epsilon}}$, while the scheme is still capacity achieving. This improves upon $2^{-N^{0.5-\\eps}}$"},"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":"1301.7491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T02:14:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4df493c40bea7bb37df13aaf3d20da728aaa9701b3c6eae5151b0f95e5e35ab3","abstract_canon_sha256":"90f4029235ea016d8afe8c92b94c5ac14acb8abb847b7405b6771e780408ac5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:49.389180Z","signature_b64":"uVoRKfwxEWTs8H2Zu6GJ6cOAw9kcJZflk09kEw1nTH6Of2f59XMxgrkN5zRuGqCWGn3BFeJFaZ/BIdM+EHjSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d9b89a323fa6917be2867e27c48fe598244fb92a9b7c9cbebe3298dcaa421f6","last_reissued_at":"2026-05-18T03:34:49.388721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:49.388721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Construction and Decoding of Concatenated Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Inyup Kang, Jungwon Lee, Mostafa El-Khamy","submitted_at":"2013-01-31T02:14:02Z","abstract_excerpt":"A scheme for concatenating the recently invented polar codes with interleaved block codes is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate. We show that for any $\\epsilon > 0$, and total frame length $N$, the parameters of the scheme can be set such that the frame error probability is less than $2^{-N^{1-\\epsilon}}$, while the scheme is still capacity achieving. This improves upon $2^{-N^{0.5-\\eps}}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7491","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":"1301.7491","created_at":"2026-05-18T03:34:49.388790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7491v1","created_at":"2026-05-18T03:34:49.388790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7491","created_at":"2026-05-18T03:34:49.388790+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWNYTIZD7JUR","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWNYTIZD7JURPPRI","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWNYTIZD","created_at":"2026-05-18T12:28:02.375192+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/TWNYTIZD7JURPPRIM7RHYSH6LG","json":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG.json","graph_json":"https://pith.science/api/pith-number/TWNYTIZD7JURPPRIM7RHYSH6LG/graph.json","events_json":"https://pith.science/api/pith-number/TWNYTIZD7JURPPRIM7RHYSH6LG/events.json","paper":"https://pith.science/paper/TWNYTIZD"},"agent_actions":{"view_html":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG","download_json":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG.json","view_paper":"https://pith.science/paper/TWNYTIZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7491&json=true","fetch_graph":"https://pith.science/api/pith-number/TWNYTIZD7JURPPRIM7RHYSH6LG/graph.json","fetch_events":"https://pith.science/api/pith-number/TWNYTIZD7JURPPRIM7RHYSH6LG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/action/storage_attestation","attest_author":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/action/author_attestation","sign_citation":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/action/citation_signature","submit_replication":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/action/replication_record"}},"created_at":"2026-05-18T03:34:49.388790+00:00","updated_at":"2026-05-18T03:34:49.388790+00:00"}