{"as_of":"2026-08-12T07:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9977dfcea35db91b1f1b24429736f0b23199f855aea4897ace1cf6de3905f9ac","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-12T06:34:41.77262+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-09T23:30:54.711742Z","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-08-09T23:30:54.971912Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.07156","last_updated":"2020-05-14T17:21:10Z","snapshot_observed_at":"2026-07-06T09:20:26.283047Z","submitted_at":"2020-05-14T17:21:10Z","title":"Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search","version":1},"cited_work":{"arxiv_id":"2005.07156","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.07156","snapshot_observed_at":"2026-08-09T23:30:54.971912Z","title":"Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search","venue":"cs.AI","work_id":"318cd8cc-2ee3-4ba5-ad61-d3c45bf88a07","year":2020},"citing_paper":{"arxiv_id":"2501.18455","last_updated":"2025-01-30T16:08:37Z","snapshot_observed_at":"2026-08-11T05:31:10.435984Z","submitted_at":"2025-01-30T16:08:37Z","title":"Conversation Games and a Strategic View of the Turing Test","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-09T23:30:54.711742Z"},"links":{"cited_paper":"/paper/2005.07156","citing_paper":"/paper/2501.18455"},"observation_digest":"sha256:8b73b330a9c73ea5fc8557e6944604a0ab4c2a26a557714af0c62e520c5e6797","observation_id":"7c072534-28d5-4121-9f1e-8a3d013044ef","resolution":{"observed_at":"2026-08-09T23:30:54.981902Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/2005.07156/citation-record","integrity":"/paper/2005.07156/integrity","json":"/paper/2005.07156/citation-record.json","paper":"/paper/2005.07156"},"outbound":[],"paper":{"arxiv_id":"2005.07156","last_updated":"2020-05-14T17:21:10Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T09:20:26.283047Z","submitted_at":"2020-05-14T17:21:10Z","title":"Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search"},"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 1 inbound Pith citation observation for arXiv:2005.07156."}