{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S5VUT3A3RLVG6OOWAEZJYUMQKB","short_pith_number":"pith:S5VUT3A3","canonical_record":{"source":{"id":"1505.08003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-29T11:53:20Z","cross_cats_sorted":[],"title_canon_sha256":"c114344c3be7483656c08583d75fe7dce383cb497429633c34e4e01358994a36","abstract_canon_sha256":"1d81ea4f63a2ff84a1bd5bf7429656a1865d374459a7b0fc15ae8391edb00e83"},"schema_version":"1.0"},"canonical_sha256":"976b49ec1b8aea6f39d601329c519050492c9951e63b9ef215f53d81e9d0ad39","source":{"kind":"arxiv","id":"1505.08003","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08003","created_at":"2026-05-18T01:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08003v2","created_at":"2026-05-18T01:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08003","created_at":"2026-05-18T01:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"S5VUT3A3RLVG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S5VUT3A3RLVG6OOW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S5VUT3A3","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S5VUT3A3RLVG6OOWAEZJYUMQKB","target":"record","payload":{"canonical_record":{"source":{"id":"1505.08003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-29T11:53:20Z","cross_cats_sorted":[],"title_canon_sha256":"c114344c3be7483656c08583d75fe7dce383cb497429633c34e4e01358994a36","abstract_canon_sha256":"1d81ea4f63a2ff84a1bd5bf7429656a1865d374459a7b0fc15ae8391edb00e83"},"schema_version":"1.0"},"canonical_sha256":"976b49ec1b8aea6f39d601329c519050492c9951e63b9ef215f53d81e9d0ad39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:20.464918Z","signature_b64":"nS2W9spxRmhMFi2Rq9LQQ8PujmFj0fCRqn0TBzL+7FzQ+AYoMQmorRotQo3fkjcpvxyY5eU0iEQitxg6e3JJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"976b49ec1b8aea6f39d601329c519050492c9951e63b9ef215f53d81e9d0ad39","last_reissued_at":"2026-05-18T01:03:20.464280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:20.464280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.08003","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-18T01:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F2PP90HctfJfsQXZVVlBE8qnkr+dj6YcgF0v8Gp5dkcfXzg7xPklHehHueB5slwGoj6ppKK1J4/BvTpv/njqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:11:26.404266Z"},"content_sha256":"1229ca1107e51ad47f847c8d253b8e0e54a81b87c8fb298db4df7a37847acbda","schema_version":"1.0","event_id":"sha256:1229ca1107e51ad47f847c8d253b8e0e54a81b87c8fb298db4df7a37847acbda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S5VUT3A3RLVG6OOWAEZJYUMQKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A large neighbourhood based heuristic for two-echelon routing problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Richard F. Hartl, Thibaut Vidal, Ulrich Breunig, Verena Schmid","submitted_at":"2015-05-29T11:53:20Z","abstract_excerpt":"In this paper, we address two optimisation problems arising in the context of city logistics and two-level transportation systems. The two-echelon vehicle routing problem and the two-echelon location routing problem seek to produce vehicle itineraries to deliver goods to customers, with transits through intermediate facilities. To efficiently solve these problems, we propose a hybrid metaheuristic which combines enumerative local searches with destroy-and-repair principles, as well as some tailored operators to optimise the selections of intermediate facilities. We conduct extensive computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08003","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-18T01:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UdxHmib4ks5yGa0wh3JuPjLmPq5ITDo/TM31Bri2TJCGtF/tKquUkvAp5OJSiivGv7qXgwoQbwjfcNrzQIKWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:11:26.405010Z"},"content_sha256":"772e1e6107b2fc49e4f441185835079cc5e057cea95614f55ffb12ae70494400","schema_version":"1.0","event_id":"sha256:772e1e6107b2fc49e4f441185835079cc5e057cea95614f55ffb12ae70494400"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/bundle.json","state_url":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/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-25T17:11:26Z","links":{"resolver":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB","bundle":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/bundle.json","state":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S5VUT3A3RLVG6OOWAEZJYUMQKB","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":"1d81ea4f63a2ff84a1bd5bf7429656a1865d374459a7b0fc15ae8391edb00e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-29T11:53:20Z","title_canon_sha256":"c114344c3be7483656c08583d75fe7dce383cb497429633c34e4e01358994a36"},"schema_version":"1.0","source":{"id":"1505.08003","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08003","created_at":"2026-05-18T01:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08003v2","created_at":"2026-05-18T01:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08003","created_at":"2026-05-18T01:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"S5VUT3A3RLVG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S5VUT3A3RLVG6OOW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S5VUT3A3","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:772e1e6107b2fc49e4f441185835079cc5e057cea95614f55ffb12ae70494400","target":"graph","created_at":"2026-05-18T01:03:20Z","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 this paper, we address two optimisation problems arising in the context of city logistics and two-level transportation systems. The two-echelon vehicle routing problem and the two-echelon location routing problem seek to produce vehicle itineraries to deliver goods to customers, with transits through intermediate facilities. To efficiently solve these problems, we propose a hybrid metaheuristic which combines enumerative local searches with destroy-and-repair principles, as well as some tailored operators to optimise the selections of intermediate facilities. We conduct extensive computatio","authors_text":"Richard F. Hartl, Thibaut Vidal, Ulrich Breunig, Verena Schmid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-29T11:53:20Z","title":"A large neighbourhood based heuristic for two-echelon routing problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08003","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:1229ca1107e51ad47f847c8d253b8e0e54a81b87c8fb298db4df7a37847acbda","target":"record","created_at":"2026-05-18T01:03:20Z","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":"1d81ea4f63a2ff84a1bd5bf7429656a1865d374459a7b0fc15ae8391edb00e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-29T11:53:20Z","title_canon_sha256":"c114344c3be7483656c08583d75fe7dce383cb497429633c34e4e01358994a36"},"schema_version":"1.0","source":{"id":"1505.08003","kind":"arxiv","version":2}},"canonical_sha256":"976b49ec1b8aea6f39d601329c519050492c9951e63b9ef215f53d81e9d0ad39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"976b49ec1b8aea6f39d601329c519050492c9951e63b9ef215f53d81e9d0ad39","first_computed_at":"2026-05-18T01:03:20.464280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:20.464280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nS2W9spxRmhMFi2Rq9LQQ8PujmFj0fCRqn0TBzL+7FzQ+AYoMQmorRotQo3fkjcpvxyY5eU0iEQitxg6e3JJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:20.464918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.08003","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1229ca1107e51ad47f847c8d253b8e0e54a81b87c8fb298db4df7a37847acbda","sha256:772e1e6107b2fc49e4f441185835079cc5e057cea95614f55ffb12ae70494400"],"state_sha256":"c3693256a6f5b324fd0f5ec8f8071a4cbc4e7d4d065c1e99eab64a2fc04e30b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zI0crKSoKxQ/hAiA55Dlcph0dSQ9FfnVedEaCQOFN5OlLHo+u5DBhQvNxk845Sa4SQImUXkxZhowj4QwFs5XCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:11:26.408480Z","bundle_sha256":"0ead2ebf2ad0153fae2d1ff5935f4ba72353044546e23c78165fbf2adf7d4768"}}