{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GTI655G5RPO6IW2YSM4BDBV33Y","short_pith_number":"pith:GTI655G5","canonical_record":{"source":{"id":"1109.3195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-14T20:01:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"53bbc9523ba41a6797bc2f3e362524b098e524a6bb2d354bc85ad2cd9e9ae779","abstract_canon_sha256":"bbfc68a58bb803c62d98b7439a211a56bdd78533dae53648ce5ce9d5e2278135"},"schema_version":"1.0"},"canonical_sha256":"34d1eef4dd8bdde45b5893381186bbde162999d49647af9943bf1897cf237496","source":{"kind":"arxiv","id":"1109.3195","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3195","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3195v2","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3195","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"GTI655G5RPO6","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GTI655G5RPO6IW2Y","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GTI655G5","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GTI655G5RPO6IW2YSM4BDBV33Y","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-14T20:01:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"53bbc9523ba41a6797bc2f3e362524b098e524a6bb2d354bc85ad2cd9e9ae779","abstract_canon_sha256":"bbfc68a58bb803c62d98b7439a211a56bdd78533dae53648ce5ce9d5e2278135"},"schema_version":"1.0"},"canonical_sha256":"34d1eef4dd8bdde45b5893381186bbde162999d49647af9943bf1897cf237496","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:45.130904Z","signature_b64":"AsFctXEMV/ocNFUkfJFnrJtGy7aBREtRa+SOUQR02bcoXOvLsAeKe/YpLm66y021IIJpoWum5scrR1LifVllDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34d1eef4dd8bdde45b5893381186bbde162999d49647af9943bf1897cf237496","last_reissued_at":"2026-05-18T03:48:45.130388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:45.130388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3195","source_version":2,"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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPXc9996nMCuuqBv8JpmqbxXmnQbGY4ZFwDNlU+7n5bURlj4aVD5Cf2Ch3aUg7SRodnw8mjdLfl2Oqb6cq3TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:45:43.789033Z"},"content_sha256":"419ec63ee1d86acd250cf529977f62d5bca5d99743f4def8d67ffd9f06f0cc6e","schema_version":"1.0","event_id":"sha256:419ec63ee1d86acd250cf529977f62d5bca5d99743f4def8d67ffd9f06f0cc6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GTI655G5RPO6IW2YSM4BDBV33Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Quantum Polar Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Frederic Dupuis, Joseph M. Renes, Renato Renner","submitted_at":"2011-09-14T20:01:02Z","abstract_excerpt":"Polar coding, introduced 2008 by Arikan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here we study the use of polar codes for the transmission of quantum information. Focusing on the case of qubit Pauli channels and qubit erasure channels, we use classical polar codes to construct a coding scheme which, using some pre-shared entanglement, asymptotically achieves a net transmission rate equal to the coherent in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3195","kind":"arxiv","version":2},"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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cFk9p7uFHwmVSnD7TVWQCs06QHfnd9Zkze8xyIqnwTD5Qb917jLwIJajt/HDqYJgyLEkz3d6YceZroL6rRcCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:45:43.789757Z"},"content_sha256":"e638b64e0a7b757aad66684e5ed723a77c6bc011733e61f031a9482be8b1c642","schema_version":"1.0","event_id":"sha256:e638b64e0a7b757aad66684e5ed723a77c6bc011733e61f031a9482be8b1c642"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTI655G5RPO6IW2YSM4BDBV33Y/bundle.json","state_url":"https://pith.science/pith/GTI655G5RPO6IW2YSM4BDBV33Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTI655G5RPO6IW2YSM4BDBV33Y/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-26T04:45:43Z","links":{"resolver":"https://pith.science/pith/GTI655G5RPO6IW2YSM4BDBV33Y","bundle":"https://pith.science/pith/GTI655G5RPO6IW2YSM4BDBV33Y/bundle.json","state":"https://pith.science/pith/GTI655G5RPO6IW2YSM4BDBV33Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTI655G5RPO6IW2YSM4BDBV33Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GTI655G5RPO6IW2YSM4BDBV33Y","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":"bbfc68a58bb803c62d98b7439a211a56bdd78533dae53648ce5ce9d5e2278135","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-14T20:01:02Z","title_canon_sha256":"53bbc9523ba41a6797bc2f3e362524b098e524a6bb2d354bc85ad2cd9e9ae779"},"schema_version":"1.0","source":{"id":"1109.3195","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3195","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3195v2","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3195","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"GTI655G5RPO6","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GTI655G5RPO6IW2Y","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GTI655G5","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:e638b64e0a7b757aad66684e5ed723a77c6bc011733e61f031a9482be8b1c642","target":"graph","created_at":"2026-05-18T03:48:45Z","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":"Polar coding, introduced 2008 by Arikan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here we study the use of polar codes for the transmission of quantum information. Focusing on the case of qubit Pauli channels and qubit erasure channels, we use classical polar codes to construct a coding scheme which, using some pre-shared entanglement, asymptotically achieves a net transmission rate equal to the coherent in","authors_text":"Frederic Dupuis, Joseph M. Renes, Renato Renner","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-14T20:01:02Z","title":"Efficient Quantum Polar Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3195","kind":"arxiv","version":2},"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:419ec63ee1d86acd250cf529977f62d5bca5d99743f4def8d67ffd9f06f0cc6e","target":"record","created_at":"2026-05-18T03:48:45Z","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":"bbfc68a58bb803c62d98b7439a211a56bdd78533dae53648ce5ce9d5e2278135","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-14T20:01:02Z","title_canon_sha256":"53bbc9523ba41a6797bc2f3e362524b098e524a6bb2d354bc85ad2cd9e9ae779"},"schema_version":"1.0","source":{"id":"1109.3195","kind":"arxiv","version":2}},"canonical_sha256":"34d1eef4dd8bdde45b5893381186bbde162999d49647af9943bf1897cf237496","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34d1eef4dd8bdde45b5893381186bbde162999d49647af9943bf1897cf237496","first_computed_at":"2026-05-18T03:48:45.130388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:45.130388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AsFctXEMV/ocNFUkfJFnrJtGy7aBREtRa+SOUQR02bcoXOvLsAeKe/YpLm66y021IIJpoWum5scrR1LifVllDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:45.130904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3195","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:419ec63ee1d86acd250cf529977f62d5bca5d99743f4def8d67ffd9f06f0cc6e","sha256:e638b64e0a7b757aad66684e5ed723a77c6bc011733e61f031a9482be8b1c642"],"state_sha256":"2ffa914a96be9b8b806612c7a5e945a68fe3f656ab298180f48236c15953333a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AIW1sqLreltBeEmrw6YWkSdcciJzA6vEu7HmcB+P2/gIhQ2jMlnTcT/r6oo5urhjgZGEbPlnIv6786Za5FOBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:45:43.793143Z","bundle_sha256":"77d5fe5f4221e5b2aa062be7c6c18b57bda66a27ab39922ae3dcd01915fb7551"}}