{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Z5CEG7YIXYDGANN43UH7RNOQVN","short_pith_number":"pith:Z5CEG7YI","canonical_record":{"source":{"id":"1207.1712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-06T19:25:16Z","cross_cats_sorted":[],"title_canon_sha256":"2e1c196bc64945a959f27499de0e737f789ce7e835da67cce38861140888b866","abstract_canon_sha256":"037055e93a0b4997e35c9e5a55b9252e5bfb768672e30b1caf87d67aa612dabf"},"schema_version":"1.0"},"canonical_sha256":"cf44437f08be066035bcdd0ff8b5d0ab5d5b932d6cdf572dc63475e887b63ad1","source":{"kind":"arxiv","id":"1207.1712","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1712","created_at":"2026-05-18T03:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1712v2","created_at":"2026-05-18T03:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1712","created_at":"2026-05-18T03:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"Z5CEG7YIXYDG","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z5CEG7YIXYDGANN4","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z5CEG7YI","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Z5CEG7YIXYDGANN43UH7RNOQVN","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-06T19:25:16Z","cross_cats_sorted":[],"title_canon_sha256":"2e1c196bc64945a959f27499de0e737f789ce7e835da67cce38861140888b866","abstract_canon_sha256":"037055e93a0b4997e35c9e5a55b9252e5bfb768672e30b1caf87d67aa612dabf"},"schema_version":"1.0"},"canonical_sha256":"cf44437f08be066035bcdd0ff8b5d0ab5d5b932d6cdf572dc63475e887b63ad1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:23:03.862395Z","signature_b64":"+u85JZmA2+l7L/ZM0uBtlolvyxHDoaPexoo94LKdNYMqPO+K+Jwdj3jq97ucjKLcVGi2LKf+k5EuazV6kvEPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf44437f08be066035bcdd0ff8b5d0ab5d5b932d6cdf572dc63475e887b63ad1","last_reissued_at":"2026-05-18T03:23:03.861823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:23:03.861823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1712","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-18T03:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uv/HTnw6/0fUydzFYeQM0H41JoLCtqjuuSSFb4IcQviV7jQU+BOa2pKtybvc/rZn8hLznYYnb49q2pcDAjpdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:56:09.685170Z"},"content_sha256":"eaaccf0334718f2eeaaf6dfaf64faca3ab5bb0f0c4a27406f45870acc3647146","schema_version":"1.0","event_id":"sha256:eaaccf0334718f2eeaaf6dfaf64faca3ab5bb0f0c4a27406f45870acc3647146"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Z5CEG7YIXYDGANN43UH7RNOQVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the Graph Isomorphism Problem with a Quantum Annealer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. P. Young, Itay Hen","submitted_at":"2012-07-06T19:25:16Z","abstract_excerpt":"We propose a novel method using a quantum annealer -- an analog quantum computer based on the principles of quantum adiabatic evolution -- to solve the Graph Isomorphism problem, in which one has to determine whether two graphs are isomorphic (i.e., can be transformed into each other simply by a relabeling of the vertices). We demonstrate the capabilities of the method by analyzing several types of graph families, focusing on graphs with particularly high symmetry called strongly regular graphs (SRG's). We also show that our method is applicable, within certain limitations, to currently availa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1712","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-18T03:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBTwa4G3BKDDJ6500vXZm0APcK1YOks3OYsTRVbbiuLL2zC15hZC21BuNmHXKWKIUzUw6sYcMWsiytwrA7rVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:56:09.685854Z"},"content_sha256":"d29336b5477d9e6e93f6a240f6ef4296861af7411423f64cb6edd7c777663914","schema_version":"1.0","event_id":"sha256:d29336b5477d9e6e93f6a240f6ef4296861af7411423f64cb6edd7c777663914"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z5CEG7YIXYDGANN43UH7RNOQVN/bundle.json","state_url":"https://pith.science/pith/Z5CEG7YIXYDGANN43UH7RNOQVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z5CEG7YIXYDGANN43UH7RNOQVN/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-06T19:56:09Z","links":{"resolver":"https://pith.science/pith/Z5CEG7YIXYDGANN43UH7RNOQVN","bundle":"https://pith.science/pith/Z5CEG7YIXYDGANN43UH7RNOQVN/bundle.json","state":"https://pith.science/pith/Z5CEG7YIXYDGANN43UH7RNOQVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z5CEG7YIXYDGANN43UH7RNOQVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Z5CEG7YIXYDGANN43UH7RNOQVN","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":"037055e93a0b4997e35c9e5a55b9252e5bfb768672e30b1caf87d67aa612dabf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-06T19:25:16Z","title_canon_sha256":"2e1c196bc64945a959f27499de0e737f789ce7e835da67cce38861140888b866"},"schema_version":"1.0","source":{"id":"1207.1712","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1712","created_at":"2026-05-18T03:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1712v2","created_at":"2026-05-18T03:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1712","created_at":"2026-05-18T03:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"Z5CEG7YIXYDG","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z5CEG7YIXYDGANN4","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z5CEG7YI","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:d29336b5477d9e6e93f6a240f6ef4296861af7411423f64cb6edd7c777663914","target":"graph","created_at":"2026-05-18T03:23:03Z","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":"We propose a novel method using a quantum annealer -- an analog quantum computer based on the principles of quantum adiabatic evolution -- to solve the Graph Isomorphism problem, in which one has to determine whether two graphs are isomorphic (i.e., can be transformed into each other simply by a relabeling of the vertices). We demonstrate the capabilities of the method by analyzing several types of graph families, focusing on graphs with particularly high symmetry called strongly regular graphs (SRG's). We also show that our method is applicable, within certain limitations, to currently availa","authors_text":"A. P. Young, Itay Hen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-06T19:25:16Z","title":"Solving the Graph Isomorphism Problem with a Quantum Annealer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1712","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:eaaccf0334718f2eeaaf6dfaf64faca3ab5bb0f0c4a27406f45870acc3647146","target":"record","created_at":"2026-05-18T03:23:03Z","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":"037055e93a0b4997e35c9e5a55b9252e5bfb768672e30b1caf87d67aa612dabf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-06T19:25:16Z","title_canon_sha256":"2e1c196bc64945a959f27499de0e737f789ce7e835da67cce38861140888b866"},"schema_version":"1.0","source":{"id":"1207.1712","kind":"arxiv","version":2}},"canonical_sha256":"cf44437f08be066035bcdd0ff8b5d0ab5d5b932d6cdf572dc63475e887b63ad1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf44437f08be066035bcdd0ff8b5d0ab5d5b932d6cdf572dc63475e887b63ad1","first_computed_at":"2026-05-18T03:23:03.861823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:23:03.861823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+u85JZmA2+l7L/ZM0uBtlolvyxHDoaPexoo94LKdNYMqPO+K+Jwdj3jq97ucjKLcVGi2LKf+k5EuazV6kvEPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:23:03.862395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1712","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eaaccf0334718f2eeaaf6dfaf64faca3ab5bb0f0c4a27406f45870acc3647146","sha256:d29336b5477d9e6e93f6a240f6ef4296861af7411423f64cb6edd7c777663914"],"state_sha256":"526dc2191b620d5599800326ae591f9315b3f38970bf369477f34fbfa85e79a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvfqGNNAfVo3v1MPo8G223P4f3CrSXQ+9ixQ1KgGAGeE70mjOZRdYrNpN9epkpZsf0PYB2gYQjBEyd1OghWbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:56:09.690294Z","bundle_sha256":"37b16b3818cd1aa7b4a3c2a11bcfd699e83b132112c98e03e5511dd280813e38"}}