{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OV7PLA3CHN25X25DEUXJ62D7Q2","short_pith_number":"pith:OV7PLA3C","schema_version":"1.0","canonical_sha256":"757ef583623b75dbeba3252e9f687f86a89f6cf28031f8a2617c0b81b3237a26","source":{"kind":"arxiv","id":"2212.09935","version":1},"attestation_state":"computed","paper":{"title":"Approaching the Quantum Singleton Bound with Approximate Error Correction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Louis Golowich, Sam Gunn, Thiago Bergamaschi","submitted_at":"2022-12-20T01:01:01Z","abstract_excerpt":"It is well known that no quantum error correcting code of rate $R$ can correct adversarial errors on more than a $(1-R)/4$ fraction of symbols. But what if we only require our codes to *approximately* recover the message? We construct efficiently-decodable approximate quantum codes against adversarial error rates approaching the quantum Singleton bound of $(1-R)/2$, for any constant rate $R$. Moreover, the size of the alphabet is a constant independent of the message length and the recovery error is exponentially small in the message length. Central to our construction is a notion of quantum l"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2212.09935","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-20T01:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"e0bf28ffcefeac9f596c988caf5d84ff355899bf7442bb1f746b4b45c4af7e96","abstract_canon_sha256":"f21404cef675e61b58fab7def2226c4f3ff402bb5982e0778281bd78d609b343"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:01.792176Z","signature_b64":"8sj/B3CjUlo/s1oJXQ1KeUy7Qu6mSYSf0rcmWyrfmy7gk4owEQm/fmQ/vxmZwz5Xaeojch4lqqmpt+psEJlHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"757ef583623b75dbeba3252e9f687f86a89f6cf28031f8a2617c0b81b3237a26","last_reissued_at":"2026-07-05T05:27:01.791747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:01.791747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approaching the Quantum Singleton Bound with Approximate Error Correction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Louis Golowich, Sam Gunn, Thiago Bergamaschi","submitted_at":"2022-12-20T01:01:01Z","abstract_excerpt":"It is well known that no quantum error correcting code of rate $R$ can correct adversarial errors on more than a $(1-R)/4$ fraction of symbols. But what if we only require our codes to *approximately* recover the message? We construct efficiently-decodable approximate quantum codes against adversarial error rates approaching the quantum Singleton bound of $(1-R)/2$, for any constant rate $R$. Moreover, the size of the alphabet is a constant independent of the message length and the recovery error is exponentially small in the message length. Central to our construction is a notion of quantum l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09935","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.09935/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2212.09935","created_at":"2026-07-05T05:27:01.791802+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.09935v1","created_at":"2026-07-05T05:27:01.791802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09935","created_at":"2026-07-05T05:27:01.791802+00:00"},{"alias_kind":"pith_short_12","alias_value":"OV7PLA3CHN25","created_at":"2026-07-05T05:27:01.791802+00:00"},{"alias_kind":"pith_short_16","alias_value":"OV7PLA3CHN25X25D","created_at":"2026-07-05T05:27:01.791802+00:00"},{"alias_kind":"pith_short_8","alias_value":"OV7PLA3C","created_at":"2026-07-05T05:27:01.791802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07308","citing_title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OV7PLA3CHN25X25DEUXJ62D7Q2","json":"https://pith.science/pith/OV7PLA3CHN25X25DEUXJ62D7Q2.json","graph_json":"https://pith.science/api/pith-number/OV7PLA3CHN25X25DEUXJ62D7Q2/graph.json","events_json":"https://pith.science/api/pith-number/OV7PLA3CHN25X25DEUXJ62D7Q2/events.json","paper":"https://pith.science/paper/OV7PLA3C"},"agent_actions":{"view_html":"https://pith.science/pith/OV7PLA3CHN25X25DEUXJ62D7Q2","download_json":"https://pith.science/pith/OV7PLA3CHN25X25DEUXJ62D7Q2.json","view_paper":"https://pith.science/paper/OV7PLA3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.09935&json=true","fetch_graph":"https://pith.science/api/pith-number/OV7PLA3CHN25X25DEUXJ62D7Q2/graph.json","fetch_events":"https://pith.science/api/pith-number/OV7PLA3CHN25X25DEUXJ62D7Q2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OV7PLA3CHN25X25DEUXJ62D7Q2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OV7PLA3CHN25X25DEUXJ62D7Q2/action/storage_attestation","attest_author":"https://pith.science/pith/OV7PLA3CHN25X25DEUXJ62D7Q2/action/author_attestation","sign_citation":"https://pith.science/pith/OV7PLA3CHN25X25DEUXJ62D7Q2/action/citation_signature","submit_replication":"https://pith.science/pith/OV7PLA3CHN25X25DEUXJ62D7Q2/action/replication_record"}},"created_at":"2026-07-05T05:27:01.791802+00:00","updated_at":"2026-07-05T05:27:01.791802+00:00"}