{"as_of":"2026-08-14T17:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e8b61aad1a35eceee6212f387af64cbe14391e9ebb342d2105ac56bea582b29","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-14T06:32:32.682623+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-08-03T23:13:35.739153Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.09138","last_updated":"2019-04-15T04:42:36Z","snapshot_observed_at":"2026-07-06T06:46:30.513785Z","submitted_at":"2018-06-24T12:29:51Z","title":"Resource-efficient verification of quantum computing using Serfling's bound","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.09138","snapshot_observed_at":"2026-08-03T23:13:35.739153Z","title":"Resource-efficient verification of quantum computing using Serfling’s bound,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.07300","last_updated":"2026-06-11T11:21:43Z","snapshot_observed_at":"2026-08-13T15:26:14.407055Z","submitted_at":"2025-11-10T17:01:51Z","title":"Efficient certification of intractable quantum states with few Pauli measurements","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T23:13:35.739153Z"},"links":{"cited_paper":"/paper/1806.09138","citing_paper":"/paper/2511.07300"},"observation_digest":"sha256:71a0988dbf41e1cdc4eafa4345beaa9097cf2a3769345856f7d16404bc58726c","observation_id":"8caa23b3-c1e4-482a-8510-8b8ba476264a","resolution":{"observed_at":"2026-08-03T23:13:35.739153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1806.09138/citation-record","integrity":"/paper/1806.09138/integrity","json":"/paper/1806.09138/citation-record.json","paper":"/paper/1806.09138"},"outbound":[],"paper":{"arxiv_id":"1806.09138","last_updated":"2019-04-15T04:42:36Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T06:46:30.513785Z","submitted_at":"2018-06-24T12:29:51Z","title":"Resource-efficient verification of quantum computing using Serfling's bound"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1806.09138."}