{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N3TMS7ABLRJWBI2KT6DXDJ2KG6","short_pith_number":"pith:N3TMS7AB","schema_version":"1.0","canonical_sha256":"6ee6c97c015c5360a34a9f8771a74a3792c657144a5cc99170bc0baf097bcae8","source":{"kind":"arxiv","id":"1811.10803","version":1},"attestation_state":"computed","paper":{"title":"Successive Convexification for Real-Time 6-DoF Powered Descent Guidance with State-Triggered Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Michael Szmuk, Taylor P. Reynolds","submitted_at":"2018-11-27T04:35:31Z","abstract_excerpt":"In this paper, we present a real-time successive convexification algorithm for a generalized free-final-time 6-degree-of-freedom powered descent guidance problem. We build on our previous work by introducing the following contributions: (i) a free-ignition-time modification that allows the algorithm to determine the optimal engine ignition time, (ii) a tractable aerodynamics formulation that models both lift and drag, and (iii) a continuous state-triggered constraint formulation that emulates conditionally enforced constraints. In particular, contribution (iii) effectively allows constraints t"},"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":"1811.10803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-27T04:35:31Z","cross_cats_sorted":[],"title_canon_sha256":"93716f6112c5e78d8a09938a4fa6850109a98bf82c7a5ddd404e4ea94f484b23","abstract_canon_sha256":"02ef09bf352816c593e2a3b7b2b00bc4c5930a11ae14a454d156e01e7e3cc442"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:31:20.455434Z","signature_b64":"znJ3fj9Q7GFAJu4+SskBH3qhJ9eu1m3DvWAWpEL3rOe9JqqpKmUGQAS9hF9heLxgOkKLsIhdFGQ54EwrygboAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee6c97c015c5360a34a9f8771a74a3792c657144a5cc99170bc0baf097bcae8","last_reissued_at":"2026-07-05T01:31:20.455022Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:31:20.455022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive Convexification for Real-Time 6-DoF Powered Descent Guidance with State-Triggered Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Michael Szmuk, Taylor P. Reynolds","submitted_at":"2018-11-27T04:35:31Z","abstract_excerpt":"In this paper, we present a real-time successive convexification algorithm for a generalized free-final-time 6-degree-of-freedom powered descent guidance problem. We build on our previous work by introducing the following contributions: (i) a free-ignition-time modification that allows the algorithm to determine the optimal engine ignition time, (ii) a tractable aerodynamics formulation that models both lift and drag, and (iii) a continuous state-triggered constraint formulation that emulates conditionally enforced constraints. In particular, contribution (iii) effectively allows constraints t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10803","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/1811.10803/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":"1811.10803","created_at":"2026-07-05T01:31:20.455078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10803v1","created_at":"2026-07-05T01:31:20.455078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10803","created_at":"2026-07-05T01:31:20.455078+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3TMS7ABLRJW","created_at":"2026-07-05T01:31:20.455078+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3TMS7ABLRJWBI2K","created_at":"2026-07-05T01:31:20.455078+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3TMS7AB","created_at":"2026-07-05T01:31:20.455078+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2105.09029","citing_title":"Optimal Science-time Reorientation Policy for the Comet Interceptor Flyby via Sequential Convex Programming","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N3TMS7ABLRJWBI2KT6DXDJ2KG6","json":"https://pith.science/pith/N3TMS7ABLRJWBI2KT6DXDJ2KG6.json","graph_json":"https://pith.science/api/pith-number/N3TMS7ABLRJWBI2KT6DXDJ2KG6/graph.json","events_json":"https://pith.science/api/pith-number/N3TMS7ABLRJWBI2KT6DXDJ2KG6/events.json","paper":"https://pith.science/paper/N3TMS7AB"},"agent_actions":{"view_html":"https://pith.science/pith/N3TMS7ABLRJWBI2KT6DXDJ2KG6","download_json":"https://pith.science/pith/N3TMS7ABLRJWBI2KT6DXDJ2KG6.json","view_paper":"https://pith.science/paper/N3TMS7AB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10803&json=true","fetch_graph":"https://pith.science/api/pith-number/N3TMS7ABLRJWBI2KT6DXDJ2KG6/graph.json","fetch_events":"https://pith.science/api/pith-number/N3TMS7ABLRJWBI2KT6DXDJ2KG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3TMS7ABLRJWBI2KT6DXDJ2KG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3TMS7ABLRJWBI2KT6DXDJ2KG6/action/storage_attestation","attest_author":"https://pith.science/pith/N3TMS7ABLRJWBI2KT6DXDJ2KG6/action/author_attestation","sign_citation":"https://pith.science/pith/N3TMS7ABLRJWBI2KT6DXDJ2KG6/action/citation_signature","submit_replication":"https://pith.science/pith/N3TMS7ABLRJWBI2KT6DXDJ2KG6/action/replication_record"}},"created_at":"2026-07-05T01:31:20.455078+00:00","updated_at":"2026-07-05T01:31:20.455078+00:00"}