{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:DPF6CKKCTVYDBKVZIOSH62ZAVP","short_pith_number":"pith:DPF6CKKC","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"},"canonical_sha256":"1bcbe129429d7030aab943a47f6b20abc6c505ab4e7e3425e162ceb4fedcea26","source":{"kind":"arxiv","id":"0903.1291","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.1291","created_at":"2026-05-17T23:58:00Z"},{"alias_kind":"arxiv_version","alias_value":"0903.1291v2","created_at":"2026-05-17T23:58:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1291","created_at":"2026-05-17T23:58:00Z"},{"alias_kind":"pith_short_12","alias_value":"DPF6CKKCTVYD","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DPF6CKKCTVYDBKVZ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DPF6CKKC","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:DPF6CKKCTVYDBKVZIOSH62ZAVP","target":"record","payload":{"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"},"canonical_sha256":"1bcbe129429d7030aab943a47f6b20abc6c505ab4e7e3425e162ceb4fedcea26","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"},"source_kind":"arxiv","source_id":"0903.1291","source_version":2,"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-17T23:58:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/B/kxn8mUdPyBbxutftiYJlhAxeTUeh/AziGHrMHTqwSB4mVsSx81UVkJqPAzDLKvMUh5r0vzHUl2OWaXvg4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:03:54.148961Z"},"content_sha256":"0cb2c644b551969ef0a6a534ef3ab3424f11e28cb56c8f754468ef2a8a5a4996","schema_version":"1.0","event_id":"sha256:0cb2c644b551969ef0a6a534ef3ab3424f11e28cb56c8f754468ef2a8a5a4996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:DPF6CKKCTVYDBKVZIOSH62ZAVP","target":"graph","payload":{"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"},"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-17T23:58:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nh2G+Tx46S7CzadF4mDf7RhUqwr74q8PNXXx/OTimpnWrVH//YjEm69Uh6ARHJYs2mj5aoxK3YzC0a/kAcmeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:03:54.149481Z"},"content_sha256":"e7a1f2abd8040e38b807610655e38a9562e28a576239b45d03e3420fc8d8674f","schema_version":"1.0","event_id":"sha256:e7a1f2abd8040e38b807610655e38a9562e28a576239b45d03e3420fc8d8674f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/bundle.json","state_url":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/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-05-25T07:03:54Z","links":{"resolver":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP","bundle":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/bundle.json","state":"https://pith.science/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPF6CKKCTVYDBKVZIOSH62ZAVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:DPF6CKKCTVYDBKVZIOSH62ZAVP","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":"212ed2db3cdb8584f137e3b76e7b4e8da9510c6ad441122e851db565cb12d2b2","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-06T21:22:18Z","title_canon_sha256":"6ce044d9aa00f8099bb28c5eb6422cf3318c1f4e0bef03dfff226cf792dd6b8a"},"schema_version":"1.0","source":{"id":"0903.1291","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.1291","created_at":"2026-05-17T23:58:00Z"},{"alias_kind":"arxiv_version","alias_value":"0903.1291v2","created_at":"2026-05-17T23:58:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1291","created_at":"2026-05-17T23:58:00Z"},{"alias_kind":"pith_short_12","alias_value":"DPF6CKKCTVYD","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DPF6CKKCTVYDBKVZ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DPF6CKKC","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:e7a1f2abd8040e38b807610655e38a9562e28a576239b45d03e3420fc8d8674f","target":"graph","created_at":"2026-05-17T23:58:00Z","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 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.","authors_text":"Andrew M. Childs, Andris Ambainis, Fran\\c{c}ois Le Gall, Seiichiro Tani","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-06T21:22:18Z","title":"The quantum query complexity of certification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1291","kind":"arxiv","version":2},"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:0cb2c644b551969ef0a6a534ef3ab3424f11e28cb56c8f754468ef2a8a5a4996","target":"record","created_at":"2026-05-17T23:58:00Z","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":"212ed2db3cdb8584f137e3b76e7b4e8da9510c6ad441122e851db565cb12d2b2","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-06T21:22:18Z","title_canon_sha256":"6ce044d9aa00f8099bb28c5eb6422cf3318c1f4e0bef03dfff226cf792dd6b8a"},"schema_version":"1.0","source":{"id":"0903.1291","kind":"arxiv","version":2}},"canonical_sha256":"1bcbe129429d7030aab943a47f6b20abc6c505ab4e7e3425e162ceb4fedcea26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bcbe129429d7030aab943a47f6b20abc6c505ab4e7e3425e162ceb4fedcea26","first_computed_at":"2026-05-17T23:58:00.078421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:00.078421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BSmlD4oLCMAIsEgpF2a0yNiHY5Ianhr0Jz3tqb0Vl4Zo+vnYPIcgjhjnVM1FEkzdZqvHwvhHuBoFCtyFv+SNDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:00.078993Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.1291","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cb2c644b551969ef0a6a534ef3ab3424f11e28cb56c8f754468ef2a8a5a4996","sha256:e7a1f2abd8040e38b807610655e38a9562e28a576239b45d03e3420fc8d8674f"],"state_sha256":"827f8d944f6bde354df76f28eab0a76fcd3d3bedf492de63d1ef3728a3d4ec5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISv2sK3iSHlUM2iLtdwBNjQVmdigHOFW929fRKjEQ0lvGu7nPmH2r6QjjeoGqu2SmsB2UpzU96MbE9NpoX/YAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:03:54.152070Z","bundle_sha256":"a2ae57ada266a9168b1a68feeefec0a0d00682265f763442051b03dfff14f803"}}