{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PCYAB35I5HJT6GY5H6W3KCXORM","short_pith_number":"pith:PCYAB35I","canonical_record":{"source":{"id":"1608.05133","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T23:58:54Z","cross_cats_sorted":[],"title_canon_sha256":"918fa208477a9a07535ec4bae29888468135e6313f068f3105ee0ebb7d58f9b7","abstract_canon_sha256":"736c31a816a3cd22ae8506cbebebae472578856881325bf8fccd2fc15fe296a3"},"schema_version":"1.0"},"canonical_sha256":"78b000efa8e9d33f1b1d3fadb50aee8b3679f379cd12e9f8e6d400594811ce80","source":{"kind":"arxiv","id":"1608.05133","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05133","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05133v3","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05133","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"PCYAB35I5HJT","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCYAB35I5HJT6GY5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCYAB35I","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PCYAB35I5HJT6GY5H6W3KCXORM","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05133","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T23:58:54Z","cross_cats_sorted":[],"title_canon_sha256":"918fa208477a9a07535ec4bae29888468135e6313f068f3105ee0ebb7d58f9b7","abstract_canon_sha256":"736c31a816a3cd22ae8506cbebebae472578856881325bf8fccd2fc15fe296a3"},"schema_version":"1.0"},"canonical_sha256":"78b000efa8e9d33f1b1d3fadb50aee8b3679f379cd12e9f8e6d400594811ce80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:04.916130Z","signature_b64":"A8EDRijJ9D/nVbghsTym74soZ32j28S/JLGoGcHbjRua3YBw7x7I5hBylac5WszVFfXVRfotCGzHWGxW3XzXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78b000efa8e9d33f1b1d3fadb50aee8b3679f379cd12e9f8e6d400594811ce80","last_reissued_at":"2026-05-18T00:45:04.915742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:04.915742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05133","source_version":3,"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-18T00:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zMVWttmVHmZZk/LSWsyHpQ61PBpfLlzwyJstZNVdfS5tsGQ04K93X4bxx4vy8l26wQXlD1M3chHddcfZbig6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:37:39.943838Z"},"content_sha256":"05f910ef1756fc8b35147bc2bd64ffff4505c3993523390dac997f3cd065a995","schema_version":"1.0","event_id":"sha256:05f910ef1756fc8b35147bc2bd64ffff4505c3993523390dac997f3cd065a995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PCYAB35I5HJT6GY5H6W3KCXORM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Successive Convexification of Non-Convex Optimal Control Problems and Its Convergence Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Michael Szmuk, Yuanqi Mao","submitted_at":"2016-08-17T23:58:54Z","abstract_excerpt":"This paper presents an algorithm to solve non-convex optimal control problems, where non-convexity can arise from nonlinear dynamics, and non-convex state and control constraints. This paper assumes that the state and control constraints are already convex or convexified, the proposed algorithm convexifies the nonlinear dynamics, via a linearization, in a successive manner. Thus at each succession, a convex optimal control subproblem is solved. Since the dynamics are linearized and other constraints are convex, after a discretization, the subproblem can be expressed as a finite dimensional con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05133","kind":"arxiv","version":3},"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-18T00:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k0ufG3xZ6aD9fgPzoEuiKHd9UKbotJWwxq9F8TWelikM4uLTgYzBFTqv++3OhU+kfVVnUhVGeLKNRKcrI3y8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:37:39.944171Z"},"content_sha256":"f119db27a6c85611963b6375ae41df79fec8ce22a5b9669353d45b1af05e7c8c","schema_version":"1.0","event_id":"sha256:f119db27a6c85611963b6375ae41df79fec8ce22a5b9669353d45b1af05e7c8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM/bundle.json","state_url":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCYAB35I5HJT6GY5H6W3KCXORM/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-06-01T08:37:39Z","links":{"resolver":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM","bundle":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM/bundle.json","state":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCYAB35I5HJT6GY5H6W3KCXORM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PCYAB35I5HJT6GY5H6W3KCXORM","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":"736c31a816a3cd22ae8506cbebebae472578856881325bf8fccd2fc15fe296a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T23:58:54Z","title_canon_sha256":"918fa208477a9a07535ec4bae29888468135e6313f068f3105ee0ebb7d58f9b7"},"schema_version":"1.0","source":{"id":"1608.05133","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05133","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05133v3","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05133","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"PCYAB35I5HJT","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCYAB35I5HJT6GY5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCYAB35I","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:f119db27a6c85611963b6375ae41df79fec8ce22a5b9669353d45b1af05e7c8c","target":"graph","created_at":"2026-05-18T00:45:04Z","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 an algorithm to solve non-convex optimal control problems, where non-convexity can arise from nonlinear dynamics, and non-convex state and control constraints. This paper assumes that the state and control constraints are already convex or convexified, the proposed algorithm convexifies the nonlinear dynamics, via a linearization, in a successive manner. Thus at each succession, a convex optimal control subproblem is solved. Since the dynamics are linearized and other constraints are convex, after a discretization, the subproblem can be expressed as a finite dimensional con","authors_text":"Behcet Acikmese, Michael Szmuk, Yuanqi Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T23:58:54Z","title":"Successive Convexification of Non-Convex Optimal Control Problems and Its Convergence Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05133","kind":"arxiv","version":3},"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:05f910ef1756fc8b35147bc2bd64ffff4505c3993523390dac997f3cd065a995","target":"record","created_at":"2026-05-18T00:45:04Z","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":"736c31a816a3cd22ae8506cbebebae472578856881325bf8fccd2fc15fe296a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T23:58:54Z","title_canon_sha256":"918fa208477a9a07535ec4bae29888468135e6313f068f3105ee0ebb7d58f9b7"},"schema_version":"1.0","source":{"id":"1608.05133","kind":"arxiv","version":3}},"canonical_sha256":"78b000efa8e9d33f1b1d3fadb50aee8b3679f379cd12e9f8e6d400594811ce80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78b000efa8e9d33f1b1d3fadb50aee8b3679f379cd12e9f8e6d400594811ce80","first_computed_at":"2026-05-18T00:45:04.915742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:04.915742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A8EDRijJ9D/nVbghsTym74soZ32j28S/JLGoGcHbjRua3YBw7x7I5hBylac5WszVFfXVRfotCGzHWGxW3XzXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:04.916130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05133","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05f910ef1756fc8b35147bc2bd64ffff4505c3993523390dac997f3cd065a995","sha256:f119db27a6c85611963b6375ae41df79fec8ce22a5b9669353d45b1af05e7c8c"],"state_sha256":"effbfff3d15adaf4016ff3ed46a44c3e02cb6d374227722ce2b212532c9599f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hcXBewkKlmTpBzOxZK/LnmJiaE2RDwyPmSyJxBFPUaoJ8ZDWTxxYoh8LJfAQdkdMe6DhD70nyaVTKYnzNXWdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:37:39.946009Z","bundle_sha256":"e1230be6c33903f4d40933b32e44bdc4d9d678b53275ac660908c95c681a07c9"}}