{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WP3BPJA7WDSTZXZKTLKLFGCKA5","short_pith_number":"pith:WP3BPJA7","schema_version":"1.0","canonical_sha256":"b3f617a41fb0e53cdf2a9ad4b2984a0764dd066ab13d34f3fbc5381672a41e27","source":{"kind":"arxiv","id":"1912.06359","version":1},"attestation_state":"computed","paper":{"title":"On Pre-transformed Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, Huazi Zhang, Jiaqi Gu","submitted_at":"2019-12-13T08:41:38Z","abstract_excerpt":"In this paper, we prove that any pre-transformation with an upper-triangular matrix (including cyclic redundancy check (CRC), parity-check (PC) and convolution code (CC) matrix) does not reduce the code minimum distance and an properly designed pre-transformation can reduce the number of codewords with the minimum distance. This explains that the pre-transformed polar codes can perform better than the Polar/RM codes."},"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":"1912.06359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-12-13T08:41:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"556afcac02adcccd3829e27938ae7a883b703690fc0b297a25646b83c5047d74","abstract_canon_sha256":"08ed4fa4d2ba1e9a852b9b0d97af8ad4ecccbdfa21ba6ad99e7f27dd5b95856a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:59.690386Z","signature_b64":"1MowPDBgfsVohidV//Hu0O+YsRgPoRZClcQ1dTIefQSqVE0cjX+KfAQNN8VZ3kBIFhvNPrWuPeqlrYd2SSglDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3f617a41fb0e53cdf2a9ad4b2984a0764dd066ab13d34f3fbc5381672a41e27","last_reissued_at":"2026-07-05T00:25:59.689905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:59.689905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Pre-transformed Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, Huazi Zhang, Jiaqi Gu","submitted_at":"2019-12-13T08:41:38Z","abstract_excerpt":"In this paper, we prove that any pre-transformation with an upper-triangular matrix (including cyclic redundancy check (CRC), parity-check (PC) and convolution code (CC) matrix) does not reduce the code minimum distance and an properly designed pre-transformation can reduce the number of codewords with the minimum distance. This explains that the pre-transformed polar codes can perform better than the Polar/RM codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.06359","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.06359/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.06359","created_at":"2026-07-05T00:25:59.689958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.06359v1","created_at":"2026-07-05T00:25:59.689958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.06359","created_at":"2026-07-05T00:25:59.689958+00:00"},{"alias_kind":"pith_short_12","alias_value":"WP3BPJA7WDST","created_at":"2026-07-05T00:25:59.689958+00:00"},{"alias_kind":"pith_short_16","alias_value":"WP3BPJA7WDSTZXZK","created_at":"2026-07-05T00:25:59.689958+00:00"},{"alias_kind":"pith_short_8","alias_value":"WP3BPJA7","created_at":"2026-07-05T00:25:59.689958+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10068","citing_title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WP3BPJA7WDSTZXZKTLKLFGCKA5","json":"https://pith.science/pith/WP3BPJA7WDSTZXZKTLKLFGCKA5.json","graph_json":"https://pith.science/api/pith-number/WP3BPJA7WDSTZXZKTLKLFGCKA5/graph.json","events_json":"https://pith.science/api/pith-number/WP3BPJA7WDSTZXZKTLKLFGCKA5/events.json","paper":"https://pith.science/paper/WP3BPJA7"},"agent_actions":{"view_html":"https://pith.science/pith/WP3BPJA7WDSTZXZKTLKLFGCKA5","download_json":"https://pith.science/pith/WP3BPJA7WDSTZXZKTLKLFGCKA5.json","view_paper":"https://pith.science/paper/WP3BPJA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.06359&json=true","fetch_graph":"https://pith.science/api/pith-number/WP3BPJA7WDSTZXZKTLKLFGCKA5/graph.json","fetch_events":"https://pith.science/api/pith-number/WP3BPJA7WDSTZXZKTLKLFGCKA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WP3BPJA7WDSTZXZKTLKLFGCKA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WP3BPJA7WDSTZXZKTLKLFGCKA5/action/storage_attestation","attest_author":"https://pith.science/pith/WP3BPJA7WDSTZXZKTLKLFGCKA5/action/author_attestation","sign_citation":"https://pith.science/pith/WP3BPJA7WDSTZXZKTLKLFGCKA5/action/citation_signature","submit_replication":"https://pith.science/pith/WP3BPJA7WDSTZXZKTLKLFGCKA5/action/replication_record"}},"created_at":"2026-07-05T00:25:59.689958+00:00","updated_at":"2026-07-05T00:25:59.689958+00:00"}