{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TFSHXPOLCF6EILH3KEBAQRAIBE","short_pith_number":"pith:TFSHXPOL","canonical_record":{"source":{"id":"1209.2713","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-12T20:00:49Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e32a371665c94f51072bbb6cf07f819e7e770af47b0bf925504577fca18cf7ab","abstract_canon_sha256":"af9c0c006b2663ca26a6d52f119ee95d8a86d0615c1cac096e96699426af21df"},"schema_version":"1.0"},"canonical_sha256":"99647bbdcb117c442cfb5102084408091cc8d7666f69474767e9e3b02ae4b700","source":{"kind":"arxiv","id":"1209.2713","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2713","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2713v2","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2713","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"pith_short_12","alias_value":"TFSHXPOLCF6E","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TFSHXPOLCF6EILH3","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TFSHXPOL","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TFSHXPOLCF6EILH3KEBAQRAIBE","target":"record","payload":{"canonical_record":{"source":{"id":"1209.2713","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-12T20:00:49Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e32a371665c94f51072bbb6cf07f819e7e770af47b0bf925504577fca18cf7ab","abstract_canon_sha256":"af9c0c006b2663ca26a6d52f119ee95d8a86d0615c1cac096e96699426af21df"},"schema_version":"1.0"},"canonical_sha256":"99647bbdcb117c442cfb5102084408091cc8d7666f69474767e9e3b02ae4b700","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:06.053700Z","signature_b64":"Gny0382ccAuH2hcbOMzTRdU0EbyaXZuqRF4ismaqhZTTfE48KfVZyBO5oVo/y7N9O3CAfwTWDsaBJrU7zp5LDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99647bbdcb117c442cfb5102084408091cc8d7666f69474767e9e3b02ae4b700","last_reissued_at":"2026-05-18T03:22:06.053197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:06.053197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.2713","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-05-18T03:22:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFTm5nwJKel+C/cf4+bsWdPYaMvRK7d/fI/Y9X6bJj2xAHKIg39gdHjnwqhKgSneAa/gATgGh7pXLWw7wTStDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:05:57.392512Z"},"content_sha256":"554df8dc07c9990c5a2e5c7bcb3fa5b26ca8cb1c785a6471e0a27c967375d669","schema_version":"1.0","event_id":"sha256:554df8dc07c9990c5a2e5c7bcb3fa5b26ca8cb1c785a6471e0a27c967375d669"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TFSHXPOLCF6EILH3KEBAQRAIBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit relation between all lower bound techniques 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, Lo\\\"ick Magnin","submitted_at":"2012-09-12T20:00:49Z","abstract_excerpt":"The polynomial method and the adversary method are the two main techniques to prove lower bounds on quantum query complexity, and they have so far been considered as unrelated approaches. Here, we show an explicit reduction from the polynomial method to the multiplicative adversary method. The proof goes by extending the polynomial method from Boolean functions to quantum state generation problems. In the process, the bound is even strengthened. We then show that this extended polynomial method is a special case of the multiplicative adversary method with an adversary matrix that is independen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2713","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":""},"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:22:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKVhww9cH6uG3wMSHoRGR8qpWXtET2uTO6OCFAODGIQRoewJckED3psDXCfq0Fs36695OfZHw+N8TaZOFhewAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:05:57.393238Z"},"content_sha256":"41170468907ef4f6b829a970db1bf77ed4f84162aed05d73cc1b3246b0678815","schema_version":"1.0","event_id":"sha256:41170468907ef4f6b829a970db1bf77ed4f84162aed05d73cc1b3246b0678815"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFSHXPOLCF6EILH3KEBAQRAIBE/bundle.json","state_url":"https://pith.science/pith/TFSHXPOLCF6EILH3KEBAQRAIBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFSHXPOLCF6EILH3KEBAQRAIBE/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-10T00:05:57Z","links":{"resolver":"https://pith.science/pith/TFSHXPOLCF6EILH3KEBAQRAIBE","bundle":"https://pith.science/pith/TFSHXPOLCF6EILH3KEBAQRAIBE/bundle.json","state":"https://pith.science/pith/TFSHXPOLCF6EILH3KEBAQRAIBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFSHXPOLCF6EILH3KEBAQRAIBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TFSHXPOLCF6EILH3KEBAQRAIBE","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":"af9c0c006b2663ca26a6d52f119ee95d8a86d0615c1cac096e96699426af21df","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-12T20:00:49Z","title_canon_sha256":"e32a371665c94f51072bbb6cf07f819e7e770af47b0bf925504577fca18cf7ab"},"schema_version":"1.0","source":{"id":"1209.2713","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2713","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2713v2","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2713","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"pith_short_12","alias_value":"TFSHXPOLCF6E","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TFSHXPOLCF6EILH3","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TFSHXPOL","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:41170468907ef4f6b829a970db1bf77ed4f84162aed05d73cc1b3246b0678815","target":"graph","created_at":"2026-05-18T03:22:06Z","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":"The polynomial method and the adversary method are the two main techniques to prove lower bounds on quantum query complexity, and they have so far been considered as unrelated approaches. Here, we show an explicit reduction from the polynomial method to the multiplicative adversary method. The proof goes by extending the polynomial method from Boolean functions to quantum state generation problems. In the process, the bound is even strengthened. We then show that this extended polynomial method is a special case of the multiplicative adversary method with an adversary matrix that is independen","authors_text":"J\\'er\\'emie Roland, Lo\\\"ick Magnin","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-12T20:00:49Z","title":"Explicit relation between all lower bound techniques for quantum query complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2713","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:554df8dc07c9990c5a2e5c7bcb3fa5b26ca8cb1c785a6471e0a27c967375d669","target":"record","created_at":"2026-05-18T03:22:06Z","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":"af9c0c006b2663ca26a6d52f119ee95d8a86d0615c1cac096e96699426af21df","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-12T20:00:49Z","title_canon_sha256":"e32a371665c94f51072bbb6cf07f819e7e770af47b0bf925504577fca18cf7ab"},"schema_version":"1.0","source":{"id":"1209.2713","kind":"arxiv","version":2}},"canonical_sha256":"99647bbdcb117c442cfb5102084408091cc8d7666f69474767e9e3b02ae4b700","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99647bbdcb117c442cfb5102084408091cc8d7666f69474767e9e3b02ae4b700","first_computed_at":"2026-05-18T03:22:06.053197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:06.053197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gny0382ccAuH2hcbOMzTRdU0EbyaXZuqRF4ismaqhZTTfE48KfVZyBO5oVo/y7N9O3CAfwTWDsaBJrU7zp5LDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:06.053700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.2713","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:554df8dc07c9990c5a2e5c7bcb3fa5b26ca8cb1c785a6471e0a27c967375d669","sha256:41170468907ef4f6b829a970db1bf77ed4f84162aed05d73cc1b3246b0678815"],"state_sha256":"1dd6a3f63fd563c90b3a28176a82f4be58123beedf367e5f3c09ea91ff287469"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eKzzJDG9CgVigRQW+lvq2zvhsR1HEqOjPh1D7xXiFZUADkPwvh3vNiZiqGE68KemJyEn+aRe0nI5ZtKHZ8h5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:05:57.397140Z","bundle_sha256":"ccae174b5a28d91fc614246358220ef7fb96146e75fa01c71cbceac3570ca12d"}}