{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VCIL45SKSGGJZG2EMIBK5ZCOMU","short_pith_number":"pith:VCIL45SK","canonical_record":{"source":{"id":"1903.00155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-01T04:59:51Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"56823178a3b502eec10167def4d2f1ec44867173a40c2e684d7405ccef7da27b","abstract_canon_sha256":"7222e969e7892337a961e1422d38868412dce842be00fe11ff239332edf35799"},"schema_version":"1.0"},"canonical_sha256":"a890be764a918c9c9b446202aee44e650368a88cdfee5793c4337bc386df121c","source":{"kind":"arxiv","id":"1903.00155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00155","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00155v1","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00155","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"pith_short_12","alias_value":"VCIL45SKSGGJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VCIL45SKSGGJZG2E","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VCIL45SK","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VCIL45SKSGGJZG2EMIBK5ZCOMU","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-01T04:59:51Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"56823178a3b502eec10167def4d2f1ec44867173a40c2e684d7405ccef7da27b","abstract_canon_sha256":"7222e969e7892337a961e1422d38868412dce842be00fe11ff239332edf35799"},"schema_version":"1.0"},"canonical_sha256":"a890be764a918c9c9b446202aee44e650368a88cdfee5793c4337bc386df121c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:20.711618Z","signature_b64":"jKem6PG/26bSNsKQyz2myusWFfVQAi0MiZLLBl8nAIKjOiqeafLpddNhdASj2tPqGq5s8ALWTdXvYwVcwRzmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a890be764a918c9c9b446202aee44e650368a88cdfee5793c4337bc386df121c","last_reissued_at":"2026-05-17T23:52:20.710952Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:20.710952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00155","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-05-17T23:52:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iLreVySoRK6m9kOfaB9G7NNB2DxM+Z48n5bqVCg4mzot+yQVXQNPI36zsw043GCHGKUj361DP/7zNSr6/1oZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:35:37.364414Z"},"content_sha256":"0bc04ae49f17d4ce2b0c24c9d12357514481c6b370bf4f1b5e003bd2e6e4b9f9","schema_version":"1.0","event_id":"sha256:0bc04ae49f17d4ce2b0c24c9d12357514481c6b370bf4f1b5e003bd2e6e4b9f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VCIL45SKSGGJZG2EMIBK5ZCOMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GuSTO: Guaranteed Sequential Trajectory Optimization via Sequential Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"Abhishek Cauligi, Andrew Bylard, Marco Pavone, Riccardo Bonalli","submitted_at":"2019-03-01T04:59:51Z","abstract_excerpt":"Sequential Convex Programming (SCP) has recently seen a surge of interest as a tool for trajectory optimization. However, most available methods lack rigorous performance guarantees and they are often tailored to specific optimal control setups. In this paper, we present GuSTO (Guaranteed Sequential Trajectory Optimization), an algorithmic framework to solve trajectory optimization problems for control-affine systems with drift. GuSTO generalizes earlier SCP-based methods for trajectory optimization (by addressing, for example, goal-set constraints and problems with either fixed or free final "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00155","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":""},"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-17T23:52:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mI9TRH3J8agGIxUV663hJqfC9gSH2RsRSnGfcZMWBEhxFkD1n4himULpxD3s7QBuE2x6yKmubqETo5sGEggAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:35:37.365194Z"},"content_sha256":"4633273a2a5ba0ab260c576b85921acfdb1dddaa381899325dbfd0cce14b4bc6","schema_version":"1.0","event_id":"sha256:4633273a2a5ba0ab260c576b85921acfdb1dddaa381899325dbfd0cce14b4bc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCIL45SKSGGJZG2EMIBK5ZCOMU/bundle.json","state_url":"https://pith.science/pith/VCIL45SKSGGJZG2EMIBK5ZCOMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCIL45SKSGGJZG2EMIBK5ZCOMU/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-05-31T06:35:37Z","links":{"resolver":"https://pith.science/pith/VCIL45SKSGGJZG2EMIBK5ZCOMU","bundle":"https://pith.science/pith/VCIL45SKSGGJZG2EMIBK5ZCOMU/bundle.json","state":"https://pith.science/pith/VCIL45SKSGGJZG2EMIBK5ZCOMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCIL45SKSGGJZG2EMIBK5ZCOMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VCIL45SKSGGJZG2EMIBK5ZCOMU","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":"7222e969e7892337a961e1422d38868412dce842be00fe11ff239332edf35799","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-01T04:59:51Z","title_canon_sha256":"56823178a3b502eec10167def4d2f1ec44867173a40c2e684d7405ccef7da27b"},"schema_version":"1.0","source":{"id":"1903.00155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00155","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00155v1","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00155","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"pith_short_12","alias_value":"VCIL45SKSGGJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VCIL45SKSGGJZG2E","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VCIL45SK","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:4633273a2a5ba0ab260c576b85921acfdb1dddaa381899325dbfd0cce14b4bc6","target":"graph","created_at":"2026-05-17T23:52:20Z","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":"Sequential Convex Programming (SCP) has recently seen a surge of interest as a tool for trajectory optimization. However, most available methods lack rigorous performance guarantees and they are often tailored to specific optimal control setups. In this paper, we present GuSTO (Guaranteed Sequential Trajectory Optimization), an algorithmic framework to solve trajectory optimization problems for control-affine systems with drift. GuSTO generalizes earlier SCP-based methods for trajectory optimization (by addressing, for example, goal-set constraints and problems with either fixed or free final ","authors_text":"Abhishek Cauligi, Andrew Bylard, Marco Pavone, Riccardo Bonalli","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-01T04:59:51Z","title":"GuSTO: Guaranteed Sequential Trajectory Optimization via Sequential Convex Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00155","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:0bc04ae49f17d4ce2b0c24c9d12357514481c6b370bf4f1b5e003bd2e6e4b9f9","target":"record","created_at":"2026-05-17T23:52:20Z","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":"7222e969e7892337a961e1422d38868412dce842be00fe11ff239332edf35799","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-01T04:59:51Z","title_canon_sha256":"56823178a3b502eec10167def4d2f1ec44867173a40c2e684d7405ccef7da27b"},"schema_version":"1.0","source":{"id":"1903.00155","kind":"arxiv","version":1}},"canonical_sha256":"a890be764a918c9c9b446202aee44e650368a88cdfee5793c4337bc386df121c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a890be764a918c9c9b446202aee44e650368a88cdfee5793c4337bc386df121c","first_computed_at":"2026-05-17T23:52:20.710952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:20.710952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jKem6PG/26bSNsKQyz2myusWFfVQAi0MiZLLBl8nAIKjOiqeafLpddNhdASj2tPqGq5s8ALWTdXvYwVcwRzmCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:20.711618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bc04ae49f17d4ce2b0c24c9d12357514481c6b370bf4f1b5e003bd2e6e4b9f9","sha256:4633273a2a5ba0ab260c576b85921acfdb1dddaa381899325dbfd0cce14b4bc6"],"state_sha256":"76e879b32fdcb1f95f08e266c81b83d18ded9b97959d00f81283403cd942ea5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UlDifOn/K60HftchcBapw9rembXZEbKlZoU/yz6k0oqKSUvNIW/Rg+Ei7Fs5pt/E9k4nNSy6ekZzx0BuhIimCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:35:37.374547Z","bundle_sha256":"e2231a4205b9b327e1d617d4afc0228ae468b6130af40345e1987d0cf3f8f266"}}