{"as_of":"2026-08-08T08:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a4984f94649e228027c3b15939fe08063ea49859f87d52d0c9c2aaf5fa9a762d","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-08T06:32:00.761636+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-07T12:13:36.333000Z","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-08-05T05:41:51.959348Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.06539","last_updated":"2021-01-19T10:34:51Z","snapshot_observed_at":"2026-07-06T09:37:47.347794Z","submitted_at":"2020-07-13T17:46:19Z","title":"Benchmarking 16-element quantum search algorithms on superconducting quantum processors","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.06539","snapshot_observed_at":"2026-08-07T12:13:36.333000Z","title":"Benchmarking 16-element quantum search algorithms on superconducting quantum processors,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.00695","last_updated":"2025-06-29T20:21:44Z","snapshot_observed_at":"2026-08-07T11:57:41.440935Z","submitted_at":"2025-05-31T20:01:21Z","title":"Multi-Controlled Quantum Gates in Linear Nearest Neighbor","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:36.333000Z"},"links":{"cited_paper":"/paper/2007.06539","citing_paper":"/paper/2506.00695"},"observation_digest":"sha256:cf688997087e54fa6fe27101fda23da1041f79f8255ef3a18923dcb78a0f2e3a","observation_id":"29974fe0-e537-4d20-a890-f0dd39bd1c8c","resolution":{"observed_at":"2026-08-07T12:13:36.333000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.06539","last_updated":"2021-01-19T10:34:51Z","snapshot_observed_at":"2026-07-06T09:37:47.347794Z","submitted_at":"2020-07-13T17:46:19Z","title":"Benchmarking 16-element quantum search algorithms on superconducting quantum processors","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.06539","snapshot_observed_at":"2026-08-07T06:03:05.779317Z","title":"Gwinner, M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.06435","last_updated":"2025-06-06T18:00:10Z","snapshot_observed_at":"2026-08-07T05:54:22.642697Z","submitted_at":"2025-06-06T18:00:10Z","title":"Quantum mechanics can find a needle in a haystack every time","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T06:03:05.779317Z"},"links":{"cited_paper":"/paper/2007.06539","citing_paper":"/paper/2506.06435"},"observation_digest":"sha256:2b817cfc40d93b4bf0df83821010b21305be83ff7e48356c25f52d4179a2e1bf","observation_id":"a0efe290-073f-4ff2-bb52-5bd984f0883e","resolution":{"observed_at":"2026-08-07T06:03:05.779317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.06539","last_updated":"2021-01-19T10:34:51Z","snapshot_observed_at":"2026-07-06T09:37:47.347794Z","submitted_at":"2020-07-13T17:46:19Z","title":"Benchmarking 16-element quantum search algorithms on superconducting quantum processors","version":3},"cited_work":{"arxiv_id":"2007.06539","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.06539","snapshot_observed_at":"2026-08-05T05:41:51.959348Z","title":"Benchmarking 16-element quantum search algorithms on superconducting quantum processors","venue":"quant-ph","work_id":"baeac5e9-765c-46f6-8280-ff32716b34f5","year":2020},"citing_paper":{"arxiv_id":"2509.05395","last_updated":"2025-09-05T12:58:13Z","snapshot_observed_at":"2026-08-08T06:22:03.975436Z","submitted_at":"2025-09-05T12:58:13Z","title":"Practical Fidelity Limits of Toffoli Gates in Superconducting Quantum Processors","version":1},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-08-05T05:41:47.406627Z"},"links":{"cited_paper":"/paper/2007.06539","citing_paper":"/paper/2509.05395"},"observation_digest":"sha256:376c3a229460ae050abc34cb2a22feb96cacd1df917f22cdffbc55cc85530d38","observation_id":"bd3bcaa1-a4bf-42f3-b9bc-5fc61d756be7","resolution":{"observed_at":"2026-08-05T05:41:52.048260Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2007.06539/citation-record","integrity":"/paper/2007.06539/integrity","json":"/paper/2007.06539/citation-record.json","paper":"/paper/2007.06539"},"outbound":[],"paper":{"arxiv_id":"2007.06539","last_updated":"2021-01-19T10:34:51Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T09:37:47.347794Z","submitted_at":"2020-07-13T17:46:19Z","title":"Benchmarking 16-element quantum search algorithms on superconducting quantum processors"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2007.06539."}