{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RRM5UF5S4ODZ456VFMHF4Y6L2X","short_pith_number":"pith:RRM5UF5S","canonical_record":{"source":{"id":"1406.7373","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-28T08:58:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7005ccf88191d92b045b7e536591a0f696ca9bcd36a2caa766423bf85c94705","abstract_canon_sha256":"c63ffe3ce485ab6b7a2be277e351244a7ed6e3d361aa72a727bf8d3764a8c367"},"schema_version":"1.0"},"canonical_sha256":"8c59da17b2e3879e77d52b0e5e63cbd5eca20255128b96cc89bf5e679ce120a4","source":{"kind":"arxiv","id":"1406.7373","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7373","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7373v5","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7373","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"RRM5UF5S4ODZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RRM5UF5S4ODZ456V","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RRM5UF5S","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RRM5UF5S4ODZ456VFMHF4Y6L2X","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7373","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-28T08:58:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7005ccf88191d92b045b7e536591a0f696ca9bcd36a2caa766423bf85c94705","abstract_canon_sha256":"c63ffe3ce485ab6b7a2be277e351244a7ed6e3d361aa72a727bf8d3764a8c367"},"schema_version":"1.0"},"canonical_sha256":"8c59da17b2e3879e77d52b0e5e63cbd5eca20255128b96cc89bf5e679ce120a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:52.302693Z","signature_b64":"xPVVk5CC5ZUYxOVQRMbJ24sQgPXK5G5RdLN0YYHy3sffRmmmtjaC2adT2BaNlZqy93k+2P+nSOCDLt2ENCsKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c59da17b2e3879e77d52b0e5e63cbd5eca20255128b96cc89bf5e679ce120a4","last_reissued_at":"2026-05-18T00:26:52.302139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:52.302139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7373","source_version":5,"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-18T00:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qucH4sxVbCmoFZFtJplc0ib/UTssQjehUk+G1DlcoEuIRRHLJalTN334cNKKf+yJ3r+/EEtCwCAM1Xu8g6pBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:34:03.452269Z"},"content_sha256":"2e91ff18df4175609e1cf8700453f61698f92f2634560d8d77d30580c78e4bc8","schema_version":"1.0","event_id":"sha256:2e91ff18df4175609e1cf8700453f61698f92f2634560d8d77d30580c78e4bc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RRM5UF5S4ODZ456VFMHF4Y6L2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Achieve the Capacity of Asymmetric Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Mondelli, R\\\"udiger Urbanke, S. Hamed Hassani","submitted_at":"2014-06-28T08:58:54Z","abstract_excerpt":"We survey coding techniques that enable reliable transmission at rates that approach the capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view of modern coding theory and discuss how recent advances in coding for symmetric channels help provide more efficient solutions for the asymmetric case. We consider, in more detail, three basic coding paradigms.\n  The first one is Gallager's scheme that consists of concatenating a linear code with a non-linear mapping so that the input distribution can be appropriately shaped. We explicitly show that both polar co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7373","kind":"arxiv","version":5},"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-18T00:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gEMhuWMlVbCR+bPsVhlveOwSlRxraODTOzaQa0SEs4IL3u/GNq+n7hQd1JZz4+h+bqqOMAuHEAD9AI1aCcRGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:34:03.452638Z"},"content_sha256":"c2e3db3d8183c85435d2861eaf176ad4cfb2ff1b2626656b413f28fbbdf3b170","schema_version":"1.0","event_id":"sha256:c2e3db3d8183c85435d2861eaf176ad4cfb2ff1b2626656b413f28fbbdf3b170"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRM5UF5S4ODZ456VFMHF4Y6L2X/bundle.json","state_url":"https://pith.science/pith/RRM5UF5S4ODZ456VFMHF4Y6L2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRM5UF5S4ODZ456VFMHF4Y6L2X/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-03T07:34:03Z","links":{"resolver":"https://pith.science/pith/RRM5UF5S4ODZ456VFMHF4Y6L2X","bundle":"https://pith.science/pith/RRM5UF5S4ODZ456VFMHF4Y6L2X/bundle.json","state":"https://pith.science/pith/RRM5UF5S4ODZ456VFMHF4Y6L2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRM5UF5S4ODZ456VFMHF4Y6L2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RRM5UF5S4ODZ456VFMHF4Y6L2X","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":"c63ffe3ce485ab6b7a2be277e351244a7ed6e3d361aa72a727bf8d3764a8c367","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-28T08:58:54Z","title_canon_sha256":"b7005ccf88191d92b045b7e536591a0f696ca9bcd36a2caa766423bf85c94705"},"schema_version":"1.0","source":{"id":"1406.7373","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7373","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7373v5","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7373","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"RRM5UF5S4ODZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RRM5UF5S4ODZ456V","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RRM5UF5S","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:c2e3db3d8183c85435d2861eaf176ad4cfb2ff1b2626656b413f28fbbdf3b170","target":"graph","created_at":"2026-05-18T00:26:52Z","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 survey coding techniques that enable reliable transmission at rates that approach the capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view of modern coding theory and discuss how recent advances in coding for symmetric channels help provide more efficient solutions for the asymmetric case. We consider, in more detail, three basic coding paradigms.\n  The first one is Gallager's scheme that consists of concatenating a linear code with a non-linear mapping so that the input distribution can be appropriately shaped. We explicitly show that both polar co","authors_text":"Marco Mondelli, R\\\"udiger Urbanke, S. Hamed Hassani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-28T08:58:54Z","title":"How to Achieve the Capacity of Asymmetric Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7373","kind":"arxiv","version":5},"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:2e91ff18df4175609e1cf8700453f61698f92f2634560d8d77d30580c78e4bc8","target":"record","created_at":"2026-05-18T00:26:52Z","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":"c63ffe3ce485ab6b7a2be277e351244a7ed6e3d361aa72a727bf8d3764a8c367","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-28T08:58:54Z","title_canon_sha256":"b7005ccf88191d92b045b7e536591a0f696ca9bcd36a2caa766423bf85c94705"},"schema_version":"1.0","source":{"id":"1406.7373","kind":"arxiv","version":5}},"canonical_sha256":"8c59da17b2e3879e77d52b0e5e63cbd5eca20255128b96cc89bf5e679ce120a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c59da17b2e3879e77d52b0e5e63cbd5eca20255128b96cc89bf5e679ce120a4","first_computed_at":"2026-05-18T00:26:52.302139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:52.302139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xPVVk5CC5ZUYxOVQRMbJ24sQgPXK5G5RdLN0YYHy3sffRmmmtjaC2adT2BaNlZqy93k+2P+nSOCDLt2ENCsKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:52.302693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7373","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e91ff18df4175609e1cf8700453f61698f92f2634560d8d77d30580c78e4bc8","sha256:c2e3db3d8183c85435d2861eaf176ad4cfb2ff1b2626656b413f28fbbdf3b170"],"state_sha256":"de0d5dcd36395bc8eee34272df7e4632f3576a90e45c65ebe1dccc897ac7330e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CaQwU0En5xR7J90vXO+KZGTSwfPvAaMqxm5fS7hoynwTDk8lWAu9chSAKMZtv+ylfoQaYHxM9sMaqCZncbOEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:34:03.454656Z","bundle_sha256":"e3b671cb86a8127acf30e89d20f7cd5c772ab5a62baba8a31751f454fde9cc07"}}