{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:ODPCB5RXJCBNKXVQKDPI7LWM7Q","short_pith_number":"pith:ODPCB5RX","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"},"canonical_sha256":"70de20f6374882d55eb050de8faeccfc2e279058db0fd0591e11cb28404c9fdd","source":{"kind":"arxiv","id":"quant-ph/0405023","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0405023","created_at":"2026-07-04T16:50:17Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0405023v2","created_at":"2026-07-04T16:50:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0405023","created_at":"2026-07-04T16:50:17Z"},{"alias_kind":"pith_short_12","alias_value":"ODPCB5RXJCBN","created_at":"2026-07-04T16:50:17Z"},{"alias_kind":"pith_short_16","alias_value":"ODPCB5RXJCBNKXVQ","created_at":"2026-07-04T16:50:17Z"},{"alias_kind":"pith_short_8","alias_value":"ODPCB5RX","created_at":"2026-07-04T16:50:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:ODPCB5RXJCBNKXVQKDPI7LWM7Q","target":"record","payload":{"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"},"canonical_sha256":"70de20f6374882d55eb050de8faeccfc2e279058db0fd0591e11cb28404c9fdd","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"},"source_kind":"arxiv","source_id":"quant-ph/0405023","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T16:50:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGMizz1zkLZU/LB7+zKpRQ3NVeJK+oACW1TfI9nRoyuoeUf7XigH1jrb2/UvYLn4GC5LtkjBbv6QlP/aixx2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:38:44.723152Z"},"content_sha256":"4147f774210e046efc92ae9b6e4926ec2d77bf5d8ca33fcb65a78e3d8d5bbdfe","schema_version":"1.0","event_id":"sha256:4147f774210e046efc92ae9b6e4926ec2d77bf5d8ca33fcb65a78e3d8d5bbdfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:ODPCB5RXJCBNKXVQKDPI7LWM7Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T16:50:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/762Huo7YGNzx+zeKTkWWbFBdRAdrGIRDDiFQ+60aAnQq5lGqsDTO1kXuYdyNKMkDTG/x+U45z2InjG6eh6JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:38:44.723674Z"},"content_sha256":"44db9d360984ccc8daacb1e168f53c1a473f445392565a0cff2625daca3cd98c","schema_version":"1.0","event_id":"sha256:44db9d360984ccc8daacb1e168f53c1a473f445392565a0cff2625daca3cd98c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/bundle.json","state_url":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T07:38:44Z","links":{"resolver":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q","bundle":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/bundle.json","state":"https://pith.science/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODPCB5RXJCBNKXVQKDPI7LWM7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:ODPCB5RXJCBNKXVQKDPI7LWM7Q","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":"d01db4bfe673a228cf6a9ef5f2938ca16e0662a9caa7de9be75d66048ca297fc","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-05-05T09:59:20Z","title_canon_sha256":"b6610b8dd1c74f69794e7233d2aacdcd1015ace414a56904906bfa554085cddf"},"schema_version":"1.0","source":{"id":"quant-ph/0405023","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0405023","created_at":"2026-07-04T16:50:17Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0405023v2","created_at":"2026-07-04T16:50:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0405023","created_at":"2026-07-04T16:50:17Z"},{"alias_kind":"pith_short_12","alias_value":"ODPCB5RXJCBN","created_at":"2026-07-04T16:50:17Z"},{"alias_kind":"pith_short_16","alias_value":"ODPCB5RXJCBNKXVQ","created_at":"2026-07-04T16:50:17Z"},{"alias_kind":"pith_short_8","alias_value":"ODPCB5RX","created_at":"2026-07-04T16:50:17Z"}],"graph_snapshots":[{"event_id":"sha256:44db9d360984ccc8daacb1e168f53c1a473f445392565a0cff2625daca3cd98c","target":"graph","created_at":"2026-07-04T16:50:17Z","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/quant-ph/0405023/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bart De Moor, Jeroen Dehaene, Maarten Van den Nest","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2004-05-05T09:59:20Z","title":"An efficient algorithm to recognize local Clifford equivalence of graph states"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0405023","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:4147f774210e046efc92ae9b6e4926ec2d77bf5d8ca33fcb65a78e3d8d5bbdfe","target":"record","created_at":"2026-07-04T16:50:17Z","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":"d01db4bfe673a228cf6a9ef5f2938ca16e0662a9caa7de9be75d66048ca297fc","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-05-05T09:59:20Z","title_canon_sha256":"b6610b8dd1c74f69794e7233d2aacdcd1015ace414a56904906bfa554085cddf"},"schema_version":"1.0","source":{"id":"quant-ph/0405023","kind":"arxiv","version":2}},"canonical_sha256":"70de20f6374882d55eb050de8faeccfc2e279058db0fd0591e11cb28404c9fdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70de20f6374882d55eb050de8faeccfc2e279058db0fd0591e11cb28404c9fdd","first_computed_at":"2026-07-04T16:50:17.241595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T16:50:17.241595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZX2TmP2EaIMvS/9JAuXR6T4gz9w+7W1qv0x6xjL809AwETc+5X55EKsDSzClh/m2+vlYLUQG5xKc1qbrGzlmCA==","signature_status":"signed_v1","signed_at":"2026-07-04T16:50:17.242030Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0405023","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4147f774210e046efc92ae9b6e4926ec2d77bf5d8ca33fcb65a78e3d8d5bbdfe","sha256:44db9d360984ccc8daacb1e168f53c1a473f445392565a0cff2625daca3cd98c"],"state_sha256":"39bdabf42cbe4ddd32b803e20bde7ca0495e997f0f1f8f54391b59b01737f580"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hov4tLqm1LBqTNFmLV/ooszECKIjfIDZGTPDEkLUI1+vNX/7eWnrqz8qtm3LWt0ba4qnHCvC/v9iUZdvUijqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T07:38:44.730133Z","bundle_sha256":"a73d59ead8f8eb7092c469ce4437b4957bcc1a0f75c7f9d43d6d761066d8a86e"}}