{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:ALEO3XWVFWTIE7MNWWYOHIGZ6L","short_pith_number":"pith:ALEO3XWV","canonical_record":{"source":{"id":"quant-ph/0509067","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-09T17:50:06Z","cross_cats_sorted":[],"title_canon_sha256":"00493cdd7b235bfec63ebb10664fb02c9eb0eb445dca471f25bd9ace1cc7fac1","abstract_canon_sha256":"933557bbde2345eb38bae6bc19db446902fa07756061127109743e4eac32170e"},"schema_version":"1.0"},"canonical_sha256":"02c8edded52da6827d8db5b0e3a0d9f2fb1461f888247ac71627bf74dbbd9b5c","source":{"kind":"arxiv","id":"quant-ph/0509067","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0509067","created_at":"2026-07-04T14:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509067v3","created_at":"2026-07-04T14:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509067","created_at":"2026-07-04T14:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"ALEO3XWVFWTI","created_at":"2026-07-04T14:50:43Z"},{"alias_kind":"pith_short_16","alias_value":"ALEO3XWVFWTIE7MN","created_at":"2026-07-04T14:50:43Z"},{"alias_kind":"pith_short_8","alias_value":"ALEO3XWV","created_at":"2026-07-04T14:50:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:ALEO3XWVFWTIE7MNWWYOHIGZ6L","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0509067","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-09T17:50:06Z","cross_cats_sorted":[],"title_canon_sha256":"00493cdd7b235bfec63ebb10664fb02c9eb0eb445dca471f25bd9ace1cc7fac1","abstract_canon_sha256":"933557bbde2345eb38bae6bc19db446902fa07756061127109743e4eac32170e"},"schema_version":"1.0"},"canonical_sha256":"02c8edded52da6827d8db5b0e3a0d9f2fb1461f888247ac71627bf74dbbd9b5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:50:43.135565Z","signature_b64":"gRu8DNpqxh/VbeP6RHRzOTBvc4yp2XoDkTT6nF1pCdG5687ke5gDQF8UxCAwGW9g9vGtg6haAFQ1YF/w3I2XAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02c8edded52da6827d8db5b0e3a0d9f2fb1461f888247ac71627bf74dbbd9b5c","last_reissued_at":"2026-07-04T14:50:43.135201Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:50:43.135201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0509067","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-07-04T14:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CqKE3HZ544/6hneUW6mJ92LHZh2D84ZJ1FuRDTZf2EbeiK0wywdtHNmoESSeuLDopG3SOKKfKcQqHjhBMYMsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:35:26.371991Z"},"content_sha256":"fa3bff5294de598ed9bc4b9b8dfb01ef573bcf22e6935b75b5c91013d6acaf4c","schema_version":"1.0","event_id":"sha256:fa3bff5294de598ed9bc4b9b8dfb01ef573bcf22e6935b75b5c91013d6acaf4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:ALEO3XWVFWTIE7MNWWYOHIGZ6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight adversary bounds for composite functions","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter Hoyer (U Calgary), Robert Spalek (CWI), Troy Lee (LRI)","submitted_at":"2005-09-09T17:50:06Z","abstract_excerpt":"The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many equivalent formulations, and has natural connections to classical lower bounds. A further nice property of the adversary method is that it behaves very well with respect to composition of functions. We generalize the adversary method to include costs--each bit of the input can be given an arbitrary positive cost representing the difficulty of querying that bit. We use this generalization to exactly capture the advers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509067","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0509067/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:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cli3t6Tz4AjnSO8c/4keg2cEXyp9ZP2a0Td7N7CA8IEY3W79hlrI3bGpOh2KAu75UVz0UPC7atNstTv68i83DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:35:26.372921Z"},"content_sha256":"a316f933ab3051f77df4ef2458f622d1bebef8e01469c07f905d7eaeedf86ce8","schema_version":"1.0","event_id":"sha256:a316f933ab3051f77df4ef2458f622d1bebef8e01469c07f905d7eaeedf86ce8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALEO3XWVFWTIE7MNWWYOHIGZ6L/bundle.json","state_url":"https://pith.science/pith/ALEO3XWVFWTIE7MNWWYOHIGZ6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALEO3XWVFWTIE7MNWWYOHIGZ6L/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-04T22:35:26Z","links":{"resolver":"https://pith.science/pith/ALEO3XWVFWTIE7MNWWYOHIGZ6L","bundle":"https://pith.science/pith/ALEO3XWVFWTIE7MNWWYOHIGZ6L/bundle.json","state":"https://pith.science/pith/ALEO3XWVFWTIE7MNWWYOHIGZ6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALEO3XWVFWTIE7MNWWYOHIGZ6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:ALEO3XWVFWTIE7MNWWYOHIGZ6L","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":"933557bbde2345eb38bae6bc19db446902fa07756061127109743e4eac32170e","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-09T17:50:06Z","title_canon_sha256":"00493cdd7b235bfec63ebb10664fb02c9eb0eb445dca471f25bd9ace1cc7fac1"},"schema_version":"1.0","source":{"id":"quant-ph/0509067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0509067","created_at":"2026-07-04T14:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509067v3","created_at":"2026-07-04T14:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509067","created_at":"2026-07-04T14:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"ALEO3XWVFWTI","created_at":"2026-07-04T14:50:43Z"},{"alias_kind":"pith_short_16","alias_value":"ALEO3XWVFWTIE7MN","created_at":"2026-07-04T14:50:43Z"},{"alias_kind":"pith_short_8","alias_value":"ALEO3XWV","created_at":"2026-07-04T14:50:43Z"}],"graph_snapshots":[{"event_id":"sha256:a316f933ab3051f77df4ef2458f622d1bebef8e01469c07f905d7eaeedf86ce8","target":"graph","created_at":"2026-07-04T14:50:43Z","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/0509067/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many equivalent formulations, and has natural connections to classical lower bounds. A further nice property of the adversary method is that it behaves very well with respect to composition of functions. We generalize the adversary method to include costs--each bit of the input can be given an arbitrary positive cost representing the difficulty of querying that bit. We use this generalization to exactly capture the advers","authors_text":"Peter Hoyer (U Calgary), Robert Spalek (CWI), Troy Lee (LRI)","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-09-09T17:50:06Z","title":"Tight adversary bounds for composite functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509067","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:fa3bff5294de598ed9bc4b9b8dfb01ef573bcf22e6935b75b5c91013d6acaf4c","target":"record","created_at":"2026-07-04T14:50:43Z","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":"933557bbde2345eb38bae6bc19db446902fa07756061127109743e4eac32170e","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-09T17:50:06Z","title_canon_sha256":"00493cdd7b235bfec63ebb10664fb02c9eb0eb445dca471f25bd9ace1cc7fac1"},"schema_version":"1.0","source":{"id":"quant-ph/0509067","kind":"arxiv","version":3}},"canonical_sha256":"02c8edded52da6827d8db5b0e3a0d9f2fb1461f888247ac71627bf74dbbd9b5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02c8edded52da6827d8db5b0e3a0d9f2fb1461f888247ac71627bf74dbbd9b5c","first_computed_at":"2026-07-04T14:50:43.135201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:50:43.135201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gRu8DNpqxh/VbeP6RHRzOTBvc4yp2XoDkTT6nF1pCdG5687ke5gDQF8UxCAwGW9g9vGtg6haAFQ1YF/w3I2XAg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:50:43.135565Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0509067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa3bff5294de598ed9bc4b9b8dfb01ef573bcf22e6935b75b5c91013d6acaf4c","sha256:a316f933ab3051f77df4ef2458f622d1bebef8e01469c07f905d7eaeedf86ce8"],"state_sha256":"945b4aa7ceb46283ff5f4c4cddbe529ae26623d1ff9649f5aa7558b56b6f26ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dwc/Le+OoiRUwy6QVAsq2qFqbXiW+LLS8niqfq7eMUG5nNVubczcStxK0sIoWsUliIztptUqZmTDrISS9XAdAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T22:35:26.383884Z","bundle_sha256":"b742778a82826b9ed3926eefda99ca8e2a311a10930ac82c2cba3411b4861dcb"}}