{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:UTTZX5HJQ73SP3NOOVTDCW7L6B","short_pith_number":"pith:UTTZX5HJ","canonical_record":{"source":{"id":"2305.03820","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-05T19:48:34Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"be3ab24e5633e0ecfbaea151b7be772d47c49ec89e52b017c09c71f4ffd12561","abstract_canon_sha256":"2ac07a5aa4930b07a14f749dc1259f0184f65596266cc7aa644c0508fd493ecc"},"schema_version":"1.0"},"canonical_sha256":"a4e79bf4e987f727edae7566315bebf05779930240d56f8288f92dc2f08dcd66","source":{"kind":"arxiv","id":"2305.03820","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.03820","created_at":"2026-07-05T07:54:00Z"},{"alias_kind":"arxiv_version","alias_value":"2305.03820v2","created_at":"2026-07-05T07:54:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.03820","created_at":"2026-07-05T07:54:00Z"},{"alias_kind":"pith_short_12","alias_value":"UTTZX5HJQ73S","created_at":"2026-07-05T07:54:00Z"},{"alias_kind":"pith_short_16","alias_value":"UTTZX5HJQ73SP3NO","created_at":"2026-07-05T07:54:00Z"},{"alias_kind":"pith_short_8","alias_value":"UTTZX5HJ","created_at":"2026-07-05T07:54:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:UTTZX5HJQ73SP3NOOVTDCW7L6B","target":"record","payload":{"canonical_record":{"source":{"id":"2305.03820","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-05T19:48:34Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"be3ab24e5633e0ecfbaea151b7be772d47c49ec89e52b017c09c71f4ffd12561","abstract_canon_sha256":"2ac07a5aa4930b07a14f749dc1259f0184f65596266cc7aa644c0508fd493ecc"},"schema_version":"1.0"},"canonical_sha256":"a4e79bf4e987f727edae7566315bebf05779930240d56f8288f92dc2f08dcd66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:00.767180Z","signature_b64":"poZMRdjE9nnaSzR/LmHzvM3vefFDzsvR7g7psE9NT8Vpom6hOzbeizAkaAlIn+uVC2DG2omTrd5DFLwIzM86Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4e79bf4e987f727edae7566315bebf05779930240d56f8288f92dc2f08dcd66","last_reissued_at":"2026-07-05T07:54:00.766757Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:00.766757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.03820","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-07-05T07:54:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xm8+ZSyLQTlX5GpBwHANYFhBFNWi7k2ynM0glGUgVLNmqIJY+FM4gzWp2u+717bw1sxWSHQrh0cuGdixbaJmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:09:28.383657Z"},"content_sha256":"38ff3a9662bc0afe043219b93fcbc7370446cb3e7fda76b00bbb0107e8145d41","schema_version":"1.0","event_id":"sha256:38ff3a9662bc0afe043219b93fcbc7370446cb3e7fda76b00bbb0107e8145d41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:UTTZX5HJQ73SP3NOOVTDCW7L6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling Model Predictive Control: A Category Theoretic Framework for Multistage Control Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"math.OC","authors_text":"Baike She, Evan Patterson, James Fairbanks, Matthew Hale, Matthew Klawonn, Tyler Hanks","submitted_at":"2023-05-05T19:48:34Z","abstract_excerpt":"Model predictive control (MPC) is an optimal control technique which involves solving a sequence of constrained optimization problems across a given time horizon. In this paper, we introduce a category theoretic framework for constructing complex MPC problem formulations by composing subproblems. Specifically, we construct a monoidal category - called Para(Conv) - whose objects are Euclidean spaces and whose morphisms represent constrained convex optimization problems. We then show that the multistage structure of typical MPC problems arises from sequential composition in Para(Conv), while par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.03820","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.03820/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:54:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwV/XfBWZs6LF7cOkbBfMda9JR0Fsdz0xkktKpUETWQ2zz0w2q/RI0Fp83k/gzkoTXeI6EmCziYgpTcY8c/6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:09:28.384036Z"},"content_sha256":"ff181fc1c322dba1416dac5da5e38212d5ac8b971de183b9e2dd4cb00bee6906","schema_version":"1.0","event_id":"sha256:ff181fc1c322dba1416dac5da5e38212d5ac8b971de183b9e2dd4cb00bee6906"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTTZX5HJQ73SP3NOOVTDCW7L6B/bundle.json","state_url":"https://pith.science/pith/UTTZX5HJQ73SP3NOOVTDCW7L6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTTZX5HJQ73SP3NOOVTDCW7L6B/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-08-19T18:09:28Z","links":{"resolver":"https://pith.science/pith/UTTZX5HJQ73SP3NOOVTDCW7L6B","bundle":"https://pith.science/pith/UTTZX5HJQ73SP3NOOVTDCW7L6B/bundle.json","state":"https://pith.science/pith/UTTZX5HJQ73SP3NOOVTDCW7L6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTTZX5HJQ73SP3NOOVTDCW7L6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:UTTZX5HJQ73SP3NOOVTDCW7L6B","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":"2ac07a5aa4930b07a14f749dc1259f0184f65596266cc7aa644c0508fd493ecc","cross_cats_sorted":["math.CT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-05T19:48:34Z","title_canon_sha256":"be3ab24e5633e0ecfbaea151b7be772d47c49ec89e52b017c09c71f4ffd12561"},"schema_version":"1.0","source":{"id":"2305.03820","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.03820","created_at":"2026-07-05T07:54:00Z"},{"alias_kind":"arxiv_version","alias_value":"2305.03820v2","created_at":"2026-07-05T07:54:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.03820","created_at":"2026-07-05T07:54:00Z"},{"alias_kind":"pith_short_12","alias_value":"UTTZX5HJQ73S","created_at":"2026-07-05T07:54:00Z"},{"alias_kind":"pith_short_16","alias_value":"UTTZX5HJQ73SP3NO","created_at":"2026-07-05T07:54:00Z"},{"alias_kind":"pith_short_8","alias_value":"UTTZX5HJ","created_at":"2026-07-05T07:54:00Z"}],"graph_snapshots":[{"event_id":"sha256:ff181fc1c322dba1416dac5da5e38212d5ac8b971de183b9e2dd4cb00bee6906","target":"graph","created_at":"2026-07-05T07:54:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.03820/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Model predictive control (MPC) is an optimal control technique which involves solving a sequence of constrained optimization problems across a given time horizon. In this paper, we introduce a category theoretic framework for constructing complex MPC problem formulations by composing subproblems. Specifically, we construct a monoidal category - called Para(Conv) - whose objects are Euclidean spaces and whose morphisms represent constrained convex optimization problems. We then show that the multistage structure of typical MPC problems arises from sequential composition in Para(Conv), while par","authors_text":"Baike She, Evan Patterson, James Fairbanks, Matthew Hale, Matthew Klawonn, Tyler Hanks","cross_cats":["math.CT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-05T19:48:34Z","title":"Modeling Model Predictive Control: A Category Theoretic Framework for Multistage Control Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.03820","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:38ff3a9662bc0afe043219b93fcbc7370446cb3e7fda76b00bbb0107e8145d41","target":"record","created_at":"2026-07-05T07:54:00Z","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":"2ac07a5aa4930b07a14f749dc1259f0184f65596266cc7aa644c0508fd493ecc","cross_cats_sorted":["math.CT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-05T19:48:34Z","title_canon_sha256":"be3ab24e5633e0ecfbaea151b7be772d47c49ec89e52b017c09c71f4ffd12561"},"schema_version":"1.0","source":{"id":"2305.03820","kind":"arxiv","version":2}},"canonical_sha256":"a4e79bf4e987f727edae7566315bebf05779930240d56f8288f92dc2f08dcd66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4e79bf4e987f727edae7566315bebf05779930240d56f8288f92dc2f08dcd66","first_computed_at":"2026-07-05T07:54:00.766757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:54:00.766757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"poZMRdjE9nnaSzR/LmHzvM3vefFDzsvR7g7psE9NT8Vpom6hOzbeizAkaAlIn+uVC2DG2omTrd5DFLwIzM86Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:54:00.767180Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.03820","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38ff3a9662bc0afe043219b93fcbc7370446cb3e7fda76b00bbb0107e8145d41","sha256:ff181fc1c322dba1416dac5da5e38212d5ac8b971de183b9e2dd4cb00bee6906"],"state_sha256":"12fe70270488997d9af73de517e597b9ed494715f9047477ab6b20205983247a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/n1AyK2Aige8cY8S3UeGzC/Ne+sT/75+GAJmms4q7IdnWAOivKDf8pLqYoZwVX60vm4uDvOcQNBCMQ/ayRbzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T18:09:28.386435Z","bundle_sha256":"0347bab73e05c374b14fac1a986a2315cca8480f7998a5a003bbafe59c39925f"}}