{"as_of":"2026-08-16T09:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:80666a0bdae46c0829906883ab7a3fdb3afd6cdaf1a9b447f8524a990d3ebecd","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:13:01.050263Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"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.05630/citation-record","integrity":"/paper/1908.05630/integrity","json":"/paper/1908.05630/citation-record.json","paper":"/paper/1908.05630"},"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-14T13:13:01.177555Z","title":null,"venue":null,"work_id":"22596db3-7601-423a-927b-ac5ae41e4f07","year":2009},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.010335Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:b6f39ba6932a4fde3092943ee4f3207e52aaa95919f23d23e5e205440f74aedc","observation_id":"2090a74e-c91e-4a3b-be39-4271f739fabd","resolution":{"observed_at":"2026-08-14T13:13:01.180933Z","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-14T13:13:01.168964Z","title":null,"venue":null,"work_id":"7b2995f9-b237-4aec-9268-79dd87e49667","year":2007},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.013884Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:08bb4a2b51bc15128039737d251c1d5485c310751f9558303512f1edeb80a473","observation_id":"4a75821c-c6f2-4dec-9997-6a3a860ef3a6","resolution":{"observed_at":"2026-08-14T13:13:01.172406Z","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-14T13:13:01.160911Z","title":null,"venue":null,"work_id":"963be95c-27b8-470c-a599-35733dcae0cf","year":2010},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.017553Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:95a88de9b3b8325a82b355dd9f5943b660e8595d54723aeabe4a5a4e3b7a5b6f","observation_id":"fbaac279-64f9-4a43-965a-415350324850","resolution":{"observed_at":"2026-08-14T13:13:01.163736Z","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-14T13:13:01.151329Z","title":null,"venue":null,"work_id":"352856a9-de6a-4a3f-b81b-8c324fb8c144","year":1993},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.020639Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:ec1e0a6fb46ca8b1b2075cee5810cecf6de9ffc3bd7227d1e6d2d4a6a00a3e79","observation_id":"65fd22bd-10b7-42f7-80f2-c72e94d6688c","resolution":{"observed_at":"2026-08-14T13:13:01.155315Z","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-14T13:13:01.142432Z","title":null,"venue":null,"work_id":"362c4bde-b89a-4bba-9c39-adf1bea7d11b","year":2011},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.023674Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:cd707459bd54fe43e71d9add9f79e9aff7b8a1b301d087b34ba6644ba0430591","observation_id":"1561e39d-ef18-408b-bcf4-f7759e0f9719","resolution":{"observed_at":"2026-08-14T13:13:01.145931Z","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-14T13:13:01.133763Z","title":null,"venue":null,"work_id":"501a19e6-798f-421f-8357-387cfa072622","year":2008},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.026918Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:f135551124e0409bbcef44cdaeeaf8ed600bd76b03f77c11f6e5889ffe8f4622","observation_id":"743f13af-b904-494e-825f-aa3ce5fe5bc0","resolution":{"observed_at":"2026-08-14T13:13:01.137085Z","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-14T13:13:01.124633Z","title":"and Simic, M","venue":null,"work_id":"f8f34eb1-6cb4-4006-bd53-c501ce04aa22","year":2014},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.030988Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:8a57b3f43f1b12fbc32ba6526ab9ac9c39730ad4aa567e3427b7c70ff2b71c6a","observation_id":"644a865a-f061-42f4-b91c-aa4a43cdae67","resolution":{"observed_at":"2026-08-14T13:13:01.127937Z","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-14T13:13:01.115628Z","title":null,"venue":null,"work_id":"cebd20f1-1b5f-4d72-b9a7-6ef7332eb90f","year":2006},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.033782Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:06e32f86d78130f5b3ac8442164b22aefa64ca5a8864723baf48c65de79e8954","observation_id":"b3b5301d-4fba-4cca-a34f-2f3ba8a5851a","resolution":{"observed_at":"2026-08-14T13:13:01.118919Z","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-14T13:13:01.106340Z","title":null,"venue":null,"work_id":"f09b9560-1c67-4f15-8c50-f3ae29f74ea7","year":2009},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.036812Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:dc98051eac1aaec6dc907beea3ae591ccc17efe55933aa4cd8001cd9fa6483a2","observation_id":"af3a04cb-c255-41eb-a62c-f13344a4ff4e","resolution":{"observed_at":"2026-08-14T13:13:01.109540Z","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-14T13:13:01.097587Z","title":"and Shamma, J.S","venue":null,"work_id":"d4141975-b5f1-480d-9d76-a8b9b4ef9086","year":2012},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.039719Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:2af2b589a2b70b1098a68f075fffd4d2666922f96c747066d836609ac628c519","observation_id":"6054625a-04ce-4657-933f-9fbb58e6ef7e","resolution":{"observed_at":"2026-08-14T13:13:01.100687Z","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-14T13:13:01.088590Z","title":null,"venue":null,"work_id":"a34535ec-e065-493d-b906-aac78c82b16f","year":2013},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.042727Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:716f18ce4d4560e927b7bcd095367c91fdc31e287633ee0b624f6677f435eb6b","observation_id":"2a390916-2981-41f3-9dc8-ee700699f149","resolution":{"observed_at":"2026-08-14T13:13:01.091538Z","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-14T13:13:01.079248Z","title":"and Wolpert, D.H","venue":null,"work_id":"d7fc9050-bc59-4a2b-9ef0-720594c775cc","year":2004},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.046318Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:47eecbb85884b64a1ff53863bcff48ab112052bf5bb5ad27fdf0fa7cee1d5d8c","observation_id":"5ab4198d-b50a-407f-99f4-aecab3437494","resolution":{"observed_at":"2026-08-14T13:13:01.082337Z","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-14T13:13:01.068053Z","title":"and Mart´ ınez, S","venue":null,"work_id":"fce4750d-3905-42e5-aa88-4e4c4d37ce7f","year":2013},"citing_paper":{"arxiv_id":"1908.05630","last_updated":"2019-08-15T16:41:56Z","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:13:01.050263Z"},"links":{"citing_paper":"/paper/1908.05630"},"observation_digest":"sha256:8d7ecd904d5af482ed495945a3ac1b4c4f66a67768a3b0b5bade5a080dc67a93","observation_id":"2e2192fa-b452-49e4-9838-c1369af3b7df","resolution":{"observed_at":"2026-08-14T13:13:01.072076Z","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.05630","last_updated":"2019-08-15T16:41:56Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-14T13:05:38.122551Z","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":13},"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 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:1908.05630."}