{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EYJQJJ7TH7MCABVD6JMEDAYV25","short_pith_number":"pith:EYJQJJ7T","canonical_record":{"source":{"id":"1511.05647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-18T02:52:54Z","cross_cats_sorted":[],"title_canon_sha256":"84a003e78f118febaef7c12f1467bfaa248746f4283c825b3699b104fa1c67a0","abstract_canon_sha256":"42c5a8c4598093ab9e28f10fd39d44fced9191d21bfa58cbfc71d799e0f9dfec"},"schema_version":"1.0"},"canonical_sha256":"261304a7f33fd82006a3f258418315d76885bb0aeba7e54b36678aacbb423408","source":{"kind":"arxiv","id":"1511.05647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05647","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05647v1","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05647","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"EYJQJJ7TH7MC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EYJQJJ7TH7MCABVD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EYJQJJ7T","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EYJQJJ7TH7MCABVD6JMEDAYV25","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-18T02:52:54Z","cross_cats_sorted":[],"title_canon_sha256":"84a003e78f118febaef7c12f1467bfaa248746f4283c825b3699b104fa1c67a0","abstract_canon_sha256":"42c5a8c4598093ab9e28f10fd39d44fced9191d21bfa58cbfc71d799e0f9dfec"},"schema_version":"1.0"},"canonical_sha256":"261304a7f33fd82006a3f258418315d76885bb0aeba7e54b36678aacbb423408","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:16.499039Z","signature_b64":"oUWtNJitdrDRwa4THuF4e5lVpHOwfWjLVRHVIv87hQgvgmEQvvda2fxOPwmJaKgM3ERgPsLaID6gLeHyiVkYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"261304a7f33fd82006a3f258418315d76885bb0aeba7e54b36678aacbb423408","last_reissued_at":"2026-05-18T01:20:16.498376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:16.498376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05647","source_version":1,"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-18T01:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5vLH5Ray+DkFbBr+qulD8oMNi9QKhNgy+uGO89NuB5Y+dd1RRzLRCDJccpW3mHCukNSz74Lx18293JYZm6ztCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:01:24.497577Z"},"content_sha256":"8c71e24bd389ba7ab0ab24c6722231effe05cb9b106e842a7b3928ff64f42a0f","schema_version":"1.0","event_id":"sha256:8c71e24bd389ba7ab0ab24c6722231effe05cb9b106e842a7b3928ff64f42a0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EYJQJJ7TH7MCABVD6JMEDAYV25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the relation between a graph code and a graph state","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jun Heo, Yongsoo Hwang","submitted_at":"2015-11-18T02:52:54Z","abstract_excerpt":"A graph state and a graph code respectively are defined based on a mathematical simple graph. In this work, we examine a relation between a graph state and a graph code both obtained from the same graph, and show that a graph state is a superposition of logical qubits of the related graph code. By using the relation, we first discuss that a local complementation which has been used for a graph state can be useful for searching locally equivalent stabilizer codes, and second provide a method to find a stabilizer group of a graph code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05647","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":""},"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-18T01:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkIfBXhsLryn50sK5SsdfsgUlFr/9RDzzCYNSD/ShnyXGqsqyCJ6ZhpIL94ucLOTvfOM5n2LUpWcM+SDnihcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:01:24.497938Z"},"content_sha256":"2fc16078f65c0ceeb7056884665d31f649504e9539b9c62077a24822b05555d7","schema_version":"1.0","event_id":"sha256:2fc16078f65c0ceeb7056884665d31f649504e9539b9c62077a24822b05555d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYJQJJ7TH7MCABVD6JMEDAYV25/bundle.json","state_url":"https://pith.science/pith/EYJQJJ7TH7MCABVD6JMEDAYV25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYJQJJ7TH7MCABVD6JMEDAYV25/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-24T02:01:24Z","links":{"resolver":"https://pith.science/pith/EYJQJJ7TH7MCABVD6JMEDAYV25","bundle":"https://pith.science/pith/EYJQJJ7TH7MCABVD6JMEDAYV25/bundle.json","state":"https://pith.science/pith/EYJQJJ7TH7MCABVD6JMEDAYV25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYJQJJ7TH7MCABVD6JMEDAYV25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EYJQJJ7TH7MCABVD6JMEDAYV25","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":"42c5a8c4598093ab9e28f10fd39d44fced9191d21bfa58cbfc71d799e0f9dfec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-18T02:52:54Z","title_canon_sha256":"84a003e78f118febaef7c12f1467bfaa248746f4283c825b3699b104fa1c67a0"},"schema_version":"1.0","source":{"id":"1511.05647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05647","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05647v1","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05647","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"EYJQJJ7TH7MC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EYJQJJ7TH7MCABVD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EYJQJJ7T","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:2fc16078f65c0ceeb7056884665d31f649504e9539b9c62077a24822b05555d7","target":"graph","created_at":"2026-05-18T01:20:16Z","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":"A graph state and a graph code respectively are defined based on a mathematical simple graph. In this work, we examine a relation between a graph state and a graph code both obtained from the same graph, and show that a graph state is a superposition of logical qubits of the related graph code. By using the relation, we first discuss that a local complementation which has been used for a graph state can be useful for searching locally equivalent stabilizer codes, and second provide a method to find a stabilizer group of a graph code.","authors_text":"Jun Heo, Yongsoo Hwang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-18T02:52:54Z","title":"On the relation between a graph code and a graph state"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05647","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:8c71e24bd389ba7ab0ab24c6722231effe05cb9b106e842a7b3928ff64f42a0f","target":"record","created_at":"2026-05-18T01:20:16Z","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":"42c5a8c4598093ab9e28f10fd39d44fced9191d21bfa58cbfc71d799e0f9dfec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-18T02:52:54Z","title_canon_sha256":"84a003e78f118febaef7c12f1467bfaa248746f4283c825b3699b104fa1c67a0"},"schema_version":"1.0","source":{"id":"1511.05647","kind":"arxiv","version":1}},"canonical_sha256":"261304a7f33fd82006a3f258418315d76885bb0aeba7e54b36678aacbb423408","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"261304a7f33fd82006a3f258418315d76885bb0aeba7e54b36678aacbb423408","first_computed_at":"2026-05-18T01:20:16.498376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:16.498376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oUWtNJitdrDRwa4THuF4e5lVpHOwfWjLVRHVIv87hQgvgmEQvvda2fxOPwmJaKgM3ERgPsLaID6gLeHyiVkYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:16.499039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c71e24bd389ba7ab0ab24c6722231effe05cb9b106e842a7b3928ff64f42a0f","sha256:2fc16078f65c0ceeb7056884665d31f649504e9539b9c62077a24822b05555d7"],"state_sha256":"5c2195890457a99f13d3c5ade1c1bca66b39896129567cad01e0ae2d0b5c5225"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJjBkm9v9w8gZdWTC3JSCzxMs1sNi3QZGmBOuzLzVp89ZipldXE2q0cbz6+yc+a5BF1o+tSQ+i7p83JD7D1JDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:01:24.499874Z","bundle_sha256":"7a55451da624c2df8264aed191991ae63d90be7f749dee900fa5a9c165a0a257"}}