{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QQCQDI3SHXVJMHM2M46626UEQY","short_pith_number":"pith:QQCQDI3S","schema_version":"1.0","canonical_sha256":"840501a3723dea961d9a673ded7a84862e9908120d7031c393f211fb00ebb647","source":{"kind":"arxiv","id":"1205.2876","version":1},"attestation_state":"computed","paper":{"title":"Universal Bounds on the Scaling Behavior of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Goli, Rudiger Urbanke, S. Hamed Hassani","submitted_at":"2012-05-13T15:20:24Z","abstract_excerpt":"We consider the problem of determining the trade-off between the rate and the block-length of polar codes for a given block error probability when we use the successive cancellation decoder. We take the sum of the Bhattacharyya parameters as a proxy for the block error probability, and show that there exists a universal parameter $\\mu$ such that for any binary memoryless symmetric channel $W$ with capacity $I(W)$, reliable communication requires rates that satisfy $R< I(W)-\\alpha N^{-\\frac{1}{\\mu}}$, where $\\alpha$ is a positive constant and $N$ is the block-length. We provide lower bounds on "},"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":"1205.2876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-13T15:20:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06a5608b7721509d1c3036685f12dd98c9dfe03b7d295f20288d7e3cc0bab40a","abstract_canon_sha256":"c3d4f0cc6494fba178fa3a3ea146259e865567f939ed43d52426128939d763ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:45.774942Z","signature_b64":"zXpdBD+ITLKJGAIwtLjE8zdOmhkHQ2tFe0m0TLxoZWGIcogwsmPOlyg/q+zsz6qtIEIvhO6o7Oe56L0LDh7SAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"840501a3723dea961d9a673ded7a84862e9908120d7031c393f211fb00ebb647","last_reissued_at":"2026-05-18T03:55:45.774166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:45.774166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Bounds on the Scaling Behavior of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Goli, Rudiger Urbanke, S. Hamed Hassani","submitted_at":"2012-05-13T15:20:24Z","abstract_excerpt":"We consider the problem of determining the trade-off between the rate and the block-length of polar codes for a given block error probability when we use the successive cancellation decoder. We take the sum of the Bhattacharyya parameters as a proxy for the block error probability, and show that there exists a universal parameter $\\mu$ such that for any binary memoryless symmetric channel $W$ with capacity $I(W)$, reliable communication requires rates that satisfy $R< I(W)-\\alpha N^{-\\frac{1}{\\mu}}$, where $\\alpha$ is a positive constant and $N$ is the block-length. We provide lower bounds on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2876","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":"1205.2876","created_at":"2026-05-18T03:55:45.774257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.2876v1","created_at":"2026-05-18T03:55:45.774257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2876","created_at":"2026-05-18T03:55:45.774257+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQCQDI3SHXVJ","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQCQDI3SHXVJMHM2","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQCQDI3S","created_at":"2026-05-18T12:27:18.751474+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/QQCQDI3SHXVJMHM2M46626UEQY","json":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY.json","graph_json":"https://pith.science/api/pith-number/QQCQDI3SHXVJMHM2M46626UEQY/graph.json","events_json":"https://pith.science/api/pith-number/QQCQDI3SHXVJMHM2M46626UEQY/events.json","paper":"https://pith.science/paper/QQCQDI3S"},"agent_actions":{"view_html":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY","download_json":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY.json","view_paper":"https://pith.science/paper/QQCQDI3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.2876&json=true","fetch_graph":"https://pith.science/api/pith-number/QQCQDI3SHXVJMHM2M46626UEQY/graph.json","fetch_events":"https://pith.science/api/pith-number/QQCQDI3SHXVJMHM2M46626UEQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY/action/storage_attestation","attest_author":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY/action/author_attestation","sign_citation":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY/action/citation_signature","submit_replication":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY/action/replication_record"}},"created_at":"2026-05-18T03:55:45.774257+00:00","updated_at":"2026-05-18T03:55:45.774257+00:00"}