{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XBQDW4O7TQD6TOGX3YCXTME7MD","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":"ba931f8c067614ba8a076334141ed7036e765d267e9a8da202a7bc39ad4af8d9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-31T12:58:38Z","title_canon_sha256":"051caba4ac7a17e0d8e4d1eb88a24453a2e2de0862fe1545629210c1f9a18eac"},"schema_version":"1.0","source":{"id":"1401.3753","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3753","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3753v4","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3753","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"XBQDW4O7TQD6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XBQDW4O7TQD6TOGX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XBQDW4O7","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:b8624a6ad214a5eaaa7b0d5c6c624e8b01aaf05c681f8cd2953cc1f8d9afa09c","target":"graph","created_at":"2026-05-18T01:20:56Z","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":"We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties which simplify the sorting step involved in successive cancellation list decoding. We propose a hardware architecture of the successive cancellation list decoder in the log-likelihood ratio domain which, compared to a log-likelihood domain implementation, requires less irregular and smaller memories. This simplification together with the gains in the metric sorter, lead to $56\\%$ to $13","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Mani Bastani Parizi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-31T12:58:38Z","title":"LLR-based Successive Cancellation List Decoding of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3753","kind":"arxiv","version":4},"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:6ccce9841f54fe5a98fbea80b38c902170b7cf022ffd2e7ef2b3d371ec72af8d","target":"record","created_at":"2026-05-18T01:20:56Z","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":"ba931f8c067614ba8a076334141ed7036e765d267e9a8da202a7bc39ad4af8d9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-31T12:58:38Z","title_canon_sha256":"051caba4ac7a17e0d8e4d1eb88a24453a2e2de0862fe1545629210c1f9a18eac"},"schema_version":"1.0","source":{"id":"1401.3753","kind":"arxiv","version":4}},"canonical_sha256":"b8603b71df9c07e9b8d7de0579b09f60ea3d6e66276786df8d5f6902c5e10281","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8603b71df9c07e9b8d7de0579b09f60ea3d6e66276786df8d5f6902c5e10281","first_computed_at":"2026-05-18T01:20:56.241600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:56.241600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h/c9b7+6s/XopVUEqj1g+rZj2SnYGCOaDZZhBA5WoDMdxmC3ekhQz/2oJ+68KhriXVSuInGAS9aOnsYSk5RvBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:56.242149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3753","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ccce9841f54fe5a98fbea80b38c902170b7cf022ffd2e7ef2b3d371ec72af8d","sha256:b8624a6ad214a5eaaa7b0d5c6c624e8b01aaf05c681f8cd2953cc1f8d9afa09c"],"state_sha256":"531c8acd965cd3920d75ddf74fa7d26593cbad7fe3e1b785a962c2c431c08967"}