{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5KSKRGOW4PRPD27NAU7BRH2EWM","short_pith_number":"pith:5KSKRGOW","canonical_record":{"source":{"id":"1805.09403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-23T19:51:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ce07021ea9632f6b299c5eec866c89162518bc9378f98d33f2e1145915b2af39","abstract_canon_sha256":"8fd764a596709b6daae2e9eb8167fb23fd907d5e3f4ce6ee699430f10cdfc24c"},"schema_version":"1.0"},"canonical_sha256":"eaa4a899d6e3e2f1ebed053e189f44b300ba16b044c318a6e3aedd62071e3032","source":{"kind":"arxiv","id":"1805.09403","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09403","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09403v1","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09403","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"5KSKRGOW4PRP","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5KSKRGOW4PRPD27N","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5KSKRGOW","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5KSKRGOW4PRPD27NAU7BRH2EWM","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-23T19:51:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ce07021ea9632f6b299c5eec866c89162518bc9378f98d33f2e1145915b2af39","abstract_canon_sha256":"8fd764a596709b6daae2e9eb8167fb23fd907d5e3f4ce6ee699430f10cdfc24c"},"schema_version":"1.0"},"canonical_sha256":"eaa4a899d6e3e2f1ebed053e189f44b300ba16b044c318a6e3aedd62071e3032","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:04.098558Z","signature_b64":"kN0YH1+waRFpmsaLcACt2/5urGPW+TAnYY3KQGZYxLiiZAfjZxd+2skmipK/pUiZ7binhqYIFUojKdJpZcfTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaa4a899d6e3e2f1ebed053e189f44b300ba16b044c318a6e3aedd62071e3032","last_reissued_at":"2026-05-18T00:15:04.097791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:04.097791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09403","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:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+y9ZRTk10xsB6MlxFK0DILN6jU6AWmBRzhOLizM72p/VpDJ8+Lk0X/SLQoeOr1dDwsvdkiBKmeJaYHGQwCzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:38:34.316641Z"},"content_sha256":"cd9dd76e0cd619a588753457de754e3957a25cdadfabf914c7cc40817dd377fa","schema_version":"1.0","event_id":"sha256:cd9dd76e0cd619a588753457de754e3957a25cdadfabf914c7cc40817dd377fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5KSKRGOW4PRPD27NAU7BRH2EWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Projection Approach to Equality Constrained Iterative Linear Quadratic Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Jonas Buchli, Markus Giftthaler","submitted_at":"2018-05-23T19:51:18Z","abstract_excerpt":"This paper presents a state and state-input constrained variant of the discrete-time iterative Linear Quadratic Regulator (iLQR) algorithm, with linear time-complexity in the number of time steps. The approach is based on a projection of the control input onto the nullspace of the linearized constraints. We derive a fully constraint-compliant feedforward-feedback control update rule, for which we can solve efficiently with Riccati-style difference equations. We assume that the relative degree of all constraints in the discrete-time system model is equal to one, which often holds for robotics p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09403","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:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQZIyAwgHz2SeJ5CPQzYzzBAwLCxXZdA+rXYEnwaCyiUtNngLl3xtdjdn1wmPp1m+hgHDqg7YZ3mELYByhpaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:38:34.317040Z"},"content_sha256":"6960d292177a0618b2fff9e90c53a3b1b18e219d370ff47fec7a5be7531403ff","schema_version":"1.0","event_id":"sha256:6960d292177a0618b2fff9e90c53a3b1b18e219d370ff47fec7a5be7531403ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KSKRGOW4PRPD27NAU7BRH2EWM/bundle.json","state_url":"https://pith.science/pith/5KSKRGOW4PRPD27NAU7BRH2EWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KSKRGOW4PRPD27NAU7BRH2EWM/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:38:34Z","links":{"resolver":"https://pith.science/pith/5KSKRGOW4PRPD27NAU7BRH2EWM","bundle":"https://pith.science/pith/5KSKRGOW4PRPD27NAU7BRH2EWM/bundle.json","state":"https://pith.science/pith/5KSKRGOW4PRPD27NAU7BRH2EWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KSKRGOW4PRPD27NAU7BRH2EWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5KSKRGOW4PRPD27NAU7BRH2EWM","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":"8fd764a596709b6daae2e9eb8167fb23fd907d5e3f4ce6ee699430f10cdfc24c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-23T19:51:18Z","title_canon_sha256":"ce07021ea9632f6b299c5eec866c89162518bc9378f98d33f2e1145915b2af39"},"schema_version":"1.0","source":{"id":"1805.09403","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09403","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09403v1","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09403","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"5KSKRGOW4PRP","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5KSKRGOW4PRPD27N","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5KSKRGOW","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:6960d292177a0618b2fff9e90c53a3b1b18e219d370ff47fec7a5be7531403ff","target":"graph","created_at":"2026-05-18T00:15:04Z","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 presents a state and state-input constrained variant of the discrete-time iterative Linear Quadratic Regulator (iLQR) algorithm, with linear time-complexity in the number of time steps. The approach is based on a projection of the control input onto the nullspace of the linearized constraints. We derive a fully constraint-compliant feedforward-feedback control update rule, for which we can solve efficiently with Riccati-style difference equations. We assume that the relative degree of all constraints in the discrete-time system model is equal to one, which often holds for robotics p","authors_text":"Jonas Buchli, Markus Giftthaler","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-23T19:51:18Z","title":"A Projection Approach to Equality Constrained Iterative Linear Quadratic Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09403","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:cd9dd76e0cd619a588753457de754e3957a25cdadfabf914c7cc40817dd377fa","target":"record","created_at":"2026-05-18T00:15:04Z","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":"8fd764a596709b6daae2e9eb8167fb23fd907d5e3f4ce6ee699430f10cdfc24c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-23T19:51:18Z","title_canon_sha256":"ce07021ea9632f6b299c5eec866c89162518bc9378f98d33f2e1145915b2af39"},"schema_version":"1.0","source":{"id":"1805.09403","kind":"arxiv","version":1}},"canonical_sha256":"eaa4a899d6e3e2f1ebed053e189f44b300ba16b044c318a6e3aedd62071e3032","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaa4a899d6e3e2f1ebed053e189f44b300ba16b044c318a6e3aedd62071e3032","first_computed_at":"2026-05-18T00:15:04.097791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:04.097791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kN0YH1+waRFpmsaLcACt2/5urGPW+TAnYY3KQGZYxLiiZAfjZxd+2skmipK/pUiZ7binhqYIFUojKdJpZcfTDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:04.098558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09403","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd9dd76e0cd619a588753457de754e3957a25cdadfabf914c7cc40817dd377fa","sha256:6960d292177a0618b2fff9e90c53a3b1b18e219d370ff47fec7a5be7531403ff"],"state_sha256":"054ba9e4305b2260c4f691183ea78bdb141e6b781239413ea6abc466d64f8736"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/uWhj9ru1asIyJuo4EwjQs8H0Ldyxq0S6rQrHWPj2GDy/dzLPA5AAjf3FBMYpaij5wqAZ28QUU3j14sJ34bDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:38:34.321502Z","bundle_sha256":"74cec1d482b19dc3ceb770c3b08b9e151dfb14fef923b7c1335382dcf6253f88"}}