{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:663HS3A3BOVLLXMWF5ZVBXRHWM","short_pith_number":"pith:663HS3A3","schema_version":"1.0","canonical_sha256":"f7b6796c1b0baab5dd962f7350de27b3293dd16cb52d082de1e5d5f008cc2ae3","source":{"kind":"arxiv","id":"2607.09469","version":1},"attestation_state":"computed","paper":{"title":"A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","quant-ph"],"primary_cat":"cs.DS","authors_text":"Blair D. Sullivan, Nathan Claudet, Romain Bourneuf, Rose McCarty, Sang Yoon Kim, St\\'ephan Thomass\\'e","submitted_at":"2026-07-10T14:42:55Z","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"},"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":"2607.09469","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T14:42:55Z","cross_cats_sorted":["cs.DM","quant-ph"],"title_canon_sha256":"d2bc51fc464c0fba847c1af74ff4e2fbcc751580f76737d17af35d29e798e018","abstract_canon_sha256":"7baab711d5080de33809d7d309e065b2b2cc20ebc3938839d8f4eb6211c19880"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:20:12.179656Z","signature_b64":"4aDVb07sRckP4Q0KjS0CLU++tBRaVioOCm1j2p/JMZbvZG5nkeIB+yUfulKa94h5KyS49s+Au7UG+IcVXR3XBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7b6796c1b0baab5dd962f7350de27b3293dd16cb52d082de1e5d5f008cc2ae3","last_reissued_at":"2026-07-13T01:20:12.178228Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:20:12.178228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","quant-ph"],"primary_cat":"cs.DS","authors_text":"Blair D. Sullivan, Nathan Claudet, Romain Bourneuf, Rose McCarty, Sang Yoon Kim, St\\'ephan Thomass\\'e","submitted_at":"2026-07-10T14:42:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09469","kind":"arxiv","version":1},"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/2607.09469/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":"2607.09469","created_at":"2026-07-13T01:20:12.178920+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.09469v1","created_at":"2026-07-13T01:20:12.178920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09469","created_at":"2026-07-13T01:20:12.178920+00:00"},{"alias_kind":"pith_short_12","alias_value":"663HS3A3BOVL","created_at":"2026-07-13T01:20:12.178920+00:00"},{"alias_kind":"pith_short_16","alias_value":"663HS3A3BOVLLXMW","created_at":"2026-07-13T01:20:12.178920+00:00"},{"alias_kind":"pith_short_8","alias_value":"663HS3A3","created_at":"2026-07-13T01:20:12.178920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/663HS3A3BOVLLXMWF5ZVBXRHWM","json":"https://pith.science/pith/663HS3A3BOVLLXMWF5ZVBXRHWM.json","graph_json":"https://pith.science/api/pith-number/663HS3A3BOVLLXMWF5ZVBXRHWM/graph.json","events_json":"https://pith.science/api/pith-number/663HS3A3BOVLLXMWF5ZVBXRHWM/events.json","paper":"https://pith.science/paper/663HS3A3"},"agent_actions":{"view_html":"https://pith.science/pith/663HS3A3BOVLLXMWF5ZVBXRHWM","download_json":"https://pith.science/pith/663HS3A3BOVLLXMWF5ZVBXRHWM.json","view_paper":"https://pith.science/paper/663HS3A3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.09469&json=true","fetch_graph":"https://pith.science/api/pith-number/663HS3A3BOVLLXMWF5ZVBXRHWM/graph.json","fetch_events":"https://pith.science/api/pith-number/663HS3A3BOVLLXMWF5ZVBXRHWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/663HS3A3BOVLLXMWF5ZVBXRHWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/663HS3A3BOVLLXMWF5ZVBXRHWM/action/storage_attestation","attest_author":"https://pith.science/pith/663HS3A3BOVLLXMWF5ZVBXRHWM/action/author_attestation","sign_citation":"https://pith.science/pith/663HS3A3BOVLLXMWF5ZVBXRHWM/action/citation_signature","submit_replication":"https://pith.science/pith/663HS3A3BOVLLXMWF5ZVBXRHWM/action/replication_record"}},"created_at":"2026-07-13T01:20:12.178920+00:00","updated_at":"2026-07-13T01:20:12.178920+00:00"}