{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LYQVCUR7KMBHBDGEZ7B7IZPD3P","short_pith_number":"pith:LYQVCUR7","canonical_record":{"source":{"id":"1801.09547","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-25T09:46:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7b7aa54fcdef63988ba484ef396b9575f15468f3d72a3927035cbd995f90f967","abstract_canon_sha256":"e039dd5178d6bd81eaf6d4ccd61c104b5665c83030459c38f239d406ddabd2c1"},"schema_version":"1.0"},"canonical_sha256":"5e2151523f5302708cc4cfc3f465e3dbc31fad4cf78ad957381610f307f69369","source":{"kind":"arxiv","id":"1801.09547","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09547","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09547v5","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09547","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"LYQVCUR7KMBH","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LYQVCUR7KMBHBDGE","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LYQVCUR7","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LYQVCUR7KMBHBDGEZ7B7IZPD3P","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09547","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-25T09:46:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7b7aa54fcdef63988ba484ef396b9575f15468f3d72a3927035cbd995f90f967","abstract_canon_sha256":"e039dd5178d6bd81eaf6d4ccd61c104b5665c83030459c38f239d406ddabd2c1"},"schema_version":"1.0"},"canonical_sha256":"5e2151523f5302708cc4cfc3f465e3dbc31fad4cf78ad957381610f307f69369","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:22.682810Z","signature_b64":"RpDFeCm0lQ1d+y8w+5Ba5r+ZsWpUZwFPyZuyHkHoQfXHlZP0Jqogr6k2FvbdXBXwxUFs2XLlSP5BnghvWuZaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e2151523f5302708cc4cfc3f465e3dbc31fad4cf78ad957381610f307f69369","last_reissued_at":"2026-05-18T00:23:22.682103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:22.682103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09547","source_version":5,"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:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d8WYM+6uyZh94SZl70Hf+JrWZeEEreJM+SgeK02NcUEx9z7rEonZnGCzfESrrzfep8I9wdgsdOY+RlcsJhYyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:49:17.239196Z"},"content_sha256":"cf91cabafaeaa9c61dea733efe7dba2bdd6f5f33a4b27666379ec54eede615be","schema_version":"1.0","event_id":"sha256:cf91cabafaeaa9c61dea733efe7dba2bdd6f5f33a4b27666379ec54eede615be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LYQVCUR7KMBHBDGEZ7B7IZPD3P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Tabu Search Heuristic for Static Dial-A-Ride Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Justin Dauwels, Ramesh Ramasamy Pandi, Sarat Chandra Nagavarapu, Songguang Ho","submitted_at":"2018-01-25T09:46:42Z","abstract_excerpt":"Multi-vehicle routing has become increasingly important with the rapid development of autonomous vehicle technology. Dial-a-ride problem, a variant of vehicle routing problem (VRP), deals with the allocation of customer requests to vehicles, scheduling the pick-up and drop-off times and the sequence of serving those requests by ensuring high customer satisfaction with minimized travel cost. In this paper, we propose an improved tabu search (ITS) heuristic for static dial-a-ride problem (DARP) with the objective of obtaining high-quality solutions in short time. Two new techniques, initializati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09547","kind":"arxiv","version":5},"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:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGcyWBfFbu+vUT3Uazwqf6Unt4n3dUaLSchTHUTVWcR/7VutoVPgLnp6umHcAgveXFS2ROjDDHb0ig3HATOxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:49:17.239991Z"},"content_sha256":"672579841167381b8a77d30500cf1865e92a29ddca4f4a860fca7e6bc24c1232","schema_version":"1.0","event_id":"sha256:672579841167381b8a77d30500cf1865e92a29ddca4f4a860fca7e6bc24c1232"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYQVCUR7KMBHBDGEZ7B7IZPD3P/bundle.json","state_url":"https://pith.science/pith/LYQVCUR7KMBHBDGEZ7B7IZPD3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYQVCUR7KMBHBDGEZ7B7IZPD3P/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-31T17:49:17Z","links":{"resolver":"https://pith.science/pith/LYQVCUR7KMBHBDGEZ7B7IZPD3P","bundle":"https://pith.science/pith/LYQVCUR7KMBHBDGEZ7B7IZPD3P/bundle.json","state":"https://pith.science/pith/LYQVCUR7KMBHBDGEZ7B7IZPD3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYQVCUR7KMBHBDGEZ7B7IZPD3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LYQVCUR7KMBHBDGEZ7B7IZPD3P","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":"e039dd5178d6bd81eaf6d4ccd61c104b5665c83030459c38f239d406ddabd2c1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-25T09:46:42Z","title_canon_sha256":"7b7aa54fcdef63988ba484ef396b9575f15468f3d72a3927035cbd995f90f967"},"schema_version":"1.0","source":{"id":"1801.09547","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09547","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09547v5","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09547","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"LYQVCUR7KMBH","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LYQVCUR7KMBHBDGE","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LYQVCUR7","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:672579841167381b8a77d30500cf1865e92a29ddca4f4a860fca7e6bc24c1232","target":"graph","created_at":"2026-05-18T00:23:22Z","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":"Multi-vehicle routing has become increasingly important with the rapid development of autonomous vehicle technology. Dial-a-ride problem, a variant of vehicle routing problem (VRP), deals with the allocation of customer requests to vehicles, scheduling the pick-up and drop-off times and the sequence of serving those requests by ensuring high customer satisfaction with minimized travel cost. In this paper, we propose an improved tabu search (ITS) heuristic for static dial-a-ride problem (DARP) with the objective of obtaining high-quality solutions in short time. Two new techniques, initializati","authors_text":"Justin Dauwels, Ramesh Ramasamy Pandi, Sarat Chandra Nagavarapu, Songguang Ho","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-25T09:46:42Z","title":"An Improved Tabu Search Heuristic for Static Dial-A-Ride Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09547","kind":"arxiv","version":5},"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:cf91cabafaeaa9c61dea733efe7dba2bdd6f5f33a4b27666379ec54eede615be","target":"record","created_at":"2026-05-18T00:23:22Z","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":"e039dd5178d6bd81eaf6d4ccd61c104b5665c83030459c38f239d406ddabd2c1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-25T09:46:42Z","title_canon_sha256":"7b7aa54fcdef63988ba484ef396b9575f15468f3d72a3927035cbd995f90f967"},"schema_version":"1.0","source":{"id":"1801.09547","kind":"arxiv","version":5}},"canonical_sha256":"5e2151523f5302708cc4cfc3f465e3dbc31fad4cf78ad957381610f307f69369","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e2151523f5302708cc4cfc3f465e3dbc31fad4cf78ad957381610f307f69369","first_computed_at":"2026-05-18T00:23:22.682103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:22.682103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RpDFeCm0lQ1d+y8w+5Ba5r+ZsWpUZwFPyZuyHkHoQfXHlZP0Jqogr6k2FvbdXBXwxUFs2XLlSP5BnghvWuZaAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:22.682810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09547","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf91cabafaeaa9c61dea733efe7dba2bdd6f5f33a4b27666379ec54eede615be","sha256:672579841167381b8a77d30500cf1865e92a29ddca4f4a860fca7e6bc24c1232"],"state_sha256":"89b4e1015ee218625e852d7bf347ebaf3efc79d8d47e0ed8a6483b65481fc53b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p26SECM+CBGI56YX4pHvZXh+FR+FdV39Z3cgO5sAji7fZBxGgrhfb7XMr9RRmF3Iycdi060DswF58iPrcaNeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:49:17.244016Z","bundle_sha256":"90186c3ebf7d180e164029183df9a81cebfc2eecac335efb87793c96a81b2ef2"}}