{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EF7LZZIUCLHW43R3JYD6C5QILK","short_pith_number":"pith:EF7LZZIU","canonical_record":{"source":{"id":"1706.03097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-09T19:17:45Z","cross_cats_sorted":[],"title_canon_sha256":"288dc652d8131b907f73062f6fa3c206e53a640452fcd962c4b0e400c376bdf3","abstract_canon_sha256":"61118047a9da53252483b0d04933c080cfc6ef53ae33a353e767020ade54a7ee"},"schema_version":"1.0"},"canonical_sha256":"217ebce51412cf6e6e3b4e07e176085a8eb1e3623c579c49d13b121a6ae76da5","source":{"kind":"arxiv","id":"1706.03097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03097","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03097v1","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03097","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"EF7LZZIUCLHW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EF7LZZIUCLHW43R3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EF7LZZIU","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EF7LZZIUCLHW43R3JYD6C5QILK","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-09T19:17:45Z","cross_cats_sorted":[],"title_canon_sha256":"288dc652d8131b907f73062f6fa3c206e53a640452fcd962c4b0e400c376bdf3","abstract_canon_sha256":"61118047a9da53252483b0d04933c080cfc6ef53ae33a353e767020ade54a7ee"},"schema_version":"1.0"},"canonical_sha256":"217ebce51412cf6e6e3b4e07e176085a8eb1e3623c579c49d13b121a6ae76da5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:38.499032Z","signature_b64":"aHbjSZskG9M6Wxdhbm7n7FRRW0aGvi+dE2JUxy5MyJaLqzmJkWdFvie4Q+8MgfuvfIfC8ZUXGN4Bge1Gdjg2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"217ebce51412cf6e6e3b4e07e176085a8eb1e3623c579c49d13b121a6ae76da5","last_reissued_at":"2026-05-18T00:42:38.498507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:38.498507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03097","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:42:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chbL5g1dEzyyfGfB2YevTzUla/AYCU2m/tnR31jtDLQXTM3O44NzU+pAtjuRQzS0a8msmw76Es/MtHqlEJlCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:54:33.654868Z"},"content_sha256":"f8111844ea132209385fb388a4deb97a91dfd27202b96f2ede11fba162349516","schema_version":"1.0","event_id":"sha256:f8111844ea132209385fb388a4deb97a91dfd27202b96f2ede11fba162349516"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EF7LZZIUCLHW43R3JYD6C5QILK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Vehicle Routing Problem with Service Level Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Minh Ho\\`ang H\\`a, Rafael Martinelli, Teobaldo Bulh\\~oes, Thibaut Vidal","submitted_at":"2017-06-09T19:17:45Z","abstract_excerpt":"We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03097","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:42:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OP3NwcqlxVgzs1JkW0b+tLQGTczyRDZQxci3Bq54RM8jzroqVof6MwvrZL4kHxa2zMzNdWmQSeI8Yli/3/uPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:54:33.655564Z"},"content_sha256":"dde71f5f356acf2912b2e07ec2aea6f42d237a0cf4e1cd80d5f3da9e9da9a389","schema_version":"1.0","event_id":"sha256:dde71f5f356acf2912b2e07ec2aea6f42d237a0cf4e1cd80d5f3da9e9da9a389"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK/bundle.json","state_url":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EF7LZZIUCLHW43R3JYD6C5QILK/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-05-27T01:54:33Z","links":{"resolver":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK","bundle":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK/bundle.json","state":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EF7LZZIUCLHW43R3JYD6C5QILK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EF7LZZIUCLHW43R3JYD6C5QILK","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":"61118047a9da53252483b0d04933c080cfc6ef53ae33a353e767020ade54a7ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-09T19:17:45Z","title_canon_sha256":"288dc652d8131b907f73062f6fa3c206e53a640452fcd962c4b0e400c376bdf3"},"schema_version":"1.0","source":{"id":"1706.03097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03097","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03097v1","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03097","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"EF7LZZIUCLHW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EF7LZZIUCLHW43R3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EF7LZZIU","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:dde71f5f356acf2912b2e07ec2aea6f42d237a0cf4e1cd80d5f3da9e9da9a389","target":"graph","created_at":"2026-05-18T00:42:38Z","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":"We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which","authors_text":"Minh Ho\\`ang H\\`a, Rafael Martinelli, Teobaldo Bulh\\~oes, Thibaut Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-09T19:17:45Z","title":"The Vehicle Routing Problem with Service Level Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03097","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:f8111844ea132209385fb388a4deb97a91dfd27202b96f2ede11fba162349516","target":"record","created_at":"2026-05-18T00:42:38Z","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":"61118047a9da53252483b0d04933c080cfc6ef53ae33a353e767020ade54a7ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-09T19:17:45Z","title_canon_sha256":"288dc652d8131b907f73062f6fa3c206e53a640452fcd962c4b0e400c376bdf3"},"schema_version":"1.0","source":{"id":"1706.03097","kind":"arxiv","version":1}},"canonical_sha256":"217ebce51412cf6e6e3b4e07e176085a8eb1e3623c579c49d13b121a6ae76da5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"217ebce51412cf6e6e3b4e07e176085a8eb1e3623c579c49d13b121a6ae76da5","first_computed_at":"2026-05-18T00:42:38.498507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:38.498507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aHbjSZskG9M6Wxdhbm7n7FRRW0aGvi+dE2JUxy5MyJaLqzmJkWdFvie4Q+8MgfuvfIfC8ZUXGN4Bge1Gdjg2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:38.499032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8111844ea132209385fb388a4deb97a91dfd27202b96f2ede11fba162349516","sha256:dde71f5f356acf2912b2e07ec2aea6f42d237a0cf4e1cd80d5f3da9e9da9a389"],"state_sha256":"df076e3ad051f9045b2b0da04bc5981579a492acebb094197dabb0dbb1ac81a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JqkdnGnpxh/Ibmet1WelcbCqzeYsGwmoRgj/RW8pBOkXEXsmw7hbshWIYG3mePtqZEX9yJjt9ieTr3y8KfBSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:54:33.658957Z","bundle_sha256":"eaffbc009a7095b3d6ffccf305f3b232364e0ef1850a077c4a2e979914748bb5"}}