{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TWNYTIZD7JURPPRIM7RHYSH6LG","short_pith_number":"pith:TWNYTIZD","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"},"canonical_sha256":"9d9b89a323fa6917be2867e27c48fe598244fb92a9b7c9cbebe3298dcaa421f6","source":{"kind":"arxiv","id":"1301.7491","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7491","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7491v1","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7491","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"TWNYTIZD7JUR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TWNYTIZD7JURPPRI","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TWNYTIZD","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TWNYTIZD7JURPPRIM7RHYSH6LG","target":"record","payload":{"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"},"canonical_sha256":"9d9b89a323fa6917be2867e27c48fe598244fb92a9b7c9cbebe3298dcaa421f6","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"},"source_kind":"arxiv","source_id":"1301.7491","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQ3lsxdc+v5aDrb5SrGDIv/xFHPp2Z6c4YLwQ4kLmMVtOwJHCqB+3eswhpIbhEgEWRupcFsH8qq1EcUfsVHBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:22:57.236382Z"},"content_sha256":"3172cb684a0f235c943dccb075bc5f6728665197638b29b529430787cc03504b","schema_version":"1.0","event_id":"sha256:3172cb684a0f235c943dccb075bc5f6728665197638b29b529430787cc03504b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TWNYTIZD7JURPPRIM7RHYSH6LG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eewC7HNbxDxFCUOkYSNwr0cY9MCDxy/WgweeggQoWbr4bqYlJa+680GvdGNjthIeDHiK2AA9dG+sDjo8Cgc8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:22:57.236739Z"},"content_sha256":"40f04e67deabb2954a7798245d1c9da747c5bb76a6fb2c8cea2727aaf41e4791","schema_version":"1.0","event_id":"sha256:40f04e67deabb2954a7798245d1c9da747c5bb76a6fb2c8cea2727aaf41e4791"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/bundle.json","state_url":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T00:22:57Z","links":{"resolver":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG","bundle":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/bundle.json","state":"https://pith.science/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWNYTIZD7JURPPRIM7RHYSH6LG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TWNYTIZD7JURPPRIM7RHYSH6LG","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":"90f4029235ea016d8afe8c92b94c5ac14acb8abb847b7405b6771e780408ac5f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T02:14:02Z","title_canon_sha256":"4df493c40bea7bb37df13aaf3d20da728aaa9701b3c6eae5151b0f95e5e35ab3"},"schema_version":"1.0","source":{"id":"1301.7491","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7491","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7491v1","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7491","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"TWNYTIZD7JUR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TWNYTIZD7JURPPRI","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TWNYTIZD","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:40f04e67deabb2954a7798245d1c9da747c5bb76a6fb2c8cea2727aaf41e4791","target":"graph","created_at":"2026-05-18T03:34:49Z","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 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}}$","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-01-31T02:14:02Z","title":"On the Construction and Decoding of Concatenated Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7491","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:3172cb684a0f235c943dccb075bc5f6728665197638b29b529430787cc03504b","target":"record","created_at":"2026-05-18T03:34:49Z","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":"90f4029235ea016d8afe8c92b94c5ac14acb8abb847b7405b6771e780408ac5f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T02:14:02Z","title_canon_sha256":"4df493c40bea7bb37df13aaf3d20da728aaa9701b3c6eae5151b0f95e5e35ab3"},"schema_version":"1.0","source":{"id":"1301.7491","kind":"arxiv","version":1}},"canonical_sha256":"9d9b89a323fa6917be2867e27c48fe598244fb92a9b7c9cbebe3298dcaa421f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d9b89a323fa6917be2867e27c48fe598244fb92a9b7c9cbebe3298dcaa421f6","first_computed_at":"2026-05-18T03:34:49.388721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:49.388721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uVoRKfwxEWTs8H2Zu6GJ6cOAw9kcJZflk09kEw1nTH6Of2f59XMxgrkN5zRuGqCWGn3BFeJFaZ/BIdM+EHjSDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:49.389180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7491","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3172cb684a0f235c943dccb075bc5f6728665197638b29b529430787cc03504b","sha256:40f04e67deabb2954a7798245d1c9da747c5bb76a6fb2c8cea2727aaf41e4791"],"state_sha256":"ccb284412307ea7c69ca6c0f60824d8839efceeabc7866f92c8ac86cea422ec0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TIWRqjvKqhZtJ/ZH2+if6aS0pRTmh8iDXNUwuFJkRLJzY37pH0Y+qEv0U3FcEOimqPahEhO0oA5H218zZfnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:22:57.238686Z","bundle_sha256":"cc6bb75cc3dd2683e15445d8773ad024b6ee59d9248c0d5a6cca02c9f0b0283b"}}