{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MA4RHKGVUAFGEGTEPOZ5DZY5N4","short_pith_number":"pith:MA4RHKGV","schema_version":"1.0","canonical_sha256":"603913a8d5a00a621a647bb3d1e71d6f3e1055b4625c63286beb956ac1e94bb3","source":{"kind":"arxiv","id":"2603.19938","version":2},"attestation_state":"computed","paper":{"title":"Capacity-Achieving BBT Polar Codes with Interleaver-Assisted BP Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Binary balanced tree transformation lets polar codes achieve capacity at any block length.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xiao Ma, Xinyuanmeng Yao","submitted_at":"2026-03-20T13:32:20Z","abstract_excerpt":"In this paper, we introduce a binary balanced tree (BBT) channel transformation that extends Ar{\\i}kan's channel transformation to arbitrary block lengths. We prove that the proposed transformation induces channel polarization, thereby establishing that BBT polar codes achieve the capacity of binary-input memoryless symmetric (BMS) channels. To characterize the finite-length performance of BBT polar codes, we further develop an efficient method for estimating the weight spectrum by exploiting the hierarchical tree structure, and derive analytical upper and lower bounds on the frame error rate "},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2603.19938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-03-20T13:32:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d0af50127f9705ae37f5c1994ece0dc1d77ad2e5db4cb407809d197e1a4279e2","abstract_canon_sha256":"1b5c00a3523220c9aec2df97b6aabfa68525529b28a0faf3112d405e32b2f0d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:15.714291Z","signature_b64":"Mlrm/CL8GFGSXWyNAazA8X0vmCDZhq6TG24zLHz5axXRzCQCUcEDyNZRVVqZfJsMEj6Lf9irDUN25ndkdQMHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"603913a8d5a00a621a647bb3d1e71d6f3e1055b4625c63286beb956ac1e94bb3","last_reissued_at":"2026-05-17T23:39:15.713647Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:15.713647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity-Achieving BBT Polar Codes with Interleaver-Assisted BP Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Binary balanced tree transformation lets polar codes achieve capacity at any block length.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xiao Ma, Xinyuanmeng Yao","submitted_at":"2026-03-20T13:32:20Z","abstract_excerpt":"In this paper, we introduce a binary balanced tree (BBT) channel transformation that extends Ar{\\i}kan's channel transformation to arbitrary block lengths. We prove that the proposed transformation induces channel polarization, thereby establishing that BBT polar codes achieve the capacity of binary-input memoryless symmetric (BMS) channels. To characterize the finite-length performance of BBT polar codes, we further develop an efficient method for estimating the weight spectrum by exploiting the hierarchical tree structure, and derive analytical upper and lower bounds on the frame error rate "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that the proposed transformation induces channel polarization, thereby establishing that BBT polar codes achieve the capacity of binary-input memoryless symmetric (BMS) channels.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The binary balanced tree transformation preserves the recursive polarization property of Arıkan's original construction when extended to arbitrary block lengths.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"BBT polar codes achieve capacity for any block length via a new tree transformation and support low-latency BP decoding through interleaving and sub-graph processing.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Binary balanced tree transformation lets polar codes achieve capacity at any block length.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4f5d8d04926e5dd7c5512ffe88a638ad9bcb9a2004bd46548c127c77b09bf409"},"source":{"id":"2603.19938","kind":"arxiv","version":2},"verdict":{"id":"b1e8992c-c6c7-4a6c-a267-77b665f6f27c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T07:15:12.135465Z","strongest_claim":"We prove that the proposed transformation induces channel polarization, thereby establishing that BBT polar codes achieve the capacity of binary-input memoryless symmetric (BMS) channels.","one_line_summary":"BBT polar codes achieve capacity for any block length via a new tree transformation and support low-latency BP decoding through interleaving and sub-graph processing.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The binary balanced tree transformation preserves the recursive polarization property of Arıkan's original construction when extended to arbitrary block lengths.","pith_extraction_headline":"Binary balanced tree transformation lets polar codes achieve capacity at any block length."},"references":{"count":30,"sample":[{"doi":"","year":2009,"title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,","work_id":"b605a856-2626-4f88-b271-8996f31dc04e","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"CRC-aided decoding of polar codes,","work_id":"328e25b4-4445-4825-9959-c70672e3afc0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"List decoding of polar codes,","work_id":"9aa7ec32-aa3a-482e-879d-9b1b77ce75d4","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"5G NR: Multiplexing and channel coding,","work_id":"60438bfa-6f2e-4c86-8365-6da71985b973","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"A practical approach to polar codes,","work_id":"dfef8978-ae89-44f6-b1d3-c18dce90f965","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":30,"snapshot_sha256":"78223c3654618be19ca9c79461ac408781077f6296e83e532d3a6db13b58dc8c","internal_anchors":1},"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":"2603.19938","created_at":"2026-05-17T23:39:15.713747+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.19938v2","created_at":"2026-05-17T23:39:15.713747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.19938","created_at":"2026-05-17T23:39:15.713747+00:00"},{"alias_kind":"pith_short_12","alias_value":"MA4RHKGVUAFG","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"MA4RHKGVUAFGEGTE","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"MA4RHKGV","created_at":"2026-05-18T12:33:37.589309+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/MA4RHKGVUAFGEGTEPOZ5DZY5N4","json":"https://pith.science/pith/MA4RHKGVUAFGEGTEPOZ5DZY5N4.json","graph_json":"https://pith.science/api/pith-number/MA4RHKGVUAFGEGTEPOZ5DZY5N4/graph.json","events_json":"https://pith.science/api/pith-number/MA4RHKGVUAFGEGTEPOZ5DZY5N4/events.json","paper":"https://pith.science/paper/MA4RHKGV"},"agent_actions":{"view_html":"https://pith.science/pith/MA4RHKGVUAFGEGTEPOZ5DZY5N4","download_json":"https://pith.science/pith/MA4RHKGVUAFGEGTEPOZ5DZY5N4.json","view_paper":"https://pith.science/paper/MA4RHKGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.19938&json=true","fetch_graph":"https://pith.science/api/pith-number/MA4RHKGVUAFGEGTEPOZ5DZY5N4/graph.json","fetch_events":"https://pith.science/api/pith-number/MA4RHKGVUAFGEGTEPOZ5DZY5N4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MA4RHKGVUAFGEGTEPOZ5DZY5N4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MA4RHKGVUAFGEGTEPOZ5DZY5N4/action/storage_attestation","attest_author":"https://pith.science/pith/MA4RHKGVUAFGEGTEPOZ5DZY5N4/action/author_attestation","sign_citation":"https://pith.science/pith/MA4RHKGVUAFGEGTEPOZ5DZY5N4/action/citation_signature","submit_replication":"https://pith.science/pith/MA4RHKGVUAFGEGTEPOZ5DZY5N4/action/replication_record"}},"created_at":"2026-05-17T23:39:15.713747+00:00","updated_at":"2026-05-17T23:39:15.713747+00:00"}