{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OEFYYED3KHIZCT4UIQFAFTRO7N","short_pith_number":"pith:OEFYYED3","canonical_record":{"source":{"id":"1612.01691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-06T07:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"f3de298d9fb9f29a7d33eb1c31f46385852e4ac8c649abca51d12fa5413f0f35","abstract_canon_sha256":"0d852a362af23b5a6069a14cf9c1045f1c62a302e09a0aa54c2a83ad4ce1da5c"},"schema_version":"1.0"},"canonical_sha256":"710b8c107b51d1914f94440a02ce2efb4674efcb49bebb32e13efcc855193f78","source":{"kind":"arxiv","id":"1612.01691","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01691","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01691v1","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01691","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"OEFYYED3KHIZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OEFYYED3KHIZCT4U","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OEFYYED3","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OEFYYED3KHIZCT4UIQFAFTRO7N","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-06T07:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"f3de298d9fb9f29a7d33eb1c31f46385852e4ac8c649abca51d12fa5413f0f35","abstract_canon_sha256":"0d852a362af23b5a6069a14cf9c1045f1c62a302e09a0aa54c2a83ad4ce1da5c"},"schema_version":"1.0"},"canonical_sha256":"710b8c107b51d1914f94440a02ce2efb4674efcb49bebb32e13efcc855193f78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:47.820706Z","signature_b64":"/+0ynfvK7YVPQSnjrhOlloJSz17hyS+9/XeFNDfsZYZRx3QkaSACsocyM5c6uTJOK/KXq+k5ekLG+IMsBU2yAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"710b8c107b51d1914f94440a02ce2efb4674efcb49bebb32e13efcc855193f78","last_reissued_at":"2026-05-18T00:55:47.820186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:47.820186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01691","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:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n20OrfZKw6xpXF5b550FzFRJUdIhDTG2eVLWFl+STI5p9PiTipcmWocDu52cazA08ZjxY2jwf9mQGMEzYXs7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T02:01:01.131157Z"},"content_sha256":"1fc5d56b4e0f80837d1c42aa10b7e2e58e4d04481e9504c55ed93a3279b8d41e","schema_version":"1.0","event_id":"sha256:1fc5d56b4e0f80837d1c42aa10b7e2e58e4d04481e9504c55ed93a3279b8d41e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OEFYYED3KHIZCT4UIQFAFTRO7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fleet Size and Mix Split-Delivery Vehicle Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arthur Mah\\'eo, Philip Kilby, Tommaso Urli","submitted_at":"2016-12-06T07:46:41Z","abstract_excerpt":"In the classic Vehicle Routing Problem (VRP) a fleet of of vehicles has to visit a set of customers while minimising the operations' costs. We study a rich variant of the VRP featuring split deliveries, an heterogeneous fleet, and vehicle-commodity incompatibility constraints. Our goal is twofold: define the cheapest routing and the most adequate fleet.\n  To do so, we split the problem into two interdependent components: a fleet design component and a routing component. First, we define two Mixed Integer Programming (MIP) formulations for each component. Then we discuss several improvements in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01691","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:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7hHjEFQIOFy+KJAN54zolGV8yx4I3NiHxSWkqEleUKaLjwvHmCydPdyZ8/YGEoThRhuLVSOMRtWVlbHFJUsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T02:01:01.131507Z"},"content_sha256":"0f9d7ab8e0d225e8fbad0e6d4d0968b32d750670b3ccf531b82622c40e12982c","schema_version":"1.0","event_id":"sha256:0f9d7ab8e0d225e8fbad0e6d4d0968b32d750670b3ccf531b82622c40e12982c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/bundle.json","state_url":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/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-29T02:01:01Z","links":{"resolver":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N","bundle":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/bundle.json","state":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OEFYYED3KHIZCT4UIQFAFTRO7N","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":"0d852a362af23b5a6069a14cf9c1045f1c62a302e09a0aa54c2a83ad4ce1da5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-06T07:46:41Z","title_canon_sha256":"f3de298d9fb9f29a7d33eb1c31f46385852e4ac8c649abca51d12fa5413f0f35"},"schema_version":"1.0","source":{"id":"1612.01691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01691","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01691v1","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01691","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"OEFYYED3KHIZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OEFYYED3KHIZCT4U","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OEFYYED3","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:0f9d7ab8e0d225e8fbad0e6d4d0968b32d750670b3ccf531b82622c40e12982c","target":"graph","created_at":"2026-05-18T00:55:47Z","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 classic Vehicle Routing Problem (VRP) a fleet of of vehicles has to visit a set of customers while minimising the operations' costs. We study a rich variant of the VRP featuring split deliveries, an heterogeneous fleet, and vehicle-commodity incompatibility constraints. Our goal is twofold: define the cheapest routing and the most adequate fleet.\n  To do so, we split the problem into two interdependent components: a fleet design component and a routing component. First, we define two Mixed Integer Programming (MIP) formulations for each component. Then we discuss several improvements in","authors_text":"Arthur Mah\\'eo, Philip Kilby, Tommaso Urli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-06T07:46:41Z","title":"Fleet Size and Mix Split-Delivery Vehicle Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01691","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:1fc5d56b4e0f80837d1c42aa10b7e2e58e4d04481e9504c55ed93a3279b8d41e","target":"record","created_at":"2026-05-18T00:55:47Z","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":"0d852a362af23b5a6069a14cf9c1045f1c62a302e09a0aa54c2a83ad4ce1da5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-06T07:46:41Z","title_canon_sha256":"f3de298d9fb9f29a7d33eb1c31f46385852e4ac8c649abca51d12fa5413f0f35"},"schema_version":"1.0","source":{"id":"1612.01691","kind":"arxiv","version":1}},"canonical_sha256":"710b8c107b51d1914f94440a02ce2efb4674efcb49bebb32e13efcc855193f78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"710b8c107b51d1914f94440a02ce2efb4674efcb49bebb32e13efcc855193f78","first_computed_at":"2026-05-18T00:55:47.820186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:47.820186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/+0ynfvK7YVPQSnjrhOlloJSz17hyS+9/XeFNDfsZYZRx3QkaSACsocyM5c6uTJOK/KXq+k5ekLG+IMsBU2yAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:47.820706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fc5d56b4e0f80837d1c42aa10b7e2e58e4d04481e9504c55ed93a3279b8d41e","sha256:0f9d7ab8e0d225e8fbad0e6d4d0968b32d750670b3ccf531b82622c40e12982c"],"state_sha256":"ba4f4cb87f4f1b886ce9bbf57619eb6dd485ddbd85ae09de44cb9f6daecd9f9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6TnTpEnrC2BrLw73APEfdYzsANAxld+82y6w9luY7Tab9Jzkt2Hdg/cnWGxn4X74hZeVipY1L/99Rf4UBI78Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T02:01:01.133364Z","bundle_sha256":"35cbfb38b82c15bd12542240f8dd1428f0222c425c94c2612225d8c68aca8a30"}}