{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZYNYVUGL6FWGOGZKIK2T5TDUVD","short_pith_number":"pith:ZYNYVUGL","schema_version":"1.0","canonical_sha256":"ce1b8ad0cbf16c671b2a42b53ecc74a8ebc6d6f0e8b2db0cbff406cdc414f07a","source":{"kind":"arxiv","id":"2111.11628","version":2},"attestation_state":"computed","paper":{"title":"$\\Delta$-MILP: Deep Space Network Scheduling via Mixed-Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Brian Wilson, Edwin Goh, Mark Johnston, Ramtin Madani, Ryan Alimo, Thomas Claudet","submitted_at":"2021-11-23T03:20:15Z","abstract_excerpt":"This paper introduces $\\Delta$-MILP, a powerful variant of the mixed-integer linear programming (MILP) optimization framework to solve NASA's Deep Space Network (DSN) scheduling problem. This work is an extension of our original MILP framework (DOI:10.1109/ACCESS.2021.3064928) and inherits many of its constructions and strengths, including the base MILP formulation for DSN scheduling. To provide more feasible schedules with respect to the DSN requirements, $\\Delta$-MILP incorporates new sets of constraints including 1) splitting larger tracks into shorter segments and 2) preventing overlapping"},"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":"2111.11628","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-11-23T03:20:15Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"c5d6839859f0ae0959d34c7f084ef815e9360fc9d1ee534801aff916e57a2f69","abstract_canon_sha256":"40420bd9c5e229d2491096af9a7111220270217a0d0cc82c5c4dad0cd4bb67a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:17:37.720281Z","signature_b64":"uJ+gN4J/VI762q/Ag+Wmirg1HPhDTr02WrekUK/56VxifgxoQHM4YOGAgbQaMJBhFUhXsBfpUBxyLhoxU0RBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce1b8ad0cbf16c671b2a42b53ecc74a8ebc6d6f0e8b2db0cbff406cdc414f07a","last_reissued_at":"2026-07-05T04:17:37.719785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:17:37.719785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\Delta$-MILP: Deep Space Network Scheduling via Mixed-Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Brian Wilson, Edwin Goh, Mark Johnston, Ramtin Madani, Ryan Alimo, Thomas Claudet","submitted_at":"2021-11-23T03:20:15Z","abstract_excerpt":"This paper introduces $\\Delta$-MILP, a powerful variant of the mixed-integer linear programming (MILP) optimization framework to solve NASA's Deep Space Network (DSN) scheduling problem. This work is an extension of our original MILP framework (DOI:10.1109/ACCESS.2021.3064928) and inherits many of its constructions and strengths, including the base MILP formulation for DSN scheduling. To provide more feasible schedules with respect to the DSN requirements, $\\Delta$-MILP incorporates new sets of constraints including 1) splitting larger tracks into shorter segments and 2) preventing overlapping"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.11628","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/2111.11628/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":"2111.11628","created_at":"2026-07-05T04:17:37.719841+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.11628v2","created_at":"2026-07-05T04:17:37.719841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.11628","created_at":"2026-07-05T04:17:37.719841+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYNYVUGL6FWG","created_at":"2026-07-05T04:17:37.719841+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYNYVUGL6FWGOGZK","created_at":"2026-07-05T04:17:37.719841+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYNYVUGL","created_at":"2026-07-05T04:17:37.719841+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/ZYNYVUGL6FWGOGZKIK2T5TDUVD","json":"https://pith.science/pith/ZYNYVUGL6FWGOGZKIK2T5TDUVD.json","graph_json":"https://pith.science/api/pith-number/ZYNYVUGL6FWGOGZKIK2T5TDUVD/graph.json","events_json":"https://pith.science/api/pith-number/ZYNYVUGL6FWGOGZKIK2T5TDUVD/events.json","paper":"https://pith.science/paper/ZYNYVUGL"},"agent_actions":{"view_html":"https://pith.science/pith/ZYNYVUGL6FWGOGZKIK2T5TDUVD","download_json":"https://pith.science/pith/ZYNYVUGL6FWGOGZKIK2T5TDUVD.json","view_paper":"https://pith.science/paper/ZYNYVUGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.11628&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYNYVUGL6FWGOGZKIK2T5TDUVD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYNYVUGL6FWGOGZKIK2T5TDUVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYNYVUGL6FWGOGZKIK2T5TDUVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYNYVUGL6FWGOGZKIK2T5TDUVD/action/storage_attestation","attest_author":"https://pith.science/pith/ZYNYVUGL6FWGOGZKIK2T5TDUVD/action/author_attestation","sign_citation":"https://pith.science/pith/ZYNYVUGL6FWGOGZKIK2T5TDUVD/action/citation_signature","submit_replication":"https://pith.science/pith/ZYNYVUGL6FWGOGZKIK2T5TDUVD/action/replication_record"}},"created_at":"2026-07-05T04:17:37.719841+00:00","updated_at":"2026-07-05T04:17:37.719841+00:00"}