{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:663HS3A3BOVLLXMWF5ZVBXRHWM","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7baab711d5080de33809d7d309e065b2b2cc20ebc3938839d8f4eb6211c19880","cross_cats_sorted":["cs.DM","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T14:42:55Z","title_canon_sha256":"d2bc51fc464c0fba847c1af74ff4e2fbcc751580f76737d17af35d29e798e018"},"schema_version":"1.0","source":{"id":"2607.09469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09469","created_at":"2026-07-13T01:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09469v1","created_at":"2026-07-13T01:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09469","created_at":"2026-07-13T01:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"663HS3A3BOVL","created_at":"2026-07-13T01:20:12Z"},{"alias_kind":"pith_short_16","alias_value":"663HS3A3BOVLLXMW","created_at":"2026-07-13T01:20:12Z"},{"alias_kind":"pith_short_8","alias_value":"663HS3A3","created_at":"2026-07-13T01:20:12Z"}],"graph_snapshots":[{"event_id":"sha256:a6da885ebc3cb00a2df7c39d7ab8062dd80904775fcbf7ed6fea2a2d0c1f77a4","target":"graph","created_at":"2026-07-13T01:20:12Z","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/2607.09469/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a new notion of distance between two graph states $|G\\rangle$ and $|G'\\rangle$ on the same set of qubits. This distance is the minimum number of ancilla qubits in a graph state $|\\widehat{G}\\rangle$ from which both $|G\\rangle$ and $|G'\\rangle$ can be ``easily prepared''. (When preparing graph states, we are only allowed to use one-qubit Clifford gates, one-qubit Pauli measurements, and classical communication.) We give a graphical description of this distance through the lens of vertex-minors. We then show how this distance yields quantum network analogs of many graph edit-distanc","authors_text":"Blair D. Sullivan, Nathan Claudet, Romain Bourneuf, Rose McCarty, Sang Yoon Kim, St\\'ephan Thomass\\'e","cross_cats":["cs.DM","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T14:42:55Z","title":"A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09469","kind":"arxiv","version":1},"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:ff3894095e884bcaeadf2e2e37c1aa3e4e574803abfa0aa180fa35f4b6c9621d","target":"record","created_at":"2026-07-13T01:20:12Z","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":"7baab711d5080de33809d7d309e065b2b2cc20ebc3938839d8f4eb6211c19880","cross_cats_sorted":["cs.DM","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T14:42:55Z","title_canon_sha256":"d2bc51fc464c0fba847c1af74ff4e2fbcc751580f76737d17af35d29e798e018"},"schema_version":"1.0","source":{"id":"2607.09469","kind":"arxiv","version":1}},"canonical_sha256":"f7b6796c1b0baab5dd962f7350de27b3293dd16cb52d082de1e5d5f008cc2ae3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7b6796c1b0baab5dd962f7350de27b3293dd16cb52d082de1e5d5f008cc2ae3","first_computed_at":"2026-07-13T01:20:12.178228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-13T01:20:12.178228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4aDVb07sRckP4Q0KjS0CLU++tBRaVioOCm1j2p/JMZbvZG5nkeIB+yUfulKa94h5KyS49s+Au7UG+IcVXR3XBw==","signature_status":"signed_v1","signed_at":"2026-07-13T01:20:12.179656Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.09469","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:10abc212c009312d50f64b5a4fc1e02e9d49d4f18bf6fffdc069923630767418","sha256:8af0cdf44945ff680be694f01f88ebbed223de036f0bf3a09e3dbc091ad3c5ce"]}],"invalid_events":[],"applied_event_ids":["sha256:ff3894095e884bcaeadf2e2e37c1aa3e4e574803abfa0aa180fa35f4b6c9621d","sha256:a6da885ebc3cb00a2df7c39d7ab8062dd80904775fcbf7ed6fea2a2d0c1f77a4"],"state_sha256":"528793aa0186af28537963eed7f9b338c70013cba19495d9b8b7fa7a9e99d338"}