{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:ODPCB5RXJCBNKXVQKDPI7LWM7Q","short_pith_number":"pith:ODPCB5RX","schema_version":"1.0","canonical_sha256":"70de20f6374882d55eb050de8faeccfc2e279058db0fd0591e11cb28404c9fdd","source":{"kind":"arxiv","id":"quant-ph/0405023","version":2},"attestation_state":"computed","paper":{"title":"An efficient algorithm to recognize local Clifford equivalence of graph states","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bart De Moor, Jeroen Dehaene, Maarten Van den Nest","submitted_at":"2004-05-05T09:59:20Z","abstract_excerpt":"In [Phys. Rev. A 69, 022316 (2004)] we presented a description of the action of local Clifford operations on graph states in terms of a graph transformation rule, known in graph theory as \\emph{local complementation}. It was shown that two graph states are equivalent under the local Clifford group if and only if there exists a sequence of local complementations which relates their associated graphs. In this short note we report the existence of a polynomial time algorithm, published in [Combinatorica 11 (4), 315 (1991)], which decides whether two given graphs are related by a sequence of local"},"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":"quant-ph/0405023","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-05-05T09:59:20Z","cross_cats_sorted":[],"title_canon_sha256":"b6610b8dd1c74f69794e7233d2aacdcd1015ace414a56904906bfa554085cddf","abstract_canon_sha256":"d01db4bfe673a228cf6a9ef5f2938ca16e0662a9caa7de9be75d66048ca297fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:50:17.242030Z","signature_b64":"ZX2TmP2EaIMvS/9JAuXR6T4gz9w+7W1qv0x6xjL809AwETc+5X55EKsDSzClh/m2+vlYLUQG5xKc1qbrGzlmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70de20f6374882d55eb050de8faeccfc2e279058db0fd0591e11cb28404c9fdd","last_reissued_at":"2026-07-04T16:50:17.241595Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:50:17.241595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient algorithm to recognize local Clifford equivalence of graph states","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bart De Moor, Jeroen Dehaene, Maarten Van den Nest","submitted_at":"2004-05-05T09:59:20Z","abstract_excerpt":"In [Phys. Rev. A 69, 022316 (2004)] we presented a description of the action of local Clifford operations on graph states in terms of a graph transformation rule, known in graph theory as \\emph{local complementation}. It was shown that two graph states are equivalent under the local Clifford group if and only if there exists a sequence of local complementations which relates their associated graphs. In this short note we report the existence of a polynomial time algorithm, published in [Combinatorica 11 (4), 315 (1991)], which decides whether two given graphs are related by a sequence of local"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0405023","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/quant-ph/0405023/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":"quant-ph/0405023","created_at":"2026-07-04T16:50:17.241663+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0405023v2","created_at":"2026-07-04T16:50:17.241663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0405023","created_at":"2026-07-04T16:50:17.241663+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODPCB5RXJCBN","created_at":"2026-07-04T16:50:17.241663+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODPCB5RXJCBNKXVQ","created_at":"2026-07-04T16:50:17.241663+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODPCB5RX","created_at":"2026-07-04T16:50:17.241663+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.08847","citing_title":"The Structure of Circle Graph States","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q","json":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q.json","graph_json":"https://pith.science/api/pith-number/ODPCB5RXJCBNKXVQKDPI7LWM7Q/graph.json","events_json":"https://pith.science/api/pith-number/ODPCB5RXJCBNKXVQKDPI7LWM7Q/events.json","paper":"https://pith.science/paper/ODPCB5RX"},"agent_actions":{"view_html":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q","download_json":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q.json","view_paper":"https://pith.science/paper/ODPCB5RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0405023&json=true","fetch_graph":"https://pith.science/api/pith-number/ODPCB5RXJCBNKXVQKDPI7LWM7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/ODPCB5RXJCBNKXVQKDPI7LWM7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/action/storage_attestation","attest_author":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/action/author_attestation","sign_citation":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/action/citation_signature","submit_replication":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/action/replication_record"}},"created_at":"2026-07-04T16:50:17.241663+00:00","updated_at":"2026-07-04T16:50:17.241663+00:00"}