{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XGB4ROBFBO4U5MMGODR5QUPZSB","short_pith_number":"pith:XGB4ROBF","canonical_record":{"source":{"id":"1104.4468","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-22T15:38:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"25908a7e893a8fe30867194daf277b16f4c987d4db4622e940288d84b4171fae","abstract_canon_sha256":"2882f0a3bde2b03abb99822c826f7c082e499dba942471bd7e513086b531d12b"},"schema_version":"1.0"},"canonical_sha256":"b983c8b8250bb94eb18670e3d851f99040166b3f05b92d2e4c4195c9ca4b6ba0","source":{"kind":"arxiv","id":"1104.4468","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4468","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4468v3","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4468","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"XGB4ROBFBO4U","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XGB4ROBFBO4U5MMG","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XGB4ROBF","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XGB4ROBFBO4U5MMGODR5QUPZSB","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4468","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-22T15:38:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"25908a7e893a8fe30867194daf277b16f4c987d4db4622e940288d84b4171fae","abstract_canon_sha256":"2882f0a3bde2b03abb99822c826f7c082e499dba942471bd7e513086b531d12b"},"schema_version":"1.0"},"canonical_sha256":"b983c8b8250bb94eb18670e3d851f99040166b3f05b92d2e4c4195c9ca4b6ba0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:35.654387Z","signature_b64":"7XQoUqd8gtSUWLqwVRmbFjxE72HOUx5tSUPMGbw2ueuhvVeGucuocQ7hkcXJPI2kKMtSusx/q20XpDv53oQ3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b983c8b8250bb94eb18670e3d851f99040166b3f05b92d2e4c4195c9ca4b6ba0","last_reissued_at":"2026-05-18T03:50:35.653508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:35.653508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4468","source_version":3,"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:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jwhemde5tAQ4PeUgMWNpdXVJdZ7cs4TiJP2DhEXZbuWMujfhFpdxHEStRgeG1ueIlgQTeBs7WoKmCmPcZVQyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:24:46.273078Z"},"content_sha256":"d80d35aa52c21ded95a7c2212a4d5b4914c96dbd8da0f27b56f240e72eb5c379","schema_version":"1.0","event_id":"sha256:d80d35aa52c21ded95a7c2212a4d5b4914c96dbd8da0f27b56f240e72eb5c379"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XGB4ROBFBO4U5MMGODR5QUPZSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A strong direct product theorem for quantum query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Roland, Troy Lee","submitted_at":"2011-04-22T15:38:45Z","abstract_excerpt":"We show that quantum query complexity satisfies a strong direct product theorem. This means that computing $k$ copies of a function with less than $k$ times the quantum queries needed to compute one copy of the function implies that the overall success probability will be exponentially small in $k$. For a boolean function $f$ we also show an XOR lemma---computing the parity of $k$ copies of $f$ with less than $k$ times the queries needed for one copy implies that the advantage over random guessing will be exponentially small.\n  We do this by showing that the multiplicative adversary method, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4468","kind":"arxiv","version":3},"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:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7N3PB8hj/l9RenzStjG1QDcOUtE0OmMoN0X4n/+ScahATSBEUbkpv8bQNn2nRDWC2cl3g8xJ+pA60DdHm8ZFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:24:46.273752Z"},"content_sha256":"aa565218d5950fe42ec6bc2d645309fc197802d13001aa3fd17f54a8e3d6dbe3","schema_version":"1.0","event_id":"sha256:aa565218d5950fe42ec6bc2d645309fc197802d13001aa3fd17f54a8e3d6dbe3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGB4ROBFBO4U5MMGODR5QUPZSB/bundle.json","state_url":"https://pith.science/pith/XGB4ROBFBO4U5MMGODR5QUPZSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGB4ROBFBO4U5MMGODR5QUPZSB/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-06-10T10:24:46Z","links":{"resolver":"https://pith.science/pith/XGB4ROBFBO4U5MMGODR5QUPZSB","bundle":"https://pith.science/pith/XGB4ROBFBO4U5MMGODR5QUPZSB/bundle.json","state":"https://pith.science/pith/XGB4ROBFBO4U5MMGODR5QUPZSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGB4ROBFBO4U5MMGODR5QUPZSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XGB4ROBFBO4U5MMGODR5QUPZSB","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":"2882f0a3bde2b03abb99822c826f7c082e499dba942471bd7e513086b531d12b","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-22T15:38:45Z","title_canon_sha256":"25908a7e893a8fe30867194daf277b16f4c987d4db4622e940288d84b4171fae"},"schema_version":"1.0","source":{"id":"1104.4468","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4468","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4468v3","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4468","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"XGB4ROBFBO4U","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XGB4ROBFBO4U5MMG","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XGB4ROBF","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:aa565218d5950fe42ec6bc2d645309fc197802d13001aa3fd17f54a8e3d6dbe3","target":"graph","created_at":"2026-05-18T03:50:35Z","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 quantum query complexity satisfies a strong direct product theorem. This means that computing $k$ copies of a function with less than $k$ times the quantum queries needed to compute one copy of the function implies that the overall success probability will be exponentially small in $k$. For a boolean function $f$ we also show an XOR lemma---computing the parity of $k$ copies of $f$ with less than $k$ times the queries needed for one copy implies that the advantage over random guessing will be exponentially small.\n  We do this by showing that the multiplicative adversary method, wh","authors_text":"J\\'er\\'emie Roland, Troy Lee","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-22T15:38:45Z","title":"A strong direct product theorem for quantum query complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4468","kind":"arxiv","version":3},"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:d80d35aa52c21ded95a7c2212a4d5b4914c96dbd8da0f27b56f240e72eb5c379","target":"record","created_at":"2026-05-18T03:50:35Z","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":"2882f0a3bde2b03abb99822c826f7c082e499dba942471bd7e513086b531d12b","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-22T15:38:45Z","title_canon_sha256":"25908a7e893a8fe30867194daf277b16f4c987d4db4622e940288d84b4171fae"},"schema_version":"1.0","source":{"id":"1104.4468","kind":"arxiv","version":3}},"canonical_sha256":"b983c8b8250bb94eb18670e3d851f99040166b3f05b92d2e4c4195c9ca4b6ba0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b983c8b8250bb94eb18670e3d851f99040166b3f05b92d2e4c4195c9ca4b6ba0","first_computed_at":"2026-05-18T03:50:35.653508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:35.653508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7XQoUqd8gtSUWLqwVRmbFjxE72HOUx5tSUPMGbw2ueuhvVeGucuocQ7hkcXJPI2kKMtSusx/q20XpDv53oQ3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:35.654387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4468","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d80d35aa52c21ded95a7c2212a4d5b4914c96dbd8da0f27b56f240e72eb5c379","sha256:aa565218d5950fe42ec6bc2d645309fc197802d13001aa3fd17f54a8e3d6dbe3"],"state_sha256":"56f54f9870cea50d08b09d0aaed1d0886312dc8c87550af67a4fc84f9112caea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygovok4fi2+bw3OYL1eMpSxn5P/DHCd6aJb7aLpUSi4B035D7jBZsIk4yKXk5gcWcMDMdhwNyFsUrxwjTcDiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:24:46.278236Z","bundle_sha256":"1551e3b520f1439896f07e55d617e67978759b63f14685e9a971ad8ef8eeae3e"}}