{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XBQDW4O7TQD6TOGX3YCXTME7MD","short_pith_number":"pith:XBQDW4O7","schema_version":"1.0","canonical_sha256":"b8603b71df9c07e9b8d7de0579b09f60ea3d6e66276786df8d5f6902c5e10281","source":{"kind":"arxiv","id":"1401.3753","version":4},"attestation_state":"computed","paper":{"title":"LLR-based Successive Cancellation List Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Mani Bastani Parizi","submitted_at":"2013-10-31T12:58:38Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.3753","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-31T12:58:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"051caba4ac7a17e0d8e4d1eb88a24453a2e2de0862fe1545629210c1f9a18eac","abstract_canon_sha256":"ba931f8c067614ba8a076334141ed7036e765d267e9a8da202a7bc39ad4af8d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:56.242149Z","signature_b64":"h/c9b7+6s/XopVUEqj1g+rZj2SnYGCOaDZZhBA5WoDMdxmC3ekhQz/2oJ+68KhriXVSuInGAS9aOnsYSk5RvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8603b71df9c07e9b8d7de0579b09f60ea3d6e66276786df8d5f6902c5e10281","last_reissued_at":"2026-05-18T01:20:56.241600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:56.241600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLR-based Successive Cancellation List Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Mani Bastani Parizi","submitted_at":"2013-10-31T12:58:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3753","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.3753","created_at":"2026-05-18T01:20:56.241682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3753v4","created_at":"2026-05-18T01:20:56.241682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3753","created_at":"2026-05-18T01:20:56.241682+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBQDW4O7TQD6","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBQDW4O7TQD6TOGX","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBQDW4O7","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2304.04743","citing_title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XBQDW4O7TQD6TOGX3YCXTME7MD","json":"https://pith.science/pith/XBQDW4O7TQD6TOGX3YCXTME7MD.json","graph_json":"https://pith.science/api/pith-number/XBQDW4O7TQD6TOGX3YCXTME7MD/graph.json","events_json":"https://pith.science/api/pith-number/XBQDW4O7TQD6TOGX3YCXTME7MD/events.json","paper":"https://pith.science/paper/XBQDW4O7"},"agent_actions":{"view_html":"https://pith.science/pith/XBQDW4O7TQD6TOGX3YCXTME7MD","download_json":"https://pith.science/pith/XBQDW4O7TQD6TOGX3YCXTME7MD.json","view_paper":"https://pith.science/paper/XBQDW4O7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3753&json=true","fetch_graph":"https://pith.science/api/pith-number/XBQDW4O7TQD6TOGX3YCXTME7MD/graph.json","fetch_events":"https://pith.science/api/pith-number/XBQDW4O7TQD6TOGX3YCXTME7MD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBQDW4O7TQD6TOGX3YCXTME7MD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBQDW4O7TQD6TOGX3YCXTME7MD/action/storage_attestation","attest_author":"https://pith.science/pith/XBQDW4O7TQD6TOGX3YCXTME7MD/action/author_attestation","sign_citation":"https://pith.science/pith/XBQDW4O7TQD6TOGX3YCXTME7MD/action/citation_signature","submit_replication":"https://pith.science/pith/XBQDW4O7TQD6TOGX3YCXTME7MD/action/replication_record"}},"created_at":"2026-05-18T01:20:56.241682+00:00","updated_at":"2026-05-18T01:20:56.241682+00:00"}