{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZJF5B7SN756FGTW56BXUH4ITLX","short_pith_number":"pith:ZJF5B7SN","schema_version":"1.0","canonical_sha256":"ca4bd0fe4dff7c534eddf06f43f1135dc85153871bfd8374b4073690942c9ee5","source":{"kind":"arxiv","id":"2202.04454","version":2},"attestation_state":"computed","paper":{"title":"Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization","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-02-09T13:29:30Z","abstract_excerpt":"The construction of polar codes with code length $n=2^m$ involves $m$ layers of polar transforms. In this paper, we observe that after each layer of polar transforms, one can swap certain pairs of adjacent bits to accelerate the polarization process. More precisely, if the previous bit is more reliable than its next bit under the successive decoder, then switching the decoding order of these two adjacent bits will make the reliable bit even more reliable and the noisy bit even noisier.\n  Based on this observation, we propose a new family of codes called the Adjacent-Bits-Swapped (ABS) polar co"},"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":"2202.04454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-09T13:29:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1c7ab24741793bf0bd41ad3fbe1932740019846173f257e48eeb3bb4894280e0","abstract_canon_sha256":"933ebd193852fadac8d71ecd0b7831079160b898d2d0f3de02866fcbe90b08ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:16.027731Z","signature_b64":"y5ER3jTLn6U5Pv4kbhriKkXixO/W84eeKNO4vXexNDC+G3oBGY8DWR9IGR48CofcxHvN38ZE/lMIVaatB75uAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca4bd0fe4dff7c534eddf06f43f1135dc85153871bfd8374b4073690942c9ee5","last_reissued_at":"2026-07-05T06:33:16.027231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:16.027231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization","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-02-09T13:29:30Z","abstract_excerpt":"The construction of polar codes with code length $n=2^m$ involves $m$ layers of polar transforms. In this paper, we observe that after each layer of polar transforms, one can swap certain pairs of adjacent bits to accelerate the polarization process. More precisely, if the previous bit is more reliable than its next bit under the successive decoder, then switching the decoding order of these two adjacent bits will make the reliable bit even more reliable and the noisy bit even noisier.\n  Based on this observation, we propose a new family of codes called the Adjacent-Bits-Swapped (ABS) polar co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.04454","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/2202.04454/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":"2202.04454","created_at":"2026-07-05T06:33:16.027294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.04454v2","created_at":"2026-07-05T06:33:16.027294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.04454","created_at":"2026-07-05T06:33:16.027294+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJF5B7SN756F","created_at":"2026-07-05T06:33:16.027294+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJF5B7SN756FGTW5","created_at":"2026-07-05T06:33:16.027294+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJF5B7SN","created_at":"2026-07-05T06:33:16.027294+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/ZJF5B7SN756FGTW56BXUH4ITLX","json":"https://pith.science/pith/ZJF5B7SN756FGTW56BXUH4ITLX.json","graph_json":"https://pith.science/api/pith-number/ZJF5B7SN756FGTW56BXUH4ITLX/graph.json","events_json":"https://pith.science/api/pith-number/ZJF5B7SN756FGTW56BXUH4ITLX/events.json","paper":"https://pith.science/paper/ZJF5B7SN"},"agent_actions":{"view_html":"https://pith.science/pith/ZJF5B7SN756FGTW56BXUH4ITLX","download_json":"https://pith.science/pith/ZJF5B7SN756FGTW56BXUH4ITLX.json","view_paper":"https://pith.science/paper/ZJF5B7SN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.04454&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJF5B7SN756FGTW56BXUH4ITLX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJF5B7SN756FGTW56BXUH4ITLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJF5B7SN756FGTW56BXUH4ITLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJF5B7SN756FGTW56BXUH4ITLX/action/storage_attestation","attest_author":"https://pith.science/pith/ZJF5B7SN756FGTW56BXUH4ITLX/action/author_attestation","sign_citation":"https://pith.science/pith/ZJF5B7SN756FGTW56BXUH4ITLX/action/citation_signature","submit_replication":"https://pith.science/pith/ZJF5B7SN756FGTW56BXUH4ITLX/action/replication_record"}},"created_at":"2026-07-05T06:33:16.027294+00:00","updated_at":"2026-07-05T06:33:16.027294+00:00"}