{"as_of":"2026-08-12T17:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d579b6ddc4041b5ae1d840716687cde96a281c91496d438e368bb4105ac222c5","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-05-16T23:57:02.653534Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-16T23:57:02.724613Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.05780","last_updated":"2019-09-05T02:31:13Z","snapshot_observed_at":"2026-08-12T13:03:21.238099Z","submitted_at":"2018-06-15T01:35:03Z","title":"Surprising Negative Results for Generative Adversarial Tree Search","version":4},"cited_work":{"arxiv_id":"1806.05780","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1806.05780","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lipton, and Animashree Anandkumar","venue":null,"work_id":"89d8a872-e25f-4e79-971e-9aad2c2d136a","year":2018},"citing_paper":{"arxiv_id":"1911.08265","last_updated":"2020-02-21T18:05:30Z","snapshot_observed_at":"2026-07-06T08:38:07.984092Z","submitted_at":"2019-11-19T13:58:52Z","title":"Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T23:57:02.653534Z"},"links":{"cited_paper":"/paper/1806.05780","citing_paper":"/paper/1911.08265"},"observation_digest":"sha256:d2d8afc8d2c0998f628dac7b0e3fb4e37135ee5689af50c3b68da89416585ca5","observation_id":"f67b3ed9-2b9a-4e02-8ee7-3ffa90927141","resolution":{"observed_at":"2026-05-16T23:57:02.726748Z","resolver_source":"arxiv_id","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/1806.05780/citation-record","integrity":"/paper/1806.05780/integrity","json":"/paper/1806.05780/citation-record.json","paper":"/paper/1806.05780"},"outbound":[],"paper":{"arxiv_id":"1806.05780","last_updated":"2019-09-05T02:31:13Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T13:03:21.238099Z","submitted_at":"2018-06-15T01:35:03Z","title":"Surprising Negative Results for Generative Adversarial 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:1806.05780."}