{"as_of":"2026-08-05T23:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cd16a3f35a84256e41e80b39de696d0e4495c8bcb517a208b09194ada63d66ae","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:51:44.498651Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-23T23:48:39.520268Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1409.3305","last_updated":"2014-11-24T23:53:42Z","snapshot_observed_at":"2026-07-06T03:54:09.396670Z","submitted_at":"2014-09-11T03:09:21Z","title":"Fixed-point quantum search with an optimal number of queries","version":2},"cited_work":{"arxiv_id":"1409.3305","doi":null,"metadata_source":"pith","pith_arxiv_id":"1409.3305","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fixed-point quantum search with an optimal number of queries","venue":"quant-ph","work_id":"6d7c1b67-54d3-47b7-9364-e51b2ef72907","year":2014},"citing_paper":{"arxiv_id":"2406.12086","last_updated":"2026-04-08T23:55:31Z","snapshot_observed_at":"2026-08-02T20:06:35.567731Z","submitted_at":"2024-06-17T20:54:11Z","title":"A shortcut to an optimal quantum linear system solver","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-23T23:46:47.300069Z"},"links":{"cited_paper":"/paper/1409.3305","citing_paper":"/paper/2406.12086"},"observation_digest":"sha256:dac7c40058ff5181a8d49e7283cb9ae2d9cc4e883bf55b55b8e263a95ff21745","observation_id":"6d9b2f63-879c-4e87-acea-2a894563b7cb","resolution":{"observed_at":"2026-05-23T23:48:39.522943Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1409.3305","last_updated":"2014-11-24T23:53:42Z","snapshot_observed_at":"2026-07-06T03:54:09.396670Z","submitted_at":"2014-09-11T03:09:21Z","title":"Fixed-point quantum search with an optimal number of queries","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.3305","snapshot_observed_at":"2026-08-04T10:51:44.498651Z","title":"Yoder, Guang Hao Low, and Isaac L","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-04T10:51:36.314738Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:44.498651Z"},"links":{"cited_paper":"/paper/1409.3305","citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:d1daba5565634a10f55b86b15bbc084521c9ceaeb2790697eb449ca2b8248149","observation_id":"599b9be0-0b47-4ef2-934f-59b698e3a7d7","resolution":{"observed_at":"2026-08-04T10:51:44.498651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.3305","last_updated":"2014-11-24T23:53:42Z","snapshot_observed_at":"2026-07-06T03:54:09.396670Z","submitted_at":"2014-09-11T03:09:21Z","title":"Fixed-point quantum search with an optimal number of queries","version":2},"cited_work":{"arxiv_id":"1409.3305","doi":null,"metadata_source":"pith","pith_arxiv_id":"1409.3305","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fixed-point quantum search with an optimal number of queries","venue":"quant-ph","work_id":"6d7c1b67-54d3-47b7-9364-e51b2ef72907","year":2014},"citing_paper":{"arxiv_id":"2604.27482","last_updated":"2026-04-30T06:25:35Z","snapshot_observed_at":"2026-07-06T23:12:57.730833Z","submitted_at":"2026-04-30T06:25:35Z","title":"Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-07T10:38:24.383361Z"},"links":{"cited_paper":"/paper/1409.3305","citing_paper":"/paper/2604.27482"},"observation_digest":"sha256:4f89a74b4d2ba320bd21e00e0b3060fc8f25a74cb5d001467d0c2cdb317bab28","observation_id":"5696787d-7d87-42f7-b8fc-99a7ad42e9d2","resolution":{"observed_at":"2026-05-12T09:31:26.470378Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1409.3305/citation-record","integrity":"/paper/1409.3305/integrity","json":"/paper/1409.3305/citation-record.json","paper":"/paper/1409.3305"},"outbound":[],"paper":{"arxiv_id":"1409.3305","last_updated":"2014-11-24T23:53:42Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T03:54:09.396670Z","submitted_at":"2014-09-11T03:09:21Z","title":"Fixed-point quantum search with an optimal number of queries"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1409.3305."}