{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:NXYD2OOFSKTCKHO7ABCDPNKFZF","short_pith_number":"pith:NXYD2OOF","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"},"canonical_sha256":"6df03d39c592a6251ddf004437b545c96119d69dbcc29ffac761873db21998df","source":{"kind":"arxiv","id":"cs/0609145","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0609145","created_at":"2026-07-04T14:56:27Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0609145v1","created_at":"2026-07-04T14:56:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0609145","created_at":"2026-07-04T14:56:27Z"},{"alias_kind":"pith_short_12","alias_value":"NXYD2OOFSKTC","created_at":"2026-07-04T14:56:27Z"},{"alias_kind":"pith_short_16","alias_value":"NXYD2OOFSKTCKHO7","created_at":"2026-07-04T14:56:27Z"},{"alias_kind":"pith_short_8","alias_value":"NXYD2OOF","created_at":"2026-07-04T14:56:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:NXYD2OOFSKTCKHO7ABCDPNKFZF","target":"record","payload":{"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"},"canonical_sha256":"6df03d39c592a6251ddf004437b545c96119d69dbcc29ffac761873db21998df","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"},"source_kind":"arxiv","source_id":"cs/0609145","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-07-04T14:56:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clmO79kK0SAy9ES2so0ZMXlB5AN8jc+v9Tkqo02UTh9nGm55/PYiip4Ny/+HvCWDnTjeF67Mqq/WFks2VrM9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:10:53.004972Z"},"content_sha256":"903e4665a39a301c8e63e8f1d4620cb5d105bd603741069066c3acee586617f7","schema_version":"1.0","event_id":"sha256:903e4665a39a301c8e63e8f1d4620cb5d105bd603741069066c3acee586617f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:NXYD2OOFSKTCKHO7ABCDPNKFZF","target":"graph","payload":{"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"},"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-07-04T14:56:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWMgcoejIfFtM/Qjh7Zg2UWC8ES5Gy3fkLgJUKR0kZUPQM9mfc4Y47M/hmfumvy5DjnybM+vH93pm6DsMV34Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:10:53.005917Z"},"content_sha256":"bfdec200950b4fc3a68e48134d8b7846f329ecbdb6b111a623476df17cd9ffb2","schema_version":"1.0","event_id":"sha256:bfdec200950b4fc3a68e48134d8b7846f329ecbdb6b111a623476df17cd9ffb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/bundle.json","state_url":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/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-08-05T20:10:53Z","links":{"resolver":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF","bundle":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/bundle.json","state":"https://pith.science/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXYD2OOFSKTCKHO7ABCDPNKFZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:NXYD2OOFSKTCKHO7ABCDPNKFZF","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":"33e75b895b4f26d088243d934fb91acd726a5445c034591cba7052e7fa10cc35","cross_cats_sorted":[],"license":"","primary_cat":"cs.CE","submitted_at":"2006-09-26T15:34:40Z","title_canon_sha256":"0910560371208950bf37f3d91c78d4db4cae514e5aff1e08c806c662d759776e"},"schema_version":"1.0","source":{"id":"cs/0609145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0609145","created_at":"2026-07-04T14:56:27Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0609145v1","created_at":"2026-07-04T14:56:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0609145","created_at":"2026-07-04T14:56:27Z"},{"alias_kind":"pith_short_12","alias_value":"NXYD2OOFSKTC","created_at":"2026-07-04T14:56:27Z"},{"alias_kind":"pith_short_16","alias_value":"NXYD2OOFSKTCKHO7","created_at":"2026-07-04T14:56:27Z"},{"alias_kind":"pith_short_8","alias_value":"NXYD2OOF","created_at":"2026-07-04T14:56:27Z"}],"graph_snapshots":[{"event_id":"sha256:bfdec200950b4fc3a68e48134d8b7846f329ecbdb6b111a623476df17cd9ffb2","target":"graph","created_at":"2026-07-04T14:56:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0609145/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Alexandre d'Aspremont, Laurent El Ghaoui","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CE","submitted_at":"2006-09-26T15:34:40Z","title":"A Semidefinite Relaxation for Air Traffic Flow Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0609145","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:903e4665a39a301c8e63e8f1d4620cb5d105bd603741069066c3acee586617f7","target":"record","created_at":"2026-07-04T14:56:27Z","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":"33e75b895b4f26d088243d934fb91acd726a5445c034591cba7052e7fa10cc35","cross_cats_sorted":[],"license":"","primary_cat":"cs.CE","submitted_at":"2006-09-26T15:34:40Z","title_canon_sha256":"0910560371208950bf37f3d91c78d4db4cae514e5aff1e08c806c662d759776e"},"schema_version":"1.0","source":{"id":"cs/0609145","kind":"arxiv","version":1}},"canonical_sha256":"6df03d39c592a6251ddf004437b545c96119d69dbcc29ffac761873db21998df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6df03d39c592a6251ddf004437b545c96119d69dbcc29ffac761873db21998df","first_computed_at":"2026-07-04T14:56:27.920296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:56:27.920296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oI0pCYyJvqP574C0W2jPDXKlQyCPulSBbSBPR16n+LBA5tdU3f9BMIyFEg+FuwUcrHAOITjO9GFUS2BEOPQYCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:56:27.920719Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0609145","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:903e4665a39a301c8e63e8f1d4620cb5d105bd603741069066c3acee586617f7","sha256:bfdec200950b4fc3a68e48134d8b7846f329ecbdb6b111a623476df17cd9ffb2"],"state_sha256":"0debef27a2e7c314834b3002c8a0a9f40296f85c647da5882ca65c7634c644c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08BF58lQLqrnwYQUnwai9oughANuMMHiziOKcyIt62viUzUQcJBJGv8Dj1thbm9KyEXhwFO34u+bgafuTQ7wDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T20:10:53.011990Z","bundle_sha256":"b3df122ddf48735f4aaf6d3893c01e2bbcee48150ddde0b3dde4e8067a0cbac0"}}