{"as_of":"2026-08-06T03:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c36d56490d83ddf83ea3859e9533a288ced22e37bcab6bf6fb9f1e9185a4828","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T23:14:06.926188Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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/1907.05300/citation-record","integrity":"/paper/1907.05300/integrity","json":"/paper/1907.05300/citation-record.json","paper":"/paper/1907.05300"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Modeling and control of formations of nonholonomic mobile robots","venue":null,"work_id":"a5881959-8caf-48c0-811d-79072831cfa5","year":2001},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:a695291340f842a51fc9181714bfb045fb6265c9edaf6a7dba335822dd503f89","observation_id":"4d8a1f44-6e0c-460c-b257-e8d051fd00d2","resolution":{"observed_at":"2026-05-24T23:15:03.688242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Multi-robot navigation in formation via sequential convex programming","venue":null,"work_id":"24145633-bbaf-4dca-b329-2f5ac7adc658","year":2015},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:c169cda2940c0c821a01c7cf06db7cc4c629dc357fe44c59e4550b20a90cdc27","observation_id":"4bb1cb42-0f8e-44c4-ac11-431fc9dc65ae","resolution":{"observed_at":"2026-05-24T23:15:03.737277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Dynamic perimeter surveillance with a team of robots","venue":null,"work_id":"2e13babf-6efb-4901-992c-9f3a8fd81acc","year":2016},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:509db50da3a15433969fbadd95ace0709999775b9b9448740f4e9b7ebbfe9e56","observation_id":"b212207a-39de-46b1-944e-b152291c00a5","resolution":{"observed_at":"2026-05-24T23:15:03.706938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Efficient multi- robot motion planning for unlabeled discs in simple polygons","venue":null,"work_id":"d7ed2b3d-7479-420a-8c2f-2b616fbc6b81","year":2015},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:cdb45a8b0441ad64f2993a749a62020ecd0cb86c680a8fbd5f4e52fcd9c56df4","observation_id":"02d60e25-5524-4eaa-bbf5-c5535d1dad03","resolution":{"observed_at":"2026-05-24T23:15:03.710617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Scram: Scalable collision- avoiding role assignment with minimal-makespan for formational po- sitioning","venue":null,"work_id":"0e99bb9d-3223-405e-9bae-fa89dc72f12b","year":2015},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:a343ee32962569dc1bede2647d04a17715962518490c98cbc76976d217ca0f92","observation_id":"3a8bb6c1-4703-4a91-bac2-830282dcacae","resolution":{"observed_at":"2026-05-24T23:15:03.741115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Distance optimal formation control on graphs with a tight convergence time guarantee","venue":null,"work_id":"c4a173b1-71f8-4ae8-810c-afdc4edae78a","year":2012},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:47f5b0abd804822ebd30f470fbd0f58c2e363af40874f085d1faca2d18eb2591","observation_id":"440b1b34-dd5e-4024-946f-41ce07138a6b","resolution":{"observed_at":"2026-05-24T23:15:03.714026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Capt: Concurrent assignment and planning of trajectories for multiple robots","venue":null,"work_id":"f4059dd5-e6b9-4b46-9945-e326e2007b8f","year":2014},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:693f1d6539ce9e2b7841ffe4ec4a7ebe36f63f80a614e5f13d9dfdb430a00ef3","observation_id":"10da4345-bc9c-4e3e-9f9a-790df4082c23","resolution":{"observed_at":"2026-05-24T23:15:03.699512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Multi-agent path planning and network flow","venue":null,"work_id":"60787257-1547-4a48-a739-170f648ec4bb","year":2013},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:337a6bfb702f4ccd3643fecbe73ec644edc96532a18668bd44b588abf858005c","observation_id":"afaa5bc8-29b8-4497-8d82-ce9cb3dcbf53","resolution":{"observed_at":"2026-05-24T23:15:03.703222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Goal assignment and trajectory planning for large teams of interchangeable robots","venue":null,"work_id":"f32b1e14-e0e0-40a9-b39f-06a8009b843f","year":2014},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:aae9d93e7367387d2527836abedbbe04ec139972e8ea15c9a6c52f7313603303","observation_id":"e2b642ed-b7d1-4c9c-b5eb-4b4080dd8e16","resolution":{"observed_at":"2026-05-24T23:15:03.720702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Multi-agent actor-critic for mixed cooperative-competitive environ- ments","venue":null,"work_id":"a0423182-8fbc-4630-b214-38bf767736c7","year":2017},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:430375b5ce0e6199b03c1663a98d752758efb9537eae3755706b0100ad71034c","observation_id":"621ca707-aa88-49a4-b153-c792ad9e459a","resolution":{"observed_at":"2026-05-24T23:15:03.692117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.08926","last_updated":"2024-12-11T14:05:03Z","snapshot_observed_at":"2026-07-06T05:44:09.511384Z","submitted_at":"2017-05-24T18:52:17Z","title":"Counterfactual Multi-Agent Policy Gradients","version":3},"cited_work":{"arxiv_id":"1705.08926","doi":"10.48550/arxiv.1705.08926","metadata_source":"arxiv_reference","pith_arxiv_id":"1705.08926","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Counterfactual multi-agent policy gradients","venue":"arXiv (Cornell University)","work_id":"46f16ace-e28d-44ed-9445-985daf6908ef","year":2024},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"cited_paper":"/paper/1705.08926","citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:03ceee67562f587b325fa7302f52df067b3362c6d27c1e45cf9d7c88c04e2be4","observation_id":"c21374de-a97b-4c88-8cab-d545eb51d4c4","resolution":{"observed_at":"2026-05-24T23:15:03.085814Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Markov games as a framework for multi-agent reinforcement learning","venue":null,"work_id":"f4265f17-764e-4f96-8935-d72b813bac0b","year":1994},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:f5a0f0656dbeff0c2b15588fadac4276fb2bec6b09d2df34bd1734832b453e4c","observation_id":"4857f8d4-5a3e-49ad-b734-75bd30103832","resolution":{"observed_at":"2026-05-24T23:15:03.695804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1509.02971","last_updated":"2019-07-05T10:47:27Z","snapshot_observed_at":"2026-07-06T04:29:24.362640Z","submitted_at":"2015-09-09T23:01:36Z","title":"Continuous control with deep reinforcement learning","version":6},"cited_work":{"arxiv_id":"1509.02971","doi":"10.1137/22m1480409","metadata_source":"pith","pith_arxiv_id":"1509.02971","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Continuous control with deep reinforcement learning","venue":"cs.LG","work_id":"41a65444-c819-4303-a1f1-b075aa86d40c","year":2015},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"cited_paper":"/paper/1509.02971","citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:7f3a705eb773dafb3cdf5820751d68836cb1f2a71e2064dc3c0e3be4516c9614","observation_id":"2e58ca2e-00f4-4f2b-bd40-bc7da6e05eae","resolution":{"observed_at":"2026-05-24T23:15:03.071251Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4221478c-4a8b-4c27-bf0d-ca0ee48dff36","year":1998},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:3857977108f497ed260a726fad7198dd0ac5e1f51e49686b6fad4c3f00d90a34","observation_id":"2b7f7ed6-7522-4948-a21f-1456602e9ddd","resolution":{"observed_at":"2026-05-24T23:15:03.726684Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5602","last_updated":"2013-12-19T16:00:08Z","snapshot_observed_at":"2026-07-06T03:31:23.521122Z","submitted_at":"2013-12-19T16:00:08Z","title":"Playing Atari with Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"1312.5602","doi":"10.48550/arxiv.1312.5602","metadata_source":"pith","pith_arxiv_id":"1312.5602","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Playing Atari with Deep Reinforcement Learning","venue":"cs.LG","work_id":"736a8ddf-e365-4940-ad58-4699fddedb86","year":2013},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"cited_paper":"/paper/1312.5602","citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:76148502a5e101893d91d42f094a4cc2d32f0918e9195dcc9b207932731e1f54","observation_id":"af931db0-cd7e-46bc-982f-72218778de77","resolution":{"observed_at":"2026-05-24T23:15:03.111784Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Multi-agent reinforcement learning: Independent vs. cooper- ative agents","venue":null,"work_id":"3b32c465-6799-4544-bef0-a8f81c9aa30d","year":null},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:01d2c8263464aea8ba77ff32ebcc6089bc3defcfc3f347157c953c0c7628e43f","observation_id":"3d11df1c-b515-4a0a-b0bf-a56463bce6b8","resolution":{"observed_at":"2026-05-24T23:15:03.733992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Motion planning in dynamic environments using velocity obstacles","venue":null,"work_id":"08949872-e080-4bc6-88e2-b625270b9bd6","year":1998},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:e4dea4a2dd54c6be7a732b200e356a1be0b15ed93ec54f070f181b8b8a349c55","observation_id":"8b838477-06bf-48a6-a5df-f6b32e159178","resolution":{"observed_at":"2026-05-24T23:15:03.744804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Reciprocal n-body collision avoidance","venue":null,"work_id":"471111f2-99a5-4b6e-b6d5-fbf99015c17c","year":2011},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:5d109e5cb8736d0bd2498a2a337726fc61426b72df34e68d7a1ae5690682dfbc","observation_id":"aee443b6-9a09-449b-abf5-5bb02632cd29","resolution":{"observed_at":"2026-05-24T23:15:03.723746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Optimal reciprocal collision avoidance for multiple non-holonomic robots","venue":null,"work_id":"4012a276-7ddf-4a21-9140-14382677d186","year":2013},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:5ffd64335625381a3c1d2af833e7944dc1f891b056eaeb73cc7d85b4d2ef771b","observation_id":"fa0de941-b5e7-41b1-bcba-9175a15804c5","resolution":{"observed_at":"2026-05-24T23:15:03.717401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":"1707.06347","doi":"10.1016/j.artint.2010.12.005","metadata_source":"pith","pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proximal Policy Optimization Algorithms","venue":"cs.LG","work_id":"240c67fe-d14d-4520-91c1-38a4e272ca19","year":2017},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:32c85902958ba24d2f3ab8e28e4ec500edca7fca7196a33ab20637be31e792b7","observation_id":"febc73b3-7727-4ce4-97ab-e2a11c274f9f","resolution":{"observed_at":"2026-05-24T23:15:03.100044Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Reciprocal velocity obsta- cles for real-time multi-agent navigation","venue":null,"work_id":"fd2f7a76-56d2-4047-b561-d698ff21a2bd","year":2008},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:81318ad01ff155c7a2e873b8c09bafde4706dd31c6c7f36983f3b347cf7b991f","observation_id":"14384184-dce0-40b1-b91d-6ac8f1342170","resolution":{"observed_at":"2026-05-24T23:15:03.683166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":"1609.02907","doi":"10.1039/d0cp00305k","metadata_source":"pith","pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","venue":"cs.LG","work_id":"21fff118-807d-49cd-8229-f7087ba57b5d","year":2016},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:8851cd1ba0767db5ce560dea7b69e21c7f7a93ddcee6248f6c3008f1a0844dfa","observation_id":"850b4807-e26e-4b44-ad59-e5179384f928","resolution":{"observed_at":"2026-05-24T23:15:03.092791Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00933","last_updated":"2018-03-02T16:21:46Z","snapshot_observed_at":"2026-07-06T06:26:20.207918Z","submitted_at":"2018-03-02T16:21:46Z","title":"Distributed Prioritized Experience Replay","version":1},"cited_work":{"arxiv_id":"1803.00933","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.00933","snapshot_observed_at":"2026-07-04T03:19:31.209126Z","title":"Distributed Prioritized Experience Replay","venue":"cs.LG","work_id":"63c8ef41-1ee8-47b4-afb2-75c13c93b6e8","year":2018},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"cited_paper":"/paper/1803.00933","citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:87b61ad985d2c71f4549a1daf692e6896c24790c608889bdaac9dd0b80536777","observation_id":"1eeeb526-dad3-4979-a9e3-1a291ac6d98b","resolution":{"observed_at":"2026-05-24T23:15:03.064523Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.01561","last_updated":"2018-06-28T06:54:39Z","snapshot_observed_at":"2026-07-06T06:21:49.379500Z","submitted_at":"2018-02-05T18:47:30Z","title":"IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures","version":3},"cited_work":{"arxiv_id":"1802.01561","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.01561","snapshot_observed_at":"2026-07-04T14:09:52.701191Z","title":"IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures","venue":"cs.LG","work_id":"9bbfa31b-454d-4174-923d-06e74e0c6cab","year":2018},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"cited_paper":"/paper/1802.01561","citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:e45efa4f0b94347222ca7dd8f38d769f3d4169f8d1542004cd3b985b566e5262","observation_id":"e6691caa-35d9-48f6-a089-98eb4e6a0373","resolution":{"observed_at":"2026-05-24T23:15:03.078689Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"RLlib: Abstractions for distributed reinforcement learning","venue":null,"work_id":"7155c204-41d4-4a78-aa94-5531b19ad255","year":2018},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:ead353f3d8830a8cf032e35dbc7846fad354c44fec0a2aa23350ed94f7e7c9a9","observation_id":"1d3a1f16-a943-4118-a31b-a2a5fcaf5f65","resolution":{"observed_at":"2026-05-24T23:15:03.679485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.08776","last_updated":"2018-05-22T00:31:03Z","snapshot_observed_at":"2026-08-05T14:02:17.530742Z","submitted_at":"2018-05-22T00:31:03Z","title":"Scalable Centralized Deep Multi-Agent Reinforcement Learning via Policy Gradients","version":1},"cited_work":{"arxiv_id":"1805.08776","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.08776","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scalable Centralized Deep Multi-Agent Reinforcement Learning via Policy Gradients","venue":"cs.LG","work_id":"72a43a3e-95ca-4f31-b548-e6ed29b50379","year":2018},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"cited_paper":"/paper/1805.08776","citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:05996de5973eea5ce5987a12148ea3071a4a15d6c70089c061993004f3072184","observation_id":"b568c2d1-1495-44ed-a696-f7664d6249ee","resolution":{"observed_at":"2026-05-24T23:15:03.106071Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Cooperative collision avoidance for nonholonomic robots","venue":null,"work_id":"bf563785-abc1-447d-9209-d57606e67415","year":2018},"citing_paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-24T23:14:06.926188Z"},"links":{"citing_paper":"/paper/1907.05300"},"observation_digest":"sha256:e530cf44ec8fc1c7b1845bac328f0afed3743ac3342b21385e3bd975b193ed71","observation_id":"09f08bae-7a18-4f7c-81d0-60aa8cb8b91c","resolution":{"observed_at":"2026-05-24T23:15:03.730158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1907.05300","last_updated":"2019-07-11T15:20:50Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-05T17:04:59.926732Z","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":8,"verified_fuzzy":18},"total_outbound_references":27},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:1907.05300."}