{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LUXNUXHGOYOMRLXOK4FS6BYV42","short_pith_number":"pith:LUXNUXHG","canonical_record":{"source":{"id":"1903.07648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-18T18:18:33Z","cross_cats_sorted":[],"title_canon_sha256":"9651ab7df93761ae56ccce93f58f727f3b96b3d17e8e3c2f08ba085bb8f4b21f","abstract_canon_sha256":"cc1628e52f574e858acf0fab8c0bb75221ea5fa3f9a240a17455d0f5c8461d0a"},"schema_version":"1.0"},"canonical_sha256":"5d2eda5ce6761cc8aeee570b2f0715e6a306af6e2d9b1e73b15dfc08815f4f01","source":{"kind":"arxiv","id":"1903.07648","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07648","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07648v1","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07648","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"pith_short_12","alias_value":"LUXNUXHGOYOM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LUXNUXHGOYOMRLXO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LUXNUXHG","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LUXNUXHGOYOMRLXOK4FS6BYV42","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-18T18:18:33Z","cross_cats_sorted":[],"title_canon_sha256":"9651ab7df93761ae56ccce93f58f727f3b96b3d17e8e3c2f08ba085bb8f4b21f","abstract_canon_sha256":"cc1628e52f574e858acf0fab8c0bb75221ea5fa3f9a240a17455d0f5c8461d0a"},"schema_version":"1.0"},"canonical_sha256":"5d2eda5ce6761cc8aeee570b2f0715e6a306af6e2d9b1e73b15dfc08815f4f01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:54.486474Z","signature_b64":"QRVD+CCnTagaMWwfYIvR1zQhOgp3IzH0bubRKDX6neefpO4Gar+y1xt6uXVZhuZpng34HtNn4rTcWcl4HfFTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d2eda5ce6761cc8aeee570b2f0715e6a306af6e2d9b1e73b15dfc08815f4f01","last_reissued_at":"2026-05-17T23:50:54.485774Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:54.485774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07648","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-17T23:50:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/ckmyj+tHXTQO5DuOsNkwmjP1huG2qzZ1TgNRpFZkvxn6AMMaG244gMK0DD2sl5kEKoZ6T7GRQ3/JcBp9MyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:01:56.575092Z"},"content_sha256":"09a132ac6878d01f2add55eb836bd120f237f2a77f6ad3c69f941fd37d1bdb6c","schema_version":"1.0","event_id":"sha256:09a132ac6878d01f2add55eb836bd120f237f2a77f6ad3c69f941fd37d1bdb6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LUXNUXHGOYOMRLXOK4FS6BYV42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Method for Reducing the Complexity of Model Predictive Control in Robotics Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Michael Muehlebach, Raffaello D'Andrea","submitted_at":"2019-03-18T18:18:33Z","abstract_excerpt":"This article describes an approach for parametrizing input and state trajectories in model predictive control. The parametrization is designed to be invariant to time shifts, which enables warm-starting the successive optimization problems and reduces the computational complexity of the online optimization. It is shown that in certain cases (e.g. for linear time-invariant dynamics with input and state constraints) the parametrization leads to inherent stability and recursive feasibility guarantees without additional terminal set constraints. Due to the fact that the number of decision variable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07648","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-17T23:50:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"13SiKccRRU1zF4X6P5W9zbmRabyzJyMOXUFQWgZCjv8ZhM3JMated5ytoM1LQlk1zBQMmGVwmO20B1kUS4FXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:01:56.575712Z"},"content_sha256":"0c004a169796e39cb0a3f1d5752179efd1dda69f42cae2b43325529ec1f22802","schema_version":"1.0","event_id":"sha256:0c004a169796e39cb0a3f1d5752179efd1dda69f42cae2b43325529ec1f22802"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUXNUXHGOYOMRLXOK4FS6BYV42/bundle.json","state_url":"https://pith.science/pith/LUXNUXHGOYOMRLXOK4FS6BYV42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUXNUXHGOYOMRLXOK4FS6BYV42/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-05-20T00:01:56Z","links":{"resolver":"https://pith.science/pith/LUXNUXHGOYOMRLXOK4FS6BYV42","bundle":"https://pith.science/pith/LUXNUXHGOYOMRLXOK4FS6BYV42/bundle.json","state":"https://pith.science/pith/LUXNUXHGOYOMRLXOK4FS6BYV42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUXNUXHGOYOMRLXOK4FS6BYV42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LUXNUXHGOYOMRLXOK4FS6BYV42","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":"cc1628e52f574e858acf0fab8c0bb75221ea5fa3f9a240a17455d0f5c8461d0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-18T18:18:33Z","title_canon_sha256":"9651ab7df93761ae56ccce93f58f727f3b96b3d17e8e3c2f08ba085bb8f4b21f"},"schema_version":"1.0","source":{"id":"1903.07648","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07648","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07648v1","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07648","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"pith_short_12","alias_value":"LUXNUXHGOYOM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LUXNUXHGOYOMRLXO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LUXNUXHG","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:0c004a169796e39cb0a3f1d5752179efd1dda69f42cae2b43325529ec1f22802","target":"graph","created_at":"2026-05-17T23:50:54Z","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 article describes an approach for parametrizing input and state trajectories in model predictive control. The parametrization is designed to be invariant to time shifts, which enables warm-starting the successive optimization problems and reduces the computational complexity of the online optimization. It is shown that in certain cases (e.g. for linear time-invariant dynamics with input and state constraints) the parametrization leads to inherent stability and recursive feasibility guarantees without additional terminal set constraints. Due to the fact that the number of decision variable","authors_text":"Michael Muehlebach, Raffaello D'Andrea","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-18T18:18:33Z","title":"A Method for Reducing the Complexity of Model Predictive Control in Robotics Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07648","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:09a132ac6878d01f2add55eb836bd120f237f2a77f6ad3c69f941fd37d1bdb6c","target":"record","created_at":"2026-05-17T23:50:54Z","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":"cc1628e52f574e858acf0fab8c0bb75221ea5fa3f9a240a17455d0f5c8461d0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-18T18:18:33Z","title_canon_sha256":"9651ab7df93761ae56ccce93f58f727f3b96b3d17e8e3c2f08ba085bb8f4b21f"},"schema_version":"1.0","source":{"id":"1903.07648","kind":"arxiv","version":1}},"canonical_sha256":"5d2eda5ce6761cc8aeee570b2f0715e6a306af6e2d9b1e73b15dfc08815f4f01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d2eda5ce6761cc8aeee570b2f0715e6a306af6e2d9b1e73b15dfc08815f4f01","first_computed_at":"2026-05-17T23:50:54.485774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:54.485774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QRVD+CCnTagaMWwfYIvR1zQhOgp3IzH0bubRKDX6neefpO4Gar+y1xt6uXVZhuZpng34HtNn4rTcWcl4HfFTAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:54.486474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07648","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09a132ac6878d01f2add55eb836bd120f237f2a77f6ad3c69f941fd37d1bdb6c","sha256:0c004a169796e39cb0a3f1d5752179efd1dda69f42cae2b43325529ec1f22802"],"state_sha256":"e85f2e676c93ac76cd996c6e74cabd966ab727cec179a2a645b932b547fdc270"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JkBffIztvIip1CCtWjo/e4TkAPwxocszP5Ga2hhA0uJxri038WkpdKQIbiVEEUX5Oj0BC1bFZmpYLaWv9stLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T00:01:56.579969Z","bundle_sha256":"1869106d9b60ca711fef40477d7c61c4216f883836db25427b3a658a08c20252"}}