{"as_of":"2026-08-17T02:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e1580b90d14f33426396ac18307775b6920734a51fb542b3d1d71a7bf482ed7","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:13:23.471172Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"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":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"cited_work":{"arxiv_id":"2504.18978","doi":"10.48550/arxiv.2504.18978","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.18978","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2504.18978 , archivePrefix=","venue":"ArXiv.org","work_id":"032296cf-e76f-41da-9b25-3c29d995a079","year":2025},"citing_paper":{"arxiv_id":"2605.07038","last_updated":"2026-05-07T23:33:34Z","snapshot_observed_at":"2026-08-12T12:24:12.728181Z","submitted_at":"2026-05-07T23:33:34Z","title":"Learning Material-Aware Hamiltonian Risk Fields for Safe Navigation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-11T01:03:58.907980Z"},"links":{"cited_paper":"/paper/2504.18978","citing_paper":"/paper/2605.07038"},"observation_digest":"sha256:f26dbecb0f3b5f65cb4d50c6a5d179718b1d01a8fecdc25413c28c010a4ef911","observation_id":"b25d1124-536b-4c6f-8896-58864946b778","resolution":{"observed_at":"2026-05-11T04:50:54.635875Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"cited_work":{"arxiv_id":"2504.18978","doi":"10.48550/arxiv.2504.18978","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.18978","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2504.18978 , archivePrefix=","venue":"ArXiv.org","work_id":"032296cf-e76f-41da-9b25-3c29d995a079","year":2025},"citing_paper":{"arxiv_id":"2605.07038","last_updated":"2026-05-07T23:33:34Z","snapshot_observed_at":"2026-08-12T12:24:12.728181Z","submitted_at":"2026-05-07T23:33:34Z","title":"Learning Material-Aware Hamiltonian Risk Fields for Safe Navigation","version":1},"reference_index":153,"source":"arxiv_source","source_observed_at":"2026-05-11T01:03:58.907980Z"},"links":{"cited_paper":"/paper/2504.18978","citing_paper":"/paper/2605.07038"},"observation_digest":"sha256:72e8f5cf2cadd3d4830b66fe1ff1b9d6301bed0dcd842133b31aa73d2394dabf","observation_id":"6506692f-1b79-404c-8547-5af29e92e88b","resolution":{"observed_at":"2026-05-11T01:05:50.139808Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"cited_work":{"arxiv_id":"2504.18978","doi":"10.48550/arxiv.2504.18978","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.18978","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2504.18978 , archivePrefix=","venue":"ArXiv.org","work_id":"032296cf-e76f-41da-9b25-3c29d995a079","year":2025},"citing_paper":{"arxiv_id":"2606.04536","last_updated":"2026-06-03T07:18:31Z","snapshot_observed_at":"2026-08-14T01:27:32.045812Z","submitted_at":"2026-06-03T07:18:31Z","title":"Scaling Self-Evolving Agents via Parametric Memory","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T06:45:04.236649Z"},"links":{"cited_paper":"/paper/2504.18978","citing_paper":"/paper/2606.04536"},"observation_digest":"sha256:9677d9e46083365f8b1f9a45e6309d005f04bd620875822a0b796fcd551ff00e","observation_id":"c713eda7-f4e2-4054-bab0-e2daf75f93cd","resolution":{"observed_at":"2026-07-02T07:46:45.846227Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"cited_work":{"arxiv_id":"2504.18978","doi":"10.48550/arxiv.2504.18978","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.18978","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2504.18978 , archivePrefix=","venue":"ArXiv.org","work_id":"032296cf-e76f-41da-9b25-3c29d995a079","year":2025},"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":76,"source":"arxiv_source","source_observed_at":"2026-07-02T11:55:26.547792Z"},"links":{"cited_paper":"/paper/2504.18978","citing_paper":"/paper/2607.00444"},"observation_digest":"sha256:64374d7be314751e557314a846ab293a44a7d3c281e64dc7956db757d245c217","observation_id":"73d5a980-2cff-4d1d-920b-afcb73548bd8","resolution":{"observed_at":"2026-07-02T11:56:54.809954Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.18978/citation-record","integrity":"/paper/2504.18978/integrity","json":"/paper/2504.18978/citation-record.json","paper":"/paper/2504.18978"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.289191Z","title":"Practical methods for optimal control and estimation using nonlinear programming","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.289191Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:874619b4bb82f678b0a97eba67b2d1ba80548cb8780ddb92720dce7cd76ac120","observation_id":"60439325-8f10-4659-b5bc-e5bef75fb0bc","resolution":{"observed_at":"2026-08-16T10:13:23.289191Z","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-16T10:13:24.293151Z","title":"Massively parallelizing the RRT and the RRT*","venue":null,"work_id":"bcca1199-ec58-4b35-b31e-f7ef5c267bb6","year":2011},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.294057Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:7355e5e7375f99a55f1b4b7fc3de8bb0d5e2fec4540e26c1819afc83ee16bc6f","observation_id":"e1188561-c238-4afd-a720-1bd1209b53bd","resolution":{"observed_at":"2026-08-16T10:13:24.296926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:24.281072Z","title":"Convex opti- mization","venue":null,"work_id":"ea729440-0b36-41c6-b97d-af7c82cac0a5","year":2004},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.297940Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:c664059977cbf5b2920d6d97cb3c2518dca0fe5ac832ceac4c8e275f8b002dcd","observation_id":"443eb905-2f9b-4546-9b1d-6d927d27cd66","resolution":{"observed_at":"2026-08-16T10:13:24.285474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:24.270079Z","title":"Online gener- ation of collision-free trajectories for quadrotor flight in unknown cluttered environments","venue":null,"work_id":"e5f4d41f-210b-4d76-91ca-9958845977f9","year":null},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.302157Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:e81c2048d043e1836a1ecd55cd156c5fa6e8a43818669ff6476122f86a78582e","observation_id":"d7803458-43c0-47ff-b336-9ff916e1812c","resolution":{"observed_at":"2026-08-16T10:13:24.273914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08848","last_updated":"2024-12-09T19:06:53Z","snapshot_observed_at":"2026-08-16T13:34:57.021371Z","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-16T10:13:23.305694Z","title":"GCS*: Forward heuristic search on implicit graphs of convex sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.305694Z"},"links":{"cited_paper":"/paper/2407.08848","citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:04d60d84ca781f7761fd32dffe603e8292f2c5a2f53dbb05f43ba9750f4696f3","observation_id":"571e42bc-c691-4e9b-8e51-5de68492a552","resolution":{"observed_at":"2026-08-16T10:13:23.305694Z","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-16T10:13:24.258563Z","title":"Certified polyhedral de- compositions of collision-free configuration space","venue":null,"work_id":"ba204f7f-906c-4631-8d4e-55aa7851aade","year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.310087Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:a21abc1bd088f3006b0451898879f672f62531d1c4aae2eb4ae9d71103c6cd43","observation_id":"882b43af-11c5-49f7-b1d1-b1aa9e31bdd5","resolution":{"observed_at":"2026-08-16T10:13:24.262278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.314078Z","title":"Computing large con- vex regions of obstacle-free space through semidefinite programming","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.314078Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:47cff0143f5db7b0bf1bf5f3cf821259f62c0a6334c0b6fbb0e2854cc36a2205","observation_id":"318a747c-a43e-4514-b33b-f7b0e4a07b7f","resolution":{"observed_at":"2026-08-16T10:13:23.314078Z","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-16T10:13:24.234224Z","title":"Efficient mixed-integer planning for UA Vs in cluttered environments","venue":null,"work_id":"d7fbe791-3bec-4a0b-a851-d36c8acaf4e2","year":2015},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.318368Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:6cab43e294824f0f4c5f6ae980ae681411172a6d63ebcaa7157430fc6161828e","observation_id":"c406c401-1754-497b-93d3-80fddec9971b","resolution":{"observed_at":"2026-08-16T10:13:24.237952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:24.167458Z","title":"A general system for heuristic minimization of convex functions over non-convex sets","venue":null,"work_id":"6d30c5e9-d28e-4377-8bc9-e8d75253392f","year":2018},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.322482Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:5a527696f5ed2930c670f7b7ac8f55a18fc74eccb4393ec18be45b51bc3fcfe2","observation_id":"2f27150b-d4ea-4a36-a748-2e99917b6790","resolution":{"observed_at":"2026-08-16T10:13:24.199629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.996103Z","title":"Algorithms for polynomials in Bernstein form","venue":null,"work_id":"ee3a9cb6-829f-4621-8dd2-afc9510f5958","year":1988},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.326827Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:ee5235a512d52d682f563008fa23c3a2722b44e8608681874652c5d1e979f1f1","observation_id":"8e4ec8b1-a1ee-41fe-89d0-27a772ecf360","resolution":{"observed_at":"2026-08-16T10:13:24.064196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.915677Z","title":"SNOPT: An SQP algorithm for large-scale constrained optimization","venue":null,"work_id":"da334c52-ef04-42ea-9993-5f52cac84113","year":2005},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.330489Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:0b2b5f0e3d5f6d6680f6d9fe10637276893b4d6c3abe148f3341f65d0ca823a5","observation_id":"a5763696-ef71-41fa-be8e-36b6916730ef","resolution":{"observed_at":"2026-08-16T10:13:23.920061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12762","last_updated":"2024-05-21T13:15:19Z","snapshot_observed_at":"2026-08-16T13:50:58.306485Z","submitted_at":"2024-05-21T13:15:19Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-16T10:13:23.334399Z","title":"Clarabel: An interior- point solver for conic programs with quadratic objectives","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.334399Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:a1859027c4f41f17a01fb2a7f6c2ec0a082633153e31e9ecea99c3083df575cc","observation_id":"54b0b2a6-6ad3-4123-a724-0db18b4040c2","resolution":{"observed_at":"2026-08-16T10:13:23.334399Z","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-16T10:13:23.904201Z","title":"ALTRO: A fast solver for constrained trajectory optimization","venue":null,"work_id":"53cca400-03e8-4a0e-b0d4-4e14a9cd0614","year":2019},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.338991Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:6c79a7ec09282ff79ab7a72cf0e0ba3cc57f95af2b609697f2772b19ce43e09a","observation_id":"6d8298ca-416d-4a21-add2-d0e60699be7e","resolution":{"observed_at":"2026-08-16T10:13:23.908548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.893485Z","title":"Gomp: Grasp- optimized motion planning for bin picking","venue":null,"work_id":"5a10ab29-4a60-4578-8ddf-c8b5ef777ed3","year":2020},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.342481Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:5a8ee8c71faa30fc1918b3d0de9adf2a3ba0c7719d27d20f1ce17b53a9318e61","observation_id":"c7071547-1855-424c-89b2-5d8cfc8bc062","resolution":{"observed_at":"2026-08-16T10:13:23.897022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.882979Z","title":"STOMP: Stochastic trajectory optimization for motion planning","venue":null,"work_id":"2e7a19f1-4e44-44db-9461-8aa1c47a100b","year":2011},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.346175Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:1222395cc4ac06ccd539e8dd65ad72c810721fdafdc4f49b2ccef5ab7ea7e07d","observation_id":"bfd4ec42-830e-4ff8-976d-41a40952934f","resolution":{"observed_at":"2026-08-16T10:13:23.886601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.871253Z","title":"Optimal kino- dynamic motion planning using incremental sampling- based methods","venue":null,"work_id":"c3033130-6782-4c30-bd3c-cce9bf13a6d3","year":2010},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.349903Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:17e126ff49ae4de83d5b74d813c3664f93fd7168bdb19a31d42dbef31eebb3df","observation_id":"2df9d2e6-8527-4d06-bc9e-547dbed44e0d","resolution":{"observed_at":"2026-08-16T10:13:23.874870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.859424Z","title":"Sampling-based al- gorithms for optimal motion planning","venue":null,"work_id":"798b8491-d38d-4d8b-9073-ff90c8cd5d53","year":2011},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.353956Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:62840e610ed79364e3e0b8a92acabc2c056bbc260268d80066179faadf117aef","observation_id":"da394aa4-8a5a-46b2-b431-ab5deb8c7021","resolution":{"observed_at":"2026-08-16T10:13:23.863845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.848654Z","title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","venue":null,"work_id":"b04b9e76-0d4b-466a-b013-cff58dae8e9f","year":1996},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.357875Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:988ce409fd59d780ed18e1c970e79f44e5c77cc18864cce2239eb379a330312f","observation_id":"f9a56e22-5471-4760-b0ca-ca1f406f63ab","resolution":{"observed_at":"2026-08-16T10:13:23.852281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.836847Z","title":"Rapidly-exploring random trees: A new tool for path planning","venue":null,"work_id":"08fd3357-5351-4485-91f2-e2067e9b12e1","year":1998},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.361389Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:9d471188e32683512e1320ce360de3d86be6d48a3e2d06c176dbb6f963005d78","observation_id":"40549601-b409-4d03-b1b2-94875d84938b","resolution":{"observed_at":"2026-08-16T10:13:23.840401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.825693Z","title":"Randomized kinodynamic planning","venue":null,"work_id":"bb611655-34a8-4d3b-ad5b-fd1a24ac5757","year":2001},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.364984Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:06868ffaf9aa779ea840132d50c078eab1c38ef73399af2e7f4c27aeb94343a7","observation_id":"bc8c9cc0-ff99-4cea-a266-c4ec922c5911","resolution":{"observed_at":"2026-08-16T10:13:23.829318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.814009Z","title":"Time-optimal control of a multidimensional in- tegrator chain with applications","venue":null,"work_id":"654d35ae-02fe-4ae6-8be9-123f71e70f2e","year":2022},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.369005Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:c63dae36daee44584f6cdcdced14ac6e3ad7b11fc14555f1564ff1492558b991","observation_id":"c7807a39-b3b0-436f-9997-897e90e1d8e1","resolution":{"observed_at":"2026-08-16T10:13:23.817642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.802554Z","title":"Asymptotically optimal sampling-based kinodynamic planning","venue":null,"work_id":"0a6425b2-dca4-4283-9d00-1d71a7719b0b","year":2016},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.372505Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:2c38440555fe3254445e267d7dacf60c9c72bbc9920628bea438a3b8ab4b421f","observation_id":"26121716-a5fe-455e-85cb-797b006f5419","resolution":{"observed_at":"2026-08-16T10:13:23.806813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.791487Z","title":"Minimum-time speed optimisation over a fixed path","venue":null,"work_id":"8d40f5ef-7269-4f75-b47b-49cfa3f13a5b","year":2014},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.375737Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:e74c81d650bd1f81db9a41099de579311f4f46a6bf1ba6a22da290557508343d","observation_id":"0511ad8c-e182-43ec-a585-b467efca34e4","resolution":{"observed_at":"2026-08-16T10:13:23.795230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.779960Z","title":"Planning dynamically feasible trajectories for quadrotors using safe flight corridors in 3-D complex environments","venue":null,"work_id":"95620ece-0599-4e0e-a7de-c645b4a1249e","year":2017},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.379570Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:c41a167db0dc2d38fc12ab4a3031a2089399f4bb9b8a008dfb381987002bd1bc","observation_id":"653fcdfb-960b-4e7f-9367-31bd473eafce","resolution":{"observed_at":"2026-08-16T10:13:23.783758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.769719Z","title":"Convex optimization for trajectory generation: A tutorial on generating dynamically feasible trajectories reliably and efficiently","venue":null,"work_id":"0a189858-fba1-4abc-8cf3-b7936f409c8d","year":2022},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.383503Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:d1402747fd412e34b27110694e930956e30f0208ab4fdd933f6bad932d2b4094","observation_id":"8caf59a8-3b5b-43c1-85f4-6af7d8bb9316","resolution":{"observed_at":"2026-08-16T10:13:23.773507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.387627Z","title":"Graphs of Convex Sets with Applications to Optimal Control and Motion Planning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.387627Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:8c58b98254cc3b3c41d5298bffea43caea7e0bd0a6046a14e92683df79f7e7e6","observation_id":"bbc274c0-3bfe-46a2-b995-1eba49d1ffb3","resolution":{"observed_at":"2026-08-16T10:13:23.387627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.391278Z","title":"Motion planning around obstacles with convex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.391278Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:904ae7c6e975150f21e2521d2196e0d25768fa145610a444f6e6db831ab22d43","observation_id":"4729e5b6-9f89-4ece-b61f-174435ddcbe5","resolution":{"observed_at":"2026-08-16T10:13:23.391278Z","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-16T10:13:23.745834Z","title":"Fast path planning through large collections of safe boxes","venue":null,"work_id":"c2c998cd-f0b8-4e85-874d-3044591692ba","year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.395102Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:d722b29e1b2f956ef2b80322eda98305f5fd40c3d1b60cae926b45549fa5b347","observation_id":"aba7e870-8688-4c41-ba2e-57823cc12785","resolution":{"observed_at":"2026-08-16T10:13:23.749671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.398967Z","title":"Shortest paths in graphs of convex sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.398967Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:0e310affd4bfb3bbec58fc0a5c3f6ec822af64029d8e49ccfda15a8d9f3906fa","observation_id":"7b9cc1a5-3397-46cb-9151-7651f18e4aea","resolution":{"observed_at":"2026-08-16T10:13:23.398967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19543","last_updated":"2024-09-29T04:01:29Z","snapshot_observed_at":"2026-08-16T13:14:27.197371Z","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-16T10:13:23.402434Z","title":"Multi-query shortest-path problem in graphs of convex sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.402434Z"},"links":{"cited_paper":"/paper/2409.19543","citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:078a6d980927cfc8dd8fe3690fb19d71e02096b5c04871df276dc5fe1de03a2e","observation_id":"ad4a6aa6-91bf-48e7-b907-a23380cb1f27","resolution":{"observed_at":"2026-08-16T10:13:23.402434Z","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-16T10:13:23.726079Z","title":"GPU-based parallel colli- sion detection for fast motion planning","venue":null,"work_id":"70cd1d34-9cd8-44dd-9c5e-47887b0e71e5","year":2012},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.406885Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:835cd6a435b2bd60d547691ff03fad685bc5daef6b01665bfc5d2e990d4b04e8","observation_id":"b1c4b207-2262-45cf-bba1-f75f2915fb6d","resolution":{"observed_at":"2026-08-16T10:13:23.730062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.410346Z","title":"Semidefinite programming relaxations for semialgebraic problems","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.410346Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:e668989c34f82b3605b8400b15c2cbda287cdc128bd1fc2e4391dc2ce9556b37","observation_id":"1e51835b-c7df-4224-a004-c930cfce1512","resolution":{"observed_at":"2026-08-16T10:13:23.410346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.413980Z","title":"Motion planning with sequential convex optimization and convex colli- sion checking","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.413980Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:a71df831732ae837f7842c8cef927334adc9217d3f7e9e2d9f16fdd10def1963","observation_id":"02a0e0e5-19b4-4301-8aa5-7037d62907c7","resolution":{"observed_at":"2026-08-16T10:13:23.413980Z","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-16T10:13:23.699628Z","title":"Disciplined multi-convex programming","venue":null,"work_id":"748986e7-eb2e-460e-9984-583e6d39c6f7","year":2017},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.417838Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:e995aecd46333e8c277327a5abcce1ab52029641a57ba291ac29bad3dd4908f1","observation_id":"a4a15e77-f7fe-4b33-bb9b-97d9b63a9fb2","resolution":{"observed_at":"2026-08-16T10:13:23.703450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.687993Z","title":"Curobo: Parallelized collision-free robot motion generation","venue":null,"work_id":"95c5114a-19e2-42af-946e-2354ae8ab1dc","year":2023},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.420904Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:f155b24d44cba26d4aa935f79678161cdf277f18bae33de20fc0e969a6cffb4c","observation_id":"b25c6a03-0df2-4674-bdfa-85d66de34ad9","resolution":{"observed_at":"2026-08-16T10:13:23.691839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.676367Z","title":"Drake: Model-based design and verification for robotics, 2019","venue":null,"work_id":"db640889-3201-4b04-a4c0-0d1aa5f1115f","year":2019},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.424372Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:85aab2afeeefa5f31a2659e8aac942056212763ab21e3e4260296418bf7249be","observation_id":"7ae4c39c-f48c-496f-ae81-6a3c209c11f7","resolution":{"observed_at":"2026-08-16T10:13:23.680188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.666065Z","title":"LQR-trees: Feedback motion planning via sums-of-squares verification","venue":null,"work_id":"675cbae3-51b0-4ccd-83bc-951033ee4ed6","year":2010},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.428231Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:18185494e53ee272595c739f55c25ff3358bc6adbde256475cde3467ec705551","observation_id":"9a90f3b3-792d-472b-b31f-0d13f1af4761","resolution":{"observed_at":"2026-08-16T10:13:23.669609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.655532Z","title":"Motions in microseconds via vectorized sampling-based planning","venue":null,"work_id":"57745d3f-77f8-4e82-8e2a-fcf259390292","year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.431818Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:78c7edde21f962c46200f735cc15bffa2f4de4d1a0ade0c7f100d159b8763913","observation_id":"7024b4d5-fc2d-4102-a125-fe89e27c61e5","resolution":{"observed_at":"2026-08-16T10:13:23.659209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1407.0414","last_updated":"2014-07-01T21:45:48Z","snapshot_observed_at":"2026-08-14T23:28:17.997518Z","submitted_at":"2014-07-01T21:45:48Z","title":"Newton methods for k-order Markov Constrained Motion Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1407.0414","snapshot_observed_at":"2026-08-16T10:13:23.435005Z","title":"Newton methods for k-order markov constrained motion problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.435005Z"},"links":{"cited_paper":"/paper/1407.0414","citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:e0c99dff9f547f323285fd04fec0ce342addbc6b097c2fe158583423a7f017a5","observation_id":"a0fd8fd4-d599-4645-a1e0-8ad525271607","resolution":{"observed_at":"2026-08-16T10:13:23.435005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.438581Z","title":"Time-optimal path tracking for robots: A convex optimization approach","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.438581Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:1449991e169c31aefc77b1f7f972b9884073b9da55aed972029a880f785aa62f","observation_id":"b4096b91-1a3d-45f1-bf80-cd6415e2be09","resolution":{"observed_at":"2026-08-16T10:13:23.438581Z","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-16T10:13:23.637238Z","title":"On the imple- mentation of an interior-point filter line-search algorithm for large-scale nonlinear programming","venue":null,"work_id":"fc44c248-8e21-4c9b-a036-ca2a1a9bbec1","year":2006},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.441841Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:926d95b74ee1b05fcaa5486522729c8fad309614fd351478201c53346a42132e","observation_id":"f114c9fc-4caf-4f73-a609-9ddbe17a77a9","resolution":{"observed_at":"2026-08-16T10:13:23.641399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02977","last_updated":"2025-03-18T04:19:43Z","snapshot_observed_at":"2026-08-16T14:12:38.999711Z","submitted_at":"2024-03-05T13:58:12Z","title":"Fast Iterative Region Inflation for Computing Large 2-D/3-D Convex Regions of Obstacle-Free Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02977","snapshot_observed_at":"2026-08-16T10:13:23.445387Z","title":"Fast iterative region inflation for computing large 2-D/3-D convex regions of obstacle- free space","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.445387Z"},"links":{"cited_paper":"/paper/2403.02977","citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:b4d462c835d31def43de70d03a2f019fc92d3b9ebb192916c6d829c3d129a8d7","observation_id":"b820f76d-99c6-48df-ac0a-766c6c3d4be2","resolution":{"observed_at":"2026-08-16T10:13:23.445387Z","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-16T10:13:23.623759Z","title":"Fast model predictive control using online optimization","venue":null,"work_id":"42209896-24c4-41e3-9128-2190aa22c313","year":2009},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.448995Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:a8d3d41cdf4c2103f37b5edaf85d1a797f3d9c0c5f376842d621e1d630af66cf","observation_id":"af15c0c9-c433-40ed-a9fb-d395ccdf1d8b","resolution":{"observed_at":"2026-08-16T10:13:23.627931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.611633Z","title":"Approximating robot configu- ration spaces with few convex sets using clique covers of visibility graphs","venue":null,"work_id":"15c9e00f-4bf8-4177-90ed-5d1f861f5a4d","year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.453477Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:b6671584937ab25c521e4378d44a2141e4b9d0315e48ec13f69a1268d03b9d4d","observation_id":"ed98c6d5-347a-4be6-b3e2-53cb86aa935e","resolution":{"observed_at":"2026-08-16T10:13:23.615712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-16T13:08:46.414387Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-08-16T10:13:23.456401Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.456401Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:f30e7da2772c5e27c3f160d4e7655ca15709eb559d588ffb3c3e6c252bfbd454","observation_id":"edb959fc-a373-418a-b7cd-b216672c5376","resolution":{"observed_at":"2026-08-16T10:13:23.456401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10783","last_updated":"2025-04-15T00:54:55Z","snapshot_observed_at":"2026-08-16T12:41:06.748331Z","submitted_at":"2025-04-15T00:54:55Z","title":"Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.10783","snapshot_observed_at":"2026-08-16T10:13:23.460132Z","title":"Superfast configuration-space convex set computation on GPUs for online motion planning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.460132Z"},"links":{"cited_paper":"/paper/2504.10783","citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:c4a824b5604facfa04d57d8f874ef6ff7034c46594f8da4e8bc2e3b43daa1dd0","observation_id":"ba18b83e-ee19-414a-a14f-292b950fe33c","resolution":{"observed_at":"2026-08-16T10:13:23.460132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09631","last_updated":"2025-03-27T15:12:29Z","snapshot_observed_at":"2026-08-16T13:43:09.248740Z","submitted_at":"2024-06-13T23:42:34Z","title":"Towards Optimizing a Convex Cover of Collision-Free Space for Trajectory Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09631","snapshot_observed_at":"2026-08-16T10:13:23.463926Z","title":"Optimal convex cover as collision-free space approximation for trajectory generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.463926Z"},"links":{"cited_paper":"/paper/2406.09631","citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:dbb6b3e3d877dfbb11cc9afa289509b0e2a704c3f9f186a23bd4530d9e2985ef","observation_id":"dc08076b-b026-43ad-9d2a-039ec1495baf","resolution":{"observed_at":"2026-08-16T10:13:23.463926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.13170","last_updated":"2025-04-17T17:59:23Z","snapshot_observed_at":"2026-08-16T12:10:57.958156Z","submitted_at":"2025-04-17T17:59:23Z","title":"A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling","version":1},"cited_work":{"arxiv_id":"2504.13170","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.13170","snapshot_observed_at":"2026-08-16T10:13:23.503995Z","title":"A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling","venue":"cs.RO","work_id":"76b88b74-5d21-4f27-9088-8ffdcf1ecffc","year":2025},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.467267Z"},"links":{"cited_paper":"/paper/2504.13170","citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:601ff68207a4c04145065d09a80c0e7be915352e94fce427b6273d218f3205de","observation_id":"98b5ab9b-3d20-40f4-b02c-af5e4827168f","resolution":{"observed_at":"2026-08-16T10:13:23.510975Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:13:23.600891Z","title":"tangent” and “projection","venue":null,"work_id":"1ac57793-d9b6-44bc-a578-46a6b4130b7d","year":2013},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.471172Z"},"links":{"citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:574e0dd6e384b469f4346ace0c8dc952f36866ce626fdfbac8544ab36ef1ff04","observation_id":"116a69c1-f251-46f8-b6e3-310cb792d28e","resolution":{"observed_at":"2026-08-16T10:13:23.604352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-16T23:16:21.391244Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":1,"verified_fuzzy":32},"total_outbound_references":49},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 4 inbound Pith citation observations for arXiv:2504.18978."}