{"as_of":"2026-08-17T16:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d154faae548441b4e4da4fa287f055e7cd28eee0eee5f9102ca9bdf2ce05dde2","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-17T06:30:58.91139+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-03T17:25:21.032583Z","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":"2003.13741","last_updated":"2020-03-30T18:43:59Z","snapshot_observed_at":"2026-08-05T12:37:30.813659Z","submitted_at":"2020-03-30T18:43:59Z","title":"Parallelization of Monte Carlo Tree Search in Continuous Domains","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.13741","snapshot_observed_at":"2026-08-03T17:25:21.032583Z","title":"InInternational Conference on Computers and Games, 60–71","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.09727","last_updated":"2026-07-16T09:49:04Z","snapshot_observed_at":"2026-08-08T03:19:27.264758Z","submitted_at":"2025-12-10T15:09:06Z","title":"Gaussian Process Aggregation for Root-Parallel Monte Carlo Tree Search with Continuous Actions","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-03T17:25:21.032583Z"},"links":{"cited_paper":"/paper/2003.13741","citing_paper":"/paper/2512.09727"},"observation_digest":"sha256:963f649dffa34c6b67a540647ad1dd31b5e0e055a0dfa8b829fc45a3e399c7be","observation_id":"bc7d6d23-32f6-434d-90a1-47d652b33ff2","resolution":{"observed_at":"2026-08-03T17:25:21.032583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.13741","last_updated":"2020-03-30T18:43:59Z","snapshot_observed_at":"2026-08-05T12:37:30.813659Z","submitted_at":"2020-03-30T18:43:59Z","title":"Parallelization of Monte Carlo Tree Search in Continuous Domains","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.13741","snapshot_observed_at":"2026-08-03T03:23:09.995480Z","title":"Parallelization of monte carlo tree search in continuous domains.arXiv preprint arXiv:2003.13741, 2020","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2602.08334","last_updated":"2026-06-20T06:59:41Z","snapshot_observed_at":"2026-08-15T01:49:36.628873Z","submitted_at":"2026-02-09T07:15:19Z","title":"Vec-QMDP: Vectorized POMDP Planning on CPUs for Real-Time Autonomous Driving","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T03:23:09.995480Z"},"links":{"cited_paper":"/paper/2003.13741","citing_paper":"/paper/2602.08334"},"observation_digest":"sha256:5c4b6d1710f8934a51de11c15b30c6dfba71676ed157bda6d34b12f6bd056ef7","observation_id":"262026ac-abb8-452d-ab37-c4fd094e0656","resolution":{"observed_at":"2026-08-03T03:23:09.995480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2003.13741/citation-record","integrity":"/paper/2003.13741/integrity","json":"/paper/2003.13741/citation-record.json","paper":"/paper/2003.13741"},"outbound":[],"paper":{"arxiv_id":"2003.13741","last_updated":"2020-03-30T18:43:59Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T12:37:30.813659Z","submitted_at":"2020-03-30T18:43:59Z","title":"Parallelization of Monte Carlo Tree Search in Continuous Domains"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2003.13741."}