{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LIW2ZV4B22BKOYN7OXN4IHY4FD","short_pith_number":"pith:LIW2ZV4B","canonical_record":{"source":{"id":"1409.4744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-09-16T19:39:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f3f5bdfd3200160d359337060c0fa2a033051d807ef9a13bf935f395338f2ddf","abstract_canon_sha256":"2dad346be472c0136194e23cbd92d68a4bee8b0b61f5c2840906d55acf0c4f75"},"schema_version":"1.0"},"canonical_sha256":"5a2dacd781d682a761bf75dbc41f1c28cfc756aaf2dbd5b6809b9487280b3ce1","source":{"kind":"arxiv","id":"1409.4744","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4744","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4744v2","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4744","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"LIW2ZV4B22BK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LIW2ZV4B22BKOYN7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LIW2ZV4B","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LIW2ZV4B22BKOYN7OXN4IHY4FD","target":"record","payload":{"canonical_record":{"source":{"id":"1409.4744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-09-16T19:39:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f3f5bdfd3200160d359337060c0fa2a033051d807ef9a13bf935f395338f2ddf","abstract_canon_sha256":"2dad346be472c0136194e23cbd92d68a4bee8b0b61f5c2840906d55acf0c4f75"},"schema_version":"1.0"},"canonical_sha256":"5a2dacd781d682a761bf75dbc41f1c28cfc756aaf2dbd5b6809b9487280b3ce1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:46.925692Z","signature_b64":"9pWxh3hZAkzO97kx+1xDzhi1l+wdbu9bly+sJiazmJ3+Vc/Tu41Fl7RoMAPBhtMaUM2P35cyTC4GGv6fBMi3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a2dacd781d682a761bf75dbc41f1c28cfc756aaf2dbd5b6809b9487280b3ce1","last_reissued_at":"2026-05-18T02:35:46.925288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:46.925288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.4744","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-18T02:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CF+NzuDavrJD7kHK4YUQiV3UT9HXVYXcPKfehNYd69+OVPiU0sknvuqvGZ35REONiGLLKFZ9ivR0ftfuBY2ZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:55:40.630282Z"},"content_sha256":"ead1cf0b427e680e7fc8d3662a4977b2ce14eee4f2306299ae0d6de824b7003e","schema_version":"1.0","event_id":"sha256:ead1cf0b427e680e7fc8d3662a4977b2ce14eee4f2306299ae0d6de824b7003e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LIW2ZV4B22BKOYN7OXN4IHY4FD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient List Decoder Architecture for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.AR","authors_text":"Jun Lin, Zhiyuan Yan","submitted_at":"2014-09-16T19:39:49Z","abstract_excerpt":"Long polar codes can achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. However, for polar codes with short and moderate code length, the decoding performance of the SC algorithm is inferior. The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the SC algorithm for short or moderate polar codes. In this paper, we propose an efficient list decoder architecture for the CRC aided SCL algorithm, based on both algorithmic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4744","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-18T02:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjCvGkzVggqz9sYAZhuxzhGZjaKKb923ylh6+vxQzX7GkudF7zcjaOghNwzAT896Y+4udVS1uDLqg09huvBjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:55:40.630655Z"},"content_sha256":"9bdacb7a8e9def53a8f40e96a99e5dbd37ed8964441f479cf299df58ee7a7eb4","schema_version":"1.0","event_id":"sha256:9bdacb7a8e9def53a8f40e96a99e5dbd37ed8964441f479cf299df58ee7a7eb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIW2ZV4B22BKOYN7OXN4IHY4FD/bundle.json","state_url":"https://pith.science/pith/LIW2ZV4B22BKOYN7OXN4IHY4FD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIW2ZV4B22BKOYN7OXN4IHY4FD/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-31T03:55:40Z","links":{"resolver":"https://pith.science/pith/LIW2ZV4B22BKOYN7OXN4IHY4FD","bundle":"https://pith.science/pith/LIW2ZV4B22BKOYN7OXN4IHY4FD/bundle.json","state":"https://pith.science/pith/LIW2ZV4B22BKOYN7OXN4IHY4FD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIW2ZV4B22BKOYN7OXN4IHY4FD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LIW2ZV4B22BKOYN7OXN4IHY4FD","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":"2dad346be472c0136194e23cbd92d68a4bee8b0b61f5c2840906d55acf0c4f75","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-09-16T19:39:49Z","title_canon_sha256":"f3f5bdfd3200160d359337060c0fa2a033051d807ef9a13bf935f395338f2ddf"},"schema_version":"1.0","source":{"id":"1409.4744","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4744","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4744v2","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4744","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"LIW2ZV4B22BK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LIW2ZV4B22BKOYN7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LIW2ZV4B","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:9bdacb7a8e9def53a8f40e96a99e5dbd37ed8964441f479cf299df58ee7a7eb4","target":"graph","created_at":"2026-05-18T02:35:46Z","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 symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. However, for polar codes with short and moderate code length, the decoding performance of the SC algorithm is inferior. The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the SC algorithm for short or moderate polar codes. In this paper, we propose an efficient list decoder architecture for the CRC aided SCL algorithm, based on both algorithmic","authors_text":"Jun Lin, Zhiyuan Yan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-09-16T19:39:49Z","title":"An Efficient List Decoder Architecture for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4744","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:ead1cf0b427e680e7fc8d3662a4977b2ce14eee4f2306299ae0d6de824b7003e","target":"record","created_at":"2026-05-18T02:35:46Z","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":"2dad346be472c0136194e23cbd92d68a4bee8b0b61f5c2840906d55acf0c4f75","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-09-16T19:39:49Z","title_canon_sha256":"f3f5bdfd3200160d359337060c0fa2a033051d807ef9a13bf935f395338f2ddf"},"schema_version":"1.0","source":{"id":"1409.4744","kind":"arxiv","version":2}},"canonical_sha256":"5a2dacd781d682a761bf75dbc41f1c28cfc756aaf2dbd5b6809b9487280b3ce1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a2dacd781d682a761bf75dbc41f1c28cfc756aaf2dbd5b6809b9487280b3ce1","first_computed_at":"2026-05-18T02:35:46.925288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:46.925288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9pWxh3hZAkzO97kx+1xDzhi1l+wdbu9bly+sJiazmJ3+Vc/Tu41Fl7RoMAPBhtMaUM2P35cyTC4GGv6fBMi3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:46.925692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4744","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ead1cf0b427e680e7fc8d3662a4977b2ce14eee4f2306299ae0d6de824b7003e","sha256:9bdacb7a8e9def53a8f40e96a99e5dbd37ed8964441f479cf299df58ee7a7eb4"],"state_sha256":"d78f302d5cbde0fd2fa12d12fe61a111844fb1514cdcf21a0a1755724f4f6de7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTq4aNLkozGRlnq7CnLGHfS5r+nVp/vtIYAgDFVNioSwWhQ8Wk7UIzoiZBbS4+gwaSLbARBYSKX8+ASJRkGjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:55:40.632896Z","bundle_sha256":"d60c6c4ed419aeb65be088f55d8fd8a99f8b6f13c14ad0e537a324d5a3912169"}}