{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YKA7F36CRA7GSICBJLF6FVWROA","short_pith_number":"pith:YKA7F36C","schema_version":"1.0","canonical_sha256":"c281f2efc2883e6920414acbe2d6d17030ff84697c86f3e4c45d87b40118e1de","source":{"kind":"arxiv","id":"2607.09632","version":1},"attestation_state":"computed","paper":{"title":"Lean-QIT: Towards a Formal Infrastructure for Quantum Information Theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Chengkai Zhu, Guocheng Zhen, Lei Zhang, Ranyiliu Chen, Xin Wang, Xuanqiang Zhao, Yimeng Cao, Yusheng Zhao, Ziao Tang","submitted_at":"2026-07-10T17:28:26Z","abstract_excerpt":"Quantum information theory (QIT) characterizes the capabilities and fundamental limits of quantum information processing, underpinning quantum communication, computation, and error correction. Formalizing its coding theorems requires connecting finite-block protocols, analytic inequalities, and asymptotic limits within a unified machine-checked framework. Existing developments, however, lack a reusable operational layer that defines codes, error criteria, achievable rates, and capacities independently of their information-theoretic characterizations. In this work, we present LeanQIT, a Lean 4 "},"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":"2607.09632","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-10T17:28:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fbd42057b46cd62e2dc2395d7c666660e37455fea836eb9c4198463d0b3139e0","abstract_canon_sha256":"1a88fd6ed1283fc6cf3ce5380b114a78d2a1f510b5f9e4711c0b166f1be224b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:20:25.617848Z","signature_b64":"ygSe00roFRFqzMvDZsw1pNCuNftwSKlI5foPzi6UFMoxzES7LdRBrh9B9ZQH0P3iV0+aUJkrB5GPFfmP+FnpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c281f2efc2883e6920414acbe2d6d17030ff84697c86f3e4c45d87b40118e1de","last_reissued_at":"2026-07-13T01:20:25.616572Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:20:25.616572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lean-QIT: Towards a Formal Infrastructure for Quantum Information Theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Chengkai Zhu, Guocheng Zhen, Lei Zhang, Ranyiliu Chen, Xin Wang, Xuanqiang Zhao, Yimeng Cao, Yusheng Zhao, Ziao Tang","submitted_at":"2026-07-10T17:28:26Z","abstract_excerpt":"Quantum information theory (QIT) characterizes the capabilities and fundamental limits of quantum information processing, underpinning quantum communication, computation, and error correction. Formalizing its coding theorems requires connecting finite-block protocols, analytic inequalities, and asymptotic limits within a unified machine-checked framework. Existing developments, however, lack a reusable operational layer that defines codes, error criteria, achievable rates, and capacities independently of their information-theoretic characterizations. In this work, we present LeanQIT, a Lean 4 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09632","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/2607.09632/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":"2607.09632","created_at":"2026-07-13T01:20:25.617218+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.09632v1","created_at":"2026-07-13T01:20:25.617218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09632","created_at":"2026-07-13T01:20:25.617218+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKA7F36CRA7G","created_at":"2026-07-13T01:20:25.617218+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKA7F36CRA7GSICB","created_at":"2026-07-13T01:20:25.617218+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKA7F36C","created_at":"2026-07-13T01:20:25.617218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01317","citing_title":"Analytic Qubit Separation between POVMs and Projective Measurements","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YKA7F36CRA7GSICBJLF6FVWROA","json":"https://pith.science/pith/YKA7F36CRA7GSICBJLF6FVWROA.json","graph_json":"https://pith.science/api/pith-number/YKA7F36CRA7GSICBJLF6FVWROA/graph.json","events_json":"https://pith.science/api/pith-number/YKA7F36CRA7GSICBJLF6FVWROA/events.json","paper":"https://pith.science/paper/YKA7F36C"},"agent_actions":{"view_html":"https://pith.science/pith/YKA7F36CRA7GSICBJLF6FVWROA","download_json":"https://pith.science/pith/YKA7F36CRA7GSICBJLF6FVWROA.json","view_paper":"https://pith.science/paper/YKA7F36C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.09632&json=true","fetch_graph":"https://pith.science/api/pith-number/YKA7F36CRA7GSICBJLF6FVWROA/graph.json","fetch_events":"https://pith.science/api/pith-number/YKA7F36CRA7GSICBJLF6FVWROA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKA7F36CRA7GSICBJLF6FVWROA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKA7F36CRA7GSICBJLF6FVWROA/action/storage_attestation","attest_author":"https://pith.science/pith/YKA7F36CRA7GSICBJLF6FVWROA/action/author_attestation","sign_citation":"https://pith.science/pith/YKA7F36CRA7GSICBJLF6FVWROA/action/citation_signature","submit_replication":"https://pith.science/pith/YKA7F36CRA7GSICBJLF6FVWROA/action/replication_record"}},"created_at":"2026-07-13T01:20:25.617218+00:00","updated_at":"2026-07-13T01:20:25.617218+00:00"}