{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5DGGRG4SCP57XW6WEVUHPQNKZU","short_pith_number":"pith:5DGGRG4S","schema_version":"1.0","canonical_sha256":"e8cc689b9213fbfbdbd6256877c1aacd2845735092a0f78b2f9cdc882513543e","source":{"kind":"arxiv","id":"1311.2880","version":1},"attestation_state":"computed","paper":{"title":"Aircraft Landing Problem: Efficient Algorithm for a Given Landing Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Abhishek Awasthi, J\\\"org L\\\"assig, Oliver Kramer","submitted_at":"2013-10-26T14:37:47Z","abstract_excerpt":"In this paper, we investigate a special case of the static aircraft landing problem (ALP) with the objective to optimize landing sequences and landing times for a set of air planes. The problem is to land the planes on one or multiple runways within a time window as close as possible to the preferable target landing time, maintaining a safety distance constraint. The objective of this well-known NP-hard optimization problem is to minimize the sum of the total penalty incurred by all the aircraft for arriving earlier or later than their preferred landing times. For a problem variant that optimi"},"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":"1311.2880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T14:37:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6fb0b4c0eaaf8d07a1fa1965bcca413b6303c485e622b696fe0895139bc99cc9","abstract_canon_sha256":"e74575960ceb5830955a024533b3ba0d992d89176c5fb229b488f2f8601b4ce5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.561020Z","signature_b64":"sE5prhvA4DXkyTtAe1ksiRhjkEB550ZX4sBBmDOaseoVX1zXhych94Pdi1/SBASPJxRpiPPAsJ535BuK8m8wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8cc689b9213fbfbdbd6256877c1aacd2845735092a0f78b2f9cdc882513543e","last_reissued_at":"2026-05-18T00:57:52.560337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.560337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aircraft Landing Problem: Efficient Algorithm for a Given Landing Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Abhishek Awasthi, J\\\"org L\\\"assig, Oliver Kramer","submitted_at":"2013-10-26T14:37:47Z","abstract_excerpt":"In this paper, we investigate a special case of the static aircraft landing problem (ALP) with the objective to optimize landing sequences and landing times for a set of air planes. The problem is to land the planes on one or multiple runways within a time window as close as possible to the preferable target landing time, maintaining a safety distance constraint. The objective of this well-known NP-hard optimization problem is to minimize the sum of the total penalty incurred by all the aircraft for arriving earlier or later than their preferred landing times. For a problem variant that optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2880","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":"1311.2880","created_at":"2026-05-18T00:57:52.560439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2880v1","created_at":"2026-05-18T00:57:52.560439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2880","created_at":"2026-05-18T00:57:52.560439+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DGGRG4SCP57","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DGGRG4SCP57XW6W","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DGGRG4S","created_at":"2026-05-18T12:27:34.582898+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/5DGGRG4SCP57XW6WEVUHPQNKZU","json":"https://pith.science/pith/5DGGRG4SCP57XW6WEVUHPQNKZU.json","graph_json":"https://pith.science/api/pith-number/5DGGRG4SCP57XW6WEVUHPQNKZU/graph.json","events_json":"https://pith.science/api/pith-number/5DGGRG4SCP57XW6WEVUHPQNKZU/events.json","paper":"https://pith.science/paper/5DGGRG4S"},"agent_actions":{"view_html":"https://pith.science/pith/5DGGRG4SCP57XW6WEVUHPQNKZU","download_json":"https://pith.science/pith/5DGGRG4SCP57XW6WEVUHPQNKZU.json","view_paper":"https://pith.science/paper/5DGGRG4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2880&json=true","fetch_graph":"https://pith.science/api/pith-number/5DGGRG4SCP57XW6WEVUHPQNKZU/graph.json","fetch_events":"https://pith.science/api/pith-number/5DGGRG4SCP57XW6WEVUHPQNKZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DGGRG4SCP57XW6WEVUHPQNKZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DGGRG4SCP57XW6WEVUHPQNKZU/action/storage_attestation","attest_author":"https://pith.science/pith/5DGGRG4SCP57XW6WEVUHPQNKZU/action/author_attestation","sign_citation":"https://pith.science/pith/5DGGRG4SCP57XW6WEVUHPQNKZU/action/citation_signature","submit_replication":"https://pith.science/pith/5DGGRG4SCP57XW6WEVUHPQNKZU/action/replication_record"}},"created_at":"2026-05-18T00:57:52.560439+00:00","updated_at":"2026-05-18T00:57:52.560439+00:00"}