{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:NXYD2OOFSKTCKHO7ABCDPNKFZF","short_pith_number":"pith:NXYD2OOF","schema_version":"1.0","canonical_sha256":"6df03d39c592a6251ddf004437b545c96119d69dbcc29ffac761873db21998df","source":{"kind":"arxiv","id":"cs/0609145","version":1},"attestation_state":"computed","paper":{"title":"A Semidefinite Relaxation for Air Traffic Flow Scheduling","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Alexandre d'Aspremont, Laurent El Ghaoui","submitted_at":"2006-09-26T15:34:40Z","abstract_excerpt":"We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation techniques to form a convex relaxation of that problem. Finally, we present a randomization algorithm to further improve the quality of the solution. Because of the specific structure of the air traffic flow problem, the relaxation has a single semidefinite constraint of size dn where d is the maximum delay and n the number of flights."},"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":"cs/0609145","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CE","submitted_at":"2006-09-26T15:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"0910560371208950bf37f3d91c78d4db4cae514e5aff1e08c806c662d759776e","abstract_canon_sha256":"33e75b895b4f26d088243d934fb91acd726a5445c034591cba7052e7fa10cc35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:56:27.920719Z","signature_b64":"oI0pCYyJvqP574C0W2jPDXKlQyCPulSBbSBPR16n+LBA5tdU3f9BMIyFEg+FuwUcrHAOITjO9GFUS2BEOPQYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6df03d39c592a6251ddf004437b545c96119d69dbcc29ffac761873db21998df","last_reissued_at":"2026-07-04T14:56:27.920296Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:56:27.920296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Semidefinite Relaxation for Air Traffic Flow Scheduling","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Alexandre d'Aspremont, Laurent El Ghaoui","submitted_at":"2006-09-26T15:34:40Z","abstract_excerpt":"We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation techniques to form a convex relaxation of that problem. Finally, we present a randomization algorithm to further improve the quality of the solution. Because of the specific structure of the air traffic flow problem, the relaxation has a single semidefinite constraint of size dn where d is the maximum delay and n the number of flights."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0609145","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/cs/0609145/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":"cs/0609145","created_at":"2026-07-04T14:56:27.920370+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0609145v1","created_at":"2026-07-04T14:56:27.920370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0609145","created_at":"2026-07-04T14:56:27.920370+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXYD2OOFSKTC","created_at":"2026-07-04T14:56:27.920370+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXYD2OOFSKTCKHO7","created_at":"2026-07-04T14:56:27.920370+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXYD2OOF","created_at":"2026-07-04T14:56:27.920370+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/NXYD2OOFSKTCKHO7ABCDPNKFZF","json":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF.json","graph_json":"https://pith.science/api/pith-number/NXYD2OOFSKTCKHO7ABCDPNKFZF/graph.json","events_json":"https://pith.science/api/pith-number/NXYD2OOFSKTCKHO7ABCDPNKFZF/events.json","paper":"https://pith.science/paper/NXYD2OOF"},"agent_actions":{"view_html":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF","download_json":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF.json","view_paper":"https://pith.science/paper/NXYD2OOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0609145&json=true","fetch_graph":"https://pith.science/api/pith-number/NXYD2OOFSKTCKHO7ABCDPNKFZF/graph.json","fetch_events":"https://pith.science/api/pith-number/NXYD2OOFSKTCKHO7ABCDPNKFZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/action/storage_attestation","attest_author":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/action/author_attestation","sign_citation":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/action/citation_signature","submit_replication":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/action/replication_record"}},"created_at":"2026-07-04T14:56:27.920370+00:00","updated_at":"2026-07-04T14:56:27.920370+00:00"}