{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SGRNFQU4LMGQ3W3F6PRM2KUWAY","short_pith_number":"pith:SGRNFQU4","schema_version":"1.0","canonical_sha256":"91a2d2c29c5b0d0ddb65f3e2cd2a9606071fabbae185e582bf7d8530ff77c85f","source":{"kind":"arxiv","id":"2402.10312","version":2},"attestation_state":"computed","paper":{"title":"Towards Tight Convex Relaxations for Contact-Rich Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexandre Amice, Bernhard Paus Graesdal, Pablo A. Parrilo, Russ Tedrake, Savva Morozov, Shao Yuan Chew Chia, Tobia Marcucci","submitted_at":"2024-02-15T20:25:28Z","abstract_excerpt":"We present a novel method for global motion planning of robotic systems that interact with the environment through contacts. Our method directly handles the hybrid nature of such tasks using tools from convex optimization. We formulate the motion-planning problem as a shortest-path problem in a graph of convex sets, where a path in the graph corresponds to a contact sequence and a convex set models the quasi-static dynamics within a fixed contact mode. For each contact mode, we use semidefinite programming to relax the nonconvex dynamics that results from the simultaneous optimization of the o"},"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":"2402.10312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-02-15T20:25:28Z","cross_cats_sorted":[],"title_canon_sha256":"ce07d56c88f1d68f4ecbae028bf480e7ce3387e9fff53bf74ece9793055c43b7","abstract_canon_sha256":"30d7d5ef9553c4892650408e8cc9d79e886ebe899959fe118f9ca73607e0eb9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:13.636382Z","signature_b64":"i9gEoq+xbqPBxoj3LxZsDklJgjSVf+trIAWtuDcqcaW6ksUDvOZd6SuLz2WzRWHa9YMvJixBVfs2Jx8HIbzaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91a2d2c29c5b0d0ddb65f3e2cd2a9606071fabbae185e582bf7d8530ff77c85f","last_reissued_at":"2026-07-05T08:40:13.635929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:13.635929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Tight Convex Relaxations for Contact-Rich Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexandre Amice, Bernhard Paus Graesdal, Pablo A. Parrilo, Russ Tedrake, Savva Morozov, Shao Yuan Chew Chia, Tobia Marcucci","submitted_at":"2024-02-15T20:25:28Z","abstract_excerpt":"We present a novel method for global motion planning of robotic systems that interact with the environment through contacts. Our method directly handles the hybrid nature of such tasks using tools from convex optimization. We formulate the motion-planning problem as a shortest-path problem in a graph of convex sets, where a path in the graph corresponds to a contact sequence and a convex set models the quasi-static dynamics within a fixed contact mode. For each contact mode, we use semidefinite programming to relax the nonconvex dynamics that results from the simultaneous optimization of the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10312","kind":"arxiv","version":2},"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/2402.10312/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":"2402.10312","created_at":"2026-07-05T08:40:13.635984+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10312v2","created_at":"2026-07-05T08:40:13.635984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10312","created_at":"2026-07-05T08:40:13.635984+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGRNFQU4LMGQ","created_at":"2026-07-05T08:40:13.635984+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGRNFQU4LMGQ3W3F","created_at":"2026-07-05T08:40:13.635984+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGRNFQU4","created_at":"2026-07-05T08:40:13.635984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12365","citing_title":"Ambient Diffusion Policy: Imitation Learning from Suboptimal Data in Robotics","ref_index":74,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00444","citing_title":"Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets","ref_index":74,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00842","citing_title":"A Framework for Motion Planning with Temporal Logic Precedence Specifications via Augmented Graphs of Convex Sets","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2409.01652","citing_title":"ReKep: Spatio-Temporal Reasoning of Relational Keypoint Constraints for Robotic Manipulation","ref_index":71,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SGRNFQU4LMGQ3W3F6PRM2KUWAY","json":"https://pith.science/pith/SGRNFQU4LMGQ3W3F6PRM2KUWAY.json","graph_json":"https://pith.science/api/pith-number/SGRNFQU4LMGQ3W3F6PRM2KUWAY/graph.json","events_json":"https://pith.science/api/pith-number/SGRNFQU4LMGQ3W3F6PRM2KUWAY/events.json","paper":"https://pith.science/paper/SGRNFQU4"},"agent_actions":{"view_html":"https://pith.science/pith/SGRNFQU4LMGQ3W3F6PRM2KUWAY","download_json":"https://pith.science/pith/SGRNFQU4LMGQ3W3F6PRM2KUWAY.json","view_paper":"https://pith.science/paper/SGRNFQU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10312&json=true","fetch_graph":"https://pith.science/api/pith-number/SGRNFQU4LMGQ3W3F6PRM2KUWAY/graph.json","fetch_events":"https://pith.science/api/pith-number/SGRNFQU4LMGQ3W3F6PRM2KUWAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGRNFQU4LMGQ3W3F6PRM2KUWAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGRNFQU4LMGQ3W3F6PRM2KUWAY/action/storage_attestation","attest_author":"https://pith.science/pith/SGRNFQU4LMGQ3W3F6PRM2KUWAY/action/author_attestation","sign_citation":"https://pith.science/pith/SGRNFQU4LMGQ3W3F6PRM2KUWAY/action/citation_signature","submit_replication":"https://pith.science/pith/SGRNFQU4LMGQ3W3F6PRM2KUWAY/action/replication_record"}},"created_at":"2026-07-05T08:40:13.635984+00:00","updated_at":"2026-07-05T08:40:13.635984+00:00"}