{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:V45QPJ7NBZK6MJQ2E5YM5O3OQ2","short_pith_number":"pith:V45QPJ7N","schema_version":"1.0","canonical_sha256":"af3b07a7ed0e55e6261a2770cebb6e86bd2c80290b2549b944a9f803426600a8","source":{"kind":"arxiv","id":"2405.16680","version":2},"attestation_state":"computed","paper":{"title":"Six-Degree-of-Freedom Aircraft Landing Trajectory Planning with Runway Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abhinav G. Kamath, Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Jasper Corleis, Mehran Mesbahi, Niyousha Rahimi, Taewan Kim","submitted_at":"2024-05-26T20:14:37Z","abstract_excerpt":"This paper presents a numerical optimization algorithm for generating approach and landing trajectories for a six-degree-of-freedom (6-DoF) aircraft. We improve on the existing research on aircraft landing trajectory generation by formulating the trajectory optimization problem with additional real-world operational constraints, including 6-DoF aircraft dynamics, runway alignment, constant wind field, and obstacle avoidance, to obtain a continuous-time nonconvex optimal control problem. Particularly, the runway alignment constraint enforces the trajectory of the aircraft to be aligned with the"},"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":"2405.16680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-26T20:14:37Z","cross_cats_sorted":[],"title_canon_sha256":"da62afc5a9b561371615a8d8b4968ac61cfbf533afb999d7b517ef7484bf940a","abstract_canon_sha256":"7f1760a881d4372cd86b6cb541f7d74b1e456b3fe66da8afc8246d02ad7884d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:19.470378Z","signature_b64":"vLp5GEvO0nsFtQW8oqO2zLeV8SCYuvy4E1oAlLJWA9MLtWRnGxq2VPNTE4GaHNngK10Msq0Hdj41nBfd7BjBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af3b07a7ed0e55e6261a2770cebb6e86bd2c80290b2549b944a9f803426600a8","last_reissued_at":"2026-07-05T11:19:19.469872Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:19.469872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Six-Degree-of-Freedom Aircraft Landing Trajectory Planning with Runway Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abhinav G. Kamath, Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Jasper Corleis, Mehran Mesbahi, Niyousha Rahimi, Taewan Kim","submitted_at":"2024-05-26T20:14:37Z","abstract_excerpt":"This paper presents a numerical optimization algorithm for generating approach and landing trajectories for a six-degree-of-freedom (6-DoF) aircraft. We improve on the existing research on aircraft landing trajectory generation by formulating the trajectory optimization problem with additional real-world operational constraints, including 6-DoF aircraft dynamics, runway alignment, constant wind field, and obstacle avoidance, to obtain a continuous-time nonconvex optimal control problem. Particularly, the runway alignment constraint enforces the trajectory of the aircraft to be aligned with the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16680","kind":"arxiv","version":2},"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/2405.16680/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":"2405.16680","created_at":"2026-07-05T11:19:19.469933+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16680v2","created_at":"2026-07-05T11:19:19.469933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16680","created_at":"2026-07-05T11:19:19.469933+00:00"},{"alias_kind":"pith_short_12","alias_value":"V45QPJ7NBZK6","created_at":"2026-07-05T11:19:19.469933+00:00"},{"alias_kind":"pith_short_16","alias_value":"V45QPJ7NBZK6MJQ2","created_at":"2026-07-05T11:19:19.469933+00:00"},{"alias_kind":"pith_short_8","alias_value":"V45QPJ7N","created_at":"2026-07-05T11:19:19.469933+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":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V45QPJ7NBZK6MJQ2E5YM5O3OQ2","json":"https://pith.science/pith/V45QPJ7NBZK6MJQ2E5YM5O3OQ2.json","graph_json":"https://pith.science/api/pith-number/V45QPJ7NBZK6MJQ2E5YM5O3OQ2/graph.json","events_json":"https://pith.science/api/pith-number/V45QPJ7NBZK6MJQ2E5YM5O3OQ2/events.json","paper":"https://pith.science/paper/V45QPJ7N"},"agent_actions":{"view_html":"https://pith.science/pith/V45QPJ7NBZK6MJQ2E5YM5O3OQ2","download_json":"https://pith.science/pith/V45QPJ7NBZK6MJQ2E5YM5O3OQ2.json","view_paper":"https://pith.science/paper/V45QPJ7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16680&json=true","fetch_graph":"https://pith.science/api/pith-number/V45QPJ7NBZK6MJQ2E5YM5O3OQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/V45QPJ7NBZK6MJQ2E5YM5O3OQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V45QPJ7NBZK6MJQ2E5YM5O3OQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V45QPJ7NBZK6MJQ2E5YM5O3OQ2/action/storage_attestation","attest_author":"https://pith.science/pith/V45QPJ7NBZK6MJQ2E5YM5O3OQ2/action/author_attestation","sign_citation":"https://pith.science/pith/V45QPJ7NBZK6MJQ2E5YM5O3OQ2/action/citation_signature","submit_replication":"https://pith.science/pith/V45QPJ7NBZK6MJQ2E5YM5O3OQ2/action/replication_record"}},"created_at":"2026-07-05T11:19:19.469933+00:00","updated_at":"2026-07-05T11:19:19.469933+00:00"}