{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LROGZYQITCN4WX4SC7BUYDYSLF","short_pith_number":"pith:LROGZYQI","schema_version":"1.0","canonical_sha256":"5c5c6ce208989bcb5f9217c34c0f1259657285e734e74ca0169c1079173a1e93","source":{"kind":"arxiv","id":"1901.01280","version":1},"attestation_state":"computed","paper":{"title":"Practical Polar Code Construction Using Generalised Generator Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Emre Pusane, Berksan Serbetci","submitted_at":"2019-01-04T19:11:43Z","abstract_excerpt":"Polar coding is a recently proposed coding technique that can provably achieve the channel capacity. The polar code structure, which is based on the original 2x2 generator matrix, polarises the channels, i.e., a portion of the channel capacities approach 1, while the remaining channel capacities approach 0. Due to the specific size of this original generator matrix, polar codes can only have code lengths equal to the powers of 2, resulting in inefficiency for codes of practical lengths. In this paper, the performance of finite-length polar codes over the binary erasure channel is analysed. A n"},"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":"1901.01280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-04T19:11:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79aca0c0db56d4c5a2ea2aaf3cd901f2d381c8403d644852b454e727b9e3e720","abstract_canon_sha256":"bfa28d1eaa72f48c909bc3bce94c1af69e3833b8c719b088c932915d43e78e69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:52.315036Z","signature_b64":"CKHd4VjCIGaVzol8aOZJomryagzWl+/YRQJ0RsMWbQpktTG3Qd5SEVVvfaIVymyq9+/hamWfFADBFQtqV9z4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c5c6ce208989bcb5f9217c34c0f1259657285e734e74ca0169c1079173a1e93","last_reissued_at":"2026-05-17T23:56:52.314602Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:52.314602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Polar Code Construction Using Generalised Generator Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Emre Pusane, Berksan Serbetci","submitted_at":"2019-01-04T19:11:43Z","abstract_excerpt":"Polar coding is a recently proposed coding technique that can provably achieve the channel capacity. The polar code structure, which is based on the original 2x2 generator matrix, polarises the channels, i.e., a portion of the channel capacities approach 1, while the remaining channel capacities approach 0. Due to the specific size of this original generator matrix, polar codes can only have code lengths equal to the powers of 2, resulting in inefficiency for codes of practical lengths. In this paper, the performance of finite-length polar codes over the binary erasure channel is analysed. A n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01280","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":"1901.01280","created_at":"2026-05-17T23:56:52.314670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01280v1","created_at":"2026-05-17T23:56:52.314670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01280","created_at":"2026-05-17T23:56:52.314670+00:00"},{"alias_kind":"pith_short_12","alias_value":"LROGZYQITCN4","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LROGZYQITCN4WX4S","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LROGZYQI","created_at":"2026-05-18T12:33:21.387695+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/LROGZYQITCN4WX4SC7BUYDYSLF","json":"https://pith.science/pith/LROGZYQITCN4WX4SC7BUYDYSLF.json","graph_json":"https://pith.science/api/pith-number/LROGZYQITCN4WX4SC7BUYDYSLF/graph.json","events_json":"https://pith.science/api/pith-number/LROGZYQITCN4WX4SC7BUYDYSLF/events.json","paper":"https://pith.science/paper/LROGZYQI"},"agent_actions":{"view_html":"https://pith.science/pith/LROGZYQITCN4WX4SC7BUYDYSLF","download_json":"https://pith.science/pith/LROGZYQITCN4WX4SC7BUYDYSLF.json","view_paper":"https://pith.science/paper/LROGZYQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01280&json=true","fetch_graph":"https://pith.science/api/pith-number/LROGZYQITCN4WX4SC7BUYDYSLF/graph.json","fetch_events":"https://pith.science/api/pith-number/LROGZYQITCN4WX4SC7BUYDYSLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LROGZYQITCN4WX4SC7BUYDYSLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LROGZYQITCN4WX4SC7BUYDYSLF/action/storage_attestation","attest_author":"https://pith.science/pith/LROGZYQITCN4WX4SC7BUYDYSLF/action/author_attestation","sign_citation":"https://pith.science/pith/LROGZYQITCN4WX4SC7BUYDYSLF/action/citation_signature","submit_replication":"https://pith.science/pith/LROGZYQITCN4WX4SC7BUYDYSLF/action/replication_record"}},"created_at":"2026-05-17T23:56:52.314670+00:00","updated_at":"2026-05-17T23:56:52.314670+00:00"}