{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7NXYOY2DR2DOGMY7FKAOJ2DM4U","short_pith_number":"pith:7NXYOY2D","canonical_record":{"source":{"id":"1409.3558","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-11T19:54:36Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0125ef007d3742193548f00037d2daa57e1254ead28de7efb3ae20495bc40afb","abstract_canon_sha256":"9da37ce634404c20a6d06f785c3c4d7a615d5a2329273b11435f29324a68fbf5"},"schema_version":"1.0"},"canonical_sha256":"fb6f8763438e86e3331f2a80e4e86ce53dfa88f53d1adabb90b32ff547488ffa","source":{"kind":"arxiv","id":"1409.3558","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3558","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3558v3","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3558","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"pith_short_12","alias_value":"7NXYOY2DR2DO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7NXYOY2DR2DOGMY7","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7NXYOY2D","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7NXYOY2DR2DOGMY7FKAOJ2DM4U","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3558","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-11T19:54:36Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0125ef007d3742193548f00037d2daa57e1254ead28de7efb3ae20495bc40afb","abstract_canon_sha256":"9da37ce634404c20a6d06f785c3c4d7a615d5a2329273b11435f29324a68fbf5"},"schema_version":"1.0"},"canonical_sha256":"fb6f8763438e86e3331f2a80e4e86ce53dfa88f53d1adabb90b32ff547488ffa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:35.584249Z","signature_b64":"hHXKsp6cFNcfjjPE2P2SiMe7KBFcxKnylcz3Zy6VaYCZRDjCcH0IXcbUhoMI1edU0+xrwogeAFs1Y/IJqoJ9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb6f8763438e86e3331f2a80e4e86ce53dfa88f53d1adabb90b32ff547488ffa","last_reissued_at":"2026-05-18T01:37:35.583709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:35.583709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3558","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-18T01:37:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rscjeNXx/MJyUk7mJk0j1ZRjBdIRefMKHWPGdQmTnxaKrhsiU6E+l7tUB4o+lXnNRvoOA0dvxmeIk34mluI+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:04:31.683087Z"},"content_sha256":"4f97d566f47bed9b98362301009835fcbd2e62d26155de0759d0c226aca32bd1","schema_version":"1.0","event_id":"sha256:4f97d566f47bed9b98362301009835fcbd2e62d26155de0759d0c226aca32bd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7NXYOY2DR2DOGMY7FKAOJ2DM4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A universal adiabatic quantum query algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Roland, Mathieu Brandeho","submitted_at":"2014-09-11T19:54:36Z","abstract_excerpt":"Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discrete-time model of quantum computation, it also holds for continuous-time (or Hamiltonian-based) quantum computation, due to a known equivalence between these two query complexity models. In this work, we revisit this result by providing a direct proof in the continuous-time model. One originality of our proof is that it draws new connections between the adversary bound, a modern technique of theoretical computer science, and early theorems of qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3558","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-18T01:37:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rl+tMxayUnOsfmAGVil0pU5ohghZ6vTqtH9hqL88cMlQPv4ZJya6vNwhi5kAEtW64KxKnHBk06Ond/nMN4hICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:04:31.683793Z"},"content_sha256":"e478cba3f40a05767d3853cd1d93640e4451d22ca7ea3d8787dc341bbde44677","schema_version":"1.0","event_id":"sha256:e478cba3f40a05767d3853cd1d93640e4451d22ca7ea3d8787dc341bbde44677"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NXYOY2DR2DOGMY7FKAOJ2DM4U/bundle.json","state_url":"https://pith.science/pith/7NXYOY2DR2DOGMY7FKAOJ2DM4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NXYOY2DR2DOGMY7FKAOJ2DM4U/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:04:31Z","links":{"resolver":"https://pith.science/pith/7NXYOY2DR2DOGMY7FKAOJ2DM4U","bundle":"https://pith.science/pith/7NXYOY2DR2DOGMY7FKAOJ2DM4U/bundle.json","state":"https://pith.science/pith/7NXYOY2DR2DOGMY7FKAOJ2DM4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NXYOY2DR2DOGMY7FKAOJ2DM4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7NXYOY2DR2DOGMY7FKAOJ2DM4U","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":"9da37ce634404c20a6d06f785c3c4d7a615d5a2329273b11435f29324a68fbf5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-11T19:54:36Z","title_canon_sha256":"0125ef007d3742193548f00037d2daa57e1254ead28de7efb3ae20495bc40afb"},"schema_version":"1.0","source":{"id":"1409.3558","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3558","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3558v3","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3558","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"pith_short_12","alias_value":"7NXYOY2DR2DO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7NXYOY2DR2DOGMY7","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7NXYOY2D","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:e478cba3f40a05767d3853cd1d93640e4451d22ca7ea3d8787dc341bbde44677","target":"graph","created_at":"2026-05-18T01:37: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":"Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discrete-time model of quantum computation, it also holds for continuous-time (or Hamiltonian-based) quantum computation, due to a known equivalence between these two query complexity models. In this work, we revisit this result by providing a direct proof in the continuous-time model. One originality of our proof is that it draws new connections between the adversary bound, a modern technique of theoretical computer science, and early theorems of qu","authors_text":"J\\'er\\'emie Roland, Mathieu Brandeho","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-11T19:54:36Z","title":"A universal adiabatic quantum query algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3558","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:4f97d566f47bed9b98362301009835fcbd2e62d26155de0759d0c226aca32bd1","target":"record","created_at":"2026-05-18T01:37: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":"9da37ce634404c20a6d06f785c3c4d7a615d5a2329273b11435f29324a68fbf5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-11T19:54:36Z","title_canon_sha256":"0125ef007d3742193548f00037d2daa57e1254ead28de7efb3ae20495bc40afb"},"schema_version":"1.0","source":{"id":"1409.3558","kind":"arxiv","version":3}},"canonical_sha256":"fb6f8763438e86e3331f2a80e4e86ce53dfa88f53d1adabb90b32ff547488ffa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb6f8763438e86e3331f2a80e4e86ce53dfa88f53d1adabb90b32ff547488ffa","first_computed_at":"2026-05-18T01:37:35.583709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:35.583709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hHXKsp6cFNcfjjPE2P2SiMe7KBFcxKnylcz3Zy6VaYCZRDjCcH0IXcbUhoMI1edU0+xrwogeAFs1Y/IJqoJ9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:35.584249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3558","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f97d566f47bed9b98362301009835fcbd2e62d26155de0759d0c226aca32bd1","sha256:e478cba3f40a05767d3853cd1d93640e4451d22ca7ea3d8787dc341bbde44677"],"state_sha256":"faae7a16eb5296a416c1d74650ce311fb5e2e19b2d9d4e1fe7f73be0955daba5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHgCaLXkXYSlEHsJO88L51ui7rOAMCy5FGa8PlwAEdobnaKZMiEDvEJELYrnfovsTMoUOVzyZGu1PhmUS1OOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:04:31.687955Z","bundle_sha256":"e7d4b390e641afd390a79690e59d2d21dad2b71d021ca286830a090fb006d4c8"}}