{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JLSZ7ZEUBVWQ6PH3T5WXEYMOG3","short_pith_number":"pith:JLSZ7ZEU","schema_version":"1.0","canonical_sha256":"4ae59fe4940d6d0f3cfb9f6d72618e36f41ce1b9b184474b44053e1a79c0086f","source":{"kind":"arxiv","id":"1909.04947","version":2},"attestation_state":"computed","paper":{"title":"Crocoddyl: An Efficient and Versatile Framework for Multi-Contact Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Bilal Hammoud, Carlos Mastalli, Guilhem Saurel, Justin Carpentier, Ludovic Righetti, Maximilien Naveau, Nicolas Mansard, Rohan Budhiraja, Sethu Vijayakumar, Wolfgang Merkt","submitted_at":"2019-09-11T09:49:02Z","abstract_excerpt":"We introduce Crocoddyl (Contact RObot COntrol by Differential DYnamic Library), an open-source framework tailored for efficient multi-contact optimal control. Crocoddyl efficiently computes the state trajectory and the control policy for a given predefined sequence of contacts. Its efficiency is due to the use of sparse analytical derivatives, exploitation of the problem structure, and data sharing. It employs differential geometry to properly describe the state of any geometrical system, e.g. floating-base systems. Additionally, we propose a novel optimal control algorithm called Feasibility-"},"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":"1909.04947","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-11T09:49:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7f8e09889c7a572f563778bc91c0a67433cb4e1e93689bdf500560f9c3efe667","abstract_canon_sha256":"972c7793f64e199b3cad0aa3343d67b3ff133ad01fecc2e7c85e0e6aa26fae49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:17.519657Z","signature_b64":"s5Nxk0CZaQ87+RTN9/p7HWEbAqT8ea+dwLVPQcB+S3D3mrmxHYv/Qzd0dBmdomLOfg8CsBkGwouXr+UYRc5lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ae59fe4940d6d0f3cfb9f6d72618e36f41ce1b9b184474b44053e1a79c0086f","last_reissued_at":"2026-07-05T00:47:17.519198Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:17.519198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crocoddyl: An Efficient and Versatile Framework for Multi-Contact Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Bilal Hammoud, Carlos Mastalli, Guilhem Saurel, Justin Carpentier, Ludovic Righetti, Maximilien Naveau, Nicolas Mansard, Rohan Budhiraja, Sethu Vijayakumar, Wolfgang Merkt","submitted_at":"2019-09-11T09:49:02Z","abstract_excerpt":"We introduce Crocoddyl (Contact RObot COntrol by Differential DYnamic Library), an open-source framework tailored for efficient multi-contact optimal control. Crocoddyl efficiently computes the state trajectory and the control policy for a given predefined sequence of contacts. Its efficiency is due to the use of sparse analytical derivatives, exploitation of the problem structure, and data sharing. It employs differential geometry to properly describe the state of any geometrical system, e.g. floating-base systems. Additionally, we propose a novel optimal control algorithm called Feasibility-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04947","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/1909.04947/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":"1909.04947","created_at":"2026-07-05T00:47:17.519251+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.04947v2","created_at":"2026-07-05T00:47:17.519251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04947","created_at":"2026-07-05T00:47:17.519251+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLSZ7ZEUBVWQ","created_at":"2026-07-05T00:47:17.519251+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLSZ7ZEUBVWQ6PH3","created_at":"2026-07-05T00:47:17.519251+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLSZ7ZEU","created_at":"2026-07-05T00:47:17.519251+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.06133","citing_title":"Learning-Guided Force-Feedback Model Predictive Control with Obstacle Avoidance for Robotic Deburring","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3","json":"https://pith.science/pith/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3.json","graph_json":"https://pith.science/api/pith-number/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3/graph.json","events_json":"https://pith.science/api/pith-number/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3/events.json","paper":"https://pith.science/paper/JLSZ7ZEU"},"agent_actions":{"view_html":"https://pith.science/pith/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3","download_json":"https://pith.science/pith/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3.json","view_paper":"https://pith.science/paper/JLSZ7ZEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.04947&json=true","fetch_graph":"https://pith.science/api/pith-number/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3/graph.json","fetch_events":"https://pith.science/api/pith-number/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3/action/storage_attestation","attest_author":"https://pith.science/pith/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3/action/author_attestation","sign_citation":"https://pith.science/pith/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3/action/citation_signature","submit_replication":"https://pith.science/pith/JLSZ7ZEUBVWQ6PH3T5WXEYMOG3/action/replication_record"}},"created_at":"2026-07-05T00:47:17.519251+00:00","updated_at":"2026-07-05T00:47:17.519251+00:00"}