{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MKJGJVEEP6KFGF5LDFUN7E6FYF","short_pith_number":"pith:MKJGJVEE","schema_version":"1.0","canonical_sha256":"629264d4847f945317ab1968df93c5c171306a2dbd1bea8130e962548977da36","source":{"kind":"arxiv","id":"2207.06772","version":2},"attestation_state":"computed","paper":{"title":"Driver Routing and Scheduling with Synchronization Constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Maximilian Schiffer, Pia Ammann, Rainer Kolisch","submitted_at":"2022-07-14T09:28:59Z","abstract_excerpt":"This paper investigates a novel type of driver routing and scheduling problem motivated by a practical application in long-distance bus networks. A key difference from other crew scheduling problems is that drivers can be exchanged between buses at arbitrary intermediate stops en route such that our problem requires additional synchronization constraints. We present a mathematical model for this problem that leverages a time-expanded multi-digraph and derive bounds for the total number of required drivers. Moreover, we develop a destructive-bound-enhanced matheuristic that converges to provabl"},"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":"2207.06772","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-07-14T09:28:59Z","cross_cats_sorted":[],"title_canon_sha256":"b4eacab5ac5e8deddc06133eae6a86f9dc86fcc7311cf7032f67c1b93c563a78","abstract_canon_sha256":"c52a0d89287462b16f194b59d1647adfb4d2e17a1a6fd3070733784b746ea295"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:19:41.455486Z","signature_b64":"cHO4S5TxfM0CJZLg1FUuhgoExBOXxPDx9dAIfG4GOWUQDahnxQ/vj93SxrYcxStb5KFjQI19Bjd7xMX+lvtgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"629264d4847f945317ab1968df93c5c171306a2dbd1bea8130e962548977da36","last_reissued_at":"2026-07-05T07:19:41.455086Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:19:41.455086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Driver Routing and Scheduling with Synchronization Constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Maximilian Schiffer, Pia Ammann, Rainer Kolisch","submitted_at":"2022-07-14T09:28:59Z","abstract_excerpt":"This paper investigates a novel type of driver routing and scheduling problem motivated by a practical application in long-distance bus networks. A key difference from other crew scheduling problems is that drivers can be exchanged between buses at arbitrary intermediate stops en route such that our problem requires additional synchronization constraints. We present a mathematical model for this problem that leverages a time-expanded multi-digraph and derive bounds for the total number of required drivers. Moreover, we develop a destructive-bound-enhanced matheuristic that converges to provabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06772","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/2207.06772/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":"2207.06772","created_at":"2026-07-05T07:19:41.455146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.06772v2","created_at":"2026-07-05T07:19:41.455146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06772","created_at":"2026-07-05T07:19:41.455146+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKJGJVEEP6KF","created_at":"2026-07-05T07:19:41.455146+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKJGJVEEP6KFGF5L","created_at":"2026-07-05T07:19:41.455146+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKJGJVEE","created_at":"2026-07-05T07:19:41.455146+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/MKJGJVEEP6KFGF5LDFUN7E6FYF","json":"https://pith.science/pith/MKJGJVEEP6KFGF5LDFUN7E6FYF.json","graph_json":"https://pith.science/api/pith-number/MKJGJVEEP6KFGF5LDFUN7E6FYF/graph.json","events_json":"https://pith.science/api/pith-number/MKJGJVEEP6KFGF5LDFUN7E6FYF/events.json","paper":"https://pith.science/paper/MKJGJVEE"},"agent_actions":{"view_html":"https://pith.science/pith/MKJGJVEEP6KFGF5LDFUN7E6FYF","download_json":"https://pith.science/pith/MKJGJVEEP6KFGF5LDFUN7E6FYF.json","view_paper":"https://pith.science/paper/MKJGJVEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.06772&json=true","fetch_graph":"https://pith.science/api/pith-number/MKJGJVEEP6KFGF5LDFUN7E6FYF/graph.json","fetch_events":"https://pith.science/api/pith-number/MKJGJVEEP6KFGF5LDFUN7E6FYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKJGJVEEP6KFGF5LDFUN7E6FYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKJGJVEEP6KFGF5LDFUN7E6FYF/action/storage_attestation","attest_author":"https://pith.science/pith/MKJGJVEEP6KFGF5LDFUN7E6FYF/action/author_attestation","sign_citation":"https://pith.science/pith/MKJGJVEEP6KFGF5LDFUN7E6FYF/action/citation_signature","submit_replication":"https://pith.science/pith/MKJGJVEEP6KFGF5LDFUN7E6FYF/action/replication_record"}},"created_at":"2026-07-05T07:19:41.455146+00:00","updated_at":"2026-07-05T07:19:41.455146+00:00"}