{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PY3QVJ6SLJPKULR5DPSAGPF6UU","short_pith_number":"pith:PY3QVJ6S","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"},"canonical_sha256":"7e370aa7d25a5eaa2e3d1be4033cbea52915a7f8556c3777056579cc36c5cca4","source":{"kind":"arxiv","id":"1312.5990","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5990","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5990v3","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5990","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"pith_short_12","alias_value":"PY3QVJ6SLJPK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PY3QVJ6SLJPKULR5","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PY3QVJ6S","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PY3QVJ6SLJPKULR5DPSAGPF6UU","target":"record","payload":{"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"},"canonical_sha256":"7e370aa7d25a5eaa2e3d1be4033cbea52915a7f8556c3777056579cc36c5cca4","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"},"source_kind":"arxiv","source_id":"1312.5990","source_version":3,"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:22:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F2BZMsnGXgvh6OicFGRgQJVXwJmXuWpbhMicpdlfTUMCCqGZcjMBI1Yo56jA2Ctj6NRAPdANgDpFXeMxLaBYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:37:13.745064Z"},"content_sha256":"8618738e25364df807540d7f38230b4e2dcd84be5a87fe54374100c360dd40b0","schema_version":"1.0","event_id":"sha256:8618738e25364df807540d7f38230b4e2dcd84be5a87fe54374100c360dd40b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PY3QVJ6SLJPKULR5DPSAGPF6UU","target":"graph","payload":{"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"},"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:22:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/nNSq1/OBMf4SkB23OmUduoqKMnraY94eDBxlrKl6ORtqokBaizDdJrTZgFm/0aCy/SIq28gwsEAvLjKnnZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:37:13.745755Z"},"content_sha256":"6f9adccaeb0a26051717d57af9196a5fa1e7312b0e3670c530acdab8c624d37d","schema_version":"1.0","event_id":"sha256:6f9adccaeb0a26051717d57af9196a5fa1e7312b0e3670c530acdab8c624d37d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/bundle.json","state_url":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/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-05-28T13:37:13Z","links":{"resolver":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU","bundle":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/bundle.json","state":"https://pith.science/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PY3QVJ6SLJPKULR5DPSAGPF6UU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PY3QVJ6SLJPKULR5DPSAGPF6UU","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":"d34e9de4ac4d3c0052a828958583d578621e6f6e2317b163da0d1ee1d5c8e005","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T15:31:30Z","title_canon_sha256":"69641ab5d80062c475cac8a6f3b523eb3aabe0f569b9b656db9b5fbff59edfb6"},"schema_version":"1.0","source":{"id":"1312.5990","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5990","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5990v3","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5990","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"pith_short_12","alias_value":"PY3QVJ6SLJPK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PY3QVJ6SLJPKULR5","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PY3QVJ6S","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:6f9adccaeb0a26051717d57af9196a5fa1e7312b0e3670c530acdab8c624d37d","target":"graph","created_at":"2026-05-18T01:22:15Z","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 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","authors_text":"David Sutter, Joseph M. Renes","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T15:31:30Z","title":"Universal Polar Codes for More Capable and Less Noisy Channels and Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5990","kind":"arxiv","version":3},"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:8618738e25364df807540d7f38230b4e2dcd84be5a87fe54374100c360dd40b0","target":"record","created_at":"2026-05-18T01:22:15Z","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":"d34e9de4ac4d3c0052a828958583d578621e6f6e2317b163da0d1ee1d5c8e005","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T15:31:30Z","title_canon_sha256":"69641ab5d80062c475cac8a6f3b523eb3aabe0f569b9b656db9b5fbff59edfb6"},"schema_version":"1.0","source":{"id":"1312.5990","kind":"arxiv","version":3}},"canonical_sha256":"7e370aa7d25a5eaa2e3d1be4033cbea52915a7f8556c3777056579cc36c5cca4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e370aa7d25a5eaa2e3d1be4033cbea52915a7f8556c3777056579cc36c5cca4","first_computed_at":"2026-05-18T01:22:15.073863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:15.073863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"derM2hpulpjmmlIe3sZxkb6tAD+ZYJAerys2+49JHqI3he0W7yxhEaOv2iU/FeRAO01RxSEH803eppEwuLycBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:15.074603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5990","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8618738e25364df807540d7f38230b4e2dcd84be5a87fe54374100c360dd40b0","sha256:6f9adccaeb0a26051717d57af9196a5fa1e7312b0e3670c530acdab8c624d37d"],"state_sha256":"ffe25de4d5bdaa2511e5e902ff976f6b8d87080ecf4ef78dfc2780dd9ed5ab0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkL0ASMHAG41Apx1Lwe8/zPcLm3WBMvY5S/xNrMAxtbjZhswRCWJ3xlFHp34iXsdxBm9G9Vb5DYUaQREFhmDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:37:13.748769Z","bundle_sha256":"d4ad26d3ef94d791341f018f55c9a9f987beb15ee2e4bf8e9b8afca9cc39bb21"}}