{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OVEN77JFCIR47RL2RYC5POLMBA","short_pith_number":"pith:OVEN77JF","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"},"canonical_sha256":"7548dffd251223cfc57a8e05d7b96c083466090ef36bb880526a2374d00441f1","source":{"kind":"arxiv","id":"1307.5510","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5510","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5510v1","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5510","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"OVEN77JFCIR4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OVEN77JFCIR47RL2","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OVEN77JF","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OVEN77JFCIR47RL2RYC5POLMBA","target":"record","payload":{"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"},"canonical_sha256":"7548dffd251223cfc57a8e05d7b96c083466090ef36bb880526a2374d00441f1","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"},"source_kind":"arxiv","source_id":"1307.5510","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4SYasG72j4vgcbmWVWK6K3rsbi9AWgqqPzabBwHllEUctS2Xc+47flgpt6n/lwflqVIkT35N2ENrvS3D/BHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:32:34.003712Z"},"content_sha256":"2e695e93f4cf68e3ea511bf558d12853f993c144ec2c0d4d50dccd428fffc94b","schema_version":"1.0","event_id":"sha256:2e695e93f4cf68e3ea511bf558d12853f993c144ec2c0d4d50dccd428fffc94b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OVEN77JFCIR47RL2RYC5POLMBA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSetZMq41AkQjoQjK3Y6Mr0UCC2M8aPt0OUe5gLvPLE8tBi2FdSUm/WGvBgX+CjZIKsK4OxiJAJbH1j42Xa2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:32:34.004061Z"},"content_sha256":"db33560c45d2c908cacdbe3f334355eaadc8c91c324b4c7e125c8401a3eb0757","schema_version":"1.0","event_id":"sha256:db33560c45d2c908cacdbe3f334355eaadc8c91c324b4c7e125c8401a3eb0757"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA/bundle.json","state_url":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVEN77JFCIR47RL2RYC5POLMBA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T16:32:34Z","links":{"resolver":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA","bundle":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA/bundle.json","state":"https://pith.science/pith/OVEN77JFCIR47RL2RYC5POLMBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVEN77JFCIR47RL2RYC5POLMBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OVEN77JFCIR47RL2RYC5POLMBA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0ff26db5d3175ebd5ad50958d0ee444dba08e1fc84f1aecc920cd513797bbb49","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-21T09:53:53Z","title_canon_sha256":"178083947e121e58c5cf56df12cc619f50e0f3ffc065854502a051ab27896278"},"schema_version":"1.0","source":{"id":"1307.5510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5510","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5510v1","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5510","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"OVEN77JFCIR4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OVEN77JFCIR47RL2","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OVEN77JF","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:db33560c45d2c908cacdbe3f334355eaadc8c91c324b4c7e125c8401a3eb0757","target":"graph","created_at":"2026-05-18T03:17:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"David Burshtein, Dina Goldin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-21T09:53:53Z","title":"Improved Bounds on the Finite Length Scaling of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5510","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2e695e93f4cf68e3ea511bf558d12853f993c144ec2c0d4d50dccd428fffc94b","target":"record","created_at":"2026-05-18T03:17:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0ff26db5d3175ebd5ad50958d0ee444dba08e1fc84f1aecc920cd513797bbb49","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-21T09:53:53Z","title_canon_sha256":"178083947e121e58c5cf56df12cc619f50e0f3ffc065854502a051ab27896278"},"schema_version":"1.0","source":{"id":"1307.5510","kind":"arxiv","version":1}},"canonical_sha256":"7548dffd251223cfc57a8e05d7b96c083466090ef36bb880526a2374d00441f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7548dffd251223cfc57a8e05d7b96c083466090ef36bb880526a2374d00441f1","first_computed_at":"2026-05-18T03:17:55.470055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:55.470055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xw40UfCCbVBZVxDTL73JB/3KPLuL770T73KgRnxQ2+U3NugkXK5KSg/6gkqSdxDx3ox9ZdbElv8+66bzqJHeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:55.470895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e695e93f4cf68e3ea511bf558d12853f993c144ec2c0d4d50dccd428fffc94b","sha256:db33560c45d2c908cacdbe3f334355eaadc8c91c324b4c7e125c8401a3eb0757"],"state_sha256":"f66d01264fa94bbaf7b01b2720e2da76cde2121696a7e55867083b659e26e631"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaM2HSLUOWQIt2vJYd/nRhAbrIjJ+Je/SbOzIRDtSylON35cqVWcUb1a4Y/1J8BD3cOptCCbc5vvk8uao0zwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T16:32:34.006015Z","bundle_sha256":"e9f79302d61921fe89db70b311f7c8b02c7e34406c629ef206e8bfa1f9605d62"}}