{"as_of":"2026-08-10T03:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:07cc4656eb763ff7666687cae11b1db275fdf1a8f01bcc5f3a4514ad1d07de63","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-09T06:31:02.800959+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-08T19:02:30.542700Z","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-07-02T06:06:41.130843Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.07476","last_updated":"2021-07-07T13:27:47Z","snapshot_observed_at":"2026-07-06T09:56:00.117921Z","submitted_at":"2020-09-16T05:22:44Z","title":"Path Planning using Neural A* Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.07476","snapshot_observed_at":"2026-08-08T19:02:30.542700Z","title":"Path Planning using Neural A* Search,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05526","last_updated":"2025-02-08T11:13:07Z","snapshot_observed_at":"2026-08-08T18:55:20.329856Z","submitted_at":"2025-02-08T11:13:07Z","title":"Towards Learning Scalable Agile Dynamic Motion Planning for Robosoccer Teams with Policy Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T19:02:30.542700Z"},"links":{"cited_paper":"/paper/2009.07476","citing_paper":"/paper/2502.05526"},"observation_digest":"sha256:8ee7b7eba953d3fb15266b27346990b02134e9f096ac486077e72e2340cc9f6c","observation_id":"f7d1408d-2c30-42e8-b6fd-8c70f8ae22fa","resolution":{"observed_at":"2026-08-08T19:02:30.542700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.07476","last_updated":"2021-07-07T13:27:47Z","snapshot_observed_at":"2026-07-06T09:56:00.117921Z","submitted_at":"2020-09-16T05:22:44Z","title":"Path Planning using Neural A* Search","version":3},"cited_work":{"arxiv_id":"2009.07476","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.07476","snapshot_observed_at":"2026-07-02T06:06:41.130843Z","title":"Path planning using neural A* search, 2021","venue":null,"work_id":"c731daac-19ac-4a5a-acf4-80ea77f6dcab","year":2021},"citing_paper":{"arxiv_id":"2606.04860","last_updated":"2026-06-03T13:27:46Z","snapshot_observed_at":"2026-08-05T23:50:15.315740Z","submitted_at":"2026-06-03T13:27:46Z","title":"Learning Empirically Admissible Neural Heuristics for Combinatorial Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T07:42:49.206487Z"},"links":{"cited_paper":"/paper/2009.07476","citing_paper":"/paper/2606.04860"},"observation_digest":"sha256:e29097544efc4bef946f5eecabc75d113573e88c66d13d985528ef822724c13f","observation_id":"74483690-721e-4719-8ce6-41453ef9d0be","resolution":{"observed_at":"2026-07-02T06:06:41.132374Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2009.07476/citation-record","integrity":"/paper/2009.07476/integrity","json":"/paper/2009.07476/citation-record.json","paper":"/paper/2009.07476"},"outbound":[],"paper":{"arxiv_id":"2009.07476","last_updated":"2021-07-07T13:27:47Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T09:56:00.117921Z","submitted_at":"2020-09-16T05:22:44Z","title":"Path Planning using Neural A* 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2009.07476."}