{"as_of":"2026-08-16T08:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1ceae0c9484bf4f61d640bf0e74b431037dbcab920d99b3c326d4709d48c6977","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:10:14.689661Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.02834/citation-record","integrity":"/paper/2608.02834/integrity","json":"/paper/2608.02834/citation-record.json","paper":"/paper/2608.02834"},"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-15T15:10:15.482924Z","title":"Analysis and observations from the first Amazon picking challenge,","venue":null,"work_id":"7f9904dd-c6fd-443c-92f4-bfcff371c8e8","year":2018},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.474595Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:6515a8e58b6a3eb32c53522159de5a2de1d598e07471b30496d3fa4a346055f2","observation_id":"059ac3a7-71a1-41dd-bcb8-f2666e733e98","resolution":{"observed_at":"2026-08-15T15:10:15.487073Z","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-15T15:10:15.470340Z","title":"Team delft’s robot winner of the amazon picking challenge 2016,","venue":null,"work_id":"4388528a-2a96-4662-85e5-6c6addc364e9","year":2016},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.479303Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:ce3d4da5e5b2b345ae977df00dc609f8ddab873526ea0979bbcda9d87c9d26d9","observation_id":"efad9e44-a917-4492-9a95-384bd6cd2492","resolution":{"observed_at":"2026-08-15T15:10:15.475057Z","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-15T15:10:15.456904Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets,","venue":null,"work_id":"7e4ff679-df1e-4878-9c24-dad1735cbd7a","year":2025},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.483759Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:e58053892afe26f843d0001728186464cca600506acf0acbb4e451f15f9f76e1","observation_id":"418dbbfb-1611-4602-9a60-ca261fcc2286","resolution":{"observed_at":"2026-08-15T15:10:15.460821Z","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-15T15:10:14.488528Z","title":"Diffusion policy: Visuomotor policy learning via action diffusion,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.488528Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:8460add53d5029e73f7ce73e6d27a15f80e67a2b39dbcd89396d665fd17009ac","observation_id":"52bf23a9-c7e0-41b0-85f2-cb0fa90f382e","resolution":{"observed_at":"2026-08-15T15:10:14.488528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2511.14759","last_updated":"2025-11-19T04:34:49Z","snapshot_observed_at":"2026-07-06T22:36:13.287872Z","submitted_at":"2025-11-18T18:58:55Z","title":"$\\pi^{*}_{0.6}$: a VLA That Learns From Experience","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.14759","snapshot_observed_at":"2026-08-15T15:10:14.492514Z","title":"π ∗ 0.6: a VLA that learns from experience,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.492514Z"},"links":{"cited_paper":"/paper/2511.14759","citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:60ce51707f1251ddbf1f90eb9d28114e1ce54825c0578f89fb46ccba16fccbc8","observation_id":"8dbd29db-d8e5-4e5f-95f0-ca9a627edda4","resolution":{"observed_at":"2026-08-15T15:10:14.492514Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.05331","last_updated":"2025-07-07T17:56:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-07T17:56:01Z","title":"A Careful Examination of Large Behavior Models for Multitask Dexterous Manipulation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.05331","snapshot_observed_at":"2026-08-15T15:10:14.496651Z","title":"A careful exami- nation of large behavior models for multitask dexterous manipulation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.496651Z"},"links":{"cited_paper":"/paper/2507.05331","citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:7b64269cca55d26415dd7590a3091a7c7e00bbdd6ebdf489bfbe4773d3f03aa3","observation_id":"0bb137a9-c2b3-4205-b00d-7c5ef9934f65","resolution":{"observed_at":"2026-08-15T15:10:14.496651Z","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-15T15:10:15.438621Z","title":"RRT-connect: An efficient approach to single-query path planning,","venue":null,"work_id":"5ea91206-9351-40a9-be95-a6d7cba0c4a6","year":2000},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.500996Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:89de08997386e07df66e32e8f9d88561e4ccf7e97d3338bdb0ca112e8808776c","observation_id":"9447d22a-edcf-4e92-b8d3-d5cc7b83db91","resolution":{"observed_at":"2026-08-15T15:10:15.442903Z","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-15T15:10:14.504820Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.504820Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:6092bf66e2bf0a864ffa0e693f8a06a5fc034799f7cf22a1a0fc0cc43ce940f6","observation_id":"165e3a09-b02b-4aeb-af1a-5da8f3486fde","resolution":{"observed_at":"2026-08-15T15:10:14.504820Z","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-15T15:10:14.509127Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.509127Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:228214fdfeff51bee8bf0e6a20de27842a608a8532e14dae7906b3d02495f967","observation_id":"863db479-6d5f-43d2-b270-0d9e3021b2c6","resolution":{"observed_at":"2026-08-15T15:10:14.509127Z","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-15T15:10:15.413952Z","title":"GPU-based parallel collision detection for fast motion planning,","venue":null,"work_id":"2d65c50e-5ace-49fe-8ec3-d63f07412054","year":2012},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.512465Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:842a2b78b22e644e051527787ac127ea59ae79c764c84ed509075390d9f535c4","observation_id":"9b763ed6-a7a0-4c9f-83fe-e16f1e954af4","resolution":{"observed_at":"2026-08-15T15:10:15.417772Z","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-15T15:10:15.402544Z","title":"Motions in microsec- onds via vectorized sampling-based planning,","venue":null,"work_id":"50d18d55-aa88-44d4-aea5-edbde948dad5","year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.516147Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:cd0cc414f3c8fa15a0f6b60b45cdd84db65478f18d352364674855553cecc697","observation_id":"0a994d1a-7ad7-4e7b-a7da-ac2c26820913","resolution":{"observed_at":"2026-08-15T15:10:15.406450Z","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-15T15:10:14.519714Z","title":"PRRTC: GPU- parallel RRT-connect for fast, consistent, and low-cost motion planning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.519714Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:045fca0eaa6156b07909d9a1a86dc1a9b23b47c8da3e6f4a5c54b043bb83d45d","observation_id":"73aec165-9eb9-4c77-8b1b-0745045dc190","resolution":{"observed_at":"2026-08-15T15:10:14.519714Z","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-15T15:10:15.390667Z","title":"Kinodynamic rrt*: Asymptotically optimal motion planning for robots with linear dynamics,","venue":null,"work_id":"2b7ae81b-8101-422f-9029-46c28bd85be4","year":2013},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.523085Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:2ee99f1f443335c1e42d235ae41b50e37f420cf49bc8b998000aee79bb85ff15","observation_id":"3bfbf77d-87f5-4a48-8ff5-652f8485e7ee","resolution":{"observed_at":"2026-08-15T15:10:15.394798Z","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-15T15:10:15.379153Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":"3ac9127d-af83-4a84-bcb2-c2ab03a2f69a","year":2011},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.526520Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:298147a4ad6c47250ca4b15dec3dd36430b7a961e5f8d7c5a5727f792e05bd88","observation_id":"9fef5122-0de2-496b-9427-60fad8b095f9","resolution":{"observed_at":"2026-08-15T15:10:15.383230Z","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-15T15:10:15.367208Z","title":"Aorrtc: Almost-surely asymptotically optimal planning with rrt-connect,","venue":null,"work_id":"1883bd04-06de-417d-b6c2-cb6038401cf0","year":2025},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.529885Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:e0083319b657e455917a561b9047abd2d2412c69dcce11795a68b4093e82e0cb","observation_id":"ea736a1c-695c-43ed-8880-16bec69d73f5","resolution":{"observed_at":"2026-08-15T15:10:15.371117Z","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-15T15:10:14.533285Z","title":"Creating high-quality paths for motion planning,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.533285Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:a08861fac285f8a44d16435707d022660c422cd6f97f3c73ddb376c3372bb647","observation_id":"10c95004-4559-4369-b7cd-c2cb9154a77b","resolution":{"observed_at":"2026-08-15T15:10:14.533285Z","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-15T15:10:15.348318Z","title":"Fast smoothing of manipulator trajectories using optimal bounded-acceleration shortcuts,","venue":null,"work_id":"328a6e4a-4ac5-48b1-b7ea-117a83a78904","year":2010},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.536713Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:6d5e3b385ca6258e35c81a097d09cf1cc6ceb6705cb8ed3cdc8e6878c00edca9","observation_id":"1f74efa0-ed4a-4691-990d-7ce62a9e0f32","resolution":{"observed_at":"2026-08-15T15:10:15.352138Z","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-15T15:10:15.335694Z","title":"Collision-free and smooth trajectory computation in cluttered environments,","venue":null,"work_id":"461dff9b-d70a-4b78-825d-383a98afe2ea","year":2012},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.540326Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:574a2abf33b2b7e2601c65e208720ded97bf6061fe35297cf3ae06b67152ff80","observation_id":"f9170517-dd8c-4cfb-9449-ca41e7d7195c","resolution":{"observed_at":"2026-08-15T15:10:15.339660Z","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-15T15:10:14.544289Z","title":"A new approach to time-optimal path parameterization based on reachability analysis,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.544289Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:55a6b4d57a9c7ebcd2ee8df5bc7eddf17591d6c6aa3590284537fe3eee549576","observation_id":"1c79d911-2fb3-460a-bc39-e05ddce460bf","resolution":{"observed_at":"2026-08-15T15:10:14.544289Z","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-15T15:10:14.547756Z","title":"Motion planning with sequential convex optimization and convex collision checking,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.547756Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:3cabe319ecaee4cdb9042c972ca9381f27deb9163bf594fca92ed24360357dba","observation_id":"087a1405-c815-403d-be6e-320f986b96d2","resolution":{"observed_at":"2026-08-15T15:10:14.547756Z","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-15T15:10:15.307228Z","title":"CHOMP: Gradient optimization techniques for efficient motion planning,","venue":null,"work_id":"ed6edb98-c54c-4f50-b2ad-3656e4151773","year":2009},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.551153Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:4c7e301c24c0c6ca79b5ff5fb70c05689b3459019befbf12866ad013993e607b","observation_id":"5c7fa493-5e4b-469e-a0a7-8ef5bea6d933","resolution":{"observed_at":"2026-08-15T15:10:15.311807Z","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-15T15:10:14.554653Z","title":"Optimization-based collision avoidance,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.554653Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:16697090c811190a80a73efb7de36691915e20d6318152c334b5ddc5b97764a2","observation_id":"bed0459b-1743-4901-b466-63a54ecbcefb","resolution":{"observed_at":"2026-08-15T15:10:14.554653Z","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-15T15:10:15.287024Z","title":"Mader: Trajectory planner in multiagent and dynamic environments,","venue":null,"work_id":"42a80c55-5764-43af-bbd0-a1887a80fa0d","year":2021},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.558122Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:011e41d6248be65ab2bd1de2d8af6aa0ab5a44fb1107836280fe0e01085b11de","observation_id":"fede22cf-262f-45ac-a8ac-f6a3a12ff46e","resolution":{"observed_at":"2026-08-15T15:10:15.291086Z","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-15T15:10:15.275384Z","title":"CuRobo: Parallelized collision-free robot motion generation,","venue":null,"work_id":"e73d70e2-b08a-4cc0-8c03-9accabbe17ad","year":2023},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.561759Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:c0317b89d0f6b5f2fcc703359c092bca9d97b1a78bd95ff9ae9266a057324fff","observation_id":"4bef4fc4-203c-4688-a573-7c954102ce1a","resolution":{"observed_at":"2026-08-15T15:10:15.279289Z","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-15T15:10:15.263925Z","title":"Efficient mixed-integer planning for UA Vs in cluttered environments,","venue":null,"work_id":"47fa02df-756c-42ca-94ed-abe20f8fc337","year":2015},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.565120Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:e2f59a75b6f2763977b8145698d7b41299f025505a14e0835ee34ac50ccb59c0","observation_id":"0b17a56d-b5ad-4b3f-9f15-5523a043a007","resolution":{"observed_at":"2026-08-15T15:10:15.267968Z","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-15T15:10:14.568872Z","title":"Shortest paths in graphs of convex sets,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.568872Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:d540cc68ac59fcf9c5581305084c418550d6fb570ea2832a0ef7622f0ad49e65","observation_id":"9623cd5e-2071-44f6-8015-bfe14f57f355","resolution":{"observed_at":"2026-08-15T15:10:14.568872Z","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-15T15:10:15.243281Z","title":"Motion planning around obstacles with convex optimization,","venue":null,"work_id":"c262360b-e59c-4178-9865-6b6c894c5bab","year":2023},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.572145Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:6e8e587b99e091db746bca87f833674fecaaf4c3f8eafde63d7815b918692cf8","observation_id":"282ac237-7bcc-41ae-8974-144cf1dacd5b","resolution":{"observed_at":"2026-08-15T15:10:15.247812Z","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-15T15:10:14.575925Z","title":"Fast path planning through large collections of safe boxes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.575925Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:81aa3bd950e6d5e8ee4ab8ad26bbfc86ebe0e24cc2fddf3cd2b588d92d8100b1","observation_id":"75ac9b2c-6ed2-4c91-a3aa-c11978aa78f5","resolution":{"observed_at":"2026-08-15T15:10:14.575925Z","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-12T21:04:01.910946Z","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-15T15:10:14.579506Z","title":"Superfast configuration-space convex set computation on gpus for online motion planning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.579506Z"},"links":{"cited_paper":"/paper/2504.10783","citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:3f1c367a1775fae600e8319368f3fa7c229cc0e8035d87785dac22a1c67fe2dd","observation_id":"f224e4eb-6cb2-43ce-9bb9-b2719a659a5c","resolution":{"observed_at":"2026-08-15T15:10:14.579506Z","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-15T15:10:14.583365Z","title":"Online generation of collision-free trajectories for quadrotor flight in unknown cluttered environments,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.583365Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:d2bab8378b8d005854b553a5ea7a50a1e69c1d4efb54439c3391d86d951cb108","observation_id":"e4eaa944-d72e-4396-bd7f-41ba1de9022a","resolution":{"observed_at":"2026-08-15T15:10:14.583365Z","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-15T15:10:14.586759Z","title":"Planning dynamically feasible trajectories for quadrotors using safe flight corridors in 3-d complex environments,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.586759Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:c40dd75b9678206c8a295ba38982923c5812a12fbed98cc6666b3636e1c833e2","observation_id":"658afd8c-b4e5-4e4d-9f17-31f835f33892","resolution":{"observed_at":"2026-08-15T15:10:14.586759Z","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-13T21:23:17.594653Z","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":"2406.09631","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.09631","snapshot_observed_at":"2026-08-15T15:10:14.757472Z","title":"Towards Optimizing a Convex Cover of Collision-Free Space for Trajectory Generation","venue":"cs.RO","work_id":"1edd87df-5637-4c95-b25e-81c8781eb753","year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.590537Z"},"links":{"cited_paper":"/paper/2406.09631","citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:02f1684da7b9c24d2ad82a6fd6cafa5fe4173cfe238f571300fd6c911d135b0b","observation_id":"a58037f0-f871-4020-9d2b-a07dda19caad","resolution":{"observed_at":"2026-08-15T15:10:14.763513Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08909","last_updated":"2024-10-11T15:29:49Z","snapshot_observed_at":"2026-08-13T22:52:11.445134Z","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-15T15:10:14.594890Z","title":"Implicit graph search for planning on graphs of convex sets,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.594890Z"},"links":{"cited_paper":"/paper/2410.08909","citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:8d6619e9f0b7785d568761f0434b0ce45563655741b8051a9514e3c08fb3c8b9","observation_id":"cc3167bf-735b-458f-b3c1-3f6f6978c8fd","resolution":{"observed_at":"2026-08-15T15:10:14.594890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08848","last_updated":"2024-12-09T19:06:53Z","snapshot_observed_at":"2026-08-12T23:23:53.842709Z","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-15T15:10:14.598915Z","title":"GCS*: Forward heuristic search on implicit graphs of convex sets,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.598915Z"},"links":{"cited_paper":"/paper/2407.08848","citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:6a6e386ffdd185db3cc3237ed6a2b1f96083a28ab4fb0cf0b110e0f7668bf3c2","observation_id":"c519a300-7869-4585-bce1-b5187767197d","resolution":{"observed_at":"2026-08-15T15:10:14.598915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-15T02:20:11.590608Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.10878","snapshot_observed_at":"2026-08-15T15:10:14.602785Z","title":"Mixed discrete and continuous planning using shortest walks in graphs of convex sets,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.602785Z"},"links":{"cited_paper":"/paper/2507.10878","citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:ef44f9c66c6f5b49ed991169d5bfc741e071fd3a43aa9685ee2c103f89d52fc3","observation_id":"96d0a455-3288-42f4-a3f7-38748f726cb4","resolution":{"observed_at":"2026-08-15T15:10:14.602785Z","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-15T15:10:15.088845Z","title":"A new semidefinite relaxation for linear and piecewise-affine optimal control with time scaling,","venue":null,"work_id":"0f426d70-d047-4ab7-9942-84d7199046d4","year":2025},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.607056Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:7b29fd1a7f8f27f379d19b99a9ce03481191b1e86cb23c4646e059fc39bde20e","observation_id":"d32c793a-c474-4b96-ba6b-5c8adfe59877","resolution":{"observed_at":"2026-08-15T15:10:15.092570Z","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-15T15:10:15.077671Z","title":"Graphs of convex sets with applications to optimal control and motion planning,","venue":null,"work_id":"7577dda8-9f7c-46d4-ae8a-0c1c12f425f8","year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.610740Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:5306f3edcbe31c7cac1174e68f83615ed25ce8d314df97d1ea5d136fd8629e77","observation_id":"1dc13424-2656-45cf-b791-33fda6b25f95","resolution":{"observed_at":"2026-08-15T15:10:15.081393Z","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-15T15:10:15.066680Z","title":"Computing large convex regions of obstacle- free space through semidefinite programming,","venue":null,"work_id":"2b2d8270-d00e-4b5a-b661-6c2c232cb88e","year":2015},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.614813Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:bee7a54be38a02a55619267d8e9d1a848d88e9bdf6c396dd317dcee21d9c0650","observation_id":"accec3d5-325d-4c68-bdce-d24e9df43424","resolution":{"observed_at":"2026-08-15T15:10:15.070590Z","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-15T15:10:15.053771Z","title":"Approx- imating robot configuration spaces with few convex sets using clique covers of visibility graphs,","venue":null,"work_id":"7c514755-2fed-4dfa-baba-7c3e8f1f8a07","year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.618518Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:c33445a946db56e0760fb723fc0e5d3c81e5956d2d7e10c583d4c7ebf7bd355c","observation_id":"3846cd3f-0560-4c54-a4cd-e94182354148","resolution":{"observed_at":"2026-08-15T15:10:15.057737Z","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-15T15:10:15.042559Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space,","venue":null,"work_id":"caa5dc82-6376-4fca-809f-54856e1c4f21","year":2026},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.622213Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:1f9f439ebe4aead2f008663312b928f60140b9c3bbeaae6cf39f3a16db3abd55","observation_id":"f3739775-12be-41cd-a219-de1808b057c6","resolution":{"observed_at":"2026-08-15T15:10:15.046354Z","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-15T15:10:14.626001Z","title":"Certified polyhedral decompositions of collision-free configuration space,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.626001Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:09bc78494f4d82dc3fdd68e3539f97cfbde8119dd34b583deb0713508a52314b","observation_id":"54e24f2b-18f7-436d-aaa9-2ccca619c99c","resolution":{"observed_at":"2026-08-15T15:10:14.626001Z","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-15T15:10:15.025075Z","title":"Time-optimal control of a multidimensional integrator chain with applications,","venue":null,"work_id":"43066054-fa08-4e30-b28a-cc1d250de9d3","year":2022},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.629320Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:c14c45358c7af54fae5a1db8521144602e0b1354ee5b9f2471188bcd3e4d56d4","observation_id":"dddf239f-0c2a-4998-94e6-810192406a87","resolution":{"observed_at":"2026-08-15T15:10:15.028914Z","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-15T15:10:14.633187Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.633187Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:a7ae99d821e019ea14b63213302446d1af44103b3a19e194f2d29844ea0c261a","observation_id":"0a882fae-498e-49d6-8b0b-d44a6bfcbc48","resolution":{"observed_at":"2026-08-15T15:10:14.633187Z","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-15T15:10:15.005864Z","title":"Biconvex sets and optimiza- tion with biconvex functions: a survey and extensions,","venue":null,"work_id":"2bc82703-42fb-42d8-bf92-a4c9907afbac","year":2007},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.636755Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:6d637151ee7d348274a0e8305e695c6e05198be8df6207a05ccfeacb4ed2f0d0","observation_id":"a533d42a-3da7-4886-a0e6-5fc68468bfdb","resolution":{"observed_at":"2026-08-15T15:10:15.009842Z","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-15T15:10:14.993294Z","title":"Disciplined multi-convex programming,","venue":null,"work_id":"fb31775a-d332-4f93-9b2c-81d94b124810","year":2017},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.640166Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:70b4e6287d41e348e45e582d525cf189719b27ef4c7094e4cfcd12e51478dedf","observation_id":"95bdfeab-82aa-4b3c-a529-ee1a7c8b974a","resolution":{"observed_at":"2026-08-15T15:10:14.997757Z","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-15T15:10:14.981754Z","title":"Variations and extension of the convex–concave procedure,","venue":null,"work_id":"695cdf6f-7497-4be5-a5ed-ecf5d9b31495","year":2016},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.643761Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:aa7eae79c96d74e2c48ff3319fd8609b9f769e5b8f4627842f815abc31d36e2a","observation_id":"ca50c8bc-c118-40d3-b24d-cdb99babfc37","resolution":{"observed_at":"2026-08-15T15:10:14.985820Z","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-15T15:10:14.970529Z","title":null,"venue":null,"work_id":"bfe4a134-35da-44a9-b7e8-686ee23842f1","year":2008},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.647399Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:20f62e4a3aab51875cb55cb80a8bfb50fae87af25f5c8228f4acc7dd75a87ddf","observation_id":"a882d297-78ce-4481-b886-29aa54b4209b","resolution":{"observed_at":"2026-08-15T15:10:14.974018Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:10:14.959000Z","title":"Algorithms for polynomials in Bernstein form,","venue":null,"work_id":"ac6c2dc8-f6b7-4d89-b4aa-ef092fe739a7","year":1988},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.650729Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:d7d7735d4f4c3cb2084ec7bfaa8062a13cb130b2d8a684ee9f47be3710df92a1","observation_id":"722fc4e2-6aee-464d-aa14-9976aa5d3edc","resolution":{"observed_at":"2026-08-15T15:10:14.963188Z","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-15T15:10:14.654439Z","title":"Semidefinite programming relaxations for semialgebraic problems,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.654439Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:67a586ab9b57f8f823c4226a8791edf6194707fce992fc69271f1edb9801632e","observation_id":"c260fc3a-ab74-4e50-bedb-27dd306ff76f","resolution":{"observed_at":"2026-08-15T15:10:14.654439Z","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-15T15:10:14.940868Z","title":"Discrete transforms, semidefinite pro- gramming, and sum-of-squares representations of nonnegative polyno- mials,","venue":null,"work_id":"748218be-f574-465d-91a1-0a8b6c15f136","year":2006},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.657910Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:a4e7de4099b748d865b85a64b09ade8a79ce62e77ae3d7de404a045d47f21e30","observation_id":"53ca082b-5808-4c4c-a83b-6de0f8b711ea","resolution":{"observed_at":"2026-08-15T15:10:14.944975Z","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-15T15:10:14.929561Z","title":"Certifying bimanual RRT motion plans in a second,","venue":null,"work_id":"c8ee25b5-a1fc-468a-b5ed-c61043945836","year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.662572Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:0c26b51ccaf5dd756f95153e0067803ffe6e889fd633d5308de86f07de6de5ed","observation_id":"ed1c7679-abbd-4646-a504-eee0dbd89f0d","resolution":{"observed_at":"2026-08-15T15:10:14.933437Z","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-15T15:10:14.666657Z","title":"Minimum snap trajectory generation and control for quadrotors,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.666657Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:f0971b20080b066b3527fa533a3a7e012ad78b004d70f2b378e2449218ff0bab","observation_id":"0696fce9-5dd8-492f-9ac7-29f6bdb1ebcf","resolution":{"observed_at":"2026-08-15T15:10:14.666657Z","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-15T15:10:14.911091Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives,","venue":null,"work_id":"c3d11d2a-9ffc-4602-99aa-3efee9639677","year":2026},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.670359Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:26be0ee1de08968f2fab383232045c693735f323624b1a221d2b052f0186d088","observation_id":"b82cdb4f-03c1-464e-a047-2a4429560c43","resolution":{"observed_at":"2026-08-15T15:10:14.914987Z","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-15T15:10:14.899256Z","title":"SNOPT: An SQP algorithm for large-scale constrained optimization,","venue":null,"work_id":"489444b3-e389-445f-a02e-0df2b6a58b8e","year":2005},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.674700Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:b36491518e434dd99f4676e611cbf9c300ed6f27f25eb4c8d0bb342937b8bd5c","observation_id":"328aa34a-4025-4546-9edd-2ff8820d00c2","resolution":{"observed_at":"2026-08-15T15:10:14.903868Z","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-15T15:10:14.888225Z","title":"Drake franka driver: Driver software for the franka robots,","venue":null,"work_id":"5e7d4391-623d-4d5b-a7ae-a4b8aa05c24c","year":2026},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.678621Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:afce12eebb323705a66d1e54b86b21ab8235959cd00c9c025443173bb5a01b7f","observation_id":"0874da72-7947-4269-a21c-84b5bc9bf04f","resolution":{"observed_at":"2026-08-15T15:10:14.892116Z","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-15T15:10:14.682128Z","title":"Drake: Model-based design and verification for robotics,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.682128Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:aa411fff67a6f5313eace638a6691cae1e845ab56f8ac50320ea819a8aa65838","observation_id":"6d9c9027-f813-49ed-aff5-c2729dffb1e3","resolution":{"observed_at":"2026-08-15T15:10:14.682128Z","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-15T15:10:14.870197Z","title":"Drake blender tools: Importing drake simulations into blender,","venue":null,"work_id":"30ddffdd-42e1-4b4b-93c9-e17f7b23d707","year":2025},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.686071Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:270f2c71af88a5dcc8014dec22cc04ede32df4a1fef8ad14f0a4e644ece90a3f","observation_id":"3a8482ad-3ea1-46a2-8c09-c1d7c7430551","resolution":{"observed_at":"2026-08-15T15:10:14.874093Z","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-15T15:10:14.859020Z","title":"Analytical inverse kinematics for Franka Emika Panda – a geometrical solver for 7-DOF manipulators with unconventional design,","venue":null,"work_id":"b2ea61e8-d005-4668-a1ee-14dc6fa63b3f","year":2021},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.689661Z"},"links":{"citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:1b3665931c95fe25c2ebec83b1572e9e4db7639bc040b213c7d58275e2154ebe","observation_id":"60fcbefb-ed1f-4aac-b031-ab26acaaf6f4","resolution":{"observed_at":"2026-08-15T15:10:14.863216Z","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":"2608.02834","last_updated":"2026-08-03T19:48:24Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-15T14:56:03.014210Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":1,"verified_fuzzy":33},"total_outbound_references":58},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2608.02834."}