{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:26PKXIANXSARVE74WFMCBLNHTK","short_pith_number":"pith:26PKXIAN","schema_version":"1.0","canonical_sha256":"d79eaba00dbc811a93fcb15820ada79ab94ab051a07066aae364b2a6f305fe77","source":{"kind":"arxiv","id":"1605.01997","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Finite-Length Scaling for Polar Codes over Large Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, R\\\"udiger Urbanke","submitted_at":"2016-05-06T16:30:07Z","abstract_excerpt":"For any prime power $q$, Mori and Tanaka introduced a family of $q$-ary polar codes based on $q$~by~$q$ Reed-Solomon polarization kernels. For transmission over a $q$-ary erasure channel, they also derived a closed-form recursion for the erasure probability of each effective channel. In this paper, we use that expression to analyze the finite-length scaling of these codes on the $q$-ary erasure channel with erasure probability $\\epsilon\\in(0,1)$. Our primary result is that, for any $\\gamma>0$ and $\\delta>0$, there is a $q_{0}$ such that, for all $q\\geq q_{0}$, the fraction of effective channel"},"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":"1605.01997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T16:30:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a3f0371d47de896543635efe9510f705d6afecda21c7d745f899983384b1c2e","abstract_canon_sha256":"0a0adc760d847f01d8104a773703525872a19ec72b1bd4356898f796e63e108f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:24.018089Z","signature_b64":"7kj0iPODTMqvVI6Z4f2AfpCQoMLMWjaL2x90HPX6VeBdmpMDgAywJS2LlB60BW7bKMzaSOHe0+brl2jp+NM3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79eaba00dbc811a93fcb15820ada79ab94ab051a07066aae364b2a6f305fe77","last_reissued_at":"2026-05-18T00:31:24.017517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:24.017517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Finite-Length Scaling for Polar Codes over Large Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, R\\\"udiger Urbanke","submitted_at":"2016-05-06T16:30:07Z","abstract_excerpt":"For any prime power $q$, Mori and Tanaka introduced a family of $q$-ary polar codes based on $q$~by~$q$ Reed-Solomon polarization kernels. For transmission over a $q$-ary erasure channel, they also derived a closed-form recursion for the erasure probability of each effective channel. In this paper, we use that expression to analyze the finite-length scaling of these codes on the $q$-ary erasure channel with erasure probability $\\epsilon\\in(0,1)$. Our primary result is that, for any $\\gamma>0$ and $\\delta>0$, there is a $q_{0}$ such that, for all $q\\geq q_{0}$, the fraction of effective channel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01997","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":""},"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":"1605.01997","created_at":"2026-05-18T00:31:24.017604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01997v2","created_at":"2026-05-18T00:31:24.017604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01997","created_at":"2026-05-18T00:31:24.017604+00:00"},{"alias_kind":"pith_short_12","alias_value":"26PKXIANXSAR","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"26PKXIANXSARVE74","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"26PKXIAN","created_at":"2026-05-18T12:29:52.810259+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/26PKXIANXSARVE74WFMCBLNHTK","json":"https://pith.science/pith/26PKXIANXSARVE74WFMCBLNHTK.json","graph_json":"https://pith.science/api/pith-number/26PKXIANXSARVE74WFMCBLNHTK/graph.json","events_json":"https://pith.science/api/pith-number/26PKXIANXSARVE74WFMCBLNHTK/events.json","paper":"https://pith.science/paper/26PKXIAN"},"agent_actions":{"view_html":"https://pith.science/pith/26PKXIANXSARVE74WFMCBLNHTK","download_json":"https://pith.science/pith/26PKXIANXSARVE74WFMCBLNHTK.json","view_paper":"https://pith.science/paper/26PKXIAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01997&json=true","fetch_graph":"https://pith.science/api/pith-number/26PKXIANXSARVE74WFMCBLNHTK/graph.json","fetch_events":"https://pith.science/api/pith-number/26PKXIANXSARVE74WFMCBLNHTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26PKXIANXSARVE74WFMCBLNHTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26PKXIANXSARVE74WFMCBLNHTK/action/storage_attestation","attest_author":"https://pith.science/pith/26PKXIANXSARVE74WFMCBLNHTK/action/author_attestation","sign_citation":"https://pith.science/pith/26PKXIANXSARVE74WFMCBLNHTK/action/citation_signature","submit_replication":"https://pith.science/pith/26PKXIANXSARVE74WFMCBLNHTK/action/replication_record"}},"created_at":"2026-05-18T00:31:24.017604+00:00","updated_at":"2026-05-18T00:31:24.017604+00:00"}