{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IFMFQGK5QRNT4TC6ICZBRXJU4R","short_pith_number":"pith:IFMFQGK5","canonical_record":{"source":{"id":"1708.09338","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-30T16:09:16Z","cross_cats_sorted":[],"title_canon_sha256":"46d614a8118c233034c62f79e10c832628b17867eec012c4d98949f349551f9c","abstract_canon_sha256":"447a33ae44d68b91c05bdf39ec211b054eced711ba0ead0cb93fc424b6f08282"},"schema_version":"1.0"},"canonical_sha256":"415858195d845b3e4c5e40b218dd34e443d525a40fd0e97216f4cf4eb52eb8e7","source":{"kind":"arxiv","id":"1708.09338","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09338","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09338v3","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09338","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"pith_short_12","alias_value":"IFMFQGK5QRNT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IFMFQGK5QRNT4TC6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IFMFQGK5","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IFMFQGK5QRNT4TC6ICZBRXJU4R","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09338","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-30T16:09:16Z","cross_cats_sorted":[],"title_canon_sha256":"46d614a8118c233034c62f79e10c832628b17867eec012c4d98949f349551f9c","abstract_canon_sha256":"447a33ae44d68b91c05bdf39ec211b054eced711ba0ead0cb93fc424b6f08282"},"schema_version":"1.0"},"canonical_sha256":"415858195d845b3e4c5e40b218dd34e443d525a40fd0e97216f4cf4eb52eb8e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:27.759024Z","signature_b64":"Gg7MjDrJUFBSYZPwM9iqF1JNXoiTFo5oQm7RXy+oO/Ajvjwro1vTUoLgYf7tEdJBcG1pzIMDQW2kemR8eBuFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"415858195d845b3e4c5e40b218dd34e443d525a40fd0e97216f4cf4eb52eb8e7","last_reissued_at":"2026-05-17T23:39:27.758256Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:27.758256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09338","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ylvnwULNKEjoRWKu4mR4LuflduugZ7i5/3+b07SbFdyTKg19tmHyq09XDawAd2fSC6QwskBOLiaZ9nA8U3pIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:29:13.743265Z"},"content_sha256":"235ab466c207a23d402d347f27fe0858cbe92814ec2d26574f94c012df0e2253","schema_version":"1.0","event_id":"sha256:235ab466c207a23d402d347f27fe0858cbe92814ec2d26574f94c012df0e2253"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IFMFQGK5QRNT4TC6ICZBRXJU4R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balanced scheduling of school bus trips using a perfect matching heuristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Haghani, Ali Shafahi, Sanaz Aliari","submitted_at":"2017-08-30T16:09:16Z","abstract_excerpt":"In the school bus scheduling problem, the main contributing factor to the cost is the number of buses needed for the operations. However, in the case of subcontracting the transportation of pupils, unbalanced tours can increase the costs significantly as the lengths of some tours can exceed the daily fixed driving goal and will result in over-hour charges. This paper proposes a Mixed Integer Programming (MIP) model and a matching-based heuristic algorithm to solve the balanced school bus scheduling problem in a multi-school setting. The heuristic is guaranteed to find the minimum number of bus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09338","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vis+JugBfFvZSwplwX2Hg0uUn03zAvtCq+cU/eyCiw1pZps9yYj7zDQFi9o0u/VZeP4o1lxOWc4a6iwajfFvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:29:13.743687Z"},"content_sha256":"ffabd697eb72cd18879a23d045a86699e23175005ef7994eef71218d8c577834","schema_version":"1.0","event_id":"sha256:ffabd697eb72cd18879a23d045a86699e23175005ef7994eef71218d8c577834"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFMFQGK5QRNT4TC6ICZBRXJU4R/bundle.json","state_url":"https://pith.science/pith/IFMFQGK5QRNT4TC6ICZBRXJU4R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFMFQGK5QRNT4TC6ICZBRXJU4R/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T21:29:13Z","links":{"resolver":"https://pith.science/pith/IFMFQGK5QRNT4TC6ICZBRXJU4R","bundle":"https://pith.science/pith/IFMFQGK5QRNT4TC6ICZBRXJU4R/bundle.json","state":"https://pith.science/pith/IFMFQGK5QRNT4TC6ICZBRXJU4R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFMFQGK5QRNT4TC6ICZBRXJU4R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IFMFQGK5QRNT4TC6ICZBRXJU4R","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":"447a33ae44d68b91c05bdf39ec211b054eced711ba0ead0cb93fc424b6f08282","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-30T16:09:16Z","title_canon_sha256":"46d614a8118c233034c62f79e10c832628b17867eec012c4d98949f349551f9c"},"schema_version":"1.0","source":{"id":"1708.09338","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09338","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09338v3","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09338","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"pith_short_12","alias_value":"IFMFQGK5QRNT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IFMFQGK5QRNT4TC6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IFMFQGK5","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:ffabd697eb72cd18879a23d045a86699e23175005ef7994eef71218d8c577834","target":"graph","created_at":"2026-05-17T23:39:27Z","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":"In the school bus scheduling problem, the main contributing factor to the cost is the number of buses needed for the operations. However, in the case of subcontracting the transportation of pupils, unbalanced tours can increase the costs significantly as the lengths of some tours can exceed the daily fixed driving goal and will result in over-hour charges. This paper proposes a Mixed Integer Programming (MIP) model and a matching-based heuristic algorithm to solve the balanced school bus scheduling problem in a multi-school setting. The heuristic is guaranteed to find the minimum number of bus","authors_text":"Ali Haghani, Ali Shafahi, Sanaz Aliari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-30T16:09:16Z","title":"Balanced scheduling of school bus trips using a perfect matching heuristic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09338","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:235ab466c207a23d402d347f27fe0858cbe92814ec2d26574f94c012df0e2253","target":"record","created_at":"2026-05-17T23:39:27Z","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":"447a33ae44d68b91c05bdf39ec211b054eced711ba0ead0cb93fc424b6f08282","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-30T16:09:16Z","title_canon_sha256":"46d614a8118c233034c62f79e10c832628b17867eec012c4d98949f349551f9c"},"schema_version":"1.0","source":{"id":"1708.09338","kind":"arxiv","version":3}},"canonical_sha256":"415858195d845b3e4c5e40b218dd34e443d525a40fd0e97216f4cf4eb52eb8e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"415858195d845b3e4c5e40b218dd34e443d525a40fd0e97216f4cf4eb52eb8e7","first_computed_at":"2026-05-17T23:39:27.758256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:27.758256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gg7MjDrJUFBSYZPwM9iqF1JNXoiTFo5oQm7RXy+oO/Ajvjwro1vTUoLgYf7tEdJBcG1pzIMDQW2kemR8eBuFCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:27.759024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09338","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:235ab466c207a23d402d347f27fe0858cbe92814ec2d26574f94c012df0e2253","sha256:ffabd697eb72cd18879a23d045a86699e23175005ef7994eef71218d8c577834"],"state_sha256":"03f445691c1927e8a3a7cc8862a013d022648c773e12e3260840b39416b08cfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZSL+k4UC50NKCwZ1n4/DET7xoX1ENlTaepmjhirMpyXHlbQROtdJ+Sp6wXvsRywMsCzWYy9DjRLuTmOh+NZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:29:13.747449Z","bundle_sha256":"dc93e488350b44d58c4332ad1f4b4f84538dd13c5d8e0e5e2faf62da17f56759"}}