{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:L4JICVB5VP5WDOCQQEX7AINWLN","short_pith_number":"pith:L4JICVB5","schema_version":"1.0","canonical_sha256":"5f1281543dabfb61b850812ff021b65b4c77309f67afd3df1077c4d0d3d4a4d7","source":{"kind":"arxiv","id":"2504.00291","version":2},"attestation_state":"computed","paper":{"title":"Preparing graph states forbidding a vertex-minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"quant-ph","authors_text":"Andrew Jena, James Davies","submitted_at":"2025-03-31T23:25:35Z","abstract_excerpt":"Measurement based quantum computing is preformed by adding non-Clifford measurements to a prepared stabilizer states. Entangling gates like CZ are likely to have lower fidelities due to the nature of interacting qubits, so when preparing a stabilizer state, we wish to minimize the number of required entangling states. This naturally introduces the notion of CZ-distance.\n  Every stabilizer state is local-Clifford equivalent to a graph state, so we may focus on graph states $\\left\\vert G \\right\\rangle$. As a lower bound for general graphs, there exist $n$-vertex graphs $G$ such that the CZ-dista"},"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":"2504.00291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-31T23:25:35Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"146ef1aaa2cf0b7c652e3e680c0055a9ec7cc6cc50f1dc3d1f1a6e86a77bc306","abstract_canon_sha256":"4b2c47d3fa06654bd8ae445ecdfaea6ef0b437c4cfc9cf565dc2bc76b63d0015"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:03.506071Z","signature_b64":"9gikjgjFnEyBMOIFjuv/Xi5UFbN8wcDxV1qGuwng/J0/ZA9QTJnBNLxHDwmZBVJHZ0I0b4WA/BYTEgxK4ZDwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f1281543dabfb61b850812ff021b65b4c77309f67afd3df1077c4d0d3d4a4d7","last_reissued_at":"2026-07-05T11:44:03.505532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:03.505532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preparing graph states forbidding a vertex-minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"quant-ph","authors_text":"Andrew Jena, James Davies","submitted_at":"2025-03-31T23:25:35Z","abstract_excerpt":"Measurement based quantum computing is preformed by adding non-Clifford measurements to a prepared stabilizer states. Entangling gates like CZ are likely to have lower fidelities due to the nature of interacting qubits, so when preparing a stabilizer state, we wish to minimize the number of required entangling states. This naturally introduces the notion of CZ-distance.\n  Every stabilizer state is local-Clifford equivalent to a graph state, so we may focus on graph states $\\left\\vert G \\right\\rangle$. As a lower bound for general graphs, there exist $n$-vertex graphs $G$ such that the CZ-dista"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00291","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/2504.00291/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":"2504.00291","created_at":"2026-07-05T11:44:03.505596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.00291v2","created_at":"2026-07-05T11:44:03.505596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00291","created_at":"2026-07-05T11:44:03.505596+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4JICVB5VP5W","created_at":"2026-07-05T11:44:03.505596+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4JICVB5VP5WDOCQ","created_at":"2026-07-05T11:44:03.505596+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4JICVB5","created_at":"2026-07-05T11:44:03.505596+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09785","citing_title":"Biclique decompositions from Welzl orders","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07110","citing_title":"Entanglement from Expansion: High Rank-Width in Deterministic Graphs","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4JICVB5VP5WDOCQQEX7AINWLN","json":"https://pith.science/pith/L4JICVB5VP5WDOCQQEX7AINWLN.json","graph_json":"https://pith.science/api/pith-number/L4JICVB5VP5WDOCQQEX7AINWLN/graph.json","events_json":"https://pith.science/api/pith-number/L4JICVB5VP5WDOCQQEX7AINWLN/events.json","paper":"https://pith.science/paper/L4JICVB5"},"agent_actions":{"view_html":"https://pith.science/pith/L4JICVB5VP5WDOCQQEX7AINWLN","download_json":"https://pith.science/pith/L4JICVB5VP5WDOCQQEX7AINWLN.json","view_paper":"https://pith.science/paper/L4JICVB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.00291&json=true","fetch_graph":"https://pith.science/api/pith-number/L4JICVB5VP5WDOCQQEX7AINWLN/graph.json","fetch_events":"https://pith.science/api/pith-number/L4JICVB5VP5WDOCQQEX7AINWLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4JICVB5VP5WDOCQQEX7AINWLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4JICVB5VP5WDOCQQEX7AINWLN/action/storage_attestation","attest_author":"https://pith.science/pith/L4JICVB5VP5WDOCQQEX7AINWLN/action/author_attestation","sign_citation":"https://pith.science/pith/L4JICVB5VP5WDOCQQEX7AINWLN/action/citation_signature","submit_replication":"https://pith.science/pith/L4JICVB5VP5WDOCQQEX7AINWLN/action/replication_record"}},"created_at":"2026-07-05T11:44:03.505596+00:00","updated_at":"2026-07-05T11:44:03.505596+00:00"}