{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Z4HH4NHDFLGZCPDNBDSGXK2VTE","short_pith_number":"pith:Z4HH4NHD","schema_version":"1.0","canonical_sha256":"cf0e7e34e32acd913c6d08e46bab5599181f2ddd924bfdb2c3e24be3e8588c3a","source":{"kind":"arxiv","id":"1412.4261","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.4261","created_at":"2026-05-18T02:31:19.733876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4261v1","created_at":"2026-05-18T02:31:19.733876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4261","created_at":"2026-05-18T02:31:19.733876+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z4HH4NHDFLGZ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z4HH4NHDFLGZCPDN","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z4HH4NHD","created_at":"2026-05-18T12:28:59.999130+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/Z4HH4NHDFLGZCPDNBDSGXK2VTE","json":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE.json","graph_json":"https://pith.science/api/pith-number/Z4HH4NHDFLGZCPDNBDSGXK2VTE/graph.json","events_json":"https://pith.science/api/pith-number/Z4HH4NHDFLGZCPDNBDSGXK2VTE/events.json","paper":"https://pith.science/paper/Z4HH4NHD"},"agent_actions":{"view_html":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE","download_json":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE.json","view_paper":"https://pith.science/paper/Z4HH4NHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4261&json=true","fetch_graph":"https://pith.science/api/pith-number/Z4HH4NHDFLGZCPDNBDSGXK2VTE/graph.json","fetch_events":"https://pith.science/api/pith-number/Z4HH4NHDFLGZCPDNBDSGXK2VTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/action/storage_attestation","attest_author":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/action/author_attestation","sign_citation":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/action/citation_signature","submit_replication":"https://pith.science/pith/Z4HH4NHDFLGZCPDNBDSGXK2VTE/action/replication_record"}},"created_at":"2026-05-18T02:31:19.733876+00:00","updated_at":"2026-05-18T02:31:19.733876+00:00"}