{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:DPF6CKKCTVYDBKVZIOSH62ZAVP","short_pith_number":"pith:DPF6CKKC","schema_version":"1.0","canonical_sha256":"1bcbe129429d7030aab943a47f6b20abc6c505ab4e7e3425e162ceb4fedcea26","source":{"kind":"arxiv","id":"0903.1291","version":2},"attestation_state":"computed","paper":{"title":"The quantum query complexity of certification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Andris Ambainis, Fran\\c{c}ois Le Gall, Seiichiro Tani","submitted_at":"2009-03-06T21:22:18Z","abstract_excerpt":"We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced NAND formula. Up to logarithmic factors, we show that the query complexity is Theta(d^{(k+1)/2}) for 0-certificates, and Theta(d^{k/2}) for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is O(d^{(k+1)/2}) (again neglecting a logarithmic factor). Our lower bound relies on the fact that the quantum adversary method obeys a direct sum theorem."},"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":"0903.1291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-06T21:22:18Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6ce044d9aa00f8099bb28c5eb6422cf3318c1f4e0bef03dfff226cf792dd6b8a","abstract_canon_sha256":"212ed2db3cdb8584f137e3b76e7b4e8da9510c6ad441122e851db565cb12d2b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:00.078993Z","signature_b64":"BSmlD4oLCMAIsEgpF2a0yNiHY5Ianhr0Jz3tqb0Vl4Zo+vnYPIcgjhjnVM1FEkzdZqvHwvhHuBoFCtyFv+SNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bcbe129429d7030aab943a47f6b20abc6c505ab4e7e3425e162ceb4fedcea26","last_reissued_at":"2026-05-17T23:58:00.078421Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:00.078421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The quantum query complexity of certification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Andris Ambainis, Fran\\c{c}ois Le Gall, Seiichiro Tani","submitted_at":"2009-03-06T21:22:18Z","abstract_excerpt":"We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced NAND formula. Up to logarithmic factors, we show that the query complexity is Theta(d^{(k+1)/2}) for 0-certificates, and Theta(d^{k/2}) for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is O(d^{(k+1)/2}) (again neglecting a logarithmic factor). Our lower bound relies on the fact that the quantum adversary method obeys a direct sum theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1291","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":""},"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":"0903.1291","created_at":"2026-05-17T23:58:00.078527+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.1291v2","created_at":"2026-05-17T23:58:00.078527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1291","created_at":"2026-05-17T23:58:00.078527+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPF6CKKCTVYD","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPF6CKKCTVYDBKVZ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPF6CKKC","created_at":"2026-05-18T12:25:59.703012+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/DPF6CKKCTVYDBKVZIOSH62ZAVP","json":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP.json","graph_json":"https://pith.science/api/pith-number/DPF6CKKCTVYDBKVZIOSH62ZAVP/graph.json","events_json":"https://pith.science/api/pith-number/DPF6CKKCTVYDBKVZIOSH62ZAVP/events.json","paper":"https://pith.science/paper/DPF6CKKC"},"agent_actions":{"view_html":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP","download_json":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP.json","view_paper":"https://pith.science/paper/DPF6CKKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.1291&json=true","fetch_graph":"https://pith.science/api/pith-number/DPF6CKKCTVYDBKVZIOSH62ZAVP/graph.json","fetch_events":"https://pith.science/api/pith-number/DPF6CKKCTVYDBKVZIOSH62ZAVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/action/storage_attestation","attest_author":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/action/author_attestation","sign_citation":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/action/citation_signature","submit_replication":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/action/replication_record"}},"created_at":"2026-05-17T23:58:00.078527+00:00","updated_at":"2026-05-17T23:58:00.078527+00:00"}