{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KB4XU5QMKPDK7SIZ6AHS26F6ND","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":"51009cb511f982a9d63305ee5bafd389c65ed3538aff172f0e88d34b39ec64dc","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-01T20:29:15Z","title_canon_sha256":"7a82b2c40ed4ec069d60619f8a1d21d035e78bc52b6fe0dc84e5f9a0e32880e3"},"schema_version":"1.0","source":{"id":"1711.00532","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00532","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00532v3","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00532","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"KB4XU5QMKPDK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KB4XU5QMKPDK7SIZ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KB4XU5QM","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:b91ea700ec5b4c3180207e55e75a92b199e52b99195e5f97e6e7202218f5d6ea","target":"graph","created_at":"2026-05-18T00:18:53Z","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"},"paper":{"abstract_excerpt":"Safely serving the school transportation demand with the minimum number of buses is one of the highest financial goals of school transportation directors. To achieve that objective, a good and efficient way to solve the routing and scheduling problem is required. Due to the growth of the computing power, the spotlight has been shed on solving the combined problem of the school bus routing and scheduling problem. We show that an integrated multi-school bus routing and scheduling can be formulated with the help of trip compatibility. A novel decomposition algorithm is proposed to solve the integ","authors_text":"Ali Haghani, Ali Shafahi, Zhongxiang Wang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-01T20:29:15Z","title":"SCDA: School Compatibility Decomposition Algorithm for Solving the Multi-School Bus Routing and Scheduling Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00532","kind":"arxiv","version":3},"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:c38aa2446ad892ae5952c88b96e1228d1214b079346fd524647abb3cdf9001c2","target":"record","created_at":"2026-05-18T00:18:53Z","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":"51009cb511f982a9d63305ee5bafd389c65ed3538aff172f0e88d34b39ec64dc","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-01T20:29:15Z","title_canon_sha256":"7a82b2c40ed4ec069d60619f8a1d21d035e78bc52b6fe0dc84e5f9a0e32880e3"},"schema_version":"1.0","source":{"id":"1711.00532","kind":"arxiv","version":3}},"canonical_sha256":"50797a760c53c6afc919f00f2d78be68c488bed0ab04b696a2d117f250af55ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50797a760c53c6afc919f00f2d78be68c488bed0ab04b696a2d117f250af55ff","first_computed_at":"2026-05-18T00:18:53.046895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:53.046895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kVdiF2OzRmkvY+f4v7mpvftuCaVOru1p5yQTRm7ScRhWhdDhn1pDzdNv/MHnQ9zvTy//iKoiSrvZ7Q1o5d3nBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:53.047560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00532","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c38aa2446ad892ae5952c88b96e1228d1214b079346fd524647abb3cdf9001c2","sha256:b91ea700ec5b4c3180207e55e75a92b199e52b99195e5f97e6e7202218f5d6ea"],"state_sha256":"732ae4c42c2e02bca0acf4374412e93da89d17a46e9de3eb6ec0b18865d5b49a"}