{"as_of":"2026-08-10T13:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2356231f1da2359103d219531553e12eceab9a6b6d79a30950912034b3f17332","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T16:50:21.141758Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T11:04:28.242865Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T12:33:24.589224Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01055","snapshot_observed_at":"2026-08-09T11:04:28.242865Z","title":"On the surprising robustness of sequential convex optimization for contact-implicit motion planning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.02829","last_updated":"2025-09-04T20:11:46Z","snapshot_observed_at":"2026-08-09T20:01:40.002068Z","submitted_at":"2025-02-05T02:13:51Z","title":"Global Contact-Rich Planning with Sparsity-Rich Semidefinite Relaxations","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T11:04:28.242865Z"},"links":{"cited_paper":"/paper/2502.01055","citing_paper":"/paper/2502.02829"},"observation_digest":"sha256:7e18b8d89538d78cf3bef44e7e09aa630318aa1b057237208864f887212ccd69","observation_id":"9f88f7ff-5ec1-4f57-85a4-18f4cca64eed","resolution":{"observed_at":"2026-08-09T11:04:28.242865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"cited_work":{"arxiv_id":"2502.01055","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01055","snapshot_observed_at":"2026-06-29T12:33:24.589224Z","title":"On the surprising robustness of sequential convex optimization for contact-implicit motion planning","venue":null,"work_id":"b53ceb1c-7a24-4d2a-972d-2634853441e2","year":2025},"citing_paper":{"arxiv_id":"2604.18432","last_updated":"2026-04-20T15:52:09Z","snapshot_observed_at":"2026-07-06T23:05:17.639285Z","submitted_at":"2026-04-20T15:52:09Z","title":"Real-Time Algorithms for Model Predictive Control of Hybrid Dynamical Systems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T04:16:12.807788Z"},"links":{"cited_paper":"/paper/2502.01055","citing_paper":"/paper/2604.18432"},"observation_digest":"sha256:1a294e0008f9cf921a9eb4572765aa0f00b3744a52d7b6a5deaf2b8be54330ed","observation_id":"e62e8d33-2819-4364-af07-c291b2fe056b","resolution":{"observed_at":"2026-05-11T12:06:01.209995Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"cited_work":{"arxiv_id":"2502.01055","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01055","snapshot_observed_at":"2026-06-29T12:33:24.589224Z","title":"On the surprising robustness of sequential convex optimization for contact-implicit motion planning","venue":null,"work_id":"b53ceb1c-7a24-4d2a-972d-2634853441e2","year":2025},"citing_paper":{"arxiv_id":"2605.27972","last_updated":"2026-05-27T05:07:19Z","snapshot_observed_at":"2026-08-05T02:47:06.315008Z","submitted_at":"2026-05-27T05:07:19Z","title":"Simultaneous Contact Selection and Planning for Contact-Rich Manipulation with Cascaded Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T12:27:04.864523Z"},"links":{"cited_paper":"/paper/2502.01055","citing_paper":"/paper/2605.27972"},"observation_digest":"sha256:f399667fed4408a20c8ba9acb137cca1a5ee5d718910018408c86af03ceadc42","observation_id":"ca602f87-1fef-4ac6-b7c5-2573746e5b4a","resolution":{"observed_at":"2026-06-29T12:33:24.590898Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.01055/citation-record","integrity":"/paper/2502.01055/integrity","json":"/paper/2502.01055/citation-record.json","paper":"/paper/2502.01055"},"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-09T16:50:22.651890Z","title":"IFAC-PapersOnLine, 50(1):1463– 1469, 2017","venue":null,"work_id":"7caa0879-87c8-4f13-bfd7-3611aecc03ed","year":2017},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.871658Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:f53e3e4241659af35593b5f54828faed654eb7050ec11676912f2f41dfdd3e55","observation_id":"c9c94536-b27e-403c-b46d-09966f909259","resolution":{"observed_at":"2026-08-09T16:50:22.656546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.637683Z","title":"Grieco, and Gerardo Fernández-López","venue":null,"work_id":"8e2cba01-7636-4aa5-8d4b-801a812cc369","year":2017},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.877067Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:6ef3405e4e671c7b42a2ba9bce5c17ca1054ba6855c8cdcaccecbdcd148d16ae","observation_id":"04b5dfa8-cf98-41c2-bfec-25b1b81176b0","resolution":{"observed_at":"2026-08-09T16:50:22.642350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.623742Z","title":"Caldwell, José Cappelletto, Juan C","venue":null,"work_id":"b02ddb22-5566-4908-9142-62f06843df5b","year":2018},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.881738Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:0954b31996188e4638557dab246ee495935cfb94bdf836e3f9c64e679c19a730","observation_id":"48b64a00-2745-4c17-ac44-2c01ba17a5a6","resolution":{"observed_at":"2026-08-09T16:50:22.628189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.609694Z","title":"On using the elastic mode in nonlinear programming approaches to mathematical programs with complementarity constraints","venue":null,"work_id":"05e3d1d8-853d-488d-ab4d-f4705bdfa9ed","year":2005},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.886764Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:1cbf2cbc3071a388060ede2bcfbc18873b2c5139d4effe73c6ca7f4b3eeaef1c","observation_id":"d6e388dc-e75c-4987-9f7c-6c20c11a3084","resolution":{"observed_at":"2026-08-09T16:50:22.614262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.595635Z","title":"Real-time multi- contact model predictive control via admm","venue":null,"work_id":"0c2a88ff-2563-4e6a-9eb6-9d917d7a8f67","year":2022},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.891197Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:d8b49ac38e676d6d130d000c624cdc9afce6d570492d4613fd5b39fe2081ecb0","observation_id":"38400024-08d2-4ff0-9323-29cb7f5a97c6","resolution":{"observed_at":"2026-08-09T16:50:22.600206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.581032Z","title":"PROX-QP: Yet another quadratic pro- gramming solver for robotics and beyond","venue":null,"work_id":"4f661fb1-829f-4713-b2cd-6e5e9cd775d9","year":2022},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.895519Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:a5da51b894dd33dc6482c72ae626860e3b64f8a7498e772bed34ea40c27c18e7","observation_id":"92fe6a04-019a-48a7-bd90-c95e0873d38c","resolution":{"observed_at":"2026-08-09T16:50:22.586103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.567130Z","title":null,"venue":null,"work_id":"c06f8159-32fd-4cd7-8b36-915e76f6b2a9","year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.900313Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:69932654833b948bd949b425d4368351a0f5c12a9b82789dc783b2b153e6d30f","observation_id":"c152e083-8996-4974-803a-a4d9337619df","resolution":{"observed_at":"2026-08-09T16:50:22.571391Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.553094Z","title":"Powell, Benjamin Katz, Jared Di Carlo, Patrick M","venue":null,"work_id":"0329f40b-d061-48a8-927b-cb72a4ec8260","year":2018},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.904486Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:35471d9d3854af8d46ce7c93e88cc876e9b315cbc6b43db27d160c2dea04360f","observation_id":"fa07042d-a13e-4c2d-b636-0382f0a4a631","resolution":{"observed_at":"2026-08-09T16:50:22.557629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.539388Z","title":"Blickhan","venue":null,"work_id":"0706e490-931b-4eea-af5e-87be61160b4e","year":null},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.908655Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:20b18d2eba207be20ed36516b866fb207ecc55bc1bdd9c1fc25c089c9c9638c6","observation_id":"e785e37a-55c9-4e5d-8d2b-c617b4e4d576","resolution":{"observed_at":"2026-08-09T16:50:22.543689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.525241Z","title":"The Pinocchio C++ library – a fast and flexible implementation of rigid body dynamics algorithms and their analytical derivatives","venue":null,"work_id":"9a4297f3-c73b-4b38-a289-f42e671e775f","year":null},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.912624Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:5aa97d8e747a99873a2a7d12dbbd41e9f90276ab59ec720471c795450f53a6c9","observation_id":"f0098004-9500-4da4-8a6d-c80b4cc4e6dd","resolution":{"observed_at":"2026-08-09T16:50:22.530281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.511525Z","title":null,"venue":null,"work_id":"2ea81aba-1644-4a98-84cb-5057b46b5380","year":2022},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.917006Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:f2552b75be92d1a7e2da38bd4949fc39e6068bc5052aa8085eb65c623333ea0a","observation_id":"24cef38b-49f0-4035-9d2d-37afde392620","resolution":{"observed_at":"2026-08-09T16:50:22.515913Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.498038Z","title":"Footstep planning on un- even terrain with mixed-integer convex optimization","venue":null,"work_id":"ab01e09d-23b7-4b3c-bec5-9f7ff28acf80","year":2014},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.921139Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:ed4deefdd9632c8ec0258f251a27a3b1c1c132e0feccb3e3ba859145b3798fe9","observation_id":"f486416c-f55a-46a0-a35e-aacfedb6440e","resolution":{"observed_at":"2026-08-09T16:50:22.502206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.485335Z","title":"Local convergence of generalized gauss-newton and sequential convex pro- gramming","venue":null,"work_id":"d9eaf169-be03-4a1b-93d8-6c4018fcd137","year":2019},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.925339Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:f1fbe8cb01304abf12f55d253aed0ab2cb395f141e8e2edb000bd7b244b0dac3","observation_id":"bfc8913f-3238-4bef-9c59-52409b19b838","resolution":{"observed_at":"2026-08-09T16:50:22.489419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.471812Z","title":"Local convergence of sequential convex programming for nonconvex op- timization","venue":null,"work_id":"3186d84d-4b2b-4245-824d-1c1bd618469e","year":2010},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.929419Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:16bd4dad7d100827d9188a16ed0e77fe47aa47f37f586a6558719bec57117ab5","observation_id":"a5e251b3-bc9b-4d1c-b7bb-b3adc265ea67","resolution":{"observed_at":"2026-08-09T16:50:22.476173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.457406Z","title":"A smoothing method for mathematical programs with equi- librium constraints","venue":null,"work_id":"819f6f2d-c637-4c04-a856-7d629bb4240a","year":1999},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.933565Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:753a1ff12c19ce73cc795bbd8c195059fc5129d10d4ff9138c770734b0935ef8","observation_id":"d0bf73bc-a2a7-4825-ba28-815802054cc0","resolution":{"observed_at":"2026-08-09T16:50:22.462329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.442794Z","title":"Real-time motion planning of legged robots: A model predictive control approach","venue":null,"work_id":"f553aeb3-3c0b-44c2-8d98-236ddae6703e","year":2017},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.937823Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:e86904e7b4878766f131a641174921e6f9edcb2ae04a61d69155325447052519","observation_id":"af87aeb3-019b-4c93-89fa-628cef038d87","resolution":{"observed_at":"2026-08-09T16:50:22.447395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.428122Z","title":"OCS2: An open source library for optimal control of switched systems","venue":null,"work_id":"441c9104-094d-4456-93fc-df456bb954c7","year":null},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.941901Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:9cf9fe42b0e3ef7b6820e0124db805cb56c6a1579f74967b71f62b8be881e2af","observation_id":"6e0bfc9c-19c8-4ab6-82fd-033968dc6faa","resolution":{"observed_at":"2026-08-09T16:50:22.433013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.413824Z","title":"Ferreau, C","venue":null,"work_id":"2618561e-af4d-4e50-8d57-ea4432b748ef","year":2014},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.946080Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:c0cfaf663fa972c69344438a1026938822565222a068a76bee5e0086240b49f5","observation_id":"5de15149-ac7c-4ce4-852f-19f8cbc42303","resolution":{"observed_at":"2026-08-09T16:50:22.418239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.399366Z","title":"Fletcher","venue":null,"work_id":"369a7987-17e9-422a-99a8-58e82c43a5d4","year":1983},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.950131Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:9f95d65bee52f99be208ab43874b49ead59ccfe7aa65644f4e2dca2af68a6bee","observation_id":"098e13f1-a173-42ed-83bc-7c7d11e3bb02","resolution":{"observed_at":"2026-08-09T16:50:22.403935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.382517Z","title":"Practical methods of optimization","venue":null,"work_id":"bc501e98-0d5c-437a-9448-724467d48309","year":2013},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.954304Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:5273d1b6d7282db27ebe0b685f6b26427131412234a3fa3a9eaf9e0c9d8d8bd4","observation_id":"cc196e5e-cad0-4ead-b302-4d263c191cb3","resolution":{"observed_at":"2026-08-09T16:50:22.389141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.367126Z","title":"Solving mathematical programs with complementarity constraints as nonlinear programs","venue":null,"work_id":"9b378212-3cbf-4ea2-9525-bae1e27d2529","year":2004},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.958721Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:f86b9d8b43d9bdb73ef8c96f38b3d86b41e65544c3637660ce7356c289aed0b9","observation_id":"243679e6-efe6-4fb5-9185-44218afaa9af","resolution":{"observed_at":"2026-08-09T16:50:22.371966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.351404Z","title":"Local convergence of sqp methods for math- ematical programs with equilibrium constraints","venue":null,"work_id":"fb5cc261-f6b1-4954-af47-33b24e52d407","year":2006},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.963084Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:ef28d27f1248868767fb4f51e93341a9679113c1516e8a465046d7c2dec71291","observation_id":"0fd47409-dbbf-4f8c-add8-c3d909dc2849","resolution":{"observed_at":"2026-08-09T16:50:22.356593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.336220Z","title":"Gill and Elizabeth Wong","venue":null,"work_id":"9db100f3-e204-4cbb-8162-f24987e08a62","year":2012},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.967601Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:607ec1817d56578c9041fd025eb406a59009537a3d5bc026436828d2bd46b90a","observation_id":"71037fd3-a86e-48cd-9cad-9f999c42fab3","resolution":{"observed_at":"2026-08-09T16:50:22.340758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.321758Z","title":"Gill, Walter Murray, and Michael A","venue":null,"work_id":"605bb459-0e4c-483a-b6b7-9154bcd1a141","year":2002},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.971887Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:681e1d24ffb6d525f9a4ed1ecb5613b8fc21a1a2b4a8eb1c27cc1bfb2a95dc05","observation_id":"d20ad77b-a6aa-4bfc-bb8c-c11d2bf62ea7","resolution":{"observed_at":"2026-08-09T16:50:22.326346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.307146Z","title":"Sanfelice, and Andrew R","venue":null,"work_id":"315f376c-9837-4e35-864d-7ba99cb46490","year":2009},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.976229Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:dbd7ff80d4fa08495ff4d31ecbc800412e29e1d5b2e939ef30e479f2e282cf34","observation_id":"309eabce-9f3e-480d-95a1-5436e7e74def","resolution":{"observed_at":"2026-08-09T16:50:22.311783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2402.10312","last_updated":"2024-07-05T15:36:23Z","snapshot_observed_at":"2026-08-08T20:48:14.322982Z","submitted_at":"2024-02-15T20:25:28Z","title":"Towards Tight Convex Relaxations for Contact-Rich Manipulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10312","snapshot_observed_at":"2026-08-09T16:50:20.980556Z","title":"Parrilo, and Russ Tedrake","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.980556Z"},"links":{"cited_paper":"/paper/2402.10312","citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:6b84651ca117255f33db4ee52d1dd1f6316ce08535be51034b23a00fe914bbff","observation_id":"f616178c-085c-4778-bc94-624a2f6dd5cf","resolution":{"observed_at":"2026-08-09T16:50:20.980556Z","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-09T16:50:22.291748Z","title":"Gurobi Optimizer Reference Manual, 2024","venue":null,"work_id":"12f4c022-2af1-423d-b74f-3265b2b63352","year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.985019Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:aa260e8f9e972051896f2e52b7000c08220a160a99c6583b653cf8cbebeeaec5","observation_id":"1240a013-2693-4ca4-b1ff-1ca8634b41b5","resolution":{"observed_at":"2026-08-09T16:50:22.296802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.277317Z","title":null,"venue":null,"work_id":"d671aa56-647e-4b7a-8a9c-0250ebea6acc","year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.989086Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:4ef26a32944e075e795451e7e07c9952d4ca11863e28fc39e811bbbef46f57a3","observation_id":"f26737d9-dc24-43ab-a6d7-0df44d0527e6","resolution":{"observed_at":"2026-08-09T16:50:22.281622Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.261866Z","title":"Constrained differential dynamic programming: A primal-dual augmented lagrangian ap- proach","venue":null,"work_id":"94277730-e7fb-4150-8003-289059e69070","year":2022},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.992743Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:4a1590231d432a75d24526c365c47696fdaff7ebf860389d0dbd7a4abc4ed264","observation_id":"9214312a-ce01-4ea8-9b59-953af61b40d8","resolution":{"observed_at":"2026-08-09T16:50:22.266321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.247452Z","title":"Stagewise implementations of sequential quadratic programming for model-predictive control","venue":null,"work_id":"00295071-c6e5-469e-8b34-d91ce913aa9d","year":2023},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:20.996489Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:c4a6008cf96bcdae673161a7d5427c0c025445a42e2063a43cd7ce4f23b9d7f3","observation_id":"2bdfde10-42c5-4bdb-ae27-6b23a7f5a184","resolution":{"observed_at":"2026-08-09T16:50:22.251890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2406.05846","last_updated":"2024-09-02T20:06:03Z","snapshot_observed_at":"2026-08-07T17:37:09.996561Z","submitted_at":"2024-06-09T16:34:03Z","title":"Fast and Certifiable Trajectory Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05846","snapshot_observed_at":"2026-08-09T16:50:21.000316Z","title":"Fast and certifiable trajectory optimiza- tion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.000316Z"},"links":{"cited_paper":"/paper/2406.05846","citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:a56af528961382def9f52333b4ee79e7697b3a8467611707a43e3976695babee","observation_id":"38499929-080c-4b46-99f1-53df200df506","resolution":{"observed_at":"2026-08-09T16:50:21.000316Z","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-09T16:50:22.231942Z","title":"Tailoring so- lution accuracy for fast whole-body model predictive control of legged robots","venue":null,"work_id":"7f860fe2-7eba-426f-a2e6-b739197c1f85","year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.004195Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:79dce7b8bc27306361b8ccb58b623b07a782136488f5216879eaa7984ccfb348","observation_id":"1f19575c-9e2e-40ac-a4c1-d8e429636857","resolution":{"observed_at":"2026-08-09T16:50:22.237398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.216696Z","title":"Fast contact-implicit model predictive control","venue":null,"work_id":"68418dab-9950-427b-931b-d3c849f68ee0","year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.007860Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:2c1718281b9aaa82dcb65566c498de539e18f3fb6d9d8f4e7b954cdf5fcdba18","observation_id":"823ab47c-2257-41f2-ab99-a86d2e229862","resolution":{"observed_at":"2026-08-09T16:50:22.221547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.790695Z","title":"Contact models in robotics: A comparative analysis","venue":null,"work_id":"e5946617-3705-4d68-ac4c-5c444f8c7780","year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.011573Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:abbf4e1bc82b68be2480a0f3a8008018c137fbb5629a525096fd327243132f36","observation_id":"859d8d95-75c3-4197-ba05-32242a1b27ba","resolution":{"observed_at":"2026-08-09T16:50:21.795061Z","resolver_source":"arxiv_id_nonexistent","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.202106Z","title":"CppADCodeGen: About source code generation for automatic differentiation using oper- ator overloading (2024)","venue":null,"work_id":"4b98c527-d0b4-4d89-89c2-82f3eda9e3ac","year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.015096Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:bf548dffb6355d0eedf1641912b3ce10eb0fdfc5df00f1110c8b3344dad806fb","observation_id":"36dcffe1-8f3b-45f6-8a6e-fdd50f580e84","resolution":{"observed_at":"2026-08-09T16:50:22.206931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.186889Z","title":null,"venue":null,"work_id":"6e77e1a5-560a-4771-98bb-36bbb9126457","year":null},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.019371Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:c41d74f8eb225d2d4aac8e42d94e72e4f118d0d23ccc502b71f35ea9662043eb","observation_id":"638f048b-e23b-4ea7-9200-ac2076765586","resolution":{"observed_at":"2026-08-09T16:50:22.191716Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2311.07710","last_updated":"2025-07-14T18:29:02Z","snapshot_observed_at":"2026-08-09T04:30:22.870375Z","submitted_at":"2023-11-13T19:50:03Z","title":"A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.07710","snapshot_observed_at":"2026-08-09T16:50:21.023623Z","title":"A practical and optimal first-order method for large-scale convex quadratic pro- gramming","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.023623Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:c8bf442ab2791a68aa15646d77ae0db190e6a822cda2d3b8de8b6ebf7e3b0c6f","observation_id":"43900e58-0b4c-433b-aba8-13bd93965f98","resolution":{"observed_at":"2026-08-09T16:50:21.023623Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.368387Z","title":"Successive convexification of non-convex optimal control problems and its convergence properties","venue":null,"work_id":"389af5f1-d8ab-47d1-954d-12c399939f74","year":2016},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.028043Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:983a63df38f5ad2773cc8d720f8fe1c0608811bca9156ea554e4820ffd3ace7c","observation_id":"3233513d-9ef5-4595-9437-dbeafdb7aa43","resolution":{"observed_at":"2026-08-09T16:50:21.375087Z","resolver_source":"arxiv_id_nonexistent","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":{"arxiv_id":"1804.06539","last_updated":"2019-02-27T12:47:55Z","snapshot_observed_at":"2026-07-06T06:34:02.107681Z","submitted_at":"2018-04-18T03:21:10Z","title":"Successive Convexification: A Superlinearly Convergent Algorithm for Non-convex Optimal Control Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.06539","snapshot_observed_at":"2026-08-09T16:50:21.032506Z","title":"Successive convexification: A superlinearly convergent algorithm for non-convex optimal control problems","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.032506Z"},"links":{"cited_paper":"/paper/1804.06539","citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:91d53131ffe1b7f9986f1cc1f249f7778ac9808111a9a6c64b28ee4b1d13906c","observation_id":"0139b2e9-21eb-481b-9651-3a866b4b5779","resolution":{"observed_at":"2026-08-09T16:50:21.032506Z","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-09T16:50:22.171445Z","title":"Warm start of mixed- integer programs for model predictive control of hybrid systems","venue":null,"work_id":"ae4381da-897c-4ef2-ab15-00fd08dfad5c","year":2021},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.037205Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:9757ed14722b50b9f7df8a1c7c3260bd7edb31154bd34f8aa0ee9eedaf6c1d81","observation_id":"56255f63-c87d-44a1-a047-2bcbfa243625","resolution":{"observed_at":"2026-08-09T16:50:22.176276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.156104Z","title":"Marhefka and D.E","venue":null,"work_id":"38cb33c0-06df-4f3e-9ea2-500a5d932ab5","year":1999},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.041292Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:ea9c31915abefaf316e99f4e0157ce942d73af0bcbadd76c0d7ac7619cde9e06","observation_id":"9764028e-e976-4db4-8079-bc104faf67b4","resolution":{"observed_at":"2026-08-09T16:50:22.160798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.140060Z","title":"Crocoddyl: An Efficient and Versatile Framework for Multi-Contact Optimal Control","venue":null,"work_id":"3c4aa815-24c2-43ac-8113-29b8e3d2d09e","year":2020},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.045528Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:69514c116c86e3dc7dd27c61bc80cc6cf1752e070ccfd3d9ce4522602122c890","observation_id":"80d841b7-e01c-4efd-a211-da542cacdf10","resolution":{"observed_at":"2026-08-09T16:50:22.145003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.124053Z","title":"Determining the exact local convergence rate of sequential convex pro- gramming","venue":null,"work_id":"60b5842f-aef9-4389-92f2-f147c0210732","year":2020},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.049901Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:fb0764c95339057120badbad5cd28b7775ae5f5231c84fae03f68d7d6359a424","observation_id":"122adb68-09ba-4524-b2f4-ad3dcf7ba940","resolution":{"observed_at":"2026-08-09T16:50:22.129012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.107364Z","title":"Win- kler, and Jonas Buchli","venue":null,"work_id":"00c1ffa4-476c-4dea-821f-18efc1809263","year":null},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.054860Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:237d5c9b78d25b944868ba383bfe19075ab88f8e0dcede0f497a6384183cee29","observation_id":"a399ce00-bce9-4884-a5e4-13d358c97624","resolution":{"observed_at":"2026-08-09T16:50:22.113041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.092197Z","title":"Bellicoso, Jan Carius, Christian Gehring, Marco Hutter, and Jonas Buchli","venue":null,"work_id":"a79a6237-7c55-46e9-a133-bba4e8f7a68f","year":2018},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.060487Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:2e6b4b793137601f81a4b191333e0234b4953171ac1cff38b41312fe5b191d7f","observation_id":"b0323221-58ae-480b-b3d6-75d4b70711b0","resolution":{"observed_at":"2026-08-09T16:50:22.097390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.074324Z","title":"Numerical opti- mization","venue":null,"work_id":"681cec63-826f-4f2b-9d18-ce56026dd2b1","year":2006},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.065254Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:4ea245957d4e5fa6022426597903a5699f07988dbb16f6efbf8906e4288de287","observation_id":"d335c669-7462-4830-901b-3521dcdf54ae","resolution":{"observed_at":"2026-08-09T16:50:22.080468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.059004Z","title":"A direct method for trajectory optimization of rigid bodies through contact","venue":null,"work_id":"2f3619cd-713a-4880-a987-eb53fa0fb1ec","year":2014},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.069882Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:edfcb8b56066bebd4e7fbf62277419c33f7f9a8e90a5ef802c82d99303bb880c","observation_id":"e03519b4-a892-4116-8a1a-a2065819b402","resolution":{"observed_at":"2026-08-09T16:50:22.063443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.044196Z","title":"Mathematical pro- grams with complementarity constraints: Stationarity, optimality, and sensitivity","venue":null,"work_id":"daf45f82-7c99-4a5c-b7f7-6510391ba3c4","year":2000},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.074361Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:6f44f3b15481ba16f36064a85b40af700a3f9a17d0d91064adfc4a0e5036cf26","observation_id":"d1ae2238-26ca-4c00-98ac-396c4706ec1d","resolution":{"observed_at":"2026-08-09T16:50:22.048481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.030714Z","title":"Convergence properties of a regular- ization scheme for mathematical programs with comple- mentarity constraints","venue":null,"work_id":"91224f60-a4a2-4ab7-85af-8404da9e625a","year":2001},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.078812Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:1b51d09bdab5dfa815539c1174af12682658b6030e478ba452a92ada9d58d7ea","observation_id":"4937f4d0-e102-47fa-ae36-ff391b004f40","resolution":{"observed_at":"2026-08-09T16:50:22.035038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.016643Z","title":"How stringent is the linear independence assumption for mathematical pro- grams with complementarity constraints? Mathematics of Operations Research , 26(4):851–863, 2001","venue":null,"work_id":"ba04e94a-678b-4ef5-bb83-b2be7ce3e26c","year":2001},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.083741Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:98a8b8da66f8ecb5a9f87c5ef4f4867aa8d60111ce3dd65553a8f36ca8a20ef1","observation_id":"c7950d27-bed6-4600-94b9-9813cd2de8a5","resolution":{"observed_at":"2026-08-09T16:50:22.021257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:22.002713Z","title":"Finding locally optimal, collision-free trajectories with sequential convex optimization","venue":null,"work_id":"42c3f68f-a7ab-4712-831a-b83eb1d19400","year":null},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.088345Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:40cb4d203ac8bcdd7678f6ba92bbfe6c70ba288d6a743cf2b375c0bcb79d2be4","observation_id":"7a1a573b-eca4-4b79-9915-f2053d1ada38","resolution":{"observed_at":"2026-08-09T16:50:22.007340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.988781Z","title":null,"venue":null,"work_id":"4400fe2e-0bb9-4db0-82d4-7541a885f324","year":2023},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.093633Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:5f328cbeea22361ec480095455f68c61da8643428e011dc03ce5e62b1dc1558d","observation_id":"badb704f-6dfd-484d-8de4-c281a544355c","resolution":{"observed_at":"2026-08-09T16:50:21.993425Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.973768Z","title":"Jha, Arvind U","venue":null,"work_id":"1c07c84a-ed4c-4f13-b18d-a5d9bc7966df","year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.097944Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:1adddf1597e1e655a3b0eae36c34f10f434929f1d2a1a08109f2d1a7c90e0075","observation_id":"c4a80153-7df2-4b6b-9e7a-4d70c9e946b8","resolution":{"observed_at":"2026-08-09T16:50:21.978580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.955998Z","title":"Stellato, G","venue":null,"work_id":"329272a7-3461-4af2-b0bc-8b30645c28a2","year":2020},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.102210Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:e527a427d3ce7f4bdf388ada445b93c289940483b8011949b84c7e6fe7d8adfa","observation_id":"dba258c9-5b1b-4359-be61-46bfedeb2d8f","resolution":{"observed_at":"2026-08-09T16:50:21.961016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.940604Z","title":"OSQP: An operator splitting solver for quadratic programs","venue":null,"work_id":"1a60a62e-d3da-4626-aabb-64db6ce05eb5","year":2020},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.106480Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:26811f3be0a4c92ac6d15f310b165d57d333a5d4d48143544069a553dbb17643","observation_id":"1705157e-e706-4db0-bcbe-b1eb5b422096","resolution":{"observed_at":"2026-08-09T16:50:21.945130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.926311Z","title":"Mixed integer linear programming formulation techniques","venue":null,"work_id":"ffd6abfb-fd48-48b4-a135-2eebd0d39733","year":2015},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.110800Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:9f72ab7c5893c1255a4a2c0186fdceac04b0c10b848c7d91037b7438c779b53b","observation_id":"fb4879c2-cd3a-4e68-bb82-c7f25149de62","resolution":{"observed_at":"2026-08-09T16:50:21.931293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.911620Z","title":"On the imple- mentation of an interior-point filter line-search algorithm for large-scale nonlinear programming","venue":null,"work_id":"180ebf53-eb61-421d-af56-38cba2163e5b","year":2006},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.115153Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:798a2240c7cce3c85063df3d603d615e9414fb97f324bc59794bf4594fc5e981","observation_id":"a6338b92-b891-4376-ad52-0ee872137f4c","resolution":{"observed_at":"2026-08-09T16:50:21.916323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.894904Z","title":"Wensing, Michael Posa, Yue Hu, Adrien Escande, Nicolas Mansard, and Andrea Del Prete","venue":null,"work_id":"933e9db2-fa79-4093-ad42-0ba6a161d99d","year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.119417Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:4bb1679f67f5951587c29a7c5d7a4c2306f553883f373d71d58d12fc6b18aac9","observation_id":"e33335a5-fb0f-4057-8429-7fb68f4a0911","resolution":{"observed_at":"2026-08-09T16:50:21.900080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.879078Z","title":"Semi-implicit euler method — Wikipedia, the free encyclopedia, 2023","venue":null,"work_id":"1096b096-865b-461b-a3e8-f2d03ce4cb44","year":2023},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.123459Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:508e1a371b1f8d4048e44eff5ab0c6063aefafa6f384a8a42f6eaba59ac65e14","observation_id":"5943a8dd-0cff-42a6-8061-dd3167d069b7","resolution":{"observed_at":"2026-08-09T16:50:21.884233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2405.08731","last_updated":"2024-07-10T19:50:53Z","snapshot_observed_at":"2026-08-02T18:27:46.598886Z","submitted_at":"2024-05-14T16:16:43Z","title":"Dynamic On-Palm Manipulation via Controlled Sliding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08731","snapshot_observed_at":"2026-08-09T16:50:21.127734Z","title":"Dynamic on-palm manipulation via controlled sliding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.127734Z"},"links":{"cited_paper":"/paper/2405.08731","citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:8844efd721f8712d84b23ec44d0e5f106621ba898b4d75b76c550dac52eda9ac","observation_id":"756ce9e1-cd91-42eb-b129-977887f2b4b0","resolution":{"observed_at":"2026-08-09T16:50:21.127734Z","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-09T16:50:21.863053Z","title":"Ye and Jinchuan Zhou","venue":null,"work_id":"05adf0c1-0ff1-4b4b-96d1-1ddf15904049","year":2016},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.132496Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:3910273ea4c0dfb9f6d7b6dc54df08a9b2229c66088c1263ae392b542f79a988","observation_id":"7a6c696f-4267-4486-ad69-fb562094f2eb","resolution":{"observed_at":"2026-08-09T16:50:21.867915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.847890Z","title":"Yunt and C","venue":null,"work_id":"af066b9d-c344-486d-862e-12a50ec5f561","year":2006},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.137126Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:10e96d5db24404978273bc68f8f28370c88643116ee446f5710cf7be308bc561","observation_id":"6e745f39-c6a4-4bb4-823a-087a548b3b8b","resolution":{"observed_at":"2026-08-09T16:50:21.852590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:50:21.834069Z","title":"Similarly, m1 + 1 ∼ m1 + m2,− are negative, while m1 + m2,− + 1 ∼ m1 + m2’s components of w⋆ become zero","venue":null,"work_id":"b018bb80-9796-4283-ae74-0a70003b54d7","year":null},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.141758Z"},"links":{"citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:91785d313fa2032a2e9cfc88d73c0624369bc06b860aca4f1be4e2a66015d24a","observation_id":"5008627b-2495-4d9a-916e-dc3cc2f875e7","resolution":{"observed_at":"2026-08-09T16:50:21.838295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T00:25:07.630614Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":2,"verified_fuzzy":51},"total_outbound_references":63},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 63 of 63 outbound references and 3 inbound Pith citation observations for arXiv:2502.01055."}