{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QY67LBQZ4HC5OT3WUUB7CMMKRY","short_pith_number":"pith:QY67LBQZ","schema_version":"1.0","canonical_sha256":"863df58619e1c5d74f76a503f1318a8e23a32caa53f3fc557d62e435a93d80f3","source":{"kind":"arxiv","id":"2209.02461","version":2},"attestation_state":"computed","paper":{"title":"ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guodong Li, Min Ye, Sihuang Hu","submitted_at":"2022-09-06T13:01:02Z","abstract_excerpt":"ABS polar codes were recently proposed to speed up polarization by swapping certain pairs of adjacent bits after each layer of polar transform. In this paper, we observe that applying the Arikan transform $(U_i, U_{i+1}) \\mapsto (U_{i}+U_{i+1}, U_{i+1})$ on certain pairs of adjacent bits after each polar transform layer leads to even faster polarization.\n  In light of this, we propose ABS+ polar codes which incorporate the Arikan transform in addition to the swapping transform in ABS polar codes. In order to efficiently construct and decode ABS+ polar codes, we derive a new recursive relation "},"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":"2209.02461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-09-06T13:01:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8a1f84c453e8d3686bc09fe9b0080fff472063740815a081ecc858bce11249a6","abstract_canon_sha256":"251b6b9f2f2cd37f2a0eca8b0c0a1df3bd169be959c30bcc3c606741bfe94ec0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:11:12.682750Z","signature_b64":"zYqT9f6+aYVjewDGO1YrXBBlXrBFOn7Un2YZQySn5n2G3NtZc2vsAong8bgYz8oOxgsx4ZwRJHHdRT9WKH4lCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863df58619e1c5d74f76a503f1318a8e23a32caa53f3fc557d62e435a93d80f3","last_reissued_at":"2026-07-05T07:11:12.682323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:11:12.682323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guodong Li, Min Ye, Sihuang Hu","submitted_at":"2022-09-06T13:01:02Z","abstract_excerpt":"ABS polar codes were recently proposed to speed up polarization by swapping certain pairs of adjacent bits after each layer of polar transform. In this paper, we observe that applying the Arikan transform $(U_i, U_{i+1}) \\mapsto (U_{i}+U_{i+1}, U_{i+1})$ on certain pairs of adjacent bits after each polar transform layer leads to even faster polarization.\n  In light of this, we propose ABS+ polar codes which incorporate the Arikan transform in addition to the swapping transform in ABS polar codes. In order to efficiently construct and decode ABS+ polar codes, we derive a new recursive relation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.02461","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.02461/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":"2209.02461","created_at":"2026-07-05T07:11:12.682391+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.02461v2","created_at":"2026-07-05T07:11:12.682391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.02461","created_at":"2026-07-05T07:11:12.682391+00:00"},{"alias_kind":"pith_short_12","alias_value":"QY67LBQZ4HC5","created_at":"2026-07-05T07:11:12.682391+00:00"},{"alias_kind":"pith_short_16","alias_value":"QY67LBQZ4HC5OT3W","created_at":"2026-07-05T07:11:12.682391+00:00"},{"alias_kind":"pith_short_8","alias_value":"QY67LBQZ","created_at":"2026-07-05T07:11:12.682391+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/QY67LBQZ4HC5OT3WUUB7CMMKRY","json":"https://pith.science/pith/QY67LBQZ4HC5OT3WUUB7CMMKRY.json","graph_json":"https://pith.science/api/pith-number/QY67LBQZ4HC5OT3WUUB7CMMKRY/graph.json","events_json":"https://pith.science/api/pith-number/QY67LBQZ4HC5OT3WUUB7CMMKRY/events.json","paper":"https://pith.science/paper/QY67LBQZ"},"agent_actions":{"view_html":"https://pith.science/pith/QY67LBQZ4HC5OT3WUUB7CMMKRY","download_json":"https://pith.science/pith/QY67LBQZ4HC5OT3WUUB7CMMKRY.json","view_paper":"https://pith.science/paper/QY67LBQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.02461&json=true","fetch_graph":"https://pith.science/api/pith-number/QY67LBQZ4HC5OT3WUUB7CMMKRY/graph.json","fetch_events":"https://pith.science/api/pith-number/QY67LBQZ4HC5OT3WUUB7CMMKRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QY67LBQZ4HC5OT3WUUB7CMMKRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QY67LBQZ4HC5OT3WUUB7CMMKRY/action/storage_attestation","attest_author":"https://pith.science/pith/QY67LBQZ4HC5OT3WUUB7CMMKRY/action/author_attestation","sign_citation":"https://pith.science/pith/QY67LBQZ4HC5OT3WUUB7CMMKRY/action/citation_signature","submit_replication":"https://pith.science/pith/QY67LBQZ4HC5OT3WUUB7CMMKRY/action/replication_record"}},"created_at":"2026-07-05T07:11:12.682391+00:00","updated_at":"2026-07-05T07:11:12.682391+00:00"}