{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NAHXIEISUPVWOCCA2TEGWTEDF5","short_pith_number":"pith:NAHXIEIS","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"},"canonical_sha256":"680f741112a3eb670840d4c86b4c832f6255580aaab0fde23d64e24822c20619","source":{"kind":"arxiv","id":"1405.0776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0776","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0776v1","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0776","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"NAHXIEISUPVW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NAHXIEISUPVWOCCA","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NAHXIEIS","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NAHXIEISUPVWOCCA2TEGWTEDF5","target":"record","payload":{"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"},"canonical_sha256":"680f741112a3eb670840d4c86b4c832f6255580aaab0fde23d64e24822c20619","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"},"source_kind":"arxiv","source_id":"1405.0776","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-18T01:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjwFmdGuYPlUgWEBcofDmkJ0n9OYKHCUTE3iJm6gtAw6mqi1b5O8PvBaj7axsRpniOrd1l4iPawJBXcx6uOvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:29:36.394196Z"},"content_sha256":"bdb62448e90a5aea860edcc59d73dd2fbd8988dcb0c36ef38401151d6980fd12","schema_version":"1.0","event_id":"sha256:bdb62448e90a5aea860edcc59d73dd2fbd8988dcb0c36ef38401151d6980fd12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NAHXIEISUPVWOCCA2TEGWTEDF5","target":"graph","payload":{"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"},"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-18T01:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBvDduy2CekMN27ZbHVeSIIDhLz8pc9hjlYLaLozGBoH0islCUUtiwmenoiLwPvWW+fXgtUAXkla8LQ4hdAtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:29:36.394845Z"},"content_sha256":"c6d3fe6cfa393a7d602c100db62dcf03a8b60784b8a593e3675d6a1faa060eff","schema_version":"1.0","event_id":"sha256:c6d3fe6cfa393a7d602c100db62dcf03a8b60784b8a593e3675d6a1faa060eff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/bundle.json","state_url":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/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-08T20:29:36Z","links":{"resolver":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5","bundle":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/bundle.json","state":"https://pith.science/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NAHXIEISUPVWOCCA2TEGWTEDF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NAHXIEISUPVWOCCA2TEGWTEDF5","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":"284ec9a415ef7226f3011db2e6044e5c626681689cc69e98e2930d050565810f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-05T04:00:31Z","title_canon_sha256":"0e52152526fccd6b2f0eae06fbaf3275efdcdb5f00de71947e35221acb5fed97"},"schema_version":"1.0","source":{"id":"1405.0776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0776","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0776v1","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0776","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"NAHXIEISUPVW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NAHXIEISUPVWOCCA","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NAHXIEIS","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:c6d3fe6cfa393a7d602c100db62dcf03a8b60784b8a593e3675d6a1faa060eff","target":"graph","created_at":"2026-05-18T01:25:47Z","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 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","authors_text":"Emmanuel Abbe, Jingbo Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-05T04:00:31Z","title":"Polynomial complexity of polar codes for non-binary alphabets, key agreement and Slepian-Wolf coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0776","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:bdb62448e90a5aea860edcc59d73dd2fbd8988dcb0c36ef38401151d6980fd12","target":"record","created_at":"2026-05-18T01:25:47Z","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":"284ec9a415ef7226f3011db2e6044e5c626681689cc69e98e2930d050565810f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-05T04:00:31Z","title_canon_sha256":"0e52152526fccd6b2f0eae06fbaf3275efdcdb5f00de71947e35221acb5fed97"},"schema_version":"1.0","source":{"id":"1405.0776","kind":"arxiv","version":1}},"canonical_sha256":"680f741112a3eb670840d4c86b4c832f6255580aaab0fde23d64e24822c20619","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"680f741112a3eb670840d4c86b4c832f6255580aaab0fde23d64e24822c20619","first_computed_at":"2026-05-18T01:25:47.670870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:47.670870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1UXddrttGG/Zg6C6zNy4sU3LjMb+RaBsyzGPTq/iWr8G4hE41T5eaAaTQyPCxKjywJZbmxRCkYRTKMqJVextDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:47.671531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdb62448e90a5aea860edcc59d73dd2fbd8988dcb0c36ef38401151d6980fd12","sha256:c6d3fe6cfa393a7d602c100db62dcf03a8b60784b8a593e3675d6a1faa060eff"],"state_sha256":"d108d9250d87c9e7843b1208f60277adacb6e3df19f6402e86c6076274b5c907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONcXdhSXmHC3QkDMTDAkui/i2sxlF2xD+sBM1GZvL6ux2sz8ttokgZUguUK+RP2XHlaS/DC49YpXUCQ+QXKhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:29:36.398388Z","bundle_sha256":"6bc6643b39a119c4a50313a46b2fa017ee982d627a598551f78e3476cdf6e9f4"}}