{"as_of":"2026-08-19T02:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:78608b97c7c54e7ec086ee237e72139cbe6bfad17ac0b851fff807b67e19458a","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:59:01.142418Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/1909.00526/citation-record","integrity":"/paper/1909.00526/integrity","json":"/paper/1909.00526/citation-record.json","paper":"/paper/1909.00526"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:59:00.951703Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.951703Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:6fb8acf728bc46d134e511ee9346cb21b92a3d4015cb8a40bf1956c9216e34ca","observation_id":"bafa609d-49e5-42fd-909e-c38414051fa7","resolution":{"observed_at":"2026-08-14T05:59:00.951703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:59:01.632863Z","title":"Principles of robot motion: theory, algorithms, and imple- mentations,","venue":null,"work_id":"d6158896-fbb8-4d19-9d6d-dcd87326b3ba","year":2005},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.956149Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:c4e3a6046644595502a056a51ca9ccc50b7d3a1f9a095a875f1a78a9b48b39b7","observation_id":"9d825592-6fde-4757-82af-b2ac09016565","resolution":{"observed_at":"2026-08-14T05:59:01.636737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.624731Z","title":"Mobile robot navigation in unknown environment based on exploration principles,","venue":null,"work_id":"ae561302-7252-4ebd-9150-4fca3e628fd4","year":2016},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.959792Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:e930bad93823ba59a079a0e33cde05be35268d33fbdd74bea3342fbb69cd2ab5","observation_id":"c872fbf7-0573-4bc9-bd44-c924a20f2494","resolution":{"observed_at":"2026-08-14T05:59:01.627718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.615748Z","title":"Rrt-connect: An efﬁcient approach to single-query path planning,","venue":null,"work_id":"629478b5-dd98-4fa9-9bd5-5f599c4dc0aa","year":2000},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.962937Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:2202c7bbab62e5e8a95710f924ca803329195c8f35b3c2ba492b96d732dd67fe","observation_id":"8037d4ec-492d-4584-8492-2c0fd834dc50","resolution":{"observed_at":"2026-08-14T05:59:01.619344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:00.965956Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional conﬁguration spaces,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.965956Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:b820fe26591a2e24a0f6c255d4ba91f4fccd7a20c8a6b31df611a6a3ea5d816a","observation_id":"51851072-c31a-4a4d-b5b2-cb98dce48404","resolution":{"observed_at":"2026-08-14T05:59:00.965956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:59:00.970023Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.970023Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:1634d0c20f039f9d1492e353f64a75ab2121dcbb2ae7bb9de7d7c725c4f71f7a","observation_id":"4b41e7b2-822c-400b-8a40-61cdd8370a2e","resolution":{"observed_at":"2026-08-14T05:59:00.970023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:59:01.600732Z","title":"Temporal logic motion planning for mobile robots,","venue":null,"work_id":"d8b2c824-6d7f-4f2f-b240-ba0599c55507","year":2005},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.974338Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:00e12f68706923002746e38a552d8ae0e76b420143505540aef52a1ffa950381","observation_id":"112ad799-47a6-465b-8303-9e4afcd86f7e","resolution":{"observed_at":"2026-08-14T05:59:01.603514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.593224Z","title":"Distributed data gathering with buffer constraints and intermittent communication,","venue":null,"work_id":"be1e3a07-627a-4b41-b20a-d55fc393623c","year":2017},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.977375Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:3176d603bd906668a34f5412ad5a789646d95555d513719197347baa3afb695e","observation_id":"07a4a648-9c7e-4fa1-8d86-4583b4774f16","resolution":{"observed_at":"2026-08-14T05:59:01.596210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.584218Z","title":"Distributed intermittent connectivity control of mobile robot networks,","venue":null,"work_id":"a149b352-c7b4-4220-8816-2bbf4a8631e2","year":2017},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.980266Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:32bbf48507a9256c7ea5df991eeeb32ec482e17626045953353ec760e52155dc","observation_id":"6066c200-fc8a-4656-a7d7-e7c916910d45","resolution":{"observed_at":"2026-08-14T05:59:01.587955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.576334Z","title":"Persistent surveillance for unmanned aerial vehicles subject to charging and temporal logic constraints,","venue":null,"work_id":"9433b2e9-cf72-4bf0-b818-a1b7b5c2b507","year":2016},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.982826Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:c368b27e65f918c56f6311bdad5ce9b258a4c1e5c915671d06401cbe008cc467","observation_id":"3bab96d6-fc69-49ef-be1e-48ab3cc32d6c","resolution":{"observed_at":"2026-08-14T05:59:01.579138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.568944Z","title":"Baier and J.-P","venue":null,"work_id":"38b9673e-5ff3-4782-a6a1-ffc9aeeea96a","year":2008},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.985656Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:6b961fafaa61535ab71743c25add985dc0b968a91ded190622c738291f076958","observation_id":"a3cbb9ac-58f6-4c65-a14e-a13c6ff68335","resolution":{"observed_at":"2026-08-14T05:59:01.571767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:00.988560Z","title":"Temporal-logic-based reactive mission and motion planning,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.988560Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:8e3e3854145cce915feaf7456f7ae7c6f0dd6b025bdc12aed4bf60af278b9412","observation_id":"fa354b55-c4d0-484e-acda-9c53d46c6ccd","resolution":{"observed_at":"2026-08-14T05:59:00.988560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:59:01.557754Z","title":"Where’s waldo? sensor-based temporal logic motion planning,","venue":null,"work_id":"78e0e19a-e43a-460a-a39f-478c4df6d118","year":2007},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.991333Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:c35f793bb037f4feb5bee1e4885bed9fc4bd97fbbea48165ed660736f2fb6af3","observation_id":"5f8298fa-4c17-4f45-94c5-33175b31b6aa","resolution":{"observed_at":"2026-08-14T05:59:01.560685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.550108Z","title":"Synthesis of distributed control and communication schemes from global ltl speciﬁcations,","venue":null,"work_id":"2579a43e-ad42-492a-bc53-d7b9c2eff7e4","year":2011},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.994098Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:6b1c6ec4a68fcfade9e66e9192cd96dde440972bbdbb23539fa64be5118a692f","observation_id":"b0d56ddb-ad0c-4e19-a98a-f5704eda6ea8","resolution":{"observed_at":"2026-08-14T05:59:01.553000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:00.996767Z","title":"Formal approach to the deployment of distributed robotic teams,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.996767Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:45a7ee6511c31fa56e9f080a4dd5d046c71d1b34c62880cff64a2b173f8b58a2","observation_id":"e4ada8c8-162b-4b75-9d12-ab835bbeab6e","resolution":{"observed_at":"2026-08-14T05:59:00.996767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:59:01.538418Z","title":null,"venue":null,"work_id":"53df6e9f-d241-491e-a3e4-8ec22a55dcf7","year":1999},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:00.999378Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:3f33d0197d7eb5973292a2a6b833d31dba94b71ba9af27488b086b8686f04dff","observation_id":"5ee48cfa-d768-490a-82c2-2dc0a516c660","resolution":{"observed_at":"2026-08-14T05:59:01.541900Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.531354Z","title":"Optimal path planning for surveillance with temporal-logic constraints,","venue":null,"work_id":"61d38d83-75ea-4963-bb04-4f8f34268acf","year":2011},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.002184Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:6b114ab3dd4955240bdb4b2f9bcbc7540602fd2867a5f266cfec562eb59ba429","observation_id":"f760f0a2-626c-42df-8d7d-c4808001c3df","resolution":{"observed_at":"2026-08-14T05:59:01.534106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.524526Z","title":"Multi-agent plan reconﬁguration under local ltl speciﬁcations,","venue":null,"work_id":"63e3f116-3345-4bd7-b28d-70930629b734","year":2015},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.005233Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:527bf2f08d6ea73c130fc1844fd44495162507ca8b43df884cfa9a0f2ff28268","observation_id":"6adc23bb-3701-4084-8958-b072c58e4c2a","resolution":{"observed_at":"2026-08-14T05:59:01.527301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.516965Z","title":"Automatic deployment of distributed teams of robots from temporal logic motion speciﬁcations,","venue":null,"work_id":"88532a54-4b98-4426-8084-01be0b665ee6","year":2010},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.008453Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:1ca8008d160b8701a1e8bf6988dce6dd74f6a1efb6b528e6ff343496e98f9e79","observation_id":"5e42cd84-c2dd-4db9-9381-01172efa50fe","resolution":{"observed_at":"2026-08-14T05:59:01.520202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.509970Z","title":"Optimality and robustness in multi-robot path planning with temporal logic con- straints,","venue":null,"work_id":"32210765-4413-4a61-ab5c-07a066636347","year":2013},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.011022Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:474c142370838b2f6a90261e7d9f0bbb82569171a0a78279ad3dacdf531a4be1","observation_id":"ec202244-babb-4f5a-b89a-4b7fc40533a3","resolution":{"observed_at":"2026-08-14T05:59:01.512786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.502849Z","title":"Optimal multi-robot path planning with ltl constraints: guaranteeing correctness through synchronization,","venue":null,"work_id":"8962b8d5-f10d-4532-bf29-ef78e0a0a1a9","year":2014},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.013572Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:3c540215b2f23325548ab55861c11c4d981a1efce6f0ede350ae0f97bad4e5e4","observation_id":"c8fac55a-409c-41d8-87db-d85a5f352fb1","resolution":{"observed_at":"2026-08-14T05:59:01.505703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.495858Z","title":"Composition of local potential functions for global robot control and navigation,","venue":null,"work_id":"56b79dc7-5440-42b2-a7d8-9039482ee091","year":2003},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.016193Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:78d92baffb1d39f66613db8cdd38e1d474a09fa773799770754cc3622862ca84","observation_id":"8b2d812d-7dc1-4acd-8466-e21873ed20ff","resolution":{"observed_at":"2026-08-14T05:59:01.498657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.488568Z","title":"Constructing decidable hybrid systems with velocity bounds,","venue":null,"work_id":"ecd10a3b-d256-464c-8faa-ee9787bb9f90","year":2004},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.018581Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:e8f3cdca920f9ce7be2094c5b64a6c400092896386669063d9f2f6f0c41efc34","observation_id":"609629e5-d8e3-4361-a614-216668d9200b","resolution":{"observed_at":"2026-08-14T05:59:01.491733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.481816Z","title":"Discrete abstractions for robot motion planning and control in polygonal environments,","venue":null,"work_id":"d7bffe5a-994c-4ae3-aa23-3ceda937196d","year":2005},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.021071Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:2049a84eb6085f003575c946322048de27115a866f44aa7726a8be0777e20fbd","observation_id":"8299da50-598e-498e-a0bd-6ef84deb7cf5","resolution":{"observed_at":"2026-08-14T05:59:01.484448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.474918Z","title":"Reachability analysis of multi-afﬁne sys- tems,","venue":null,"work_id":"eb85bf62-6804-4192-803c-611cfe6d104c","year":2006},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.023687Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:52178ea69f458c0a7424b6063dce5b5bd59475cb2560c85ac149827990cc86eb","observation_id":"aaef78f3-d0ab-41ec-acc3-0a6b23242cf0","resolution":{"observed_at":"2026-08-14T05:59:01.477583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.467908Z","title":"Decentralized abstractions for multi-agent systems under coupled constraints,","venue":null,"work_id":"40eea0b7-037a-4617-a547-297a3c1ecb9a","year":2019},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.026779Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:ba9ac2bcd56c788372d7147e503910fd711f2d8547d693e491fc443fa7f26a2a","observation_id":"008407e2-283a-43d8-b385-93b6cec26d82","resolution":{"observed_at":"2026-08-14T05:59:01.470695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.459949Z","title":"Intermittent connectivity control in mobile robot networks,","venue":null,"work_id":"b12edf3a-3000-4f59-a3e4-7bb9c7304381","year":2015},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.029331Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:4a89a678545714500706ba5f340328bc23a240b90912fdc3771e341b08b6d5fd","observation_id":"b9eb5cb0-797e-43cc-8819-c55171254818","resolution":{"observed_at":"2026-08-14T05:59:01.463668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.453013Z","title":"Sampling-based control synthesis for multi-robot systems under global temporal speciﬁcations,","venue":null,"work_id":"ace0f2e3-9bca-4b3a-808d-a2442bf3ff0c","year":2017},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.032043Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:74838268d2c08478a1a4fa7b7646a36cc3f9da01f3ae92a53f82d28bfd4b9ab3","observation_id":"fc1b5662-6a10-45b9-8759-be3e88ea84b2","resolution":{"observed_at":"2026-08-14T05:59:01.455761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.445952Z","title":"Sampling-based optimal control synthesis for multirobot systems under global temporal tasks,","venue":null,"work_id":"4b397b1e-d58e-4e52-941a-7ee7310dad99","year":1916},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.036034Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:d24274414ee4253d2c928888ae7f930d3bb68721f4ee0f8400d754014e77cda4","observation_id":"8d6d215d-c4a3-49f3-a7b4-7e5a305faba3","resolution":{"observed_at":"2026-08-14T05:59:01.448728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.438902Z","title":"Temporal logic optimal control for large-scale multi-robot sys- tems: 10 400 states and beyond,","venue":null,"work_id":"a35bf7b5-c287-4d24-afdf-a67656007405","year":2018},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.038722Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:c2357821bacb0e486d2685b327c367c794c089e4f61f95981d6a6cfd10ee8c7a","observation_id":"f653b657-6da1-4053-8dc0-05af36136066","resolution":{"observed_at":"2026-08-14T05:59:01.441620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.431697Z","title":"Stylus*: A temporal logic optimal control synthesis algorithm for large-scale multi-robot systems,","venue":null,"work_id":"6a348c12-9aa4-4168-9501-f4b7786da373","year":2020},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.042208Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:6de9e013aa33fc372891e6b9fb6e5ce925d618e6d394eb0d2a0006dda5baaacf","observation_id":"bc6f312d-d68b-4377-8221-bd893ade8814","resolution":{"observed_at":"2026-08-14T05:59:01.434587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.423996Z","title":"Transfer planning for temporal logic tasks,","venue":null,"work_id":"ae735e1d-a631-4217-9538-29ec6ff92776","year":2019},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.045247Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:92ef960ab65a040dc7cbc4d99932825e4edc14a73acd838c43213d212f8d3844","observation_id":"c1afc92c-7a50-415e-a4aa-d1df363eef29","resolution":{"observed_at":"2026-08-14T05:59:01.427575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.416403Z","title":"Distributed optimal control synthesis for multi-robot systems under global temporal tasks,","venue":null,"work_id":"ebcfb3f1-2bc1-4a53-99e1-1e8194be3e43","year":2018},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.049087Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:21e48cf72e9f373afc8df468aac38f4f36d865b55690dbbb0f61b1ef5244ddb6","observation_id":"c2d8fed3-63c2-4cc6-a565-bbcc6cf15184","resolution":{"observed_at":"2026-08-14T05:59:01.419007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.409787Z","title":"Control of magnetic microrobot teams for temporal micromanipulation tasks,","venue":null,"work_id":"96a438d1-ce02-44ad-89ad-f14da181b22d","year":2018},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.051751Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:4b02649c50127307afc90bf3ca8dbbf9a5de43312a48de57a1f2ea14d02d289c","observation_id":"85da20ed-49ce-4c9f-979c-979bd23285f3","resolution":{"observed_at":"2026-08-14T05:59:01.412269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.402422Z","title":"Provably-correct coordination of large collections of agents with counting temporal logic constraints,","venue":null,"work_id":"5bf898ab-4f42-42bf-98fc-f60890741a3c","year":2017},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.054276Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:404a9a500ae25e03fac22340edde18d6c26f3403e05fd398d2d1abcafae62cf7","observation_id":"db5464a1-8edd-4737-a97c-259d57a288ce","resolution":{"observed_at":"2026-08-14T05:59:01.405347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.395133Z","title":"Linear temporal logic vehicle routing with applications to multi-uav mission planning,","venue":null,"work_id":"8567d0ac-f211-44b6-a52d-583ef89d000a","year":2011},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.056976Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:25e46aaf200cadbf44d400bad6caf0756015e9c9c6d0dcaa7e9be67dbbefa9bb","observation_id":"6859d4a4-66db-4fba-ae21-b61484609394","resolution":{"observed_at":"2026-08-14T05:59:01.397966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.387667Z","title":"Optimization-based trajec- tory generation with linear temporal logic speciﬁcations,","venue":null,"work_id":"94a08599-0a4d-4a12-9e3b-a8b4fb22c256","year":2014},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.059577Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:e25310beca23109a564bc606c43c67f791bcbeb7b1ab9fb7dfa2586c36f563a0","observation_id":"0cd6b63b-a9ed-44d2-afbd-88738572a126","resolution":{"observed_at":"2026-08-14T05:59:01.390726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.380142Z","title":"Linear temporal logic motion planning for teams of underactuated robots using satisﬁability modulo convex programming,","venue":null,"work_id":"e2a98f4c-f079-4491-8d44-31d60c96530a","year":2017},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.062685Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:56f34d96309b45e45cb7ca8fc8b55f79027fbd23b4f1e054fe9fd7f95b94a6ba","observation_id":"a02d5642-d330-4ae1-8112-2b182fe08fc7","resolution":{"observed_at":"2026-08-14T05:59:01.383066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.372180Z","title":"Smc: Satisﬁability modulo convex programming,","venue":null,"work_id":"19efaa46-f635-41e5-a4e0-735c5426d332","year":2018},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.065180Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:c25ba605f79c7f2bab25a3d3c47b6a467338b155e16bd6e61723e0654a5e2858","observation_id":"dcdda8de-06d3-4e48-b329-da7ce63fb447","resolution":{"observed_at":"2026-08-14T05:59:01.375704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.364432Z","title":"Sampling-based motion planning with deterministicµ-calculus speciﬁcations,","venue":null,"work_id":"fb0fe4c6-1836-4704-8b74-d5bf41c81b50","year":2009},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.067899Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:dee5ee2cf1165743b7dad977a71ea4e41272bf94f744b822be69dbb4bfcd6e7f","observation_id":"27fc3ec8-80ed-423d-b499-f52ec06050a2","resolution":{"observed_at":"2026-08-14T05:59:01.367593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.356718Z","title":"Sampling-based algorithms for optimal motion planning with de- terministic µ-calculus speciﬁcations,","venue":null,"work_id":"af5817d2-520d-4ab5-a70f-56804f102719","year":2012},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.070774Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:21a28a7d3c1f3291cd0fb587f98e15aff7417c8f6da76f936ba6acffa3eb722a","observation_id":"86fa8ecf-212b-4385-bc2e-a1c087365a63","resolution":{"observed_at":"2026-08-14T05:59:01.359557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.349053Z","title":"Sampling-based temporal logic path plan- ning,","venue":null,"work_id":"18c2a6e1-8ad6-409e-ad13-f5a04d99dc0e","year":2013},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.073311Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:e08b848a3675c5ded83f6d8f2ab523d99346e1be54cc2312ab3e0925b16697c9","observation_id":"f0f410a3-05f9-4589-87eb-834d9a5af425","resolution":{"observed_at":"2026-08-14T05:59:01.351852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.341483Z","title":"Sampling-based motion planning with temporal goals,","venue":null,"work_id":"30a632d3-a99b-4553-9f11-56440c469035","year":2010},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.075805Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:449f9d3a1105203aaba60b507b37e023a91e4ab8a0228e0d7b2e0d97dc23ab33","observation_id":"d5139eca-5008-4f3d-89e9-60fea448d6ef","resolution":{"observed_at":"2026-08-14T05:59:01.344352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.334011Z","title":"Towards manipulation planning with temporal logic speciﬁcations,","venue":null,"work_id":"9b3faca2-eb02-4933-af98-eedc267b9ae1","year":2015},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.078455Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:b4bbff2e4e43f6e19963ebd68a7218eae14382835354794f80489aefd3a7f595","observation_id":"fb88c412-8e46-40bf-90ff-1e2b65a357d2","resolution":{"observed_at":"2026-08-14T05:59:01.336851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.325886Z","title":"An automata-theoretic approach to automatic program veriﬁcation,","venue":null,"work_id":"b6e79d1a-4902-4728-9cda-308d13b91781","year":1986},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.081529Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:69ad157af3ba8cd090d3bc730ea818193ea19c51f18271ec2631a23451f99dbc","observation_id":"1d72171d-de0e-4031-977c-809502698eb8","resolution":{"observed_at":"2026-08-14T05:59:01.328774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.083889Z","title":"A fully automated framework for control of linear systems from temporal logic speciﬁcations,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.083889Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:ef072746dc9576167261904c2ee99f924618b9eb362495613d8a0605b3c082eb","observation_id":"25b30389-b1a7-4fb1-8f5f-7f1a81c498df","resolution":{"observed_at":"2026-08-14T05:59:01.083889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:59:01.314023Z","title":"Revisiting the asymptotic optimality of rrt,","venue":null,"work_id":"27bf0ace-ba2a-4f50-9675-4a4ac8047521","year":2020},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.086924Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:054ed6f7b330e935f64e1a20e6ee421ecea54e9c14462a49ad2c334bac1efedf","observation_id":"b7f8a90e-0526-4508-bdc5-2980959f1c82","resolution":{"observed_at":"2026-08-14T05:59:01.317096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.306565Z","title":"Probabilistic planning with formal performance guarantees for mobile service robots,","venue":null,"work_id":"3dda3334-4373-4406-b5e0-57b4e08a607e","year":2019},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.089499Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:ca12a58d31c9e4ac06d5e8527a7c4852f1b964d95761ac57a7b3ddce4a88087c","observation_id":"2e2d57f2-fef0-42fd-a810-2da34fe92158","resolution":{"observed_at":"2026-08-14T05:59:01.309264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.299349Z","title":"Uniform-geometric distribution,","venue":null,"work_id":"007f272e-4e3b-4ac1-b68b-24568665024e","year":2016},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.091911Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:8f2420a58521cb034be12d05c98e059e1cda91858d19b8042ff19bcab4009eb7","observation_id":"fa51e887-c86a-407e-8c4d-a04106d85752","resolution":{"observed_at":"2026-08-14T05:59:01.302300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.292100Z","title":"Global planning for multi-robot communication networks in complex environments,","venue":null,"work_id":"9e54f524-34a5-440c-bce3-601759737637","year":2016},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.094386Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:27adecf0482bee6d3273c86654d67da5fc84ad0824fa4d60aecabe0760eabbdc","observation_id":"54e14f9f-dbf4-4137-8dec-eb530df44b3c","resolution":{"observed_at":"2026-08-14T05:59:01.294824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.284449Z","title":"A formal methods approach to interpretable reinforcement learning for robotic planning,","venue":null,"work_id":"d76b8ba5-1ef3-4885-a15a-9686b14b924d","year":2019},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.097010Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:a37ff7c3876b85971026896b73bc9b9017ad690b849595b2143052ff31646899","observation_id":"513621e3-991b-4453-9abf-f3e1cd23579c","resolution":{"observed_at":"2026-08-14T05:59:01.287757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.277459Z","title":"Distributed state estimation using intermittently connected robot networks,","venue":null,"work_id":"f0b29fc6-3f52-48b0-bc2d-907e036dd5d8","year":2019},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.099630Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:49167e6a338c1fb5b32bb332a78ffa3dd5ba166fd029d01760edb688d4e548c1","observation_id":"98673ae4-3468-4ad5-a2ae-5cb609c58bd9","resolution":{"observed_at":"2026-08-14T05:59:01.280212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.270244Z","title":"Collision avoidance for per- sistent monitoring in multi-robot systems with intersecting trajectories,","venue":null,"work_id":"94be5dd8-b319-4d91-a6bd-de928c4ac59b","year":2011},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.102164Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:6bba02783238eb0a3a46f5b9de1f12b14a5460e7d53ef44a48b5114455043f94","observation_id":"f6b07fe3-1c25-4373-953c-17775f19a885","resolution":{"observed_at":"2026-08-14T05:59:01.273149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.262102Z","title":"Collision and deadlock avoidance in multirobot systems: A distributed approach,","venue":null,"work_id":"1b097061-8361-4343-bbfc-a20ed5bb6557","year":2017},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.104718Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:9f455e329495d5cd110c6acad9d0af85b5e05a7a7bd54adb84d014828fd6ec7a","observation_id":"38875049-e787-4fe1-b32e-cdc75696e755","resolution":{"observed_at":"2026-08-14T05:59:01.264918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.255227Z","title":"Van Kreveld, O","venue":null,"work_id":"c1179d2e-ac85-4384-80a7-eabdf570a693","year":2000},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.108273Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:e40a68c36afab6c3e68687bfd4a052bc5e697c1e4b324188f5ee3f81c12e7716","observation_id":"72705bc7-6943-4c84-8996-40ee4fc9967d","resolution":{"observed_at":"2026-08-14T05:59:01.257726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.247717Z","title":"Fast LTL to b ¨uchi automata translation,","venue":null,"work_id":"4f76215d-cf63-419a-8034-d527a4fb6016","year":2001},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.113608Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:f62c0a32f37aa2f94712977dee8cf013922e68f7431373933883cdbe264e7252","observation_id":"7ebbd0ce-0df5-4c41-b287-61e9cefa76a1","resolution":{"observed_at":"2026-08-14T05:59:01.250716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.240399Z","title":"Monte carlo motion plan- ning for robot trajectory optimization under uncertainty,","venue":null,"work_id":"6bda4316-0067-40a6-95b5-e4c4718d5618","year":2018},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.116324Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:4c890a531d1531facd0b1bfbd60821a3f514d7e1c8fe5cd28d01a9dc6e5d2186","observation_id":"2fefcb6f-9816-4512-bbad-c92ee50481fc","resolution":{"observed_at":"2026-08-14T05:59:01.243279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.233023Z","title":"Z3: An efﬁcient smt solver,","venue":null,"work_id":"a0c54b56-3652-405c-8705-804c86233203","year":2008},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.118794Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:cda1a567719e06f2fe8631f69074d782c90ca45d16dcfc4d84ce5114ac5881e9","observation_id":"81285e1f-9084-436b-8055-8db65b7cfe7f","resolution":{"observed_at":"2026-08-14T05:59:01.235928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0611029","last_updated":"2006-11-16T09:04:11Z","snapshot_observed_at":"2026-07-07T03:08:56.572424Z","submitted_at":"2006-11-07T00:07:26Z","title":"Linear Encodings of Bounded LTL Model Checking","version":3},"cited_work":{"arxiv_id":"cs/0611029","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0611029","snapshot_observed_at":"2026-08-14T05:59:01.163546Z","title":"Linear Encodings of Bounded LTL Model Checking","venue":"cs.LO","work_id":"84418196-2e5e-442f-a0c4-2de649a57575","year":2006},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.121384Z"},"links":{"cited_paper":"/paper/cs/0611029","citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:58c33ee905f1c6979d611c70b087672b1b9ec553e1c14712d3b80dd38bab7354","observation_id":"b30489e5-fc32-47ed-a80a-e97326d779f1","resolution":{"observed_at":"2026-08-14T05:59:01.168506Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.224189Z","title":"Rudin, Real and complex analysis","venue":null,"work_id":"8cb53542-e435-4bd7-90a3-97a63a0e339a","year":2006},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.124503Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:5bb41e00e0865fab0465cedf8e930a4be77af773aa1fceadb719594866157cf8","observation_id":"7d40fabe-be10-4886-bfe3-987e0d338daf","resolution":{"observed_at":"2026-08-14T05:59:01.227955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.215466Z","title":"V oronoi diagrams—a survey of a fundamental geo- metric data structure,","venue":null,"work_id":"6b6782f8-26bd-48c3-b015-013d2bd0a2d6","year":1991},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.127012Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:2121e1aa58a45131664861d0a883fe27711d2065554c2e2dfea06ed60ceae491","observation_id":"f74fbc64-fd1f-48c1-a285-ca83a991d80e","resolution":{"observed_at":"2026-08-14T05:59:01.218641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.206739Z","title":"Speciﬁcally, letτ∗ be the optimal continuous path that optimizes (2)","venue":null,"work_id":"66f644f8-8125-45cb-a9d1-1f59db588767","year":null},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.130502Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:9ed4e92c5beb4f67309580b66decd2a980cd18bb72e88bd1053c7a03835725a5","observation_id":"163a69ee-6bb6-4d1b-9aa1-4de02103822b","resolution":{"observed_at":"2026-08-14T05:59:01.209861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.197779Z","title":null,"venue":null,"work_id":"0f7752ad-2cbd-44b8-9fcf-a04026951c4a","year":null},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.133212Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:6bd2093575b29a7a21e9d80adbf24574528928fd38c879b93d9bb1b51e0c738b","observation_id":"6f690d8f-ed3b-4053-94d8-0c00b108d5f0","resolution":{"observed_at":"2026-08-14T05:59:01.200736Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.189560Z","title":"To do so, we need to show that eventually every ball in Bn contains at least one node of Gn","venue":null,"work_id":"fe48b40d-44bb-4a51-9a71-f89854311716","year":null},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.136529Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:29cda85a3cd1b744e845b7ca41a2afa7a6c0678de4fa1d692f221eec68bb8054","observation_id":"7f5e50b8-cf91-4994-bd23-bc111a901142","resolution":{"observed_at":"2026-08-14T05:59:01.192752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.181423Z","title":"Furthermore, since x′ 2 is sampled before x′ 3, (R2) holds","venue":null,"work_id":"3b4b0fcf-b03c-4b7f-901e-2a46407293a2","year":null},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.139476Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:4872378989f953e8acdc321015c37f651eb72d28656f34764a5a9e8a5a4c8a21","observation_id":"d2363abe-26a2-4843-8d5b-5a42bb6c7aac","resolution":{"observed_at":"2026-08-14T05:59:01.184612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T05:59:01.173848Z","title":"Substituting in (26) we have that P(E1 n) converges to 1 as n→∞","venue":null,"work_id":"d2017ef4-60f4-4a23-8e37-8aaa76d8c1ea","year":null},"citing_paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","version":4},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-14T05:59:01.142418Z"},"links":{"citing_paper":"/paper/1909.00526"},"observation_digest":"sha256:19eb4d2d547af56fea919164b8f03cc84a25dfb14039cf3e27acf3d00d6963c8","observation_id":"b554a675-9894-484a-9aaf-a576a7ff4c85","resolution":{"observed_at":"2026-08-14T05:59:01.176632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1909.00526","last_updated":"2021-03-23T15:47:08Z","latest_version":4,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-16T17:16:21.338454Z","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":57},"total_outbound_references":66},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 0 inbound Pith citation observations for arXiv:1909.00526."}