{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CRNXH2PZS4KWYRW7ILSYOWLTOM","short_pith_number":"pith:CRNXH2PZ","canonical_record":{"source":{"id":"1208.1122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-06T09:20:22Z","cross_cats_sorted":[],"title_canon_sha256":"ae59875a39fce83b86ebd57d7619c670023e0cd8c04db33ec2ee1379ad9b1ff9","abstract_canon_sha256":"402be54aaeb6d3f7b4b502ee8836ba6df9b928fe89054cefc247d498d9a5d276"},"schema_version":"1.0"},"canonical_sha256":"145b73e9f997156c46df42e5875973731fcec81d7b353c68d97fa8f39ac0fb58","source":{"kind":"arxiv","id":"1208.1122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1122","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1122v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1122","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"CRNXH2PZS4KW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CRNXH2PZS4KWYRW7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CRNXH2PZ","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CRNXH2PZS4KWYRW7ILSYOWLTOM","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-06T09:20:22Z","cross_cats_sorted":[],"title_canon_sha256":"ae59875a39fce83b86ebd57d7619c670023e0cd8c04db33ec2ee1379ad9b1ff9","abstract_canon_sha256":"402be54aaeb6d3f7b4b502ee8836ba6df9b928fe89054cefc247d498d9a5d276"},"schema_version":"1.0"},"canonical_sha256":"145b73e9f997156c46df42e5875973731fcec81d7b353c68d97fa8f39ac0fb58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:20.540122Z","signature_b64":"NR8sXdgLh9otkdG4q2TBN3VU93DeNbAcDEQlm7rWH2xfHpQbivd4gE44qA+dwSU3xOjO8Xrp56FyK2nH18e9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"145b73e9f997156c46df42e5875973731fcec81d7b353c68d97fa8f39ac0fb58","last_reissued_at":"2026-05-18T03:49:20.539367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:20.539367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1122","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-05-18T03:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5QC5x69HHS4215r2wzCr2kL0648VHu/LNQErBUDuDZpLN1n/Xr0ECqIZ+hICubUZ7UFinGgfhgGheNiGU5TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:53:46.233245Z"},"content_sha256":"eea7b0b43912bf4c83b3292f595b8f1f6fb410594c03e3433ef55d243aba27bb","schema_version":"1.0","event_id":"sha256:eea7b0b43912bf4c83b3292f595b8f1f6fb410594c03e3433ef55d243aba27bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CRNXH2PZS4KWYRW7ILSYOWLTOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal quantum query bounds for almost all Boolean functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis (U of Latvia), Arturs Backurs (U of Latvia), Juris Smotrovs (U of Latvia), Ronald de Wolf (CWI, U of Amsterdam)","submitted_at":"2012-08-06T09:20:22Z","abstract_excerpt":"We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of Ambainis, and shows that van Dam's oracle interrogation is essentially optimal for almost all functions. Our proof uses the fact that the acceptance probability of a T-query algorithm can be written as the sum of squares of degree-T polynomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1122","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":""},"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:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElPaRia0lkA2rnU0l0OX3gn7oOksrCb06Qi3q2KVvMZkqeH4tYMEjoyBTm/kZx1UBKjzL+0XTDK1X4r9aGCZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:53:46.233638Z"},"content_sha256":"97eb786106337d6f2db3e09eb5d235118d0a3e6c92146246c351f8cf517f6434","schema_version":"1.0","event_id":"sha256:97eb786106337d6f2db3e09eb5d235118d0a3e6c92146246c351f8cf517f6434"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/bundle.json","state_url":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/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-25T22:53:46Z","links":{"resolver":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM","bundle":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/bundle.json","state":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CRNXH2PZS4KWYRW7ILSYOWLTOM","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":"402be54aaeb6d3f7b4b502ee8836ba6df9b928fe89054cefc247d498d9a5d276","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-06T09:20:22Z","title_canon_sha256":"ae59875a39fce83b86ebd57d7619c670023e0cd8c04db33ec2ee1379ad9b1ff9"},"schema_version":"1.0","source":{"id":"1208.1122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1122","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1122v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1122","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"CRNXH2PZS4KW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CRNXH2PZS4KWYRW7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CRNXH2PZ","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:97eb786106337d6f2db3e09eb5d235118d0a3e6c92146246c351f8cf517f6434","target":"graph","created_at":"2026-05-18T03:49:20Z","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 show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of Ambainis, and shows that van Dam's oracle interrogation is essentially optimal for almost all functions. Our proof uses the fact that the acceptance probability of a T-query algorithm can be written as the sum of squares of degree-T polynomials.","authors_text":"Andris Ambainis (U of Latvia), Arturs Backurs (U of Latvia), Juris Smotrovs (U of Latvia), Ronald de Wolf (CWI, U of Amsterdam)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-06T09:20:22Z","title":"Optimal quantum query bounds for almost all Boolean functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1122","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:eea7b0b43912bf4c83b3292f595b8f1f6fb410594c03e3433ef55d243aba27bb","target":"record","created_at":"2026-05-18T03:49:20Z","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":"402be54aaeb6d3f7b4b502ee8836ba6df9b928fe89054cefc247d498d9a5d276","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-06T09:20:22Z","title_canon_sha256":"ae59875a39fce83b86ebd57d7619c670023e0cd8c04db33ec2ee1379ad9b1ff9"},"schema_version":"1.0","source":{"id":"1208.1122","kind":"arxiv","version":1}},"canonical_sha256":"145b73e9f997156c46df42e5875973731fcec81d7b353c68d97fa8f39ac0fb58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"145b73e9f997156c46df42e5875973731fcec81d7b353c68d97fa8f39ac0fb58","first_computed_at":"2026-05-18T03:49:20.539367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:20.539367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NR8sXdgLh9otkdG4q2TBN3VU93DeNbAcDEQlm7rWH2xfHpQbivd4gE44qA+dwSU3xOjO8Xrp56FyK2nH18e9Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:20.540122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eea7b0b43912bf4c83b3292f595b8f1f6fb410594c03e3433ef55d243aba27bb","sha256:97eb786106337d6f2db3e09eb5d235118d0a3e6c92146246c351f8cf517f6434"],"state_sha256":"42b2adfca633d39cad7c70d593dca8d4bc44a765efc9c12b10846ceb2b7bce3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zc+n+1ojIa/zvpLXqRzwt0Mg5epmHlLtIrDWhMOosE0TS1lo9ojok/TyXTY3/Fo8C6MaXNTFYlnxXXpuwGS4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:53:46.237460Z","bundle_sha256":"2cadac0868831f9a4092bfbc3e41eb1ae494bc346821f115ea7cbb680c9e87b8"}}