{"as_of":"2026-08-17T01:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9db645e860eb6c3d4f74f40969969c5f8b24324cf0da2c5d625d28b9687f75bf","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:23:12.764625Z","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-14T14:23:12.825582Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1704.00264","last_updated":"2017-04-02T08:21:30Z","snapshot_observed_at":"2026-08-16T19:42:57.635799Z","submitted_at":"2017-04-02T08:21:30Z","title":"Potential Functions based Sampling Heuristic For Optimal Path Planning","version":1},"cited_work":{"arxiv_id":"1704.00264","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.00264","snapshot_observed_at":"2026-08-14T14:23:12.825582Z","title":"Potential Functions based Sampling Heuristic For Optimal Path Planning","venue":"cs.RO","work_id":"e450b7be-8a6b-437c-854c-776eb627aa88","year":2017},"citing_paper":{"arxiv_id":"1908.03343","last_updated":"2019-08-09T07:27:28Z","snapshot_observed_at":"2026-08-16T13:04:02.667856Z","submitted_at":"2019-08-09T07:27:28Z","title":"Fully Convolutional Search Heuristic Learning for Rapid Path Planners","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.764625Z"},"links":{"cited_paper":"/paper/1704.00264","citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:3550a4a6648ba8dbb99bdea723476d65f446850fcda990a348885aaaa85586b8","observation_id":"d5c52d69-eb4d-4da4-bae6-a00b81e98f9f","resolution":{"observed_at":"2026-08-14T14:23:12.832701Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1704.00264/citation-record","integrity":"/paper/1704.00264/integrity","json":"/paper/1704.00264/citation-record.json","paper":"/paper/1704.00264"},"outbound":[],"paper":{"arxiv_id":"1704.00264","last_updated":"2017-04-02T08:21:30Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-16T19:42:57.635799Z","submitted_at":"2017-04-02T08:21:30Z","title":"Potential Functions based Sampling Heuristic For Optimal Path Planning"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1704.00264."}