{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TKN3E5F3PNLZYM5K5OEO5GKDNV","short_pith_number":"pith:TKN3E5F3","canonical_record":{"source":{"id":"1405.4819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-19T17:59:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be6dd0cbb84ee6207cfc67b7866473c3c294f656ac5c212c1b2b93d1beb7efa9","abstract_canon_sha256":"9b76f1687413c1f6517b65c7fea91e9b622b0197c40a75d81314b9ddec5fffb0"},"schema_version":"1.0"},"canonical_sha256":"9a9bb274bb7b579c33aaeb88ee99436d5a18503a9b0ecae4f46af07077dd51d8","source":{"kind":"arxiv","id":"1405.4819","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4819","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4819v2","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4819","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"TKN3E5F3PNLZ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TKN3E5F3PNLZYM5K","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TKN3E5F3","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TKN3E5F3PNLZYM5K5OEO5GKDNV","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-19T17:59:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be6dd0cbb84ee6207cfc67b7866473c3c294f656ac5c212c1b2b93d1beb7efa9","abstract_canon_sha256":"9b76f1687413c1f6517b65c7fea91e9b622b0197c40a75d81314b9ddec5fffb0"},"schema_version":"1.0"},"canonical_sha256":"9a9bb274bb7b579c33aaeb88ee99436d5a18503a9b0ecae4f46af07077dd51d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.834860Z","signature_b64":"AMpnKuT6uLnBsM4wjDbGTKgXJYwCL+AlEi7TFdgNVzwgYkv/J46MWBLkcIw0S8qGSgr7IxmWAPWLvnrg3Kk8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a9bb274bb7b579c33aaeb88ee99436d5a18503a9b0ecae4f46af07077dd51d8","last_reissued_at":"2026-05-18T00:57:51.834137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.834137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4819","source_version":2,"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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ynw9xWdulBEk/UrFddQ9M5CoDTbRKdT0GZh26LIpXxQS0+Yh7/11Ltx0RDfRV00cf9dzkh7SaMOc4GpP68nNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:04:11.112398Z"},"content_sha256":"9482242cbb5d4f6d421e868c32ca777cc040c2bfb4184fd20cca0eede24222fa","schema_version":"1.0","event_id":"sha256:9482242cbb5d4f6d421e868c32ca777cc040c2bfb4184fd20cca0eede24222fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TKN3E5F3PNLZYM5K5OEO5GKDNV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Reduced Latency List Decoding Algorithm for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chenrong Xiong, Jun Lin, Zhiyuan Yan","submitted_at":"2014-05-19T17:59:20Z","abstract_excerpt":"Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. But for polar codes with short and moderate code length, the decoding performance of the SC decoding algorithm is inferior. The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the SC decoding algorithm for short or moderate polar codes. However, the CRC aided SCL (CA-SCL) decoding algorithm still suffer from long decoding latency. In this paper, a reduced"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4819","kind":"arxiv","version":2},"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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9wqATeUOJ3LX2TWFu0y4IxWyP7w6m5hdWWjCUlcl0CfRLo+hc3WukV3YOX6G8UejGouvpbTzJOf+G5BCgHaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:04:11.112763Z"},"content_sha256":"64b79c4160be878c89cfb14a49a4edd2ecfe6a913e49a290e76f0d183a9c3dc9","schema_version":"1.0","event_id":"sha256:64b79c4160be878c89cfb14a49a4edd2ecfe6a913e49a290e76f0d183a9c3dc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKN3E5F3PNLZYM5K5OEO5GKDNV/bundle.json","state_url":"https://pith.science/pith/TKN3E5F3PNLZYM5K5OEO5GKDNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKN3E5F3PNLZYM5K5OEO5GKDNV/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-03T02:04:11Z","links":{"resolver":"https://pith.science/pith/TKN3E5F3PNLZYM5K5OEO5GKDNV","bundle":"https://pith.science/pith/TKN3E5F3PNLZYM5K5OEO5GKDNV/bundle.json","state":"https://pith.science/pith/TKN3E5F3PNLZYM5K5OEO5GKDNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKN3E5F3PNLZYM5K5OEO5GKDNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TKN3E5F3PNLZYM5K5OEO5GKDNV","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":"9b76f1687413c1f6517b65c7fea91e9b622b0197c40a75d81314b9ddec5fffb0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-19T17:59:20Z","title_canon_sha256":"be6dd0cbb84ee6207cfc67b7866473c3c294f656ac5c212c1b2b93d1beb7efa9"},"schema_version":"1.0","source":{"id":"1405.4819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4819","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4819v2","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4819","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"TKN3E5F3PNLZ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TKN3E5F3PNLZYM5K","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TKN3E5F3","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:64b79c4160be878c89cfb14a49a4edd2ecfe6a913e49a290e76f0d183a9c3dc9","target":"graph","created_at":"2026-05-18T00:57:51Z","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":"Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. But for polar codes with short and moderate code length, the decoding performance of the SC decoding algorithm is inferior. The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the SC decoding algorithm for short or moderate polar codes. However, the CRC aided SCL (CA-SCL) decoding algorithm still suffer from long decoding latency. In this paper, a reduced","authors_text":"Chenrong Xiong, Jun Lin, Zhiyuan Yan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-19T17:59:20Z","title":"A Reduced Latency List Decoding Algorithm for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4819","kind":"arxiv","version":2},"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:9482242cbb5d4f6d421e868c32ca777cc040c2bfb4184fd20cca0eede24222fa","target":"record","created_at":"2026-05-18T00:57:51Z","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":"9b76f1687413c1f6517b65c7fea91e9b622b0197c40a75d81314b9ddec5fffb0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-19T17:59:20Z","title_canon_sha256":"be6dd0cbb84ee6207cfc67b7866473c3c294f656ac5c212c1b2b93d1beb7efa9"},"schema_version":"1.0","source":{"id":"1405.4819","kind":"arxiv","version":2}},"canonical_sha256":"9a9bb274bb7b579c33aaeb88ee99436d5a18503a9b0ecae4f46af07077dd51d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a9bb274bb7b579c33aaeb88ee99436d5a18503a9b0ecae4f46af07077dd51d8","first_computed_at":"2026-05-18T00:57:51.834137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:51.834137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AMpnKuT6uLnBsM4wjDbGTKgXJYwCL+AlEi7TFdgNVzwgYkv/J46MWBLkcIw0S8qGSgr7IxmWAPWLvnrg3Kk8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:51.834860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9482242cbb5d4f6d421e868c32ca777cc040c2bfb4184fd20cca0eede24222fa","sha256:64b79c4160be878c89cfb14a49a4edd2ecfe6a913e49a290e76f0d183a9c3dc9"],"state_sha256":"df4938b3a180df4b87f46a207cf877369a47d921f234d47c0017b221dad489f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHxgUH4m2SNyJ+5RgurTs3P20TmQOD3HNrHn19zOY5xkgCt1BnNYTVLDdsB7VCRXi1XbyTU1sIYJb4ve+5MjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:04:11.114738Z","bundle_sha256":"11d70b1097457a3110dd605bc27794302615db021bcbce2808c7d2de10a5e8dd"}}