{"as_of":"2026-08-16T16:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc428fe65bd692c4c73c35b47167fc4ed1cb6b5414f2807541fda3614f700342","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T04:34:45.656594Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T13:16:06.528609Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.23240","snapshot_observed_at":"2026-08-01T13:16:06.528609Z","title":"Signal temporal logic motion planning via graphs of convex sets.arXiv preprint arXiv:2605.23240, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.19196","last_updated":"2026-07-21T15:30:55Z","snapshot_observed_at":"2026-08-16T16:13:12.187038Z","submitted_at":"2026-07-21T15:30:55Z","title":"STL-GCS: A Planner-Controller Framework for Signal Temporal Logic via Graphs of Time-varying Convex Sets","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T13:16:06.528609Z"},"links":{"cited_paper":"/paper/2605.23240","citing_paper":"/paper/2607.19196"},"observation_digest":"sha256:3ebe0c391d22ac34f00a19696f74be1328d81bb47d0f425ce7dd560a0c5b106b","observation_id":"331d3243-4641-4016-9c97-bf1b25b292a2","resolution":{"observed_at":"2026-08-01T13:16:06.528609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.23240/citation-record","integrity":"/paper/2605.23240/integrity","json":"/paper/2605.23240/citation-record.json","paper":"/paper/2605.23240"},"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":"Synthesis for robots: Guarantees and feedback for robot behavior","venue":null,"work_id":"75ce6682-a488-4d46-9dbe-3dd300f9bc8c","year":2018},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:db570bd273a5dd372d24a6df30532ad4917fcaf7f71c450a4d9077f4b9eeaece","observation_id":"b8bfcb23-166e-4016-9064-5a365d64693e","resolution":{"observed_at":"2026-05-25T04:35:21.975007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T03:30:38.903021Z","title":"Formal methods for control synthesis: An optimization perspective","venue":null,"work_id":"9c82ebc6-db68-44d5-bd75-3c7c0ef7d85a","year":2019},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:7a59d0fc83d8fd62e80ce2b1b354e7523d4f35bf3bc313d7fa4aa0efc99c9f81","observation_id":"025ce7b1-2386-4747-b353-2b068b984997","resolution":{"observed_at":"2026-05-25T04:35:22.133721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Formal synthesis of controllers for safety- critical autonomous systems: Developments and challenges","venue":null,"work_id":"e22cc4d6-fbe3-43c5-9cd9-84145c8047d3","year":2024},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:60a2f5af6bb343208d0e7ccb36b6b17d60cae43c2a5874b7076d27a403ddab12","observation_id":"70a2d363-264f-4928-b408-556d504e7fd3","resolution":{"observed_at":"2026-05-25T04:35:22.012524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Monitoring temporal properties of con- tinuous signals","venue":null,"work_id":"e76c2aa9-0b54-4f7d-b753-a59270d699ae","year":2004},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:19662fc368e0d9bdc1f20e1360233c754531bd9c3112712ec68c24324ce94323","observation_id":"76064b8c-66fc-472c-8088-0e0ce3aed2c0","resolution":{"observed_at":"2026-05-25T04:35:22.006120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Temporal logic motion planning for dynamic robots","venue":null,"work_id":"f39f25ad-2b85-4293-9df2-8b13b6b36534","year":2009},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:e29addb53157c078b19318f6e18434b03140d55861fda62ae7e9a9cf2123b0cf","observation_id":"df94d16b-116b-4fb0-b36e-fc6b799c096c","resolution":{"observed_at":"2026-05-25T04:35:22.009299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Power line inspection tasks with multi-aerial robot systems via signal temporal logic specifications","venue":null,"work_id":"e4bb0d21-f005-4c17-9fc1-744d3f1f4fc7","year":2021},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:948158abaa8c2446c9622e3125f3802bf4704a99b6fe913d52c9c79e1bcf5205","observation_id":"ac04b7fd-2176-4a19-ae9a-480f9a6387b3","resolution":{"observed_at":"2026-05-25T04:35:22.021953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"STLGame: Signal temporal logic games in adversarial multi-agent systems","venue":null,"work_id":"754148bf-60a3-496a-a8cf-4abb8180733c","year":2025},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:d9c72b0566419aa540f62bca74e0618a6f2345572716ca52e1238e8631968cb8","observation_id":"25cdccae-e78e-49ed-880a-2bacef332e2e","resolution":{"observed_at":"2026-05-25T04:35:22.038844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning from demonstra- tions using signal temporal logic","venue":null,"work_id":"10f0cc91-6b03-4841-b610-a844ffc5d71f","year":2021},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:1e001090eec308fb22f92f7c70cbb46d6c4f1d59c97c0afa3dcd6774d31379d0","observation_id":"046ab76d-82c0-40fb-af14-78d7befdecd5","resolution":{"observed_at":"2026-05-25T04:35:21.990939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cooperative object manipulation under signal temporal logic tasks and uncertain dynamics","venue":null,"work_id":"c47d4dda-b8d1-4e57-9131-498411804a27","year":2022},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:5105a5fa9e403b623ea8fc2cfefca99f2638b429ace5298ce610b3070f9988e7","observation_id":"2bf3ba58-8783-407d-a7b4-824ef0b2e0e5","resolution":{"observed_at":"2026-05-25T04:35:21.994247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neuro-symbolic generation of explanations for robot policies with weighted signal temporal logic","venue":null,"work_id":"b7fae86d-ca95-4722-aacf-0f1a8239bea5","year":2026},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:a0eee3999a8a278ad89cbc0b2f4ab842c580392d4ecdc00d0e715c2f9ef1ad23","observation_id":"baafa736-0ee8-4ce8-b425-b776195009fe","resolution":{"observed_at":"2026-05-25T04:35:21.984939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robust-locomotion-by-logic: Perturbation-resilient bipedal locomotion via signal temporal logic guided model predictive control","venue":null,"work_id":"f75fdd24-e1a3-4dcf-97f2-9420e5b1e65d","year":2025},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:2319568483ef5e4bfb88cd794f773a79afcc49e5781b89d7760540ef38412707","observation_id":"4154bb92-353e-43d0-87b3-c9ef5c758c62","resolution":{"observed_at":"2026-05-25T04:35:21.981886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Model predictive control with signal temporal logic specifications","venue":null,"work_id":"10c79fe3-9b3e-4260-9de3-f24dd0a2dcca","year":2014},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:4ce609c97bd71b714540cfe244c2a07999adaff3b7c41a251404d9335258dcbe","observation_id":"08803ff2-3e2e-4ca8-9332-5abba2c8d75b","resolution":{"observed_at":"2026-05-25T04:35:21.987464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robust temporal logic model predictive control","venue":null,"work_id":"34594355-f7b0-4bec-94b7-41aba1c4d468","year":2015},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:5f51d6ea2d2c1c3b7d6c751d9db81d2a62efbf89e0feb7731f629165a0e4ec41","observation_id":"a024ead4-938b-42b2-b7ee-e48e3517f9d0","resolution":{"observed_at":"2026-05-25T04:35:21.997062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robust model predic- tive control for signal temporal logic synthesis","venue":null,"work_id":"08926501-3b4a-43e9-851e-e8a8546e1320","year":2015},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:ee87ca78ddad51a2c3a0ce7c4b9763b0197b18d1dddf21dd011bf01f41e80fee","observation_id":"31c208b5-ce45-4f1e-bbbd-557cb5924413","resolution":{"observed_at":"2026-05-25T04:35:22.000102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mixed-integer programming for signal temporal logic with fewer binary variables","venue":null,"work_id":"9867a9e2-449a-4d18-8c06-a78bd3ae13bc","year":2022},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:513b66fbd6a496678ba057effa7cb6c7aa0eee211e5c3f9f5b6a6a35b77f790f","observation_id":"fcfde4c2-3a79-4b2b-aafc-85f0e57d4cf6","resolution":{"observed_at":"2026-05-25T04:35:21.978871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"STL and wSTL control synthesis: A disjunction-centric mixed-integer linear programming ap- proach","venue":null,"work_id":"eec83c08-79e2-46da-8250-39ad0b72ced5","year":2025},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:a887ccf4fdb55c5c0b35b4b638a19e6727e4690894aaf2ad20ba5034202cc7e5","observation_id":"5610c3a8-ad0e-403e-988c-f7d97ed7a099","resolution":{"observed_at":"2026-05-25T04:35:22.003142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trajectory optimization for high-dimensional non- linear systems under stl specifications","venue":null,"work_id":"f22fa5d4-4984-4399-b2a6-4898ec5b7310","year":2020},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:7e006dc695d8a73111764d1c246f139a1a5bfda5f7beebd9c3954ecd3fdb1a01","observation_id":"a8704a67-b024-481e-83cc-c2ddc09416bd","resolution":{"observed_at":"2026-05-25T04:35:22.035219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Differential flatness of mechanical control systems: A catalog of prototype systems","venue":null,"work_id":"277f474c-fa13-4a0a-a7d7-b9386adc8781","year":1995},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:e6772e3a0ead888da949749d14d5dfd91d15a72efa4c73ed8b3a25ba98de243d","observation_id":"6a447957-c93b-4868-934e-937b26f618df","resolution":{"observed_at":"2026-05-25T04:35:22.143170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Marcucci,Graphs of Convex Sets with Applications to Optimal Control and Motion Planning","venue":null,"work_id":"8a501e89-ed74-43e7-8846-c04e09ade58e","year":2024},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:2a1d03903d34f52dcbdb49e901fd41efd291fc611432e168fa02f52b40865991","observation_id":"1a6ee013-6b63-4e6e-96a2-987fd8b54abb","resolution":{"observed_at":"2026-05-25T04:35:22.137111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Shortest paths in graphs of convex sets","venue":null,"work_id":"6ff5080f-a2dc-402e-84bd-42fe0049f03f","year":2024},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:57ffadf5868b20c230c06dfdbbdae303346bd8d7acadad4e4f4d1dc761c3b4dc","observation_id":"e4bdfcf8-1019-4778-be59-e6a4e783ec88","resolution":{"observed_at":"2026-05-25T04:35:22.146170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Motion planning around obstacles with convex optimization","venue":null,"work_id":"4e613f6a-fa0a-4234-bee7-b3c5331764ca","year":2023},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:264ae42b529c491d39c521da32d87ce824ee3c6b0af713666e276704e64a868a","observation_id":"6aba9c89-f136-453a-a8f8-17fd6fcc7035","resolution":{"observed_at":"2026-05-25T04:35:22.124381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Temporal logic motion planning with convex optimization via graphs of convex sets","venue":null,"work_id":"c512203d-2f58-409d-8fb0-226db72cb404","year":2023},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:9edf3de72bec91daf2ee5d513b6b40621b0f006fbb240e100d9cf93db448d7e1","observation_id":"d72929aa-34dc-47bc-8687-6fb6041f4515","resolution":{"observed_at":"2026-05-25T04:35:22.115298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reac- tive synthesis from signal temporal logic specifications","venue":null,"work_id":"dc47529a-8b67-4230-a70e-6ba990faacc0","year":2015},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:779440fd552857db6f34b9fac0fa05b2f8a679764d1c170b967ded1d9357238b","observation_id":"bc05ee9a-6566-4508-9d2a-ada56d64e8c5","resolution":{"observed_at":"2026-05-25T04:35:22.118424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mixed integer linear pro- gramming approach for control synthesis with weighted signal temporal logic","venue":null,"work_id":"6839186f-e7f8-48ac-9a3a-b9d3652d7b44","year":2023},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:ad889e175288551ef4dc3ef28fc8382db546323795119fd3e05ff8e1b0d68af0","observation_id":"8cb93ab7-98ff-43cf-a133-48ba5aaf53bd","resolution":{"observed_at":"2026-05-25T04:35:22.121444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multi-agent motion planning from signal temporal logic specifications","venue":null,"work_id":"b645a890-f6b5-4f08-903a-84ad743765fd","year":2022},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:9f4801708345f8e825ed4ec76b12a606162decad345f7c1bdafe410baf5d9511","observation_id":"ecc877ee-fc16-4f13-81f1-bf2563a48162","resolution":{"observed_at":"2026-05-25T04:35:22.127243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimization-based model checking and trace synthesis for complex stl specifications","venue":null,"work_id":"536bd82a-9fbb-40fa-bc92-2e8e785ebf1c","year":2024},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:bf8c8a3e65af7702d575bc907a67a2498e395d998b94a07d59ae45d7e2b9a0bc","observation_id":"b1c892bc-2dbf-49a1-9d65-7bae2a7d96c4","resolution":{"observed_at":"2026-05-25T04:35:22.106023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A theory of timed automata","venue":null,"work_id":"c6e0fadb-50eb-4cad-82cc-f1d24e5df17b","year":1994},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:6ba6af7003ed8e2fcd8e046d9eb488eb6b1743d7464f0a52e7ebdc259d540f8e","observation_id":"d49ac5fa-7f22-4f5d-82d3-b903b6ae3772","resolution":{"observed_at":"2026-05-25T04:35:22.108693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The benefits of relaxing punctuality","venue":null,"work_id":"55af9aa3-4609-4ac4-adea-b1daaabb855c","year":1996},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:07dbc17a9851e2a744ea5cf94bb03aa0794a4b35f72ecd8c6f620e3293e17561","observation_id":"733f007a-128e-49c4-b7b6-43ac3049170a","resolution":{"observed_at":"2026-05-25T04:35:22.112011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"MightyL: A compositional translation from MITL to timed automata","venue":null,"work_id":"c4dfdeb9-cb57-4696-b949-a67b3dedd34a","year":2017},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:0eb4c46ebf4769bee587a3ffdccc3019c2275932ac750c8560006b56db678299","observation_id":"6d68a04c-c1f5-4cb0-818f-2fb796240c54","resolution":{"observed_at":"2026-05-25T04:35:22.130603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"From real-time logic to timed automata","venue":null,"work_id":"cf020ce6-2c9e-40ec-a0a1-0813359afd4c","year":2019},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:9f89b399ef412fdbfd15d4494df0073c24f7da1f8077422c50be01e1049f28e4","observation_id":"e7882524-2966-4410-a004-ab1d492ce8ff","resolution":{"observed_at":"2026-05-25T04:35:22.149226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computational methods for stochastic control with metric interval temporal logic specifications","venue":null,"work_id":"ba8a2ea0-f01b-4d17-b569-f350a8e4d1f6","year":2015},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:73ad02f4e384eafe05e0dbec3b4c6a2c4b47d77e614a59605b981d2cff19af1f","observation_id":"f01e9f69-dc3a-409c-8821-a48e50be00c4","resolution":{"observed_at":"2026-05-25T04:35:22.096350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Timed automata approach for motion planning using metric interval temporal logic","venue":null,"work_id":"ca5b883b-7163-47fe-9826-13e9dba13038","year":2016},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:aac30fd501eb4da7593a30a3ca24bf5b6605bea81b9830c4732ebd303187a201","observation_id":"92070242-6496-4d67-8541-c302ba551e8a","resolution":{"observed_at":"2026-05-25T04:35:22.099745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cooperative task planning of multi-agent systems under timed temporal specifications","venue":null,"work_id":"d921ba59-091a-4d10-b650-4dd86c54c8b4","year":2016},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:c2e29e1bc480a3750ce12d4901a40884d64404012e5aebd6b1af17a19f58cc9c","observation_id":"d32a6e25-aabf-4cfe-a004-dc70e154ddd3","resolution":{"observed_at":"2026-05-25T04:35:22.102953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient automata-based plan- ning and control under spatio-temporal logic specifications","venue":null,"work_id":"251f48a4-8fc7-4b8d-a406-06ebdbacea34","year":2020},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:e5c93d0e6479e4251a80f285b861765d8ce98af2cbc7da0eba57545439aa9eea","observation_id":"308eb1f5-50a2-449d-b947-e4858ef69b01","resolution":{"observed_at":"2026-05-25T04:35:22.089551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Randomized kinodynamic planning","venue":null,"work_id":"47984435-76dc-473d-ae9d-0d1df6644290","year":2001},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:58d537985775a493cb4596b22867f397206287716c35332792a37ecf188dfa5d","observation_id":"91dccae6-cd50-4ffd-a56d-b853a31cd4b1","resolution":{"observed_at":"2026-05-25T04:35:22.082845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T02:40:38.396785Z","title":"Sampling-based algorithms for optimal motion planning","venue":null,"work_id":"d0d2c860-94d2-4bc2-81f7-cc9dacd03192","year":2011},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:9f48fd4ec4f96f40a18bfbfb4a946709006d605468ba016baba2c35b8bb903b1","observation_id":"3f3c0d7f-a6b1-4a04-a971-10e30b55d8d2","resolution":{"observed_at":"2026-05-25T04:35:22.086258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sampling-based synthesis of maximally-satisfying controllers for temporal logic specifications","venue":null,"work_id":"caf73b9f-bc05-45bc-b55b-7a853c3b8716","year":2017},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:3978c7a15195598542ef5f00ac7202de9f407595ac07301777f193d5d25b263c","observation_id":"3617bfaa-fcab-4643-b9ae-4ee91e8c8a30","resolution":{"observed_at":"2026-05-25T04:35:22.092892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.16825","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T12:55:44.873466Z","title":"RRT η: Sampling-based motion planning and control from stl specifications using arithmetic- geometric mean robustness","venue":null,"work_id":"8afbd26d-ad91-428f-b267-5809df2de08c","year":2026},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:3d69b89212fe9bd4e3ce6a945f46dd4fbd431fd6ab6f07238f3be6401ebbd035","observation_id":"2df9366b-1ee5-4f20-94c1-ce09a905b817","resolution":{"observed_at":"2026-05-25T04:35:20.750741Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sampling-based planning under stl specifications: A forward invariance approach","venue":null,"work_id":"16cb95f6-974d-48ce-aef2-f95e0240f975","year":2026},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:d6139c960b51622a7c282550824cbd531e2a9e234aacf287d6b4b5f9ffb4dee3","observation_id":"122aaffd-4d8b-40a7-ad2c-64390194a35d","resolution":{"observed_at":"2026-05-25T04:35:22.077208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Automaton- guided control synthesis for signal temporal logic specifications","venue":null,"work_id":"772567fa-d62d-4463-9515-4a9e10db9ff2","year":2022},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:f62a674e51facaeb0221e955ca64e15d5073770221f0396fa2bc0eb66f1fa988","observation_id":"89b1fae3-30b3-4e2a-ada0-0b4603e91504","resolution":{"observed_at":"2026-05-25T04:35:22.070720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Q-learning for robust satisfaction of signal temporal logic specifications","venue":null,"work_id":"11839481-020a-46bd-ac49-f43a10991264","year":2016},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:341247bbfd776204f4c016874be1d0c68edcc27c04ed7364fb5453400bea45a8","observation_id":"4c1f0ce6-d3b0-4663-8980-e17d41e993c9","resolution":{"observed_at":"2026-05-25T04:35:22.074005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Structured reward functions using stl","venue":null,"work_id":"4fd67173-a13e-4d16-8550-12b023ae9635","year":2019},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:770c127cf0ca741fd319f225e2fa500005ba8cba4c9ea0886ff65c6d64963b13","observation_id":"5dd654ba-2d36-49ef-b3d3-0c6e2b097cc3","resolution":{"observed_at":"2026-05-25T04:35:22.080120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tractable reinforcement learning of signal temporal logic objectives","venue":null,"work_id":"c7cdfb66-ed3e-44a2-8449-48700e30c21e","year":2020},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:698fe1e6678aff9c3a26dc254d1d25edf2ee32df15b2caed88b63fb03017940f","observation_id":"664a8239-f99c-4cca-9eca-3fe53bb9f77a","resolution":{"observed_at":"2026-05-25T04:35:22.058654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Model-free reinforcement learning for optimal control of markov decision processes under sig- nal temporal logic specifications","venue":null,"work_id":"c5afe7d3-ecf0-4135-bc15-4f7cdafb5823","year":2021},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:05927eb42e85d3f242091836dd4ee10507277b69fee9926f68e90bd1be94f6a9","observation_id":"71cd5de9-fb3f-46bf-bedd-21d45c8f36a9","resolution":{"observed_at":"2026-05-25T04:35:22.055888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deep reinforcement learning under signal temporal logic constraints using lagrangian relaxation","venue":null,"work_id":"090d8e75-5450-4859-8edc-0574c1815cfe","year":2022},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:cb2c23f53405e214690827a3754542f253bdf0bdb38786d09bff77aa174cf22a","observation_id":"91ec468b-28c7-4645-ae27-2c5de7450550","resolution":{"observed_at":"2026-05-25T04:35:22.062905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Synthesis of temporally-robust policies for signal temporal logic tasks using reinforcement learning","venue":null,"work_id":"6644fa70-be58-44ef-8589-35159c96282d","year":2024},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:25cd4d0e33d22c84f778e5023fb1227f0e9d1c7c0a3e7a10bc5fcd948181ba70","observation_id":"6eb48b81-1877-43c9-ade7-f2e69c95f03a","resolution":{"observed_at":"2026-05-25T04:35:22.047817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Guided conditional diffusion for controllable traffic simulation","venue":null,"work_id":"090300ed-9659-489a-afa2-9307fba6d392","year":2023},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:60ad99fc150ba89e4df3cdf9c6d42904fbb0f9155f099cd51b0d2c6b63cfd5c8","observation_id":"e6cb1c68-bdf7-417f-9b6e-9ed789b32fcc","resolution":{"observed_at":"2026-05-25T04:35:22.050580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Diverse controllable diffusion policy with signal temporal logic","venue":null,"work_id":"d527d018-b588-4048-afc0-bec5ecc2d890","year":2024},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:f75064c5e35da91e7ba0908322b7537df4cf48b72a4e983343273e1ba9a3f16c","observation_id":"5fc3af26-fc84-4162-af0a-2e6195154a98","resolution":{"observed_at":"2026-05-25T04:35:22.053068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zero-shot trajectory planning for signal temporal logic tasks","venue":null,"work_id":"11991a6e-91b7-4548-82c3-21aa5dcd5780","year":2025},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:04c79c3b675a6032d7dd1e221ec88eec53c0cee4c0e9545eb92844e1706c80e6","observation_id":"01431baf-70db-4d70-ad4d-d3d40f191ffd","resolution":{"observed_at":"2026-05-25T04:35:22.067056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.18343","last_updated":"2026-04-20T14:41:37Z","snapshot_observed_at":"2026-08-12T19:02:17.242746Z","submitted_at":"2026-04-20T14:41:37Z","title":"DAG-STL: A Hierarchical Framework for Zero-Shot Trajectory Planning under Signal Temporal Logic Specifications","version":1},"cited_work":{"arxiv_id":"2604.18343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.18343","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"DAG-STL: A Hierarchical Framework for Zero-Shot Trajectory Planning under Signal Temporal Logic Specifications","venue":"cs.RO","work_id":"66df6ac0-9972-4c87-8d67-af849b7fb13c","year":2026},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"cited_paper":"/paper/2604.18343","citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:f4bfb61eb53b501ba46b561f5674526be06cb6506d3626fce3f2297aa65a769c","observation_id":"e6ea4122-9084-47e1-b43e-f4eed050e7b8","resolution":{"observed_at":"2026-05-25T04:35:20.745715Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.24235","last_updated":"2026-08-12T03:43:59Z","snapshot_observed_at":"2026-08-15T23:09:11.305907Z","submitted_at":"2025-09-29T03:20:05Z","title":"Towards Tighter Convex Relaxation of Mixed-Integer Programs: Leveraging Logic Network Flow for Task and Motion Planning","version":2},"cited_work":{"arxiv_id":"2509.24235","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.24235","snapshot_observed_at":"2026-08-13T01:24:42.044673Z","title":"Towards tighter convex relaxation of mixed-integer programs: Leveraging logic network flow for task and motion planning","venue":null,"work_id":"b33ae4fa-2741-401e-86a4-1c6a259fc6d6","year":2025},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"cited_paper":"/paper/2509.24235","citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:72d983bfdef5fa8d18e2cd9b9c576d7b3dc279250b25f4fdcbb56b71482636f8","observation_id":"5e593014-87df-4b0d-ada1-ec558365bb91","resolution":{"observed_at":"2026-08-13T01:24:42.044673Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Algorithms for polynomials in bernstein form","venue":null,"work_id":"a8466bbc-80d7-486b-9cc6-3fd7178b338c","year":1988},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:21697bac77668077ad55abb032e08209300a3a28022911469b786d188053d2cd","observation_id":"57d99092-1297-47ca-bc02-30ee04c54eec","resolution":{"observed_at":"2026-05-25T04:35:22.152097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computing large convex regions of obstacle- free space through semidefinite programming","venue":null,"work_id":"a5665a01-2d3b-4854-98e8-c19fbdb35ee7","year":2015},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:05625252b83abe1ed26b33bbd57f9423b4af767a07b813c6fe2ba8f6f9eee3be","observation_id":"0f948404-b63b-4642-bf20-ef799a2a162d","resolution":{"observed_at":"2026-05-25T04:35:22.042019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-16T13:08:46.414387Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":"2410.12649","doi":"10.48550/arxiv.2410.12649","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":"52c43f19-7bbd-4ec8-9259-ba9a2b628183","year":2024},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:9dd078df8a9b908d12d6354bc2beafe709e14037ebe2e6e4d85ff8f0cde75a47","observation_id":"d4c431e9-3797-4b3d-a9ed-47df5319ac99","resolution":{"observed_at":"2026-05-25T04:35:20.740394Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Certified polyhedral decompositions of collision-free configuration space","venue":null,"work_id":"e328d846-a4ce-4530-b812-ebad30cc206c","year":2024},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:63ebcd0006e5fc6a8ac332ff5863301462fc6523d3be3fd425f8410a8c305f0b","observation_id":"b29009ad-9c56-48e5-8531-57460247a126","resolution":{"observed_at":"2026-05-25T04:35:22.044931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"cf18e68f-2fcc-43da-9b54-ade57be9b6c2","year":2011},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:cdff45a754034c58367c1f9b4b7615005635ba85d5239081883e97b4be8d5dff","observation_id":"2ce1a953-4bcf-4273-b345-0c8564ec32ac","resolution":{"observed_at":"2026-05-25T04:35:22.024991Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nesterov and A","venue":null,"work_id":"8a2474fd-4312-47e7-9938-91362375156e","year":1994},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:636699cb3c87078b8af565e6d19bcaff3c73a88df2babe90922f6a4714c884e6","observation_id":"826fb1d8-fbf4-43a9-8ed6-11235a82c25f","resolution":{"observed_at":"2026-05-25T04:35:22.018487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ApS,The MOSEK Python Fusion API manual","venue":null,"work_id":"5cdac68e-a9b5-4eda-a2ba-747a1e7316f1","year":2025},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:175cc527dbb0b7acc0a124850e1db3f2af78637ae79f1603550d2b5583ed6edb","observation_id":"24fbd997-abbf-4ac4-b7ae-b056d199491a","resolution":{"observed_at":"2026-05-25T04:35:22.028255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Minimum snap trajectory generation and control for quadrotors","venue":null,"work_id":"68c87e8b-cf88-4485-b20a-75a78ec291c6","year":2011},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:36011a251e62d0c2fede4cd012b42bd45a48ae46ccc951f7481b56cdcf681454","observation_id":"9d2d2390-84f7-4326-b8af-be7313e83754","resolution":{"observed_at":"2026-05-25T04:35:22.015530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Drake: Model-based design and verification for robotics","venue":null,"work_id":"09860fbf-2b65-4ccf-8881-a6269ee3b564","year":2019},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:6dfb0b2294be4914ae00be7ab00a402bb8c36caa35d085eae6321015f33fd608","observation_id":"1817b5c3-c755-4b2d-abaf-731d80fc90de","resolution":{"observed_at":"2026-05-25T04:35:22.031932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":4,"verified_fuzzy":55},"total_outbound_references":60},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 1 inbound Pith citation observation for arXiv:2605.23240."}