{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1996:6W7CY54O2KBHANVBBBOEW2ZWHF","short_pith_number":"pith:6W7CY54O","canonical_record":{"source":{"id":"quant-ph/9605034","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-05-23T18:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"d210da47c3ee23034178e050ed1cc79d667631f39f8d572bee39d2dbb9962137","abstract_canon_sha256":"3961481726448d72f4421d1dc6f395998d3d5e91292d99b28d4607a5ceffef54"},"schema_version":"1.0"},"canonical_sha256":"f5be2c778ed2827036a1085c4b6b36395c1f063fac0db682c115a263bb6672b7","source":{"kind":"arxiv","id":"quant-ph/9605034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9605034","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9605034v1","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9605034","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"6W7CY54O2KBH","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"6W7CY54O2KBHANVB","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"6W7CY54O","created_at":"2026-05-18T12:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1996:6W7CY54O2KBHANVBBBOEW2ZWHF","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/9605034","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-05-23T18:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"d210da47c3ee23034178e050ed1cc79d667631f39f8d572bee39d2dbb9962137","abstract_canon_sha256":"3961481726448d72f4421d1dc6f395998d3d5e91292d99b28d4607a5ceffef54"},"schema_version":"1.0"},"canonical_sha256":"f5be2c778ed2827036a1085c4b6b36395c1f063fac0db682c115a263bb6672b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:53.377615Z","signature_b64":"Ohv7gHkra2V3dmvRTnxwgFK5ixKTXuiIGlG7ER+7F6ukutdLjuNaYmeyvSScXUprjZ8neo7gaVqGVec+dhWoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5be2c778ed2827036a1085c4b6b36395c1f063fac0db682c115a263bb6672b7","last_reissued_at":"2026-05-18T01:37:53.377130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:53.377130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/9605034","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-18T01:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovj4VDXju8/LuGmSFdUbkM7ZY55dESWqPvnqspNk75yzg1TYHyPTjrddJzPwvRyJcr0AG2CPxZbdgA1HdNTfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:53:04.907621Z"},"content_sha256":"571513832bfa939619c545f419b690acd4d094f49dafa6252d2465ac1544efba","schema_version":"1.0","event_id":"sha256:571513832bfa939619c545f419b690acd4d094f49dafa6252d2465ac1544efba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1996:6W7CY54O2KBHANVBBBOEW2ZWHF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight bounds on quantum searching","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alain Tapp (Universite de Montreal), Gilles Brassard (Universite de Montreal), Michel Boyer (Universite de Montreal), Peter Hoeyer (Odense University)","submitted_at":"1996-05-23T18:26:36Z","abstract_excerpt":"We provide a tight analysis of Grover's recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine the number of iterations necessary to achieve almost certainty of finding the answer. Furthermore, we analyse the behaviour of the algorithm when the element to be found appears more than once in the table and we provide a new algorithm to find such an element even when the number of solutions is not known ahead of time. Using techniques from Shor's quantum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9605034","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-18T01:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELaDtGuVRZ3Ajis6jdZn6Z+j2W7uPn48kZwp6LfXMoPbD+oSIOQ3hkffpKFCGw5yxfUqpDkbR9JKBMMtxHt9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:53:04.908339Z"},"content_sha256":"2c4d1c419389b7f57562ef663d69352aeb86d2aaa727c3172bbdcf31ce3d9adf","schema_version":"1.0","event_id":"sha256:2c4d1c419389b7f57562ef663d69352aeb86d2aaa727c3172bbdcf31ce3d9adf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6W7CY54O2KBHANVBBBOEW2ZWHF/bundle.json","state_url":"https://pith.science/pith/6W7CY54O2KBHANVBBBOEW2ZWHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6W7CY54O2KBHANVBBBOEW2ZWHF/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-09T18:53:04Z","links":{"resolver":"https://pith.science/pith/6W7CY54O2KBHANVBBBOEW2ZWHF","bundle":"https://pith.science/pith/6W7CY54O2KBHANVBBBOEW2ZWHF/bundle.json","state":"https://pith.science/pith/6W7CY54O2KBHANVBBBOEW2ZWHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6W7CY54O2KBHANVBBBOEW2ZWHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1996:6W7CY54O2KBHANVBBBOEW2ZWHF","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":"3961481726448d72f4421d1dc6f395998d3d5e91292d99b28d4607a5ceffef54","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1996-05-23T18:26:36Z","title_canon_sha256":"d210da47c3ee23034178e050ed1cc79d667631f39f8d572bee39d2dbb9962137"},"schema_version":"1.0","source":{"id":"quant-ph/9605034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9605034","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9605034v1","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9605034","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"6W7CY54O2KBH","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"6W7CY54O2KBHANVB","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"6W7CY54O","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:2c4d1c419389b7f57562ef663d69352aeb86d2aaa727c3172bbdcf31ce3d9adf","target":"graph","created_at":"2026-05-18T01:37:53Z","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 provide a tight analysis of Grover's recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine the number of iterations necessary to achieve almost certainty of finding the answer. Furthermore, we analyse the behaviour of the algorithm when the element to be found appears more than once in the table and we provide a new algorithm to find such an element even when the number of solutions is not known ahead of time. Using techniques from Shor's quantum ","authors_text":"Alain Tapp (Universite de Montreal), Gilles Brassard (Universite de Montreal), Michel Boyer (Universite de Montreal), Peter Hoeyer (Odense University)","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"1996-05-23T18:26:36Z","title":"Tight bounds on quantum searching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9605034","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:571513832bfa939619c545f419b690acd4d094f49dafa6252d2465ac1544efba","target":"record","created_at":"2026-05-18T01:37:53Z","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":"3961481726448d72f4421d1dc6f395998d3d5e91292d99b28d4607a5ceffef54","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1996-05-23T18:26:36Z","title_canon_sha256":"d210da47c3ee23034178e050ed1cc79d667631f39f8d572bee39d2dbb9962137"},"schema_version":"1.0","source":{"id":"quant-ph/9605034","kind":"arxiv","version":1}},"canonical_sha256":"f5be2c778ed2827036a1085c4b6b36395c1f063fac0db682c115a263bb6672b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5be2c778ed2827036a1085c4b6b36395c1f063fac0db682c115a263bb6672b7","first_computed_at":"2026-05-18T01:37:53.377130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:53.377130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ohv7gHkra2V3dmvRTnxwgFK5ixKTXuiIGlG7ER+7F6ukutdLjuNaYmeyvSScXUprjZ8neo7gaVqGVec+dhWoBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:53.377615Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/9605034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:571513832bfa939619c545f419b690acd4d094f49dafa6252d2465ac1544efba","sha256:2c4d1c419389b7f57562ef663d69352aeb86d2aaa727c3172bbdcf31ce3d9adf"],"state_sha256":"25acc3341dd097fd435e48705149977587d3c1db12d0d96c6afbfe18d60c632f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fitlc8rbCvyvFyjC3lXf0Al4z514EVolZeK8D/ErOhPgbpmcAMvBEK5AZfQ//rnMmoIlqvHMbMnluyWpn+xfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:53:04.912380Z","bundle_sha256":"8397df060976b35f106f807b147e25400a8647727a65de14b42a2b9dc33dc3d0"}}