{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2SQTPJYF4L453XAREPGCFIWMNE","short_pith_number":"pith:2SQTPJYF","schema_version":"1.0","canonical_sha256":"d4a137a705e2f9dddc1123cc22a2cc6905123deabef064770b265a158b9480fb","source":{"kind":"arxiv","id":"1206.0050","version":1},"attestation_state":"computed","paper":{"title":"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":"Alexander Vardy, Ido Tal","submitted_at":"2012-05-31T23:33:40Z","abstract_excerpt":"We describe a successive-cancellation \\emph{list} decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Ar{\\i}kan. In the proposed list decoder, up to $L$ decoding paths are considered concurrently at each decoding stage. Then, a single codeword is selected from the list as output. If the most likely codeword is selected, simulation results show that the resulting performance is very close to that of a maximum-likelihood decoder, even for moderate values of $L$. Alternatively, if a \"genie\" is allowed to pick the codeword from the list, the results"},"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":"1206.0050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-31T23:33:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cfe2b65a8491fb18ec91423ebbc478324e6f8daa52c3ec004302343c6c903bad","abstract_canon_sha256":"06a80f254f70bb4829237d20ffc7b738324e559b43f1941efcd4f00b83ef1d33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:27.200250Z","signature_b64":"lCE3Kvrr9SHItX7AY+L4rpQKAAM9/nJjna6v/SKuo9roAb4xFUdATMlA7A+RTCP6Fhf7Sbk2WPkiTmTDPn09AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4a137a705e2f9dddc1123cc22a2cc6905123deabef064770b265a158b9480fb","last_reissued_at":"2026-05-18T03:54:27.199561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:27.199561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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":"Alexander Vardy, Ido Tal","submitted_at":"2012-05-31T23:33:40Z","abstract_excerpt":"We describe a successive-cancellation \\emph{list} decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Ar{\\i}kan. In the proposed list decoder, up to $L$ decoding paths are considered concurrently at each decoding stage. Then, a single codeword is selected from the list as output. If the most likely codeword is selected, simulation results show that the resulting performance is very close to that of a maximum-likelihood decoder, even for moderate values of $L$. Alternatively, if a \"genie\" is allowed to pick the codeword from the list, the results"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0050","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.0050","created_at":"2026-05-18T03:54:27.199692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0050v1","created_at":"2026-05-18T03:54:27.199692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0050","created_at":"2026-05-18T03:54:27.199692+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SQTPJYF4L45","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SQTPJYF4L453XAR","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SQTPJYF","created_at":"2026-05-18T12:26:50.516681+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":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2SQTPJYF4L453XAREPGCFIWMNE","json":"https://pith.science/pith/2SQTPJYF4L453XAREPGCFIWMNE.json","graph_json":"https://pith.science/api/pith-number/2SQTPJYF4L453XAREPGCFIWMNE/graph.json","events_json":"https://pith.science/api/pith-number/2SQTPJYF4L453XAREPGCFIWMNE/events.json","paper":"https://pith.science/paper/2SQTPJYF"},"agent_actions":{"view_html":"https://pith.science/pith/2SQTPJYF4L453XAREPGCFIWMNE","download_json":"https://pith.science/pith/2SQTPJYF4L453XAREPGCFIWMNE.json","view_paper":"https://pith.science/paper/2SQTPJYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0050&json=true","fetch_graph":"https://pith.science/api/pith-number/2SQTPJYF4L453XAREPGCFIWMNE/graph.json","fetch_events":"https://pith.science/api/pith-number/2SQTPJYF4L453XAREPGCFIWMNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SQTPJYF4L453XAREPGCFIWMNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SQTPJYF4L453XAREPGCFIWMNE/action/storage_attestation","attest_author":"https://pith.science/pith/2SQTPJYF4L453XAREPGCFIWMNE/action/author_attestation","sign_citation":"https://pith.science/pith/2SQTPJYF4L453XAREPGCFIWMNE/action/citation_signature","submit_replication":"https://pith.science/pith/2SQTPJYF4L453XAREPGCFIWMNE/action/replication_record"}},"created_at":"2026-05-18T03:54:27.199692+00:00","updated_at":"2026-05-18T03:54:27.199692+00:00"}