{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MDVZRTAVKPLS6K673DO5NVSM4M","short_pith_number":"pith:MDVZRTAV","schema_version":"1.0","canonical_sha256":"60eb98cc1553d72f2bdfd8ddd6d64ce318a6bcbde07bc170d83c0cdfb4a43272","source":{"kind":"arxiv","id":"2509.07876","version":1},"attestation_state":"computed","paper":{"title":"The Compressed Oracle is a Worthy (Multiplicative) Adversary","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sebastian Zur, Stacey Jeffery","submitted_at":"2025-09-09T15:58:50Z","abstract_excerpt":"The compressed oracle technique, introduced in the context of quantum cryptanalysis, is the latest method for proving quantum query lower bounds, and has had an impressive number of applications since its introduction, due in part to the ease of importing classical lower bound intuition into the quantum setting via this method. Previously, the main quantum query lower bound methods were the polynomial method, the adversary method, and the multiplicative adversary method, and their relative powers were well understood. In this work, we situate the compressed oracle technique within this establi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.07876","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-09T15:58:50Z","cross_cats_sorted":[],"title_canon_sha256":"824f384ff291830ff944a56adc67cbabfd2324b2afbc3c01ac6cb9a51ca32bba","abstract_canon_sha256":"8eac6b6a67575df12d742e0617e63e0d3df2f85bb03a268da92522c0d5455c2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:41.639201Z","signature_b64":"5ptLkkgZSAkUdtn0LR8TYvsdLGx7hMX+rEo1xn2D+a2iG/HC9CbtTHR+VlXUBTh3+xf4rdmlRncFGTm+G1ctAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60eb98cc1553d72f2bdfd8ddd6d64ce318a6bcbde07bc170d83c0cdfb4a43272","last_reissued_at":"2026-07-05T12:07:41.638684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:41.638684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Compressed Oracle is a Worthy (Multiplicative) Adversary","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sebastian Zur, Stacey Jeffery","submitted_at":"2025-09-09T15:58:50Z","abstract_excerpt":"The compressed oracle technique, introduced in the context of quantum cryptanalysis, is the latest method for proving quantum query lower bounds, and has had an impressive number of applications since its introduction, due in part to the ease of importing classical lower bound intuition into the quantum setting via this method. Previously, the main quantum query lower bound methods were the polynomial method, the adversary method, and the multiplicative adversary method, and their relative powers were well understood. In this work, we situate the compressed oracle technique within this establi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07876","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.07876/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.07876","created_at":"2026-07-05T12:07:41.638739+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.07876v1","created_at":"2026-07-05T12:07:41.638739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07876","created_at":"2026-07-05T12:07:41.638739+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDVZRTAVKPLS","created_at":"2026-07-05T12:07:41.638739+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDVZRTAVKPLS6K67","created_at":"2026-07-05T12:07:41.638739+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDVZRTAV","created_at":"2026-07-05T12:07:41.638739+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30281","citing_title":"Quantum Lazy Sampling and Path Recording for Any Group","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MDVZRTAVKPLS6K673DO5NVSM4M","json":"https://pith.science/pith/MDVZRTAVKPLS6K673DO5NVSM4M.json","graph_json":"https://pith.science/api/pith-number/MDVZRTAVKPLS6K673DO5NVSM4M/graph.json","events_json":"https://pith.science/api/pith-number/MDVZRTAVKPLS6K673DO5NVSM4M/events.json","paper":"https://pith.science/paper/MDVZRTAV"},"agent_actions":{"view_html":"https://pith.science/pith/MDVZRTAVKPLS6K673DO5NVSM4M","download_json":"https://pith.science/pith/MDVZRTAVKPLS6K673DO5NVSM4M.json","view_paper":"https://pith.science/paper/MDVZRTAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.07876&json=true","fetch_graph":"https://pith.science/api/pith-number/MDVZRTAVKPLS6K673DO5NVSM4M/graph.json","fetch_events":"https://pith.science/api/pith-number/MDVZRTAVKPLS6K673DO5NVSM4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDVZRTAVKPLS6K673DO5NVSM4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDVZRTAVKPLS6K673DO5NVSM4M/action/storage_attestation","attest_author":"https://pith.science/pith/MDVZRTAVKPLS6K673DO5NVSM4M/action/author_attestation","sign_citation":"https://pith.science/pith/MDVZRTAVKPLS6K673DO5NVSM4M/action/citation_signature","submit_replication":"https://pith.science/pith/MDVZRTAVKPLS6K673DO5NVSM4M/action/replication_record"}},"created_at":"2026-07-05T12:07:41.638739+00:00","updated_at":"2026-07-05T12:07:41.638739+00:00"}