{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NNYTCHMWQXSU4NFZJYEP5CF6F2","short_pith_number":"pith:NNYTCHMW","canonical_record":{"source":{"id":"1705.00760","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-02T01:50:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a957fedaf8480ed47413c469db729e1e7eef763d44c5990b87138dc082ee5023","abstract_canon_sha256":"c6127642a2967054577a095f0c9b80a1bf86996a88c5f2adfce835d74dda3c0d"},"schema_version":"1.0"},"canonical_sha256":"6b71311d9685e54e34b94e08fe88be2ea031988d68f439ab17ab2b144bf1047f","source":{"kind":"arxiv","id":"1705.00760","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00760","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00760v2","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00760","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"NNYTCHMWQXSU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NNYTCHMWQXSU4NFZ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NNYTCHMW","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NNYTCHMWQXSU4NFZJYEP5CF6F2","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00760","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-02T01:50:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a957fedaf8480ed47413c469db729e1e7eef763d44c5990b87138dc082ee5023","abstract_canon_sha256":"c6127642a2967054577a095f0c9b80a1bf86996a88c5f2adfce835d74dda3c0d"},"schema_version":"1.0"},"canonical_sha256":"6b71311d9685e54e34b94e08fe88be2ea031988d68f439ab17ab2b144bf1047f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:08.325565Z","signature_b64":"Kj3aui8z3OhdxxaVEZlQ6BPAlSSmjGHnd5aZowWwH2zw9H26+veOwJSWx+VHP6Aa7HnBH6XuPxyeT201q+D+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b71311d9685e54e34b94e08fe88be2ea031988d68f439ab17ab2b144bf1047f","last_reissued_at":"2026-05-18T00:43:08.324871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:08.324871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00760","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:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qWpMzBs6OWrNpHd/xXa4XqIp1ieFGvUz8GLo4+xOhJZwfY4mMbExHj1GVjLn1fY+vx4zmtBuN3yEFwSrqLzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:06:49.365686Z"},"content_sha256":"e0c319e882f433099d80c65e3c9f425385d29da043760a1d859d54b2fad0dbc5","schema_version":"1.0","event_id":"sha256:e0c319e882f433099d80c65e3c9f425385d29da043760a1d859d54b2fad0dbc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NNYTCHMWQXSU4NFZJYEP5CF6F2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Fourier Sampling is Guaranteed to Fail to Compute Automorphism Groups of Easy Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"Omar Shehab, Samuel J. Lomonaco Jr","submitted_at":"2017-05-02T01:50:36Z","abstract_excerpt":"The quantum hidden subgroup approach is an actively studied approach to solve combinatorial problems in quantum complexity theory. With the success of the Shor's algorithm, it was hoped that similar approach may be useful to solve the other combinatorial problems. One such problem is the graph isomorphism problem which has survived decades of efforts using the hidden subgroup approach. This paper provides a systematic approach to create arbitrarily large classes of classically efficiently solvable graph automorphism problems or easy graph automorphism problems for which hidden subgroup approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00760","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:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3yVjcMZZQs3RXVx/icGsE4QC4pnXOp2xwUMpEa9M0QpL1hCcvP8GOTdt5dsgCS5v3GpuSd1A+Op/qolZTClECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:06:49.366152Z"},"content_sha256":"50ba7351e20da2fdf162432deb0840b68e871b8b16cc576845f44e4acfaae4d3","schema_version":"1.0","event_id":"sha256:50ba7351e20da2fdf162432deb0840b68e871b8b16cc576845f44e4acfaae4d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNYTCHMWQXSU4NFZJYEP5CF6F2/bundle.json","state_url":"https://pith.science/pith/NNYTCHMWQXSU4NFZJYEP5CF6F2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNYTCHMWQXSU4NFZJYEP5CF6F2/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-05-27T21:06:49Z","links":{"resolver":"https://pith.science/pith/NNYTCHMWQXSU4NFZJYEP5CF6F2","bundle":"https://pith.science/pith/NNYTCHMWQXSU4NFZJYEP5CF6F2/bundle.json","state":"https://pith.science/pith/NNYTCHMWQXSU4NFZJYEP5CF6F2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNYTCHMWQXSU4NFZJYEP5CF6F2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NNYTCHMWQXSU4NFZJYEP5CF6F2","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":"c6127642a2967054577a095f0c9b80a1bf86996a88c5f2adfce835d74dda3c0d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-02T01:50:36Z","title_canon_sha256":"a957fedaf8480ed47413c469db729e1e7eef763d44c5990b87138dc082ee5023"},"schema_version":"1.0","source":{"id":"1705.00760","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00760","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00760v2","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00760","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"NNYTCHMWQXSU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NNYTCHMWQXSU4NFZ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NNYTCHMW","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:50ba7351e20da2fdf162432deb0840b68e871b8b16cc576845f44e4acfaae4d3","target":"graph","created_at":"2026-05-18T00:43:08Z","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 quantum hidden subgroup approach is an actively studied approach to solve combinatorial problems in quantum complexity theory. With the success of the Shor's algorithm, it was hoped that similar approach may be useful to solve the other combinatorial problems. One such problem is the graph isomorphism problem which has survived decades of efforts using the hidden subgroup approach. This paper provides a systematic approach to create arbitrarily large classes of classically efficiently solvable graph automorphism problems or easy graph automorphism problems for which hidden subgroup approac","authors_text":"Omar Shehab, Samuel J. Lomonaco Jr","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-02T01:50:36Z","title":"Quantum Fourier Sampling is Guaranteed to Fail to Compute Automorphism Groups of Easy Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00760","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:e0c319e882f433099d80c65e3c9f425385d29da043760a1d859d54b2fad0dbc5","target":"record","created_at":"2026-05-18T00:43:08Z","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":"c6127642a2967054577a095f0c9b80a1bf86996a88c5f2adfce835d74dda3c0d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-02T01:50:36Z","title_canon_sha256":"a957fedaf8480ed47413c469db729e1e7eef763d44c5990b87138dc082ee5023"},"schema_version":"1.0","source":{"id":"1705.00760","kind":"arxiv","version":2}},"canonical_sha256":"6b71311d9685e54e34b94e08fe88be2ea031988d68f439ab17ab2b144bf1047f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b71311d9685e54e34b94e08fe88be2ea031988d68f439ab17ab2b144bf1047f","first_computed_at":"2026-05-18T00:43:08.324871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:08.324871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kj3aui8z3OhdxxaVEZlQ6BPAlSSmjGHnd5aZowWwH2zw9H26+veOwJSWx+VHP6Aa7HnBH6XuPxyeT201q+D+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:08.325565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00760","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0c319e882f433099d80c65e3c9f425385d29da043760a1d859d54b2fad0dbc5","sha256:50ba7351e20da2fdf162432deb0840b68e871b8b16cc576845f44e4acfaae4d3"],"state_sha256":"6c3669ccca83f6dcf5e818b07f85f0344a27b443ddebda60048b5e56fa0023e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qE51r8J4hr2KAQz3sKpOPsvO5V13mXOrakyf7BBxliET7TD8NE3qK2egZOCh9gTexsIkw3VksD4Lb7t+2UvKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:06:49.369619Z","bundle_sha256":"d5f7d87990bd71b4376a92354c6fc2aadd2b6b3f43fff87175e479e9c5e3b270"}}