{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XURXWSDRIGB5BEAWLL6CIBVLIW","short_pith_number":"pith:XURXWSDR","canonical_record":{"source":{"id":"1607.01728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-06T18:02:32Z","cross_cats_sorted":[],"title_canon_sha256":"b4ad39e59a873aed02dfec7da35e42717c43ee0cc1be2e3645801819a05783f2","abstract_canon_sha256":"5488921dbe2691b8562880753525569a752bf75f3dcbd841080a463fdc21b8be"},"schema_version":"1.0"},"canonical_sha256":"bd237b48714183d090165afc2406ab459fe67e5ef0f0ca65303b9085f2b93912","source":{"kind":"arxiv","id":"1607.01728","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01728","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01728v1","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01728","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"XURXWSDRIGB5","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XURXWSDRIGB5BEAW","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XURXWSDR","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XURXWSDRIGB5BEAWLL6CIBVLIW","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-06T18:02:32Z","cross_cats_sorted":[],"title_canon_sha256":"b4ad39e59a873aed02dfec7da35e42717c43ee0cc1be2e3645801819a05783f2","abstract_canon_sha256":"5488921dbe2691b8562880753525569a752bf75f3dcbd841080a463fdc21b8be"},"schema_version":"1.0"},"canonical_sha256":"bd237b48714183d090165afc2406ab459fe67e5ef0f0ca65303b9085f2b93912","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:25.611930Z","signature_b64":"j9U+uWBFZB0fw6fM6C8EXDLGwZROVmx8eujuXWGaII1rBTu200sERNIUwDmVKTaqQvp55YJuiFgRRlAUc3+bCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd237b48714183d090165afc2406ab459fe67e5ef0f0ca65303b9085f2b93912","last_reissued_at":"2026-05-18T01:11:25.611394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:25.611394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01728","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-18T01:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qplMd07z2IS9pvwOOYzFVrxKTXrtSsc1ylqyNgGzOGjVCMWwvPWWmaXNrEb3HwXUu6s+rw3pt5Se+IIsAQMbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:19:15.119216Z"},"content_sha256":"12b03ac5eea5253cf7cc99dc99399fa51bc98ce51f7a6e27458b0ab042694c8c","schema_version":"1.0","event_id":"sha256:12b03ac5eea5253cf7cc99dc99399fa51bc98ce51f7a6e27458b0ab042694c8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XURXWSDRIGB5BEAWLL6CIBVLIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Embedding Assignment Routing Constraints through Multi Dimensional Network Construction for Solving the Multi Vehicle Routing Problem with Pickup and Delivery with Time Windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Junhua Chen, Monirehalsadat Mahmoudi, Xuesong Zhou","submitted_at":"2016-07-06T18:02:32Z","abstract_excerpt":"The multi Vehicle Routing Problem with Pickup and Delivery with Time Windows is a challenging version of the Vehicle Routing Problem. In this paper, by embedding many complex assignment routing constraints through constructing a multi dimensional network, we intend to reach optimality for local clusters derived from a reasonably large set of passengers on real world transportation networks. More specifically, we introduce a multi vehicle state space time network representation in which only the non dominated assignment based hyper paths are examined. In addition, by the aid of passengers cumul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01728","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-18T01:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQun4v4n6fo6XSlefeLuj0fryxguexbrdDifBBSw96rF31GCg0ZT/qq11a8t0+aINzWjMlXvwQE4McpZ7JSMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:19:15.119795Z"},"content_sha256":"c87c710cb6b102548738621ea96f4cc3e05e730f50149a2875323fa561e48ec1","schema_version":"1.0","event_id":"sha256:c87c710cb6b102548738621ea96f4cc3e05e730f50149a2875323fa561e48ec1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/bundle.json","state_url":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/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-25T13:19:15Z","links":{"resolver":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW","bundle":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/bundle.json","state":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XURXWSDRIGB5BEAWLL6CIBVLIW","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":"5488921dbe2691b8562880753525569a752bf75f3dcbd841080a463fdc21b8be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-06T18:02:32Z","title_canon_sha256":"b4ad39e59a873aed02dfec7da35e42717c43ee0cc1be2e3645801819a05783f2"},"schema_version":"1.0","source":{"id":"1607.01728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01728","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01728v1","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01728","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"XURXWSDRIGB5","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XURXWSDRIGB5BEAW","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XURXWSDR","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:c87c710cb6b102548738621ea96f4cc3e05e730f50149a2875323fa561e48ec1","target":"graph","created_at":"2026-05-18T01:11:25Z","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":"The multi Vehicle Routing Problem with Pickup and Delivery with Time Windows is a challenging version of the Vehicle Routing Problem. In this paper, by embedding many complex assignment routing constraints through constructing a multi dimensional network, we intend to reach optimality for local clusters derived from a reasonably large set of passengers on real world transportation networks. More specifically, we introduce a multi vehicle state space time network representation in which only the non dominated assignment based hyper paths are examined. In addition, by the aid of passengers cumul","authors_text":"Junhua Chen, Monirehalsadat Mahmoudi, Xuesong Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-06T18:02:32Z","title":"Embedding Assignment Routing Constraints through Multi Dimensional Network Construction for Solving the Multi Vehicle Routing Problem with Pickup and Delivery with Time Windows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01728","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:12b03ac5eea5253cf7cc99dc99399fa51bc98ce51f7a6e27458b0ab042694c8c","target":"record","created_at":"2026-05-18T01:11:25Z","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":"5488921dbe2691b8562880753525569a752bf75f3dcbd841080a463fdc21b8be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-06T18:02:32Z","title_canon_sha256":"b4ad39e59a873aed02dfec7da35e42717c43ee0cc1be2e3645801819a05783f2"},"schema_version":"1.0","source":{"id":"1607.01728","kind":"arxiv","version":1}},"canonical_sha256":"bd237b48714183d090165afc2406ab459fe67e5ef0f0ca65303b9085f2b93912","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd237b48714183d090165afc2406ab459fe67e5ef0f0ca65303b9085f2b93912","first_computed_at":"2026-05-18T01:11:25.611394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:25.611394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j9U+uWBFZB0fw6fM6C8EXDLGwZROVmx8eujuXWGaII1rBTu200sERNIUwDmVKTaqQvp55YJuiFgRRlAUc3+bCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:25.611930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12b03ac5eea5253cf7cc99dc99399fa51bc98ce51f7a6e27458b0ab042694c8c","sha256:c87c710cb6b102548738621ea96f4cc3e05e730f50149a2875323fa561e48ec1"],"state_sha256":"5cf29495a95fdd46d5b55f261b12ad33f24178d65c7b223da091b12d029695bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnuyDl1DyD7AdCdTG+2NXGYWNnXS/J6DZ6OOCf594wKDXHH++UJKT8LJ/x/l2eufvxMkJKVA0q0cbkDrIYl2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:19:15.122415Z","bundle_sha256":"cdf3e407d6087139d359ca847b2291f4dfeeeda4bf337fa344f088dcf301e4e4"}}