{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3YMQ6GU5K5IRBODNMWADL6OEVN","short_pith_number":"pith:3YMQ6GU5","canonical_record":{"source":{"id":"1510.02574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-10-09T06:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"4b25f07c0a819d7407697327694187a4efe8aba9a8188283117c18cbafe0131b","abstract_canon_sha256":"e321987740ab3eb0cc5dadf31443021643335be49f12498a553dc6cf34252008"},"schema_version":"1.0"},"canonical_sha256":"de190f1a9d575110b86d658035f9c4ab6bfb22d2b97aea4750f15b9fc5dc389e","source":{"kind":"arxiv","id":"1510.02574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02574","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02574v1","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02574","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"3YMQ6GU5K5IR","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3YMQ6GU5K5IRBODN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3YMQ6GU5","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3YMQ6GU5K5IRBODNMWADL6OEVN","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-10-09T06:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"4b25f07c0a819d7407697327694187a4efe8aba9a8188283117c18cbafe0131b","abstract_canon_sha256":"e321987740ab3eb0cc5dadf31443021643335be49f12498a553dc6cf34252008"},"schema_version":"1.0"},"canonical_sha256":"de190f1a9d575110b86d658035f9c4ab6bfb22d2b97aea4750f15b9fc5dc389e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:34.819723Z","signature_b64":"rVZrnegIotV08mY9GfGXaO/kSD1Wu7KyUc3XDKJFQKjmvejoPpmck2OwucAENbsggCc/k7d2NUMdItEE0f7zDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de190f1a9d575110b86d658035f9c4ab6bfb22d2b97aea4750f15b9fc5dc389e","last_reissued_at":"2026-05-18T00:58:34.819094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:34.819094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02574","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:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8tCk0t21Ku4+WDcl5rkbBQlJXJd+V1zNl9FDWmox5T3+N/8Kl7ZtwBVz5bb0n+6pHFkx6vYCqi4FdX9Wx+DAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:24:46.073367Z"},"content_sha256":"3f441dd4e02d397cd393880ea25063b993637be05ff37223442e8b83031019dd","schema_version":"1.0","event_id":"sha256:3f441dd4e02d397cd393880ea25063b993637be05ff37223442e8b83031019dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3YMQ6GU5K5IRBODNMWADL6OEVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A High Throughput List Decoder Architecture for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Chenrong Xiong, Jun Lin, Zhiyuan Yan","submitted_at":"2015-10-09T06:11:34Z","abstract_excerpt":"While long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels when decoded by a low complexity successive cancelation (SC) algorithm, the error performance of the SC algorithm is inferior for polar codes with finite block lengths. The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the SC algorithm. However, current CRC aided SCL (CA-SCL) decoders still suffer from long decoding latency and limited throughput. In this paper, a reduced latency list decoding (RLLD) algorithm for po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02574","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:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5AT9opknWCY7N636wjAFO98c5IBYLfQgqbcIjMcnQ3xjXUSqpO1RYN0jRh7qhzYFMnHRqOn8gQYtoNRN/uAvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:24:46.073721Z"},"content_sha256":"6138c32e01d590a1bd3a86155fe510d5c541aa26f08a04d61c2fe9c39517034e","schema_version":"1.0","event_id":"sha256:6138c32e01d590a1bd3a86155fe510d5c541aa26f08a04d61c2fe9c39517034e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YMQ6GU5K5IRBODNMWADL6OEVN/bundle.json","state_url":"https://pith.science/pith/3YMQ6GU5K5IRBODNMWADL6OEVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YMQ6GU5K5IRBODNMWADL6OEVN/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-05-30T13:24:46Z","links":{"resolver":"https://pith.science/pith/3YMQ6GU5K5IRBODNMWADL6OEVN","bundle":"https://pith.science/pith/3YMQ6GU5K5IRBODNMWADL6OEVN/bundle.json","state":"https://pith.science/pith/3YMQ6GU5K5IRBODNMWADL6OEVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YMQ6GU5K5IRBODNMWADL6OEVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3YMQ6GU5K5IRBODNMWADL6OEVN","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":"e321987740ab3eb0cc5dadf31443021643335be49f12498a553dc6cf34252008","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-10-09T06:11:34Z","title_canon_sha256":"4b25f07c0a819d7407697327694187a4efe8aba9a8188283117c18cbafe0131b"},"schema_version":"1.0","source":{"id":"1510.02574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02574","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02574v1","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02574","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"3YMQ6GU5K5IR","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3YMQ6GU5K5IRBODN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3YMQ6GU5","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:6138c32e01d590a1bd3a86155fe510d5c541aa26f08a04d61c2fe9c39517034e","target":"graph","created_at":"2026-05-18T00:58:34Z","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":"While long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels when decoded by a low complexity successive cancelation (SC) algorithm, the error performance of the SC algorithm is inferior for polar codes with finite block lengths. The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the SC algorithm. However, current CRC aided SCL (CA-SCL) decoders still suffer from long decoding latency and limited throughput. In this paper, a reduced latency list decoding (RLLD) algorithm for po","authors_text":"Chenrong Xiong, Jun Lin, Zhiyuan Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-10-09T06:11:34Z","title":"A High Throughput List Decoder Architecture for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02574","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:3f441dd4e02d397cd393880ea25063b993637be05ff37223442e8b83031019dd","target":"record","created_at":"2026-05-18T00:58:34Z","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":"e321987740ab3eb0cc5dadf31443021643335be49f12498a553dc6cf34252008","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-10-09T06:11:34Z","title_canon_sha256":"4b25f07c0a819d7407697327694187a4efe8aba9a8188283117c18cbafe0131b"},"schema_version":"1.0","source":{"id":"1510.02574","kind":"arxiv","version":1}},"canonical_sha256":"de190f1a9d575110b86d658035f9c4ab6bfb22d2b97aea4750f15b9fc5dc389e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de190f1a9d575110b86d658035f9c4ab6bfb22d2b97aea4750f15b9fc5dc389e","first_computed_at":"2026-05-18T00:58:34.819094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:34.819094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rVZrnegIotV08mY9GfGXaO/kSD1Wu7KyUc3XDKJFQKjmvejoPpmck2OwucAENbsggCc/k7d2NUMdItEE0f7zDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:34.819723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f441dd4e02d397cd393880ea25063b993637be05ff37223442e8b83031019dd","sha256:6138c32e01d590a1bd3a86155fe510d5c541aa26f08a04d61c2fe9c39517034e"],"state_sha256":"6b905efacf76da444e394ab8d41b308f85e4236f22877ee094d9a42e98324a19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDHt2naiLsiTsPAZc5WUB1y7y8O9+pFPCkQA8jTZ3c6XIe4BigdBqqSNEVQC6FQOpVYND4VKYvAwVmzLsXK3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:24:46.075881Z","bundle_sha256":"b63648394ca8698d11a722b60743451bf8aded23314deb7168182ab3a960cf9f"}}