{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:RQSPGAMOJMHALY4ASFN2TUL3LA","short_pith_number":"pith:RQSPGAMO","canonical_record":{"source":{"id":"quant-ph/0508200","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-26T16:28:57Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4b2e33a2e01712dd7fbad824ef5546433284a5b83ceec7826d71a93980dbc056","abstract_canon_sha256":"48cbdc9dd8de2eae391cd6574191289f1bc1b3faec43978c4b1879ccdf70c0ff"},"schema_version":"1.0"},"canonical_sha256":"8c24f3018e4b0e05e380915ba9d17b583438236c4956ba3d9045d8b355204b0c","source":{"kind":"arxiv","id":"quant-ph/0508200","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0508200","created_at":"2026-07-04T14:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0508200v2","created_at":"2026-07-04T14:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0508200","created_at":"2026-07-04T14:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"RQSPGAMOJMHA","created_at":"2026-07-04T14:47:01Z"},{"alias_kind":"pith_short_16","alias_value":"RQSPGAMOJMHALY4A","created_at":"2026-07-04T14:47:01Z"},{"alias_kind":"pith_short_8","alias_value":"RQSPGAMO","created_at":"2026-07-04T14:47:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:RQSPGAMOJMHALY4ASFN2TUL3LA","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0508200","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-26T16:28:57Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4b2e33a2e01712dd7fbad824ef5546433284a5b83ceec7826d71a93980dbc056","abstract_canon_sha256":"48cbdc9dd8de2eae391cd6574191289f1bc1b3faec43978c4b1879ccdf70c0ff"},"schema_version":"1.0"},"canonical_sha256":"8c24f3018e4b0e05e380915ba9d17b583438236c4956ba3d9045d8b355204b0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:01.956473Z","signature_b64":"jvdjmXK5rKscdVEnYWFOwq1zU5pWSXUNtNB99YPtnPu/R9bg0AyJHKGD5J9S1yr28nrSJ2Z+7jKa15JuKYGPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c24f3018e4b0e05e380915ba9d17b583438236c4956ba3d9045d8b355204b0c","last_reissued_at":"2026-07-04T14:47:01.956076Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:01.956076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0508200","source_version":2,"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:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uY9P0ImgNjhYcPq5cEFTTk7bs8l8m4u9Sdl+C9YP6w9c/asAwyFGgjcklKx+8pgvycI3v1dLn5xiKNNcco+cBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T11:13:22.158290Z"},"content_sha256":"1257e5df516bf65904fd3942fba9dee035844f51fd98dae2425c3c4c8a1bef01","schema_version":"1.0","event_id":"sha256:1257e5df516bf65904fd3942fba9dee035844f51fd98dae2425c3c4c8a1bef01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:RQSPGAMOJMHALY4ASFN2TUL3LA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new quantum lower bound method, with an application to strong direct product theorem for quantum search","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2005-08-26T16:28:57Z","abstract_excerpt":"We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of adversary method, by analyzing the eigenspace structure of the problem.\n  Using the new method, we prove a strong direct product theorem for quantum search. This result was previously proven by Klauck, Spalek and de Wolf (quant-ph/0402123) using polynomials method. No proof using adversary method was known before."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0508200","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/0508200/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:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ncs3D0ypTN7Olv0OL5vUFwab1nsHj7lWUWZkAFNSxpWgO6OSrVa6b2GrTdgAuC4YzqLaxLUo7BBvdtJoOFF8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T11:13:22.158999Z"},"content_sha256":"8edcd893da1dd34791035bd6b94906e592138f14c7460c4860bb903a7aa68ef0","schema_version":"1.0","event_id":"sha256:8edcd893da1dd34791035bd6b94906e592138f14c7460c4860bb903a7aa68ef0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQSPGAMOJMHALY4ASFN2TUL3LA/bundle.json","state_url":"https://pith.science/pith/RQSPGAMOJMHALY4ASFN2TUL3LA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQSPGAMOJMHALY4ASFN2TUL3LA/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-07T11:13:22Z","links":{"resolver":"https://pith.science/pith/RQSPGAMOJMHALY4ASFN2TUL3LA","bundle":"https://pith.science/pith/RQSPGAMOJMHALY4ASFN2TUL3LA/bundle.json","state":"https://pith.science/pith/RQSPGAMOJMHALY4ASFN2TUL3LA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQSPGAMOJMHALY4ASFN2TUL3LA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:RQSPGAMOJMHALY4ASFN2TUL3LA","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":"48cbdc9dd8de2eae391cd6574191289f1bc1b3faec43978c4b1879ccdf70c0ff","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-26T16:28:57Z","title_canon_sha256":"4b2e33a2e01712dd7fbad824ef5546433284a5b83ceec7826d71a93980dbc056"},"schema_version":"1.0","source":{"id":"quant-ph/0508200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0508200","created_at":"2026-07-04T14:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0508200v2","created_at":"2026-07-04T14:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0508200","created_at":"2026-07-04T14:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"RQSPGAMOJMHA","created_at":"2026-07-04T14:47:01Z"},{"alias_kind":"pith_short_16","alias_value":"RQSPGAMOJMHALY4A","created_at":"2026-07-04T14:47:01Z"},{"alias_kind":"pith_short_8","alias_value":"RQSPGAMO","created_at":"2026-07-04T14:47:01Z"}],"graph_snapshots":[{"event_id":"sha256:8edcd893da1dd34791035bd6b94906e592138f14c7460c4860bb903a7aa68ef0","target":"graph","created_at":"2026-07-04T14:47:01Z","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/0508200/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of adversary method, by analyzing the eigenspace structure of the problem.\n  Using the new method, we prove a strong direct product theorem for quantum search. This result was previously proven by Klauck, Spalek and de Wolf (quant-ph/0402123) using polynomials method. No proof using adversary method was known before.","authors_text":"Andris Ambainis","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-08-26T16:28:57Z","title":"A new quantum lower bound method, with an application to strong direct product theorem for quantum search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0508200","kind":"arxiv","version":2},"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:1257e5df516bf65904fd3942fba9dee035844f51fd98dae2425c3c4c8a1bef01","target":"record","created_at":"2026-07-04T14:47:01Z","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":"48cbdc9dd8de2eae391cd6574191289f1bc1b3faec43978c4b1879ccdf70c0ff","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-26T16:28:57Z","title_canon_sha256":"4b2e33a2e01712dd7fbad824ef5546433284a5b83ceec7826d71a93980dbc056"},"schema_version":"1.0","source":{"id":"quant-ph/0508200","kind":"arxiv","version":2}},"canonical_sha256":"8c24f3018e4b0e05e380915ba9d17b583438236c4956ba3d9045d8b355204b0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c24f3018e4b0e05e380915ba9d17b583438236c4956ba3d9045d8b355204b0c","first_computed_at":"2026-07-04T14:47:01.956076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:47:01.956076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jvdjmXK5rKscdVEnYWFOwq1zU5pWSXUNtNB99YPtnPu/R9bg0AyJHKGD5J9S1yr28nrSJ2Z+7jKa15JuKYGPDg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:47:01.956473Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0508200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1257e5df516bf65904fd3942fba9dee035844f51fd98dae2425c3c4c8a1bef01","sha256:8edcd893da1dd34791035bd6b94906e592138f14c7460c4860bb903a7aa68ef0"],"state_sha256":"03f56b0aa156d039ebf6e28c89228c0159b1450a7a5d72057fb4151d82b588de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LO6LRtyVXT9df8LqkXBRCp6bHeEB6+THLLx/mh+xMSHQobRdWEVrSdyBCXEb5BA8Hcm4X4NtP06Xj4uR2fAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T11:13:22.163735Z","bundle_sha256":"add52f70e08e37f2f99dedd5afadcea6118469aafccb36d39ce3fbe89f174f6a"}}