{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2RKDHYWP6PL6OSA3FDQ5ONY7TS","short_pith_number":"pith:2RKDHYWP","schema_version":"1.0","canonical_sha256":"d45433e2cff3d7e7481b28e1d7371f9cb032cc5ea9309ffd672ab131c7c2ccdc","source":{"kind":"arxiv","id":"2402.04561","version":1},"attestation_state":"computed","paper":{"title":"Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Govind M. Chari","submitted_at":"2024-02-07T03:42:09Z","abstract_excerpt":"We implement a fully factorization-free algorithm for nonconvex, free-final-time trajectory optimization. This algorithm is based on sequential convex programming and utilizes an inverse-free, exact discretization procedure to ensure dynamic feasibility of the converged trajectory and PIPG, a fast, first-order conic optimization algorithm as the subproblem solver. Although PIPG requires the tuning of a hyperparameter to achieve fastest convergence, we show that PIPG can be tuned to a nominal trajectory optimization problem and it is robust to variations in initial condition. We demonstrate thi"},"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":"2402.04561","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-07T03:42:09Z","cross_cats_sorted":[],"title_canon_sha256":"8e555ad2b2ff9a5fb3928247ac07abe24e2ee7df11b7716c4371103e1ed59bc4","abstract_canon_sha256":"afc03b0728e2893500199b227dc45f0625b6c84633734970b632f1fb68d447b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:42:28.873574Z","signature_b64":"/3ODnbXzFKB3rniClTncUBsPKYOOfJ6iJ2JaIIDBmgF9rcxFwjY/BnMbYAD/+LLcHtpg3qvn/z4v2dw2H5m+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d45433e2cff3d7e7481b28e1d7371f9cb032cc5ea9309ffd672ab131c7c2ccdc","last_reissued_at":"2026-07-05T07:42:28.873150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:42:28.873150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Govind M. Chari","submitted_at":"2024-02-07T03:42:09Z","abstract_excerpt":"We implement a fully factorization-free algorithm for nonconvex, free-final-time trajectory optimization. This algorithm is based on sequential convex programming and utilizes an inverse-free, exact discretization procedure to ensure dynamic feasibility of the converged trajectory and PIPG, a fast, first-order conic optimization algorithm as the subproblem solver. Although PIPG requires the tuning of a hyperparameter to achieve fastest convergence, we show that PIPG can be tuned to a nominal trajectory optimization problem and it is robust to variations in initial condition. We demonstrate thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.04561","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/2402.04561/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.04561","created_at":"2026-07-05T07:42:28.873199+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.04561v1","created_at":"2026-07-05T07:42:28.873199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.04561","created_at":"2026-07-05T07:42:28.873199+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RKDHYWP6PL6","created_at":"2026-07-05T07:42:28.873199+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RKDHYWP6PL6OSA3","created_at":"2026-07-05T07:42:28.873199+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RKDHYWP","created_at":"2026-07-05T07:42:28.873199+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14191","citing_title":"Optimal Preconditioning for Online Quadratic Cone Programming","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS","json":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS.json","graph_json":"https://pith.science/api/pith-number/2RKDHYWP6PL6OSA3FDQ5ONY7TS/graph.json","events_json":"https://pith.science/api/pith-number/2RKDHYWP6PL6OSA3FDQ5ONY7TS/events.json","paper":"https://pith.science/paper/2RKDHYWP"},"agent_actions":{"view_html":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS","download_json":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS.json","view_paper":"https://pith.science/paper/2RKDHYWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.04561&json=true","fetch_graph":"https://pith.science/api/pith-number/2RKDHYWP6PL6OSA3FDQ5ONY7TS/graph.json","fetch_events":"https://pith.science/api/pith-number/2RKDHYWP6PL6OSA3FDQ5ONY7TS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/action/storage_attestation","attest_author":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/action/author_attestation","sign_citation":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/action/citation_signature","submit_replication":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/action/replication_record"}},"created_at":"2026-07-05T07:42:28.873199+00:00","updated_at":"2026-07-05T07:42:28.873199+00:00"}