{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JC4ZFAGQZQVLQKF2EJIOP4FJYQ","short_pith_number":"pith:JC4ZFAGQ","schema_version":"1.0","canonical_sha256":"48b99280d0cc2ab828ba2250e7f0a9c43de6cf127cb560b33517a256a6fb6c52","source":{"kind":"arxiv","id":"2502.01055","version":3},"attestation_state":"computed","paper":{"title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"Haoyu Han, Heng Yang, Jun Ma, Shucheng Kang, Yulin Li","submitted_at":"2025-02-03T05:01:39Z","abstract_excerpt":"Contact-implicit motion planning-embedding contact sequencing as implicit complementarity constraints-holds the promise of leveraging continuous optimization to discover new contact patterns online. Nevertheless, the resulting optimization, being an instance of Mathematical Programming with Complementary Constraints, fails the classical constraint qualifications that are crucial for the convergence of popular numerical solvers. We present robust contact-implicit motion planning with sequential convex programming (CRISP), a solver that departs from the usual primal-dual algorithmic framework bu"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.01055","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-03T05:01:39Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"816ab1c247ae3fd6f9a1fbb68ca935e38f8378f26f93c950b1ac49fd573731f8","abstract_canon_sha256":"631a543af0250f1bb21b3da14ecb24ea3c6206732f68a2310589db1e35f9cb39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:14.866287Z","signature_b64":"LkKpSz1Gp+oagE8k12T5Q4XHy/142iBK9QYhIMEw/hFBFVstOcEs/6AfObipL+o1mevmUnN5LCGZUBED+HwmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48b99280d0cc2ab828ba2250e7f0a9c43de6cf127cb560b33517a256a6fb6c52","last_reissued_at":"2026-07-05T10:54:14.865778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:14.865778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"Haoyu Han, Heng Yang, Jun Ma, Shucheng Kang, Yulin Li","submitted_at":"2025-02-03T05:01:39Z","abstract_excerpt":"Contact-implicit motion planning-embedding contact sequencing as implicit complementarity constraints-holds the promise of leveraging continuous optimization to discover new contact patterns online. Nevertheless, the resulting optimization, being an instance of Mathematical Programming with Complementary Constraints, fails the classical constraint qualifications that are crucial for the convergence of popular numerical solvers. We present robust contact-implicit motion planning with sequential convex programming (CRISP), a solver that departs from the usual primal-dual algorithmic framework bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01055","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.01055/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.01055","created_at":"2026-07-05T10:54:14.865839+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01055v3","created_at":"2026-07-05T10:54:14.865839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01055","created_at":"2026-07-05T10:54:14.865839+00:00"},{"alias_kind":"pith_short_12","alias_value":"JC4ZFAGQZQVL","created_at":"2026-07-05T10:54:14.865839+00:00"},{"alias_kind":"pith_short_16","alias_value":"JC4ZFAGQZQVLQKF2","created_at":"2026-07-05T10:54:14.865839+00:00"},{"alias_kind":"pith_short_8","alias_value":"JC4ZFAGQ","created_at":"2026-07-05T10:54:14.865839+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27972","citing_title":"Simultaneous Contact Selection and Planning for Contact-Rich Manipulation with Cascaded Optimization","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18432","citing_title":"Real-Time Algorithms for Model Predictive Control of Hybrid Dynamical Systems","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JC4ZFAGQZQVLQKF2EJIOP4FJYQ","json":"https://pith.science/pith/JC4ZFAGQZQVLQKF2EJIOP4FJYQ.json","graph_json":"https://pith.science/api/pith-number/JC4ZFAGQZQVLQKF2EJIOP4FJYQ/graph.json","events_json":"https://pith.science/api/pith-number/JC4ZFAGQZQVLQKF2EJIOP4FJYQ/events.json","paper":"https://pith.science/paper/JC4ZFAGQ"},"agent_actions":{"view_html":"https://pith.science/pith/JC4ZFAGQZQVLQKF2EJIOP4FJYQ","download_json":"https://pith.science/pith/JC4ZFAGQZQVLQKF2EJIOP4FJYQ.json","view_paper":"https://pith.science/paper/JC4ZFAGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01055&json=true","fetch_graph":"https://pith.science/api/pith-number/JC4ZFAGQZQVLQKF2EJIOP4FJYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JC4ZFAGQZQVLQKF2EJIOP4FJYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JC4ZFAGQZQVLQKF2EJIOP4FJYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JC4ZFAGQZQVLQKF2EJIOP4FJYQ/action/storage_attestation","attest_author":"https://pith.science/pith/JC4ZFAGQZQVLQKF2EJIOP4FJYQ/action/author_attestation","sign_citation":"https://pith.science/pith/JC4ZFAGQZQVLQKF2EJIOP4FJYQ/action/citation_signature","submit_replication":"https://pith.science/pith/JC4ZFAGQZQVLQKF2EJIOP4FJYQ/action/replication_record"}},"created_at":"2026-07-05T10:54:14.865839+00:00","updated_at":"2026-07-05T10:54:14.865839+00:00"}