{"as_of":"2026-08-13T11:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:897d08114735b56800e0a2980812482585d0b54ed29ee85a86e5644ddbd4e334","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-12T12:21:45.397683Z","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-05T14:49:19.607588Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1903.00070","last_updated":"2020-02-23T08:49:42Z","snapshot_observed_at":"2026-07-06T07:36:16.247146Z","submitted_at":"2019-02-28T20:53:13Z","title":"Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.00070","snapshot_observed_at":"2026-08-12T12:21:45.397683Z","title":"Learn- ing to plan in high dimensions via neural exploration-exploitation trees","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2411.17293","last_updated":"2024-11-26T10:32:28Z","snapshot_observed_at":"2026-08-13T05:58:23.960035Z","submitted_at":"2024-11-26T10:32:28Z","title":"SIL-RRT*: Learning Sampling Distribution through Self Imitation Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:45.397683Z"},"links":{"cited_paper":"/paper/1903.00070","citing_paper":"/paper/2411.17293"},"observation_digest":"sha256:bb422afa1e9d0c1e22b17af666bf3e37428b72187565e861de45ed2d7c6ea5ca","observation_id":"251f8149-6510-4c68-9c63-fffeee7fe8ed","resolution":{"observed_at":"2026-08-12T12:21:45.397683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.00070","last_updated":"2020-02-23T08:49:42Z","snapshot_observed_at":"2026-07-06T07:36:16.247146Z","submitted_at":"2019-02-28T20:53:13Z","title":"Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees","version":4},"cited_work":{"arxiv_id":"1903.00070","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.00070","snapshot_observed_at":"2026-08-05T14:49:19.607588Z","title":"Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees","venue":"cs.LG","work_id":"42ab3f80-22a6-4d0e-b65f-4f8241a88b39","year":2019},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-09T16:23:30.857921Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.481374Z"},"links":{"cited_paper":"/paper/1903.00070","citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:d0abffd5eb73157e530c68e07501fa82a7ade8bd19686abd8d71697159354df1","observation_id":"d21ee56e-ef37-4494-91e1-b19b5241644c","resolution":{"observed_at":"2026-08-05T14:49:19.614752Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/1903.00070/citation-record","integrity":"/paper/1903.00070/integrity","json":"/paper/1903.00070/citation-record.json","paper":"/paper/1903.00070"},"outbound":[],"paper":{"arxiv_id":"1903.00070","last_updated":"2020-02-23T08:49:42Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:36:16.247146Z","submitted_at":"2019-02-28T20:53:13Z","title":"Learning to Plan in High Dimensions via Neural Exploration-Exploitation 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 2 inbound Pith citation observations for arXiv:1903.00070."}