{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OVEN77JFCIR47RL2RYC5POLMBA","short_pith_number":"pith:OVEN77JF","schema_version":"1.0","canonical_sha256":"7548dffd251223cfc57a8e05d7b96c083466090ef36bb880526a2374d00441f1","source":{"kind":"arxiv","id":"1307.5510","version":1},"attestation_state":"computed","paper":{"title":"Improved Bounds on the Finite Length Scaling of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Burshtein, Dina Goldin","submitted_at":"2013-07-21T09:53:53Z","abstract_excerpt":"Improved bounds on the blocklength required to communicate over binary-input channels using polar codes, below some given error probability, are derived. For that purpose, an improved bound on the number of non-polarizing channels is obtained. The main result is that the blocklength required to communicate reliably scales at most as $O((I(W)-R)^{-5.77})$ where $R$ is the code rate and $I(W)$ the symmetric capacity of the channel, $W$. The results are then extended to polar lossy source coding at rate $R$ of a source with symmetric distortion-rate function $D(\\cdot)$. The blocklength required s"},"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":"1307.5510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-21T09:53:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"178083947e121e58c5cf56df12cc619f50e0f3ffc065854502a051ab27896278","abstract_canon_sha256":"0ff26db5d3175ebd5ad50958d0ee444dba08e1fc84f1aecc920cd513797bbb49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:55.470895Z","signature_b64":"xw40UfCCbVBZVxDTL73JB/3KPLuL770T73KgRnxQ2+U3NugkXK5KSg/6gkqSdxDx3ox9ZdbElv8+66bzqJHeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7548dffd251223cfc57a8e05d7b96c083466090ef36bb880526a2374d00441f1","last_reissued_at":"2026-05-18T03:17:55.470055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:55.470055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Bounds on the Finite Length Scaling of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Burshtein, Dina Goldin","submitted_at":"2013-07-21T09:53:53Z","abstract_excerpt":"Improved bounds on the blocklength required to communicate over binary-input channels using polar codes, below some given error probability, are derived. For that purpose, an improved bound on the number of non-polarizing channels is obtained. The main result is that the blocklength required to communicate reliably scales at most as $O((I(W)-R)^{-5.77})$ where $R$ is the code rate and $I(W)$ the symmetric capacity of the channel, $W$. The results are then extended to polar lossy source coding at rate $R$ of a source with symmetric distortion-rate function $D(\\cdot)$. The blocklength required s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5510","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":"1307.5510","created_at":"2026-05-18T03:17:55.470195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5510v1","created_at":"2026-05-18T03:17:55.470195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5510","created_at":"2026-05-18T03:17:55.470195+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVEN77JFCIR4","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVEN77JFCIR47RL2","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVEN77JF","created_at":"2026-05-18T12:27:54.935989+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/OVEN77JFCIR47RL2RYC5POLMBA","json":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA.json","graph_json":"https://pith.science/api/pith-number/OVEN77JFCIR47RL2RYC5POLMBA/graph.json","events_json":"https://pith.science/api/pith-number/OVEN77JFCIR47RL2RYC5POLMBA/events.json","paper":"https://pith.science/paper/OVEN77JF"},"agent_actions":{"view_html":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA","download_json":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA.json","view_paper":"https://pith.science/paper/OVEN77JF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5510&json=true","fetch_graph":"https://pith.science/api/pith-number/OVEN77JFCIR47RL2RYC5POLMBA/graph.json","fetch_events":"https://pith.science/api/pith-number/OVEN77JFCIR47RL2RYC5POLMBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA/action/storage_attestation","attest_author":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA/action/author_attestation","sign_citation":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA/action/citation_signature","submit_replication":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA/action/replication_record"}},"created_at":"2026-05-18T03:17:55.470195+00:00","updated_at":"2026-05-18T03:17:55.470195+00:00"}