{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7O7JRVKJBPHFI3IH4OYLWFD6CS","short_pith_number":"pith:7O7JRVKJ","schema_version":"1.0","canonical_sha256":"fbbe98d5490bce546d07e3b0bb147e1498a1ac0baaec99bc1a8a0c1b2fd9e7ba","source":{"kind":"arxiv","id":"2209.01117","version":1},"attestation_state":"computed","paper":{"title":"Differentiable Optimal Control via Differential Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Carlos Mastalli, Sethu Vijayakumar, Steve Tonneau, Traiko Dinev, Vladimir Ivan","submitted_at":"2022-09-02T15:24:54Z","abstract_excerpt":"Robot design optimization, imitation learning and system identification share a common problem which requires optimization over robot or task parameters at the same time as optimizing the robot motion. To solve these problems, we can use differentiable optimal control for which the gradients of the robot's motion with respect to the parameters are required. We propose a method to efficiently compute these gradients analytically via the differential dynamic programming (DDP) algorithm using sensitivity analysis (SA). We show that we must include second-order dynamics terms when computing the gr"},"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":"2209.01117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-09-02T15:24:54Z","cross_cats_sorted":[],"title_canon_sha256":"ae672cabf684da285b1986b5a9cd4d834812074fc010cc78461c95af7f46ced9","abstract_canon_sha256":"ac9cbe27d88d1083e1fd1a12af36b6d6cc702c018e9bfe509268641f86c06c3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:54:08.749192Z","signature_b64":"OMiEnUkhizZ3uBf7ap8vnZUCfzQ2EBZfomETZLHepbHQq92M2sM8GChNqr5RHCDNhKBbAnGPl31P1h8cdVXKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbbe98d5490bce546d07e3b0bb147e1498a1ac0baaec99bc1a8a0c1b2fd9e7ba","last_reissued_at":"2026-07-05T04:54:08.748799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:54:08.748799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentiable Optimal Control via Differential Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Carlos Mastalli, Sethu Vijayakumar, Steve Tonneau, Traiko Dinev, Vladimir Ivan","submitted_at":"2022-09-02T15:24:54Z","abstract_excerpt":"Robot design optimization, imitation learning and system identification share a common problem which requires optimization over robot or task parameters at the same time as optimizing the robot motion. To solve these problems, we can use differentiable optimal control for which the gradients of the robot's motion with respect to the parameters are required. We propose a method to efficiently compute these gradients analytically via the differential dynamic programming (DDP) algorithm using sensitivity analysis (SA). We show that we must include second-order dynamics terms when computing the gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.01117","kind":"arxiv","version":1},"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/2209.01117/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":"2209.01117","created_at":"2026-07-05T04:54:08.748855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.01117v1","created_at":"2026-07-05T04:54:08.748855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01117","created_at":"2026-07-05T04:54:08.748855+00:00"},{"alias_kind":"pith_short_12","alias_value":"7O7JRVKJBPHF","created_at":"2026-07-05T04:54:08.748855+00:00"},{"alias_kind":"pith_short_16","alias_value":"7O7JRVKJBPHFI3IH","created_at":"2026-07-05T04:54:08.748855+00:00"},{"alias_kind":"pith_short_8","alias_value":"7O7JRVKJ","created_at":"2026-07-05T04:54:08.748855+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7O7JRVKJBPHFI3IH4OYLWFD6CS","json":"https://pith.science/pith/7O7JRVKJBPHFI3IH4OYLWFD6CS.json","graph_json":"https://pith.science/api/pith-number/7O7JRVKJBPHFI3IH4OYLWFD6CS/graph.json","events_json":"https://pith.science/api/pith-number/7O7JRVKJBPHFI3IH4OYLWFD6CS/events.json","paper":"https://pith.science/paper/7O7JRVKJ"},"agent_actions":{"view_html":"https://pith.science/pith/7O7JRVKJBPHFI3IH4OYLWFD6CS","download_json":"https://pith.science/pith/7O7JRVKJBPHFI3IH4OYLWFD6CS.json","view_paper":"https://pith.science/paper/7O7JRVKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.01117&json=true","fetch_graph":"https://pith.science/api/pith-number/7O7JRVKJBPHFI3IH4OYLWFD6CS/graph.json","fetch_events":"https://pith.science/api/pith-number/7O7JRVKJBPHFI3IH4OYLWFD6CS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7O7JRVKJBPHFI3IH4OYLWFD6CS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7O7JRVKJBPHFI3IH4OYLWFD6CS/action/storage_attestation","attest_author":"https://pith.science/pith/7O7JRVKJBPHFI3IH4OYLWFD6CS/action/author_attestation","sign_citation":"https://pith.science/pith/7O7JRVKJBPHFI3IH4OYLWFD6CS/action/citation_signature","submit_replication":"https://pith.science/pith/7O7JRVKJBPHFI3IH4OYLWFD6CS/action/replication_record"}},"created_at":"2026-07-05T04:54:08.748855+00:00","updated_at":"2026-07-05T04:54:08.748855+00:00"}