{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PPBR6BNMMNCKVNTXW5F3MLE3UB","short_pith_number":"pith:PPBR6BNM","schema_version":"1.0","canonical_sha256":"7bc31f05ac6344aab677b74bb62c9ba04a0a9ef6006e95d03e96d7dcf6a32699","source":{"kind":"arxiv","id":"1704.05709","version":1},"attestation_state":"computed","paper":{"title":"$\\beta$-expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ganghua Yang, Gaoning He, Ingmar Land, Jean-Claude Belfiore, Jun Wang, Ran Zhang, Rong Li, Wen Tong, Xiaocheng Liu, Ying Chen, Yiqun Ge","submitted_at":"2017-04-19T12:41:50Z","abstract_excerpt":"In this work, we introduce $\\beta$-expansion, a notion borrowed from number theory, as a theoretical framework to study fast construction of polar codes based on a recursive structure of universal partial order (UPO) and polarization weight (PW) algorithm. We show that polar codes can be recursively constructed from UPO by continuously solving several polynomial equations at each recursive step. From these polynomial equations, we can extract an interval for $\\beta$, such that ranking the synthetic channels through a closed-form $\\beta$-expansion preserves the property of nested frozen sets, w"},"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":"1704.05709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-19T12:41:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d34e6b2cdedc8d593d17177ab3cd5d4c4d224405948824a8229ae9276d52a316","abstract_canon_sha256":"d1279d079f69fe2970541584fcf4afb5abf4013ebfcbf48d49c6b83626670a08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:06.729432Z","signature_b64":"FmWZQ/uDLY2wydFaiPRH+PcA9jEkdrzCH8sCZl5s0o60VgJrM6azXhO4NmVs6Pn3slpdX5sTIf083JNYen2gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bc31f05ac6344aab677b74bb62c9ba04a0a9ef6006e95d03e96d7dcf6a32699","last_reissued_at":"2026-05-18T00:46:06.728980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:06.728980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\beta$-expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ganghua Yang, Gaoning He, Ingmar Land, Jean-Claude Belfiore, Jun Wang, Ran Zhang, Rong Li, Wen Tong, Xiaocheng Liu, Ying Chen, Yiqun Ge","submitted_at":"2017-04-19T12:41:50Z","abstract_excerpt":"In this work, we introduce $\\beta$-expansion, a notion borrowed from number theory, as a theoretical framework to study fast construction of polar codes based on a recursive structure of universal partial order (UPO) and polarization weight (PW) algorithm. We show that polar codes can be recursively constructed from UPO by continuously solving several polynomial equations at each recursive step. From these polynomial equations, we can extract an interval for $\\beta$, such that ranking the synthetic channels through a closed-form $\\beta$-expansion preserves the property of nested frozen sets, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05709","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.05709","created_at":"2026-05-18T00:46:06.729053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05709v1","created_at":"2026-05-18T00:46:06.729053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05709","created_at":"2026-05-18T00:46:06.729053+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPBR6BNMMNCK","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPBR6BNMMNCKVNTX","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPBR6BNM","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2304.04743","citing_title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PPBR6BNMMNCKVNTXW5F3MLE3UB","json":"https://pith.science/pith/PPBR6BNMMNCKVNTXW5F3MLE3UB.json","graph_json":"https://pith.science/api/pith-number/PPBR6BNMMNCKVNTXW5F3MLE3UB/graph.json","events_json":"https://pith.science/api/pith-number/PPBR6BNMMNCKVNTXW5F3MLE3UB/events.json","paper":"https://pith.science/paper/PPBR6BNM"},"agent_actions":{"view_html":"https://pith.science/pith/PPBR6BNMMNCKVNTXW5F3MLE3UB","download_json":"https://pith.science/pith/PPBR6BNMMNCKVNTXW5F3MLE3UB.json","view_paper":"https://pith.science/paper/PPBR6BNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05709&json=true","fetch_graph":"https://pith.science/api/pith-number/PPBR6BNMMNCKVNTXW5F3MLE3UB/graph.json","fetch_events":"https://pith.science/api/pith-number/PPBR6BNMMNCKVNTXW5F3MLE3UB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPBR6BNMMNCKVNTXW5F3MLE3UB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPBR6BNMMNCKVNTXW5F3MLE3UB/action/storage_attestation","attest_author":"https://pith.science/pith/PPBR6BNMMNCKVNTXW5F3MLE3UB/action/author_attestation","sign_citation":"https://pith.science/pith/PPBR6BNMMNCKVNTXW5F3MLE3UB/action/citation_signature","submit_replication":"https://pith.science/pith/PPBR6BNMMNCKVNTXW5F3MLE3UB/action/replication_record"}},"created_at":"2026-05-18T00:46:06.729053+00:00","updated_at":"2026-05-18T00:46:06.729053+00:00"}