{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TCY4GIIJHGI3LOGUHDDY2AE2DJ","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":"797e62b69a6696c04f59e4dbf67b074cdb85fd1fb9fb243354435d129d67ba2f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-06T19:15:44Z","title_canon_sha256":"d6aa895bcc61c02889151e75a1ae64176c1b0332243a65db68504ce80330e45a"},"schema_version":"1.0","source":{"id":"1505.01466","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01466","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01466v2","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01466","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"TCY4GIIJHGI3","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TCY4GIIJHGI3LOGU","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TCY4GIIJ","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:6e890c7234f6dba96c4ac325ee4553c5b92f8d11d519140844217eddaa6cd520","target":"graph","created_at":"2026-05-18T01:23:48Z","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":"Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many methods to improve the error-correction performance of polar codes, list decoding yields the best results, especially when the polar code is concatenated with a cyclic redundancy check (CRC). List decoding involves exploring several decoding paths with SC decoding, and therefore tends to be slower ","authors_text":"Alexander Vardy, Claude Thibeault, Gabi Sarkis, Pascal Giard, Warren J. Gross","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-06T19:15:44Z","title":"Fast List Decoders for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01466","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:a350a272d18debfa0d0f43cafc56c03ffc4d6aea47a59b772c9a6722c8d6ed67","target":"record","created_at":"2026-05-18T01:23:48Z","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":"797e62b69a6696c04f59e4dbf67b074cdb85fd1fb9fb243354435d129d67ba2f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-06T19:15:44Z","title_canon_sha256":"d6aa895bcc61c02889151e75a1ae64176c1b0332243a65db68504ce80330e45a"},"schema_version":"1.0","source":{"id":"1505.01466","kind":"arxiv","version":2}},"canonical_sha256":"98b1c321093991b5b8d438c78d009a1a59a138c8bbca61769d2a0b1eb3ef74d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98b1c321093991b5b8d438c78d009a1a59a138c8bbca61769d2a0b1eb3ef74d7","first_computed_at":"2026-05-18T01:23:48.273781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:48.273781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IshR1D/i8LVpSdPXuxyd87oy/fEMKA+5Z3rFJYx9pBQnfEthqrAorl55JmS6knowCU6pG0IBQdMXKRFEgkQfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:48.274427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01466","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a350a272d18debfa0d0f43cafc56c03ffc4d6aea47a59b772c9a6722c8d6ed67","sha256:6e890c7234f6dba96c4ac325ee4553c5b92f8d11d519140844217eddaa6cd520"],"state_sha256":"9c4fef27213e5b55b2f99561ff7e05e977086ef59bb965a602a5d002221a32dc"}