{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RCLM3MYHYB5LKVI5B2N6ZZZZ65","short_pith_number":"pith:RCLM3MYH","canonical_record":{"source":{"id":"1109.2591","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-12T20:00:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"689d430d9f012f447e252829d3906adc74bf2a34772514d66666aa019982b93b","abstract_canon_sha256":"a93f0136feb1ea6b28f98bcd72e5486b23661707d4b014d9abde38aeb43878e9"},"schema_version":"1.0"},"canonical_sha256":"8896cdb307c07ab5551d0e9bece739f74b19cb408642af6994c113a1c085db0f","source":{"kind":"arxiv","id":"1109.2591","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2591","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2591v3","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2591","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"RCLM3MYHYB5L","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RCLM3MYHYB5LKVI5","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RCLM3MYH","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RCLM3MYHYB5LKVI5B2N6ZZZZ65","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2591","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-12T20:00:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"689d430d9f012f447e252829d3906adc74bf2a34772514d66666aa019982b93b","abstract_canon_sha256":"a93f0136feb1ea6b28f98bcd72e5486b23661707d4b014d9abde38aeb43878e9"},"schema_version":"1.0"},"canonical_sha256":"8896cdb307c07ab5551d0e9bece739f74b19cb408642af6994c113a1c085db0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:06.566799Z","signature_b64":"xE4ZBnnajuOAkPx/IV3QlBVJs7AQf5N/22oCXObL8ybq/6aPjEhMYU2a/ocdMEat4fmPTPKW7nHVpMlXrzzLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8896cdb307c07ab5551d0e9bece739f74b19cb408642af6994c113a1c085db0f","last_reissued_at":"2026-05-18T03:36:06.566208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:06.566208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2591","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-18T03:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zcGenh1KmpWVEMsjkVXGyHs51JdYPazlzlNhVDwxwTILphUDF+Y8uPLiK9PP7O8sya2rK8tgukOxxhA/rBs2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T15:58:13.017507Z"},"content_sha256":"fc4fa30ebad1fc6db1757152426f4001b5db0e3d363842db20789e60f11d4ea9","schema_version":"1.0","event_id":"sha256:fc4fa30ebad1fc6db1757152426f4001b5db0e3d363842db20789e60f11d4ea9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RCLM3MYHYB5LKVI5B2N6ZZZZ65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polar codes for classical-quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Mark M. Wilde, Saikat Guha","submitted_at":"2011-09-12T20:00:02Z","abstract_excerpt":"Holevo, Schumacher, and Westmoreland's coding theorem guarantees the existence of codes that are capacity-achieving for the task of sending classical data over a channel with classical inputs and quantum outputs. Although they demonstrated the existence of such codes, their proof does not provide an explicit construction of codes for this task. The aim of the present paper is to fill this gap by constructing near-explicit \"polar\" codes that are capacity-achieving. The codes exploit the channel polarization phenomenon observed by Arikan for the case of classical channels. Channel polarization i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2591","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-18T03:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wj04m3xXD7h9Ira6oHB83bnJvf9uJ7qX9MMJS5l43EFsqdIyXMkBb8gJMHySVSuyxtfpwuiIGropZJbm++4FDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T15:58:13.018313Z"},"content_sha256":"20cae5c7c601b8be531580cfa867cfaf6df3d0f9af0752751b416d138380137b","schema_version":"1.0","event_id":"sha256:20cae5c7c601b8be531580cfa867cfaf6df3d0f9af0752751b416d138380137b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCLM3MYHYB5LKVI5B2N6ZZZZ65/bundle.json","state_url":"https://pith.science/pith/RCLM3MYHYB5LKVI5B2N6ZZZZ65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCLM3MYHYB5LKVI5B2N6ZZZZ65/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-08-10T15:58:13Z","links":{"resolver":"https://pith.science/pith/RCLM3MYHYB5LKVI5B2N6ZZZZ65","bundle":"https://pith.science/pith/RCLM3MYHYB5LKVI5B2N6ZZZZ65/bundle.json","state":"https://pith.science/pith/RCLM3MYHYB5LKVI5B2N6ZZZZ65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCLM3MYHYB5LKVI5B2N6ZZZZ65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RCLM3MYHYB5LKVI5B2N6ZZZZ65","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":"a93f0136feb1ea6b28f98bcd72e5486b23661707d4b014d9abde38aeb43878e9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-12T20:00:02Z","title_canon_sha256":"689d430d9f012f447e252829d3906adc74bf2a34772514d66666aa019982b93b"},"schema_version":"1.0","source":{"id":"1109.2591","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2591","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2591v3","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2591","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"RCLM3MYHYB5L","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RCLM3MYHYB5LKVI5","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RCLM3MYH","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:20cae5c7c601b8be531580cfa867cfaf6df3d0f9af0752751b416d138380137b","target":"graph","created_at":"2026-05-18T03:36:06Z","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":"Holevo, Schumacher, and Westmoreland's coding theorem guarantees the existence of codes that are capacity-achieving for the task of sending classical data over a channel with classical inputs and quantum outputs. Although they demonstrated the existence of such codes, their proof does not provide an explicit construction of codes for this task. The aim of the present paper is to fill this gap by constructing near-explicit \"polar\" codes that are capacity-achieving. The codes exploit the channel polarization phenomenon observed by Arikan for the case of classical channels. Channel polarization i","authors_text":"Mark M. Wilde, Saikat Guha","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-12T20:00:02Z","title":"Polar codes for classical-quantum channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2591","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:fc4fa30ebad1fc6db1757152426f4001b5db0e3d363842db20789e60f11d4ea9","target":"record","created_at":"2026-05-18T03:36:06Z","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":"a93f0136feb1ea6b28f98bcd72e5486b23661707d4b014d9abde38aeb43878e9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-12T20:00:02Z","title_canon_sha256":"689d430d9f012f447e252829d3906adc74bf2a34772514d66666aa019982b93b"},"schema_version":"1.0","source":{"id":"1109.2591","kind":"arxiv","version":3}},"canonical_sha256":"8896cdb307c07ab5551d0e9bece739f74b19cb408642af6994c113a1c085db0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8896cdb307c07ab5551d0e9bece739f74b19cb408642af6994c113a1c085db0f","first_computed_at":"2026-05-18T03:36:06.566208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:06.566208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xE4ZBnnajuOAkPx/IV3QlBVJs7AQf5N/22oCXObL8ybq/6aPjEhMYU2a/ocdMEat4fmPTPKW7nHVpMlXrzzLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:06.566799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2591","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc4fa30ebad1fc6db1757152426f4001b5db0e3d363842db20789e60f11d4ea9","sha256:20cae5c7c601b8be531580cfa867cfaf6df3d0f9af0752751b416d138380137b"],"state_sha256":"259a76137c0300a5a1eadc6056efdc2bff3fefa394af7fc84c425ce4ffd67613"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"of0aqJKAO/GdAmm4M9/4M0zNTtYpBIcwj1cYLH1kiUlSwK3bRUyHciGaCAmxsr3WqxKIk5YyWYoIB4trHUX+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T15:58:13.023326Z","bundle_sha256":"b4388374e69e0fe264411aaf30519d93efe928c5f44f21bf4342ebd2cbd7ee9f"}}