{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4WOG6OZFKJU6HE4YRDXQKDRXTP","short_pith_number":"pith:4WOG6OZF","schema_version":"1.0","canonical_sha256":"e59c6f3b255269e3939888ef050e379be4db108e831e0585729d462dedba4768","source":{"kind":"arxiv","id":"2304.08363","version":3},"attestation_state":"computed","paper":{"title":"A ZX-Calculus Approach for the Construction of Graph Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Song Cheng, Zipeng Wu","submitted_at":"2023-04-17T15:24:28Z","abstract_excerpt":"Quantum Error-Correcting Codes (QECCs) play a crucial role in enhancing the robustness of quantum computing and communication systems against errors. Within the realm of QECCs, stabilizer codes, and specifically graph codes, stand out for their distinct attributes and promising utility in quantum technologies. This study underscores the significance of devising expansive QECCs and adopts the ZX-calculus a graphical language adept at quantum computational reasoning-to depict the encoders of graph codes effectively. Through the integration of ZX-calculus with established encoder frameworks, we p"},"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":"2304.08363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-17T15:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"9d34f73ad1e8cbb0c88e433cca868ea2cd97f09da695953b9f5ec3f65c243ab6","abstract_canon_sha256":"0d5aa5fb117398a29a617800edfa78f09a6a920039a4d9c2fb2dd621635fb0ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:30.060354Z","signature_b64":"RSav315n9VFbVSD94QI3uOUeU/fkpeckGFSRP06GibOcIxeK4EU8dt0qi0H97biR6yYkKwH9YRrs81jY5R+BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e59c6f3b255269e3939888ef050e379be4db108e831e0585729d462dedba4768","last_reissued_at":"2026-07-05T08:01:30.059816Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:30.059816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A ZX-Calculus Approach for the Construction of Graph Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Song Cheng, Zipeng Wu","submitted_at":"2023-04-17T15:24:28Z","abstract_excerpt":"Quantum Error-Correcting Codes (QECCs) play a crucial role in enhancing the robustness of quantum computing and communication systems against errors. Within the realm of QECCs, stabilizer codes, and specifically graph codes, stand out for their distinct attributes and promising utility in quantum technologies. This study underscores the significance of devising expansive QECCs and adopts the ZX-calculus a graphical language adept at quantum computational reasoning-to depict the encoders of graph codes effectively. Through the integration of ZX-calculus with established encoder frameworks, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.08363","kind":"arxiv","version":3},"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/2304.08363/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":"2304.08363","created_at":"2026-07-05T08:01:30.059876+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.08363v3","created_at":"2026-07-05T08:01:30.059876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.08363","created_at":"2026-07-05T08:01:30.059876+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WOG6OZFKJU6","created_at":"2026-07-05T08:01:30.059876+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WOG6OZFKJU6HE4Y","created_at":"2026-07-05T08:01:30.059876+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WOG6OZF","created_at":"2026-07-05T08:01:30.059876+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02542","citing_title":"Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15266","citing_title":"Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4WOG6OZFKJU6HE4YRDXQKDRXTP","json":"https://pith.science/pith/4WOG6OZFKJU6HE4YRDXQKDRXTP.json","graph_json":"https://pith.science/api/pith-number/4WOG6OZFKJU6HE4YRDXQKDRXTP/graph.json","events_json":"https://pith.science/api/pith-number/4WOG6OZFKJU6HE4YRDXQKDRXTP/events.json","paper":"https://pith.science/paper/4WOG6OZF"},"agent_actions":{"view_html":"https://pith.science/pith/4WOG6OZFKJU6HE4YRDXQKDRXTP","download_json":"https://pith.science/pith/4WOG6OZFKJU6HE4YRDXQKDRXTP.json","view_paper":"https://pith.science/paper/4WOG6OZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.08363&json=true","fetch_graph":"https://pith.science/api/pith-number/4WOG6OZFKJU6HE4YRDXQKDRXTP/graph.json","fetch_events":"https://pith.science/api/pith-number/4WOG6OZFKJU6HE4YRDXQKDRXTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WOG6OZFKJU6HE4YRDXQKDRXTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WOG6OZFKJU6HE4YRDXQKDRXTP/action/storage_attestation","attest_author":"https://pith.science/pith/4WOG6OZFKJU6HE4YRDXQKDRXTP/action/author_attestation","sign_citation":"https://pith.science/pith/4WOG6OZFKJU6HE4YRDXQKDRXTP/action/citation_signature","submit_replication":"https://pith.science/pith/4WOG6OZFKJU6HE4YRDXQKDRXTP/action/replication_record"}},"created_at":"2026-07-05T08:01:30.059876+00:00","updated_at":"2026-07-05T08:01:30.059876+00:00"}