{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BWN5OYH7I77F46ZBO7VW2UJH7O","short_pith_number":"pith:BWN5OYH7","canonical_record":{"source":{"id":"1904.07459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-16T04:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"3815b455864d971cb374dc75986c70afcf7914d5172ac65338bcecb3af5777d2","abstract_canon_sha256":"f84127605da13bf9c0e0f00c54f2086dc6e916fde760ca7e5f16fe994661d9c7"},"schema_version":"1.0"},"canonical_sha256":"0d9bd760ff47fe5e7b2177eb6d5127fb93e72abd55ffcdd19493a01d393680d5","source":{"kind":"arxiv","id":"1904.07459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07459","created_at":"2026-05-17T23:48:26Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07459v1","created_at":"2026-05-17T23:48:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07459","created_at":"2026-05-17T23:48:26Z"},{"alias_kind":"pith_short_12","alias_value":"BWN5OYH7I77F","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BWN5OYH7I77F46ZB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BWN5OYH7","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BWN5OYH7I77F46ZBO7VW2UJH7O","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-16T04:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"3815b455864d971cb374dc75986c70afcf7914d5172ac65338bcecb3af5777d2","abstract_canon_sha256":"f84127605da13bf9c0e0f00c54f2086dc6e916fde760ca7e5f16fe994661d9c7"},"schema_version":"1.0"},"canonical_sha256":"0d9bd760ff47fe5e7b2177eb6d5127fb93e72abd55ffcdd19493a01d393680d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:26.196508Z","signature_b64":"sSyyBE7cnoCeMYOpRrIRd3crQ12jWUXP79lFotivCwN/Ygms3hVT6YM5aV8LoV1XLoLNulzncVqEvRNnh7FtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9bd760ff47fe5e7b2177eb6d5127fb93e72abd55ffcdd19493a01d393680d5","last_reissued_at":"2026-05-17T23:48:26.195693Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:26.195693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07459","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:48:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6X/bCnpru4ygRkLxD0tf0PESMBZ53Tt6mpe6waph5U40gFfSI8UDo7P5nh+RnXjiKxDT1oSTt+sK8sk6AuYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:21:23.708760Z"},"content_sha256":"596aa13a8f786d62a6e65da9e0387327938fc5170a4521e678f7d0dc02582bad","schema_version":"1.0","event_id":"sha256:596aa13a8f786d62a6e65da9e0387327938fc5170a4521e678f7d0dc02582bad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BWN5OYH7I77F46ZBO7VW2UJH7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Revised Mehrotra Predictor-Corrector algorithm for Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Khaki Sedigh, Saman Cyrus","submitted_at":"2019-04-16T04:51:02Z","abstract_excerpt":"Input constrained Model predictive control (MPC) includes an optimization problem which should iteratively be solved at each time-instance. The well-known drawback of model predictive control is the computational cost of the optimization problem. This results in restriction of the application of MPC to systems with slow dynamics, e.g., process control systems and small-scale problems. Therefore, implementing fast numerical optimization algorithms has been a point of interest. Interior-point methods are proved to be appropriate algorithms, from computational cost point-of-vie, to solve input-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07459","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:48:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VTrh739QLoZtYkBqAIvTO/mWE2UR1+43n4CWZVlOvC1cozeXSRkCLBjUU3cb/ehNys+yFEjHr618ScFCj1RnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:21:23.709106Z"},"content_sha256":"20d2466e53dbfcaed69bf0c5ab9afe648a0c0c72c0ce6b17ddd5c94792b3da99","schema_version":"1.0","event_id":"sha256:20d2466e53dbfcaed69bf0c5ab9afe648a0c0c72c0ce6b17ddd5c94792b3da99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWN5OYH7I77F46ZBO7VW2UJH7O/bundle.json","state_url":"https://pith.science/pith/BWN5OYH7I77F46ZBO7VW2UJH7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWN5OYH7I77F46ZBO7VW2UJH7O/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-24T10:21:23Z","links":{"resolver":"https://pith.science/pith/BWN5OYH7I77F46ZBO7VW2UJH7O","bundle":"https://pith.science/pith/BWN5OYH7I77F46ZBO7VW2UJH7O/bundle.json","state":"https://pith.science/pith/BWN5OYH7I77F46ZBO7VW2UJH7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWN5OYH7I77F46ZBO7VW2UJH7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BWN5OYH7I77F46ZBO7VW2UJH7O","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":"f84127605da13bf9c0e0f00c54f2086dc6e916fde760ca7e5f16fe994661d9c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-16T04:51:02Z","title_canon_sha256":"3815b455864d971cb374dc75986c70afcf7914d5172ac65338bcecb3af5777d2"},"schema_version":"1.0","source":{"id":"1904.07459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07459","created_at":"2026-05-17T23:48:26Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07459v1","created_at":"2026-05-17T23:48:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07459","created_at":"2026-05-17T23:48:26Z"},{"alias_kind":"pith_short_12","alias_value":"BWN5OYH7I77F","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BWN5OYH7I77F46ZB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BWN5OYH7","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:20d2466e53dbfcaed69bf0c5ab9afe648a0c0c72c0ce6b17ddd5c94792b3da99","target":"graph","created_at":"2026-05-17T23:48:26Z","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":"Input constrained Model predictive control (MPC) includes an optimization problem which should iteratively be solved at each time-instance. The well-known drawback of model predictive control is the computational cost of the optimization problem. This results in restriction of the application of MPC to systems with slow dynamics, e.g., process control systems and small-scale problems. Therefore, implementing fast numerical optimization algorithms has been a point of interest. Interior-point methods are proved to be appropriate algorithms, from computational cost point-of-vie, to solve input-co","authors_text":"Ali Khaki Sedigh, Saman Cyrus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-16T04:51:02Z","title":"A Revised Mehrotra Predictor-Corrector algorithm for Model Predictive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07459","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:596aa13a8f786d62a6e65da9e0387327938fc5170a4521e678f7d0dc02582bad","target":"record","created_at":"2026-05-17T23:48:26Z","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":"f84127605da13bf9c0e0f00c54f2086dc6e916fde760ca7e5f16fe994661d9c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-16T04:51:02Z","title_canon_sha256":"3815b455864d971cb374dc75986c70afcf7914d5172ac65338bcecb3af5777d2"},"schema_version":"1.0","source":{"id":"1904.07459","kind":"arxiv","version":1}},"canonical_sha256":"0d9bd760ff47fe5e7b2177eb6d5127fb93e72abd55ffcdd19493a01d393680d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d9bd760ff47fe5e7b2177eb6d5127fb93e72abd55ffcdd19493a01d393680d5","first_computed_at":"2026-05-17T23:48:26.195693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:26.195693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sSyyBE7cnoCeMYOpRrIRd3crQ12jWUXP79lFotivCwN/Ygms3hVT6YM5aV8LoV1XLoLNulzncVqEvRNnh7FtDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:26.196508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:596aa13a8f786d62a6e65da9e0387327938fc5170a4521e678f7d0dc02582bad","sha256:20d2466e53dbfcaed69bf0c5ab9afe648a0c0c72c0ce6b17ddd5c94792b3da99"],"state_sha256":"da9c83055a577fbcc46564ed947ea1564b9a41e0a5f43f08fa204a92d55137cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmRY0+e9TuXCJeu1+0tvL8/OJurG/VkhO13m8/gtufg+pTE7D2veUqHvSW6LdRgXIaknmIDdsCNJAQRPZF9YAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T10:21:23.711383Z","bundle_sha256":"71eac2337e2fa16eda2edc8f8fac9bb42f10f5320a8b13da10a872ca8f82c3c8"}}