{"as_of":"2026-08-07T09:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7812a3b3ed64492dadce68e45ec7b204dee005a3e2a0e8e33f82f0a9babdc47b","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T08:53:10.477673Z","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-18T08:56:08.759321Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1712.06349","last_updated":"2017-12-18T11:36:40Z","snapshot_observed_at":"2026-08-04T10:39:27.488916Z","submitted_at":"2017-12-18T11:36:40Z","title":"Understanding Quantum Algorithms via Query Complexity","version":1},"cited_work":{"arxiv_id":"1712.06349","doi":null,"metadata_source":"pith","pith_arxiv_id":"1712.06349","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Understanding Quantum Algorithms via Query Complexity","venue":"quant-ph","work_id":"918c07d3-b716-4991-858d-bfd124e5c3c6","year":2017},"citing_paper":{"arxiv_id":"2510.06337","last_updated":"2026-02-10T13:51:01Z","snapshot_observed_at":"2026-07-06T22:31:58.848080Z","submitted_at":"2025-10-07T18:02:29Z","title":"Recent quantum runtime (dis)advantages","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-18T08:53:10.477673Z"},"links":{"cited_paper":"/paper/1712.06349","citing_paper":"/paper/2510.06337"},"observation_digest":"sha256:b17ed664d388ce9dec14ac89914d1ef70938ea9629f64f4809f7219fb813f0a2","observation_id":"9696a4ac-4c9e-4614-9fe6-42a291a15fb8","resolution":{"observed_at":"2026-05-18T08:56:08.760992Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1712.06349/citation-record","integrity":"/paper/1712.06349/integrity","json":"/paper/1712.06349/citation-record.json","paper":"/paper/1712.06349"},"outbound":[],"paper":{"arxiv_id":"1712.06349","last_updated":"2017-12-18T11:36:40Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-04T10:39:27.488916Z","submitted_at":"2017-12-18T11:36:40Z","title":"Understanding Quantum Algorithms via Query Complexity"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1712.06349."}