{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PY3QVJ6SLJPKULR5DPSAGPF6UU","short_pith_number":"pith:PY3QVJ6S","schema_version":"1.0","canonical_sha256":"7e370aa7d25a5eaa2e3d1be4033cbea52915a7f8556c3777056579cc36c5cca4","source":{"kind":"arxiv","id":"1312.5990","version":3},"attestation_state":"computed","paper":{"title":"Universal Polar Codes for More Capable and Less Noisy Channels and Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Sutter, Joseph M. Renes","submitted_at":"2013-12-20T15:31:30Z","abstract_excerpt":"We prove two results on the universality of polar codes for source coding and channel communication. First, we show that for any polar code built for a source $P_{X,Z}$ there exists a slightly modified polar code - having the same rate, the same encoding and decoding complexity and the same error rate - that is universal for every source $P_{X,Y}$ when using successive cancellation decoding, at least when the channel $P_{Y|X}$ is more capable than $P_{Z|X}$ and $P_X$ is such that it maximizes $I(X;Y) - I(X;Z)$ for the given channels $P_{Y|X}$ and $P_{Z|X}$. This result extends to channel codin"},"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":"1312.5990","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T15:31:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"69641ab5d80062c475cac8a6f3b523eb3aabe0f569b9b656db9b5fbff59edfb6","abstract_canon_sha256":"d34e9de4ac4d3c0052a828958583d578621e6f6e2317b163da0d1ee1d5c8e005"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:15.074603Z","signature_b64":"derM2hpulpjmmlIe3sZxkb6tAD+ZYJAerys2+49JHqI3he0W7yxhEaOv2iU/FeRAO01RxSEH803eppEwuLycBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e370aa7d25a5eaa2e3d1be4033cbea52915a7f8556c3777056579cc36c5cca4","last_reissued_at":"2026-05-18T01:22:15.073863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:15.073863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Polar Codes for More Capable and Less Noisy Channels and Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Sutter, Joseph M. Renes","submitted_at":"2013-12-20T15:31:30Z","abstract_excerpt":"We prove two results on the universality of polar codes for source coding and channel communication. First, we show that for any polar code built for a source $P_{X,Z}$ there exists a slightly modified polar code - having the same rate, the same encoding and decoding complexity and the same error rate - that is universal for every source $P_{X,Y}$ when using successive cancellation decoding, at least when the channel $P_{Y|X}$ is more capable than $P_{Z|X}$ and $P_X$ is such that it maximizes $I(X;Y) - I(X;Z)$ for the given channels $P_{Y|X}$ and $P_{Z|X}$. This result extends to channel codin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5990","kind":"arxiv","version":3},"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":"1312.5990","created_at":"2026-05-18T01:22:15.073970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.5990v3","created_at":"2026-05-18T01:22:15.073970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5990","created_at":"2026-05-18T01:22:15.073970+00:00"},{"alias_kind":"pith_short_12","alias_value":"PY3QVJ6SLJPK","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PY3QVJ6SLJPKULR5","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PY3QVJ6S","created_at":"2026-05-18T12:27:57.521954+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/PY3QVJ6SLJPKULR5DPSAGPF6UU","json":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU.json","graph_json":"https://pith.science/api/pith-number/PY3QVJ6SLJPKULR5DPSAGPF6UU/graph.json","events_json":"https://pith.science/api/pith-number/PY3QVJ6SLJPKULR5DPSAGPF6UU/events.json","paper":"https://pith.science/paper/PY3QVJ6S"},"agent_actions":{"view_html":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU","download_json":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU.json","view_paper":"https://pith.science/paper/PY3QVJ6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.5990&json=true","fetch_graph":"https://pith.science/api/pith-number/PY3QVJ6SLJPKULR5DPSAGPF6UU/graph.json","fetch_events":"https://pith.science/api/pith-number/PY3QVJ6SLJPKULR5DPSAGPF6UU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/action/storage_attestation","attest_author":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/action/author_attestation","sign_citation":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/action/citation_signature","submit_replication":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/action/replication_record"}},"created_at":"2026-05-18T01:22:15.073970+00:00","updated_at":"2026-05-18T01:22:15.073970+00:00"}