{"as_of":"2026-08-13T19:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9bf41bb743c48ab63b3375d10a13b4da05e1bb18551290c8d8b17bf48ff0b542","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-13T06:32:02.005865+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-12T10:48:41.396648Z","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-12T10:48:45.070972Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1805.09218","last_updated":"2018-05-23T15:19:40Z","snapshot_observed_at":"2026-07-06T06:40:49.062462Z","submitted_at":"2018-05-23T15:19:40Z","title":"Monte Carlo Tree Search for Asymmetric Trees","version":1},"cited_work":{"arxiv_id":"1805.09218","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.09218","snapshot_observed_at":"2026-08-12T10:48:45.070972Z","title":"Monte Carlo Tree Search for Asymmetric Trees","venue":"stat.ML","work_id":"74dc5e8b-2597-4af1-a85e-0c9ed9df522c","year":2018},"citing_paper":{"arxiv_id":"2411.18892","last_updated":"2025-02-01T23:49:26Z","snapshot_observed_at":"2026-08-13T05:19:39.475481Z","submitted_at":"2024-11-28T03:53:14Z","title":"A Comprehensive Survey of Reinforcement Learning: From Algorithms to Practical Challenges","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T10:48:41.396648Z"},"links":{"cited_paper":"/paper/1805.09218","citing_paper":"/paper/2411.18892"},"observation_digest":"sha256:173ee0dda7607ff8f626c94145abc43695273f5aae972d5fb7bf0c9f168484c4","observation_id":"48d5d8f5-651c-4722-ab97-d71b3138e40f","resolution":{"observed_at":"2026-08-12T10:48:45.075116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1805.09218/citation-record","integrity":"/paper/1805.09218/integrity","json":"/paper/1805.09218/citation-record.json","paper":"/paper/1805.09218"},"outbound":[],"paper":{"arxiv_id":"1805.09218","last_updated":"2018-05-23T15:19:40Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T06:40:49.062462Z","submitted_at":"2018-05-23T15:19:40Z","title":"Monte Carlo Tree Search for Asymmetric Trees"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1805.09218."}