{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QEP24HAQQTWBTJHAREQAKOYRQX","short_pith_number":"pith:QEP24HAQ","canonical_record":{"source":{"id":"1901.06530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-19T14:17:16Z","cross_cats_sorted":[],"title_canon_sha256":"a2472fe747fd16df2ca95878f5f5c8f5675b0665a9f2973f6135face9d01c72d","abstract_canon_sha256":"3159b9a3816a25c0fb15ea8ec23e51cd2597bef44da3de04e29a05dfce46a6c1"},"schema_version":"1.0"},"canonical_sha256":"811fae1c1084ec19a4e08920053b1185edc808817382676a62bc76d454e2050b","source":{"kind":"arxiv","id":"1901.06530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06530","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06530v1","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06530","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"QEP24HAQQTWB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QEP24HAQQTWBTJHA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QEP24HAQ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QEP24HAQQTWBTJHAREQAKOYRQX","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-19T14:17:16Z","cross_cats_sorted":[],"title_canon_sha256":"a2472fe747fd16df2ca95878f5f5c8f5675b0665a9f2973f6135face9d01c72d","abstract_canon_sha256":"3159b9a3816a25c0fb15ea8ec23e51cd2597bef44da3de04e29a05dfce46a6c1"},"schema_version":"1.0"},"canonical_sha256":"811fae1c1084ec19a4e08920053b1185edc808817382676a62bc76d454e2050b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:49.959896Z","signature_b64":"ABLD90mg6mazFkZeEq18BOrk3zj2cvKKa8L2V8klw2GcAzmiRrSHt2gKneH7gNmBwYMBpaU3Anc7SErIMFkXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"811fae1c1084ec19a4e08920053b1185edc808817382676a62bc76d454e2050b","last_reissued_at":"2026-05-17T23:55:49.959240Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:49.959240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06530","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-17T23:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p3iqrw4ObT5r71XRfEet5pOM5SzO4NE+7PqioAPivGMTfdti0ZR1YHVpoUOnMNWdYT9JaPioQaNEOlYqRCSFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:39:47.807413Z"},"content_sha256":"794b07a14633e33b78c6c5384516f8aba929bca1e762c9fe31eb78b0c9be8d7a","schema_version":"1.0","event_id":"sha256:794b07a14633e33b78c6c5384516f8aba929bca1e762c9fe31eb78b0c9be8d7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QEP24HAQQTWBTJHAREQAKOYRQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The quantum algorithm for graph isomorphism problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hanwu Chen, Xi Li","submitted_at":"2019-01-19T14:17:16Z","abstract_excerpt":"The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph $G_1$ that transforms $G_1$ to another given graph $G_2$ and preserves the adjacency. In this work, we propose a quantum algorithm to determine whether there exists such a permutation. To find such a permutation, we introduce isomorphic equivalent graphs of the given graphs to be tested. We proof that the GI problem of the equivalent graphs is equivalent to the GI problem of the given graphs. The idea of the algorithm is to determine whether there exists a permutation can trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06530","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-17T23:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xkp2SalgdgpcmsPZHF3jChZVFhlrufq8lTGN+9yHEYf3+Tj/rptOydGef1uZsju3QzxzTs2V5gRo3gxFtApwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:39:47.807827Z"},"content_sha256":"8800f48a0718b9d527873afebaed247e325efbcf9b245f1ea15e795152546472","schema_version":"1.0","event_id":"sha256:8800f48a0718b9d527873afebaed247e325efbcf9b245f1ea15e795152546472"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEP24HAQQTWBTJHAREQAKOYRQX/bundle.json","state_url":"https://pith.science/pith/QEP24HAQQTWBTJHAREQAKOYRQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEP24HAQQTWBTJHAREQAKOYRQX/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-04T19:39:47Z","links":{"resolver":"https://pith.science/pith/QEP24HAQQTWBTJHAREQAKOYRQX","bundle":"https://pith.science/pith/QEP24HAQQTWBTJHAREQAKOYRQX/bundle.json","state":"https://pith.science/pith/QEP24HAQQTWBTJHAREQAKOYRQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEP24HAQQTWBTJHAREQAKOYRQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QEP24HAQQTWBTJHAREQAKOYRQX","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":"3159b9a3816a25c0fb15ea8ec23e51cd2597bef44da3de04e29a05dfce46a6c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-19T14:17:16Z","title_canon_sha256":"a2472fe747fd16df2ca95878f5f5c8f5675b0665a9f2973f6135face9d01c72d"},"schema_version":"1.0","source":{"id":"1901.06530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06530","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06530v1","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06530","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"QEP24HAQQTWB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QEP24HAQQTWBTJHA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QEP24HAQ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:8800f48a0718b9d527873afebaed247e325efbcf9b245f1ea15e795152546472","target":"graph","created_at":"2026-05-17T23:55:49Z","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":"The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph $G_1$ that transforms $G_1$ to another given graph $G_2$ and preserves the adjacency. In this work, we propose a quantum algorithm to determine whether there exists such a permutation. To find such a permutation, we introduce isomorphic equivalent graphs of the given graphs to be tested. We proof that the GI problem of the equivalent graphs is equivalent to the GI problem of the given graphs. The idea of the algorithm is to determine whether there exists a permutation can trans","authors_text":"Hanwu Chen, Xi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-19T14:17:16Z","title":"The quantum algorithm for graph isomorphism problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06530","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:794b07a14633e33b78c6c5384516f8aba929bca1e762c9fe31eb78b0c9be8d7a","target":"record","created_at":"2026-05-17T23:55:49Z","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":"3159b9a3816a25c0fb15ea8ec23e51cd2597bef44da3de04e29a05dfce46a6c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-19T14:17:16Z","title_canon_sha256":"a2472fe747fd16df2ca95878f5f5c8f5675b0665a9f2973f6135face9d01c72d"},"schema_version":"1.0","source":{"id":"1901.06530","kind":"arxiv","version":1}},"canonical_sha256":"811fae1c1084ec19a4e08920053b1185edc808817382676a62bc76d454e2050b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"811fae1c1084ec19a4e08920053b1185edc808817382676a62bc76d454e2050b","first_computed_at":"2026-05-17T23:55:49.959240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:49.959240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ABLD90mg6mazFkZeEq18BOrk3zj2cvKKa8L2V8klw2GcAzmiRrSHt2gKneH7gNmBwYMBpaU3Anc7SErIMFkXCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:49.959896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:794b07a14633e33b78c6c5384516f8aba929bca1e762c9fe31eb78b0c9be8d7a","sha256:8800f48a0718b9d527873afebaed247e325efbcf9b245f1ea15e795152546472"],"state_sha256":"491e92b67ad8087023df9df88c1fe77b0261c7ddd5b782cfe09bb069a36942b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cxTa4mWLbb+lfYttIAxRpVeQ3zJ57Pcpmu8JQdi7oNw18vghkeL8FwoLCiMwpnAIsc5td45Z+v6VK5hfm+PwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:39:47.810241Z","bundle_sha256":"9249c0d9fd54f212cf19c9123e121b03eb61b75b3886af96def298890c4a0b07"}}