{"as_of":"2026-08-09T03:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eff6086a1f13ae0643f248c7a5810f5d707ad426530bdbc6477a373c976bddc5","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:30:49.990716Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-07-02T11:55:26.547792Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T11:56:54.804493Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":"2507.10878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.10878","snapshot_observed_at":"2026-07-02T11:56:54.804493Z","title":"arXiv preprint arXiv:2507.10878 , year=","venue":null,"work_id":"c4022d83-8385-482a-b393-6c82c7009cfe","year":null},"citing_paper":{"arxiv_id":"2607.00444","last_updated":"2026-07-01T04:58:00Z","snapshot_observed_at":"2026-07-07T00:06:03.968882Z","submitted_at":"2026-07-01T04:58:00Z","title":"Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-02T11:55:26.547792Z"},"links":{"cited_paper":"/paper/2507.10878","citing_paper":"/paper/2607.00444"},"observation_digest":"sha256:481f35c01ce64ada90d8c3a66304336552fde2b68da14444bdaf369e4911c134","observation_id":"4677e346-0f88-46a7-90cf-adbf8196c61d","resolution":{"observed_at":"2026-07-02T11:56:54.806404Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.10878/citation-record","integrity":"/paper/2507.10878/integrity","json":"/paper/2507.10878/citation-record.json","paper":"/paper/2507.10878"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:30:51.917915Z","title":"The MOSEK optimization toolbox for MATLAB manual","venue":null,"work_id":"88168fba-01a1-4a95-a2b2-8fbe6399e5eb","year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.012518Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:c9ce34ee656b3f235e32c93fda6f37f388e0d50346a2bfb0fb30d869ff17d44c","observation_id":"4b4d0326-8406-4b98-aa4f-3c65b72b14d3","resolution":{"observed_at":"2026-08-06T17:30:51.921314Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.908194Z","title":"Generation of collision-free trajectories for a quadrocopter fleet: A sequential convex programming approach","venue":null,"work_id":"8964b5f7-a6a1-4171-a7de-c477daf8477e","year":2012},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.083989Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:0d07808473c962f5340bddd2ea6466406e668d04160ed8a87328fda0453dbc37","observation_id":"6eca924f-aa4d-46a5-b2ef-62392d04bb59","resolution":{"observed_at":"2026-08-06T17:30:51.911221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.899052Z","title":"Control of systems integrating logic, dynamics, and constraints","venue":null,"work_id":"263fdaaa-fbc3-4605-bc54-155e5174a30a","year":1999},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.186531Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:9ce8ed1f0e9a11a53e3b1b5b21dc20bbf78c87dd14940d763071c3444f8f471d","observation_id":"e729f5ff-e417-4f94-a319-f3ffc443b55d","resolution":{"observed_at":"2026-08-06T17:30:51.902191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.889696Z","title":"Survey of numerical methods for trajectory optimization","venue":null,"work_id":"c2a95bee-02cc-4aff-9c22-5c02edbbc0a0","year":1998},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.282000Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:100f11c7c459d7bcbac5050d3ca382c8dc885fa8a8fb5aa2281d214e452a56a2","observation_id":"b264226e-6a7b-497f-9377-9425922159b5","resolution":{"observed_at":"2026-08-06T17:30:51.892778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.879561Z","title":"Semidefinite optimization and convex algebraic geometry","venue":null,"work_id":"d7126d84-f5f5-4ae8-b4f1-065c9a7d3c48","year":2012},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.358257Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:621427a80483adc7d7d5e6af2c9129d730ae28d84945f0ef103f9098c5df702c","observation_id":"227b173e-87b6-4475-8ba8-67712126f3dc","resolution":{"observed_at":"2026-08-06T17:30:51.883320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.869619Z","title":"Sequential composition of dynamically dexterous robot behaviors","venue":null,"work_id":"67cb00f7-3e38-4357-a2ac-d1e57bb14644","year":1999},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.430048Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:6717c6386e73f4a8992249b2b28b3f38e2e47f0ae57dab3f7a4d7e427fe4acb3","observation_id":"763579bc-6ec5-4971-8398-7061f61c40b7","resolution":{"observed_at":"2026-08-06T17:30:51.873300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.860450Z","title":"A hybrid approach to intricate motion, manipulation and task planning","venue":null,"work_id":"8b9a0dbf-6b03-440a-94fb-a84db2ac9e3f","year":2009},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.523497Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:7036ded0811dbe55044cff21b1fd40e98439d185865070bb09215544aa466222","observation_id":"8b632e82-a0e1-46dd-b652-d4407d7c6a52","resolution":{"observed_at":"2026-08-06T17:30:51.863706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08848","last_updated":"2024-12-09T19:06:53Z","snapshot_observed_at":"2026-07-06T18:45:05.905995Z","submitted_at":"2024-07-11T20:15:00Z","title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08848","snapshot_observed_at":"2026-08-06T17:30:45.587408Z","title":"GCS*: Forward heuristic search on implicit graphs of convex sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.587408Z"},"links":{"cited_paper":"/paper/2407.08848","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:4f8dc74dbcd2cda0eeaa273c6795883cd0bfcbefc28c6abf9443f821f5623179","observation_id":"8889b036-c53f-4814-8adc-e0aa1e718f5e","resolution":{"observed_at":"2026-08-06T17:30:45.587408Z","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-06T17:30:51.850887Z","title":"Non-Euclidean motion planning with graphs of geodesically-convex sets","venue":null,"work_id":"8a64c7a8-9ea6-4b36-b141-e2ed0784e1f0","year":2023},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.689501Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:aa556f4d5134a60bbffca7f46fdec10cc14aee982c136a2c8f9b411673ae4af5","observation_id":"5fe1a549-7230-4bca-b9c8-32d3840f0386","resolution":{"observed_at":"2026-08-06T17:30:51.854262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.840978Z","title":"Footstep planning on uneven terrain with mixed-integer convex optimization","venue":null,"work_id":"0f12fb33-43f9-49f1-9c02-f8ce67b624a5","year":2014},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.751659Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:6a5b0bd47e8554957ceb331fd79cb0427e4c4e803937ffa028d891ce759ba64a","observation_id":"16e4d39d-5331-46f0-8353-6e69f58c43f0","resolution":{"observed_at":"2026-08-06T17:30:51.844811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.831351Z","title":"Computing large con- vex regions of obstacle-free space through semidefinite programming","venue":null,"work_id":"941e424e-9537-46b6-8a5d-4ab41c5ccbf6","year":2015},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.830957Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:cf9cf12dd36a0f60fbead76781694f71b6a5c1b834a78a5d218793791e9e7609","observation_id":"43f90427-040d-4cc0-b94c-e4c3dd5a4747","resolution":{"observed_at":"2026-08-06T17:30:51.834731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.821661Z","title":"Efficient mixed-integer planning for uavs in cluttered environments","venue":null,"work_id":"5fbf54b4-7b55-4e56-b9d9-42b90144b241","year":2015},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.926277Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:b51dcbbefec4866f23ae209e6d2b699b5d990e988f07e3a5dac66ba61e402ffd","observation_id":"1a99d44f-6e86-47c0-b38d-38cb305e22a4","resolution":{"observed_at":"2026-08-06T17:30:51.825042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.811354Z","title":"Sampling-based robot motion planning: A review","venue":null,"work_id":"48ed40a8-8e60-4c35-b96e-47e1ca8ab29f","year":2014},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.965413Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:66656c33059ffc67ca6dfde07adcad48abd07dafe5f6dafcde1b01fe9c857a86","observation_id":"a1c3e38a-eda4-409e-9b21-18d94f07ae67","resolution":{"observed_at":"2026-08-06T17:30:51.815110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.801774Z","title":"Scottyactivity: Mixed discrete-continuous plan- ning with convex optimization","venue":null,"work_id":"7e595bb8-909b-48bb-bc92-f21e3ddcab29","year":2018},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.011715Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:373432463a02aae5b2151bbd636dfc680356104bd86dad4d6032dda1ccd1d8ca","observation_id":"20aa68ed-c980-4ec2-9733-dc680bd763c2","resolution":{"observed_at":"2026-08-06T17:30:51.804888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.792141Z","title":"PDDLStream: Integrating symbolic planners and blackbox samplers via optimistic adaptive planning","venue":null,"work_id":"514c083f-70e1-4765-a5bf-4932fe8d5a91","year":2020},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.058305Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:9a763cff92442af934b6d553700b75bcb38aee48a40804732ea12ee95bf2c5f1","observation_id":"b7a7aff8-f036-4320-975d-fd54399eb74d","resolution":{"observed_at":"2026-08-06T17:30:51.795384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.782019Z","title":"Integrated task and motion plan- ning","venue":null,"work_id":"94f45273-75e5-4fcd-a8b2-1af43fe94cc3","year":2021},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.095945Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:38a3d877078fa0a47a76036191bc897cf5d23dfa5017953b51ed0e1932df780d","observation_id":"a1e77d6c-cb2a-46a3-b612-47fb9f4d5401","resolution":{"observed_at":"2026-08-06T17:30:51.785308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.770998Z","title":"SNOPT: An SQP algorithm for large-scale constrained optimization","venue":null,"work_id":"6ab8685a-1620-4055-8630-9023e89b9d48","year":2005},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.148135Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:ff8d1433d3a96665683ffdc06dbc02e982d7e78acff073aa824b401fb0a220ef","observation_id":"3a2aea0a-fb1b-4127-9b33-1238129535c9","resolution":{"observed_at":"2026-08-06T17:30:51.774519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.759534Z","title":"Optimal sampling-based planning for linear-quadratic kinodynamic systems","venue":null,"work_id":"6cb3cdf3-548e-424b-bd86-ebfc9e528e09","year":2013},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.237689Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:8f6590f3c6ed6baf11701a635a0cfa3e4fa4bb8829f12546361c4881990e385b","observation_id":"06eb6d7c-e36b-4708-939e-93971bc93bbe","resolution":{"observed_at":"2026-08-06T17:30:51.763365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.748391Z","title":"Towards tight convex relaxations for contact-rich manipulation","venue":null,"work_id":"0ffb2f14-7a52-49e0-9b24-cfa6df03c12c","year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.345563Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:582a64dc6aeef5f23e15b041d65136df27d7e7a643ecc85c76e8b182e9957a24","observation_id":"8d3fac38-5f3f-4821-bff5-9203aaf2ab72","resolution":{"observed_at":"2026-08-06T17:30:51.752145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.737346Z","title":"Sequential quadratic programming for task plan optimization","venue":null,"work_id":"b92bb97b-8913-48b5-b082-ff4adf56f5ee","year":2016},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.457780Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:722522aa5d14e79dad3b64072f1906e30e315dbcaa3994dfb7beca5a76d01c84","observation_id":"8b5eba9c-5819-43d2-b9a0-e741dfa2df05","resolution":{"observed_at":"2026-08-06T17:30:51.740763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.726615Z","title":"Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions","venue":null,"work_id":"5a39bf50-4231-4ccd-87f2-0203c8248b2c","year":2015},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.519932Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:6cc96d53d52445fe9ce3e9e484177edc012dd150bbf7ca9cd7d50f0dfeef0b45","observation_id":"8ec3f370-9f43-45ba-b50a-fe6a191a0aaf","resolution":{"observed_at":"2026-08-06T17:30:51.730158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.715966Z","title":"Hierar- chical task and motion planning in the now","venue":null,"work_id":"a335c0a9-2db3-44e9-8a27-134608fb86be","year":2011},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.604940Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:8a53531568998b8f4bf427fe36ccc7f3f2badb0be3f203705c0dc941f46ce006","observation_id":"cd820225-f887-444b-9183-22ae11006c99","resolution":{"observed_at":"2026-08-06T17:30:51.719417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.705254Z","title":"Biped walking pattern generation by using preview control of zero-moment point","venue":null,"work_id":"d1857559-2994-41a8-949c-634a2dce0611","year":2003},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.729946Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:949b7f7474a9eb02bd5501666054440453436e0f8f052a197abfec004671250b","observation_id":"b801821a-0bb2-4f65-bd2f-135ba36923ab","resolution":{"observed_at":"2026-08-06T17:30:51.708725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.694365Z","title":"Sampling-based al- gorithms for optimal motion planning","venue":null,"work_id":"0c7a09ac-b707-468d-a1df-9f720f0340e5","year":2011},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.799130Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:a3b2eeb775e8fd40b8fcfe1202cc69bc7797a612680639200567b0002df861c2","observation_id":"a9a5ab5f-cd33-46e7-a818-8738c9364ef5","resolution":{"observed_at":"2026-08-06T17:30:51.697926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:46.878201Z","title":"Reducibility among combinatorial problems","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.878201Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:474bfa19bbac76f9d00ed37c7c598db56ea16c8e12e52a8f77cd21a205e72fa8","observation_id":"67742df6-d1a5-499d-a943-c6654a2cb457","resolution":{"observed_at":"2026-08-06T17:30:46.878201Z","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-06T17:30:51.675815Z","title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","venue":null,"work_id":"19328dbb-68ff-477e-a9df-cea439932012","year":1996},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:46.952024Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:fac9a30a958e1c0d9a6c973c48ed24477fbe304b5336dae5bf62681d3223c4ce","observation_id":"16c45a33-47b8-41d7-b3b2-6bfaf559bd1a","resolution":{"observed_at":"2026-08-06T17:30:51.679893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.665284Z","title":"Skill discovery in continuous reinforcement learning domains using skill chaining","venue":null,"work_id":"d467d063-c2f9-4f67-be57-5a19176e7460","year":2009},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.004867Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:79da533150961fb39586fdbf80485999f9d5d6af6d3c9ef31f0ad712327faf8e","observation_id":"d09f731d-2820-4adb-9f16-5e489b0dad09","resolution":{"observed_at":"2026-08-06T17:30:51.669260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.654205Z","title":"Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner","venue":null,"work_id":"2c9b307d-3c63-4003-af1f-761840b97f4a","year":2016},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.104237Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:65d4581b85ca613047548c6b1f1591bb8f523313c97c9fd8ae94a78e44248953","observation_id":"ba97f83f-e99f-4eaf-8c0f-43a8e1be81f3","resolution":{"observed_at":"2026-08-06T17:30:51.657915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.643612Z","title":"Temporal logic motion plan- ning with convex optimization via graphs of convex sets","venue":null,"work_id":"4dce875f-1f08-4ce9-bfb7-1fabd931c31e","year":2023},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.192530Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:bb486adaecf83e05478ee495e308cab5cbe9e0eb9c9482ea78b464d0661d93ff","observation_id":"5c6ea0ea-d196-445d-a771-62e825be11db","resolution":{"observed_at":"2026-08-06T17:30:51.647420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.633145Z","title":"Global optimization with polynomials and the problem of moments","venue":null,"work_id":"2dc2c8a5-9a37-4a22-8583-f7bb842f7843","year":2001},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.273996Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:4e6713c15529b80c6c2240fcc3cdb0cc5445f9ca4c1336daa1e181503f3a33cf","observation_id":"2e396d06-b513-498d-ab5b-32d75855eaee","resolution":{"observed_at":"2026-08-06T17:30:51.636150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.623419Z","title":"Rapidly-exploring random trees: A new tool for path planning","venue":null,"work_id":"7396421e-d16a-468f-812a-436e492d0789","year":1998},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.355703Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:869bfd648cb373f710faf6b31a32280f200ae86afe33f17589f6fc8b65c9e337","observation_id":"748a2717-8197-4c50-9d47-b3a92b5d0096","resolution":{"observed_at":"2026-08-06T17:30:51.626986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11541","last_updated":"2024-12-16T08:21:24Z","snapshot_observed_at":"2026-07-06T20:07:37.024350Z","submitted_at":"2024-12-16T08:21:24Z","title":"Strong Formulations for Hybrid System Control","version":1},"cited_work":{"arxiv_id":"2412.11541","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.11541","snapshot_observed_at":"2026-08-06T17:30:50.420889Z","title":"Strong Formulations for Hybrid System Control","venue":"math.OC","work_id":"19906f48-d6b6-4554-bdda-d10dff5d7dca","year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.425465Z"},"links":{"cited_paper":"/paper/2412.11541","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:b2358758185383a2fee759c585eed03a314dea0aed932c05b2ec36b5b43074be","observation_id":"5f524d1f-a066-4953-815d-8c2fa742ce17","resolution":{"observed_at":"2026-08-06T17:30:50.514488Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.613210Z","title":"Funnel libraries for real-time robust feedback motion planning","venue":null,"work_id":"ded21a7c-0d1b-4dd4-a9fa-8112f495cf42","year":2017},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.491813Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:8a48b75076db4118d0f79b9d63e12714b3b284c58f34b6b181571f5eb2718d2e","observation_id":"66cc5d66-e7fc-4b28-ab7a-6967c86cd8fe","resolution":{"observed_at":"2026-08-06T17:30:51.616849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.603411Z","title":"Graphs of Convex Sets with Applications to Optimal Control and Motion Planning","venue":null,"work_id":"cf6328ba-22bd-4bcf-89d1-f88c6d7ae8d4","year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.560037Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:bb05d833dde134ff6e7b614de0a13caa9133d103a52399c3c0bf01e8fa4036f0","observation_id":"52196996-9ecc-4115-b35f-f7b4dbcb74e2","resolution":{"observed_at":"2026-08-06T17:30:51.606780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.594360Z","title":"Motion planning around obstacles with convex optimization","venue":null,"work_id":"85a14a26-2654-4f2b-b5e6-8a4d771afde6","year":2023},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.634490Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:a25dc7ce882fe08efc1160a67bd6146d7da240c3bba46bb52109742f32373e11","observation_id":"4b1c9621-021d-4066-8abf-20ef443dc893","resolution":{"observed_at":"2026-08-06T17:30:51.597553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.585100Z","title":"Fast path planning through large collections of safe boxes","venue":null,"work_id":"e1ffd4da-6b21-482f-99de-b4599369f585","year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.707370Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:9cf9f72a4a164593c535b0c1d12f580bb92986cbbb28e6969a5645e2cdce1446","observation_id":"c6469625-8cf7-4486-8e14-64a87b1ac11c","resolution":{"observed_at":"2026-08-06T17:30:51.588119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.575814Z","title":"Shortest paths in graphs of convex sets","venue":null,"work_id":"a04f770a-8313-4fda-98ab-850f811aadc9","year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.788796Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:3c55e63e0a33b83f7788fe322f01dc82715756559b2df2d9270dd5c14166f040","observation_id":"a90d38ff-6417-44cc-8458-d66c68d3ea26","resolution":{"observed_at":"2026-08-06T17:30:51.578873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.566066Z","title":"Mixed-integer quadratic program trajectory generation for heterogeneous quadrotor teams","venue":null,"work_id":"87f86d81-1b67-402a-abfa-b48668069a85","year":2012},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.883964Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:54104bec9363168c3b52e9d22c051152ba4a3b491fdfd8f18d53342c3df661ce","observation_id":"c09c7c2a-d3b1-49c7-b144-15dfc5be174b","resolution":{"observed_at":"2026-08-06T17:30:51.569685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19543","last_updated":"2024-09-29T04:01:29Z","snapshot_observed_at":"2026-07-06T19:23:58.763033Z","submitted_at":"2024-09-29T04:01:29Z","title":"Multi-Query Shortest-Path Problem in Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.19543","snapshot_observed_at":"2026-08-06T17:30:47.976094Z","title":"Multi-query shortest-path problem in graphs of convex sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.976094Z"},"links":{"cited_paper":"/paper/2409.19543","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:de80b76cede02db0aa5345c33d228f3331302f461c920656dbb985d8b2c62895","observation_id":"f9d04de3-1f13-40d3-9f7c-aaf6277d1533","resolution":{"observed_at":"2026-08-06T17:30:47.976094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08909","last_updated":"2024-10-11T15:29:49Z","snapshot_observed_at":"2026-07-06T19:31:53.397265Z","submitted_at":"2024-10-11T15:29:49Z","title":"Implicit Graph Search for Planning on Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08909","snapshot_observed_at":"2026-08-06T17:30:48.050028Z","title":"Implicit graph search for planning on graphs of convex sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.050028Z"},"links":{"cited_paper":"/paper/2410.08909","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:7f43c46c026a3f7d25432e5614d5f708785588df27a4756a6d710b8fd8884c23","observation_id":"cfc57827-1c77-4832-bb39-f2553b265562","resolution":{"observed_at":"2026-08-06T17:30:48.050028Z","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-06T17:30:51.556533Z","title":"Structured semidefinite programs and semialgebraic geometry methods in robustness and opti- mization","venue":null,"work_id":"1e72d139-9673-4fa5-b4f0-9f6487464f7b","year":2000},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.153775Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:a64bad4e5abc47644aa1b16a305bcdf594d02158b421d11bdd081ba9b184574d","observation_id":"5c9d15bb-33d3-402e-a9bf-4e42059fd837","resolution":{"observed_at":"2026-08-06T17:30:51.559800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.546804Z","title":"Semidefinite programming relaxations for semialgebraic problems","venue":null,"work_id":"a72fdc48-f7d4-4529-979c-9ed5e3387247","year":2003},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.227477Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:71fd3adc5f7dd1352fcea2bf32ceea6e62c4bfb86d10e240cdf409c8592e5411","observation_id":"6d1ecabb-6807-49d0-8d06-b1195e21c5b7","resolution":{"observed_at":"2026-08-06T17:30:51.549797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.14737","last_updated":"2023-03-26T14:37:06Z","snapshot_observed_at":"2026-07-06T15:08:08.184681Z","submitted_at":"2023-03-26T14:37:06Z","title":"Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.14737","snapshot_observed_at":"2026-08-06T17:30:48.300220Z","title":"Growing convex collision-free regions in configuration space using non- linear programming","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.300220Z"},"links":{"cited_paper":"/paper/2303.14737","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:4c3b4e93675c686c582709944a34cd6927caa6a5607d548e475e918c4422f618","observation_id":"4afa6d17-af70-4062-bb17-95440c6a7a69","resolution":{"observed_at":"2026-08-06T17:30:48.300220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04917","last_updated":"2025-01-13T20:28:04Z","snapshot_observed_at":"2026-07-06T17:41:19.171822Z","submitted_at":"2024-03-07T22:03:36Z","title":"A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets","version":3},"cited_work":{"arxiv_id":"2403.04917","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.04917","snapshot_observed_at":"2026-08-06T17:30:50.184455Z","title":"A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets","venue":"cs.RO","work_id":"015e6031-3e45-419f-8d96-09eb321bea68","year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.397173Z"},"links":{"cited_paper":"/paper/2403.04917","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:e0e21c712343273a3f94af9039ac8546ebade7ec75704d8e72293889e33c3863","observation_id":"0bceb8b5-d3e6-4053-b911-f302c00e9b27","resolution":{"observed_at":"2026-08-06T17:30:50.264462Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.536577Z","title":"Aircraft tra- jectory planning with collision avoidance using mixed integer linear programming","venue":null,"work_id":"53e8e8a8-cdc6-486b-be03-b91ddbf88478","year":2002},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.498622Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:584cffdafab38bf6ddbeb6b215c6067de20bd45d6a50ab2b94a178667a981c6c","observation_id":"02cd205f-4962-4715-98bf-11894ed6ceb4","resolution":{"observed_at":"2026-08-06T17:30:51.540240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.527377Z","title":"Mixed integer programming for multi- vehicle path planning","venue":null,"work_id":"c83df700-4962-453d-9ec2-c8bde8c2956b","year":2001},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.570814Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:cdbb45002ff3aef6edf9f0be98756946912e255e33ff943364ae9a4ebe4caa2b","observation_id":"af1c0cac-d7eb-46f1-bf44-c69287789815","resolution":{"observed_at":"2026-08-06T17:30:51.530634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.517777Z","title":"Motion planning with sequential convex optimization and convex colli- sion checking","venue":null,"work_id":"0bf44bcc-0708-46a3-88b1-12f18e1b9d8b","year":2014},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.643319Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:38917c2ab2a8c21971b3a0e426aa92f9c580868945a133d08ee9cba81164da67","observation_id":"74e801a3-afc0-414e-b080-eddb427066d6","resolution":{"observed_at":"2026-08-06T17:30:51.521038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.508084Z","title":"SMC: Satisfiability modulo convex program- ming","venue":null,"work_id":"b4085ce5-7453-464b-9f3d-ad96bb2e3c36","year":2018},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.724914Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:b1fbd087dc60c66e2bb3efd66a5ae14365b49761c711f873cbc73bbbb317b429","observation_id":"dbe24796-7dd2-4cbb-bb93-60ac11735a17","resolution":{"observed_at":"2026-08-06T17:30:51.511579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.498546Z","title":"Nonlinear regulation: The piecewise linear approach","venue":null,"work_id":"5ca71444-300b-4083-a657-acfc687c161f","year":1981},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.802510Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:636bd5250f3c34d2e5bfe37a152c64bf42b03f15f0c579b1239cc63805dfc7d0","observation_id":"6f0d5464-7933-4b97-8ba4-ecb310d138f7","resolution":{"observed_at":"2026-08-06T17:30:51.501563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.488659Z","title":"Interconnected automata and linear systems: A theoretical framework in discrete-time","venue":null,"work_id":"4a04c4f6-fdb8-4721-837a-e16e00d3f423","year":1995},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.870431Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:cf4f2880913324a8bd01d4f1cc4b2758f7f016c42ae0f7ab811902fcfe194edf","observation_id":"1dff30c4-d9b0-4c7f-a97b-5d42eb65f614","resolution":{"observed_at":"2026-08-06T17:30:51.491948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.477984Z","title":"Combined task and motion planning through an extensible planner- independent interface layer","venue":null,"work_id":"d5cc4a6b-8331-4e21-8181-e86b7d1397f5","year":2014},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.943104Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:7732d93bd5efba8edc59b20236189bd2a15abac9b00371507097e2788e9cfd20","observation_id":"9c64c71f-1cda-4cd4-a6af-585151ae908f","resolution":{"observed_at":"2026-08-06T17:30:51.481910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17413","last_updated":"2025-04-19T07:19:16Z","snapshot_observed_at":"2026-08-05T20:46:19.626852Z","submitted_at":"2024-07-24T16:48:32Z","title":"$A^*$ for Graphs of Convex Sets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17413","snapshot_observed_at":"2026-08-06T17:30:49.027342Z","title":"A ∗ for graphs of convex sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.027342Z"},"links":{"cited_paper":"/paper/2407.17413","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:0d975b06be7fcc3eb001a77d5c7c9adf8dc54a636ba15ae94b2c08a74c62ca24","observation_id":"06c0ae8a-c1cb-4eb8-8a31-aae7a7c3f156","resolution":{"observed_at":"2026-08-06T17:30:49.027342Z","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-06T17:30:51.467623Z","title":"Between MDPs and semi-MDPs: A framework for tem- poral abstraction in reinforcement learning","venue":null,"work_id":"adba9c4a-f456-466e-94a2-86b26def7c93","year":1999},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.099851Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:86dd4b14db8c7273fd39ecfedd3c950e82be6332c2fd3aa08790fbc53b356800","observation_id":"3107d9d7-c28f-4919-b641-cc1c2265c5a5","resolution":{"observed_at":"2026-08-06T17:30:51.471092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.457503Z","title":"LQR-trees: Feedback motion plan- ning on sparse randomized trees","venue":null,"work_id":"4837209a-f31b-481f-9b3f-4de315ae4dd6","year":2009},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.171932Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:ef3d30126344af923b17b75ffd595b532dc5004f2b6ed63676a547b13baac1fc","observation_id":"5c616e5d-dc76-4849-8f2c-9e6307dc0321","resolution":{"observed_at":"2026-08-06T17:30:51.461090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.447738Z","title":"Logic-geometric programming: An optimization-based approach to combined task and mo- tion planning","venue":null,"work_id":"9c636306-581f-4a39-a141-3263e17239f5","year":1930},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.246297Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:18a79ceadb7fe91c33c584111aab660ff567af94e0d2fd7bf35b7066ea8c969e","observation_id":"a6cc794c-36c6-4e73-a4d0-ac108ccc8c16","resolution":{"observed_at":"2026-08-06T17:30:51.451040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.438296Z","title":"Time-optimal path tracking for robots: A convex optimization approach","venue":null,"work_id":"cd967c3a-d5e8-4cc7-b170-8274e5653c66","year":2009},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.312234Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:4ed71008a771470f2e366a556e6655fa21ed1c89a902c8e6224998d3be75f051","observation_id":"d3b33eb0-08bf-466a-9399-408fac7933fa","resolution":{"observed_at":"2026-08-06T17:30:51.441511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.427873Z","title":"Using graphs of convex sets to guide nonconvex trajectory optimiza- tion","venue":null,"work_id":"6b1ff908-ce9f-4074-a583-4efa32d01949","year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.406220Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:285192002a36a3bdb821b7e95b95f83ba2c4e3bb202425724be95d620d022d7d","observation_id":"fc73d427-d685-4291-a642-8e02252f405c","resolution":{"observed_at":"2026-08-06T17:30:51.431413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:49.484984Z","title":"Zero- moment point—thirty five years of its life","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.484984Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:010e45bbfd56c2ac2534ad5c166015e22a945c2c266d693c2b4bc5a23e834f2f","observation_id":"04e59d58-88b7-4c13-9544-9538e613b8e0","resolution":{"observed_at":"2026-08-06T17:30:49.484984Z","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-06T17:30:51.234422Z","title":"Kinody- namic RRT*: Asymptotically optimal motion planning for robots with linear dynamics","venue":null,"work_id":"616b49ae-6519-498f-9655-0fe238f91533","year":2013},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.562761Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:7ba6db834927a16bc07d4b783f6c245c44d4c15d5ac597c59f2547183f14678d","observation_id":"b9b2a770-8f26-4cae-9cc0-f03a2f1d1937","resolution":{"observed_at":"2026-08-06T17:30:51.289998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:51.061245Z","title":"Approximating robot configura- tion spaces with few convex sets using clique covers of visibility graphs","venue":null,"work_id":"33bc201e-7ca9-4084-9cb1-0085250632d6","year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.606146Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:4cd462099032e29dd0b80012b06f1fc3d5ddb75255c9cfed9e53085335949ff8","observation_id":"efae06d5-74b4-4b6e-83ac-07f3f86938ab","resolution":{"observed_at":"2026-08-06T17:30:51.127198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T19:34:37.027078Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-08-06T17:30:49.674096Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.674096Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:61f88fdf5bb44b72316f3d4c76e0a63648714a7af16aa34c046fd06cd9235fd6","observation_id":"bcb972c7-cf6e-4870-9ce3-4bed143cba18","resolution":{"observed_at":"2026-08-06T17:30:49.674096Z","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-06T17:30:50.759362Z","title":"R3T: Rapidly-exploring random reachable set tree for optimal kinodynamic planning of nonlinear hybrid systems","venue":null,"work_id":"013e3daa-321f-4341-b374-822c20e20b10","year":2020},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.844432Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:ef48b5e2b0db54523370545244f83dceaf40c3f53c027b8dc6eaa4278fbc7c9d","observation_id":"5725ae6d-a4d3-49b3-9032-84949f73addb","resolution":{"observed_at":"2026-08-06T17:30:50.891814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T17:30:50.590569Z","title":"Optimization-based collision avoidance","venue":null,"work_id":"0a3aab02-9b1a-4313-af9f-2e3645d4d186","year":2020},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.990716Z"},"links":{"citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:64909088ec4de905b4b3b037ea2c7ba970b4fde2787f60127aceb93e629648ff","observation_id":"182abb6a-2f61-4317-89d7-94a7b81a536e","resolution":{"observed_at":"2026-08-06T17:30:50.685956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":52},"total_outbound_references":63},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 1 inbound Pith citation observation for arXiv:2507.10878."}