{"as_of":"2026-08-10T11:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24307fc7dc5bd381140a7fb55993cee6027bf3692feccd60f200fdd95716fc15","coverage":[{"denominator":76,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":76,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T16:26:05.618377Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T06:59:57.337747Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.13836","snapshot_observed_at":"2026-07-12T06:59:57.337747Z","title":"Tapia and I","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02797","last_updated":"2026-07-02T22:17:11Z","snapshot_observed_at":"2026-08-10T02:10:05.333421Z","submitted_at":"2026-07-02T22:17:11Z","title":"RCOA Extension and Applications","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T06:59:57.337747Z"},"links":{"cited_paper":"/paper/2512.13836","citing_paper":"/paper/2607.02797"},"observation_digest":"sha256:8eb2503d8e19e1ccd66948bf01a34a3dce2a6f650a9929ff60b16abd5d2d7aba","observation_id":"049d7468-3ef6-4621-9b0a-06a6dcdbe830","resolution":{"observed_at":"2026-07-12T06:59:57.337747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2512.13836/citation-record","integrity":"/paper/2512.13836/integrity","json":"/paper/2512.13836/citation-record.json","paper":"/paper/2512.13836"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:25:58.985188Z","title":"Real-Time Obstacle Avoidance for Manipulators and Mobile Robots,","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T16:25:58.985188Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:faa9ba976bee2d7bad2d14be46f7e07b794a86bd21b4ee29c85105ce752f8f6b","observation_id":"54858d62-8c35-42d5-a8f5-30668035d76d","resolution":{"observed_at":"2026-08-03T16:25:58.985188Z","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-03T16:25:59.064710Z","title":"Real-time obstacle avoidance for fast mobile robots in cluttered environments,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T16:25:59.064710Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:2b472cefe5507f54224f8b65bc5f7a6b1053c0dd7f5370e1f210380937eae5f5","observation_id":"32f13889-091c-4b44-8f50-5b08a0e1079a","resolution":{"observed_at":"2026-08-03T16:25:59.064710Z","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":"10.1201/9781439864135-43","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rapidly-Exploring Random Trees: Progress and Prospects,","venue":null,"work_id":"22aa5ff4-edf9-47a5-b48f-457fd4f6a27d","year":2020},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T16:25:59.154532Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:da26523d37506118fbb0f1ff67b2711876ca38763e70a7b9b8e2bd99e0b587f9","observation_id":"548fc125-0c83-4c7f-9e96-75c5441c0573","resolution":{"observed_at":"2026-08-03T16:28:29.010891Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T16:25:59.309621Z","title":"Differentially constrained mobile robot motion planning in state lattices,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T16:25:59.309621Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:0dd6dc76718c639a0f3eef46ee63a0a22bb157cffab3d89519af72e3f3f2e4f9","observation_id":"c1290e66-31a8-4a6f-bd4a-c7996877870b","resolution":{"observed_at":"2026-08-03T16:25:59.309621Z","resolver_source":null,"status":"malformed_identifier"},"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-03T16:25:59.437605Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T16:25:59.437605Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:2266d4150396a1579c5b728024bf6f367b7f5a21ba2040118b6c99ff91e4e7e5","observation_id":"a160c6c7-e07f-4269-a40b-48d81b9e433f","resolution":{"observed_at":"2026-08-03T16:25:59.437605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.04422","last_updated":"2022-05-09T17:03:06Z","snapshot_observed_at":"2026-07-06T13:08:11.000809Z","submitted_at":"2022-05-09T17:03:06Z","title":"Motion Planning around Obstacles with Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.04422","snapshot_observed_at":"2026-08-03T16:25:59.578682Z","title":"Marcucci, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T16:25:59.578682Z"},"links":{"cited_paper":"/paper/2205.04422","citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:7e828d5910c3a32de483a791ed7e337b30b738b6045e169178b443795cd11f3e","observation_id":"76a928bc-0a95-4e8d-842b-db0d69c12896","resolution":{"observed_at":"2026-08-03T16:25:59.578682Z","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-03T16:25:59.694841Z","title":"Safety-Critical Model Predictive Control with Discrete-Time Control Barrier Function,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T16:25:59.694841Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:7c7bba4dd6077871b3cfd82e5b573e62b81e6859447e310658ff170ae32e886a","observation_id":"287191a1-ecec-4eac-92d6-83ef418e19c7","resolution":{"observed_at":"2026-08-03T16:25:59.694841Z","resolver_source":null,"status":"malformed_identifier"},"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-03T16:25:59.810583Z","title":"Shortest Paths in Graphs of Convex Sets,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T16:25:59.810583Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:38d5e0e81202b8a3069b5675ebeb6fe3024261a06484d7aed693ecac71414932","observation_id":"8e3c019e-1bc4-4544-8da5-a5bb7c814279","resolution":{"observed_at":"2026-08-03T16:25:59.810583Z","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":"10.1007/978-3-540-36119-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:28:28.693829Z","title":"Fast direct multiple shooting algorithms for optimal robot control,","venue":null,"work_id":"1f1ce2fa-9350-4f44-8443-6214b55ab6e9","year":2006},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T16:25:59.925038Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:1ba13b573d594b18b1d8b1f7a275bc58f2d3fc1c69fed1d582a67b6120d5170b","observation_id":"7fb1754d-a8c5-4064-bf24-d8910c0cb530","resolution":{"observed_at":"2026-08-03T16:28:28.783402Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T16:26:00.038608Z","title":"A simple and efficient algorithm for nonlinear model predictive control,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:00.038608Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:36f533626d960119542dc0c87e52f84ce1de53558218d47c500d16d2c84cc127","observation_id":"b99f3cee-4849-491b-ae58-4506af0f54e7","resolution":{"observed_at":"2026-08-03T16:26:00.038608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16746","last_updated":"2023-07-28T14:59:50Z","snapshot_observed_at":"2026-07-06T15:09:36.509406Z","submitted_at":"2023-03-29T14:51:53Z","title":"FATROP : A Fast Constrained Optimal Control Problem Solver for Robot Trajectory Optimization and Control","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.16746","snapshot_observed_at":"2026-08-03T16:26:00.173788Z","title":"Vanroye, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:00.173788Z"},"links":{"cited_paper":"/paper/2303.16746","citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:895bcfdfb20d0995fb981d55926993074fbdf4944ad343821ddadd57b82de7d0","observation_id":"cafef30b-6813-4ec9-b99b-24fa7f33aac3","resolution":{"observed_at":"2026-08-03T16:26:00.173788Z","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-03T16:26:00.287047Z","title":"Ma57 - a code for the solution of sparse symmetric definite and indefinite systems,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:00.287047Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:ba5d6ae941701abc4730ce6174b82920e2b757c9a71b592db98ff7bc9080879f","observation_id":"e6f221d8-f3a8-447d-84b0-12abfdf8fa22","resolution":{"observed_at":"2026-08-03T16:26:00.287047Z","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-03T16:26:00.444021Z","title":"Gurobi optimizer,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:00.444021Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:d56e67d6fa6f171ec407fcec070665ce49c54b1a34ea88b91985a3b12bd99709","observation_id":"6fd400f7-feb9-40f5-9338-a9b77c776231","resolution":{"observed_at":"2026-08-03T16:26:00.444021Z","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-03T16:26:00.552599Z","title":"Successive convexification of non-convex optimal control problems and its convergence proper- ties,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:00.552599Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:ffb54b3eddded25274de27d21375a5ed8e65c36918a8767260322b551d0a33e0","observation_id":"2f2d76cf-7d83-4aaa-abaa-9781623a338c","resolution":{"observed_at":"2026-08-03T16:26:00.552599Z","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-03T16:26:00.649109Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:00.649109Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:5385638a2e3da385dfe7cbf92c50ef1b0039993c523d5c59165b9a4da5131154","observation_id":"d89e1514-37a2-4420-9e74-de2423bf9a87","resolution":{"observed_at":"2026-08-03T16:26:00.649109Z","resolver_source":null,"status":"malformed_identifier"},"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-03T16:26:00.728386Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:00.728386Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:f42be009c817347f650334058332d6aec183c5a8f230999f6dad8b9dc1c76348","observation_id":"2d097317-6cf6-428b-a792-1fb66924880a","resolution":{"observed_at":"2026-08-03T16:26:00.728386Z","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-03T16:26:00.801965Z","title":"Interior point methods 25 years later,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:00.801965Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:6c0785d062cefbe30cb9579c6713ee9962923979c28c61bff5e6ae657f3b3608","observation_id":"225692d8-6fbf-4aed-b661-674a4f2d519b","resolution":{"observed_at":"2026-08-03T16:26:00.801965Z","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-03T16:26:00.865783Z","title":"Superlinear convergence of an interior-point method for monotone variational inequalities,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:00.865783Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:01ed840eceb0a03dc40b16139a47e20810cbab8c35c7f5f093ca42e30c29d8d6","observation_id":"2d5224d5-d7d7-4bec-b7e5-db0fd92f75ee","resolution":{"observed_at":"2026-08-03T16:26:00.865783Z","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":"10.1201/b19115-11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Numerical optimization,","venue":null,"work_id":"0b16452f-7743-4159-965f-1cad9fa72b69","year":2006},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:00.931130Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:9cbe5a21205c4757b77be7b22f9ba78da0d02271ff5ee97a96f2ccce4b6b6bab","observation_id":"6cd1894a-c99b-4b11-8226-74cc7303a460","resolution":{"observed_at":"2026-08-03T16:28:28.599478Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T16:26:01.010681Z","title":"Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.010681Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:d82cad896da8614795c903366c5667ad069be83cfaaf9505686892efa4dba889","observation_id":"defeb5e6-73c5-42d5-9549-1c85672ba6dd","resolution":{"observed_at":"2026-08-03T16:26:01.010681Z","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-03T16:26:01.072918Z","title":"A globally convergent primal-dual interior-point filter method for nonlinear programming,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.072918Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:90c61fb94975e890fb2081f3d0ca6cbe7ed8c80482137289514b8a0d82959bc7","observation_id":"488db10e-a217-4bc2-8271-3a207771ca39","resolution":{"observed_at":"2026-08-03T16:26:01.072918Z","resolver_source":null,"status":"malformed_identifier"},"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-03T16:26:01.163956Z","title":"On the Local Behavior of an Inte- rior Point Method for Nonlinear Programming,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.163956Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:e916f3700a24f03f23f4bd118307374d19932c6d1c4f1f1424820198e55235a6","observation_id":"941c0e07-78b8-4f14-90bc-93ebb777fbe4","resolution":{"observed_at":"2026-08-03T16:26:01.163956Z","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-03T16:26:01.246117Z","title":"Sequential Quadratic Programming Methods,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.246117Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:b8c37e88cf1744365ee9dd885021fbc0ed3e22b3b15aa0fe611a3efe55464e22","observation_id":"095665ae-6c6b-449b-b92e-802b347965ea","resolution":{"observed_at":"2026-08-03T16:26:01.246117Z","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-03T16:26:01.323118Z","title":"Integer Programming,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.323118Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:0ff7a197a1f48f71dcb9df9b61cd8a1212468bb3c41b6caa36acdc1c78710568","observation_id":"68a44f14-862f-4d79-84f2-f1231e2defbc","resolution":{"observed_at":"2026-08-03T16:26:01.323118Z","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":"10.1002/rnc.4590010404","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Branch and bound algorithm for computing the minimum stability degree of parameter-dependent linear systems,","venue":"International Journal of Robust and Nonlinear Control","work_id":"b903679d-ce6b-4cd0-922f-8fa53b0af8e0","year":1991},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.503116Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:d626d19961808b4c8b17d2003986e4624cd14f7cab6bc8f2eda99bc09823927b","observation_id":"801ab7bc-b716-4cfb-91b1-1c86894727b2","resolution":{"observed_at":"2026-08-03T16:28:28.407276Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T16:26:01.579647Z","title":"An algorithm for integer solutions to linear programs,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.579647Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:72de4364129618e1063994353581cbecad363b36c3d50a8860c3da1a81990d65","observation_id":"8975d12d-9bc3-4c34-b904-b8fa4b1bf8dc","resolution":{"observed_at":"2026-08-03T16:26:01.579647Z","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-03T16:26:01.734556Z","title":"Lee and S","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.734556Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:f5581aee512afc63b4608ca011af834df90fe8bdb3e8dfd8e85f6ad8b16671bd","observation_id":"e8d13fb5-3970-494c-9641-41d8e2644d35","resolution":{"observed_at":"2026-08-03T16:26:01.734556Z","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":"10.1007/s10107-011-0476-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On convergence in mixed integer pro- gramming,","venue":"Mathematical Programming","work_id":"fc2726f7-1b40-4b0b-9ea4-58c4a8684325","year":2012},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.843951Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:7e73eda5445eb057436d5430b79ee945b57e5d4253f08547c358a01fcd5f9ed1","observation_id":"feeb40fb-1f9b-4601-9493-c269962f877f","resolution":{"observed_at":"2026-08-03T16:28:28.242209Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T16:26:01.921916Z","title":"Mixed-integer nonlinear optimization,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.921916Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:a2fdc8c6d890fb542de088e570ff6f67635d283b08e3d77dc8f5b07272a626b2","observation_id":"5c4419ee-5c82-4fc1-a1d6-72292959ec27","resolution":{"observed_at":"2026-08-03T16:26:01.921916Z","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-03T16:26:01.964177Z","title":"Branch and Bound Experiments in Convex Nonlinear Integer Programming,","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.964177Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:5362838f0176e72dc510bfb4c357c798fa091ee5d09f172a5105435c49624bd6","observation_id":"09de7afc-7075-42e4-9359-183d483b8653","resolution":{"observed_at":"2026-08-03T16:26:01.964177Z","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-03T16:26:02.037343Z","title":"An LP/NLP based branch and bound algorithm for convex MINLP optimization problems,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.037343Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:a088e4ce7c1979058a135230bbf7fcf23c87f6213b47073806ad267118635863","observation_id":"0471e3f3-fce3-40ac-992c-23c02251b7c4","resolution":{"observed_at":"2026-08-03T16:26:02.037343Z","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-03T16:26:02.113271Z","title":"Introduction to Global Optimization,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.113271Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:2ff3b3cc716b581deedd66ee1d770982b1d1398848d15f69e9957bf5a384bd49","observation_id":"615c30ab-4d96-4aa7-b9f1-eb3bcd3b2c0d","resolution":{"observed_at":"2026-08-03T16:26:02.113271Z","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":"10.1016/j.disopt.2006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:28:27.993078Z","title":"An algorithmic framework for convex mixed integer nonlinear programs,","venue":null,"work_id":"512839d7-ace3-4c97-8f40-a5f98b956d0c","year":2008},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.187768Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:52d224e808b05dbf138bbcf716c9d22fedc97d5b9ac53d9d86d566e8a9acf8a2","observation_id":"e4d2b08f-8aee-4dc1-a3bd-f6c14b1343f9","resolution":{"observed_at":"2026-08-03T16:28:28.064339Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/0-387-30065-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:28:27.787961Z","title":"Knitro: An Integrated Package for Nonlinear Optimization,","venue":null,"work_id":"a9d6be36-dfb0-4de3-aa09-7e1d6235b25b","year":2006},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.267531Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:3e20416acb76f70e5a5ad7a4edfa64a76f6ed7eaf7e1f2a6435c629671ea3e96","observation_id":"71e2e7c0-136e-4ad3-b7cd-97cfef8b039b","resolution":{"observed_at":"2026-08-03T16:28:27.865507Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T16:26:02.314839Z","title":"Global optimization of nonconvex NLPs and MINLPs with applications in process design,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.314839Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:bbbabbeb3fba1b644e1f0eb00061be461f159be1293e416d5ae3ad98d3ec9f56","observation_id":"a706c2e5-f7bd-43b8-adde-94ef735ea93c","resolution":{"observed_at":"2026-08-03T16:26:02.314839Z","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-03T16:26:02.421099Z","title":"Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.421099Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:a165577812fd8dcbcb6dc607f2f40bb2b420c2d211c216593a68ad0079a0439a","observation_id":"f84c8881-aff7-4c17-973b-29a7be1ec4cd","resolution":{"observed_at":"2026-08-03T16:26:02.421099Z","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":"10.1007/s12532-012-0045-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:28:27.630662Z","title":"A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization,","venue":null,"work_id":"9b4719a8-1ae8-4b36-8923-bc6b0d8bcd51","year":2012},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.480733Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:ac9732fd96bd1ca8fae80c07587644097c40a5c7a39f2ea8c3652f03c7913d46","observation_id":"d230dd94-9071-4370-89fa-7660ad00244f","resolution":{"observed_at":"2026-08-03T16:28:27.694358Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T16:26:02.569181Z","title":"Optimisation of the operation of gas transmission systems,","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.569181Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:cccca6cf1a878750c17f5dc46d3c84d02097bbd4b919b5887708baea014d348f","observation_id":"30005e19-6302-40e6-84d6-3ec954ad150a","resolution":{"observed_at":"2026-08-03T16:26:02.569181Z","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-03T16:26:02.643682Z","title":"A twist on slp algorithms for nlp and minlp problems: An application to gas transmission networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.643682Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:4271e0718c8124804fef7a9921fbd6665946a1ea2cd9b535c892f953deff644e","observation_id":"8fd21076-e675-4896-bcca-a1dac82ea9da","resolution":{"observed_at":"2026-08-03T16:26:02.643682Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/3613661","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Differential Games. A Mathematical Theory with Ap- plications to Warfare and Pursuit, Control and Optimization,","venue":"The Mathematical Gazette","work_id":"fb31edf0-010b-4a8e-9679-bbedf12f30fa","year":1965},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.711905Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:897aaf19af2590ab5208277eedde0e1ebe7f47bc804fa2729ef8f0f46856b8c4","observation_id":"eaf3d839-e4c1-467c-b3b2-4f5c733e8984","resolution":{"observed_at":"2026-08-03T16:28:27.518490Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T16:26:02.798399Z","title":"Distance functions and their application to robot path planning in the presence of obstacles,","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.798399Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:319fbcb061b78e4900ca46e3a1b325cf278d9512064be35bff271d4e9cf7c648","observation_id":"d8edde8c-08ab-4730-986e-ed2472299592","resolution":{"observed_at":"2026-08-03T16:26:02.798399Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09149","last_updated":"2019-02-25T09:06:09Z","snapshot_observed_at":"2026-07-06T07:35:07.738233Z","submitted_at":"2019-02-25T09:06:09Z","title":"Real-Time Quad-Rotor Path Planning Using Convex Optimization and Compound State-Triggered Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.09149","snapshot_observed_at":"2026-08-03T16:26:02.911842Z","title":"Real-Time Quad-Rotor Path Planning Using Convex Op- timization and Compound State-Triggered Constraints,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.911842Z"},"links":{"cited_paper":"/paper/1902.09149","citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:db8362302c461114af4c99cf6042912469752bc8867e4a243a95a36ebd6c2f0b","observation_id":"63a2636d-ea44-40e6-a4af-43938d18dfd0","resolution":{"observed_at":"2026-08-03T16:26:02.911842Z","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-03T16:26:02.985004Z","title":"An improved sequential convex programming obstacle avoidance algorithm for autonomous vehicles,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:02.985004Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:1cb7776db53dae2af573bfd92fa7b764799a2edd29a1945d3ddc001efdba3edb","observation_id":"c843acb1-f27f-4607-a2c5-4aef2c44be07","resolution":{"observed_at":"2026-08-03T16:26:02.985004Z","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-03T16:26:03.077523Z","title":"Mixed integer programming for multi-vehicle path planning,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.077523Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:1d8f0eb9414a65c497ee68b24c53c81c0bbce2186df838f0992192e0e8da0e50","observation_id":"befff46e-bfd0-49bb-9f42-26830c359ade","resolution":{"observed_at":"2026-08-03T16:26:03.077523Z","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-03T16:26:03.143169Z","title":"Constrained iterative LQR for on-road autonomous driving motion planning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.143169Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:a32b69c685b9af464b13ef48a2ebde2bd745579ada0e431a5cd6b70f119822f8","observation_id":"7799e1ce-af09-4bb1-8565-675d1125ef29","resolution":{"observed_at":"2026-08-03T16:26:03.143169Z","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-03T16:26:03.224133Z","title":"Mixed- integer Programming in Motion Planning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.224133Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:e7e85b8ab30c10cdbb9a05c403fd67d77fc91526e98ddac6d1a4ae10ac0281ae","observation_id":"00563d96-963c-4d47-a59a-eac44f1b4143","resolution":{"observed_at":"2026-08-03T16:26:03.224133Z","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-03T16:26:03.354880Z","title":"Optimization-Based Colli- sion Avoidance,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.354880Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:54e80be3b14ccae372ddb8148c4619f17f06dfa92e41742a97eeef51332517df","observation_id":"17e0c746-2dab-4341-b30b-7a89733f190d","resolution":{"observed_at":"2026-08-03T16:26:03.354880Z","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-03T16:26:03.455681Z","title":"Safety-critical control and planning for obstacle avoidance between polytopes with control barrier functions,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.455681Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:5d5a7f2d5e2fee7db52519ecd0046961ac4d137a8ecc8c6fca577520e258d7e0","observation_id":"7de3e28e-9f39-4ecd-a436-0e7bfe8c12b6","resolution":{"observed_at":"2026-08-03T16:26:03.455681Z","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-03T16:26:03.522454Z","title":"FASTER: Fast and Safe Trajectory Planner for Navigation in Unknown Environ- ments,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.522454Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:72012dab24a7bb573aff7e883df80ced493d483ac36514e2a4b04f04cc407340","observation_id":"9271f5d4-aeeb-4ec9-b635-f084e5143bfb","resolution":{"observed_at":"2026-08-03T16:26:03.522454Z","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-03T16:26:03.606933Z","title":"Computing Large Convex Regions of Obstacle-Free Space Through Semidefinite Programming,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.606933Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:a061d6c8f961442253c361f3427cac4476781a22fafec5f3fade52773002a941","observation_id":"7f5fc26d-2c98-41d4-a397-59d7b1346159","resolution":{"observed_at":"2026-08-03T16:26:03.606933Z","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-03T16:26:03.676167Z","title":"Control of systems integrating logic, dynamics, and constraints,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.676167Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:a9b6dfc9a6547eb4ac7733640159c7aca26e6720573e28b218b9a494300ded50","observation_id":"f7f373da-12e0-49a6-8c3d-e68ab4c460eb","resolution":{"observed_at":"2026-08-03T16:26:03.676167Z","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-03T16:26:03.775232Z","title":"Centralized non- convex model predictive control for cooperative collision avoidance of networked vehicles,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.775232Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:811eea42dc6f4ca977f72eb16ba557aa1009712148b29a65298b82ec90387ad9","observation_id":"4acab0ac-49a0-4b06-83fa-c1d983634984","resolution":{"observed_at":"2026-08-03T16:26:03.775232Z","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":"10.1002/rnc.1341","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the use of mixed-integer linear programming for predictive control with avoidance constraints,","venue":"International Journal of Robust and Nonlinear Control","work_id":"0ccacf2e-4718-4d41-a666-e219e784e7e7","year":2009},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.834895Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:87173aa14967ff94e402b73f1891200658b0bfaeff6a5b2398e0a6c0306c6404","observation_id":"d07e8aca-999f-417c-91aa-56f5fb7c5d2f","resolution":{"observed_at":"2026-08-03T16:28:27.340896Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/rnc.3101","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Inter-sample avoidance in trajectory optimizers using mixed-integer linear programming,","venue":"International Journal of Robust and Nonlinear Control","work_id":"1b86a313-de54-4146-bf31-4e98b81b2e83","year":2015},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:03.954385Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:fcfe8f40aa7c86057cd9c6952f521af026857d4177ae6b8a8ce14d7bc8b0165e","observation_id":"3ce9b34e-3995-4bdd-bd0a-925b1db9a821","resolution":{"observed_at":"2026-08-03T16:28:27.185591Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T16:26:04.054436Z","title":"Embedded nonlinear model predictive control for obstacle avoidance using PANOC,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.054436Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:894a55d882ab37a546e0874faaf386ed8f853db39549c8e5f47f1bbec8959356","observation_id":"3bbbd33f-1efc-4eaa-b2a1-dc14ba3c55dc","resolution":{"observed_at":"2026-08-03T16:26:04.054436Z","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-03T16:26:04.126202Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.126202Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:a539187870d4114c6f43011335696da62a5b98d80524d85ca36d57f7236964d2","observation_id":"af14f17d-7abb-4e3f-848f-58eab0c63e41","resolution":{"observed_at":"2026-08-03T16:26:04.126202Z","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-03T16:26:04.187630Z","title":"Trajectory planning for Bertha A local, continuous method,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.187630Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:d7cedbe15ba664336514f9fb16100a1f021b8fc9e45712bb19dd7359bade4873","observation_id":"ed0c0d20-299f-4f36-b757-5204786e88f9","resolution":{"observed_at":"2026-08-03T16:26:04.187630Z","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-03T16:26:04.258520Z","title":"Shared Steering Control Using Safe Envelopes for Obstacle Avoidance and Vehicle Stability,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.258520Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:fe02c71a9a26e7fef540e2bb077812fe778a4f5b235db2ea3b4ef7cc3b41562d","observation_id":"0806a442-8f58-410e-83fd-09bdaa1bd965","resolution":{"observed_at":"2026-08-03T16:26:04.258520Z","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-03T16:26:04.410097Z","title":"Staying within the nullcline boundary for vehicle envelope control using a sliding surface,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.410097Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:0485d5015518f3df05d10eb45153bba6f34f437685d8ad0d0a4e7b87aa499ae2","observation_id":"63d26c8e-9849-4759-a1a3-17b2ced1c8d8","resolution":{"observed_at":"2026-08-03T16:26:04.410097Z","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":"10.1016/b978-0-7506-6918-4.x5000-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Elsevier eBooks","work_id":"ad5f1153-bb23-4a6c-8046-dda5b2040e6f","year":2012},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.494155Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:d539860a455e6433b97f9f9a588fd8a86b84da42691803ad1d67efe42df2f09b","observation_id":"5b305e05-9943-444e-9044-158922ac9b53","resolution":{"observed_at":"2026-08-03T16:28:26.965068Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T16:26:04.591109Z","title":"Path Tracking Controllers for Fast Skidding Rover,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.591109Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:6d74654357ac0acfc68a547321a556e18f15744d7a49cbc0d55236d13f1b0576","observation_id":"281fbc34-c119-4e8f-9f58-19db6eb0eabb","resolution":{"observed_at":"2026-08-03T16:26:04.591109Z","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-03T16:26:04.664156Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.664156Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:b55304fed76a190c13238b0c8652248908eec31693b86da278ef71d4550e60f1","observation_id":"05ddd782-a402-4f65-9c40-c71db390342d","resolution":{"observed_at":"2026-08-03T16:26:04.664156Z","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-03T16:26:04.752430Z","title":"Robust H∞output-feedback control for path following of autonomous ground vehicles,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.752430Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:7697c3e64ee387d1f6cd4a0cdc5e4def05bd4a370ef03b28089a80ba8a9a9870","observation_id":"f441df8d-3689-4db1-8a4b-1f64406d41b5","resolution":{"observed_at":"2026-08-03T16:26:04.752430Z","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-03T16:26:04.819562Z","title":"Trajectory tracking for two-steering- wheels mobile robots,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.819562Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:1b8688f530be3208c9c4b71fcfc5f0765947f6fbe3c4dc13cdcf8cdc43d0236e","observation_id":"defae4be-dc0e-42b1-8ef5-e2674385de3b","resolution":{"observed_at":"2026-08-03T16:26:04.819562Z","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-03T16:26:04.936267Z","title":"Model Predic- tive Contouring Control for Time-Optimal Quadrotor Flight,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:04.936267Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:d62d1b8ec54f56abe1c6aee9a36a5c594d9b7a980b90c44972d1cf3f28ded784","observation_id":"e886db6b-5406-4575-baca-4509ea022677","resolution":{"observed_at":"2026-08-03T16:26:04.936267Z","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-03T16:26:05.029359Z","title":"Principles of guidance-based path following in 2d and 3d,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:05.029359Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:2648a81cb1106f1c06a3d0ea325875706a305f33a0a02ce6a9030e55fe8ed5a4","observation_id":"845aca2f-a55b-4a9d-88ef-2316ce19f570","resolution":{"observed_at":"2026-08-03T16:26:05.029359Z","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-03T16:26:05.108499Z","title":"Nonlinear maneuvering and control of ships,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:05.108499Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:4200fdab887885d9e7250fcf306883bff846d6a5ccaf132dbe3ca3ea77bf101d","observation_id":"798893fa-2ef3-4694-818f-25bcb8b69880","resolution":{"observed_at":"2026-08-03T16:26:05.108499Z","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-03T16:26:05.153941Z","title":"Nonlinear programming without a penalty function,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:05.153941Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:43bfba6342c83278d7a9b1b0eb8012f615b2c1601c6e45ca4442a75aab507130","observation_id":"9c0292f1-758a-4236-9c75-8452b627c2f5","resolution":{"observed_at":"2026-08-03T16:26:05.153941Z","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-03T16:26:05.203151Z","title":"Convex Optimization for Trajectory Generation: A Tutorial on Generating Dynamically Feasible Trajectories Reliably and Efficiently,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:05.203151Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:5adf4ce23bb99dbfa255f88d358369de75fb00761426768bf8ce91887ad25639","observation_id":"35a9621a-0f8a-43ea-ab9c-325a727bba61","resolution":{"observed_at":"2026-08-03T16:26:05.203151Z","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-03T16:26:05.293068Z","title":"CVXPY: A Python-embedded modeling language for convex optimization,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:05.293068Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:49beaae886750aa131b3f846d3160f259d2afaa1f0509e930204fa693b6b6af9","observation_id":"cf8ccf59-3387-4ad2-b927-66b419e22345","resolution":{"observed_at":"2026-08-03T16:26:05.293068Z","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-03T16:26:05.344844Z","title":"CasADi - A software framework for nonlinear optimization and optimal control,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:05.344844Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:afcb3753c7a7734071cab8f2d94ef475a0f4079680a7e1b3d76f20f69c1bbb5e","observation_id":"6da85f3d-f0e9-4d4f-bf4d-50cbba9894ad","resolution":{"observed_at":"2026-08-03T16:26:05.344844Z","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-03T16:26:05.455535Z","title":"On the implementation of an interior- point filter line-search algorithm for large-scale nonlinear program- ming,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:05.455535Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:b112c8a7d6540b57d64a85f6aeba45211872743ee23a21009fbf44f31364330e","observation_id":"f0e9369b-9f5d-4fe3-9170-d57382d7a172","resolution":{"observed_at":"2026-08-03T16:26:05.455535Z","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-03T16:26:05.533213Z","title":"Traffic safety facts - 2021 data: Motorcy- cles,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:05.533213Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:0c80167f7531660719f729d9eb54a6e4ff89ed69aedc79259ae5673cbffc45f2","observation_id":"61f50aaf-ec6e-4ab4-8ac3-c647ab07b3cd","resolution":{"observed_at":"2026-08-03T16:26:05.533213Z","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-03T16:26:05.618377Z","title":"Advanced slip ratio for ensuring numerical stability of low-speed driving simulation: Part IIlateral slip ratio,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:05.618377Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:2355593952cb955692a8edaf0c70c4d71c58597f1889f8fc169d6335fa44cbb0","observation_id":"aaad6116-0e7e-45ac-9aa7-765be8a7a567","resolution":{"observed_at":"2026-08-03T16:26:05.618377Z","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-03T16:26:01.661462Z","title":"Available: https://api.semanticscholar.org/CorpusID: 116324171","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":1958,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.661462Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:98912f028f019235dd216e1905642c821dc50d4ba1f8e51882072669382bfa53","observation_id":"f1c3dcf4-01c7-43b9-b62e-cd61c861d70f","resolution":{"observed_at":"2026-08-03T16:26:01.661462Z","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-03T16:26:01.434258Z","title":"Available: https://api.semanticscholar.org/CorpusID: 41752617","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-03T16:26:01.434258Z"},"links":{"citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:35f5d392e3b58c265f62acf2b6bdf1a39fca31ded75b927743dc7dd271e76e62","observation_id":"f757b010-bf52-4aab-9bfe-b80790671892","resolution":{"observed_at":"2026-08-03T16:26:01.434258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","latest_version":3,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation"},"reference_resolution":{"displayed":76,"state_counts":{"malformed_identifier":9,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":58,"verified_exact":9,"verified_fuzzy":0},"total_outbound_references":76},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 76 of 76 outbound references and 1 inbound Pith citation observation for arXiv:2512.13836."}