{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:B77C6VVY7D6BTVISHXC2FVQD5Y","short_pith_number":"pith:B77C6VVY","canonical_record":{"source":{"id":"1210.4648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-17T07:23:12Z","cross_cats_sorted":[],"title_canon_sha256":"bb7937af9fb4e765262ba61671d8f778932ce7b935df719727ad10015abbc692","abstract_canon_sha256":"97bf4c7576ef7060bc03bd9db9f07f21fb3ab6a8818f87c80019cf09ee72edf4"},"schema_version":"1.0"},"canonical_sha256":"0ffe2f56b8f8fc19d5123dc5a2d603ee1dbf1be46ae0953544601e4a5703b366","source":{"kind":"arxiv","id":"1210.4648","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4648","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4648v1","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4648","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"B77C6VVY7D6B","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B77C6VVY7D6BTVIS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B77C6VVY","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:B77C6VVY7D6BTVISHXC2FVQD5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-17T07:23:12Z","cross_cats_sorted":[],"title_canon_sha256":"bb7937af9fb4e765262ba61671d8f778932ce7b935df719727ad10015abbc692","abstract_canon_sha256":"97bf4c7576ef7060bc03bd9db9f07f21fb3ab6a8818f87c80019cf09ee72edf4"},"schema_version":"1.0"},"canonical_sha256":"0ffe2f56b8f8fc19d5123dc5a2d603ee1dbf1be46ae0953544601e4a5703b366","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:56.558992Z","signature_b64":"X2hhWZtKq0gr7aIvQQazpmB0wrb9bz0/TzulazVUaxDtL93V5l/4SSYC+TZl95vEzFUblNtiXZhLJBR1epSPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ffe2f56b8f8fc19d5123dc5a2d603ee1dbf1be46ae0953544601e4a5703b366","last_reissued_at":"2026-05-18T03:42:56.558343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:56.558343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4648","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-18T03:42:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZSsexA9ql/4zPB3ELTKP6OeprTKRI1t2JvCtB+mVfs5hmM/vlaIH0qpNs6unW/ql0oJLGsDpAgV1zAj+KrXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:24:54.862470Z"},"content_sha256":"817aa6a646dfba84260c446487e261aa426e5caa1b91fa858debaaa7533dad8b","schema_version":"1.0","event_id":"sha256:817aa6a646dfba84260c446487e261aa426e5caa1b91fa858debaaa7533dad8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:B77C6VVY7D6BTVISHXC2FVQD5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal quantum searching to find a common element of two sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avatar Tulsi","submitted_at":"2012-10-17T07:23:12Z","abstract_excerpt":"Given two sets A and B and two oracles O(A) and O(B) that can identify the elements of these sets respectively, the goal is to find an element common to both sets using minimum number of oracle queries. Each application of either O(A) or O(B) is taken as a single oracle query. This is basically a search problem and a straightforward application of Grover algorithm can solve this problem but its performance is slow compared to the optimal one by a constant factor of 1.57. Here we present a variant of Grover algorithm which achieves the optimal performance in not too restrictive cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4648","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-18T03:42:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvgV7hr9QG8P9jvEvKzm7v2tW2RpGDJK9GhPK5103FNtq9wkaD5ReWW4mD442jujyhKtxRaHcaMT4Vf8NpsxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:24:54.863014Z"},"content_sha256":"5b115603d6c3319b2d2b236b23887c009cf513ea2c138f4cb31e12f5684cb17a","schema_version":"1.0","event_id":"sha256:5b115603d6c3319b2d2b236b23887c009cf513ea2c138f4cb31e12f5684cb17a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B77C6VVY7D6BTVISHXC2FVQD5Y/bundle.json","state_url":"https://pith.science/pith/B77C6VVY7D6BTVISHXC2FVQD5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B77C6VVY7D6BTVISHXC2FVQD5Y/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-12T05:24:54Z","links":{"resolver":"https://pith.science/pith/B77C6VVY7D6BTVISHXC2FVQD5Y","bundle":"https://pith.science/pith/B77C6VVY7D6BTVISHXC2FVQD5Y/bundle.json","state":"https://pith.science/pith/B77C6VVY7D6BTVISHXC2FVQD5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B77C6VVY7D6BTVISHXC2FVQD5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:B77C6VVY7D6BTVISHXC2FVQD5Y","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":"97bf4c7576ef7060bc03bd9db9f07f21fb3ab6a8818f87c80019cf09ee72edf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-17T07:23:12Z","title_canon_sha256":"bb7937af9fb4e765262ba61671d8f778932ce7b935df719727ad10015abbc692"},"schema_version":"1.0","source":{"id":"1210.4648","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4648","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4648v1","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4648","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"B77C6VVY7D6B","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B77C6VVY7D6BTVIS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B77C6VVY","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:5b115603d6c3319b2d2b236b23887c009cf513ea2c138f4cb31e12f5684cb17a","target":"graph","created_at":"2026-05-18T03:42:56Z","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":"Given two sets A and B and two oracles O(A) and O(B) that can identify the elements of these sets respectively, the goal is to find an element common to both sets using minimum number of oracle queries. Each application of either O(A) or O(B) is taken as a single oracle query. This is basically a search problem and a straightforward application of Grover algorithm can solve this problem but its performance is slow compared to the optimal one by a constant factor of 1.57. Here we present a variant of Grover algorithm which achieves the optimal performance in not too restrictive cases.","authors_text":"Avatar Tulsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-17T07:23:12Z","title":"Optimal quantum searching to find a common element of two sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4648","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:817aa6a646dfba84260c446487e261aa426e5caa1b91fa858debaaa7533dad8b","target":"record","created_at":"2026-05-18T03:42:56Z","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":"97bf4c7576ef7060bc03bd9db9f07f21fb3ab6a8818f87c80019cf09ee72edf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-17T07:23:12Z","title_canon_sha256":"bb7937af9fb4e765262ba61671d8f778932ce7b935df719727ad10015abbc692"},"schema_version":"1.0","source":{"id":"1210.4648","kind":"arxiv","version":1}},"canonical_sha256":"0ffe2f56b8f8fc19d5123dc5a2d603ee1dbf1be46ae0953544601e4a5703b366","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ffe2f56b8f8fc19d5123dc5a2d603ee1dbf1be46ae0953544601e4a5703b366","first_computed_at":"2026-05-18T03:42:56.558343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:56.558343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X2hhWZtKq0gr7aIvQQazpmB0wrb9bz0/TzulazVUaxDtL93V5l/4SSYC+TZl95vEzFUblNtiXZhLJBR1epSPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:56.558992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4648","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:817aa6a646dfba84260c446487e261aa426e5caa1b91fa858debaaa7533dad8b","sha256:5b115603d6c3319b2d2b236b23887c009cf513ea2c138f4cb31e12f5684cb17a"],"state_sha256":"872bf06eef28d0e563e27071c52d6376d52ae6017cb0e595d724ff33bebd7176"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+cR7KiYdAJ+3pOGFCoFkmZt1QU4Q+hzl+U4LrcJMLo2PjtSy9iI5TS+lc6/I+JZzgj6kZXe9xh2XkYqw8+y/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:24:54.865660Z","bundle_sha256":"4d2546cfe036e7295f4661939083cdd8f4d7f740499ff60fd2abe5a1f08f5037"}}