{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LPVCLXQY43BB7V465AEQT6XYHD","short_pith_number":"pith:LPVCLXQY","canonical_record":{"source":{"id":"1710.08379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-23T16:52:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be653ff11bf17f7bd3e3ac329ea35f9065111fcd344f5cf558a9c0a759ed6769","abstract_canon_sha256":"648b9682f8e5b0d992d8566f2c4e531eacedafdb764a9055d0a2cfaad1b3f922"},"schema_version":"1.0"},"canonical_sha256":"5bea25de18e6c21fd79ee80909faf838fbc9b3ded8dd91a31527639b7825ffaa","source":{"kind":"arxiv","id":"1710.08379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08379","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08379v1","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08379","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"LPVCLXQY43BB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LPVCLXQY43BB7V46","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LPVCLXQY","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LPVCLXQY43BB7V465AEQT6XYHD","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-23T16:52:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be653ff11bf17f7bd3e3ac329ea35f9065111fcd344f5cf558a9c0a759ed6769","abstract_canon_sha256":"648b9682f8e5b0d992d8566f2c4e531eacedafdb764a9055d0a2cfaad1b3f922"},"schema_version":"1.0"},"canonical_sha256":"5bea25de18e6c21fd79ee80909faf838fbc9b3ded8dd91a31527639b7825ffaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:16.566190Z","signature_b64":"7W0fojU/hSyZrRJ3D3ihxPlbWEzWH0NPToMmgFyzpbI96xY1U6iREsGK3NdcEVaxGIFq3tR71iLuWdNrxiniBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bea25de18e6c21fd79ee80909faf838fbc9b3ded8dd91a31527639b7825ffaa","last_reissued_at":"2026-05-18T00:32:16.565712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:16.565712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08379","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-18T00:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLhWrhX1jrj03Xo2jOyH40hAFUMtiRAxeGNHa3fRhXxL6JlNKnMwIethkB4FtVrFGQMnjCMZEejF8qhO1+YUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:45:17.395914Z"},"content_sha256":"fe296e43e85ff5c443a5925f0c834b543faeffbf8887f89b6f31d4ea3e5eed7e","schema_version":"1.0","event_id":"sha256:fe296e43e85ff5c443a5925f0c834b543faeffbf8887f89b6f31d4ea3e5eed7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LPVCLXQY43BB7V465AEQT6XYHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Bounds of Concatenated Polar Coding Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Burshtein, Dina Goldin","submitted_at":"2017-10-23T16:52:50Z","abstract_excerpt":"A concatenated coding scheme over binary memoryless symmetric (BMS) channels using a polarization transformation followed by outer sub-codes is analyzed. Achievable error exponents and upper bounds on the error rate are derived. The first bound is obtained using outer codes which are typical linear codes from the ensemble of parity check matrices whose elements are chosen independently and uniformly. As a byproduct of this bound, it determines the required rate split of the total rate to the rates of the outer codes. A lower bound on the error exponent that holds for all BMS channels with a gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08379","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-18T00:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPqFQofMo9ziR/q5jGPnkbmsS2pSbh56626elPRHTX6EDRRg9/0r80AEv0rU0bYti4u6YnmgUlCVO67AS2+YAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:45:17.396259Z"},"content_sha256":"c34b431ca83de37a6240a2041465912ef58466925bab28c7ad852ed6fffdfaa9","schema_version":"1.0","event_id":"sha256:c34b431ca83de37a6240a2041465912ef58466925bab28c7ad852ed6fffdfaa9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPVCLXQY43BB7V465AEQT6XYHD/bundle.json","state_url":"https://pith.science/pith/LPVCLXQY43BB7V465AEQT6XYHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPVCLXQY43BB7V465AEQT6XYHD/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-07-02T21:45:17Z","links":{"resolver":"https://pith.science/pith/LPVCLXQY43BB7V465AEQT6XYHD","bundle":"https://pith.science/pith/LPVCLXQY43BB7V465AEQT6XYHD/bundle.json","state":"https://pith.science/pith/LPVCLXQY43BB7V465AEQT6XYHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPVCLXQY43BB7V465AEQT6XYHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LPVCLXQY43BB7V465AEQT6XYHD","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":"648b9682f8e5b0d992d8566f2c4e531eacedafdb764a9055d0a2cfaad1b3f922","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-23T16:52:50Z","title_canon_sha256":"be653ff11bf17f7bd3e3ac329ea35f9065111fcd344f5cf558a9c0a759ed6769"},"schema_version":"1.0","source":{"id":"1710.08379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08379","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08379v1","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08379","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"LPVCLXQY43BB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LPVCLXQY43BB7V46","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LPVCLXQY","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:c34b431ca83de37a6240a2041465912ef58466925bab28c7ad852ed6fffdfaa9","target":"graph","created_at":"2026-05-18T00:32:16Z","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 concatenated coding scheme over binary memoryless symmetric (BMS) channels using a polarization transformation followed by outer sub-codes is analyzed. Achievable error exponents and upper bounds on the error rate are derived. The first bound is obtained using outer codes which are typical linear codes from the ensemble of parity check matrices whose elements are chosen independently and uniformly. As a byproduct of this bound, it determines the required rate split of the total rate to the rates of the outer codes. A lower bound on the error exponent that holds for all BMS channels with a gi","authors_text":"David Burshtein, Dina Goldin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-23T16:52:50Z","title":"Performance Bounds of Concatenated Polar Coding Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08379","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:fe296e43e85ff5c443a5925f0c834b543faeffbf8887f89b6f31d4ea3e5eed7e","target":"record","created_at":"2026-05-18T00:32:16Z","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":"648b9682f8e5b0d992d8566f2c4e531eacedafdb764a9055d0a2cfaad1b3f922","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-23T16:52:50Z","title_canon_sha256":"be653ff11bf17f7bd3e3ac329ea35f9065111fcd344f5cf558a9c0a759ed6769"},"schema_version":"1.0","source":{"id":"1710.08379","kind":"arxiv","version":1}},"canonical_sha256":"5bea25de18e6c21fd79ee80909faf838fbc9b3ded8dd91a31527639b7825ffaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bea25de18e6c21fd79ee80909faf838fbc9b3ded8dd91a31527639b7825ffaa","first_computed_at":"2026-05-18T00:32:16.565712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:16.565712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7W0fojU/hSyZrRJ3D3ihxPlbWEzWH0NPToMmgFyzpbI96xY1U6iREsGK3NdcEVaxGIFq3tR71iLuWdNrxiniBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:16.566190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe296e43e85ff5c443a5925f0c834b543faeffbf8887f89b6f31d4ea3e5eed7e","sha256:c34b431ca83de37a6240a2041465912ef58466925bab28c7ad852ed6fffdfaa9"],"state_sha256":"95614d95d6455fd51024ad5280f0caa81f2fde4300cdd2223653e4033ecc7448"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N1rRw5RmDlO6l/mCDwX/Gx9Ce//AxvalVHqtPi+bcAFSj/dYPga1hey6QnzYEf4L3/VA7QzdtDq+pQwET3imCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T21:45:17.398531Z","bundle_sha256":"9e93121c1f56abae10fef39f2808cad88eec66b0292b0b3fd05e2dc281204783"}}