{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FRZJ7PMVCWPOOPUFQRCMYMZP2U","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":"6e95a84ab67732cf7a635952fab95101f6e815a6635a2a967f9a0f1bed1c5f52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-03T01:01:15Z","title_canon_sha256":"5e35741b61c4820edc5ddb670f85bc816d82a776c78e9e6eaba466123965882a"},"schema_version":"1.0","source":{"id":"1701.00558","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00558","created_at":"2026-05-18T00:32:25Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00558v2","created_at":"2026-05-18T00:32:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00558","created_at":"2026-05-18T00:32:25Z"},{"alias_kind":"pith_short_12","alias_value":"FRZJ7PMVCWPO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRZJ7PMVCWPOOPUF","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRZJ7PMV","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:01e57db4fbbc995059468e20051138e92bcce9257d6d3dad8e7876f4aaa06ce7","target":"graph","created_at":"2026-05-18T00:32:25Z","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 Successive Convexification ($ \\texttt{SCvx} $) algorithm to solve a class of non-convex optimal control problems with certain types of state constraints. Sources of non-convexity may include nonlinear dynamics and non-convex state/control constraints. To tackle the challenge posed by non-convexity, first we utilize exact penalty function to handle the nonlinear dynamics. Then the proposed algorithm successively convexifies the problem via a $ \\textit{project-and-linearize} $ procedure. Thus a finite dimensional convex programming subproblem is solved at each succession, w","authors_text":"Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Daniel Dueri, Michael Szmuk, Yuanqi Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-03T01:01:15Z","title":"Successive Convexification of Non-Convex Optimal Control Problems with State Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00558","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:937a70717d9ba8583dbf920c5b5a5b6837ed1903be125fec8df1dae983c868d0","target":"record","created_at":"2026-05-18T00:32:25Z","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":"6e95a84ab67732cf7a635952fab95101f6e815a6635a2a967f9a0f1bed1c5f52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-03T01:01:15Z","title_canon_sha256":"5e35741b61c4820edc5ddb670f85bc816d82a776c78e9e6eaba466123965882a"},"schema_version":"1.0","source":{"id":"1701.00558","kind":"arxiv","version":2}},"canonical_sha256":"2c729fbd95159ee73e858444cc332fd539613a97cf1c1629de0f6621ad43e55a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c729fbd95159ee73e858444cc332fd539613a97cf1c1629de0f6621ad43e55a","first_computed_at":"2026-05-18T00:32:25.954876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:25.954876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N3R74VHaFmm5EtVQb+Njz1k1mP3yVH/+r5+93slxenfcfbtbM31q2Hc/y400y/sMLI5ohboaIUkfCv8WY77eDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:25.955504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00558","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:937a70717d9ba8583dbf920c5b5a5b6837ed1903be125fec8df1dae983c868d0","sha256:01e57db4fbbc995059468e20051138e92bcce9257d6d3dad8e7876f4aaa06ce7"],"state_sha256":"3cdd3596a7c487c5ed84a451945e5fb7ee2e4ac056b95af8cd2540909c08c51d"}