{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HUTDAHI5OHQ5LLHIR2J5D5ECG2","short_pith_number":"pith:HUTDAHI5","schema_version":"1.0","canonical_sha256":"3d26301d1d71e1d5ace88e93d1f48236a140d23293781c68ba3a77d80033d6d0","source":{"kind":"arxiv","id":"1511.04838","version":1},"attestation_state":"computed","paper":{"title":"On the Origin of Polar Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erdal Ar{\\i}kan","submitted_at":"2015-11-16T06:23:42Z","abstract_excerpt":"Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in boosting the cutoff rate is to take a vector channel (either given or artificially built), split it into multiple correlated subchannels, and employ a separate sequential decoder on each subchannel. Polar coding was originally designed to be a low-complexity recursive channel combining and splitting operation of this type, to be used as the inner code in a concatenated scheme with outer convolutional coding and seque"},"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":"1511.04838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-16T06:23:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5fae52125e927f7da1801047e32eefdd200b326d7eb9f57f9d2e6307a494790e","abstract_canon_sha256":"0691fa8931b00e62e85fc5ba41d61f9071b66e2f8922ca2b17918afa4954f0be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:51.478791Z","signature_b64":"odA4i+kF1BwnfX3WomhxxcrYTSyzIOlelxSc4EzUWPTSWeCVyq8fXFHXCEFwUtZfz22zktLErCIxWzRisUz4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d26301d1d71e1d5ace88e93d1f48236a140d23293781c68ba3a77d80033d6d0","last_reissued_at":"2026-05-18T01:26:51.478144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:51.478144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Origin of Polar Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erdal Ar{\\i}kan","submitted_at":"2015-11-16T06:23:42Z","abstract_excerpt":"Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in boosting the cutoff rate is to take a vector channel (either given or artificially built), split it into multiple correlated subchannels, and employ a separate sequential decoder on each subchannel. Polar coding was originally designed to be a low-complexity recursive channel combining and splitting operation of this type, to be used as the inner code in a concatenated scheme with outer convolutional coding and seque"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04838","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":"1511.04838","created_at":"2026-05-18T01:26:51.478255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04838v1","created_at":"2026-05-18T01:26:51.478255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04838","created_at":"2026-05-18T01:26:51.478255+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUTDAHI5OHQ5","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUTDAHI5OHQ5LLHI","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUTDAHI5","created_at":"2026-05-18T12:29:25.134429+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/HUTDAHI5OHQ5LLHIR2J5D5ECG2","json":"https://pith.science/pith/HUTDAHI5OHQ5LLHIR2J5D5ECG2.json","graph_json":"https://pith.science/api/pith-number/HUTDAHI5OHQ5LLHIR2J5D5ECG2/graph.json","events_json":"https://pith.science/api/pith-number/HUTDAHI5OHQ5LLHIR2J5D5ECG2/events.json","paper":"https://pith.science/paper/HUTDAHI5"},"agent_actions":{"view_html":"https://pith.science/pith/HUTDAHI5OHQ5LLHIR2J5D5ECG2","download_json":"https://pith.science/pith/HUTDAHI5OHQ5LLHIR2J5D5ECG2.json","view_paper":"https://pith.science/paper/HUTDAHI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04838&json=true","fetch_graph":"https://pith.science/api/pith-number/HUTDAHI5OHQ5LLHIR2J5D5ECG2/graph.json","fetch_events":"https://pith.science/api/pith-number/HUTDAHI5OHQ5LLHIR2J5D5ECG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUTDAHI5OHQ5LLHIR2J5D5ECG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUTDAHI5OHQ5LLHIR2J5D5ECG2/action/storage_attestation","attest_author":"https://pith.science/pith/HUTDAHI5OHQ5LLHIR2J5D5ECG2/action/author_attestation","sign_citation":"https://pith.science/pith/HUTDAHI5OHQ5LLHIR2J5D5ECG2/action/citation_signature","submit_replication":"https://pith.science/pith/HUTDAHI5OHQ5LLHIR2J5D5ECG2/action/replication_record"}},"created_at":"2026-05-18T01:26:51.478255+00:00","updated_at":"2026-05-18T01:26:51.478255+00:00"}