{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5E3G3QIGVNJ2626PB66MWSIX53","short_pith_number":"pith:5E3G3QIG","canonical_record":{"source":{"id":"1710.04029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-10-11T12:11:28Z","cross_cats_sorted":[],"title_canon_sha256":"abf4b1012584dbe60886c155391ea26db3657225875a79272ee7fd118c9b85ad","abstract_canon_sha256":"2ef92cf78468c0e59f51da43b0d9a5dff5bc4e6d3188d4396b983c6636ed9799"},"schema_version":"1.0"},"canonical_sha256":"e9366dc106ab53af6bcf0fbccb4917eec2f6ffb232a13acf8f60ef1f04894a34","source":{"kind":"arxiv","id":"1710.04029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04029","created_at":"2026-05-18T00:24:51Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04029v1","created_at":"2026-05-18T00:24:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04029","created_at":"2026-05-18T00:24:51Z"},{"alias_kind":"pith_short_12","alias_value":"5E3G3QIGVNJ2","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5E3G3QIGVNJ2626P","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5E3G3QIG","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5E3G3QIGVNJ2626PB66MWSIX53","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-10-11T12:11:28Z","cross_cats_sorted":[],"title_canon_sha256":"abf4b1012584dbe60886c155391ea26db3657225875a79272ee7fd118c9b85ad","abstract_canon_sha256":"2ef92cf78468c0e59f51da43b0d9a5dff5bc4e6d3188d4396b983c6636ed9799"},"schema_version":"1.0"},"canonical_sha256":"e9366dc106ab53af6bcf0fbccb4917eec2f6ffb232a13acf8f60ef1f04894a34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:51.137436Z","signature_b64":"y2hu9rbQ+P+cNrsdvwxQeKmhB0sF64v2o1siDvCPce8fNXpoWOrJq612vU8HDu7U16NX0lLgtRr7/L06go5aBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9366dc106ab53af6bcf0fbccb4917eec2f6ffb232a13acf8f60ef1f04894a34","last_reissued_at":"2026-05-18T00:24:51.136743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:51.136743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04029","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:24:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wsDuMGhfo9nEhmkNBFLBkc/7ue9IcDbTatDl/FadeH/rOai2fUGjcHD2vnhNrWA4zNjJj6fQ1+7MOfB6pCplCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:57:18.438158Z"},"content_sha256":"f438d33e8ed687a3c866c42940422ba0af8bb10d2ac0b8ee704ba09f85739cd7","schema_version":"1.0","event_id":"sha256:f438d33e8ed687a3c866c42940422ba0af8bb10d2ac0b8ee704ba09f85739cd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5E3G3QIGVNJ2626PB66MWSIX53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Real-Time Motion Planning of Legged Robots: A Model Predictive Control Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Asutosh Satapathy, Edo Jelavi\\'c, Farbod Farshidian, Jonas Buchli, Markus Giftthaler","submitted_at":"2017-10-11T12:11:28Z","abstract_excerpt":"We introduce a real-time, constrained, nonlinear Model Predictive Control for the motion planning of legged robots. The proposed approach uses a constrained optimal control algorithm known as SLQ. We improve the efficiency of this algorithm by introducing a multi-processing scheme for estimating value function in its backward pass. This pass has been often calculated as a single process. This parallel SLQ algorithm can optimize longer time horizons without proportional increase in its computation time. Thus, our MPC algorithm can generate optimized trajectories for the next few phases of the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04029","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:24:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmrdzOqbEnsKqj1RgqgAa6Cn/VbA8YCKubKYx/QbjUeLnQQlZCFsNvPl7Cc3bhIi+u9D6TQtjfeAZFzcP/VsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:57:18.438888Z"},"content_sha256":"e94fc510363e929e1853e587fdbac7e596b4f6fb6e6a6c97169c76a1a6732640","schema_version":"1.0","event_id":"sha256:e94fc510363e929e1853e587fdbac7e596b4f6fb6e6a6c97169c76a1a6732640"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5E3G3QIGVNJ2626PB66MWSIX53/bundle.json","state_url":"https://pith.science/pith/5E3G3QIGVNJ2626PB66MWSIX53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5E3G3QIGVNJ2626PB66MWSIX53/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T02:57:18Z","links":{"resolver":"https://pith.science/pith/5E3G3QIGVNJ2626PB66MWSIX53","bundle":"https://pith.science/pith/5E3G3QIGVNJ2626PB66MWSIX53/bundle.json","state":"https://pith.science/pith/5E3G3QIGVNJ2626PB66MWSIX53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5E3G3QIGVNJ2626PB66MWSIX53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5E3G3QIGVNJ2626PB66MWSIX53","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2ef92cf78468c0e59f51da43b0d9a5dff5bc4e6d3188d4396b983c6636ed9799","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-10-11T12:11:28Z","title_canon_sha256":"abf4b1012584dbe60886c155391ea26db3657225875a79272ee7fd118c9b85ad"},"schema_version":"1.0","source":{"id":"1710.04029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04029","created_at":"2026-05-18T00:24:51Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04029v1","created_at":"2026-05-18T00:24:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04029","created_at":"2026-05-18T00:24:51Z"},{"alias_kind":"pith_short_12","alias_value":"5E3G3QIGVNJ2","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5E3G3QIGVNJ2626P","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5E3G3QIG","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:e94fc510363e929e1853e587fdbac7e596b4f6fb6e6a6c97169c76a1a6732640","target":"graph","created_at":"2026-05-18T00:24:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We introduce a real-time, constrained, nonlinear Model Predictive Control for the motion planning of legged robots. The proposed approach uses a constrained optimal control algorithm known as SLQ. We improve the efficiency of this algorithm by introducing a multi-processing scheme for estimating value function in its backward pass. This pass has been often calculated as a single process. This parallel SLQ algorithm can optimize longer time horizons without proportional increase in its computation time. Thus, our MPC algorithm can generate optimized trajectories for the next few phases of the m","authors_text":"Asutosh Satapathy, Edo Jelavi\\'c, Farbod Farshidian, Jonas Buchli, Markus Giftthaler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-10-11T12:11:28Z","title":"Real-Time Motion Planning of Legged Robots: A Model Predictive Control Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04029","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f438d33e8ed687a3c866c42940422ba0af8bb10d2ac0b8ee704ba09f85739cd7","target":"record","created_at":"2026-05-18T00:24:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2ef92cf78468c0e59f51da43b0d9a5dff5bc4e6d3188d4396b983c6636ed9799","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-10-11T12:11:28Z","title_canon_sha256":"abf4b1012584dbe60886c155391ea26db3657225875a79272ee7fd118c9b85ad"},"schema_version":"1.0","source":{"id":"1710.04029","kind":"arxiv","version":1}},"canonical_sha256":"e9366dc106ab53af6bcf0fbccb4917eec2f6ffb232a13acf8f60ef1f04894a34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9366dc106ab53af6bcf0fbccb4917eec2f6ffb232a13acf8f60ef1f04894a34","first_computed_at":"2026-05-18T00:24:51.136743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:51.136743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y2hu9rbQ+P+cNrsdvwxQeKmhB0sF64v2o1siDvCPce8fNXpoWOrJq612vU8HDu7U16NX0lLgtRr7/L06go5aBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:51.137436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f438d33e8ed687a3c866c42940422ba0af8bb10d2ac0b8ee704ba09f85739cd7","sha256:e94fc510363e929e1853e587fdbac7e596b4f6fb6e6a6c97169c76a1a6732640"],"state_sha256":"c5bc8c243b6dab0d82222e4e43f2531bb532376c588573b2eb51d86352e39cc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2Vtpm0HNfkPVNc0bHkYRka6epSWf4jsN4aYzBW5q0MCfho4DBv41twulxbkhYTuMSsdMpVhFCrBp4zMr2PVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:57:18.442403Z","bundle_sha256":"2173618607c05623e5f73e167ab488f345ad17a727f24d246b196c56f09409cc"}}