{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OX5MVDVSKGWQO7HBVOEXOCL6XD","short_pith_number":"pith:OX5MVDVS","canonical_record":{"source":{"id":"1410.0932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-03T18:14:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f6d785a588831f8c1ee6b1443f333153131dfeefa9a7f9455c0b8468b1018198","abstract_canon_sha256":"e80c75f8fa56930133724119c573d1062c389f638490398e219e9eb6efbd9e0c"},"schema_version":"1.0"},"canonical_sha256":"75faca8eb251ad077ce1ab8977097eb8fbe8faa4776913b475fa59eb1c0b3a06","source":{"kind":"arxiv","id":"1410.0932","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0932","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0932v2","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0932","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"pith_short_12","alias_value":"OX5MVDVSKGWQ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OX5MVDVSKGWQO7HB","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OX5MVDVS","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OX5MVDVSKGWQO7HBVOEXOCL6XD","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-03T18:14:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f6d785a588831f8c1ee6b1443f333153131dfeefa9a7f9455c0b8468b1018198","abstract_canon_sha256":"e80c75f8fa56930133724119c573d1062c389f638490398e219e9eb6efbd9e0c"},"schema_version":"1.0"},"canonical_sha256":"75faca8eb251ad077ce1ab8977097eb8fbe8faa4776913b475fa59eb1c0b3a06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:38.322230Z","signature_b64":"HYjkOA53JjIxjKO93MEWC5qlJ7wyzUSaZIa+mOA6W8Ph7OoD3dBM9uc1T36CT1g5pJgBKCS5y0ZNAUg8PTBkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75faca8eb251ad077ce1ab8977097eb8fbe8faa4776913b475fa59eb1c0b3a06","last_reissued_at":"2026-05-18T02:32:38.321774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:38.321774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0932","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-18T02:32:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZw/0/HCnEB6z0haoPHOZz71VejEBueh0UC8QBt0rwmJrcAlIeLzSlkp59yGLfheB5h7z5Wp4uwhp4qJO6kKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:57:14.465957Z"},"content_sha256":"b5f46c6059b1d787a9bb33ed24a57d57c21ae813c7cf12d8b25cfa8f0f771aca","schema_version":"1.0","event_id":"sha256:b5f46c6059b1d787a9bb33ed24a57d57c21ae813c7cf12d8b25cfa8f0f771aca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OX5MVDVSKGWQO7HBVOEXOCL6XD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Cedric Yen-Yu Lin, Han-Hsuan Lin","submitted_at":"2014-10-03T18:14:22Z","abstract_excerpt":"Inspired by the Elitzur-Vaidman bomb testing problem [arXiv:hep-th/9305002], we introduce a new query complexity model, which we call bomb query complexity $B(f)$. We investigate its relationship with the usual quantum query complexity $Q(f)$, and show that $B(f)=\\Theta(Q(f)^2)$.\n  This result gives a new method to upper bound the quantum query complexity: we give a method of finding bomb query algorithms from classical algorithms, which then provide nonconstructive upper bounds on $Q(f)=\\Theta(\\sqrt{B(f)})$. We subsequently were able to give explicit quantum algorithms matching our upper boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0932","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-18T02:32:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dysb85Rrykm1OG/vgm9t0QtoumxYHAfbOAqmNrBZTYZWiliw+IJqdDOAOXUrN5CwM4bbSuyr2yPf+PwXOmLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:57:14.466698Z"},"content_sha256":"b6c68ee73332243b7e994beaea2446663e0541633ec2d588f28ae888678623aa","schema_version":"1.0","event_id":"sha256:b6c68ee73332243b7e994beaea2446663e0541633ec2d588f28ae888678623aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OX5MVDVSKGWQO7HBVOEXOCL6XD/bundle.json","state_url":"https://pith.science/pith/OX5MVDVSKGWQO7HBVOEXOCL6XD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OX5MVDVSKGWQO7HBVOEXOCL6XD/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-06T03:57:14Z","links":{"resolver":"https://pith.science/pith/OX5MVDVSKGWQO7HBVOEXOCL6XD","bundle":"https://pith.science/pith/OX5MVDVSKGWQO7HBVOEXOCL6XD/bundle.json","state":"https://pith.science/pith/OX5MVDVSKGWQO7HBVOEXOCL6XD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OX5MVDVSKGWQO7HBVOEXOCL6XD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OX5MVDVSKGWQO7HBVOEXOCL6XD","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":"e80c75f8fa56930133724119c573d1062c389f638490398e219e9eb6efbd9e0c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-03T18:14:22Z","title_canon_sha256":"f6d785a588831f8c1ee6b1443f333153131dfeefa9a7f9455c0b8468b1018198"},"schema_version":"1.0","source":{"id":"1410.0932","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0932","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0932v2","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0932","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"pith_short_12","alias_value":"OX5MVDVSKGWQ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OX5MVDVSKGWQO7HB","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OX5MVDVS","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:b6c68ee73332243b7e994beaea2446663e0541633ec2d588f28ae888678623aa","target":"graph","created_at":"2026-05-18T02:32:38Z","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":"Inspired by the Elitzur-Vaidman bomb testing problem [arXiv:hep-th/9305002], we introduce a new query complexity model, which we call bomb query complexity $B(f)$. We investigate its relationship with the usual quantum query complexity $Q(f)$, and show that $B(f)=\\Theta(Q(f)^2)$.\n  This result gives a new method to upper bound the quantum query complexity: we give a method of finding bomb query algorithms from classical algorithms, which then provide nonconstructive upper bounds on $Q(f)=\\Theta(\\sqrt{B(f)})$. We subsequently were able to give explicit quantum algorithms matching our upper boun","authors_text":"Cedric Yen-Yu Lin, Han-Hsuan Lin","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-03T18:14:22Z","title":"Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0932","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:b5f46c6059b1d787a9bb33ed24a57d57c21ae813c7cf12d8b25cfa8f0f771aca","target":"record","created_at":"2026-05-18T02:32:38Z","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":"e80c75f8fa56930133724119c573d1062c389f638490398e219e9eb6efbd9e0c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-03T18:14:22Z","title_canon_sha256":"f6d785a588831f8c1ee6b1443f333153131dfeefa9a7f9455c0b8468b1018198"},"schema_version":"1.0","source":{"id":"1410.0932","kind":"arxiv","version":2}},"canonical_sha256":"75faca8eb251ad077ce1ab8977097eb8fbe8faa4776913b475fa59eb1c0b3a06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75faca8eb251ad077ce1ab8977097eb8fbe8faa4776913b475fa59eb1c0b3a06","first_computed_at":"2026-05-18T02:32:38.321774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:38.321774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HYjkOA53JjIxjKO93MEWC5qlJ7wyzUSaZIa+mOA6W8Ph7OoD3dBM9uc1T36CT1g5pJgBKCS5y0ZNAUg8PTBkAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:38.322230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0932","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5f46c6059b1d787a9bb33ed24a57d57c21ae813c7cf12d8b25cfa8f0f771aca","sha256:b6c68ee73332243b7e994beaea2446663e0541633ec2d588f28ae888678623aa"],"state_sha256":"fc7e71fb689d660a5f016b09f159b72f00678881a1d904814cc75f515ecfd295"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SEPfFRM7AitqOhy+YfN2QzuTSUzsZe1LxzufKJahi7thZ2zDNOj7nxp83HNcLZIFN738Gdy9syJLz6TcpYrQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T03:57:14.471565Z","bundle_sha256":"2b0e767e27172181fea8daa2057126662e352ffc4c8f39a6659f3afcdcc2f1b9"}}