{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BDYLTHFUZGQXZ6OT6IRIUZLDQM","short_pith_number":"pith:BDYLTHFU","canonical_record":{"source":{"id":"1912.13157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-12-31T03:24:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"776356770ad9697f1e918de27c1908b65735647a21ff70eb9cecb1155a55de3f","abstract_canon_sha256":"24dcc2cd14ce7d165baae12e78e24be6739b5efd8ca869fee04baa8abb0b0774"},"schema_version":"1.0"},"canonical_sha256":"08f0b99cb4c9a17cf9d3f2228a65638315416f75373611d94a2e2bd0e9bc853a","source":{"kind":"arxiv","id":"1912.13157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.13157","created_at":"2026-07-05T00:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1912.13157v1","created_at":"2026-07-05T00:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.13157","created_at":"2026-07-05T00:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"BDYLTHFUZGQX","created_at":"2026-07-05T00:29:06Z"},{"alias_kind":"pith_short_16","alias_value":"BDYLTHFUZGQXZ6OT","created_at":"2026-07-05T00:29:06Z"},{"alias_kind":"pith_short_8","alias_value":"BDYLTHFU","created_at":"2026-07-05T00:29:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BDYLTHFUZGQXZ6OT6IRIUZLDQM","target":"record","payload":{"canonical_record":{"source":{"id":"1912.13157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-12-31T03:24:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"776356770ad9697f1e918de27c1908b65735647a21ff70eb9cecb1155a55de3f","abstract_canon_sha256":"24dcc2cd14ce7d165baae12e78e24be6739b5efd8ca869fee04baa8abb0b0774"},"schema_version":"1.0"},"canonical_sha256":"08f0b99cb4c9a17cf9d3f2228a65638315416f75373611d94a2e2bd0e9bc853a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:06.543063Z","signature_b64":"WNc49qk1lPTAeljT5qlgvr0K3KAtpbA4r8hLr7eBxqDAU4qp05hjAJWDtvemhCiEerGNoDdjsbPf/ThrRsxEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08f0b99cb4c9a17cf9d3f2228a65638315416f75373611d94a2e2bd0e9bc853a","last_reissued_at":"2026-07-05T00:29:06.542550Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:06.542550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.13157","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-07-05T00:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNz0lTnQ7gIyqqg0Zmi4SEjyYRMisqiaRRTcXdKMD5+7U1OceDvohbnjohJbZs4c8OSfttzh2DfBg5pM7ykMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:06:08.285456Z"},"content_sha256":"c4e9ff84b560d5ff49d9e70e16897011f1b9abe58933fedafdde492c36335e10","schema_version":"1.0","event_id":"sha256:c4e9ff84b560d5ff49d9e70e16897011f1b9abe58933fedafdde492c36335e10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BDYLTHFUZGQXZ6OT6IRIUZLDQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"C. H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Cody Wanless, Ehsan Khodabandeh, John Dennis, Joshua Hammond, Lawrence V. Snyder","submitted_at":"2019-12-31T03:24:46Z","abstract_excerpt":"We consider a wide family of vehicle routing problem variants with many complex and practical constraints, known as rich vehicle routing problems, which are faced on a daily basis by C.H. Robinson (CHR). Since CHR has many customers, each with distinct requirements, various routing problems with different objectives and constraints should be solved. We propose a set partitioning framework with a number of route generation algorithms, which have shown to be effective in solving a variety of different problems. The proposed algorithms have outperformed the existing technologies at CHR on 10 benc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.13157","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.13157/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"},"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-07-05T00:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1HdcKrQvVfFclOF8PIQmOTg4vR4iNFY51v+57SV5qDm0fFpTVxRj8bJUIha/H0vKzVGhcXmqPh74KQ2oxxwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:06:08.287973Z"},"content_sha256":"ff2fbc7dbd4f435640472c6c69cd4b81e97cab80290745eb19226e89d3612efb","schema_version":"1.0","event_id":"sha256:ff2fbc7dbd4f435640472c6c69cd4b81e97cab80290745eb19226e89d3612efb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/bundle.json","state_url":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/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-08-01T05:06:08Z","links":{"resolver":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM","bundle":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/bundle.json","state":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BDYLTHFUZGQXZ6OT6IRIUZLDQM","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":"24dcc2cd14ce7d165baae12e78e24be6739b5efd8ca869fee04baa8abb0b0774","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-12-31T03:24:46Z","title_canon_sha256":"776356770ad9697f1e918de27c1908b65735647a21ff70eb9cecb1155a55de3f"},"schema_version":"1.0","source":{"id":"1912.13157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.13157","created_at":"2026-07-05T00:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1912.13157v1","created_at":"2026-07-05T00:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.13157","created_at":"2026-07-05T00:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"BDYLTHFUZGQX","created_at":"2026-07-05T00:29:06Z"},{"alias_kind":"pith_short_16","alias_value":"BDYLTHFUZGQXZ6OT","created_at":"2026-07-05T00:29:06Z"},{"alias_kind":"pith_short_8","alias_value":"BDYLTHFU","created_at":"2026-07-05T00:29:06Z"}],"graph_snapshots":[{"event_id":"sha256:ff2fbc7dbd4f435640472c6c69cd4b81e97cab80290745eb19226e89d3612efb","target":"graph","created_at":"2026-07-05T00:29:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.13157/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a wide family of vehicle routing problem variants with many complex and practical constraints, known as rich vehicle routing problems, which are faced on a daily basis by C.H. Robinson (CHR). Since CHR has many customers, each with distinct requirements, various routing problems with different objectives and constraints should be solved. We propose a set partitioning framework with a number of route generation algorithms, which have shown to be effective in solving a variety of different problems. The proposed algorithms have outperformed the existing technologies at CHR on 10 benc","authors_text":"Cody Wanless, Ehsan Khodabandeh, John Dennis, Joshua Hammond, Lawrence V. Snyder","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-12-31T03:24:46Z","title":"C. H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.13157","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:c4e9ff84b560d5ff49d9e70e16897011f1b9abe58933fedafdde492c36335e10","target":"record","created_at":"2026-07-05T00:29:06Z","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":"24dcc2cd14ce7d165baae12e78e24be6739b5efd8ca869fee04baa8abb0b0774","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-12-31T03:24:46Z","title_canon_sha256":"776356770ad9697f1e918de27c1908b65735647a21ff70eb9cecb1155a55de3f"},"schema_version":"1.0","source":{"id":"1912.13157","kind":"arxiv","version":1}},"canonical_sha256":"08f0b99cb4c9a17cf9d3f2228a65638315416f75373611d94a2e2bd0e9bc853a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08f0b99cb4c9a17cf9d3f2228a65638315416f75373611d94a2e2bd0e9bc853a","first_computed_at":"2026-07-05T00:29:06.542550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:29:06.542550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WNc49qk1lPTAeljT5qlgvr0K3KAtpbA4r8hLr7eBxqDAU4qp05hjAJWDtvemhCiEerGNoDdjsbPf/ThrRsxEDA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:29:06.543063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.13157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4e9ff84b560d5ff49d9e70e16897011f1b9abe58933fedafdde492c36335e10","sha256:ff2fbc7dbd4f435640472c6c69cd4b81e97cab80290745eb19226e89d3612efb"],"state_sha256":"b477a9b4213bedad8f9352b272f4d523fa21e15c8a896e81cd7070397fd3c921"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4HuNcnArh7HiaUAIc5nkbU74DyfbBO6gjXfLLwiyRiL9JiDRJRlPX1C1gLwRGxvunTEaq05Q2XY5ZDCww2TDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T05:06:08.292219Z","bundle_sha256":"d78a9623151043fbbc8a50ab3abc36e5fc1f12d876b3eb8115f6071b0ad70b08"}}