{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HFV3BTF4OZJZGUNEEZQBIS65HY","short_pith_number":"pith:HFV3BTF4","schema_version":"1.0","canonical_sha256":"396bb0ccbc76539351a42660144bdd3e2c66adfb9390aee5b9c106dce7291b6f","source":{"kind":"arxiv","id":"1304.4778","version":4},"attestation_state":"computed","paper":{"title":"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":"Kasra Alishahi, Rudiger Urbanke, S. Hamed Hassani","submitted_at":"2013-04-17T11:53:42Z","abstract_excerpt":"Consider a binary-input memoryless output-symmetric channel $W$. Such a channel has a capacity, call it $I(W)$, and for any $R<I(W)$ and strictly positive constant $P_{\\rm e}$ we know that we can construct a coding scheme that allows transmission at rate $R$ with an error probability not exceeding $P_{\\rm e}$. Assume now that we let the rate $R$ tend to $I(W)$ and we ask how we have to \"scale\" the blocklength $N$ in order to keep the error probability fixed to $P_{\\rm e}$. We refer to this as the \"finite-length scaling\" behavior. This question was addressed by Strassen as well as Polyanskiy, P"},"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":"1304.4778","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-17T11:53:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"54276f9cce4826cedcb0993b66d394249252667709f46134ed83230319a80aab","abstract_canon_sha256":"b3a86582e06e2803b8c1b2cebdf20575e39f7076bd4693c4905f13a107554aab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.463748Z","signature_b64":"m4IsRfT2Htif+sp/uVoK/sYsnuPcRnz37WAJ7lrh3J/hfgYaqBjyD2cNPLufITnAK3Yw1lqfWuGH+VnL6bekCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"396bb0ccbc76539351a42660144bdd3e2c66adfb9390aee5b9c106dce7291b6f","last_reissued_at":"2026-05-18T00:58:42.463280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.463280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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":"Kasra Alishahi, Rudiger Urbanke, S. Hamed Hassani","submitted_at":"2013-04-17T11:53:42Z","abstract_excerpt":"Consider a binary-input memoryless output-symmetric channel $W$. Such a channel has a capacity, call it $I(W)$, and for any $R<I(W)$ and strictly positive constant $P_{\\rm e}$ we know that we can construct a coding scheme that allows transmission at rate $R$ with an error probability not exceeding $P_{\\rm e}$. Assume now that we let the rate $R$ tend to $I(W)$ and we ask how we have to \"scale\" the blocklength $N$ in order to keep the error probability fixed to $P_{\\rm e}$. We refer to this as the \"finite-length scaling\" behavior. This question was addressed by Strassen as well as Polyanskiy, P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4778","kind":"arxiv","version":4},"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":"1304.4778","created_at":"2026-05-18T00:58:42.463371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4778v4","created_at":"2026-05-18T00:58:42.463371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4778","created_at":"2026-05-18T00:58:42.463371+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFV3BTF4OZJZ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFV3BTF4OZJZGUNE","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFV3BTF4","created_at":"2026-05-18T12:27:46.883200+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/HFV3BTF4OZJZGUNEEZQBIS65HY","json":"https://pith.science/pith/HFV3BTF4OZJZGUNEEZQBIS65HY.json","graph_json":"https://pith.science/api/pith-number/HFV3BTF4OZJZGUNEEZQBIS65HY/graph.json","events_json":"https://pith.science/api/pith-number/HFV3BTF4OZJZGUNEEZQBIS65HY/events.json","paper":"https://pith.science/paper/HFV3BTF4"},"agent_actions":{"view_html":"https://pith.science/pith/HFV3BTF4OZJZGUNEEZQBIS65HY","download_json":"https://pith.science/pith/HFV3BTF4OZJZGUNEEZQBIS65HY.json","view_paper":"https://pith.science/paper/HFV3BTF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4778&json=true","fetch_graph":"https://pith.science/api/pith-number/HFV3BTF4OZJZGUNEEZQBIS65HY/graph.json","fetch_events":"https://pith.science/api/pith-number/HFV3BTF4OZJZGUNEEZQBIS65HY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFV3BTF4OZJZGUNEEZQBIS65HY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFV3BTF4OZJZGUNEEZQBIS65HY/action/storage_attestation","attest_author":"https://pith.science/pith/HFV3BTF4OZJZGUNEEZQBIS65HY/action/author_attestation","sign_citation":"https://pith.science/pith/HFV3BTF4OZJZGUNEEZQBIS65HY/action/citation_signature","submit_replication":"https://pith.science/pith/HFV3BTF4OZJZGUNEEZQBIS65HY/action/replication_record"}},"created_at":"2026-05-18T00:58:42.463371+00:00","updated_at":"2026-05-18T00:58:42.463371+00:00"}