{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:ROGFFGLYIQHRGCOQP4V77B4LXW","short_pith_number":"pith:ROGFFGLY","canonical_record":{"source":{"id":"quant-ph/0609168","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-09-21T21:38:29Z","cross_cats_sorted":[],"title_canon_sha256":"50c3ac56e6e42be0f398493dcb226f8c04dbc2956a907a112ce851f2bd107e4f","abstract_canon_sha256":"23c46c3a66be06804cea90ea314c0ce7ef3abc76b71ac26751c858b52f2a0401"},"schema_version":"1.0"},"canonical_sha256":"8b8c529978440f1309d07f2bff878bbd8e3703eabd4a6081b1b25a26492e3144","source":{"kind":"arxiv","id":"quant-ph/0609168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0609168","created_at":"2026-07-04T14:57:16Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0609168v1","created_at":"2026-07-04T14:57:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0609168","created_at":"2026-07-04T14:57:16Z"},{"alias_kind":"pith_short_12","alias_value":"ROGFFGLYIQHR","created_at":"2026-07-04T14:57:16Z"},{"alias_kind":"pith_short_16","alias_value":"ROGFFGLYIQHRGCOQ","created_at":"2026-07-04T14:57:16Z"},{"alias_kind":"pith_short_8","alias_value":"ROGFFGLY","created_at":"2026-07-04T14:57:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:ROGFFGLYIQHRGCOQP4V77B4LXW","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0609168","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-09-21T21:38:29Z","cross_cats_sorted":[],"title_canon_sha256":"50c3ac56e6e42be0f398493dcb226f8c04dbc2956a907a112ce851f2bd107e4f","abstract_canon_sha256":"23c46c3a66be06804cea90ea314c0ce7ef3abc76b71ac26751c858b52f2a0401"},"schema_version":"1.0"},"canonical_sha256":"8b8c529978440f1309d07f2bff878bbd8e3703eabd4a6081b1b25a26492e3144","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:57:16.048616Z","signature_b64":"+Q8ksfUybRzfZmWyRd4Q6yDvSVq5fbUxIZUjJ7DrK3YlLroiRLkLBqfn3aQYV4o7Sie8AOuSHfJPjf/JcIerDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b8c529978440f1309d07f2bff878bbd8e3703eabd4a6081b1b25a26492e3144","last_reissued_at":"2026-07-04T14:57:16.048236Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:57:16.048236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0609168","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-07-04T14:57:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozynO+Mr7Qm2BNjoYfkA2o8/4BFPR3VkwQh7JS4rMMdfXAFwB34at9wbfPUEeZp+vXSIG/JXvGbwMoA5QPAqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:17:02.458541Z"},"content_sha256":"17d5f6d8484332c199db0b0e7558ec9e49e11408e9fb8098874c1df6c5e72fb8","schema_version":"1.0","event_id":"sha256:17d5f6d8484332c199db0b0e7558ec9e49e11408e9fb8098874c1df6c5e72fb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:ROGFFGLYIQHRGCOQP4V77B4LXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum search with variable times","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2006-09-21T21:38:29Z","abstract_excerpt":"Since Grover's seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items and we would like to find a marked item. We consider a new variant of this problem in which evaluating the i-th item may take a different number of time steps for different i.\n  Let t_i be the number of time steps required to evaluate the i-th item. If the numbers t_i are known in advance, we give an algorithm that solves the problem in O(\\sqrt{t_1^2+t_2^2+...+t_n^2}) steps. This is optimal, as we also show a matching lower bound. The case, when t_i are not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0609168","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0609168/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:57:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWO8GvKP64cO5Al5kHTq/TOoLbzvRAXslZheWxxSkli+AG16nS9jIVxRJLnHzzz/9N5eqd2XlZmp3tYpBM8yBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:17:02.459022Z"},"content_sha256":"c6d52a9a74f4a5e363c1b3c0c3d235ee2b514fd11984ed86f7fb811489f358cc","schema_version":"1.0","event_id":"sha256:c6d52a9a74f4a5e363c1b3c0c3d235ee2b514fd11984ed86f7fb811489f358cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/bundle.json","state_url":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/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-07T07:17:02Z","links":{"resolver":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW","bundle":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/bundle.json","state":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:ROGFFGLYIQHRGCOQP4V77B4LXW","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":"23c46c3a66be06804cea90ea314c0ce7ef3abc76b71ac26751c858b52f2a0401","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-09-21T21:38:29Z","title_canon_sha256":"50c3ac56e6e42be0f398493dcb226f8c04dbc2956a907a112ce851f2bd107e4f"},"schema_version":"1.0","source":{"id":"quant-ph/0609168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0609168","created_at":"2026-07-04T14:57:16Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0609168v1","created_at":"2026-07-04T14:57:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0609168","created_at":"2026-07-04T14:57:16Z"},{"alias_kind":"pith_short_12","alias_value":"ROGFFGLYIQHR","created_at":"2026-07-04T14:57:16Z"},{"alias_kind":"pith_short_16","alias_value":"ROGFFGLYIQHRGCOQ","created_at":"2026-07-04T14:57:16Z"},{"alias_kind":"pith_short_8","alias_value":"ROGFFGLY","created_at":"2026-07-04T14:57:16Z"}],"graph_snapshots":[{"event_id":"sha256:c6d52a9a74f4a5e363c1b3c0c3d235ee2b514fd11984ed86f7fb811489f358cc","target":"graph","created_at":"2026-07-04T14:57:16Z","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/0609168/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Since Grover's seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items and we would like to find a marked item. We consider a new variant of this problem in which evaluating the i-th item may take a different number of time steps for different i.\n  Let t_i be the number of time steps required to evaluate the i-th item. If the numbers t_i are known in advance, we give an algorithm that solves the problem in O(\\sqrt{t_1^2+t_2^2+...+t_n^2}) steps. This is optimal, as we also show a matching lower bound. The case, when t_i are not","authors_text":"Andris Ambainis","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2006-09-21T21:38:29Z","title":"Quantum search with variable times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0609168","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:17d5f6d8484332c199db0b0e7558ec9e49e11408e9fb8098874c1df6c5e72fb8","target":"record","created_at":"2026-07-04T14:57:16Z","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":"23c46c3a66be06804cea90ea314c0ce7ef3abc76b71ac26751c858b52f2a0401","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-09-21T21:38:29Z","title_canon_sha256":"50c3ac56e6e42be0f398493dcb226f8c04dbc2956a907a112ce851f2bd107e4f"},"schema_version":"1.0","source":{"id":"quant-ph/0609168","kind":"arxiv","version":1}},"canonical_sha256":"8b8c529978440f1309d07f2bff878bbd8e3703eabd4a6081b1b25a26492e3144","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b8c529978440f1309d07f2bff878bbd8e3703eabd4a6081b1b25a26492e3144","first_computed_at":"2026-07-04T14:57:16.048236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:57:16.048236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Q8ksfUybRzfZmWyRd4Q6yDvSVq5fbUxIZUjJ7DrK3YlLroiRLkLBqfn3aQYV4o7Sie8AOuSHfJPjf/JcIerDg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:57:16.048616Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0609168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17d5f6d8484332c199db0b0e7558ec9e49e11408e9fb8098874c1df6c5e72fb8","sha256:c6d52a9a74f4a5e363c1b3c0c3d235ee2b514fd11984ed86f7fb811489f358cc"],"state_sha256":"29238e36d7e3e5a4d11258dfe0f16096c9f84256140f151b77e4654169fefb2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SuPhppF3x67uYTXtEGUZgg+8egQuAFExUn2XW5QtmulDUANZmQf5b5AJaifDGgt2hnZbEjHaAXZmoSqznEXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T07:17:02.463501Z","bundle_sha256":"417b4474b5d74c4c759f3d88dba844b8b1f9e02ec547a17dd61a1b85a8dc4884"}}