{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:6O6425HPB2GEBA6JNLUEYZQYVY","short_pith_number":"pith:6O6425HP","canonical_record":{"source":{"id":"quant-ph/0509153","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-21T16:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"68210b57936f032453e01f0bc14ca4546a30c725e47cecf73cd7a2ba3eb9f094","abstract_canon_sha256":"98d8b64826dc22c24a60baef88e2daa0fbfbfdea6d34a682fcf2f6dd9cf4536c"},"schema_version":"1.0"},"canonical_sha256":"f3bdcd74ef0e8c4083c96ae84c6618ae062607f28c4c47d4b8576262a4d0b3cc","source":{"kind":"arxiv","id":"quant-ph/0509153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0509153","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509153v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509153","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"6O6425HPB2GE","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"6O6425HPB2GEBA6J","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"6O6425HP","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:6O6425HPB2GEBA6JNLUEYZQYVY","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0509153","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-21T16:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"68210b57936f032453e01f0bc14ca4546a30c725e47cecf73cd7a2ba3eb9f094","abstract_canon_sha256":"98d8b64826dc22c24a60baef88e2daa0fbfbfdea6d34a682fcf2f6dd9cf4536c"},"schema_version":"1.0"},"canonical_sha256":"f3bdcd74ef0e8c4083c96ae84c6618ae062607f28c4c47d4b8576262a4d0b3cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.840711Z","signature_b64":"hV/I+YaddgTcWZCyoDcwylSfimjUifGNkFtbxqgGFU102W3qZLOHqiPJQYlGT8ck7/8s9ET4BrzWXiod3n8kDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3bdcd74ef0e8c4083c96ae84c6618ae062607f28c4c47d4b8576262a4d0b3cc","last_reissued_at":"2026-05-18T01:59:53.840258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.840258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0509153","source_version":1,"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:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/oy15eQJfgHgDaYaC95ii48uEbP92Yx86zrAk3svPnG9TwG4jaId7DigwfKxVxNlgfZs8EXg/QdGTXYwoh8tDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:09:55.420155Z"},"content_sha256":"ff7b872d0c585341cd16863635bb232a23ebaca78576f596bcdbf78696c14912","schema_version":"1.0","event_id":"sha256:ff7b872d0c585341cd16863635bb232a23ebaca78576f596bcdbf78696c14912"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:6O6425HPB2GEBA6JNLUEYZQYVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds on Quantum Query Complexity","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter Hoyer (U Calgary), Robert Spalek (CWI)","submitted_at":"2005-09-21T16:46:09Z","abstract_excerpt":"Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers_cannot_ do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare the methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509153","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":""},"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:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7B1po3zcIikPjkQyxpxJZL6P9XjDmoKr7vWQI6OH43nMtBp+IpieJ7kClsKUkTGgU8CHElK/KT+Qo1P4d8g9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:09:55.420869Z"},"content_sha256":"592217c08d0fabcdc346e859d3d0dcc75e10e440336e0fc2c11a55c0de344911","schema_version":"1.0","event_id":"sha256:592217c08d0fabcdc346e859d3d0dcc75e10e440336e0fc2c11a55c0de344911"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY/bundle.json","state_url":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6O6425HPB2GEBA6JNLUEYZQYVY/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-10T13:09:55Z","links":{"resolver":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY","bundle":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY/bundle.json","state":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6O6425HPB2GEBA6JNLUEYZQYVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:6O6425HPB2GEBA6JNLUEYZQYVY","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":"98d8b64826dc22c24a60baef88e2daa0fbfbfdea6d34a682fcf2f6dd9cf4536c","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-21T16:46:09Z","title_canon_sha256":"68210b57936f032453e01f0bc14ca4546a30c725e47cecf73cd7a2ba3eb9f094"},"schema_version":"1.0","source":{"id":"quant-ph/0509153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0509153","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509153v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509153","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"6O6425HPB2GE","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"6O6425HPB2GEBA6J","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"6O6425HP","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:592217c08d0fabcdc346e859d3d0dcc75e10e440336e0fc2c11a55c0de344911","target":"graph","created_at":"2026-05-18T01:59:53Z","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":"Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers_cannot_ do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare the methods.","authors_text":"Peter Hoyer (U Calgary), Robert Spalek (CWI)","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-09-21T16:46:09Z","title":"Lower Bounds on Quantum Query Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509153","kind":"arxiv","version":1},"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:ff7b872d0c585341cd16863635bb232a23ebaca78576f596bcdbf78696c14912","target":"record","created_at":"2026-05-18T01:59:53Z","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":"98d8b64826dc22c24a60baef88e2daa0fbfbfdea6d34a682fcf2f6dd9cf4536c","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-21T16:46:09Z","title_canon_sha256":"68210b57936f032453e01f0bc14ca4546a30c725e47cecf73cd7a2ba3eb9f094"},"schema_version":"1.0","source":{"id":"quant-ph/0509153","kind":"arxiv","version":1}},"canonical_sha256":"f3bdcd74ef0e8c4083c96ae84c6618ae062607f28c4c47d4b8576262a4d0b3cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3bdcd74ef0e8c4083c96ae84c6618ae062607f28c4c47d4b8576262a4d0b3cc","first_computed_at":"2026-05-18T01:59:53.840258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:53.840258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hV/I+YaddgTcWZCyoDcwylSfimjUifGNkFtbxqgGFU102W3qZLOHqiPJQYlGT8ck7/8s9ET4BrzWXiod3n8kDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:53.840711Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0509153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff7b872d0c585341cd16863635bb232a23ebaca78576f596bcdbf78696c14912","sha256:592217c08d0fabcdc346e859d3d0dcc75e10e440336e0fc2c11a55c0de344911"],"state_sha256":"787260de30fa741b2849431adadb866edc6ebad2adf4e0148d7bc3469639e7aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LwUW4cwIpwkUjvxrKIiqz8O/uTNvG/rTQA3i01g9h8w7W/5IKwxi3CptZ4F3a55TPWSD1mmiDF4IPN8LbSp3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:09:55.424881Z","bundle_sha256":"6f4b3fefa832310c501e405b333fe171e97512446b7928baabfb76cb2b794efc"}}