{"as_of":"2026-08-12T21:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6af9c279ff24d145a682d3a17472bce50a5168196499806b1160198860bce3a0","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:50:50.228182Z","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-07-01T23:26:21.475802Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0808.2775","last_updated":"2008-08-20T16:07:30Z","snapshot_observed_at":"2026-07-06T01:41:41.742563Z","submitted_at":"2008-08-20T16:07:30Z","title":"Parallel approximation of non-interactive zero-sum quantum games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0808.2775","snapshot_observed_at":"2026-08-04T10:50:50.228182Z","title":"Triply Efficient Shadow Tomography","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.08515","last_updated":"2026-05-27T15:27:43Z","snapshot_observed_at":"2026-08-07T02:14:13.036219Z","submitted_at":"2025-10-09T17:46:18Z","title":"How hard is it to verify a classical shadow?","version":3},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-04T10:50:50.228182Z"},"links":{"cited_paper":"/paper/0808.2775","citing_paper":"/paper/2510.08515"},"observation_digest":"sha256:dfb68b94c7af039eb1a62f4d424d56956db8b68a073388ea3666e15e6383109a","observation_id":"d528d6d2-4b56-4ccc-a29f-7f8f1dc09091","resolution":{"observed_at":"2026-08-04T10:50:50.228182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0808.2775","last_updated":"2008-08-20T16:07:30Z","snapshot_observed_at":"2026-07-06T01:41:41.742563Z","submitted_at":"2008-08-20T16:07:30Z","title":"Parallel approximation of non-interactive zero-sum quantum games","version":1},"cited_work":{"arxiv_id":"0808.2775","doi":null,"metadata_source":"pith","pith_arxiv_id":"0808.2775","snapshot_observed_at":"2026-07-01T23:26:21.475802Z","title":"Parallel approximation of non-interactive zero-sum quantum games","venue":"quant-ph","work_id":"64e57349-7844-4cd1-9fc0-ec2ad8d14077","year":2008},"citing_paper":{"arxiv_id":"2606.02655","last_updated":"2026-06-01T05:06:12Z","snapshot_observed_at":"2026-08-08T08:43:43.712484Z","submitted_at":"2026-06-01T05:06:12Z","title":"Coherent Swap Regret and Channel-Proof Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T14:27:33.470813Z"},"links":{"cited_paper":"/paper/0808.2775","citing_paper":"/paper/2606.02655"},"observation_digest":"sha256:023ee349e2c10a18bbb5faa18b98a4a44ff6a6a15979ba15d13830cf7c59f325","observation_id":"89e14362-41e2-4f57-be14-5c9915c25b7a","resolution":{"observed_at":"2026-07-01T23:26:21.484243Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/0808.2775/citation-record","integrity":"/paper/0808.2775/integrity","json":"/paper/0808.2775/citation-record.json","paper":"/paper/0808.2775"},"outbound":[],"paper":{"arxiv_id":"0808.2775","last_updated":"2008-08-20T16:07:30Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T01:41:41.742563Z","submitted_at":"2008-08-20T16:07:30Z","title":"Parallel approximation of non-interactive zero-sum quantum games"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:0808.2775."}