{"as_of":"2026-08-15T19:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8dcdc87754a8d1ada4efae6b1ab2fca7e58da0fdcf57e31c3db3e7af5e1a0825","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-15T06:32:42.880941+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-07-30T13:10:40.261307Z","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":"2508.06559","last_updated":"2025-08-06T15:15:11Z","snapshot_observed_at":"2026-08-12T11:39:53.216447Z","submitted_at":"2025-08-06T15:15:11Z","title":"Solving Pasur Using GPU-Accelerated Counterfactual Regret Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06559","snapshot_observed_at":"2026-07-30T13:10:40.261307Z","title":"Solving pasur using gpu-accelerated counterfactual regret minimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27035","last_updated":"2026-07-29T15:28:36Z","snapshot_observed_at":"2026-08-08T19:05:43.842976Z","submitted_at":"2026-07-29T15:28:36Z","title":"Correlated Chance Sampling for Monte Carlo Counterfactual Regret Minimization","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-30T13:10:40.261307Z"},"links":{"cited_paper":"/paper/2508.06559","citing_paper":"/paper/2607.27035"},"observation_digest":"sha256:6c2439ae17bc69d3203cc6eba8dc00a5543f929bc8deb46cacb72fa0a1ca1450","observation_id":"0537b539-2616-4c34-bd44-0c9f7bd0fe4d","resolution":{"observed_at":"2026-07-30T13:10:40.261307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.06559/citation-record","integrity":"/paper/2508.06559/integrity","json":"/paper/2508.06559/citation-record.json","paper":"/paper/2508.06559"},"outbound":[],"paper":{"arxiv_id":"2508.06559","last_updated":"2025-08-06T15:15:11Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-12T11:39:53.216447Z","submitted_at":"2025-08-06T15:15:11Z","title":"Solving Pasur Using GPU-Accelerated Counterfactual Regret Minimization"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2508.06559."}