{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YDRAEL7A7M7U54ABDQ4HBDYDST","short_pith_number":"pith:YDRAEL7A","canonical_record":{"source":{"id":"1807.05311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T00:17:10Z","cross_cats_sorted":[],"title_canon_sha256":"fa4d8ed085d56aceab8fc4b3007ba326a04c3deff710c3d8c8c0f5ef3760902f","abstract_canon_sha256":"9c10756d5bd4b22e294a189d62e2a8c56b590798338066b7bc4df2cfa708334e"},"schema_version":"1.0"},"canonical_sha256":"c0e2022fe0fb3f4ef0011c38708f0394ebb634110e6fd807dd6804a34c076e70","source":{"kind":"arxiv","id":"1807.05311","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05311","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05311v1","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05311","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"YDRAEL7A7M7U","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDRAEL7A7M7U54AB","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDRAEL7A","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YDRAEL7A7M7U54ABDQ4HBDYDST","target":"record","payload":{"canonical_record":{"source":{"id":"1807.05311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T00:17:10Z","cross_cats_sorted":[],"title_canon_sha256":"fa4d8ed085d56aceab8fc4b3007ba326a04c3deff710c3d8c8c0f5ef3760902f","abstract_canon_sha256":"9c10756d5bd4b22e294a189d62e2a8c56b590798338066b7bc4df2cfa708334e"},"schema_version":"1.0"},"canonical_sha256":"c0e2022fe0fb3f4ef0011c38708f0394ebb634110e6fd807dd6804a34c076e70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:35.449444Z","signature_b64":"BXJJB4TmSkcz4NcA1+WjxHwLroIo3MMQw+Gz4CIhey2Aq+e2ljccSmrfsyAbKB7KHVGFpd0AMOnhz22WbBJ+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e2022fe0fb3f4ef0011c38708f0394ebb634110e6fd807dd6804a34c076e70","last_reissued_at":"2026-05-18T00:04:35.448999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:35.448999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.05311","source_version":1,"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-18T00:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yBM7oaSef4Azm2t9KwK6QuWGXHhKFyUUFhQbT1lQYH2gpgymkLHyxwSmqT3frwTuTpy+8B9ZXGe05PTUajUYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:56:21.699959Z"},"content_sha256":"596eab458005f5d18e231a448dfd4db47fa45ca75a584cc9aba686b5f75b19eb","schema_version":"1.0","event_id":"sha256:596eab458005f5d18e231a448dfd4db47fa45ca75a584cc9aba686b5f75b19eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YDRAEL7A7M7U54ABDQ4HBDYDST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A matching-based heuristic algorithm for school bus routing problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Haghani, Ali Shafahi, Zhongxiang Wang","submitted_at":"2018-07-14T00:17:10Z","abstract_excerpt":"School bus planning problem (SBPP) has drawn much research attention due to the huge costs of school transportation. In the literature, the SBPP is usually decomposed into the routing and scheduling subproblems due to its complexity. Because of the nature of the decomposition, even if all the subproblems are solved to optimality, the final solution may not be as good as the solution from the integrated model. In this paper, we present a new approach that incorporates the scheduling information (namely the trip compatibility) into the routing stage such that the interrelationship between the su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05311","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":""},"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-18T00:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2xCPj1sJrDPhrcXI8dtuUlVFtCfK6Uxi7/cw46LKvFeuj93TfWTn02RJpOFqMT2GgiXDQy2VknJ3Zc4ciipDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:56:21.700684Z"},"content_sha256":"f1210379ee94f07056bad15f81d9273eb6948e2cd45460250fe081fa9f02e27e","schema_version":"1.0","event_id":"sha256:f1210379ee94f07056bad15f81d9273eb6948e2cd45460250fe081fa9f02e27e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDRAEL7A7M7U54ABDQ4HBDYDST/bundle.json","state_url":"https://pith.science/pith/YDRAEL7A7M7U54ABDQ4HBDYDST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDRAEL7A7M7U54ABDQ4HBDYDST/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-11T19:56:21Z","links":{"resolver":"https://pith.science/pith/YDRAEL7A7M7U54ABDQ4HBDYDST","bundle":"https://pith.science/pith/YDRAEL7A7M7U54ABDQ4HBDYDST/bundle.json","state":"https://pith.science/pith/YDRAEL7A7M7U54ABDQ4HBDYDST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDRAEL7A7M7U54ABDQ4HBDYDST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YDRAEL7A7M7U54ABDQ4HBDYDST","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":"9c10756d5bd4b22e294a189d62e2a8c56b590798338066b7bc4df2cfa708334e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T00:17:10Z","title_canon_sha256":"fa4d8ed085d56aceab8fc4b3007ba326a04c3deff710c3d8c8c0f5ef3760902f"},"schema_version":"1.0","source":{"id":"1807.05311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05311","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05311v1","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05311","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"YDRAEL7A7M7U","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDRAEL7A7M7U54AB","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDRAEL7A","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:f1210379ee94f07056bad15f81d9273eb6948e2cd45460250fe081fa9f02e27e","target":"graph","created_at":"2026-05-18T00:04:35Z","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":"School bus planning problem (SBPP) has drawn much research attention due to the huge costs of school transportation. In the literature, the SBPP is usually decomposed into the routing and scheduling subproblems due to its complexity. Because of the nature of the decomposition, even if all the subproblems are solved to optimality, the final solution may not be as good as the solution from the integrated model. In this paper, we present a new approach that incorporates the scheduling information (namely the trip compatibility) into the routing stage such that the interrelationship between the su","authors_text":"Ali Haghani, Ali Shafahi, Zhongxiang Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T00:17:10Z","title":"A matching-based heuristic algorithm for school bus routing problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05311","kind":"arxiv","version":1},"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:596eab458005f5d18e231a448dfd4db47fa45ca75a584cc9aba686b5f75b19eb","target":"record","created_at":"2026-05-18T00:04:35Z","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":"9c10756d5bd4b22e294a189d62e2a8c56b590798338066b7bc4df2cfa708334e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T00:17:10Z","title_canon_sha256":"fa4d8ed085d56aceab8fc4b3007ba326a04c3deff710c3d8c8c0f5ef3760902f"},"schema_version":"1.0","source":{"id":"1807.05311","kind":"arxiv","version":1}},"canonical_sha256":"c0e2022fe0fb3f4ef0011c38708f0394ebb634110e6fd807dd6804a34c076e70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0e2022fe0fb3f4ef0011c38708f0394ebb634110e6fd807dd6804a34c076e70","first_computed_at":"2026-05-18T00:04:35.448999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:35.448999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BXJJB4TmSkcz4NcA1+WjxHwLroIo3MMQw+Gz4CIhey2Aq+e2ljccSmrfsyAbKB7KHVGFpd0AMOnhz22WbBJ+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:35.449444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:596eab458005f5d18e231a448dfd4db47fa45ca75a584cc9aba686b5f75b19eb","sha256:f1210379ee94f07056bad15f81d9273eb6948e2cd45460250fe081fa9f02e27e"],"state_sha256":"781bd13788c85b3c091f42d3c20b4677e22931ef8eb5ba11903f7bfcb6297064"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFH+OSZOz4S4TkxL3ScQb+tuJdALZ7VU6iu/Hd3Zn34r6iZ+MrMbsY1XUv6u/1a4K5ozbP/aJEUIX4JNAnwEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:56:21.704243Z","bundle_sha256":"2d9a085eeb1e476a98104629f6381993138067103f6a2c37f386e0745522fdf3"}}