{"as_of":"2026-08-13T17:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15875295374541e6a818ff163754abf9ddb320f1ab1739610457453f5cd8eeed","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-13T06:32:02.005865+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-12T15:51:42.481785Z","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-11T16:40:14.442570Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.10720","last_updated":"2024-03-15T22:43:37Z","snapshot_observed_at":"2026-08-13T00:53:02.729236Z","submitted_at":"2024-03-15T22:43:37Z","title":"Development and Application of a Monte Carlo Tree Search Algorithm for Simulating Da Vinci Code Game Strategies","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.10720","snapshot_observed_at":"2026-08-12T15:51:42.481785Z","title":"Development and application of a monte carlo tree search algorithm for simulating da vinci code game strategies[J]","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.13885","last_updated":"2024-11-21T06:52:48Z","snapshot_observed_at":"2026-08-12T21:42:12.486870Z","submitted_at":"2024-11-21T06:52:48Z","title":"Trajectory Tracking Using Frenet Coordinates with Deep Deterministic Policy Gradient","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T15:51:42.481785Z"},"links":{"cited_paper":"/paper/2403.10720","citing_paper":"/paper/2411.13885"},"observation_digest":"sha256:e3d65d20e2d2a7b95353f7767448728c750689c0d85c74798de15cc71127f42d","observation_id":"7333975a-986d-42d6-a389-bff80f74d813","resolution":{"observed_at":"2026-08-12T15:51:42.481785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10720","last_updated":"2024-03-15T22:43:37Z","snapshot_observed_at":"2026-08-13T00:53:02.729236Z","submitted_at":"2024-03-15T22:43:37Z","title":"Development and Application of a Monte Carlo Tree Search Algorithm for Simulating Da Vinci Code Game Strategies","version":1},"cited_work":{"arxiv_id":"2403.10720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.10720","snapshot_observed_at":"2026-08-11T16:40:14.442570Z","title":"Development and Application of a Monte Carlo Tree Search Algorithm for Simulating Da Vinci Code Game Strategies","venue":"cs.AI","work_id":"c23f30cd-8fd3-4269-891e-cc79d0128bb6","year":2024},"citing_paper":{"arxiv_id":"2412.09877","last_updated":"2024-12-13T05:43:21Z","snapshot_observed_at":"2026-08-12T21:43:05.226237Z","submitted_at":"2024-12-13T05:43:21Z","title":"Optimized Coordination Strategy for Multi-Aerospace Systems in Pick-and-Place Tasks By Deep Neural Network","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T16:40:14.346031Z"},"links":{"cited_paper":"/paper/2403.10720","citing_paper":"/paper/2412.09877"},"observation_digest":"sha256:6b4b03e78aaa0fb642e5b282df3a8eac8d5787b5188bb97474b2969e71eea106","observation_id":"2cf51b92-c9d5-43fb-ad82-0ba91fbc0bfd","resolution":{"observed_at":"2026-08-11T16:40:14.450439Z","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/2403.10720/citation-record","integrity":"/paper/2403.10720/integrity","json":"/paper/2403.10720/citation-record.json","paper":"/paper/2403.10720"},"outbound":[],"paper":{"arxiv_id":"2403.10720","last_updated":"2024-03-15T22:43:37Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-13T00:53:02.729236Z","submitted_at":"2024-03-15T22:43:37Z","title":"Development and Application of a Monte Carlo Tree Search Algorithm for Simulating Da Vinci Code Game Strategies"},"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 2 inbound Pith citation observations for arXiv:2403.10720."}