{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NXKAMYDOT36UUTQPXJFA54IKZD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aaf01446227292e77da4db8ccbab3f906c6c25a92159ff21e187e9127f5a78aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-06T00:06:21Z","title_canon_sha256":"ddb186a4c32fadde94f21089fabb6b4e5565cb054b10b7abd14d8b9bba44cfb2"},"schema_version":"1.0","source":{"id":"1308.1144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1144","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1144v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1144","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"NXKAMYDOT36U","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NXKAMYDOT36UUTQP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NXKAMYDO","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:c47bc50ddcdecaf74786a83714be379599043c8e0f5a9460a9570fef6c49b24a","target":"graph","created_at":"2026-05-18T00:58:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A scheme for concatenating the recently invented polar codes with non-binary MDS codes, as Reed-Solomon 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 upo","authors_text":"Hessam Mahdavifar, Inyup Kang, Jungwon Lee, Mostafa El-Khamy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-06T00:06:21Z","title":"Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1144","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1901606a61cdcd2011e4aacd3a7de94b1d29dc239e42a71a59228b098190c313","target":"record","created_at":"2026-05-18T00:58:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aaf01446227292e77da4db8ccbab3f906c6c25a92159ff21e187e9127f5a78aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-06T00:06:21Z","title_canon_sha256":"ddb186a4c32fadde94f21089fabb6b4e5565cb054b10b7abd14d8b9bba44cfb2"},"schema_version":"1.0","source":{"id":"1308.1144","kind":"arxiv","version":1}},"canonical_sha256":"6dd406606e9efd4a4e0fba4a0ef10ac8ff95eedf71b171e0ebb80478d9e26dea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dd406606e9efd4a4e0fba4a0ef10ac8ff95eedf71b171e0ebb80478d9e26dea","first_computed_at":"2026-05-18T00:58:42.113157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.113157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lbfN0szAu583LWzyBI1tghuaHpd+84FYMeBZuhLT5Pb5Ss5XlDaSWJWV7PmAS5q/yhJJWl47ZaKWJZk7pZy7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.113807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1901606a61cdcd2011e4aacd3a7de94b1d29dc239e42a71a59228b098190c313","sha256:c47bc50ddcdecaf74786a83714be379599043c8e0f5a9460a9570fef6c49b24a"],"state_sha256":"e18c966344032bf86c02b513e7aa29d02694e50a4a37962023187b06f3978966"}