{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SN5YI53N3Q3YCKXLZTUUIHZOOF","short_pith_number":"pith:SN5YI53N","canonical_record":{"source":{"id":"1711.11006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-29T18:30:58Z","cross_cats_sorted":["cs.RO","math.OC"],"title_canon_sha256":"56f28469c23bf82b8ef9f6f370c3e0adf777b61962d7cfb3832fcabba8e5f61e","abstract_canon_sha256":"a3f37f0265c9ef0642d29be1f62a4493939acaac6fecc8b5c7b1279da716a366"},"schema_version":"1.0"},"canonical_sha256":"937b84776ddc37812aebcce9441f2e71581955cb6f45aadfb2d8f2754adb73ec","source":{"kind":"arxiv","id":"1711.11006","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11006","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11006v2","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11006","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"SN5YI53N3Q3Y","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SN5YI53N3Q3YCKXL","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SN5YI53N","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SN5YI53N3Q3YCKXLZTUUIHZOOF","target":"record","payload":{"canonical_record":{"source":{"id":"1711.11006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-29T18:30:58Z","cross_cats_sorted":["cs.RO","math.OC"],"title_canon_sha256":"56f28469c23bf82b8ef9f6f370c3e0adf777b61962d7cfb3832fcabba8e5f61e","abstract_canon_sha256":"a3f37f0265c9ef0642d29be1f62a4493939acaac6fecc8b5c7b1279da716a366"},"schema_version":"1.0"},"canonical_sha256":"937b84776ddc37812aebcce9441f2e71581955cb6f45aadfb2d8f2754adb73ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:22.085251Z","signature_b64":"BE2dlm7HsCNxfCRdNHm+q3FAuOz/jdiK+gelLGPFgkajJvsyQmFHGnWp3ngt2yN00qQ77eHW8pGIX9oQo4xjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"937b84776ddc37812aebcce9441f2e71581955cb6f45aadfb2d8f2754adb73ec","last_reissued_at":"2026-05-18T00:28:22.084607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:22.084607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.11006","source_version":2,"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:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z69W/97mW8yn0GK5Llc1PA7aNJwRBZm5sRhpq7Wn+O44ZTCWRT/SIXrfGIq37AL2mm75gZNEa2YGH1AjAkcTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:11:05.717429Z"},"content_sha256":"37d26174f51e4158a090bd90b8bce67ffad9a2be7128e98f56f668951d7f5886","schema_version":"1.0","event_id":"sha256:37d26174f51e4158a090bd90b8bce67ffad9a2be7128e98f56f668951d7f5886"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SN5YI53N3Q3YCKXLZTUUIHZOOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Family of Iterative Gauss-Newton Shooting Methods for Nonlinear Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","math.OC"],"primary_cat":"cs.SY","authors_text":"Jonas Buchli, Markus Giftthaler, Markus St\\\"auble, Michael Neunert, Moritz Diehl","submitted_at":"2017-11-29T18:30:58Z","abstract_excerpt":"This paper introduces a family of iterative algorithms for unconstrained nonlinear optimal control. We generalize the well-known iLQR algorithm to different multiple-shooting variants, combining advantages like straight-forward initialization and a closed-loop forward integration. All algorithms have similar computational complexity, i.e. linear complexity in the time horizon, and can be derived in the same computational framework. We compare the full-step variants of our algorithms and present several simulation examples, including a high-dimensional underactuated robot subject to contact swi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11006","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":""},"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:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8bgPQgYavuBYwSa5oJVqoxEsAZqnH6G2xio7B9L0nF75HnQYzsNDOXaPbGvnfcifbVVbcg29Fnxu+vx9z91DCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:11:05.717984Z"},"content_sha256":"f525fc62e3bf87628030c77b26d2c1d0b87636a61dcbc14ce0d9d790ea84fdce","schema_version":"1.0","event_id":"sha256:f525fc62e3bf87628030c77b26d2c1d0b87636a61dcbc14ce0d9d790ea84fdce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SN5YI53N3Q3YCKXLZTUUIHZOOF/bundle.json","state_url":"https://pith.science/pith/SN5YI53N3Q3YCKXLZTUUIHZOOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SN5YI53N3Q3YCKXLZTUUIHZOOF/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-01T21:11:05Z","links":{"resolver":"https://pith.science/pith/SN5YI53N3Q3YCKXLZTUUIHZOOF","bundle":"https://pith.science/pith/SN5YI53N3Q3YCKXLZTUUIHZOOF/bundle.json","state":"https://pith.science/pith/SN5YI53N3Q3YCKXLZTUUIHZOOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SN5YI53N3Q3YCKXLZTUUIHZOOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SN5YI53N3Q3YCKXLZTUUIHZOOF","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":"a3f37f0265c9ef0642d29be1f62a4493939acaac6fecc8b5c7b1279da716a366","cross_cats_sorted":["cs.RO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-29T18:30:58Z","title_canon_sha256":"56f28469c23bf82b8ef9f6f370c3e0adf777b61962d7cfb3832fcabba8e5f61e"},"schema_version":"1.0","source":{"id":"1711.11006","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11006","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11006v2","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11006","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"SN5YI53N3Q3Y","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SN5YI53N3Q3YCKXL","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SN5YI53N","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:f525fc62e3bf87628030c77b26d2c1d0b87636a61dcbc14ce0d9d790ea84fdce","target":"graph","created_at":"2026-05-18T00:28:22Z","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":"This paper introduces a family of iterative algorithms for unconstrained nonlinear optimal control. We generalize the well-known iLQR algorithm to different multiple-shooting variants, combining advantages like straight-forward initialization and a closed-loop forward integration. All algorithms have similar computational complexity, i.e. linear complexity in the time horizon, and can be derived in the same computational framework. We compare the full-step variants of our algorithms and present several simulation examples, including a high-dimensional underactuated robot subject to contact swi","authors_text":"Jonas Buchli, Markus Giftthaler, Markus St\\\"auble, Michael Neunert, Moritz Diehl","cross_cats":["cs.RO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-29T18:30:58Z","title":"A Family of Iterative Gauss-Newton Shooting Methods for Nonlinear Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11006","kind":"arxiv","version":2},"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:37d26174f51e4158a090bd90b8bce67ffad9a2be7128e98f56f668951d7f5886","target":"record","created_at":"2026-05-18T00:28:22Z","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":"a3f37f0265c9ef0642d29be1f62a4493939acaac6fecc8b5c7b1279da716a366","cross_cats_sorted":["cs.RO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-29T18:30:58Z","title_canon_sha256":"56f28469c23bf82b8ef9f6f370c3e0adf777b61962d7cfb3832fcabba8e5f61e"},"schema_version":"1.0","source":{"id":"1711.11006","kind":"arxiv","version":2}},"canonical_sha256":"937b84776ddc37812aebcce9441f2e71581955cb6f45aadfb2d8f2754adb73ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"937b84776ddc37812aebcce9441f2e71581955cb6f45aadfb2d8f2754adb73ec","first_computed_at":"2026-05-18T00:28:22.084607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:22.084607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BE2dlm7HsCNxfCRdNHm+q3FAuOz/jdiK+gelLGPFgkajJvsyQmFHGnWp3ngt2yN00qQ77eHW8pGIX9oQo4xjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:22.085251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.11006","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37d26174f51e4158a090bd90b8bce67ffad9a2be7128e98f56f668951d7f5886","sha256:f525fc62e3bf87628030c77b26d2c1d0b87636a61dcbc14ce0d9d790ea84fdce"],"state_sha256":"8ec9c26424041163ea273c77ea8b90e9e7ff7f0155506304d24286525e942f91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fiv6NyK/Q1EYP9k1BuXdb1lkTZ7fzm4vvf9TJzzJiBZTVb8cHwVUkwc266htVEv1H+j8Njw0maPsqDhYLT3qCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:11:05.720717Z","bundle_sha256":"4fb3933ad3bf43ae39fa1609f906a3b4b043774b3b53752c8318c54b0013d0d9"}}