{"as_of":"2026-08-10T21:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:845c1cecf6f39309da8303f3bdd8cac2ec727ca8121000427a28f4f9196455a2","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:26:02.633487Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T20:36:12.138615Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.06468","last_updated":"2020-05-26T17:31:31Z","snapshot_observed_at":"2026-07-06T09:20:03.423467Z","submitted_at":"2020-05-13T16:33:03Z","title":"Optimizing Quantum Search Using a Generalized Version of Grover's Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.06468","snapshot_observed_at":"2026-08-06T20:26:02.633487Z","title":"Gilliam, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-09T21:38:31.177548Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.633487Z"},"links":{"cited_paper":"/paper/2005.06468","citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:3e3cbc8085cd9d4dfaab31719ece63f2f00ba478b32b94f0d74a175ef4a65b30","observation_id":"264c12de-a33c-4eb8-85d4-fd2abc7d00ad","resolution":{"observed_at":"2026-08-06T20:26:02.633487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.06468","last_updated":"2020-05-26T17:31:31Z","snapshot_observed_at":"2026-07-06T09:20:03.423467Z","submitted_at":"2020-05-13T16:33:03Z","title":"Optimizing Quantum Search Using a Generalized Version of Grover's Algorithm","version":2},"cited_work":{"arxiv_id":"2005.06468","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2005.06468","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gilliam, M","venue":null,"work_id":"511b48d2-34c2-44ad-a6b8-ac654d00ad48","year":2020},"citing_paper":{"arxiv_id":"2604.23382","last_updated":"2026-04-25T17:13:50Z","snapshot_observed_at":"2026-07-06T23:09:38.799345Z","submitted_at":"2026-04-25T17:13:50Z","title":"Non-unitary extension of Grover's search algorithm","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-08T08:24:29.187948Z"},"links":{"cited_paper":"/paper/2005.06468","citing_paper":"/paper/2604.23382"},"observation_digest":"sha256:482eb2b9d63e3c4c9a59c5c29bcfda4b2cea0ebeae3d4bdbcc980a3cf18b1e41","observation_id":"0d4b157f-0ac4-4332-9f83-bcc03142de76","resolution":{"observed_at":"2026-05-11T20:36:12.148330Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2005.06468/citation-record","integrity":"/paper/2005.06468/integrity","json":"/paper/2005.06468/citation-record.json","paper":"/paper/2005.06468"},"outbound":[],"paper":{"arxiv_id":"2005.06468","last_updated":"2020-05-26T17:31:31Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T09:20:03.423467Z","submitted_at":"2020-05-13T16:33:03Z","title":"Optimizing Quantum Search Using a Generalized Version of Grover's Algorithm"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2005.06468."}