{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5BRMGNOHKK27COYYEA7ZLO3KVD","short_pith_number":"pith:5BRMGNOH","schema_version":"1.0","canonical_sha256":"e862c335c752b5f13b18203f95bb6aa8e1b5ce2252099f119a4ad2326036ddaf","source":{"kind":"arxiv","id":"1905.07654","version":1},"attestation_state":"computed","paper":{"title":"Trajectory Optimization on Manifolds: A Theoretically-Guaranteed Embedded Sequential Convex Programming Approach","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, Thomas Lew","submitted_at":"2019-05-18T22:55:15Z","abstract_excerpt":"Sequential Convex Programming (SCP) has recently gained popularity as a tool for trajectory optimization due to its sound theoretical properties and practical performance. Yet, most SCP-based methods for trajectory optimization are restricted to Euclidean settings, which precludes their application to problem instances where one must reason about manifold-type constraints (that is, constraints, such as loop closure, which restrict the motion of a system to a subset of the ambient space). The aim of this paper is to fill this gap by extending SCP-based trajectory optimization methods to a manif"},"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":"1905.07654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-18T22:55:15Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"08ebf3099d2a0d4fdefd3abacd954ebaaad0c431674424a83e49becfb2d0bf70","abstract_canon_sha256":"642ed457581f5779471e16303abbe487d4feab20e4dbf3f0464ad96f54f1c660"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:48.928007Z","signature_b64":"PpHQkI5/fGxHiv3ZbJ4vxgo+Jr5aV9t9cadGCu4mxaq54ADuqFhmw7C3IMVyt4BSSfYHIw1r0w2bXAXwZcMdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e862c335c752b5f13b18203f95bb6aa8e1b5ce2252099f119a4ad2326036ddaf","last_reissued_at":"2026-05-17T23:45:48.927144Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:48.927144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trajectory Optimization on Manifolds: A Theoretically-Guaranteed Embedded Sequential Convex Programming Approach","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, Thomas Lew","submitted_at":"2019-05-18T22:55:15Z","abstract_excerpt":"Sequential Convex Programming (SCP) has recently gained popularity as a tool for trajectory optimization due to its sound theoretical properties and practical performance. Yet, most SCP-based methods for trajectory optimization are restricted to Euclidean settings, which precludes their application to problem instances where one must reason about manifold-type constraints (that is, constraints, such as loop closure, which restrict the motion of a system to a subset of the ambient space). The aim of this paper is to fill this gap by extending SCP-based trajectory optimization methods to a manif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07654","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.07654","created_at":"2026-05-17T23:45:48.927295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07654v1","created_at":"2026-05-17T23:45:48.927295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07654","created_at":"2026-05-17T23:45:48.927295+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BRMGNOHKK27","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BRMGNOHKK27COYY","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BRMGNOH","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.10579","citing_title":"LieIPM: Lie Group Interior Point Method for Direct Trajectory Optimization of Rigid Bodies","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2606.29766","citing_title":"Trajectory Optimization for Collision-Aware Redundant Robotic Multi-Axis Additive Manufacturing by Constrained Gradient Projection","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5BRMGNOHKK27COYYEA7ZLO3KVD","json":"https://pith.science/pith/5BRMGNOHKK27COYYEA7ZLO3KVD.json","graph_json":"https://pith.science/api/pith-number/5BRMGNOHKK27COYYEA7ZLO3KVD/graph.json","events_json":"https://pith.science/api/pith-number/5BRMGNOHKK27COYYEA7ZLO3KVD/events.json","paper":"https://pith.science/paper/5BRMGNOH"},"agent_actions":{"view_html":"https://pith.science/pith/5BRMGNOHKK27COYYEA7ZLO3KVD","download_json":"https://pith.science/pith/5BRMGNOHKK27COYYEA7ZLO3KVD.json","view_paper":"https://pith.science/paper/5BRMGNOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07654&json=true","fetch_graph":"https://pith.science/api/pith-number/5BRMGNOHKK27COYYEA7ZLO3KVD/graph.json","fetch_events":"https://pith.science/api/pith-number/5BRMGNOHKK27COYYEA7ZLO3KVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BRMGNOHKK27COYYEA7ZLO3KVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BRMGNOHKK27COYYEA7ZLO3KVD/action/storage_attestation","attest_author":"https://pith.science/pith/5BRMGNOHKK27COYYEA7ZLO3KVD/action/author_attestation","sign_citation":"https://pith.science/pith/5BRMGNOHKK27COYYEA7ZLO3KVD/action/citation_signature","submit_replication":"https://pith.science/pith/5BRMGNOHKK27COYYEA7ZLO3KVD/action/replication_record"}},"created_at":"2026-05-17T23:45:48.927295+00:00","updated_at":"2026-05-17T23:45:48.927295+00:00"}