{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:ZAIXIK4E33MVGI5HUCZ3HV6Q24","short_pith_number":"pith:ZAIXIK4E","canonical_record":{"source":{"id":"quant-ph/0401083","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-01-14T21:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"e9223e2e1ea891e3c04780258b9aba75df46f45635cf98aa5d1cd2fab02085da","abstract_canon_sha256":"e93eb6a8f7525343f1999326bed5ace8cf95b24ea3929d00104b7f855cae334f"},"schema_version":"1.0"},"canonical_sha256":"c811742b84ded95323a7a0b3b3d7d0d72536477cc8a40e15d1efcc8dac4de899","source":{"kind":"arxiv","id":"quant-ph/0401083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0401083","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0401083v1","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0401083","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZAIXIK4E33MV","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZAIXIK4E33MVGI5H","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZAIXIK4E","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:ZAIXIK4E33MVGI5HUCZ3HV6Q24","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0401083","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-01-14T21:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"e9223e2e1ea891e3c04780258b9aba75df46f45635cf98aa5d1cd2fab02085da","abstract_canon_sha256":"e93eb6a8f7525343f1999326bed5ace8cf95b24ea3929d00104b7f855cae334f"},"schema_version":"1.0"},"canonical_sha256":"c811742b84ded95323a7a0b3b3d7d0d72536477cc8a40e15d1efcc8dac4de899","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:45.901504Z","signature_b64":"rnqf/MIkGagtURq5dO8tY2TMS8FD/fJLh8S+nUA2o08bTHNSKzAZQWQa09ekKBvHujv+awDQ76UFvM6mTVTdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c811742b84ded95323a7a0b3b3d7d0d72536477cc8a40e15d1efcc8dac4de899","last_reissued_at":"2026-05-18T00:53:45.900885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:45.900885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0401083","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-18T00:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QhOeGFWu2dd3wWX6XF+SNS/bnQ8Oj1obrticD1LpjTEw30b1YoZkhi3jsGJlOWhRKm++NURQhbimYEpMgaGHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:49:32.925641Z"},"content_sha256":"979bc186647772d56611e98d8b93ff9955005d19b26250fdcd38b91116f4ccd6","schema_version":"1.0","event_id":"sha256:979bc186647772d56611e98d8b93ff9955005d19b26250fdcd38b91116f4ccd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:ZAIXIK4E33MVGI5HUCZ3HV6Q24","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The quantum query complexity of the hidden subgroup problem is polynomial","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Emanuel Knill, Mark Ettinger, Peter Hoyer","submitted_at":"2004-01-14T21:26:38Z","abstract_excerpt":"We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm. However our quantum algorithm requires exponential time, as in the classical case. Our algorithm utilizes a new technique for constructing error-free algorithms for non-decision problems on quantum computers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0401083","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-18T00:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dD6aP9B0VYCbvekID7e4VXEQjUmY1kW2N4/ERS25gV/5jpvQ2iCij+SW3bQLu4WA56087FIFnGR2N9QwC9Y5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:49:32.926271Z"},"content_sha256":"d4c639ada6ffead0023929dfcbaa224e9464d5c4171e52b2ba79e1a60f98b113","schema_version":"1.0","event_id":"sha256:d4c639ada6ffead0023929dfcbaa224e9464d5c4171e52b2ba79e1a60f98b113"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/bundle.json","state_url":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/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-07T13:49:32Z","links":{"resolver":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24","bundle":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/bundle.json","state":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:ZAIXIK4E33MVGI5HUCZ3HV6Q24","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":"e93eb6a8f7525343f1999326bed5ace8cf95b24ea3929d00104b7f855cae334f","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-01-14T21:26:38Z","title_canon_sha256":"e9223e2e1ea891e3c04780258b9aba75df46f45635cf98aa5d1cd2fab02085da"},"schema_version":"1.0","source":{"id":"quant-ph/0401083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0401083","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0401083v1","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0401083","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZAIXIK4E33MV","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZAIXIK4E33MVGI5H","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZAIXIK4E","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:d4c639ada6ffead0023929dfcbaa224e9464d5c4171e52b2ba79e1a60f98b113","target":"graph","created_at":"2026-05-18T00:53:45Z","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 present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm. However our quantum algorithm requires exponential time, as in the classical case. Our algorithm utilizes a new technique for constructing error-free algorithms for non-decision problems on quantum computers.","authors_text":"Emanuel Knill, Mark Ettinger, Peter Hoyer","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2004-01-14T21:26:38Z","title":"The quantum query complexity of the hidden subgroup problem is polynomial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0401083","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:979bc186647772d56611e98d8b93ff9955005d19b26250fdcd38b91116f4ccd6","target":"record","created_at":"2026-05-18T00:53:45Z","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":"e93eb6a8f7525343f1999326bed5ace8cf95b24ea3929d00104b7f855cae334f","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-01-14T21:26:38Z","title_canon_sha256":"e9223e2e1ea891e3c04780258b9aba75df46f45635cf98aa5d1cd2fab02085da"},"schema_version":"1.0","source":{"id":"quant-ph/0401083","kind":"arxiv","version":1}},"canonical_sha256":"c811742b84ded95323a7a0b3b3d7d0d72536477cc8a40e15d1efcc8dac4de899","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c811742b84ded95323a7a0b3b3d7d0d72536477cc8a40e15d1efcc8dac4de899","first_computed_at":"2026-05-18T00:53:45.900885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:45.900885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rnqf/MIkGagtURq5dO8tY2TMS8FD/fJLh8S+nUA2o08bTHNSKzAZQWQa09ekKBvHujv+awDQ76UFvM6mTVTdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:45.901504Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0401083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:979bc186647772d56611e98d8b93ff9955005d19b26250fdcd38b91116f4ccd6","sha256:d4c639ada6ffead0023929dfcbaa224e9464d5c4171e52b2ba79e1a60f98b113"],"state_sha256":"7608bb03f1711138deafcbf5766718335b46ab9381421f07cf5dcc1f461ceb31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yk/Pk7fNKDsNXhUM1F/LHPzxXVarrxuVuUMwevBAYR0waV78cZZ2SW9yK5nK8o7y0B/2H5kD28YnC/ruBNOMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T13:49:32.930106Z","bundle_sha256":"196f62322e4db1c4d3beb96c6b5637bd1a6a95f5dd6db741b2b053360c1e61c1"}}