{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DDVWRWY2JFJUYIGC66HFVNNA3F","short_pith_number":"pith:DDVWRWY2","schema_version":"1.0","canonical_sha256":"18eb68db1a49534c20c2f78e5ab5a0d94b4f26914a9b500176b7b09717de8c57","source":{"kind":"arxiv","id":"2605.16523","version":1},"attestation_state":"computed","paper":{"title":"End-to-End Formalization of Quantum Error Correction","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"quant-ph","authors_text":"Mattias Ehatamm, Runzhou Tao, Xiaodi Wu, Yi Lee","submitted_at":"2026-05-15T18:17:55Z","abstract_excerpt":"Quantum error-correcting codes (QECCs) sit between noisy quantum hardware and reliable computation, so the code parameters used in practice must be trustworthy. The single number that summarizes a code's strength is its distance, yet certifying a distance lower bound is NP-hard in general, placing it beyond the reach of pen-and-paper proofs as well as direct proof-assistant scripting. As a result, distance values in the literature come either from non-scaling hand proofs, or from unverified solvers that leave a trust gap exactly where the code is supposed to provide a guarantee. We present Lea"},"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":"2605.16523","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-15T18:17:55Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9ebfbe10ecccdfba1f70c8bf2b7be57a0f62dbffb4298bb994a04e4a96276436","abstract_canon_sha256":"2dbefe42c2749f0fd296e817ecca13eab90a12f1e641cdb471d81c51670e0bd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:27.246517Z","signature_b64":"s5MDhJPPQpciyKh0Gn78ZJ/9F2D92HyCZ1vFWDOJEGM/9+V7Ns0qIgTqM4C9U8rh5hdzbVYbxatdFBv7/4hYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18eb68db1a49534c20c2f78e5ab5a0d94b4f26914a9b500176b7b09717de8c57","last_reissued_at":"2026-05-20T00:02:27.245785Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:27.245785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-End Formalization of Quantum Error Correction","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"quant-ph","authors_text":"Mattias Ehatamm, Runzhou Tao, Xiaodi Wu, Yi Lee","submitted_at":"2026-05-15T18:17:55Z","abstract_excerpt":"Quantum error-correcting codes (QECCs) sit between noisy quantum hardware and reliable computation, so the code parameters used in practice must be trustworthy. The single number that summarizes a code's strength is its distance, yet certifying a distance lower bound is NP-hard in general, placing it beyond the reach of pen-and-paper proofs as well as direct proof-assistant scripting. As a result, distance values in the literature come either from non-scaling hand proofs, or from unverified solvers that leave a trust gap exactly where the code is supposed to provide a guarantee. We present Lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16523","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/2605.16523/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:23.079055Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.944825Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7258485e3b467a28470feca7e8f04043116d4c8b56ea6b95b136dc3332011c55"},"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":"2605.16523","created_at":"2026-05-20T00:02:27.245913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16523v1","created_at":"2026-05-20T00:02:27.245913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16523","created_at":"2026-05-20T00:02:27.245913+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDVWRWY2JFJU","created_at":"2026-05-20T00:02:27.245913+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDVWRWY2JFJUYIGC","created_at":"2026-05-20T00:02:27.245913+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDVWRWY2","created_at":"2026-05-20T00:02:27.245913+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DDVWRWY2JFJUYIGC66HFVNNA3F","json":"https://pith.science/pith/DDVWRWY2JFJUYIGC66HFVNNA3F.json","graph_json":"https://pith.science/api/pith-number/DDVWRWY2JFJUYIGC66HFVNNA3F/graph.json","events_json":"https://pith.science/api/pith-number/DDVWRWY2JFJUYIGC66HFVNNA3F/events.json","paper":"https://pith.science/paper/DDVWRWY2"},"agent_actions":{"view_html":"https://pith.science/pith/DDVWRWY2JFJUYIGC66HFVNNA3F","download_json":"https://pith.science/pith/DDVWRWY2JFJUYIGC66HFVNNA3F.json","view_paper":"https://pith.science/paper/DDVWRWY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16523&json=true","fetch_graph":"https://pith.science/api/pith-number/DDVWRWY2JFJUYIGC66HFVNNA3F/graph.json","fetch_events":"https://pith.science/api/pith-number/DDVWRWY2JFJUYIGC66HFVNNA3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDVWRWY2JFJUYIGC66HFVNNA3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDVWRWY2JFJUYIGC66HFVNNA3F/action/storage_attestation","attest_author":"https://pith.science/pith/DDVWRWY2JFJUYIGC66HFVNNA3F/action/author_attestation","sign_citation":"https://pith.science/pith/DDVWRWY2JFJUYIGC66HFVNNA3F/action/citation_signature","submit_replication":"https://pith.science/pith/DDVWRWY2JFJUYIGC66HFVNNA3F/action/replication_record"}},"created_at":"2026-05-20T00:02:27.245913+00:00","updated_at":"2026-05-20T00:02:27.245913+00:00"}