{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VTVFXYHLODI2VWSNIJLIDPVWLM","short_pith_number":"pith:VTVFXYHL","schema_version":"1.0","canonical_sha256":"acea5be0eb70d1aada4d425681beb65b0f3e86efd9d145ef590e55780f8f8fe9","source":{"kind":"arxiv","id":"1701.06458","version":1},"attestation_state":"computed","paper":{"title":"Low-Complexity Puncturing and Shortening of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Frederic Gabry, Ingmar Land, Valerio Bioglio","submitted_at":"2017-01-23T15:34:13Z","abstract_excerpt":"In this work, we address the low-complexity construction of shortened and punctured polar codes from a unified view. While several independent puncturing and shortening designs were attempted in the literature, our goal is a unique, low-complexity construction encompassing both techniques in order to achieve any code length and rate. We observe that our solution significantly reduces the construction complexity as compared to state-of-the-art solutions while providing a block error rate performance comparable to constructions that are highly optimized for specific lengths and rates. This makes"},"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":"1701.06458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T15:34:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7543aee6e999230bb5e1bddacb7457383ef4a78192626d7266c79cec3d5647fd","abstract_canon_sha256":"f56c2c6446e3acadb1b4f33b431dde36d935d94bfe401cb0a5cd0c69bb5f1c11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:18.310289Z","signature_b64":"2A+c2/1mO4IGQbE5SJ6hG8a9M2pkwHelYV9g41R4yg3gd1o8/yx4wsu/YfcceVJ/F2QgB29NzeW4Y7wSQ7MdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acea5be0eb70d1aada4d425681beb65b0f3e86efd9d145ef590e55780f8f8fe9","last_reissued_at":"2026-05-18T00:52:18.309811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:18.309811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Complexity Puncturing and Shortening of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Frederic Gabry, Ingmar Land, Valerio Bioglio","submitted_at":"2017-01-23T15:34:13Z","abstract_excerpt":"In this work, we address the low-complexity construction of shortened and punctured polar codes from a unified view. While several independent puncturing and shortening designs were attempted in the literature, our goal is a unique, low-complexity construction encompassing both techniques in order to achieve any code length and rate. We observe that our solution significantly reduces the construction complexity as compared to state-of-the-art solutions while providing a block error rate performance comparable to constructions that are highly optimized for specific lengths and rates. This makes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06458","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":"1701.06458","created_at":"2026-05-18T00:52:18.309892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06458v1","created_at":"2026-05-18T00:52:18.309892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06458","created_at":"2026-05-18T00:52:18.309892+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTVFXYHLODI2","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTVFXYHLODI2VWSN","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTVFXYHL","created_at":"2026-05-18T12:31:49.984773+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/VTVFXYHLODI2VWSNIJLIDPVWLM","json":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM.json","graph_json":"https://pith.science/api/pith-number/VTVFXYHLODI2VWSNIJLIDPVWLM/graph.json","events_json":"https://pith.science/api/pith-number/VTVFXYHLODI2VWSNIJLIDPVWLM/events.json","paper":"https://pith.science/paper/VTVFXYHL"},"agent_actions":{"view_html":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM","download_json":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM.json","view_paper":"https://pith.science/paper/VTVFXYHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06458&json=true","fetch_graph":"https://pith.science/api/pith-number/VTVFXYHLODI2VWSNIJLIDPVWLM/graph.json","fetch_events":"https://pith.science/api/pith-number/VTVFXYHLODI2VWSNIJLIDPVWLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/action/storage_attestation","attest_author":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/action/author_attestation","sign_citation":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/action/citation_signature","submit_replication":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/action/replication_record"}},"created_at":"2026-05-18T00:52:18.309892+00:00","updated_at":"2026-05-18T00:52:18.309892+00:00"}