{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WNQQKSLQYTVJRKCXEBJO4ZK656","short_pith_number":"pith:WNQQKSLQ","schema_version":"1.0","canonical_sha256":"b361054970c4ea98a8572052ee655eefb9dee6151b1f6fbdb0f15564d4a0ea48","source":{"kind":"arxiv","id":"1906.04857","version":1},"attestation_state":"computed","paper":{"title":"Fast Trajectory Optimization via Successive Convexification for Spacecraft Rendezvous with Integer Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Danylo Malyuta, Mehran Mesbahi, Michael Szmuk, Taylor P. Reynolds","submitted_at":"2019-06-11T23:13:21Z","abstract_excerpt":"In this paper we present a fast method based on successive convexification for generating fuel-optimized spacecraft rendezvous trajectories in the presence of mixed-integer constraints. A recently developed paradigm of state-triggered constraints allows to efficiently embed a subset of discrete decision constraints into the continuous optimization framework of successive convexification. As a result, we are able to solve difficult trajectory optimization problems at interactive speeds, as opposed to a mixed-integer programming approach that would require significantly more solution time and co"},"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":"1906.04857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-11T23:13:21Z","cross_cats_sorted":[],"title_canon_sha256":"0eec93946009d2327041470eb99e5b1789b6806dd89c4cccdac5f0443bc506d0","abstract_canon_sha256":"1e2e1a31ae6aaa19b8d994e6789411abe108de01619099f2e8c4296a142e4b88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:30.310484Z","signature_b64":"eY+i+2ZwdvVgwkhactRcWaddc4JTIPow10O/VrRfXK3iBMqPJlK9rB5ZRO601VfWI9B4zvbd7j2Sqi5/p2JoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b361054970c4ea98a8572052ee655eefb9dee6151b1f6fbdb0f15564d4a0ea48","last_reissued_at":"2026-05-17T23:43:30.309924Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:30.309924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Trajectory Optimization via Successive Convexification for Spacecraft Rendezvous with Integer Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Danylo Malyuta, Mehran Mesbahi, Michael Szmuk, Taylor P. Reynolds","submitted_at":"2019-06-11T23:13:21Z","abstract_excerpt":"In this paper we present a fast method based on successive convexification for generating fuel-optimized spacecraft rendezvous trajectories in the presence of mixed-integer constraints. A recently developed paradigm of state-triggered constraints allows to efficiently embed a subset of discrete decision constraints into the continuous optimization framework of successive convexification. As a result, we are able to solve difficult trajectory optimization problems at interactive speeds, as opposed to a mixed-integer programming approach that would require significantly more solution time and co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04857","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":"1906.04857","created_at":"2026-05-17T23:43:30.310007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.04857v1","created_at":"2026-05-17T23:43:30.310007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04857","created_at":"2026-05-17T23:43:30.310007+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNQQKSLQYTVJ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNQQKSLQYTVJRKCX","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNQQKSLQ","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656","json":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656.json","graph_json":"https://pith.science/api/pith-number/WNQQKSLQYTVJRKCXEBJO4ZK656/graph.json","events_json":"https://pith.science/api/pith-number/WNQQKSLQYTVJRKCXEBJO4ZK656/events.json","paper":"https://pith.science/paper/WNQQKSLQ"},"agent_actions":{"view_html":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656","download_json":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656.json","view_paper":"https://pith.science/paper/WNQQKSLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.04857&json=true","fetch_graph":"https://pith.science/api/pith-number/WNQQKSLQYTVJRKCXEBJO4ZK656/graph.json","fetch_events":"https://pith.science/api/pith-number/WNQQKSLQYTVJRKCXEBJO4ZK656/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/action/storage_attestation","attest_author":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/action/author_attestation","sign_citation":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/action/citation_signature","submit_replication":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/action/replication_record"}},"created_at":"2026-05-17T23:43:30.310007+00:00","updated_at":"2026-05-17T23:43:30.310007+00:00"}