{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F6W6ZTNIMBEGPF4J2UYK2WMQZP","short_pith_number":"pith:F6W6ZTNI","schema_version":"1.0","canonical_sha256":"2fadeccda86048679789d530ad5990cbfce072c725d3ed6c978eb1b587e94929","source":{"kind":"arxiv","id":"1501.06091","version":2},"attestation_state":"computed","paper":{"title":"Relaxed Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennady Feygin, Hessam Mahdavifar, Inyup Kang, Jungwon Lee, Mostafa El-Khamy","submitted_at":"2015-01-24T22:51:54Z","abstract_excerpt":"Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of discrete memoryless channels. Ar{\\i}kan's polar encoder and successive cancellation decoder have complexities of $N \\log N$, for code length $N$. Although, the complexity bound of $N \\log N$ is asymptotically favorable, we report in this work methods to further reduce the encoding and decoding complexities of polar coding. The crux is to relax the polarization of certain bit-channels without performance degradation. We consid"},"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.06091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-24T22:51:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2a6b26ed48f2f6ac124a15c2a44517a4741b5013c0374acae95a35911e9f9546","abstract_canon_sha256":"5d4a38cc2904c6ec94b17896ec1b3d1576f892f6e3eb8d6d904eee8aacbb0d0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:52.745549Z","signature_b64":"6a4pPedcVQHsCWW5WuRiLa6QsS7Gu3C+7Z/AupvlC2oF4gNSPqplJ4smIoy+BOQnYJUxVuR58D1jA4aahxNrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fadeccda86048679789d530ad5990cbfce072c725d3ed6c978eb1b587e94929","last_reissued_at":"2026-05-18T00:49:52.745025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:52.745025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxed Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennady Feygin, Hessam Mahdavifar, Inyup Kang, Jungwon Lee, Mostafa El-Khamy","submitted_at":"2015-01-24T22:51:54Z","abstract_excerpt":"Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of discrete memoryless channels. Ar{\\i}kan's polar encoder and successive cancellation decoder have complexities of $N \\log N$, for code length $N$. Although, the complexity bound of $N \\log N$ is asymptotically favorable, we report in this work methods to further reduce the encoding and decoding complexities of polar coding. The crux is to relax the polarization of certain bit-channels without performance degradation. We consid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06091","kind":"arxiv","version":2},"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.06091","created_at":"2026-05-18T00:49:52.745111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06091v2","created_at":"2026-05-18T00:49:52.745111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06091","created_at":"2026-05-18T00:49:52.745111+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6W6ZTNIMBEG","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6W6ZTNIMBEGPF4J","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6W6ZTNI","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP","json":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP.json","graph_json":"https://pith.science/api/pith-number/F6W6ZTNIMBEGPF4J2UYK2WMQZP/graph.json","events_json":"https://pith.science/api/pith-number/F6W6ZTNIMBEGPF4J2UYK2WMQZP/events.json","paper":"https://pith.science/paper/F6W6ZTNI"},"agent_actions":{"view_html":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP","download_json":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP.json","view_paper":"https://pith.science/paper/F6W6ZTNI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06091&json=true","fetch_graph":"https://pith.science/api/pith-number/F6W6ZTNIMBEGPF4J2UYK2WMQZP/graph.json","fetch_events":"https://pith.science/api/pith-number/F6W6ZTNIMBEGPF4J2UYK2WMQZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/action/storage_attestation","attest_author":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/action/author_attestation","sign_citation":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/action/citation_signature","submit_replication":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/action/replication_record"}},"created_at":"2026-05-18T00:49:52.745111+00:00","updated_at":"2026-05-18T00:49:52.745111+00:00"}