{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:UEPQWCTYXW2PCHXSD5DF4PQUXA","short_pith_number":"pith:UEPQWCTY","schema_version":"1.0","canonical_sha256":"a11f0b0a78bdb4f11ef21f465e3e14b80e3fbd439152e847b113386bd6e671ac","source":{"kind":"arxiv","id":"quant-ph/9804066","version":2},"attestation_state":"computed","paper":{"title":"The quantum query complexity of approximating the median and related statistics","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ashwin Nayak, Felix Wu","submitted_at":"1998-04-29T02:00:07Z","abstract_excerpt":"Let X = (x_0,...,x_{n-1})$ be a sequence of n numbers. For \\epsilon > 0, we say that x_i is an \\epsilon-approximate median if the number of elements strictly less than x_i, and the number of elements strictly greater than x_i are each less than (1+\\epsilon)n/2. We consider the quantum query complexity of computing an \\epsilon-approximate median, given the sequence X as an oracle. We prove a lower bound of \\Omega(\\min{{1/\\epsilon},n}) queries for any quantum algorithm that computes an \\epsilon-approximate median with any constant probability greater than 1/2. We also show how an \\epsilon-approx"},"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/9804066","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1998-04-29T02:00:07Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4512691d773ffdce224f845bab4aded11435f2b91df8756e10ca8e7ad128c728","abstract_canon_sha256":"7c2d03d3132d9610b1c4d9c3c2fb538f38b208fa24fc9ee51b8afa9ea4abc292"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:11.912951Z","signature_b64":"1IXMAaGTOy4jnu8HLdLAasqTM3vHKd9NgZa6lVb0GkF9UScHI/+RJ540doYbKhNl5kZrh7vbsc5v42BsVCwPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a11f0b0a78bdb4f11ef21f465e3e14b80e3fbd439152e847b113386bd6e671ac","last_reissued_at":"2026-07-04T14:47:11.912581Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:11.912581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The quantum query complexity of approximating the median and related statistics","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ashwin Nayak, Felix Wu","submitted_at":"1998-04-29T02:00:07Z","abstract_excerpt":"Let X = (x_0,...,x_{n-1})$ be a sequence of n numbers. For \\epsilon > 0, we say that x_i is an \\epsilon-approximate median if the number of elements strictly less than x_i, and the number of elements strictly greater than x_i are each less than (1+\\epsilon)n/2. We consider the quantum query complexity of computing an \\epsilon-approximate median, given the sequence X as an oracle. We prove a lower bound of \\Omega(\\min{{1/\\epsilon},n}) queries for any quantum algorithm that computes an \\epsilon-approximate median with any constant probability greater than 1/2. We also show how an \\epsilon-approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9804066","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9804066/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/9804066","created_at":"2026-07-04T14:47:11.912634+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9804066v2","created_at":"2026-07-04T14:47:11.912634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9804066","created_at":"2026-07-04T14:47:11.912634+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEPQWCTYXW2P","created_at":"2026-07-04T14:47:11.912634+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEPQWCTYXW2PCHXS","created_at":"2026-07-04T14:47:11.912634+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEPQWCTY","created_at":"2026-07-04T14:47:11.912634+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UEPQWCTYXW2PCHXSD5DF4PQUXA","json":"https://pith.science/pith/UEPQWCTYXW2PCHXSD5DF4PQUXA.json","graph_json":"https://pith.science/api/pith-number/UEPQWCTYXW2PCHXSD5DF4PQUXA/graph.json","events_json":"https://pith.science/api/pith-number/UEPQWCTYXW2PCHXSD5DF4PQUXA/events.json","paper":"https://pith.science/paper/UEPQWCTY"},"agent_actions":{"view_html":"https://pith.science/pith/UEPQWCTYXW2PCHXSD5DF4PQUXA","download_json":"https://pith.science/pith/UEPQWCTYXW2PCHXSD5DF4PQUXA.json","view_paper":"https://pith.science/paper/UEPQWCTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9804066&json=true","fetch_graph":"https://pith.science/api/pith-number/UEPQWCTYXW2PCHXSD5DF4PQUXA/graph.json","fetch_events":"https://pith.science/api/pith-number/UEPQWCTYXW2PCHXSD5DF4PQUXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEPQWCTYXW2PCHXSD5DF4PQUXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEPQWCTYXW2PCHXSD5DF4PQUXA/action/storage_attestation","attest_author":"https://pith.science/pith/UEPQWCTYXW2PCHXSD5DF4PQUXA/action/author_attestation","sign_citation":"https://pith.science/pith/UEPQWCTYXW2PCHXSD5DF4PQUXA/action/citation_signature","submit_replication":"https://pith.science/pith/UEPQWCTYXW2PCHXSD5DF4PQUXA/action/replication_record"}},"created_at":"2026-07-04T14:47:11.912634+00:00","updated_at":"2026-07-04T14:47:11.912634+00:00"}