{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:U5KERRJSOSFFMMT3CQKMPOM4W4","short_pith_number":"pith:U5KERRJS","canonical_record":{"source":{"id":"1101.0797","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-04T19:13:06Z","cross_cats_sorted":[],"title_canon_sha256":"4b32eea50c870e53c76c69027b6af2cbd35563f46e30ff4a0bb51ba476b13bf3","abstract_canon_sha256":"02836c54109e41fbf23921f3f521e0b451b2f4de0d073c3ed402c94f6efbda3e"},"schema_version":"1.0"},"canonical_sha256":"a75448c532748a56327b1414c7b99cb724f3d8580e02c55bf22fe376b75b201c","source":{"kind":"arxiv","id":"1101.0797","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0797","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0797v5","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0797","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"U5KERRJSOSFF","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U5KERRJSOSFFMMT3","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U5KERRJS","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:U5KERRJSOSFFMMT3CQKMPOM4W4","target":"record","payload":{"canonical_record":{"source":{"id":"1101.0797","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-04T19:13:06Z","cross_cats_sorted":[],"title_canon_sha256":"4b32eea50c870e53c76c69027b6af2cbd35563f46e30ff4a0bb51ba476b13bf3","abstract_canon_sha256":"02836c54109e41fbf23921f3f521e0b451b2f4de0d073c3ed402c94f6efbda3e"},"schema_version":"1.0"},"canonical_sha256":"a75448c532748a56327b1414c7b99cb724f3d8580e02c55bf22fe376b75b201c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:33.595411Z","signature_b64":"inaz/5iV3J49yxp19foQ4RqyEHXGQaOdiKtBfAtlb9xiSXAJ9TorNWInyJyBZ0QIpe8hTrQma05Ox06Au80JBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a75448c532748a56327b1414c7b99cb724f3d8580e02c55bf22fe376b75b201c","last_reissued_at":"2026-05-18T03:25:33.594901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:33.594901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.0797","source_version":5,"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-18T03:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHY2LKi/jjWwtu4vNHjyBrKoKm/4EOYbOO3+SgC22XoGWaMEXtf5jE3c7ndibJKab4J3LHPibABat2wVdn1zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:39:05.666614Z"},"content_sha256":"830835a2c0763d46da371b357b7881b48a28d37806c1ee6da6a6400cae28653d","schema_version":"1.0","event_id":"sha256:830835a2c0763d46da371b357b7881b48a28d37806c1ee6da6a6400cae28653d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:U5KERRJSOSFFMMT3CQKMPOM4W4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Adversary (Upper) Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shelby Kimmel","submitted_at":"2011-01-04T19:13:06Z","abstract_excerpt":"We describe a method to upper bound the quantum query complexity of Boolean formula evaluation problems, using fundamental theorems about the general adversary bound. This nonconstructive method can give an upper bound on query complexity without producing an algorithm. For example, we describe an oracle problem which we prove (non-constructively) can be solved in $O(1)$ queries, where the previous best quantum algorithm uses a polylogarithmic number of queries. We then give an explicit $O(1)$-query algorithm for this problem based on span programs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0797","kind":"arxiv","version":5},"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-18T03:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cXCoYyWN3otCtbzphIL3SgzKYNvsGXu2N2aLLKrrtS3A5kCPPsICK7TkFkcm0IJJRyL8UuRO86xlclV6Aw31Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:39:05.667240Z"},"content_sha256":"9b30148b0ded82c5cc5206b462dffe6a272f37014e24ac30a6ef39436db711cb","schema_version":"1.0","event_id":"sha256:9b30148b0ded82c5cc5206b462dffe6a272f37014e24ac30a6ef39436db711cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5KERRJSOSFFMMT3CQKMPOM4W4/bundle.json","state_url":"https://pith.science/pith/U5KERRJSOSFFMMT3CQKMPOM4W4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5KERRJSOSFFMMT3CQKMPOM4W4/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-31T14:39:05Z","links":{"resolver":"https://pith.science/pith/U5KERRJSOSFFMMT3CQKMPOM4W4","bundle":"https://pith.science/pith/U5KERRJSOSFFMMT3CQKMPOM4W4/bundle.json","state":"https://pith.science/pith/U5KERRJSOSFFMMT3CQKMPOM4W4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5KERRJSOSFFMMT3CQKMPOM4W4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:U5KERRJSOSFFMMT3CQKMPOM4W4","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":"02836c54109e41fbf23921f3f521e0b451b2f4de0d073c3ed402c94f6efbda3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-04T19:13:06Z","title_canon_sha256":"4b32eea50c870e53c76c69027b6af2cbd35563f46e30ff4a0bb51ba476b13bf3"},"schema_version":"1.0","source":{"id":"1101.0797","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0797","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0797v5","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0797","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"U5KERRJSOSFF","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U5KERRJSOSFFMMT3","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U5KERRJS","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:9b30148b0ded82c5cc5206b462dffe6a272f37014e24ac30a6ef39436db711cb","target":"graph","created_at":"2026-05-18T03:25:33Z","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 describe a method to upper bound the quantum query complexity of Boolean formula evaluation problems, using fundamental theorems about the general adversary bound. This nonconstructive method can give an upper bound on query complexity without producing an algorithm. For example, we describe an oracle problem which we prove (non-constructively) can be solved in $O(1)$ queries, where the previous best quantum algorithm uses a polylogarithmic number of queries. We then give an explicit $O(1)$-query algorithm for this problem based on span programs.","authors_text":"Shelby Kimmel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-04T19:13:06Z","title":"Quantum Adversary (Upper) Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0797","kind":"arxiv","version":5},"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:830835a2c0763d46da371b357b7881b48a28d37806c1ee6da6a6400cae28653d","target":"record","created_at":"2026-05-18T03:25:33Z","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":"02836c54109e41fbf23921f3f521e0b451b2f4de0d073c3ed402c94f6efbda3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-04T19:13:06Z","title_canon_sha256":"4b32eea50c870e53c76c69027b6af2cbd35563f46e30ff4a0bb51ba476b13bf3"},"schema_version":"1.0","source":{"id":"1101.0797","kind":"arxiv","version":5}},"canonical_sha256":"a75448c532748a56327b1414c7b99cb724f3d8580e02c55bf22fe376b75b201c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a75448c532748a56327b1414c7b99cb724f3d8580e02c55bf22fe376b75b201c","first_computed_at":"2026-05-18T03:25:33.594901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:33.594901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"inaz/5iV3J49yxp19foQ4RqyEHXGQaOdiKtBfAtlb9xiSXAJ9TorNWInyJyBZ0QIpe8hTrQma05Ox06Au80JBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:33.595411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.0797","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:830835a2c0763d46da371b357b7881b48a28d37806c1ee6da6a6400cae28653d","sha256:9b30148b0ded82c5cc5206b462dffe6a272f37014e24ac30a6ef39436db711cb"],"state_sha256":"ca07ed557969013a7e30ac219866bfe3484958eb66bca5fb93154826303b48d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+agI39A1ZQ8yOW3oqv5tHJj/rmWzSJ76UzhB+PZpAUeWPNrW5ztxCZSBQMhDzgIO+MZ1AUi38Hx+IljyHoNlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:39:05.670991Z","bundle_sha256":"de458a7d7721aa6f5452c8eb8abd0d358eac625c0b3a06090de7b2b1bb95b99d"}}