{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YIV3FJM7B3M7QCV6CVDFIPA2NT","short_pith_number":"pith:YIV3FJM7","schema_version":"1.0","canonical_sha256":"c22bb2a59f0ed9f80abe1546543c1a6cf785a1543e3c622d5ebcf6dc92a5cc1d","source":{"kind":"arxiv","id":"1711.00530","version":2},"attestation_state":"computed","paper":{"title":"School bus routing by maximizing trip compatibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Ali Haghani, Ali Shafahi, Zhongxiang Wang","submitted_at":"2017-11-01T20:27:47Z","abstract_excerpt":"School bus planning is usually divided into routing and scheduling due to the complexity of solving them concurrently. However, the separation between these two steps may lead to worse solutions with higher overall costs than that from solving them together. When finding the minimal number of trips in the routing problem, neglecting the importance of trip compatibility may increase the number of buses actually needed in the scheduling problem. This paper proposes a new formulation for the multi-school homogeneous fleet routing problem that maximizes trip compatibility while minimizing total tr"},"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":"1711.00530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-01T20:27:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4e51c6dec80f86eb150370be2f06f78c1528d7af0bfb1b9adcd1ae5a296bdb98","abstract_canon_sha256":"f87a63010d85c1c60b4aac5ac737e083f99aa994f90a366699c87c80fb589b73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:33.876661Z","signature_b64":"MYiyBjZTH3sXZ5F32hCB+2ceVpjHLcK/sY5kQofG209pYdUwfx/Pvcm4tVZB2KFK44dgTAuwS2vnHOt91gfiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c22bb2a59f0ed9f80abe1546543c1a6cf785a1543e3c622d5ebcf6dc92a5cc1d","last_reissued_at":"2026-05-18T00:30:33.875857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:33.875857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"School bus routing by maximizing trip compatibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Ali Haghani, Ali Shafahi, Zhongxiang Wang","submitted_at":"2017-11-01T20:27:47Z","abstract_excerpt":"School bus planning is usually divided into routing and scheduling due to the complexity of solving them concurrently. However, the separation between these two steps may lead to worse solutions with higher overall costs than that from solving them together. When finding the minimal number of trips in the routing problem, neglecting the importance of trip compatibility may increase the number of buses actually needed in the scheduling problem. This paper proposes a new formulation for the multi-school homogeneous fleet routing problem that maximizes trip compatibility while minimizing total tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00530","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":""},"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":"1711.00530","created_at":"2026-05-18T00:30:33.875990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00530v2","created_at":"2026-05-18T00:30:33.875990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00530","created_at":"2026-05-18T00:30:33.875990+00:00"},{"alias_kind":"pith_short_12","alias_value":"YIV3FJM7B3M7","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YIV3FJM7B3M7QCV6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YIV3FJM7","created_at":"2026-05-18T12:31:56.362134+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/YIV3FJM7B3M7QCV6CVDFIPA2NT","json":"https://pith.science/pith/YIV3FJM7B3M7QCV6CVDFIPA2NT.json","graph_json":"https://pith.science/api/pith-number/YIV3FJM7B3M7QCV6CVDFIPA2NT/graph.json","events_json":"https://pith.science/api/pith-number/YIV3FJM7B3M7QCV6CVDFIPA2NT/events.json","paper":"https://pith.science/paper/YIV3FJM7"},"agent_actions":{"view_html":"https://pith.science/pith/YIV3FJM7B3M7QCV6CVDFIPA2NT","download_json":"https://pith.science/pith/YIV3FJM7B3M7QCV6CVDFIPA2NT.json","view_paper":"https://pith.science/paper/YIV3FJM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00530&json=true","fetch_graph":"https://pith.science/api/pith-number/YIV3FJM7B3M7QCV6CVDFIPA2NT/graph.json","fetch_events":"https://pith.science/api/pith-number/YIV3FJM7B3M7QCV6CVDFIPA2NT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YIV3FJM7B3M7QCV6CVDFIPA2NT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YIV3FJM7B3M7QCV6CVDFIPA2NT/action/storage_attestation","attest_author":"https://pith.science/pith/YIV3FJM7B3M7QCV6CVDFIPA2NT/action/author_attestation","sign_citation":"https://pith.science/pith/YIV3FJM7B3M7QCV6CVDFIPA2NT/action/citation_signature","submit_replication":"https://pith.science/pith/YIV3FJM7B3M7QCV6CVDFIPA2NT/action/replication_record"}},"created_at":"2026-05-18T00:30:33.875990+00:00","updated_at":"2026-05-18T00:30:33.875990+00:00"}