{"as_of":"2026-08-16T16:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2ef32922f70d9493ee16f5e762ab027d5b613b0a49941dea4f8486f8d862edc","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:54:05.152479Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"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.02361/citation-record","integrity":"/paper/1908.02361/integrity","json":"/paper/1908.02361/citation-record.json","paper":"/paper/1908.02361"},"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:54:05.910814Z","title":"Azarm and G","venue":null,"work_id":"2e5d79a7-c394-4dcc-8355-f6975249d834","year":1997},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:04.993802Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:bca65a35c447a45cef1397c4db574660ec12c23faf6757e020b9e549cf159ec7","observation_id":"700a11b2-80fd-4031-9bba-7e5524d75b45","resolution":{"observed_at":"2026-08-14T14:54:05.916476Z","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:54:05.889041Z","title":"Bennewitz, W","venue":null,"work_id":"2a6fae53-1ecc-4381-9721-6996995a3586","year":2002},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.001257Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:4955ccf78cf2404ee7bb6fd0b3aa0fdb18de98127218e0fb3e075ffe7d853481","observation_id":"3d7c4eb9-f4e5-464b-9295-297a4cc32edb","resolution":{"observed_at":"2026-08-14T14:54:05.896270Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:54:05.007718Z","title":"Bhattacharya, R","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.007718Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:9d80e1237b2009e91eccced84cea822887f8979c8e311e10c8d744cbd11a0a7f","observation_id":"9fb8ec6f-f9d2-4d55-a34a-17ee136ff71b","resolution":{"observed_at":"2026-08-14T14:54:05.007718Z","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":"10.1007/s10514-012-9304-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:54:05.196385Z","title":"Bhattacharya, M","venue":null,"work_id":"39227626-afbd-4135-8750-59ea5e2bc16b","year":2012},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.014144Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:ab594466bf2dc0dc90797be1f69668604c8d10e2f7b92e180aa2f691d3f8cc12","observation_id":"3da95b77-ced5-456e-8515-c55fe8f889ee","resolution":{"observed_at":"2026-08-14T14:54:05.205137Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:54:05.869657Z","title":"C´ ap, P","venue":null,"work_id":"1b326ec7-9bf4-403d-a5b2-699a7f48eef6","year":2013},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.020767Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:8f0e34e53b1e3caafe8b635630e387fcbdc245460408a339391fef15dfa07b09","observation_id":"c2fcaf3e-5e6f-4568-b08a-5f3adb2e8ac9","resolution":{"observed_at":"2026-08-14T14:54:05.875337Z","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:54:05.846012Z","title":null,"venue":null,"work_id":"7b16b59c-c649-487b-be07-f53933267db2","year":2015},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.026587Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:f9d68598059b25c2d30aaffb2aa67df2fb4ef02a7a2b86450d13687cc6c5ed51","observation_id":"029ed743-d466-4451-8c7f-8b238f45c88e","resolution":{"observed_at":"2026-08-14T14:54:05.854118Z","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:54:05.819370Z","title":null,"venue":null,"work_id":"95293b55-ba1a-40d7-a4bf-2956e896bc09","year":2002},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.033651Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:e347a1b6f80cc1c78e99ae610b639c93ba58e9ec1828689dfcc252d0bc868b9c","observation_id":"b053d19d-d042-44dc-84d7-432a6fb52771","resolution":{"observed_at":"2026-08-14T14:54:05.827703Z","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:54:05.791814Z","title":null,"venue":null,"work_id":"4291db6d-9e2d-43a1-8e78-85332d2ff16b","year":2013},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.039195Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:68ce4dc42b122f049629d55a573c0a83e176524c9e77392e67df15c85b78641a","observation_id":"544e608c-8abf-41b5-acf7-fcbd7775a218","resolution":{"observed_at":"2026-08-14T14:54:05.798177Z","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:54:05.764636Z","title":"Enright and P","venue":null,"work_id":"11fac504-a31b-4fd4-96cc-c571647a9443","year":2011},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.047546Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:17cc6a56791f1837aca5bb905d1ff0e6b60aee5aa3f9b15ce24647e4cece56e0","observation_id":"261b21ff-92e6-4710-b77e-9d4ddbbb1a4a","resolution":{"observed_at":"2026-08-14T14:54:05.771089Z","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:54:05.744496Z","title":"Erdmann and T","venue":null,"work_id":"80967a79-b85d-43c0-840f-55f415d1159d","year":1987},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.053910Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:7e3daabae97f3f608961ae96647a968ca1524f07805122112633804cb64cf9fd","observation_id":"25b3e40f-3360-4e5f-a318-6ca31c77891d","resolution":{"observed_at":"2026-08-14T14:54:05.750508Z","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:54:05.720123Z","title":"Ferner, G","venue":null,"work_id":"fb8dbe46-c684-446c-bd3d-ef6810ac465f","year":2013},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.061375Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:01c738eae74326fb766a99e801c486bafac07e3d1a4490ba9f226221317e5691","observation_id":"32fd042d-6c6d-424a-8161-c27faf64b764","resolution":{"observed_at":"2026-08-14T14:54:05.726540Z","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:54:05.700503Z","title":"Grippa, D","venue":null,"work_id":"fc9879d2-78a5-483c-b21a-8e207bf3d1bc","year":2017},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.067386Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:a17f827d60f6b34d730d1c4febde2cf2736b10b818444bcf5d18d43110dabfac","observation_id":"9a7f1613-04e6-43d0-86ad-e20a34ec811b","resolution":{"observed_at":"2026-08-14T14:54:05.706237Z","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:54:05.681735Z","title":"H¨ onig, T","venue":null,"work_id":"7db9f0fd-ab8c-4797-a00b-1a36e52cf6ba","year":2016},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.073832Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:76c4b639b05876f68e2d9c444569fc1fb51aa0ea3ba8a045c5fd58fd8cc36402","observation_id":"b3a761a9-65cc-443b-b86b-0d95c2d9e331","resolution":{"observed_at":"2026-08-14T14:54:05.688370Z","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:54:05.659439Z","title":"Hyldmar, Y","venue":null,"work_id":"76873db2-9c44-4fd5-ab98-c01ee753b82f","year":2019},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.079469Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:a012cd254eb0a0e3c972af343af81cdb387347e9e70abcba1fd1b37e91f20f21","observation_id":"7ffbb1d5-2451-4007-ba50-bb1e2e20854b","resolution":{"observed_at":"2026-08-14T14:54:05.666372Z","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:54:05.636619Z","title":"Kant and S","venue":null,"work_id":"7c8ff571-2ae0-4304-8023-5b4211d8a5c7","year":1986},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.085223Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:a8577140757fe4e2dc5be2053a78d35a784227378e798b900fe9088fa286e483","observation_id":"5b10a57d-5509-49c5-839a-60e0e3319d9b","resolution":{"observed_at":"2026-08-14T14:54:05.642117Z","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:54:05.617750Z","title":"Kantor, S","venue":null,"work_id":"401bf0cf-50b5-4459-a92a-eeea03cdbfb9","year":2003},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.090605Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:c935e2cfb5fc10cc263d0883d4b9673d87682ac5064ac2d09e55ecb8beccfddf","observation_id":"8a38ed4f-c4fa-4666-96c3-733529f9383d","resolution":{"observed_at":"2026-08-14T14:54:05.624343Z","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":"1812.06356","last_updated":"2018-12-15T21:00:17Z","snapshot_observed_at":"2026-08-14T17:43:06.027878Z","submitted_at":"2018-12-15T21:00:17Z","title":"Searching with Consistent Prioritization for Multi-Agent Path Finding","version":1},"cited_work":{"arxiv_id":"1812.06356","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.06356","snapshot_observed_at":"2026-08-14T14:54:05.232797Z","title":"Searching with Consistent Prioritization for Multi-Agent Path Finding","venue":"cs.AI","work_id":"5563d75c-a952-486c-8f5c-83e1dc946874","year":2018},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.096690Z"},"links":{"cited_paper":"/paper/1812.06356","citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:c5f8a48ed6a864b3b29538b3c417c0f59f073db7972938654008f719843af670","observation_id":"3d20143a-d86e-4fd1-b632-da88326e49da","resolution":{"observed_at":"2026-08-14T14:54:05.241381Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:54:05.595514Z","title":"Pavone, S","venue":null,"work_id":"e929194a-5ee5-4888-b8aa-fa9f881adba5","year":2012},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.103401Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:c5ecf3a4ed11d626965d84eef3184c9992b742bef01f42f2510fff4a8c1015d3","observation_id":"1cf1fb50-569d-4bfa-ae23-c235f0b3e421","resolution":{"observed_at":"2026-08-14T14:54:05.603973Z","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:54:05.572405Z","title":"Regele and P","venue":null,"work_id":"7427cab6-d2cf-4dd9-9bb4-ee5689d037dd","year":2006},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.111220Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:e382a553d36e24ccf7c2bc7e711d12ccb0354ff19d26f347fede38ba31a4268f","observation_id":"fa30621d-8e97-4081-90f6-2404d5dca005","resolution":{"observed_at":"2026-08-14T14:54:05.578510Z","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:54:05.548377Z","title":"Sharon, R","venue":null,"work_id":"e6a7fd2a-743c-40c0-9f09-77b1bb837c92","year":2015},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.118504Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:8f2cbd957a43f4f72018f8cd14454df42ee255727f94aed59b6a522830fab3d2","observation_id":"3276c43b-6cc3-4c71-bcf0-2ffb8ef4d45e","resolution":{"observed_at":"2026-08-14T14:54:05.554968Z","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:54:05.526921Z","title":null,"venue":null,"work_id":"0bee5d95-f94a-4db5-b999-75f2adefdd12","year":2005},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.124447Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:f47f042b1ecaa207c904beda7a7fff0292962e0b3a0bf32b32abf86567130529","observation_id":"c09cf80d-123f-4960-a145-6fe018e781a8","resolution":{"observed_at":"2026-08-14T14:54:05.533814Z","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:54:05.501470Z","title":"Turpin, K","venue":null,"work_id":"1b44211b-658b-4754-b0ec-d4efebfe7f87","year":2014},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.130332Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:402c02808cc71c231bd7dc1c3b40631904ab923d033addb79856499123fbeba8","observation_id":"024d4050-d4ea-4801-b259-46982005fe96","resolution":{"observed_at":"2026-08-14T14:54:05.508526Z","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:54:05.477835Z","title":null,"venue":null,"work_id":"0e94b8cc-10fb-4439-9b4a-2d37cf54c4d1","year":2005},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.135573Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:41f462b66c300f911a8de4dc7a695c03fd120cda811f2d047fb6885936fcdc31","observation_id":"50607ddd-2a08-4139-8600-7c48af819f9d","resolution":{"observed_at":"2026-08-14T14:54:05.486789Z","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:54:05.452550Z","title":"V elagapudi, K","venue":null,"work_id":"da45fc42-29a9-4d4b-bd71-169a2eaed6ec","year":2010},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.141005Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:c21c620dede6395bc60a89a519dd452b65c54232311028b3989b46faed53d281","observation_id":"70cbd6ce-718c-49e7-a546-600512aa902c","resolution":{"observed_at":"2026-08-14T14:54:05.459488Z","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:54:05.426487Z","title":"Wagner and H","venue":null,"work_id":"4790d3de-eb7b-415a-b4a4-628a646a1dd4","year":2011},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.146780Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:3e6766d09dd02fb7cda1104aea112725bfe8c147d9c267d43b73f09be4a7aa8b","observation_id":"f4106d4e-a973-475b-a066-0b2902d61bd5","resolution":{"observed_at":"2026-08-14T14:54:05.433244Z","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:54:05.404658Z","title":"Y u and S","venue":null,"work_id":"f2620030-b807-45cf-8a26-e92305951346","year":2013},"citing_paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:05.152479Z"},"links":{"citing_paper":"/paper/1908.02361"},"observation_digest":"sha256:bd751cbf9aa8b0f53e2a439a2f5cd6209011d294eacc7f5bddc40019889e359a","observation_id":"5af8d9c6-244c-44e0-a840-d790829e24e1","resolution":{"observed_at":"2026-08-14T14:54:05.411260Z","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"}}],"paper":{"arxiv_id":"1908.02361","last_updated":"2019-08-06T20:55:25Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-16T08:19:43.561454Z","submitted_at":"2019-08-06T20:55:25Z","title":"Multi-Robot Path Deconfliction through Prioritization by Path Prospects"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":2,"verified_fuzzy":18},"total_outbound_references":26},"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 16 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:1908.02361."}