{"as_of":"2026-08-12T11:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2dcc1c9ebcc29ee9932161e57d7c120df9b31312b138b625b09d18673f9a7580","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-12T06:34:41.77262+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-10T02:08:35.421855Z","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:9d9633b0a962204f41478241aea7c59696d891be1f90d7f22e5e48aee4edcc8f","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:4aecdb5b73f599b678c7565e8e04d47752400f97682bef876b61abbe5b953b55","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:dfeb050fcee8b8d5bfdeb62bb7b9cf0cb59730b6aa8aa50d270bc5253606546e","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:ea93b5ddc631112d9fecb903c81e294070b9e0722b1957c1f71489bb5f928324","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:77287cd0ad355a41aa6313576d7e3db9ed3ed5564609265c748496857d27b8fe","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:941f199edf8a27176b3fb03c70690ce84de88d9580184af986eff897070d2dd7","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:a35be3856920a41b1f77de6ad08d9bece330f5d863f383142cdd810cb3d3dfd1","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:9b1424a6ad48e8ea9ec2120d34ba2064163a16d997208b959dbfa0bdc5bbb4ea","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-11T09:47:05.208697Z","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-10T02:08:35.421855Z","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:e0c140adeda62ee6fb2e92a84b0e6da7513a8fe78fe8fc02a3e80ff5fb572f0e","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-10T02:08:35.421855Z","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:08c77f609c55d018e7b8f1eec1aba07f98c717868c823da165ed0f47294de164","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:0953634906fb172e3f2d85cff9ec49bf629631bf629c10b14724a892b42b1ff2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:1b45e9441b042ab140589e16e93260042435de21c4558e847025511d93c9d572","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:89d776e3d10ac4063e4580eef1e32973d3be8b6ec13a840ba63257403321f6f4","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:751313e13b31d3b4fbbb970fbd17ba3ad1e7bb379474d4304472a2e73e13d657","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:98aeb2e0531d88e3ed68fafa18c42fa43f7e3ae4c9490092520de2fa69a6b005","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:230f15c76441a4fd6a7d5f90a38c5407a3dd62ef23560ab9d6230a69161846da","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:7044b00f16ed0f48c3ec873496503c4a8017ce92e94f5342e6f932fce6468158","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:4cf8743b01b5f5a082f6585e8e664de8de3ff7933f341612a2482648da98e31b","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:ed23e0bbe88c930ed56f5148426d26cce7c2c84f9d554de352be3ceb159debd3","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:441278ac20700e09f13b497292f9ad83cbcb5ecc73ca63631aecbbb4dacea8b4","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:e4639d5da338157494da4681b4d00f38656a5223206e394119bdb861e5caffb2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:38501e93c2f8a7ed34d516a0240670aea135c2cd07267f8df3a9ba3df85083da","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:32d4c08d9894e95a49217fb0d98d48a7ffd8d5ff8ebd958f24f1da004cbc1e4b","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:258c80ae5f90581cd5872adb0cb46f507809a79824c229177e52209a978e9837","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:8b0f9641a1649e8188bece5f5630839dd2b949f4811b4e303da0eda45533b08e","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:ed4cf96af35242969de76d4cf2c21059ef9d75b5804f8f2b0bc4009960a42324","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-10T02:08:35.421855Z","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:72f3a2e500bd2ff189573b1437af5cf64f5d7ce0f7c2d4a5c484aa76f9a77975","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:f29e86b83b796f460ffba60f2a4caf2399f842a486c5c6623868b192167b6ae4","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:db91a4ac480393759697e575c52b00e9c4b5f0e2014086c8ef2b860e3a749a5b","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:2c7940b5768e3e7fe7d610886c65dcc4bf8c7d702445cf04a26abe9c4e4659a2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:a794fbd47b769f09c401e2392888cd14c7ca382b41a697804747ac1c617d1f17","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:f9c737b5e57f3802ce378b2349663148b71fbb5ca7c804a205ba791a70ca48c0","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-11T21:06:19.187899Z","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-10T02:08:35.421855Z","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:eca46f8d3b34d1ea93e4a738f10e81a6c8362447d26f783e6dce4c13b085cd52","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:61740f4fec08b5f22eca0cd62ac3e92ab9864f27212dde632e52355eea907b80","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:c1490aec9c67ffe67a95d251045ed143aa408fafd1b3240a142c112e69a55e0d","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:ab0d74fd8f40d5b97eeb0ced9b5a309dc2b787b3f08949ad57fef5bca2079772","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:d4aaa7c8c1db5f67e95edac2b7e4d26fd2f9c2ad6410831f9ec7369160a1e3bb","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:ae89a1a516f1f8944d0ad6fc1cacadeff7a8bde037c9e617cfccac456493e000","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:72dd323e3374aec9f4a8843e08e5c96099db829940852c431c771ad539bf2071","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-10T02:08:08.045748Z","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-10T02:08:35.421855Z","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:8d6b4bf0abb24a9c5b1b83210a5dd5eff23b861885ee6f7094bc0d104af730e2","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-08-10T15:57:39.286819Z","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-10T02:08:35.421855Z","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:2da495382ea485dc2c4e9869336b23e87b9490b0911d3ca2f2cdad83c940289d","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-10T02:08:35.421855Z","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:e216e7dd354bd707a72b6aec593a3b423355c86462582a928cc039566a68764a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:c18c09586b4a87ebb8c19339f22fe8afc7f5f153baf91b135a915209aaf1afb4","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:f2f49699eef2f4345250b922acf5efe95cfe162ecb024cfd0f3d3f1e7e9cb962","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-08-10T19:13:33.673254Z","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-10T02:08:35.421855Z","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:e9c12c517e5a79843c92ffc8cc94a8459cf074346275dad38162bcaa7aba47f1","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:bc6e42797c2a44c825f7b94b92e2d1eea043f994644a80492460a84e3420dc56","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:816b88c031d8748f3adf94a31c04e223b6e8ff3b9f07730782dd7d6f57cff0aa","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:ee4e00533f9b8694509616c6e5220c28cd1c33c26c5c6d97c2e10f70b2758dc0","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:cc798ea306f4aa5c28bc1fe8256cdc0f2c5d13129db2be9c6faed7a3acf6f9f1","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:9baac4a37db7df1e2cea4a8451af313175eb803248e6f280cc3b902f304579ee","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:7e263c7606e994623f5d28701f67768eee5279ecb06d8766679b2d59596d1ad3","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:6e3b94bbafa031838f5ba9a0e851aecb957613a94b2959453044bc40747f95f5","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T14:41:39.079052Z","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-10T02:08:35.421855Z","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:be9bfa667cd80ea803956e00c679e6bebe15716a4d743f7e881e5f83acc3298f","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-10T02:08:35.421855Z","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:e83c6bb93660592bcf2ffd9814efb8f19058ebc482d8a45aea3e2a17fd92de93","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:d1088cc6c16b33d71da912a31c4bcae0e99686f871eec81e5d474cadc6e5e4b2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:92dfe2611193b91b6a9183650a0e6a454862b256ba618ebb8d21c643d6aa90c7","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:a71202910213e836257f996b932101edd971b3dd8afef19a84a24e613e800402","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:c127a5b76010f06c86f1f1de10e4b7abb385c556f3ea081930195037e0c61a72","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:9b27949213165101230c92cdb7378b2e70df5074b7a36e1f08fd47a5948b63c9","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-10T02:08:35.421855Z","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:46085ace43b60a056ef72bc27ac7070390e791e94ee6b722c9740efa7cb03438","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:af3e7b5b6bf4ced55e8880f2f5b4a22824ccc04cfa37fa3073c950d911f8a7d8","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T09:42:37.079773Z","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-10T02:08:35.421855Z","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:452f4b8714bb8abeb7f73e6b005b5314ac8f4b655399434743ac6010352749a9","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-10T02:08:35.421855Z","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:138d8694f55d39401b54c429759e78b91e21d7a51358c8c6826f3f137e5114eb","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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:d0e719fa93dfbcd26fa15957a547cca2219a10b1c5b94d9b18bf74c98b9087f3","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T02:08:35.421855Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 1 inbound Pith citation observation for arXiv:2507.10878."}