{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:L4JICVB5VP5WDOCQQEX7AINWLN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4b2c47d3fa06654bd8ae445ecdfaea6ef0b437c4cfc9cf565dc2bc76b63d0015","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-31T23:25:35Z","title_canon_sha256":"146ef1aaa2cf0b7c652e3e680c0055a9ec7cc6cc50f1dc3d1f1a6e86a77bc306"},"schema_version":"1.0","source":{"id":"2504.00291","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.00291","created_at":"2026-07-05T11:44:03Z"},{"alias_kind":"arxiv_version","alias_value":"2504.00291v2","created_at":"2026-07-05T11:44:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00291","created_at":"2026-07-05T11:44:03Z"},{"alias_kind":"pith_short_12","alias_value":"L4JICVB5VP5W","created_at":"2026-07-05T11:44:03Z"},{"alias_kind":"pith_short_16","alias_value":"L4JICVB5VP5WDOCQ","created_at":"2026-07-05T11:44:03Z"},{"alias_kind":"pith_short_8","alias_value":"L4JICVB5","created_at":"2026-07-05T11:44:03Z"}],"graph_snapshots":[{"event_id":"sha256:836bf4a8c7001b5cdfc2d6a9ae24ef1db22108abb465f9e01cb32d3134369112","target":"graph","created_at":"2026-07-05T11:44:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.00291/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrew Jena, James Davies","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-31T23:25:35Z","title":"Preparing graph states forbidding a vertex-minor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00291","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c77db240e1c82c7b5f4c7d27fb754d1f69698f8847e085beaf5cfb320ddcae18","target":"record","created_at":"2026-07-05T11:44:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4b2c47d3fa06654bd8ae445ecdfaea6ef0b437c4cfc9cf565dc2bc76b63d0015","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-31T23:25:35Z","title_canon_sha256":"146ef1aaa2cf0b7c652e3e680c0055a9ec7cc6cc50f1dc3d1f1a6e86a77bc306"},"schema_version":"1.0","source":{"id":"2504.00291","kind":"arxiv","version":2}},"canonical_sha256":"5f1281543dabfb61b850812ff021b65b4c77309f67afd3df1077c4d0d3d4a4d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f1281543dabfb61b850812ff021b65b4c77309f67afd3df1077c4d0d3d4a4d7","first_computed_at":"2026-07-05T11:44:03.505532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:03.505532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9gikjgjFnEyBMOIFjuv/Xi5UFbN8wcDxV1qGuwng/J0/ZA9QTJnBNLxHDwmZBVJHZ0I0b4WA/BYTEgxK4ZDwAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:03.506071Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.00291","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c77db240e1c82c7b5f4c7d27fb754d1f69698f8847e085beaf5cfb320ddcae18","sha256:836bf4a8c7001b5cdfc2d6a9ae24ef1db22108abb465f9e01cb32d3134369112"],"state_sha256":"6cbd853d944ab5de8382b8d0b76ae1c2a26a2414bc325655a2e852fae20fd8d3"}