{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NAHXIEISUPVWOCCA2TEGWTEDF5","short_pith_number":"pith:NAHXIEIS","schema_version":"1.0","canonical_sha256":"680f741112a3eb670840d4c86b4c832f6255580aaab0fde23d64e24822c20619","source":{"kind":"arxiv","id":"1405.0776","version":1},"attestation_state":"computed","paper":{"title":"Polynomial complexity of polar codes for non-binary alphabets, key agreement and Slepian-Wolf coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Abbe, Jingbo Liu","submitted_at":"2014-05-05T04:00:31Z","abstract_excerpt":"We consider polar codes for memoryless sources with side information and show that the blocklength, construction, encoding and decoding complexities are bounded by a polynomial of the reciprocal of the gap between the compression rate and the conditional entropy. This extends the recent results of Guruswami and Xia to a slightly more general setting, which in turn can be applied to (1) sources with non-binary alphabets, (2) key generation for discrete and Gaussian sources, and (3) Slepian-Wolf coding and multiple accessing. In each of these cases, the complexity scaling with respect to the num"},"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":"1405.0776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-05T04:00:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e52152526fccd6b2f0eae06fbaf3275efdcdb5f00de71947e35221acb5fed97","abstract_canon_sha256":"284ec9a415ef7226f3011db2e6044e5c626681689cc69e98e2930d050565810f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:47.671531Z","signature_b64":"1UXddrttGG/Zg6C6zNy4sU3LjMb+RaBsyzGPTq/iWr8G4hE41T5eaAaTQyPCxKjywJZbmxRCkYRTKMqJVextDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"680f741112a3eb670840d4c86b4c832f6255580aaab0fde23d64e24822c20619","last_reissued_at":"2026-05-18T01:25:47.670870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:47.670870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial complexity of polar codes for non-binary alphabets, key agreement and Slepian-Wolf coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Abbe, Jingbo Liu","submitted_at":"2014-05-05T04:00:31Z","abstract_excerpt":"We consider polar codes for memoryless sources with side information and show that the blocklength, construction, encoding and decoding complexities are bounded by a polynomial of the reciprocal of the gap between the compression rate and the conditional entropy. This extends the recent results of Guruswami and Xia to a slightly more general setting, which in turn can be applied to (1) sources with non-binary alphabets, (2) key generation for discrete and Gaussian sources, and (3) Slepian-Wolf coding and multiple accessing. In each of these cases, the complexity scaling with respect to the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0776","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":"1405.0776","created_at":"2026-05-18T01:25:47.670971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0776v1","created_at":"2026-05-18T01:25:47.670971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0776","created_at":"2026-05-18T01:25:47.670971+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAHXIEISUPVW","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAHXIEISUPVWOCCA","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAHXIEIS","created_at":"2026-05-18T12:28:41.024544+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/NAHXIEISUPVWOCCA2TEGWTEDF5","json":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5.json","graph_json":"https://pith.science/api/pith-number/NAHXIEISUPVWOCCA2TEGWTEDF5/graph.json","events_json":"https://pith.science/api/pith-number/NAHXIEISUPVWOCCA2TEGWTEDF5/events.json","paper":"https://pith.science/paper/NAHXIEIS"},"agent_actions":{"view_html":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5","download_json":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5.json","view_paper":"https://pith.science/paper/NAHXIEIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0776&json=true","fetch_graph":"https://pith.science/api/pith-number/NAHXIEISUPVWOCCA2TEGWTEDF5/graph.json","fetch_events":"https://pith.science/api/pith-number/NAHXIEISUPVWOCCA2TEGWTEDF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/action/storage_attestation","attest_author":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/action/author_attestation","sign_citation":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/action/citation_signature","submit_replication":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/action/replication_record"}},"created_at":"2026-05-18T01:25:47.670971+00:00","updated_at":"2026-05-18T01:25:47.670971+00:00"}