{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XNSRZIEZWBWSAGRE6S6OFI5BA6","short_pith_number":"pith:XNSRZIEZ","canonical_record":{"source":{"id":"1810.04458","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-10T11:18:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7dcf81cdaf89cd603b639c0f5f882d291d6a5ad1f264e81264c7cea198182dd7","abstract_canon_sha256":"febd07d60611ac3fc66a37f9f6b9d8e8555281d91f8c3e388a2f7cffdcd18d75"},"schema_version":"1.0"},"canonical_sha256":"bb651ca099b06d201a24f4bce2a3a107a3e04853df150df078fd9c490a074235","source":{"kind":"arxiv","id":"1810.04458","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04458","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04458v3","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04458","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"XNSRZIEZWBWS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XNSRZIEZWBWSAGRE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XNSRZIEZ","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XNSRZIEZWBWSAGRE6S6OFI5BA6","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04458","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-10T11:18:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7dcf81cdaf89cd603b639c0f5f882d291d6a5ad1f264e81264c7cea198182dd7","abstract_canon_sha256":"febd07d60611ac3fc66a37f9f6b9d8e8555281d91f8c3e388a2f7cffdcd18d75"},"schema_version":"1.0"},"canonical_sha256":"bb651ca099b06d201a24f4bce2a3a107a3e04853df150df078fd9c490a074235","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:41.058367Z","signature_b64":"GTfnQNDM3Ry1WLLqpLrW3YU7WTUmCytFr25Ir+Rx0FBIJpgne0PW2QgESjFJztfm8YIYUWS2uM00SuBMwtVdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb651ca099b06d201a24f4bce2a3a107a3e04853df150df078fd9c490a074235","last_reissued_at":"2026-05-17T23:50:41.057931Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:41.057931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04458","source_version":3,"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-17T23:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1rkwrfpBf+dytLeo4PXDgu1zXSvy2RPSy6lDBviZKYUObUw/byBxoKr4rvyeJT040kFoK9yAPVP4ZthfSt+vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:52:55.089662Z"},"content_sha256":"2f4951798b2073587521a43dbbe97c157b80152730ab76e0cb0444d1ab82c82b","schema_version":"1.0","event_id":"sha256:2f4951798b2073587521a43dbbe97c157b80152730ab76e0cb0444d1ab82c82b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XNSRZIEZWBWSAGRE6S6OFI5BA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cluster Pairwise Error Probability and Construction of Parity-Check-Concatenated Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daiming Qu, Tao Jiang, Tao Wang","submitted_at":"2018-10-10T11:18:58Z","abstract_excerpt":"A successive cancellation list (SCL) decoder with limited list size for polar codes can not be analyzed as a successive cancellation (SC) decoder, nor as a maximum likelihood (ML) decoder, due to the complicated decoding errors caused by path elimination. To address this issue, an analytical tool, named as cluster pairwise error probability (CPEP), is proposed in this paper to measure the competitiveness of the correct path against the error paths in an SCL decoder. It is shown that the sum of CPEPs over error paths could be used as an indicator of the probability of correct path being elimina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04458","kind":"arxiv","version":3},"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-17T23:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2AwyBJ0GOGJsF08+NWr4hzOSAHh/bzKSzykjXzpHZ5L3ehHwaQk8Ei8wIN7hj+hvbosxjBUkNk05/OLFxPLQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:52:55.090224Z"},"content_sha256":"634201408ece55c7b8434fc7a6d9de9d4692f3345212b9ebf205b989372885a3","schema_version":"1.0","event_id":"sha256:634201408ece55c7b8434fc7a6d9de9d4692f3345212b9ebf205b989372885a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNSRZIEZWBWSAGRE6S6OFI5BA6/bundle.json","state_url":"https://pith.science/pith/XNSRZIEZWBWSAGRE6S6OFI5BA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNSRZIEZWBWSAGRE6S6OFI5BA6/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-01T02:52:55Z","links":{"resolver":"https://pith.science/pith/XNSRZIEZWBWSAGRE6S6OFI5BA6","bundle":"https://pith.science/pith/XNSRZIEZWBWSAGRE6S6OFI5BA6/bundle.json","state":"https://pith.science/pith/XNSRZIEZWBWSAGRE6S6OFI5BA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNSRZIEZWBWSAGRE6S6OFI5BA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XNSRZIEZWBWSAGRE6S6OFI5BA6","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":"febd07d60611ac3fc66a37f9f6b9d8e8555281d91f8c3e388a2f7cffdcd18d75","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-10T11:18:58Z","title_canon_sha256":"7dcf81cdaf89cd603b639c0f5f882d291d6a5ad1f264e81264c7cea198182dd7"},"schema_version":"1.0","source":{"id":"1810.04458","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04458","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04458v3","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04458","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"XNSRZIEZWBWS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XNSRZIEZWBWSAGRE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XNSRZIEZ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:634201408ece55c7b8434fc7a6d9de9d4692f3345212b9ebf205b989372885a3","target":"graph","created_at":"2026-05-17T23:50:41Z","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 successive cancellation list (SCL) decoder with limited list size for polar codes can not be analyzed as a successive cancellation (SC) decoder, nor as a maximum likelihood (ML) decoder, due to the complicated decoding errors caused by path elimination. To address this issue, an analytical tool, named as cluster pairwise error probability (CPEP), is proposed in this paper to measure the competitiveness of the correct path against the error paths in an SCL decoder. It is shown that the sum of CPEPs over error paths could be used as an indicator of the probability of correct path being elimina","authors_text":"Daiming Qu, Tao Jiang, Tao Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-10T11:18:58Z","title":"Cluster Pairwise Error Probability and Construction of Parity-Check-Concatenated Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04458","kind":"arxiv","version":3},"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:2f4951798b2073587521a43dbbe97c157b80152730ab76e0cb0444d1ab82c82b","target":"record","created_at":"2026-05-17T23:50:41Z","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":"febd07d60611ac3fc66a37f9f6b9d8e8555281d91f8c3e388a2f7cffdcd18d75","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-10T11:18:58Z","title_canon_sha256":"7dcf81cdaf89cd603b639c0f5f882d291d6a5ad1f264e81264c7cea198182dd7"},"schema_version":"1.0","source":{"id":"1810.04458","kind":"arxiv","version":3}},"canonical_sha256":"bb651ca099b06d201a24f4bce2a3a107a3e04853df150df078fd9c490a074235","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb651ca099b06d201a24f4bce2a3a107a3e04853df150df078fd9c490a074235","first_computed_at":"2026-05-17T23:50:41.057931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:41.057931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GTfnQNDM3Ry1WLLqpLrW3YU7WTUmCytFr25Ir+Rx0FBIJpgne0PW2QgESjFJztfm8YIYUWS2uM00SuBMwtVdBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:41.058367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04458","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f4951798b2073587521a43dbbe97c157b80152730ab76e0cb0444d1ab82c82b","sha256:634201408ece55c7b8434fc7a6d9de9d4692f3345212b9ebf205b989372885a3"],"state_sha256":"862d479c0ed6f7dd8616f4004e513342dee17cf7db3544e8ccbb845e433e339e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09JkXVlJ9r2WS5924d5XQ6//p8e5g6RWSaxjMKsqACGR1vLKLeAFozJ0jNhDH6RC0yCQvwgio4cbQqFkz4mEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:52:55.093182Z","bundle_sha256":"ce9a0f5c1b2053bdee020eb2df41f0b64c4d4db531759c2d9bac33e997c7d1bb"}}