{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WNQQKSLQYTVJRKCXEBJO4ZK656","short_pith_number":"pith:WNQQKSLQ","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"},"canonical_sha256":"b361054970c4ea98a8572052ee655eefb9dee6151b1f6fbdb0f15564d4a0ea48","source":{"kind":"arxiv","id":"1906.04857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04857","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04857v1","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04857","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"pith_short_12","alias_value":"WNQQKSLQYTVJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WNQQKSLQYTVJRKCX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WNQQKSLQ","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WNQQKSLQYTVJRKCXEBJO4ZK656","target":"record","payload":{"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"},"canonical_sha256":"b361054970c4ea98a8572052ee655eefb9dee6151b1f6fbdb0f15564d4a0ea48","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"},"source_kind":"arxiv","source_id":"1906.04857","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:43:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BowffYxhSWuWD42MF0kjBoQUDxS7eSeVB5uS6Ph5hsjFA9/37qnv5rslos3CpjmnL6U1w9GK2Xxw8SLn178jAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:47:07.398149Z"},"content_sha256":"13e5fe8a12e3f024b9204a52ec30b46973102f4b4caab3ffe9b697c18df65692","schema_version":"1.0","event_id":"sha256:13e5fe8a12e3f024b9204a52ec30b46973102f4b4caab3ffe9b697c18df65692"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WNQQKSLQYTVJRKCXEBJO4ZK656","target":"graph","payload":{"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"},"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:43:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8btRGJI3hzWDawGfY6hZQuQoc3MB9jbnUPfo0UVtftTMnZNS1gNiggcZVfy71XfMurjxiKpwJaJLDla+J4/sBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:47:07.398521Z"},"content_sha256":"abd1274ff0d6f8c953b5fde218f352939f25be7424aef01c8385e8de7bd3ce12","schema_version":"1.0","event_id":"sha256:abd1274ff0d6f8c953b5fde218f352939f25be7424aef01c8385e8de7bd3ce12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/bundle.json","state_url":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/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-28T13:47:07Z","links":{"resolver":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656","bundle":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/bundle.json","state":"https://pith.science/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNQQKSLQYTVJRKCXEBJO4ZK656/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WNQQKSLQYTVJRKCXEBJO4ZK656","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":"1e2e1a31ae6aaa19b8d994e6789411abe108de01619099f2e8c4296a142e4b88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-11T23:13:21Z","title_canon_sha256":"0eec93946009d2327041470eb99e5b1789b6806dd89c4cccdac5f0443bc506d0"},"schema_version":"1.0","source":{"id":"1906.04857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04857","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04857v1","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04857","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"pith_short_12","alias_value":"WNQQKSLQYTVJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WNQQKSLQYTVJRKCX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WNQQKSLQ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:abd1274ff0d6f8c953b5fde218f352939f25be7424aef01c8385e8de7bd3ce12","target":"graph","created_at":"2026-05-17T23:43:30Z","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":"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","authors_text":"Behcet Acikmese, Danylo Malyuta, Mehran Mesbahi, Michael Szmuk, Taylor P. Reynolds","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-11T23:13:21Z","title":"Fast Trajectory Optimization via Successive Convexification for Spacecraft Rendezvous with Integer Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04857","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:13e5fe8a12e3f024b9204a52ec30b46973102f4b4caab3ffe9b697c18df65692","target":"record","created_at":"2026-05-17T23:43:30Z","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":"1e2e1a31ae6aaa19b8d994e6789411abe108de01619099f2e8c4296a142e4b88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-11T23:13:21Z","title_canon_sha256":"0eec93946009d2327041470eb99e5b1789b6806dd89c4cccdac5f0443bc506d0"},"schema_version":"1.0","source":{"id":"1906.04857","kind":"arxiv","version":1}},"canonical_sha256":"b361054970c4ea98a8572052ee655eefb9dee6151b1f6fbdb0f15564d4a0ea48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b361054970c4ea98a8572052ee655eefb9dee6151b1f6fbdb0f15564d4a0ea48","first_computed_at":"2026-05-17T23:43:30.309924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:30.309924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eY+i+2ZwdvVgwkhactRcWaddc4JTIPow10O/VrRfXK3iBMqPJlK9rB5ZRO601VfWI9B4zvbd7j2Sqi5/p2JoBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:30.310484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.04857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13e5fe8a12e3f024b9204a52ec30b46973102f4b4caab3ffe9b697c18df65692","sha256:abd1274ff0d6f8c953b5fde218f352939f25be7424aef01c8385e8de7bd3ce12"],"state_sha256":"3d80b0234c349e277dfdc184ee505ef6c37ca93ec4c831827c6738005a4171af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3+UuJhI/Wa9iEbTbIyiJT0bU+Pqttwt5oNp5g1T50GxI2++BVfu9zSY/x9wgfJ30AcN2MufMABzzBV+TZpeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:47:07.400461Z","bundle_sha256":"22b41a7fb957583bad24a8f64e6ccff6d944688174076f8eca1f4e49cd71ab02"}}