{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PUCRFGK5OIGW7WQXV6P4FFADX3","short_pith_number":"pith:PUCRFGK5","canonical_record":{"source":{"id":"2302.06749","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-13T23:24:49Z","cross_cats_sorted":[],"title_canon_sha256":"861b8bfd08f2ea1426061dc565c1ef8b6b2397e4c71e264c6361a2eae471cc3e","abstract_canon_sha256":"4348f62d6c89765f69e19e243413433fe9be93a8fb25e164de7b6e1c1fd1aba8"},"schema_version":"1.0"},"canonical_sha256":"7d0512995d720d6fda17af9fc29403becd699262d987faf60e79273b9218786d","source":{"kind":"arxiv","id":"2302.06749","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.06749","created_at":"2026-07-05T06:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"2302.06749v3","created_at":"2026-07-05T06:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06749","created_at":"2026-07-05T06:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"PUCRFGK5OIGW","created_at":"2026-07-05T06:37:12Z"},{"alias_kind":"pith_short_16","alias_value":"PUCRFGK5OIGW7WQX","created_at":"2026-07-05T06:37:12Z"},{"alias_kind":"pith_short_8","alias_value":"PUCRFGK5","created_at":"2026-07-05T06:37:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PUCRFGK5OIGW7WQXV6P4FFADX3","target":"record","payload":{"canonical_record":{"source":{"id":"2302.06749","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-13T23:24:49Z","cross_cats_sorted":[],"title_canon_sha256":"861b8bfd08f2ea1426061dc565c1ef8b6b2397e4c71e264c6361a2eae471cc3e","abstract_canon_sha256":"4348f62d6c89765f69e19e243413433fe9be93a8fb25e164de7b6e1c1fd1aba8"},"schema_version":"1.0"},"canonical_sha256":"7d0512995d720d6fda17af9fc29403becd699262d987faf60e79273b9218786d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:12.604533Z","signature_b64":"Q+V23A222rMnLNTJlFhOdpNgq38tS1pV89TUETX2ka0ylxtcw21MNfNhBxKIsRMne4Pisy+JASkO7bnyNOPrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d0512995d720d6fda17af9fc29403becd699262d987faf60e79273b9218786d","last_reissued_at":"2026-07-05T06:37:12.604088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:12.604088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.06749","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-07-05T06:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmu3gCQNF61jJm6g6T/fNUcQa5/4p9Lejz5+qychOK6q/yknvZ+vn5umVwiqfafWsEWDpXpgv5YkWcH1Jv8jDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:21:56.378760Z"},"content_sha256":"788ff140336d9abe05aac39d72ca023590b67f5c62a5241a6e80aebd34e28c47","schema_version":"1.0","event_id":"sha256:788ff140336d9abe05aac39d72ca023590b67f5c62a5241a6e80aebd34e28c47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PUCRFGK5OIGW7WQXV6P4FFADX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithm and Lower Bound for Variable Time Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Jevg\\=enijs Vihrovs, Martins Kokainis","submitted_at":"2023-02-13T23:24:49Z","abstract_excerpt":"We study variable time search, a form of quantum search where queries to different items take different time. Our first result is a new quantum algorithm that performs variable time search with complexity $O(\\sqrt{T}\\log n)$ where $T=\\sum_{i=1}^n t_i^2$ with $t_i$ denoting the time to check the $i$-th item. Our second result is a quantum lower bound of $\\Omega(\\sqrt{T\\log T})$. Both the algorithm and the lower bound improve over previously known results by a factor of $\\sqrt{\\log T}$ but the algorithm is also substantially simpler than the previously known quantum algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06749","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.06749/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-05T06:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TcoDscz9YOdg0L3MAp4dOahfYNwCTRUu3/GV0IYzBe1++5BOkvwjQr4rqvFrTSiY7NgZ6B62rOIYFql3DQrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:21:56.379257Z"},"content_sha256":"45d90c93b00aae9db5310748f8da9649ce3bd2055ac41d1f3acb6049233decab","schema_version":"1.0","event_id":"sha256:45d90c93b00aae9db5310748f8da9649ce3bd2055ac41d1f3acb6049233decab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/bundle.json","state_url":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/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-06T06:21:56Z","links":{"resolver":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3","bundle":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/bundle.json","state":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PUCRFGK5OIGW7WQXV6P4FFADX3","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":"4348f62d6c89765f69e19e243413433fe9be93a8fb25e164de7b6e1c1fd1aba8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-13T23:24:49Z","title_canon_sha256":"861b8bfd08f2ea1426061dc565c1ef8b6b2397e4c71e264c6361a2eae471cc3e"},"schema_version":"1.0","source":{"id":"2302.06749","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.06749","created_at":"2026-07-05T06:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"2302.06749v3","created_at":"2026-07-05T06:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06749","created_at":"2026-07-05T06:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"PUCRFGK5OIGW","created_at":"2026-07-05T06:37:12Z"},{"alias_kind":"pith_short_16","alias_value":"PUCRFGK5OIGW7WQX","created_at":"2026-07-05T06:37:12Z"},{"alias_kind":"pith_short_8","alias_value":"PUCRFGK5","created_at":"2026-07-05T06:37:12Z"}],"graph_snapshots":[{"event_id":"sha256:45d90c93b00aae9db5310748f8da9649ce3bd2055ac41d1f3acb6049233decab","target":"graph","created_at":"2026-07-05T06:37:12Z","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/2302.06749/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study variable time search, a form of quantum search where queries to different items take different time. Our first result is a new quantum algorithm that performs variable time search with complexity $O(\\sqrt{T}\\log n)$ where $T=\\sum_{i=1}^n t_i^2$ with $t_i$ denoting the time to check the $i$-th item. Our second result is a quantum lower bound of $\\Omega(\\sqrt{T\\log T})$. Both the algorithm and the lower bound improve over previously known results by a factor of $\\sqrt{\\log T}$ but the algorithm is also substantially simpler than the previously known quantum algorithms.","authors_text":"Andris Ambainis, Jevg\\=enijs Vihrovs, Martins Kokainis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-13T23:24:49Z","title":"Improved Algorithm and Lower Bound for Variable Time Quantum Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06749","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:788ff140336d9abe05aac39d72ca023590b67f5c62a5241a6e80aebd34e28c47","target":"record","created_at":"2026-07-05T06:37:12Z","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":"4348f62d6c89765f69e19e243413433fe9be93a8fb25e164de7b6e1c1fd1aba8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-13T23:24:49Z","title_canon_sha256":"861b8bfd08f2ea1426061dc565c1ef8b6b2397e4c71e264c6361a2eae471cc3e"},"schema_version":"1.0","source":{"id":"2302.06749","kind":"arxiv","version":3}},"canonical_sha256":"7d0512995d720d6fda17af9fc29403becd699262d987faf60e79273b9218786d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d0512995d720d6fda17af9fc29403becd699262d987faf60e79273b9218786d","first_computed_at":"2026-07-05T06:37:12.604088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:37:12.604088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q+V23A222rMnLNTJlFhOdpNgq38tS1pV89TUETX2ka0ylxtcw21MNfNhBxKIsRMne4Pisy+JASkO7bnyNOPrAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:37:12.604533Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.06749","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:788ff140336d9abe05aac39d72ca023590b67f5c62a5241a6e80aebd34e28c47","sha256:45d90c93b00aae9db5310748f8da9649ce3bd2055ac41d1f3acb6049233decab"],"state_sha256":"8294ba326ac5f5d38dc9f37afa9789aa57e28a6aff01801d254e2bbd5f2f983a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rRxFcjgrH9ddFOY/DgiqauWQJEYaMqSW2ET2yC3AxKXXGHX2D3CoRSo8Z+rZO+xcY4fICnEtjeBmhO8WX6InCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T06:21:56.383249Z","bundle_sha256":"69f85f849065baa9625dd2fa06501587aa391e0340b31ceebc100ccac6ca45b9"}}