{"as_of":"2026-08-21T19:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed7d042a7abe50442baf981082073511ac073fa0687123a6786df2735b2cdcdb","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-21T06:32:19.484+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-12T16:27:11.787841Z","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-10T20:07:29.037147Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.11102","last_updated":"2019-04-25T00:05:24Z","snapshot_observed_at":"2026-08-14T19:55:59.351891Z","submitted_at":"2019-04-25T00:05:24Z","title":"Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.11102","snapshot_observed_at":"2026-08-12T16:27:11.787841Z","title":"Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.787841Z"},"links":{"cited_paper":"/paper/1904.11102","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:0176e677ad6f2590afc0e60f3c0221139ef32552616687f445d43cd8cc722037","observation_id":"d23db40f-63cb-420e-8faf-e7ccf40ef201","resolution":{"observed_at":"2026-08-12T16:27:11.787841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.11102","last_updated":"2019-04-25T00:05:24Z","snapshot_observed_at":"2026-08-14T19:55:59.351891Z","submitted_at":"2019-04-25T00:05:24Z","title":"Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation","version":1},"cited_work":{"arxiv_id":"1904.11102","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.11102","snapshot_observed_at":"2026-08-10T20:07:29.037147Z","title":"Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation","venue":"cs.RO","work_id":"992c557a-786a-4c79-90e0-3269a6118453","year":2019},"citing_paper":{"arxiv_id":"2501.09450","last_updated":"2025-01-16T10:25:24Z","snapshot_observed_at":"2026-08-14T19:56:16.269688Z","submitted_at":"2025-01-16T10:25:24Z","title":"Real-Time Generation of Near-Minimum-Energy Trajectories via Constraint-Informed Residual Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:28.886123Z"},"links":{"cited_paper":"/paper/1904.11102","citing_paper":"/paper/2501.09450"},"observation_digest":"sha256:39e69040cdaf75925343165b4c2facf86e671976dbc9b906d19087b87474a6a1","observation_id":"60446961-0e15-492c-b50b-b9f584eab4d8","resolution":{"observed_at":"2026-08-10T20:07:29.042841Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.11102/citation-record","integrity":"/paper/1904.11102/integrity","json":"/paper/1904.11102/citation-record.json","paper":"/paper/1904.11102"},"outbound":[],"paper":{"arxiv_id":"1904.11102","last_updated":"2019-04-25T00:05:24Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-14T19:55:59.351891Z","submitted_at":"2019-04-25T00:05:24Z","title":"Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1904.11102."}