{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:JY6BOBYDGOW66ATNU5MGOJCXOQ","short_pith_number":"pith:JY6BOBYD","schema_version":"1.0","canonical_sha256":"4e3c17070333adef026da7586724577417400064505b15c5faeb613b078251c0","source":{"kind":"arxiv","id":"quant-ph/9902053","version":1},"attestation_state":"computed","paper":{"title":"A better lower bound for quantum algorithms searching an ordered list","license":"","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"1999-02-14T01:20:11Z","abstract_excerpt":"We show that any quantum algorithm searching an ordered list of n elements needs to examine at least 1/12 log n-O(1) of them. Classically, log n queries are both necessary and sufficient. This shows that quantum algorithms can achieve only a constant speedup for this problem. Our result improves lower bounds of Buhrman and de Wolf(quant-ph/9811046) and Farhi, Goldstone, Gutmann and Sipser (quant-ph/9812057)."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/9902053","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-02-14T01:20:11Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"7a783f917c1fae97093af356ae9bc6fde35ccd4dfe88297188aee9b120173df7","abstract_canon_sha256":"5ec2a6247d199d140dd5e276a0ad3e099ac8d0aaf23f45fa437e8ba0f72cb3b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:24.086777Z","signature_b64":"XZugYHFsC4K634QSrYjJTHRsrdOwrEwTYKlSVCYg6Rvj527gHvrLdynd9VYeNUf9BHh0eAyRr/M9zQZSSnKbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e3c17070333adef026da7586724577417400064505b15c5faeb613b078251c0","last_reissued_at":"2026-07-04T14:47:24.086441Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:24.086441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A better lower bound for quantum algorithms searching an ordered list","license":"","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"1999-02-14T01:20:11Z","abstract_excerpt":"We show that any quantum algorithm searching an ordered list of n elements needs to examine at least 1/12 log n-O(1) of them. Classically, log n queries are both necessary and sufficient. This shows that quantum algorithms can achieve only a constant speedup for this problem. Our result improves lower bounds of Buhrman and de Wolf(quant-ph/9811046) and Farhi, Goldstone, Gutmann and Sipser (quant-ph/9812057)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9902053","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9902053/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9902053","created_at":"2026-07-04T14:47:24.086501+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9902053v1","created_at":"2026-07-04T14:47:24.086501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9902053","created_at":"2026-07-04T14:47:24.086501+00:00"},{"alias_kind":"pith_short_12","alias_value":"JY6BOBYDGOW6","created_at":"2026-07-04T14:47:24.086501+00:00"},{"alias_kind":"pith_short_16","alias_value":"JY6BOBYDGOW66ATN","created_at":"2026-07-04T14:47:24.086501+00:00"},{"alias_kind":"pith_short_8","alias_value":"JY6BOBYD","created_at":"2026-07-04T14:47:24.086501+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JY6BOBYDGOW66ATNU5MGOJCXOQ","json":"https://pith.science/pith/JY6BOBYDGOW66ATNU5MGOJCXOQ.json","graph_json":"https://pith.science/api/pith-number/JY6BOBYDGOW66ATNU5MGOJCXOQ/graph.json","events_json":"https://pith.science/api/pith-number/JY6BOBYDGOW66ATNU5MGOJCXOQ/events.json","paper":"https://pith.science/paper/JY6BOBYD"},"agent_actions":{"view_html":"https://pith.science/pith/JY6BOBYDGOW66ATNU5MGOJCXOQ","download_json":"https://pith.science/pith/JY6BOBYDGOW66ATNU5MGOJCXOQ.json","view_paper":"https://pith.science/paper/JY6BOBYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9902053&json=true","fetch_graph":"https://pith.science/api/pith-number/JY6BOBYDGOW66ATNU5MGOJCXOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JY6BOBYDGOW66ATNU5MGOJCXOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JY6BOBYDGOW66ATNU5MGOJCXOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JY6BOBYDGOW66ATNU5MGOJCXOQ/action/storage_attestation","attest_author":"https://pith.science/pith/JY6BOBYDGOW66ATNU5MGOJCXOQ/action/author_attestation","sign_citation":"https://pith.science/pith/JY6BOBYDGOW66ATNU5MGOJCXOQ/action/citation_signature","submit_replication":"https://pith.science/pith/JY6BOBYDGOW66ATNU5MGOJCXOQ/action/replication_record"}},"created_at":"2026-07-04T14:47:24.086501+00:00","updated_at":"2026-07-04T14:47:24.086501+00:00"}