{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DTASUPQUV5IEZ4QNJU623BPZJR","short_pith_number":"pith:DTASUPQU","schema_version":"1.0","canonical_sha256":"1cc12a3e14af504cf20d4d3dad85f94c69f6c57ceb0c92f775d3f74dc1d0e2c1","source":{"kind":"arxiv","id":"2001.09297","version":1},"attestation_state":"computed","paper":{"title":"Vehicle Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Mirmojtaba Gharibi, Raouf Boutaba, Steven L. Waslander","submitted_at":"2020-01-25T11:45:25Z","abstract_excerpt":"We define a new problem called the Vehicle Scheduling Problem (VSP). The goal is to minimize an objective function, such as the number of tardy vehicles over a transportation network subject to maintaining safety distances, meeting hard deadlines, and maintaining speeds on each link between the allowed minimums and maximums. We prove VSP is an NP-hard problem for multiple objective functions that are commonly used in the context of job shop scheduling. With the number of tardy vehicles as the objective function, we formulate VSP in terms of a Mixed Integer Linear Programming (MIP) and design a"},"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":"2001.09297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-01-25T11:45:25Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"2c86fe48475ca0398872f5470bcdf32ca5de4a299301804cf1a38c259f6fbd03","abstract_canon_sha256":"aeec58f7af5fb41a7f9ffa400e0a308bf3baabd3405fc7ce334ecb9d6367598c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:58.054105Z","signature_b64":"CMCN6yxC+Sii84zESIgdcwNVi4zYSPm3fVFAPaWsib3V/a7790BI3jYlTiGP+Z169urMxB2kwRPj9sHcxXtKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cc12a3e14af504cf20d4d3dad85f94c69f6c57ceb0c92f775d3f74dc1d0e2c1","last_reissued_at":"2026-07-05T00:35:58.053690Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:58.053690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vehicle Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Mirmojtaba Gharibi, Raouf Boutaba, Steven L. Waslander","submitted_at":"2020-01-25T11:45:25Z","abstract_excerpt":"We define a new problem called the Vehicle Scheduling Problem (VSP). The goal is to minimize an objective function, such as the number of tardy vehicles over a transportation network subject to maintaining safety distances, meeting hard deadlines, and maintaining speeds on each link between the allowed minimums and maximums. We prove VSP is an NP-hard problem for multiple objective functions that are commonly used in the context of job shop scheduling. With the number of tardy vehicles as the objective function, we formulate VSP in terms of a Mixed Integer Linear Programming (MIP) and design a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.09297","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/2001.09297/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":"2001.09297","created_at":"2026-07-05T00:35:58.053747+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.09297v1","created_at":"2026-07-05T00:35:58.053747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.09297","created_at":"2026-07-05T00:35:58.053747+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTASUPQUV5IE","created_at":"2026-07-05T00:35:58.053747+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTASUPQUV5IEZ4QN","created_at":"2026-07-05T00:35:58.053747+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTASUPQU","created_at":"2026-07-05T00:35:58.053747+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/DTASUPQUV5IEZ4QNJU623BPZJR","json":"https://pith.science/pith/DTASUPQUV5IEZ4QNJU623BPZJR.json","graph_json":"https://pith.science/api/pith-number/DTASUPQUV5IEZ4QNJU623BPZJR/graph.json","events_json":"https://pith.science/api/pith-number/DTASUPQUV5IEZ4QNJU623BPZJR/events.json","paper":"https://pith.science/paper/DTASUPQU"},"agent_actions":{"view_html":"https://pith.science/pith/DTASUPQUV5IEZ4QNJU623BPZJR","download_json":"https://pith.science/pith/DTASUPQUV5IEZ4QNJU623BPZJR.json","view_paper":"https://pith.science/paper/DTASUPQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.09297&json=true","fetch_graph":"https://pith.science/api/pith-number/DTASUPQUV5IEZ4QNJU623BPZJR/graph.json","fetch_events":"https://pith.science/api/pith-number/DTASUPQUV5IEZ4QNJU623BPZJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTASUPQUV5IEZ4QNJU623BPZJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTASUPQUV5IEZ4QNJU623BPZJR/action/storage_attestation","attest_author":"https://pith.science/pith/DTASUPQUV5IEZ4QNJU623BPZJR/action/author_attestation","sign_citation":"https://pith.science/pith/DTASUPQUV5IEZ4QNJU623BPZJR/action/citation_signature","submit_replication":"https://pith.science/pith/DTASUPQUV5IEZ4QNJU623BPZJR/action/replication_record"}},"created_at":"2026-07-05T00:35:58.053747+00:00","updated_at":"2026-07-05T00:35:58.053747+00:00"}