{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TD6ZTFDCEBODSFS5MXFMNQNHA3","short_pith_number":"pith:TD6ZTFDC","schema_version":"1.0","canonical_sha256":"98fd999462205c39165d65cac6c1a706c6d4e26ecf8282dd0cbbd24e66033661","source":{"kind":"arxiv","id":"1501.02473","version":1},"attestation_state":"computed","paper":{"title":"A Comparative Study of Polar Code Constructions for the AWGN Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emanuele Viterbo, Harish Vangala, Yi Hong","submitted_at":"2015-01-11T17:20:48Z","abstract_excerpt":"We present a comparative study of the performance of various polar code constructions in an additive white Gaussian noise (AWGN) channel. A polar code construction is any algorithm that selects $K$ best among $N$ possible polar bit-channels at the design signal-to-noise-ratio (design-SNR) in terms of bit error rate (BER). Optimal polar code construction is hard and therefore many suboptimal polar code constructions have been proposed at different computational complexities. Polar codes are also non-universal meaning the code changes significantly with the design-SNR. However, it is not known w"},"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":"1501.02473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-11T17:20:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"357d4bebe9548a8841442736ad43eba560d1b17b0d0dd059b3683e44559ca2ec","abstract_canon_sha256":"fc1b5363de839ae37e79a22bd8271bc46670c0393cf39cf361e17cea4f02ef76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:37.890384Z","signature_b64":"892M1SLlatH6xOhXRF8igOY07QHZvf3EttIxFFMmwW9eY1z0TYMUs4sOwgdBh6DCXuB9NrQo/j7uv3cyYHByAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98fd999462205c39165d65cac6c1a706c6d4e26ecf8282dd0cbbd24e66033661","last_reissued_at":"2026-05-18T02:29:37.890006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:37.890006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparative Study of Polar Code Constructions for the AWGN Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emanuele Viterbo, Harish Vangala, Yi Hong","submitted_at":"2015-01-11T17:20:48Z","abstract_excerpt":"We present a comparative study of the performance of various polar code constructions in an additive white Gaussian noise (AWGN) channel. A polar code construction is any algorithm that selects $K$ best among $N$ possible polar bit-channels at the design signal-to-noise-ratio (design-SNR) in terms of bit error rate (BER). Optimal polar code construction is hard and therefore many suboptimal polar code constructions have been proposed at different computational complexities. Polar codes are also non-universal meaning the code changes significantly with the design-SNR. However, it is not known w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02473","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":"1501.02473","created_at":"2026-05-18T02:29:37.890068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02473v1","created_at":"2026-05-18T02:29:37.890068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02473","created_at":"2026-05-18T02:29:37.890068+00:00"},{"alias_kind":"pith_short_12","alias_value":"TD6ZTFDCEBOD","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TD6ZTFDCEBODSFS5","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TD6ZTFDC","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00255","citing_title":"Sequential Automorphism Ensemble Decoding with Early Stopping","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06125","citing_title":"Multilevel Coset Codes on Lattices","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3","json":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3.json","graph_json":"https://pith.science/api/pith-number/TD6ZTFDCEBODSFS5MXFMNQNHA3/graph.json","events_json":"https://pith.science/api/pith-number/TD6ZTFDCEBODSFS5MXFMNQNHA3/events.json","paper":"https://pith.science/paper/TD6ZTFDC"},"agent_actions":{"view_html":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3","download_json":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3.json","view_paper":"https://pith.science/paper/TD6ZTFDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02473&json=true","fetch_graph":"https://pith.science/api/pith-number/TD6ZTFDCEBODSFS5MXFMNQNHA3/graph.json","fetch_events":"https://pith.science/api/pith-number/TD6ZTFDCEBODSFS5MXFMNQNHA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/action/storage_attestation","attest_author":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/action/author_attestation","sign_citation":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/action/citation_signature","submit_replication":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/action/replication_record"}},"created_at":"2026-05-18T02:29:37.890068+00:00","updated_at":"2026-05-18T02:29:37.890068+00:00"}