{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HXQBEA7VLWOT6JWMNFJGHTN6FV","short_pith_number":"pith:HXQBEA7V","canonical_record":{"source":{"id":"1805.05306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-14T17:33:09Z","cross_cats_sorted":["cs.CC","cs.DS","cs.ET","math.CO"],"title_canon_sha256":"659a398bf1482d0df0e38968f92a15b0052be48c8e757e79e0d4c6296273cfe6","abstract_canon_sha256":"3e4034c2727b03718a742f42769e8fd92b1eb836128dc9deec8effed94b4b062"},"schema_version":"1.0"},"canonical_sha256":"3de01203f55d9d3f26cc695263cdbe2d67cfa6f6a3bc0d689c615369df8a76ee","source":{"kind":"arxiv","id":"1805.05306","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05306","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05306v2","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05306","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"HXQBEA7VLWOT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HXQBEA7VLWOT6JWM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HXQBEA7V","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HXQBEA7VLWOT6JWMNFJGHTN6FV","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-14T17:33:09Z","cross_cats_sorted":["cs.CC","cs.DS","cs.ET","math.CO"],"title_canon_sha256":"659a398bf1482d0df0e38968f92a15b0052be48c8e757e79e0d4c6296273cfe6","abstract_canon_sha256":"3e4034c2727b03718a742f42769e8fd92b1eb836128dc9deec8effed94b4b062"},"schema_version":"1.0"},"canonical_sha256":"3de01203f55d9d3f26cc695263cdbe2d67cfa6f6a3bc0d689c615369df8a76ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:53.984862Z","signature_b64":"fPscUSCoUkmTKS8vSwzF/0RGqligk/OpRVRjVF9NfNf/4W1q8nPtGTl5uCUbgsuTpbypFOC4hKUWGlnBwRSyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3de01203f55d9d3f26cc695263cdbe2d67cfa6f6a3bc0d689c615369df8a76ee","last_reissued_at":"2026-05-18T00:15:53.984204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:53.984204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05306","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-05-18T00:15:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bz1TlTd2+5mO8e/nJFDAzJotft5AWtZ2EAgysZ+RzJTxFRZtawmhLodRcIOzkWj2ET1V95/P8c5B8jPImAzOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:30:16.323355Z"},"content_sha256":"824c14211c11fac43f1e3ea6887e4bb82247a05baeb45293b0ac6358d7bee707","schema_version":"1.0","event_id":"sha256:824c14211c11fac43f1e3ea6887e4bb82247a05baeb45293b0ac6358d7bee707"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HXQBEA7VLWOT6JWMNFJGHTN6FV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to transform graph states using single-qubit operations: computational complexity and algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.ET","math.CO"],"primary_cat":"quant-ph","authors_text":"Axel Dahlberg, Jonas Helsen, Stephanie Wehner","submitted_at":"2018-05-14T17:33:09Z","abstract_excerpt":"Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing. Here we consider the question whether one graph (source) state can be transformed into another graph (target) state, using a specific set of quantum operations (LC+LPM+CC): single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM) and classical communication (CC) between sites holding the individual qubits. We first show that deciding whether a graph state |G> can be transformed into another graph state |G'> using LC+LPM+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05306","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":""},"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-05-18T00:15:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nl26r3hyGkCN3unZyRCPhqnniTPMXD/C2EP7eCH0kmrnVsrIPFWPttQ8E/2t0E/qbIfd+Yn1z53Cu9UYSuzuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:30:16.323998Z"},"content_sha256":"141648a873f4ad2bc9adb2afdac58ae6e9237782256a0a4e7b8abe65db4b4c37","schema_version":"1.0","event_id":"sha256:141648a873f4ad2bc9adb2afdac58ae6e9237782256a0a4e7b8abe65db4b4c37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXQBEA7VLWOT6JWMNFJGHTN6FV/bundle.json","state_url":"https://pith.science/pith/HXQBEA7VLWOT6JWMNFJGHTN6FV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXQBEA7VLWOT6JWMNFJGHTN6FV/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-06-01T00:30:16Z","links":{"resolver":"https://pith.science/pith/HXQBEA7VLWOT6JWMNFJGHTN6FV","bundle":"https://pith.science/pith/HXQBEA7VLWOT6JWMNFJGHTN6FV/bundle.json","state":"https://pith.science/pith/HXQBEA7VLWOT6JWMNFJGHTN6FV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXQBEA7VLWOT6JWMNFJGHTN6FV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HXQBEA7VLWOT6JWMNFJGHTN6FV","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":"3e4034c2727b03718a742f42769e8fd92b1eb836128dc9deec8effed94b4b062","cross_cats_sorted":["cs.CC","cs.DS","cs.ET","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-14T17:33:09Z","title_canon_sha256":"659a398bf1482d0df0e38968f92a15b0052be48c8e757e79e0d4c6296273cfe6"},"schema_version":"1.0","source":{"id":"1805.05306","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05306","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05306v2","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05306","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"HXQBEA7VLWOT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HXQBEA7VLWOT6JWM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HXQBEA7V","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:141648a873f4ad2bc9adb2afdac58ae6e9237782256a0a4e7b8abe65db4b4c37","target":"graph","created_at":"2026-05-18T00:15:53Z","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"},"paper":{"abstract_excerpt":"Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing. Here we consider the question whether one graph (source) state can be transformed into another graph (target) state, using a specific set of quantum operations (LC+LPM+CC): single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM) and classical communication (CC) between sites holding the individual qubits. We first show that deciding whether a graph state |G> can be transformed into another graph state |G'> using LC+LPM+","authors_text":"Axel Dahlberg, Jonas Helsen, Stephanie Wehner","cross_cats":["cs.CC","cs.DS","cs.ET","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-14T17:33:09Z","title":"How to transform graph states using single-qubit operations: computational complexity and algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05306","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:824c14211c11fac43f1e3ea6887e4bb82247a05baeb45293b0ac6358d7bee707","target":"record","created_at":"2026-05-18T00:15:53Z","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":"3e4034c2727b03718a742f42769e8fd92b1eb836128dc9deec8effed94b4b062","cross_cats_sorted":["cs.CC","cs.DS","cs.ET","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-14T17:33:09Z","title_canon_sha256":"659a398bf1482d0df0e38968f92a15b0052be48c8e757e79e0d4c6296273cfe6"},"schema_version":"1.0","source":{"id":"1805.05306","kind":"arxiv","version":2}},"canonical_sha256":"3de01203f55d9d3f26cc695263cdbe2d67cfa6f6a3bc0d689c615369df8a76ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3de01203f55d9d3f26cc695263cdbe2d67cfa6f6a3bc0d689c615369df8a76ee","first_computed_at":"2026-05-18T00:15:53.984204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:53.984204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fPscUSCoUkmTKS8vSwzF/0RGqligk/OpRVRjVF9NfNf/4W1q8nPtGTl5uCUbgsuTpbypFOC4hKUWGlnBwRSyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:53.984862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05306","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:824c14211c11fac43f1e3ea6887e4bb82247a05baeb45293b0ac6358d7bee707","sha256:141648a873f4ad2bc9adb2afdac58ae6e9237782256a0a4e7b8abe65db4b4c37"],"state_sha256":"d12a1bebd77b3fd99a1dad2b8c05f8f614be8112084f16b3ce4c460862897aff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbdZ/VI/iXTmkFUCXtkCJp7aWNw997WDQnTTv8WwMN8MUB7pb8kFMPgM8A3Zu2hK5R1XHpobeprnlrufBp76AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:30:16.327295Z","bundle_sha256":"5b64867a826b8dd37ea5bf75bf4c8fb73cb4a9e3ee20f52d21a308a294405eb9"}}