{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1997:5TF4SXHXTSATYJPRTFMYSYSDJM","short_pith_number":"pith:5TF4SXHX","canonical_record":{"source":{"id":"quant-ph/9704027","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-04-14T23:15:05Z","cross_cats_sorted":[],"title_canon_sha256":"89e1abcf087c5fca253a7ad2a1707e31c6274f29f0b89ee327ea5875bcd679f0","abstract_canon_sha256":"7140d386dd56389e9ef69f52d536b16a37d4bb7a8b336470179b970b22bc9d44"},"schema_version":"1.0"},"canonical_sha256":"eccbc95cf79c813c25f199598962434b30fdc8a002e77a5f840a179ee0c41414","source":{"kind":"arxiv","id":"quant-ph/9704027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9704027","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9704027v1","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9704027","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"5TF4SXHXTSAT","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_16","alias_value":"5TF4SXHXTSATYJPR","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_8","alias_value":"5TF4SXHX","created_at":"2026-05-18T12:25:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1997:5TF4SXHXTSATYJPRTFMYSYSDJM","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/9704027","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-04-14T23:15:05Z","cross_cats_sorted":[],"title_canon_sha256":"89e1abcf087c5fca253a7ad2a1707e31c6274f29f0b89ee327ea5875bcd679f0","abstract_canon_sha256":"7140d386dd56389e9ef69f52d536b16a37d4bb7a8b336470179b970b22bc9d44"},"schema_version":"1.0"},"canonical_sha256":"eccbc95cf79c813c25f199598962434b30fdc8a002e77a5f840a179ee0c41414","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:26.434246Z","signature_b64":"7tsRyH6AcgXoMv02u04WQtqrbsJ7RFqrB/iL9FdL6PHyxic/SMisWnvLq2xeIYT2Js/39g3wE6g3WQyYyfEOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eccbc95cf79c813c25f199598962434b30fdc8a002e77a5f840a179ee0c41414","last_reissued_at":"2026-05-18T00:53:26.433863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:26.433863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/9704027","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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDem8vkP6oKz3EyQ1Z/xmSwdl25Gjp0MUQXxmNXlzCq9vbgzTIws7bHYYHVpy4Xxt609rqy6RrEAqtJeftnzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:53:17.244342Z"},"content_sha256":"21f1c365fb56aaab60033fd0a16b35e3c570542169209675d383792e5910ee89","schema_version":"1.0","event_id":"sha256:21f1c365fb56aaab60033fd0a16b35e3c570542169209675d383792e5910ee89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1997:5TF4SXHXTSATYJPRTFMYSYSDJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exact Quantum Polynomial-Time Algorithm for Simon's Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gilles Brassard (Universite de Montreal), Peter Hoyer (Odense University)","submitted_at":"1997-04-14T23:15:05Z","abstract_excerpt":"We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the worst-case running time. This is achieved by generalizing both Simon's and Grover's algorithms and combining them in a novel way. It follows that there is a decision problem that can be solved in exact quant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9704027","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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KzsLDUymbcsWL1UKx7RgTp03NKmJqVuA2WibrN2ZGq2HO/BNijdGXxuQ9qbjIAHNK8LumiO9lF6NplvR2gWdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:53:17.244699Z"},"content_sha256":"ab712e13e97d6b35e7e5de0907ecd44e0e37c29bf279a23bcadd740313c0d615","schema_version":"1.0","event_id":"sha256:ab712e13e97d6b35e7e5de0907ecd44e0e37c29bf279a23bcadd740313c0d615"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/bundle.json","state_url":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/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-09T14:53:17Z","links":{"resolver":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM","bundle":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/bundle.json","state":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1997:5TF4SXHXTSATYJPRTFMYSYSDJM","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":"7140d386dd56389e9ef69f52d536b16a37d4bb7a8b336470179b970b22bc9d44","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1997-04-14T23:15:05Z","title_canon_sha256":"89e1abcf087c5fca253a7ad2a1707e31c6274f29f0b89ee327ea5875bcd679f0"},"schema_version":"1.0","source":{"id":"quant-ph/9704027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9704027","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9704027v1","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9704027","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"5TF4SXHXTSAT","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_16","alias_value":"5TF4SXHXTSATYJPR","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_8","alias_value":"5TF4SXHX","created_at":"2026-05-18T12:25:48Z"}],"graph_snapshots":[{"event_id":"sha256:ab712e13e97d6b35e7e5de0907ecd44e0e37c29bf279a23bcadd740313c0d615","target":"graph","created_at":"2026-05-18T00:53:26Z","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 investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the worst-case running time. This is achieved by generalizing both Simon's and Grover's algorithms and combining them in a novel way. It follows that there is a decision problem that can be solved in exact quant","authors_text":"Gilles Brassard (Universite de Montreal), Peter Hoyer (Odense University)","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"1997-04-14T23:15:05Z","title":"An Exact Quantum Polynomial-Time Algorithm for Simon's Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9704027","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:21f1c365fb56aaab60033fd0a16b35e3c570542169209675d383792e5910ee89","target":"record","created_at":"2026-05-18T00:53:26Z","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":"7140d386dd56389e9ef69f52d536b16a37d4bb7a8b336470179b970b22bc9d44","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1997-04-14T23:15:05Z","title_canon_sha256":"89e1abcf087c5fca253a7ad2a1707e31c6274f29f0b89ee327ea5875bcd679f0"},"schema_version":"1.0","source":{"id":"quant-ph/9704027","kind":"arxiv","version":1}},"canonical_sha256":"eccbc95cf79c813c25f199598962434b30fdc8a002e77a5f840a179ee0c41414","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eccbc95cf79c813c25f199598962434b30fdc8a002e77a5f840a179ee0c41414","first_computed_at":"2026-05-18T00:53:26.433863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:26.433863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7tsRyH6AcgXoMv02u04WQtqrbsJ7RFqrB/iL9FdL6PHyxic/SMisWnvLq2xeIYT2Js/39g3wE6g3WQyYyfEOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:26.434246Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/9704027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21f1c365fb56aaab60033fd0a16b35e3c570542169209675d383792e5910ee89","sha256:ab712e13e97d6b35e7e5de0907ecd44e0e37c29bf279a23bcadd740313c0d615"],"state_sha256":"28d310b9b5758fc0f1c69cb8918e7a3fc9d54983e89b4524b096aa22dc54674c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SqUbzmdQvYKfoJdkoXk4luM5jcQ3QiHcHIrW5uqRhpYtXHLs3661woEFFtfkpbFYknaWKZANLHB5J/wUaFi0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:53:17.246697Z","bundle_sha256":"502357f90898f3f70ba5e7441c8886623709cd731322114c47257be931aeefc8"}}