{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z4HH4NHDFLGZCPDNBDSGXK2VTE","short_pith_number":"pith:Z4HH4NHD","canonical_record":{"source":{"id":"1412.4261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-13T17:35:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d9bd0e23c2151ff5e46768529828a42995963b84490a2af44d27b0bf3bd2396f","abstract_canon_sha256":"a7aa33b77102c233da24ac7cb8f96bfd7f2654da5f4a2adc67b93367908607ae"},"schema_version":"1.0"},"canonical_sha256":"cf0e7e34e32acd913c6d08e46bab5599181f2ddd924bfdb2c3e24be3e8588c3a","source":{"kind":"arxiv","id":"1412.4261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4261","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4261v1","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4261","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"Z4HH4NHDFLGZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z4HH4NHDFLGZCPDN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z4HH4NHD","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z4HH4NHDFLGZCPDNBDSGXK2VTE","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-13T17:35:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d9bd0e23c2151ff5e46768529828a42995963b84490a2af44d27b0bf3bd2396f","abstract_canon_sha256":"a7aa33b77102c233da24ac7cb8f96bfd7f2654da5f4a2adc67b93367908607ae"},"schema_version":"1.0"},"canonical_sha256":"cf0e7e34e32acd913c6d08e46bab5599181f2ddd924bfdb2c3e24be3e8588c3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:19.734291Z","signature_b64":"iAHuWnBTFDNGu5B/1QoXL8lUdZKZP4J8t/V/PvP7jc/5O6VCLyP/QSOx7ez/NZ+ry60ap2Rwclc7yTY2lngSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf0e7e34e32acd913c6d08e46bab5599181f2ddd924bfdb2c3e24be3e8588c3a","last_reissued_at":"2026-05-18T02:31:19.733804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:19.733804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4261","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-18T02:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fr9HewtLGLitnncd9jluYd9KOUBKmay6gAiABE4g5+w8WS0UgvCfR2Y+qDpb40J5XhVYuLjdKyfQ8EIXEB6sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:39:30.015954Z"},"content_sha256":"ed1b9780908d9cf5d9905da61e680819d17c24cc7cfb001fc4a76845b4e49ce2","schema_version":"1.0","event_id":"sha256:ed1b9780908d9cf5d9905da61e680819d17c24cc7cfb001fc4a76845b4e49ce2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z4HH4NHDFLGZCPDNBDSGXK2VTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Re-proving Channel Polarization Theorems: An Extremality and Robustness Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mine Alsan","submitted_at":"2014-12-13T17:35:08Z","abstract_excerpt":"The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Ar{\\i}kan proved that this class of codes, called polar codes, achieve the symmetric capacity --- the mutual information evaluated at the uniform input distribution ---of any stationary binary discrete memoryless channel with low complexity encoders and decoders requiring in the order of $O(N\\log N)$ operations in the block-length $N$. This discovery settled the long standing open"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4261","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-18T02:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kUtGeDOaH8t3TgqY3XMDexICg28cH1QSqYI6xVDdBGP/SskbgFdmbx9VUNzmv+f3di/sV96c2FMDRCtT4c4jAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:39:30.016299Z"},"content_sha256":"cde2e28739ecfc5cc1173b48bd08460dd38b5f196af0a8ff16051b1fe7bc4925","schema_version":"1.0","event_id":"sha256:cde2e28739ecfc5cc1173b48bd08460dd38b5f196af0a8ff16051b1fe7bc4925"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/bundle.json","state_url":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/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-06-08T22:39:30Z","links":{"resolver":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE","bundle":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/bundle.json","state":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z4HH4NHDFLGZCPDNBDSGXK2VTE","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":"a7aa33b77102c233da24ac7cb8f96bfd7f2654da5f4a2adc67b93367908607ae","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-13T17:35:08Z","title_canon_sha256":"d9bd0e23c2151ff5e46768529828a42995963b84490a2af44d27b0bf3bd2396f"},"schema_version":"1.0","source":{"id":"1412.4261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4261","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4261v1","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4261","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"Z4HH4NHDFLGZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z4HH4NHDFLGZCPDN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z4HH4NHD","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:cde2e28739ecfc5cc1173b48bd08460dd38b5f196af0a8ff16051b1fe7bc4925","target":"graph","created_at":"2026-05-18T02:31:19Z","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":"The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Ar{\\i}kan proved that this class of codes, called polar codes, achieve the symmetric capacity --- the mutual information evaluated at the uniform input distribution ---of any stationary binary discrete memoryless channel with low complexity encoders and decoders requiring in the order of $O(N\\log N)$ operations in the block-length $N$. This discovery settled the long standing open","authors_text":"Mine Alsan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-13T17:35:08Z","title":"Re-proving Channel Polarization Theorems: An Extremality and Robustness Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4261","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:ed1b9780908d9cf5d9905da61e680819d17c24cc7cfb001fc4a76845b4e49ce2","target":"record","created_at":"2026-05-18T02:31:19Z","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":"a7aa33b77102c233da24ac7cb8f96bfd7f2654da5f4a2adc67b93367908607ae","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-13T17:35:08Z","title_canon_sha256":"d9bd0e23c2151ff5e46768529828a42995963b84490a2af44d27b0bf3bd2396f"},"schema_version":"1.0","source":{"id":"1412.4261","kind":"arxiv","version":1}},"canonical_sha256":"cf0e7e34e32acd913c6d08e46bab5599181f2ddd924bfdb2c3e24be3e8588c3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf0e7e34e32acd913c6d08e46bab5599181f2ddd924bfdb2c3e24be3e8588c3a","first_computed_at":"2026-05-18T02:31:19.733804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:19.733804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iAHuWnBTFDNGu5B/1QoXL8lUdZKZP4J8t/V/PvP7jc/5O6VCLyP/QSOx7ez/NZ+ry60ap2Rwclc7yTY2lngSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:19.734291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed1b9780908d9cf5d9905da61e680819d17c24cc7cfb001fc4a76845b4e49ce2","sha256:cde2e28739ecfc5cc1173b48bd08460dd38b5f196af0a8ff16051b1fe7bc4925"],"state_sha256":"e57c7503703dde2da9e1f38f853e09057b4d9dd83344db83fd6bede704d49bf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iqps7u6ySnMF9FIlcR+KKrGGszTU3eSwaEVw5qaO1KHw3LQB28yrz8mZNXmEkPW3ilqOT4ggYB76p+KzK5c+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:39:30.018204Z","bundle_sha256":"f6571a8436131ea468119194f344d6d592371b6be01a259785294646524116a8"}}