{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4C6I26QBJZRRY4HYLRTUOKU4JB","short_pith_number":"pith:4C6I26QB","canonical_record":{"source":{"id":"1810.04348","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-10-10T03:11:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f7ac1ebd9c843f8b18f31bd7ed1334ba976e70a179ec04d3e2403da520539cda","abstract_canon_sha256":"4d0e09cff98da4aa85b0d0031b9ba315f756f6f582bd7444ce3fb3c9f5638d22"},"schema_version":"1.0"},"canonical_sha256":"e0bc8d7a014e631c70f85c67472a9c484d53418f9d0d77b8453457e54a700840","source":{"kind":"arxiv","id":"1810.04348","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04348","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04348v2","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04348","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"pith_short_12","alias_value":"4C6I26QBJZRR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4C6I26QBJZRRY4HY","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4C6I26QB","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4C6I26QBJZRRY4HYLRTUOKU4JB","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04348","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-10-10T03:11:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f7ac1ebd9c843f8b18f31bd7ed1334ba976e70a179ec04d3e2403da520539cda","abstract_canon_sha256":"4d0e09cff98da4aa85b0d0031b9ba315f756f6f582bd7444ce3fb3c9f5638d22"},"schema_version":"1.0"},"canonical_sha256":"e0bc8d7a014e631c70f85c67472a9c484d53418f9d0d77b8453457e54a700840","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:54.527676Z","signature_b64":"CEHfuip29NTGO7647aueysrm542VUYaMa6m2/dXkH27UIdNX2pDNh/MaNDIcQ2LCZI75TdTCT3RU+jPA+6wDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0bc8d7a014e631c70f85c67472a9c484d53418f9d0d77b8453457e54a700840","last_reissued_at":"2026-05-18T00:02:54.526956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:54.526956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04348","source_version":2,"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:02:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wS8m2qNIU7QoZTT/fv7GnpOtcDMcH6EiXea1Nknkp40QR7GNSopkUz0CRDzZhszrrUZ9emYjz/aJ35DPZ+mECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:14:46.557676Z"},"content_sha256":"c62b636506c2f834f6bd606151c7b343c89c42cfb3c01f045408fe9c6d25b6b4","schema_version":"1.0","event_id":"sha256:c62b636506c2f834f6bd606151c7b343c89c42cfb3c01f045408fe9c6d25b6b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4C6I26QBJZRRY4HYLRTUOKU4JB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Anirudh Subramanyam, Chrysanthos E. Gounaris, Panagiotis P. Repoussis","submitted_at":"2018-10-10T03:11:41Z","abstract_excerpt":"This paper studies robust variants of an extended model of the classical Heterogeneous Vehicle Routing Problem (HVRP), where a mixed fleet of vehicles with different capacities, availabilities, fixed costs and routing costs is used to serve customers with uncertain demand. This model includes, as special cases, all variants of the HVRP studied in the literature with fixed and unlimited fleet sizes, accessibility restrictions at customer locations, as well as multiple depots. Contrary to its deterministic counterpart, the goal of the robust HVRP is to determine a minimum-cost set of routes and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04348","kind":"arxiv","version":2},"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:02:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1nLr7QLP8SEQvG8I7SQ84UeMqy+cmiquPmGP8lhr2pkRoi/dRyvjC2vZ3WEcb+oiWJX/+A3POhT8EAsSZ6aBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:14:46.558221Z"},"content_sha256":"fafcb46c63ddd7a7b2ac27af928aeb99e280f630fbf1f2c5cde01d46083aa96f","schema_version":"1.0","event_id":"sha256:fafcb46c63ddd7a7b2ac27af928aeb99e280f630fbf1f2c5cde01d46083aa96f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4C6I26QBJZRRY4HYLRTUOKU4JB/bundle.json","state_url":"https://pith.science/pith/4C6I26QBJZRRY4HYLRTUOKU4JB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4C6I26QBJZRRY4HYLRTUOKU4JB/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-03T15:14:46Z","links":{"resolver":"https://pith.science/pith/4C6I26QBJZRRY4HYLRTUOKU4JB","bundle":"https://pith.science/pith/4C6I26QBJZRRY4HYLRTUOKU4JB/bundle.json","state":"https://pith.science/pith/4C6I26QBJZRRY4HYLRTUOKU4JB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4C6I26QBJZRRY4HYLRTUOKU4JB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4C6I26QBJZRRY4HYLRTUOKU4JB","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":"4d0e09cff98da4aa85b0d0031b9ba315f756f6f582bd7444ce3fb3c9f5638d22","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-10-10T03:11:41Z","title_canon_sha256":"f7ac1ebd9c843f8b18f31bd7ed1334ba976e70a179ec04d3e2403da520539cda"},"schema_version":"1.0","source":{"id":"1810.04348","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04348","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04348v2","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04348","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"pith_short_12","alias_value":"4C6I26QBJZRR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4C6I26QBJZRRY4HY","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4C6I26QB","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:fafcb46c63ddd7a7b2ac27af928aeb99e280f630fbf1f2c5cde01d46083aa96f","target":"graph","created_at":"2026-05-18T00:02:54Z","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":"This paper studies robust variants of an extended model of the classical Heterogeneous Vehicle Routing Problem (HVRP), where a mixed fleet of vehicles with different capacities, availabilities, fixed costs and routing costs is used to serve customers with uncertain demand. This model includes, as special cases, all variants of the HVRP studied in the literature with fixed and unlimited fleet sizes, accessibility restrictions at customer locations, as well as multiple depots. Contrary to its deterministic counterpart, the goal of the robust HVRP is to determine a minimum-cost set of routes and ","authors_text":"Anirudh Subramanyam, Chrysanthos E. Gounaris, Panagiotis P. Repoussis","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-10-10T03:11:41Z","title":"Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04348","kind":"arxiv","version":2},"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:c62b636506c2f834f6bd606151c7b343c89c42cfb3c01f045408fe9c6d25b6b4","target":"record","created_at":"2026-05-18T00:02:54Z","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":"4d0e09cff98da4aa85b0d0031b9ba315f756f6f582bd7444ce3fb3c9f5638d22","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-10-10T03:11:41Z","title_canon_sha256":"f7ac1ebd9c843f8b18f31bd7ed1334ba976e70a179ec04d3e2403da520539cda"},"schema_version":"1.0","source":{"id":"1810.04348","kind":"arxiv","version":2}},"canonical_sha256":"e0bc8d7a014e631c70f85c67472a9c484d53418f9d0d77b8453457e54a700840","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0bc8d7a014e631c70f85c67472a9c484d53418f9d0d77b8453457e54a700840","first_computed_at":"2026-05-18T00:02:54.526956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:54.526956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CEHfuip29NTGO7647aueysrm542VUYaMa6m2/dXkH27UIdNX2pDNh/MaNDIcQ2LCZI75TdTCT3RU+jPA+6wDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:54.527676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04348","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c62b636506c2f834f6bd606151c7b343c89c42cfb3c01f045408fe9c6d25b6b4","sha256:fafcb46c63ddd7a7b2ac27af928aeb99e280f630fbf1f2c5cde01d46083aa96f"],"state_sha256":"709879d8e95ba1dfefadadc4e768188a0969f5b4ef284738d55f9b898823e6c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OtajmfsO0+Gla0kBg8KiBkipUiy2vBuZhuFc6EFl7Jna3nYc8sRUBV1jiEUD4QPHnrPtUQF8BvBtQr4pDnAvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:14:46.560914Z","bundle_sha256":"5392353f7d5c559a5c9e23c5a23fb2f0c4afc999baf01425095ccbb9edb414a7"}}