{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EX2AHRJSV4XW7BAMDYYBDANKFO","short_pith_number":"pith:EX2AHRJS","canonical_record":{"source":{"id":"2404.16826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-25T17:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"08096faecd45f5d9704124d7417f5608a6582411221c1b01de3af77f4a1126ea","abstract_canon_sha256":"d1be815578913deaf87278c1a62338f706097c643a0642acbd17db58f52001c9"},"schema_version":"1.0"},"canonical_sha256":"25f403c532af2f6f840c1e301181aa2bb8dd8b8b487f1761447d4ba3b9461940","source":{"kind":"arxiv","id":"2404.16826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.16826","created_at":"2026-07-05T08:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"2404.16826v1","created_at":"2026-07-05T08:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16826","created_at":"2026-07-05T08:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"EX2AHRJSV4XW","created_at":"2026-07-05T08:12:12Z"},{"alias_kind":"pith_short_16","alias_value":"EX2AHRJSV4XW7BAM","created_at":"2026-07-05T08:12:12Z"},{"alias_kind":"pith_short_8","alias_value":"EX2AHRJS","created_at":"2026-07-05T08:12:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EX2AHRJSV4XW7BAMDYYBDANKFO","target":"record","payload":{"canonical_record":{"source":{"id":"2404.16826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-25T17:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"08096faecd45f5d9704124d7417f5608a6582411221c1b01de3af77f4a1126ea","abstract_canon_sha256":"d1be815578913deaf87278c1a62338f706097c643a0642acbd17db58f52001c9"},"schema_version":"1.0"},"canonical_sha256":"25f403c532af2f6f840c1e301181aa2bb8dd8b8b487f1761447d4ba3b9461940","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:12:12.990569Z","signature_b64":"wR6BT8kDX4pleEcEhAOqjUHe4zE/tPPzIEUx0Kzw3NeCnACfEXvykrNBCkW9r5+E9prLluPLyO8cP6JnigDYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25f403c532af2f6f840c1e301181aa2bb8dd8b8b487f1761447d4ba3b9461940","last_reissued_at":"2026-07-05T08:12:12.990107Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:12:12.990107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.16826","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-07-05T08:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHGT4GLmADZ0VT15fTJRc/NVkqtSScTPDEzj27aqACPVaMDTQVEcvm/jC4eda05L1P/H0XA2Tr4aLGX7aEe5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:27:58.762876Z"},"content_sha256":"b603c0f018d3157ef63f2a94ceff8148509e395556b265b1fc893029ef351d72","schema_version":"1.0","event_id":"sha256:b603c0f018d3157ef63f2a94ceff8148509e395556b265b1fc893029ef351d72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EX2AHRJSV4XW7BAMDYYBDANKFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Successive Convexification for Trajectory Optimization with Continuous-Time Constraint Satisfaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abhinav G. Kamath, Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Dayou Luo, Purnanand Elango, Samet Uzun, Taewan Kim","submitted_at":"2024-04-25T17:59:47Z","abstract_excerpt":"We present successive convexification, a real-time-capable solution method for nonconvex trajectory optimization, with continuous-time constraint satisfaction and guaranteed convergence, that only requires first-order information. The proposed framework combines several key methods to solve a large class of nonlinear optimal control problems: (i) exterior penalty-based reformulation of the path constraints; (ii) generalized time-dilation; (iii) multiple-shooting discretization; (iv) $\\ell_1$ exact penalization of the nonconvex constraints; and (v) the prox-linear method, a sequential convex pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16826","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.16826/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-05T08:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LEdPh4b1IAmBaN2wpy3efT72SdmveJ/WH+PpsPd63uUw5xHtS2wpTGj2nma5HrcXzosay29pMDub7BSHKatsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:27:58.763396Z"},"content_sha256":"20bb4d17471a44eefe83714b214b8fd9ebbbe0e10ccce0fbf8a48455b347a176","schema_version":"1.0","event_id":"sha256:20bb4d17471a44eefe83714b214b8fd9ebbbe0e10ccce0fbf8a48455b347a176"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EX2AHRJSV4XW7BAMDYYBDANKFO/bundle.json","state_url":"https://pith.science/pith/EX2AHRJSV4XW7BAMDYYBDANKFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EX2AHRJSV4XW7BAMDYYBDANKFO/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-09T23:27:58Z","links":{"resolver":"https://pith.science/pith/EX2AHRJSV4XW7BAMDYYBDANKFO","bundle":"https://pith.science/pith/EX2AHRJSV4XW7BAMDYYBDANKFO/bundle.json","state":"https://pith.science/pith/EX2AHRJSV4XW7BAMDYYBDANKFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EX2AHRJSV4XW7BAMDYYBDANKFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EX2AHRJSV4XW7BAMDYYBDANKFO","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":"d1be815578913deaf87278c1a62338f706097c643a0642acbd17db58f52001c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-25T17:59:47Z","title_canon_sha256":"08096faecd45f5d9704124d7417f5608a6582411221c1b01de3af77f4a1126ea"},"schema_version":"1.0","source":{"id":"2404.16826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.16826","created_at":"2026-07-05T08:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"2404.16826v1","created_at":"2026-07-05T08:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16826","created_at":"2026-07-05T08:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"EX2AHRJSV4XW","created_at":"2026-07-05T08:12:12Z"},{"alias_kind":"pith_short_16","alias_value":"EX2AHRJSV4XW7BAM","created_at":"2026-07-05T08:12:12Z"},{"alias_kind":"pith_short_8","alias_value":"EX2AHRJS","created_at":"2026-07-05T08:12:12Z"}],"graph_snapshots":[{"event_id":"sha256:20bb4d17471a44eefe83714b214b8fd9ebbbe0e10ccce0fbf8a48455b347a176","target":"graph","created_at":"2026-07-05T08:12:12Z","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/2404.16826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present successive convexification, a real-time-capable solution method for nonconvex trajectory optimization, with continuous-time constraint satisfaction and guaranteed convergence, that only requires first-order information. The proposed framework combines several key methods to solve a large class of nonlinear optimal control problems: (i) exterior penalty-based reformulation of the path constraints; (ii) generalized time-dilation; (iii) multiple-shooting discretization; (iv) $\\ell_1$ exact penalization of the nonconvex constraints; and (v) the prox-linear method, a sequential convex pr","authors_text":"Abhinav G. Kamath, Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Dayou Luo, Purnanand Elango, Samet Uzun, Taewan Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-25T17:59:47Z","title":"Successive Convexification for Trajectory Optimization with Continuous-Time Constraint Satisfaction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16826","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:b603c0f018d3157ef63f2a94ceff8148509e395556b265b1fc893029ef351d72","target":"record","created_at":"2026-07-05T08:12:12Z","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":"d1be815578913deaf87278c1a62338f706097c643a0642acbd17db58f52001c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-25T17:59:47Z","title_canon_sha256":"08096faecd45f5d9704124d7417f5608a6582411221c1b01de3af77f4a1126ea"},"schema_version":"1.0","source":{"id":"2404.16826","kind":"arxiv","version":1}},"canonical_sha256":"25f403c532af2f6f840c1e301181aa2bb8dd8b8b487f1761447d4ba3b9461940","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25f403c532af2f6f840c1e301181aa2bb8dd8b8b487f1761447d4ba3b9461940","first_computed_at":"2026-07-05T08:12:12.990107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:12:12.990107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wR6BT8kDX4pleEcEhAOqjUHe4zE/tPPzIEUx0Kzw3NeCnACfEXvykrNBCkW9r5+E9prLluPLyO8cP6JnigDYBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:12:12.990569Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.16826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b603c0f018d3157ef63f2a94ceff8148509e395556b265b1fc893029ef351d72","sha256:20bb4d17471a44eefe83714b214b8fd9ebbbe0e10ccce0fbf8a48455b347a176"],"state_sha256":"b731d89232d32d005a16dff8b829ebf17354974a8493b678f10526119b46f626"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SoM46N65xt0YwnGsfABuKa11XR2vtZ8brKyqFpO1mh+JDjxpBOPPqx9TB1ht0Vjr+1PVGwGeO6/KZPddUa/BDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T23:27:58.768635Z","bundle_sha256":"7fb4a37bcec47cf98b9a2ba8e66b8c9ebc07c3ad141cf46a25b2b91b142b7954"}}