{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NVZR6O7IGPUSPAHQQTUDUWYZEM","short_pith_number":"pith:NVZR6O7I","canonical_record":{"source":{"id":"1611.05187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-16T09:05:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eceab3848f824f763968d4da5a44812b9856db93939d7dd5becb108b21f7af14","abstract_canon_sha256":"942a50ed68cf0c866e87041847108050955ba23708991a99598a519a35967cb5"},"schema_version":"1.0"},"canonical_sha256":"6d731f3be833e92780f084e83a5b192304a22f0ec4150dc8fd24699ad7418ec0","source":{"kind":"arxiv","id":"1611.05187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05187","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05187v1","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05187","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"NVZR6O7IGPUS","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NVZR6O7IGPUSPAHQ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NVZR6O7I","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NVZR6O7IGPUSPAHQQTUDUWYZEM","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-16T09:05:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eceab3848f824f763968d4da5a44812b9856db93939d7dd5becb108b21f7af14","abstract_canon_sha256":"942a50ed68cf0c866e87041847108050955ba23708991a99598a519a35967cb5"},"schema_version":"1.0"},"canonical_sha256":"6d731f3be833e92780f084e83a5b192304a22f0ec4150dc8fd24699ad7418ec0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:27.721360Z","signature_b64":"bl1vxrD1xeiZz4tNYZ6z1P8AssxnMHlOAyIDeUrl735wrDNhgAhBlE/gu1JEhityxFcMgJGnzO8+NNzwHbMBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d731f3be833e92780f084e83a5b192304a22f0ec4150dc8fd24699ad7418ec0","last_reissued_at":"2026-05-18T00:58:27.720753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:27.720753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05187","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:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YX6kuQHGyBen5k6iugNXtHCF+rhRTMysiPZm9VXKYLUZlcpa728v02wQLeTd/taXEbjpJ09Yv0zELSkTa72EBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:34:34.952899Z"},"content_sha256":"cbcec399091a8a3b6c3c4d6ee6d74636e1527d68f1c359a05a832f2f7193c456","schema_version":"1.0","event_id":"sha256:cbcec399091a8a3b6c3c4d6ee6d74636e1527d68f1c359a05a832f2f7193c456"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NVZR6O7IGPUSPAHQQTUDUWYZEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable Neighborhood Search Algorithms for the multi-depot dial-a-ride problem with heterogeneous vehicles and users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DM","authors_text":"Garazi Zabalo Manrique de Lara, Paolo Detti","submitted_at":"2016-11-16T09:05:54Z","abstract_excerpt":"In this work, a study on Variable Neighborhood Search algorithms for multi-depot dial-a-ride problems is presented. In dial-a-ride problems patients need to be transported from pre-specified pickup locations to pre-specified delivery locations, under different considerations. The addressed problem presents several constraints and features, such as heterogeneous vehicles, distributed in different depots, and heterogeneous patients. The aim is of minimizing the total routing cost, while respecting time-window, ride-time, capacity and route duration constraints. The objective of the study is of d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05187","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:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2I3tcKiW5Dn5Ih2Cv16gergUetl5IThsGDiOQTU0/zKbZGBVViphcYJjXmVxnhnuS69Ig4EXVXgh6OCqceBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:34:34.953246Z"},"content_sha256":"01d34f7e59003edecee9094ad9d57d9f231052ca5f28bc3959322841b3d8a2a1","schema_version":"1.0","event_id":"sha256:01d34f7e59003edecee9094ad9d57d9f231052ca5f28bc3959322841b3d8a2a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVZR6O7IGPUSPAHQQTUDUWYZEM/bundle.json","state_url":"https://pith.science/pith/NVZR6O7IGPUSPAHQQTUDUWYZEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVZR6O7IGPUSPAHQQTUDUWYZEM/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-26T01:34:34Z","links":{"resolver":"https://pith.science/pith/NVZR6O7IGPUSPAHQQTUDUWYZEM","bundle":"https://pith.science/pith/NVZR6O7IGPUSPAHQQTUDUWYZEM/bundle.json","state":"https://pith.science/pith/NVZR6O7IGPUSPAHQQTUDUWYZEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVZR6O7IGPUSPAHQQTUDUWYZEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NVZR6O7IGPUSPAHQQTUDUWYZEM","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":"942a50ed68cf0c866e87041847108050955ba23708991a99598a519a35967cb5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-16T09:05:54Z","title_canon_sha256":"eceab3848f824f763968d4da5a44812b9856db93939d7dd5becb108b21f7af14"},"schema_version":"1.0","source":{"id":"1611.05187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05187","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05187v1","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05187","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"NVZR6O7IGPUS","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NVZR6O7IGPUSPAHQ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NVZR6O7I","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:01d34f7e59003edecee9094ad9d57d9f231052ca5f28bc3959322841b3d8a2a1","target":"graph","created_at":"2026-05-18T00:58:27Z","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 work, a study on Variable Neighborhood Search algorithms for multi-depot dial-a-ride problems is presented. In dial-a-ride problems patients need to be transported from pre-specified pickup locations to pre-specified delivery locations, under different considerations. The addressed problem presents several constraints and features, such as heterogeneous vehicles, distributed in different depots, and heterogeneous patients. The aim is of minimizing the total routing cost, while respecting time-window, ride-time, capacity and route duration constraints. The objective of the study is of d","authors_text":"Garazi Zabalo Manrique de Lara, Paolo Detti","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-16T09:05:54Z","title":"Variable Neighborhood Search Algorithms for the multi-depot dial-a-ride problem with heterogeneous vehicles and users"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05187","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:cbcec399091a8a3b6c3c4d6ee6d74636e1527d68f1c359a05a832f2f7193c456","target":"record","created_at":"2026-05-18T00:58:27Z","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":"942a50ed68cf0c866e87041847108050955ba23708991a99598a519a35967cb5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-16T09:05:54Z","title_canon_sha256":"eceab3848f824f763968d4da5a44812b9856db93939d7dd5becb108b21f7af14"},"schema_version":"1.0","source":{"id":"1611.05187","kind":"arxiv","version":1}},"canonical_sha256":"6d731f3be833e92780f084e83a5b192304a22f0ec4150dc8fd24699ad7418ec0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d731f3be833e92780f084e83a5b192304a22f0ec4150dc8fd24699ad7418ec0","first_computed_at":"2026-05-18T00:58:27.720753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:27.720753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bl1vxrD1xeiZz4tNYZ6z1P8AssxnMHlOAyIDeUrl735wrDNhgAhBlE/gu1JEhityxFcMgJGnzO8+NNzwHbMBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:27.721360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbcec399091a8a3b6c3c4d6ee6d74636e1527d68f1c359a05a832f2f7193c456","sha256:01d34f7e59003edecee9094ad9d57d9f231052ca5f28bc3959322841b3d8a2a1"],"state_sha256":"702d2bd296dd68462e0b046ae9440eec38787b3a729eeec76dc2c0e5ce6fb2ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MjjRpEu+6PzY11mxukhEjbpqzawnU+8wO/8yD68YC9dUlMsslsUeGuARl/nDyxI2eG9UQLHwRpsvxZfmmPcWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:34:34.955331Z","bundle_sha256":"8da75f7a2a4aca7b7ee1dba924a5721419751abe7fd2c184afa3f720b2c4481f"}}