{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5HM4GMCPF75ICH2OPR4PIXAA2R","short_pith_number":"pith:5HM4GMCP","schema_version":"1.0","canonical_sha256":"e9d9c3304f2ffa811f4e7c78f45c00d4700044a3ddbd74655c50e1a27ed34ce3","source":{"kind":"arxiv","id":"2205.05781","version":2},"attestation_state":"computed","paper":{"title":"VyZX : A Vision for Verifying the ZX Calculus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Adrian Lehmann, Ben Caldwell, Robert Rand","submitted_at":"2022-05-11T21:37:23Z","abstract_excerpt":"Optimizing quantum circuits is a key challenge for quantum computing. The PyZX compiler broke new ground by optimizing circuits via the ZX calculus, a powerful graphical alternative to the quantum circuit model. Still, it carries no guarantee of its correctness. To address this, we developed VyZX, a verified ZX-calculus in the Coq proof assistant. VyZX provides two distinct representations of ZX diagrams for ease of programming and proof: A graph-based representation for writing high-level functions on diagrams and a block-based representation for proving ZX diagrams equivalent. Through these "},"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":"2205.05781","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-05-11T21:37:23Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"3da7f8167649f6450f6de3b6770c8327d2fd9d300ee17a650ac6b0d567ba4a05","abstract_canon_sha256":"422d89eb509268092faafa04f02ed0dbd797485ca4c0263f0b3456eb4bfe1646"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:40.769058Z","signature_b64":"NYq0yOfNYastDa5n/0Ce1U2Izx8GM4X7o8Th8pQh7mQ86AkDfp9rAMQCNlChWWj9/2hzvHo7sy/Rb859v5aYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9d9c3304f2ffa811f4e7c78f45c00d4700044a3ddbd74655c50e1a27ed34ce3","last_reissued_at":"2026-07-05T04:24:40.768683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:40.768683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VyZX : A Vision for Verifying the ZX Calculus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Adrian Lehmann, Ben Caldwell, Robert Rand","submitted_at":"2022-05-11T21:37:23Z","abstract_excerpt":"Optimizing quantum circuits is a key challenge for quantum computing. The PyZX compiler broke new ground by optimizing circuits via the ZX calculus, a powerful graphical alternative to the quantum circuit model. Still, it carries no guarantee of its correctness. To address this, we developed VyZX, a verified ZX-calculus in the Coq proof assistant. VyZX provides two distinct representations of ZX diagrams for ease of programming and proof: A graph-based representation for writing high-level functions on diagrams and a block-based representation for proving ZX diagrams equivalent. Through these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.05781","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.05781/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":"2205.05781","created_at":"2026-07-05T04:24:40.768740+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.05781v2","created_at":"2026-07-05T04:24:40.768740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.05781","created_at":"2026-07-05T04:24:40.768740+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HM4GMCPF75I","created_at":"2026-07-05T04:24:40.768740+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HM4GMCPF75ICH2O","created_at":"2026-07-05T04:24:40.768740+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HM4GMCP","created_at":"2026-07-05T04:24:40.768740+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2311.14347","citing_title":"Typed compositional quantum computation with lenses","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5HM4GMCPF75ICH2OPR4PIXAA2R","json":"https://pith.science/pith/5HM4GMCPF75ICH2OPR4PIXAA2R.json","graph_json":"https://pith.science/api/pith-number/5HM4GMCPF75ICH2OPR4PIXAA2R/graph.json","events_json":"https://pith.science/api/pith-number/5HM4GMCPF75ICH2OPR4PIXAA2R/events.json","paper":"https://pith.science/paper/5HM4GMCP"},"agent_actions":{"view_html":"https://pith.science/pith/5HM4GMCPF75ICH2OPR4PIXAA2R","download_json":"https://pith.science/pith/5HM4GMCPF75ICH2OPR4PIXAA2R.json","view_paper":"https://pith.science/paper/5HM4GMCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.05781&json=true","fetch_graph":"https://pith.science/api/pith-number/5HM4GMCPF75ICH2OPR4PIXAA2R/graph.json","fetch_events":"https://pith.science/api/pith-number/5HM4GMCPF75ICH2OPR4PIXAA2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HM4GMCPF75ICH2OPR4PIXAA2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HM4GMCPF75ICH2OPR4PIXAA2R/action/storage_attestation","attest_author":"https://pith.science/pith/5HM4GMCPF75ICH2OPR4PIXAA2R/action/author_attestation","sign_citation":"https://pith.science/pith/5HM4GMCPF75ICH2OPR4PIXAA2R/action/citation_signature","submit_replication":"https://pith.science/pith/5HM4GMCPF75ICH2OPR4PIXAA2R/action/replication_record"}},"created_at":"2026-07-05T04:24:40.768740+00:00","updated_at":"2026-07-05T04:24:40.768740+00:00"}