{"as_of":"2026-08-17T02:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:01cc852ee60676dd1a644533ed23448ec7db956b4e78298e3448271fc21c97d5","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:23:12.769453Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/1908.03343/citation-record","integrity":"/paper/1908.03343/integrity","json":"/paper/1908.03343/citation-record.json","paper":"/paper/1908.03343"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:13.158405Z","title":null,"venue":null,"work_id":"ebfa6f85-c15f-4982-b196-d08e86e1a03a","year":1968},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.662611Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:de78a4415a687cc73248c3f3e4cae71647eaafc5c8e304fae2643daa8b626d56","observation_id":"290c0fdf-09cf-4ad1-b710-76228c33c82e","resolution":{"observed_at":"2026-08-14T14:23:13.163288Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:13.142581Z","title":"Learning motion planning assumptions","venue":null,"work_id":"6d3cd1af-42e7-4ba8-a568-e6912ba9a6c7","year":2014},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.667978Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:b8ee81f51caacdfc8f8878ffd2eceb7e3a959d1ef1f03c411f4dec952422d790","observation_id":"876c6ac5-60b8-4cf6-9ea1-c4d8e747a193","resolution":{"observed_at":"2026-08-14T14:23:13.147856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:13.126706Z","title":"Junior: The stanford entry in the urban challenge","venue":null,"work_id":"ac114a04-52ff-4d66-9d12-132ba612375b","year":2008},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.673256Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:44a95c2d0abfc13d55c8bca4e997ab29cf8c46eaf12c2ccfa76b39ac917cb26f","observation_id":"02e59d09-f9e4-427a-8e19-8a8e49b5dd2a","resolution":{"observed_at":"2026-08-14T14:23:13.131991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:13.110744Z","title":"On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents","venue":null,"work_id":"50cbda1e-fd66-43f9-ba44-063b328e7d71","year":1957},"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":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.678514Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:f2702cd830c314952d326576274a2c6f9f3bc0ea92d5532b4a5d5e4784f1ca31","observation_id":"26ad6d20-004e-40ab-a9d0-b4f2cc5101ea","resolution":{"observed_at":"2026-08-14T14:23:13.116211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:13.095326Z","title":null,"venue":null,"work_id":"4c5c822b-077e-462f-90a3-dbb720345b02","year":1990},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.683794Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:1c932614b52cb98722cf4183e67f83ebd38470f94cb9da5a177d64d3f658da9c","observation_id":"1df35574-8cdd-45c6-b43d-4dad68aae160","resolution":{"observed_at":"2026-08-14T14:23:13.100164Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:13.079479Z","title":"Learning deconvolution network for semantic segmentation","venue":null,"work_id":"ed570963-16b5-455e-9dd1-ddecd9b7146c","year":2015},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.688861Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:083ae68905596b4dbeb7290f74e308ad03339b667df59182038c512f2652f6ec","observation_id":"d79f882b-035d-4ca9-a336-67a241c4c179","resolution":{"observed_at":"2026-08-14T14:23:13.084813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:13.062655Z","title":"Multi-Scale Context Aggregation by Dilated Convolutions","venue":null,"work_id":"906bee2c-aacd-41f4-a7e8-4fd3b37ba9c0","year":2016},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.694392Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:0041be515f75eca12b237fa03f1a87836a37fb09e56a8dfc9d4a11a7af61ce22","observation_id":"1c29c800-01b5-46f7-b84c-b753e9962416","resolution":{"observed_at":"2026-08-14T14:23:13.068189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4555","last_updated":"2015-04-20T22:26:11Z","snapshot_observed_at":"2026-08-14T23:11:19.395201Z","submitted_at":"2014-11-17T17:15:41Z","title":"Show and Tell: A Neural Image Caption Generator","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4555","snapshot_observed_at":"2026-08-14T14:23:12.699089Z","title":"Show and tell: A neural image caption generator","venue":null,"work_id":null,"year":2014},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.699089Z"},"links":{"cited_paper":"/paper/1411.4555","citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:d6aeb2f48550d1a23e4f19611cc2353c51e24bbd0643acbdb1dedc50e93a4e40","observation_id":"d6718434-706b-4a41-90be-ef060e76e3e9","resolution":{"observed_at":"2026-08-14T14:23:12.699089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.09430","last_updated":"2017-01-10T18:06:51Z","snapshot_observed_at":"2026-08-14T21:37:30.204671Z","submitted_at":"2016-09-29T17:04:50Z","title":"CNN Architectures for Large-Scale Audio Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.09430","snapshot_observed_at":"2026-08-14T14:23:12.704191Z","title":null,"venue":null,"work_id":null,"year":2016},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.704191Z"},"links":{"cited_paper":"/paper/1609.09430","citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:ea62b77ebc7846988f0cbfd8a550b3a7e3b4bca2cc39249892b27ee92aa5e628","observation_id":"a792c094-537f-41a8-8105-ec07d55a7017","resolution":{"observed_at":"2026-08-14T14:23:12.704191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:13.047086Z","title":"Mastering the game of go without human knowledge","venue":null,"work_id":"25e33598-cfa2-4e72-b034-a1c617ce18bd","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":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.709363Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:d49d8e3e1380d0ace499e5408936cf27d32b93c44187d4d490b1159f0d32dcc1","observation_id":"eef8db0c-7fc8-4118-8df9-e6f206ffd568","resolution":{"observed_at":"2026-08-14T14:23:13.052186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:13.030753Z","title":"Rusu, Joel Veness, Marc G","venue":null,"work_id":"a39d3b0d-ee16-4301-a0b0-e7f5b3d0eab3","year":2015},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.715268Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:4e64bc61fc21c5498aee7388cb713faeb10e81846524fcf616d6f62652707b7c","observation_id":"7c3e753b-0cde-4b6c-a40a-f2735a389c99","resolution":{"observed_at":"2026-08-14T14:23:13.036000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:13.014484Z","title":"Learning heuristic search via imitation","venue":null,"work_id":"0eac7b10-b670-4fda-9321-3caf5ecab6fd","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":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.719964Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:a45c6413697ba7cdcf6305a0d120d35ef27871be8153638b8947c684cf8584de","observation_id":"7a8d8584-22b4-484b-b120-b27066320f5a","resolution":{"observed_at":"2026-08-14T14:23:13.019544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1011.0686","last_updated":"2011-03-16T18:51:21Z","snapshot_observed_at":"2026-08-15T05:04:07.152443Z","submitted_at":"2010-11-02T17:55:55Z","title":"A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1011.0686","snapshot_observed_at":"2026-08-14T14:23:12.724824Z","title":"Gordon, and J","venue":null,"work_id":null,"year":2010},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.724824Z"},"links":{"cited_paper":"/paper/1011.0686","citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:6baf5cf67d85b8e014f0b8852d3ba2ba24d19d99bb27ae2eb654195c40620fb5","observation_id":"3649be41-7157-42a3-86df-ffb56fc11488","resolution":{"observed_at":"2026-08-14T14:23:12.724824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.5979","last_updated":"2014-06-23T17:00:28Z","snapshot_observed_at":"2026-08-14T23:29:22.914436Z","submitted_at":"2014-06-23T17:00:28Z","title":"Reinforcement and Imitation Learning via Interactive No-Regret Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.5979","snapshot_observed_at":"2026-08-14T14:23:12.729703Z","title":"Andrew Bagnell","venue":null,"work_id":null,"year":2014},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.729703Z"},"links":{"cited_paper":"/paper/1406.5979","citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:b952e95fe441ff7039a5b589aaa2164dcd08cdd3f72edf86006591cfe39ddb27","observation_id":"0125d8ef-bde2-443c-98ca-1945c74bfbfb","resolution":{"observed_at":"2026-08-14T14:23:12.729703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:12.996054Z","title":"Watch this: Scalable cost-function learning for path planning in urban environments","venue":null,"work_id":"e2a861dc-3be7-4cde-89ef-9b4c1c3ce1ef","year":2016},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.734689Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:19d0a48f1507e4bfd36a8bd0d5a196bd87e6ca3e1f0c0d5c2f02a0b4a36b5750","observation_id":"2927cee1-10fb-477f-a9f8-a688ab1c7cc5","resolution":{"observed_at":"2026-08-14T14:23:13.002406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:12.978346Z","title":"Maximum entropy deep inverse reinforcement learning","venue":null,"work_id":"603a3ec1-800f-4d73-99b4-1d5de4ed5f01","year":2015},"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":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.739559Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:0062632df55ca760c82b524bededccc1b15f5936997e150af684b344f687cdcf","observation_id":"df1300d0-455f-479a-86b6-d16c56799cae","resolution":{"observed_at":"2026-08-14T14:23:12.983692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:12.961890Z","title":"GOSELO: goal-directed obstacle and self-location map for robot navigation using reactive neural networks","venue":null,"work_id":"c56e2b91-5ada-4118-b80c-7d538a63bd61","year":2018},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.744465Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:73385112cc41c9e22ddd5342ae632e8b832d351ce9dd2879f81bb061f068a031","observation_id":"725a489f-3ab4-4368-ba0a-a059f331253a","resolution":{"observed_at":"2026-08-14T14:23:12.967065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:12.946056Z","title":null,"venue":null,"work_id":"827d8a80-0589-4074-82c5-754450b9dc41","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":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.749429Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:976099556ecd84a868a97655a72656e85f0715c0e75d856002a762ae8d0c60a3","observation_id":"ca350afc-5394-4c49-9ba4-2b57d9d66695","resolution":{"observed_at":"2026-08-14T14:23:12.950896Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:12.929907Z","title":"Value iteration networks","venue":null,"work_id":"f3af7a96-1ba9-4ef2-8106-04e9252e6fab","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":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.754793Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:3952d3fa8fb91fb1661826ce444a135fef0b96a6c905c9846cd5e6d72a58f673","observation_id":"cb4a618b-56b1-45a4-a911-afe645d99547","resolution":{"observed_at":"2026-08-14T14:23:12.934860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:23:12.913765Z","title":"Cognitive mapping and planning for visual navigation","venue":null,"work_id":"7f8d1790-8366-4459-b715-aafd8ad36f04","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":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.759658Z"},"links":{"citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:ffd27066e9790bd1ae1e463ef13f0ac138f7508412221a2f47ca4a0af8973980","observation_id":"1fec991c-5aad-46b8-bfd5-a8c02e9aed12","resolution":{"observed_at":"2026-08-14T14:23:12.918925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"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"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-14T14:23:12.769453Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2014},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-14T14:23:12.769453Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/1908.03343"},"observation_digest":"sha256:d1aa874452f70cb713191ce03c4a30c2e44ba6a7f2c7fc201538f42ac3078cc4","observation_id":"dd530026-ff69-4c7a-bc9c-dcf836646200","resolution":{"observed_at":"2026-08-14T14:23:12.769453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.03343","last_updated":"2019-08-09T07:27:28Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":13},"total_outbound_references":22},"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 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:1908.03343."}