{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GW7RLM4HN3EDMGLP4CCX66W2XG","short_pith_number":"pith:GW7RLM4H","canonical_record":{"source":{"id":"2304.04743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-10T17:56:10Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4e9dc0960eb48b2b33c1437a135ae78ed442ff53f5bb2ba2f917957bab8959ae","abstract_canon_sha256":"f6c8eba6101007dc67fdbfb9a49d8a652f630e2968823092059ed18d2c76a265"},"schema_version":"1.0"},"canonical_sha256":"35bf15b3876ec836196fe0857f7adab992f15b6793946106089335d6a054ede0","source":{"kind":"arxiv","id":"2304.04743","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.04743","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"2304.04743v1","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.04743","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"GW7RLM4HN3ED","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"GW7RLM4HN3EDMGLP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"GW7RLM4H","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GW7RLM4HN3EDMGLP4CCX66W2XG","target":"record","payload":{"canonical_record":{"source":{"id":"2304.04743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-10T17:56:10Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4e9dc0960eb48b2b33c1437a135ae78ed442ff53f5bb2ba2f917957bab8959ae","abstract_canon_sha256":"f6c8eba6101007dc67fdbfb9a49d8a652f630e2968823092059ed18d2c76a265"},"schema_version":"1.0"},"canonical_sha256":"35bf15b3876ec836196fe0857f7adab992f15b6793946106089335d6a054ede0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:39.821006Z","signature_b64":"6X6A7SZAfLzojiPuwicJ7foigtgR9HdLkXGggqlxqXd5UWkU2Q4TxMR3c+bsSS/m0nwh8yE10EBFwnuFaT+MCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35bf15b3876ec836196fe0857f7adab992f15b6793946106089335d6a054ede0","last_reissued_at":"2026-05-18T02:44:39.820308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:39.820308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.04743","source_version":1,"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-18T02:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ylE0GTD0PwHJXM7ilNaOafKmcAhxw4fQ/KWk+EHUAWEpaWKjiAiKFvh4M4at5BZW22DF3AJHHNYPbQECQDAGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:47:50.321849Z"},"content_sha256":"84857a147d316e89c5582f831d6969504b2a51d8a6eb96e9b9818088913e0f01","schema_version":"1.0","event_id":"sha256:84857a147d316e89c5582f831d6969504b2a51d8a6eb96e9b9818088913e0f01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GW7RLM4HN3EDMGLP4CCX66W2XG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Anqi Gong, Joseph M. Renes","submitted_at":"2023-04-10T17:56:10Z","abstract_excerpt":"The successive cancellation list decoder (SCL) is an efficient decoder for classical polar codes with low decoding error, approximating the maximum likelihood decoder (MLD) for small list sizes. Here we adapt the SCL to the task of decoding quantum polar codes and show that it inherits the high performance and low complexity of the classical case, and can approximate the quantum MLD for certain channels. We apply SCL decoding to a novel version of quantum polar codes based on the polarization weight (PW) method, which entirely avoids the need for small amounts of entanglement assistance appare"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.04743","kind":"arxiv","version":1},"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-18T02:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/B6N0KMdsUdDQjrRCAtgmW1dvCjHgb+3jFpxRVYE3PgnJpBcmas273hztV6bFOvccazCssxeUDi5Axa7FaeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:47:50.322552Z"},"content_sha256":"6e50cc9e2d681f4bf261586ee7e70836c6d5c52056db5e413e351f7656efd994","schema_version":"1.0","event_id":"sha256:6e50cc9e2d681f4bf261586ee7e70836c6d5c52056db5e413e351f7656efd994"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GW7RLM4HN3EDMGLP4CCX66W2XG/bundle.json","state_url":"https://pith.science/pith/GW7RLM4HN3EDMGLP4CCX66W2XG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GW7RLM4HN3EDMGLP4CCX66W2XG/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-24T14:47:50Z","links":{"resolver":"https://pith.science/pith/GW7RLM4HN3EDMGLP4CCX66W2XG","bundle":"https://pith.science/pith/GW7RLM4HN3EDMGLP4CCX66W2XG/bundle.json","state":"https://pith.science/pith/GW7RLM4HN3EDMGLP4CCX66W2XG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GW7RLM4HN3EDMGLP4CCX66W2XG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GW7RLM4HN3EDMGLP4CCX66W2XG","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":"f6c8eba6101007dc67fdbfb9a49d8a652f630e2968823092059ed18d2c76a265","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-10T17:56:10Z","title_canon_sha256":"4e9dc0960eb48b2b33c1437a135ae78ed442ff53f5bb2ba2f917957bab8959ae"},"schema_version":"1.0","source":{"id":"2304.04743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.04743","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"2304.04743v1","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.04743","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"GW7RLM4HN3ED","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"GW7RLM4HN3EDMGLP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"GW7RLM4H","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:6e50cc9e2d681f4bf261586ee7e70836c6d5c52056db5e413e351f7656efd994","target":"graph","created_at":"2026-05-18T02:44:39Z","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":"The successive cancellation list decoder (SCL) is an efficient decoder for classical polar codes with low decoding error, approximating the maximum likelihood decoder (MLD) for small list sizes. Here we adapt the SCL to the task of decoding quantum polar codes and show that it inherits the high performance and low complexity of the classical case, and can approximate the quantum MLD for certain channels. We apply SCL decoding to a novel version of quantum polar codes based on the polarization weight (PW) method, which entirely avoids the need for small amounts of entanglement assistance appare","authors_text":"Anqi Gong, Joseph M. Renes","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-10T17:56:10Z","title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.04743","kind":"arxiv","version":1},"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:84857a147d316e89c5582f831d6969504b2a51d8a6eb96e9b9818088913e0f01","target":"record","created_at":"2026-05-18T02:44:39Z","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":"f6c8eba6101007dc67fdbfb9a49d8a652f630e2968823092059ed18d2c76a265","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-10T17:56:10Z","title_canon_sha256":"4e9dc0960eb48b2b33c1437a135ae78ed442ff53f5bb2ba2f917957bab8959ae"},"schema_version":"1.0","source":{"id":"2304.04743","kind":"arxiv","version":1}},"canonical_sha256":"35bf15b3876ec836196fe0857f7adab992f15b6793946106089335d6a054ede0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35bf15b3876ec836196fe0857f7adab992f15b6793946106089335d6a054ede0","first_computed_at":"2026-05-18T02:44:39.820308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:39.820308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6X6A7SZAfLzojiPuwicJ7foigtgR9HdLkXGggqlxqXd5UWkU2Q4TxMR3c+bsSS/m0nwh8yE10EBFwnuFaT+MCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:39.821006Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.04743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84857a147d316e89c5582f831d6969504b2a51d8a6eb96e9b9818088913e0f01","sha256:6e50cc9e2d681f4bf261586ee7e70836c6d5c52056db5e413e351f7656efd994"],"state_sha256":"581dbd185527184a510bfc1fbeec71d886c5a4f8e7326eec6d2138fc29092cd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TiPamgEH4C8jOslE4CktegAvBt37v6T3ghRi4gncUAgVFNMehcoCW2AnqcN8ixOfuPXhdEqX4AO3cXYcdlUKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T14:47:50.325878Z","bundle_sha256":"04dc8937bccc14d16db90133bd14a25da9de1b9a7ee17c4c23e644c51f16aaa3"}}