{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QQCQDI3SHXVJMHM2M46626UEQY","short_pith_number":"pith:QQCQDI3S","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"},"canonical_sha256":"840501a3723dea961d9a673ded7a84862e9908120d7031c393f211fb00ebb647","source":{"kind":"arxiv","id":"1205.2876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2876","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2876v1","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2876","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"QQCQDI3SHXVJ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QQCQDI3SHXVJMHM2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QQCQDI3S","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QQCQDI3SHXVJMHM2M46626UEQY","target":"record","payload":{"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"},"canonical_sha256":"840501a3723dea961d9a673ded7a84862e9908120d7031c393f211fb00ebb647","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"},"source_kind":"arxiv","source_id":"1205.2876","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:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jsGAHqjRH3zzP6tT62QYUjTxQew7fVMJjdGBULSF/8TrC/s4dhBQbbIU2Fsq0BJx+iONQ2yWoBZnKdClNJTVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:35:15.911344Z"},"content_sha256":"41941537852f4056bbf85f2339476eb744059e63ec879e20403c599b04c22d43","schema_version":"1.0","event_id":"sha256:41941537852f4056bbf85f2339476eb744059e63ec879e20403c599b04c22d43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QQCQDI3SHXVJMHM2M46626UEQY","target":"graph","payload":{"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"},"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:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uu0JoyH0tpZ0ivLEVeshuA96WBKU6i+cWqV9yBNwAYeFi4YNjahI7frqZXPCtA7GQ/kPFJ7Bd54THkUX4q+DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:35:15.911699Z"},"content_sha256":"0917f42cefc5bfc794ab3d578f5728693851bba2cdf4922038001ac9be8d8809","schema_version":"1.0","event_id":"sha256:0917f42cefc5bfc794ab3d578f5728693851bba2cdf4922038001ac9be8d8809"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY/bundle.json","state_url":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQCQDI3SHXVJMHM2M46626UEQY/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-05-22T02:35:15Z","links":{"resolver":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY","bundle":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY/bundle.json","state":"https://pith.science/pith/QQCQDI3SHXVJMHM2M46626UEQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQCQDI3SHXVJMHM2M46626UEQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QQCQDI3SHXVJMHM2M46626UEQY","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":"c3d4f0cc6494fba178fa3a3ea146259e865567f939ed43d52426128939d763ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-13T15:20:24Z","title_canon_sha256":"06a5608b7721509d1c3036685f12dd98c9dfe03b7d295f20288d7e3cc0bab40a"},"schema_version":"1.0","source":{"id":"1205.2876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2876","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2876v1","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2876","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"QQCQDI3SHXVJ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QQCQDI3SHXVJMHM2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QQCQDI3S","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:0917f42cefc5bfc794ab3d578f5728693851bba2cdf4922038001ac9be8d8809","target":"graph","created_at":"2026-05-18T03:55:45Z","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":"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 ","authors_text":"Ali Goli, Rudiger Urbanke, S. Hamed Hassani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-13T15:20:24Z","title":"Universal Bounds on the Scaling Behavior of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2876","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:41941537852f4056bbf85f2339476eb744059e63ec879e20403c599b04c22d43","target":"record","created_at":"2026-05-18T03:55:45Z","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":"c3d4f0cc6494fba178fa3a3ea146259e865567f939ed43d52426128939d763ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-13T15:20:24Z","title_canon_sha256":"06a5608b7721509d1c3036685f12dd98c9dfe03b7d295f20288d7e3cc0bab40a"},"schema_version":"1.0","source":{"id":"1205.2876","kind":"arxiv","version":1}},"canonical_sha256":"840501a3723dea961d9a673ded7a84862e9908120d7031c393f211fb00ebb647","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"840501a3723dea961d9a673ded7a84862e9908120d7031c393f211fb00ebb647","first_computed_at":"2026-05-18T03:55:45.774166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:45.774166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zXpdBD+ITLKJGAIwtLjE8zdOmhkHQ2tFe0m0TLxoZWGIcogwsmPOlyg/q+zsz6qtIEIvhO6o7Oe56L0LDh7SAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:45.774942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41941537852f4056bbf85f2339476eb744059e63ec879e20403c599b04c22d43","sha256:0917f42cefc5bfc794ab3d578f5728693851bba2cdf4922038001ac9be8d8809"],"state_sha256":"83e9a6cd2a4bc2be4457dae4df3de2b2e8baef37e1ef1829ab8054f193eeec87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vPig4c064NpOMwquauLgnApuVAAhMiUAFFrejT9dgJgnUH57i7RuXHOuEry/mQmXNbT+3d0gX1Emqusc5e3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T02:35:15.913958Z","bundle_sha256":"78b5c2d750db1d194441be6e89cee0b92679a8e597240e4028c781f48dc0f65b"}}