{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:UZWUTLJHXCR5PVUQZFUEOHUWUP","short_pith_number":"pith:UZWUTLJH","canonical_record":{"source":{"id":"quant-ph/0201007","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-01-03T19:19:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"257872d2da3328186b05658689865bbe91d5e25665657b488757a7c9246f8f84","abstract_canon_sha256":"c70c392190bf5572f98f3b0db4caa34d4cbb4e789707ab6dede1f86ac1b49ddc"},"schema_version":"1.0"},"canonical_sha256":"a66d49ad27b8a3d7d690c968471e96a3d908f42420a67c62b10281309f37c78a","source":{"kind":"arxiv","id":"quant-ph/0201007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0201007","created_at":"2026-07-04T14:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0201007v1","created_at":"2026-07-04T14:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0201007","created_at":"2026-07-04T14:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"UZWUTLJHXCR5","created_at":"2026-07-04T14:45:52Z"},{"alias_kind":"pith_short_16","alias_value":"UZWUTLJHXCR5PVUQ","created_at":"2026-07-04T14:45:52Z"},{"alias_kind":"pith_short_8","alias_value":"UZWUTLJH","created_at":"2026-07-04T14:45:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:UZWUTLJHXCR5PVUQZFUEOHUWUP","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0201007","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-01-03T19:19:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"257872d2da3328186b05658689865bbe91d5e25665657b488757a7c9246f8f84","abstract_canon_sha256":"c70c392190bf5572f98f3b0db4caa34d4cbb4e789707ab6dede1f86ac1b49ddc"},"schema_version":"1.0"},"canonical_sha256":"a66d49ad27b8a3d7d690c968471e96a3d908f42420a67c62b10281309f37c78a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:52.354219Z","signature_b64":"dpnFikk7uCC8Mx4Gorh/XbbL24xH1d8bLtdeV3nYo3oxAbnndj/S6yf5KHGL3DgRoyKQnf3bTAmC95l9X3SyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a66d49ad27b8a3d7d690c968471e96a3d908f42420a67c62b10281309f37c78a","last_reissued_at":"2026-07-04T14:45:52.353849Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:52.353849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0201007","source_version":1,"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-07-04T14:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3v4Cs3GmWbFLsw/aia5QdvfNRIuAqwtztTk6mi5cGGEJTMdDTs/gjSss9nnLO1EDsVDK4IlFxP7PjPtpE+dCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:58:16.927424Z"},"content_sha256":"4b256e8cdffa359743c6398eb5342a1c87f5727fe72498af0bbfbcf48a9fc271","schema_version":"1.0","event_id":"sha256:4b256e8cdffa359743c6398eb5342a1c87f5727fe72498af0bbfbcf48a9fc271"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:UZWUTLJHXCR5PVUQZFUEOHUWUP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A lower bound on the quantum query complexity of read-once functions","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Howard Barnum, Michael Saks","submitted_at":"2002-01-03T19:19:09Z","abstract_excerpt":"We establish a lower bound of $\\Omega{(\\sqrt{n})}$ on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that $\\Omega(\\sqrt{D(f)})$ is a lower bound for all Boolean functions. Our technique extends a result of Ambainis, based on the idea that successful computation of a function requires ``decoherence'' of initially coherently superposed inputs in the query register, having different values of the function. The number of queries is bounded by comparing the required total amount of decoherence of a judiciously selected set of input-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0201007","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/0201007/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"},"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-07-04T14:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3wbRrEWvfoI36GS2LQzfvYsdfaYx+ItLC2VVzB32oPpFfVk548sT12fbtD0ecasFTVyVOCBS5w4CuP7jlb0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:58:16.927943Z"},"content_sha256":"b836fd5afe19d18de366348cdddf5ef78f1960956afb1d226bcd66ee81a2913a","schema_version":"1.0","event_id":"sha256:b836fd5afe19d18de366348cdddf5ef78f1960956afb1d226bcd66ee81a2913a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/bundle.json","state_url":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/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-08-16T18:58:16Z","links":{"resolver":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP","bundle":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/bundle.json","state":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:UZWUTLJHXCR5PVUQZFUEOHUWUP","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":"c70c392190bf5572f98f3b0db4caa34d4cbb4e789707ab6dede1f86ac1b49ddc","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"2002-01-03T19:19:09Z","title_canon_sha256":"257872d2da3328186b05658689865bbe91d5e25665657b488757a7c9246f8f84"},"schema_version":"1.0","source":{"id":"quant-ph/0201007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0201007","created_at":"2026-07-04T14:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0201007v1","created_at":"2026-07-04T14:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0201007","created_at":"2026-07-04T14:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"UZWUTLJHXCR5","created_at":"2026-07-04T14:45:52Z"},{"alias_kind":"pith_short_16","alias_value":"UZWUTLJHXCR5PVUQ","created_at":"2026-07-04T14:45:52Z"},{"alias_kind":"pith_short_8","alias_value":"UZWUTLJH","created_at":"2026-07-04T14:45:52Z"}],"graph_snapshots":[{"event_id":"sha256:b836fd5afe19d18de366348cdddf5ef78f1960956afb1d226bcd66ee81a2913a","target":"graph","created_at":"2026-07-04T14:45:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0201007/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We establish a lower bound of $\\Omega{(\\sqrt{n})}$ on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that $\\Omega(\\sqrt{D(f)})$ is a lower bound for all Boolean functions. Our technique extends a result of Ambainis, based on the idea that successful computation of a function requires ``decoherence'' of initially coherently superposed inputs in the query register, having different values of the function. The number of queries is bounded by comparing the required total amount of decoherence of a judiciously selected set of input-o","authors_text":"Howard Barnum, Michael Saks","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2002-01-03T19:19:09Z","title":"A lower bound on the quantum query complexity of read-once functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0201007","kind":"arxiv","version":1},"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:4b256e8cdffa359743c6398eb5342a1c87f5727fe72498af0bbfbcf48a9fc271","target":"record","created_at":"2026-07-04T14:45:52Z","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":"c70c392190bf5572f98f3b0db4caa34d4cbb4e789707ab6dede1f86ac1b49ddc","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"2002-01-03T19:19:09Z","title_canon_sha256":"257872d2da3328186b05658689865bbe91d5e25665657b488757a7c9246f8f84"},"schema_version":"1.0","source":{"id":"quant-ph/0201007","kind":"arxiv","version":1}},"canonical_sha256":"a66d49ad27b8a3d7d690c968471e96a3d908f42420a67c62b10281309f37c78a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a66d49ad27b8a3d7d690c968471e96a3d908f42420a67c62b10281309f37c78a","first_computed_at":"2026-07-04T14:45:52.353849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:45:52.353849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dpnFikk7uCC8Mx4Gorh/XbbL24xH1d8bLtdeV3nYo3oxAbnndj/S6yf5KHGL3DgRoyKQnf3bTAmC95l9X3SyBA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:45:52.354219Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0201007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b256e8cdffa359743c6398eb5342a1c87f5727fe72498af0bbfbcf48a9fc271","sha256:b836fd5afe19d18de366348cdddf5ef78f1960956afb1d226bcd66ee81a2913a"],"state_sha256":"e04a0f5831d120eb0c5ca1e1165f66c7d2e7f30b4a7b992b928345f08164c1df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eppOp++5UTH2jHf2oFu8Fkqpcff4vPedX3sKznCRgnlC9sS3vxgNRqi1JmAgYG/6t6Lwv7jGZTpTBehxn+EgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T18:58:16.940361Z","bundle_sha256":"9ae716ec6c95e5c98e3be0061abcbd632e0d816189e06b5b198191fc5e429e58"}}