{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:MB5KXYXK3WUQ4PQPVULDZNUMYW","short_pith_number":"pith:MB5KXYXK","schema_version":"1.0","canonical_sha256":"607aabe2eadda90e3e0fad163cb68cc5ab234d0e54d0739fba4ac8090595b1e1","source":{"kind":"arxiv","id":"quant-ph/0403168","version":2},"attestation_state":"computed","paper":{"title":"Exact quantum query complexity for total Boolean functions","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gatis Midrijanis","submitted_at":"2004-03-23T19:47:01Z","abstract_excerpt":"We will show that if there exists a quantum query algorithm that exactly computes some total Boolean function f by making T queries, then there is a classical deterministic algorithm A that exactly computes f making O(T^3) queries. The best know bound previously was O(T^4) due to Beals et al."},"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/0403168","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-03-23T19:47:01Z","cross_cats_sorted":[],"title_canon_sha256":"1bb53cece10ec5a9534d707ac1ef23984036a4974a7a77a996b025c8c5106443","abstract_canon_sha256":"0b5b3cadc59177c7b3745659336d02376f5cf7ca32a735481dc90122b0c67739"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:33.308863Z","signature_b64":"ceot03ri/rSTzAvE4kUqy51Fa+y7+0WMM4ou40ZAECu//j1AIA3hrn7koDagHuw5fpSLp1Uu0GehP74T5m8eCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"607aabe2eadda90e3e0fad163cb68cc5ab234d0e54d0739fba4ac8090595b1e1","last_reissued_at":"2026-07-04T14:46:33.308434Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:33.308434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact quantum query complexity for total Boolean functions","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gatis Midrijanis","submitted_at":"2004-03-23T19:47:01Z","abstract_excerpt":"We will show that if there exists a quantum query algorithm that exactly computes some total Boolean function f by making T queries, then there is a classical deterministic algorithm A that exactly computes f making O(T^3) queries. The best know bound previously was O(T^4) due to Beals et al."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0403168","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/0403168/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/0403168","created_at":"2026-07-04T14:46:33.308498+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0403168v2","created_at":"2026-07-04T14:46:33.308498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0403168","created_at":"2026-07-04T14:46:33.308498+00:00"},{"alias_kind":"pith_short_12","alias_value":"MB5KXYXK3WUQ","created_at":"2026-07-04T14:46:33.308498+00:00"},{"alias_kind":"pith_short_16","alias_value":"MB5KXYXK3WUQ4PQP","created_at":"2026-07-04T14:46:33.308498+00:00"},{"alias_kind":"pith_short_8","alias_value":"MB5KXYXK","created_at":"2026-07-04T14:46:33.308498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.23465","citing_title":"Boolean degree one functions on the Grassmann scheme","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MB5KXYXK3WUQ4PQPVULDZNUMYW","json":"https://pith.science/pith/MB5KXYXK3WUQ4PQPVULDZNUMYW.json","graph_json":"https://pith.science/api/pith-number/MB5KXYXK3WUQ4PQPVULDZNUMYW/graph.json","events_json":"https://pith.science/api/pith-number/MB5KXYXK3WUQ4PQPVULDZNUMYW/events.json","paper":"https://pith.science/paper/MB5KXYXK"},"agent_actions":{"view_html":"https://pith.science/pith/MB5KXYXK3WUQ4PQPVULDZNUMYW","download_json":"https://pith.science/pith/MB5KXYXK3WUQ4PQPVULDZNUMYW.json","view_paper":"https://pith.science/paper/MB5KXYXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0403168&json=true","fetch_graph":"https://pith.science/api/pith-number/MB5KXYXK3WUQ4PQPVULDZNUMYW/graph.json","fetch_events":"https://pith.science/api/pith-number/MB5KXYXK3WUQ4PQPVULDZNUMYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MB5KXYXK3WUQ4PQPVULDZNUMYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MB5KXYXK3WUQ4PQPVULDZNUMYW/action/storage_attestation","attest_author":"https://pith.science/pith/MB5KXYXK3WUQ4PQPVULDZNUMYW/action/author_attestation","sign_citation":"https://pith.science/pith/MB5KXYXK3WUQ4PQPVULDZNUMYW/action/citation_signature","submit_replication":"https://pith.science/pith/MB5KXYXK3WUQ4PQPVULDZNUMYW/action/replication_record"}},"created_at":"2026-07-04T14:46:33.308498+00:00","updated_at":"2026-07-04T14:46:33.308498+00:00"}