{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7J336OUIZJL6WGGLXO562KP6YJ","short_pith_number":"pith:7J336OUI","schema_version":"1.0","canonical_sha256":"fa77bf3a88ca57eb18cbbbbbed29fec27645356debc72056a0f57f256405d830","source":{"kind":"arxiv","id":"1702.06375","version":2},"attestation_state":"computed","paper":{"title":"Scalable computation for optimal control of cascade systems with constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Eric C. Kerrigan, Farhad Farokhi, Iman Shames, Michael Cantoni","submitted_at":"2017-02-21T13:29:30Z","abstract_excerpt":"A method is devised for numerically solving a class of finite-horizon optimal control problems subject to cascade linear discrete-time dynamics. It is assumed that the linear state and input inequality constraints, and the quadratic measure of performance, are all separable with respect to the spatial dimension of the underlying cascade of sub-systems, as well as the temporal dimension of the dynamics. By virtue of this structure, the computation cost of an interior-point method for an equivalent quadratic programming formulation of the optimal control problem can be made to scale linearly wit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.06375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-21T13:29:30Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"85dbf53222a4fe5e36fb7b3ce434fc2b55e82437f48ba10f50975bdd321f7951","abstract_canon_sha256":"e07c05e33026164b9e468dd099977d5a1150c68cd81cf7d71a9572fe5dcdee1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:02.203152Z","signature_b64":"cSPOGAC/IRGeb5C68SX8R/df8qfK8x4Q0RH5FBhius1HYqQCi1F2neITPtlzVYC1EYIOPohSKWGIS6GI/x5BCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa77bf3a88ca57eb18cbbbbbed29fec27645356debc72056a0f57f256405d830","last_reissued_at":"2026-05-18T00:33:02.202640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:02.202640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable computation for optimal control of cascade systems with constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Eric C. Kerrigan, Farhad Farokhi, Iman Shames, Michael Cantoni","submitted_at":"2017-02-21T13:29:30Z","abstract_excerpt":"A method is devised for numerically solving a class of finite-horizon optimal control problems subject to cascade linear discrete-time dynamics. It is assumed that the linear state and input inequality constraints, and the quadratic measure of performance, are all separable with respect to the spatial dimension of the underlying cascade of sub-systems, as well as the temporal dimension of the dynamics. By virtue of this structure, the computation cost of an interior-point method for an equivalent quadratic programming formulation of the optimal control problem can be made to scale linearly wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06375","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.06375","created_at":"2026-05-18T00:33:02.202717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06375v2","created_at":"2026-05-18T00:33:02.202717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06375","created_at":"2026-05-18T00:33:02.202717+00:00"},{"alias_kind":"pith_short_12","alias_value":"7J336OUIZJL6","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7J336OUIZJL6WGGL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7J336OUI","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7J336OUIZJL6WGGLXO562KP6YJ","json":"https://pith.science/pith/7J336OUIZJL6WGGLXO562KP6YJ.json","graph_json":"https://pith.science/api/pith-number/7J336OUIZJL6WGGLXO562KP6YJ/graph.json","events_json":"https://pith.science/api/pith-number/7J336OUIZJL6WGGLXO562KP6YJ/events.json","paper":"https://pith.science/paper/7J336OUI"},"agent_actions":{"view_html":"https://pith.science/pith/7J336OUIZJL6WGGLXO562KP6YJ","download_json":"https://pith.science/pith/7J336OUIZJL6WGGLXO562KP6YJ.json","view_paper":"https://pith.science/paper/7J336OUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06375&json=true","fetch_graph":"https://pith.science/api/pith-number/7J336OUIZJL6WGGLXO562KP6YJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7J336OUIZJL6WGGLXO562KP6YJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7J336OUIZJL6WGGLXO562KP6YJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7J336OUIZJL6WGGLXO562KP6YJ/action/storage_attestation","attest_author":"https://pith.science/pith/7J336OUIZJL6WGGLXO562KP6YJ/action/author_attestation","sign_citation":"https://pith.science/pith/7J336OUIZJL6WGGLXO562KP6YJ/action/citation_signature","submit_replication":"https://pith.science/pith/7J336OUIZJL6WGGLXO562KP6YJ/action/replication_record"}},"created_at":"2026-05-18T00:33:02.202717+00:00","updated_at":"2026-05-18T00:33:02.202717+00:00"}