{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KELTG54RJ77SLFHCAPF3HF4YSM","short_pith_number":"pith:KELTG54R","schema_version":"1.0","canonical_sha256":"51173377914fff2594e203cbb3979893031f0c9466a2941f3bb07115613cecbd","source":{"kind":"arxiv","id":"2107.05616","version":3},"attestation_state":"computed","paper":{"title":"Fast Contact-Implicit Model-Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Arun Bishop, Chi-Yen Lee, John Zhang, Mac Schwager, Shuo Yang, Simon Le Cleac'h, Taylor Howell, Zachary Manchester","submitted_at":"2021-07-12T17:52:40Z","abstract_excerpt":"We present a general approach for controlling robotic systems that make and break contact with their environments. Contact-implicit model predictive control (CI-MPC) generalizes linear MPC to contact-rich settings by utilizing a bi-level planning formulation with lower-level contact dynamics formulated as time-varying linear complementarity problems (LCPs) computed using strategic Taylor approximations about a reference trajectory. These dynamics enable the upper-level planning problem to reason about contact timing and forces, and generate entirely new contact-mode sequences online. To achiev"},"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":"2107.05616","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-07-12T17:52:40Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"253ff1b86f8b528d767138be0bee425351fbd58ac0b4428b046b82c80203abec","abstract_canon_sha256":"b5cac6b7d0fea3e98751716ae870a2a8678cbbf61468704107df64eedc467019"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:30:59.795960Z","signature_b64":"c3I4YLw+fY0ypDN2se0yIrMyx5AeJc5ZUrK7JNad8XjpfRNh5t8aH/HxRuQX6RLscwUsM4prH2xnLcMCKN7PBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51173377914fff2594e203cbb3979893031f0c9466a2941f3bb07115613cecbd","last_reissued_at":"2026-07-05T05:30:59.795518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:30:59.795518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Contact-Implicit Model-Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Arun Bishop, Chi-Yen Lee, John Zhang, Mac Schwager, Shuo Yang, Simon Le Cleac'h, Taylor Howell, Zachary Manchester","submitted_at":"2021-07-12T17:52:40Z","abstract_excerpt":"We present a general approach for controlling robotic systems that make and break contact with their environments. Contact-implicit model predictive control (CI-MPC) generalizes linear MPC to contact-rich settings by utilizing a bi-level planning formulation with lower-level contact dynamics formulated as time-varying linear complementarity problems (LCPs) computed using strategic Taylor approximations about a reference trajectory. These dynamics enable the upper-level planning problem to reason about contact timing and forces, and generate entirely new contact-mode sequences online. To achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.05616","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/2107.05616/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":"2107.05616","created_at":"2026-07-05T05:30:59.795575+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.05616v3","created_at":"2026-07-05T05:30:59.795575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.05616","created_at":"2026-07-05T05:30:59.795575+00:00"},{"alias_kind":"pith_short_12","alias_value":"KELTG54RJ77S","created_at":"2026-07-05T05:30:59.795575+00:00"},{"alias_kind":"pith_short_16","alias_value":"KELTG54RJ77SLFHC","created_at":"2026-07-05T05:30:59.795575+00:00"},{"alias_kind":"pith_short_8","alias_value":"KELTG54R","created_at":"2026-07-05T05:30:59.795575+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.13350","citing_title":"Approximating Global Contact-Implicit MPC via Sampling and Local Complementarity","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KELTG54RJ77SLFHCAPF3HF4YSM","json":"https://pith.science/pith/KELTG54RJ77SLFHCAPF3HF4YSM.json","graph_json":"https://pith.science/api/pith-number/KELTG54RJ77SLFHCAPF3HF4YSM/graph.json","events_json":"https://pith.science/api/pith-number/KELTG54RJ77SLFHCAPF3HF4YSM/events.json","paper":"https://pith.science/paper/KELTG54R"},"agent_actions":{"view_html":"https://pith.science/pith/KELTG54RJ77SLFHCAPF3HF4YSM","download_json":"https://pith.science/pith/KELTG54RJ77SLFHCAPF3HF4YSM.json","view_paper":"https://pith.science/paper/KELTG54R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.05616&json=true","fetch_graph":"https://pith.science/api/pith-number/KELTG54RJ77SLFHCAPF3HF4YSM/graph.json","fetch_events":"https://pith.science/api/pith-number/KELTG54RJ77SLFHCAPF3HF4YSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KELTG54RJ77SLFHCAPF3HF4YSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KELTG54RJ77SLFHCAPF3HF4YSM/action/storage_attestation","attest_author":"https://pith.science/pith/KELTG54RJ77SLFHCAPF3HF4YSM/action/author_attestation","sign_citation":"https://pith.science/pith/KELTG54RJ77SLFHCAPF3HF4YSM/action/citation_signature","submit_replication":"https://pith.science/pith/KELTG54RJ77SLFHCAPF3HF4YSM/action/replication_record"}},"created_at":"2026-07-05T05:30:59.795575+00:00","updated_at":"2026-07-05T05:30:59.795575+00:00"}