{"as_of":"2026-08-10T22:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8122b50dda8b1684900198e75adc5e0367ded3fc6549b2b251e9bc70f2afb41e","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-10T06:31:04.303077+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-10T22:17:14.928506Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":5,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1805.12570","last_updated":"2020-07-28T15:54:27Z","snapshot_observed_at":"2026-08-09T10:28:47.183786Z","submitted_at":"2018-05-31T17:26:29Z","title":"On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.12570","snapshot_observed_at":"2026-08-10T22:17:14.928506Z","title":"Herbert, On the depth overhead incurred when run- ning quantum algorithms on near-term quantum com- puters with limited qubit connectivity Steven Herbert, arXiv:1805.12570v5 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.02222","last_updated":"2025-01-04T07:55:32Z","snapshot_observed_at":"2026-08-10T22:11:55.939711Z","submitted_at":"2025-01-04T07:55:32Z","title":"A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.928506Z"},"links":{"cited_paper":"/paper/1805.12570","citing_paper":"/paper/2501.02222"},"observation_digest":"sha256:47adcce13449e8cc0636b1c0b27cb97cb3fb7332f6d84a12621a1380a504825c","observation_id":"fe896648-3d68-419f-b8f8-085d22101aa0","resolution":{"observed_at":"2026-08-10T22:17:14.928506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.12570","last_updated":"2020-07-28T15:54:27Z","snapshot_observed_at":"2026-08-09T10:28:47.183786Z","submitted_at":"2018-05-31T17:26:29Z","title":"On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.12570","snapshot_observed_at":"2026-08-05T14:42:58.531424Z","title":"On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.21031","last_updated":"2025-08-28T17:34:27Z","snapshot_observed_at":"2026-08-09T07:23:06.461085Z","submitted_at":"2025-08-28T17:34:27Z","title":"Introducing the Quantum Economic Advantage Online Calculator","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:58.531424Z"},"links":{"cited_paper":"/paper/1805.12570","citing_paper":"/paper/2508.21031"},"observation_digest":"sha256:dc7cb126187b8e01953b2ed8abfa4f1db480c1cb103c6d5a95621112b53bf674","observation_id":"e5670018-463e-4b4f-9448-2defee86b204","resolution":{"observed_at":"2026-08-05T14:42:58.531424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.12570","last_updated":"2020-07-28T15:54:27Z","snapshot_observed_at":"2026-08-09T10:28:47.183786Z","submitted_at":"2018-05-31T17:26:29Z","title":"On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity","version":5},"cited_work":{"arxiv_id":"1805.12570","doi":"10.48550/arxiv.1805.12570","metadata_source":"pith","pith_arxiv_id":"1805.12570","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity","venue":"quant-ph","work_id":"f1d26eaf-b15a-4788-b5c0-f802f665c373","year":2018},"citing_paper":{"arxiv_id":"2607.04110","last_updated":"2026-07-05T04:20:16Z","snapshot_observed_at":"2026-08-05T20:33:32.431464Z","submitted_at":"2026-07-05T04:20:16Z","title":"Circuit Design Informed Adaptive Variational Quantum Algorithms","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-11T21:37:37.429852Z"},"links":{"cited_paper":"/paper/1805.12570","citing_paper":"/paper/2607.04110"},"observation_digest":"sha256:83fc7103501998d0b6828a34e65142fef8e70919789380d863c15c52905e9bd0","observation_id":"cb5bcf2c-716d-41c2-8561-63954bacd8bb","resolution":{"observed_at":"2026-07-11T21:38:17.159620Z","resolver_source":"local_arxiv","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-07-12T13:50:26.545345+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T13:50:26.545345+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1805.12570/citation-record","integrity":"/paper/1805.12570/integrity","json":"/paper/1805.12570/citation-record.json","paper":"/paper/1805.12570"},"outbound":[],"paper":{"arxiv_id":"1805.12570","last_updated":"2020-07-28T15:54:27Z","latest_version":5,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T10:28:47.183786Z","submitted_at":"2018-05-31T17:26:29Z","title":"On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity"},"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 3 inbound Pith citation observations for arXiv:1805.12570."}