{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VTVFXYHLODI2VWSNIJLIDPVWLM","short_pith_number":"pith:VTVFXYHL","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"},"canonical_sha256":"acea5be0eb70d1aada4d425681beb65b0f3e86efd9d145ef590e55780f8f8fe9","source":{"kind":"arxiv","id":"1701.06458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06458","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06458v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06458","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"VTVFXYHLODI2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VTVFXYHLODI2VWSN","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VTVFXYHL","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VTVFXYHLODI2VWSNIJLIDPVWLM","target":"record","payload":{"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"},"canonical_sha256":"acea5be0eb70d1aada4d425681beb65b0f3e86efd9d145ef590e55780f8f8fe9","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"},"source_kind":"arxiv","source_id":"1701.06458","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxYVVTSQNKVxswU6BYeJRmDD+Uu4WM23rgSr5jH8pWNcnhTT5R+gCT5OxspELQs2dHU1xT5vPc7m85iHsNiCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:13:24.520695Z"},"content_sha256":"5922f877a1fc66d8067b7f635cb0563c4f0e91d01fa7fdc1f4d2aa8e44e45a80","schema_version":"1.0","event_id":"sha256:5922f877a1fc66d8067b7f635cb0563c4f0e91d01fa7fdc1f4d2aa8e44e45a80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VTVFXYHLODI2VWSNIJLIDPVWLM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KAKvzVbf75vs1zQAHsgrFSeZdfO/KZfmp/u8EpmeYa2kEI2rax6Un6G6v3mTge6a43aPtsrGCE+sCgxLurjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:13:24.521303Z"},"content_sha256":"13beb13bc5f8cfe2b030999923a6123971caa305198391a8b752bd7443a3fefc","schema_version":"1.0","event_id":"sha256:13beb13bc5f8cfe2b030999923a6123971caa305198391a8b752bd7443a3fefc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/bundle.json","state_url":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T12:13:24Z","links":{"resolver":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM","bundle":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/bundle.json","state":"https://pith.science/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTVFXYHLODI2VWSNIJLIDPVWLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VTVFXYHLODI2VWSNIJLIDPVWLM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f56c2c6446e3acadb1b4f33b431dde36d935d94bfe401cb0a5cd0c69bb5f1c11","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T15:34:13Z","title_canon_sha256":"7543aee6e999230bb5e1bddacb7457383ef4a78192626d7266c79cec3d5647fd"},"schema_version":"1.0","source":{"id":"1701.06458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06458","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06458v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06458","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"VTVFXYHLODI2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VTVFXYHLODI2VWSN","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VTVFXYHL","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:13beb13bc5f8cfe2b030999923a6123971caa305198391a8b752bd7443a3fefc","target":"graph","created_at":"2026-05-18T00:52:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Frederic Gabry, Ingmar Land, Valerio Bioglio","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T15:34:13Z","title":"Low-Complexity Puncturing and Shortening of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06458","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5922f877a1fc66d8067b7f635cb0563c4f0e91d01fa7fdc1f4d2aa8e44e45a80","target":"record","created_at":"2026-05-18T00:52:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f56c2c6446e3acadb1b4f33b431dde36d935d94bfe401cb0a5cd0c69bb5f1c11","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T15:34:13Z","title_canon_sha256":"7543aee6e999230bb5e1bddacb7457383ef4a78192626d7266c79cec3d5647fd"},"schema_version":"1.0","source":{"id":"1701.06458","kind":"arxiv","version":1}},"canonical_sha256":"acea5be0eb70d1aada4d425681beb65b0f3e86efd9d145ef590e55780f8f8fe9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acea5be0eb70d1aada4d425681beb65b0f3e86efd9d145ef590e55780f8f8fe9","first_computed_at":"2026-05-18T00:52:18.309811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:18.309811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2A+c2/1mO4IGQbE5SJ6hG8a9M2pkwHelYV9g41R4yg3gd1o8/yx4wsu/YfcceVJ/F2QgB29NzeW4Y7wSQ7MdAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:18.310289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5922f877a1fc66d8067b7f635cb0563c4f0e91d01fa7fdc1f4d2aa8e44e45a80","sha256:13beb13bc5f8cfe2b030999923a6123971caa305198391a8b752bd7443a3fefc"],"state_sha256":"7ccfe55b6a48af305f83d57dbd589fec502c9068f31bfb99f89cd3995ec26135"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DhN00EgFGIO8dit1OovW/c0o2OKaJsSkhlNNe8w97YiDVpxHPWR6w95HX2xPTuztSLO32zCkktw9JWmk0C2yAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:13:24.524297Z","bundle_sha256":"e2ecbdc020f30ef5b8a26f7716df0e4807186565d34ad689f73d8a616d2f9bce"}}