{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OP2AKFI4HZZJA4JKJSMPJR3KUX","short_pith_number":"pith:OP2AKFI4","canonical_record":{"source":{"id":"1810.03981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-06T17:24:11Z","cross_cats_sorted":[],"title_canon_sha256":"b14ee85107634bf19b5a01408dce72872a27c7a0af28ab844646717256719f75","abstract_canon_sha256":"695729449c062bbc7bef68a7497cd76aeb8553e58d9d33f0fc9b8455abf10f9c"},"schema_version":"1.0"},"canonical_sha256":"73f405151c3e7290712a4c98f4c76aa5f8e9d35f8e560fa5a5dd2397cf3d869c","source":{"kind":"arxiv","id":"1810.03981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03981","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03981v1","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03981","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"OP2AKFI4HZZJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OP2AKFI4HZZJA4JK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OP2AKFI4","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OP2AKFI4HZZJA4JKJSMPJR3KUX","target":"record","payload":{"canonical_record":{"source":{"id":"1810.03981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-06T17:24:11Z","cross_cats_sorted":[],"title_canon_sha256":"b14ee85107634bf19b5a01408dce72872a27c7a0af28ab844646717256719f75","abstract_canon_sha256":"695729449c062bbc7bef68a7497cd76aeb8553e58d9d33f0fc9b8455abf10f9c"},"schema_version":"1.0"},"canonical_sha256":"73f405151c3e7290712a4c98f4c76aa5f8e9d35f8e560fa5a5dd2397cf3d869c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:44.146534Z","signature_b64":"HadtLCC+l1KcRz1m/C2VemOZzUh75l/hMrHDWubv598A+M5e19zLgC+LqQIaLv13LZzChB/H4cCBn0FyDZ+XDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73f405151c3e7290712a4c98f4c76aa5f8e9d35f8e560fa5a5dd2397cf3d869c","last_reissued_at":"2026-05-18T00:03:44.146041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:44.146041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.03981","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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3v30eG7XdmYB1wZJJBiD6OAu3tHWKyocfVzLi15eFVrVWFbvi8GaUj4KnlSJxBqyaw2LnMlT4qfGComqshKrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:00:00.219218Z"},"content_sha256":"b8978a04c0bf31adeb1f004956d7e9e1dc19bf05226d81b1797f3bb11749d11e","schema_version":"1.0","event_id":"sha256:b8978a04c0bf31adeb1f004956d7e9e1dc19bf05226d81b1797f3bb11749d11e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OP2AKFI4HZZJA4JKJSMPJR3KUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the clustered traveling salesman problem with d-relaxed priority rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andr\\'e Langevin, Hoa Nguyen Phuong, Huyen Tran Ngoc Nhat, Martin Tr\\'epanier, Minh Ho\\`ang H\\`a","submitted_at":"2018-10-06T17:24:11Z","abstract_excerpt":"The Clustered Traveling Salesman Problem with a Prespecified Order on the Clusters, a variant of the well-known traveling salesman problem is studied in literature. In this problem, delivery locations are divided into clusters with different urgency levels and more urgent locations must be visited before less urgent ones. However, this could lead to an inefficient route in terms of traveling cost. This priority-oriented constraint can be relaxed by a rule called d-relaxed priority that provides a trade-off between transportation cost and emergency level. Our research proposes two approaches to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03981","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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9zNQ5jJGDDfXIvZH4sBBWsMHQZO0d7p6NWzhWVI66FDQae2AKQYwTwG/c4d/Twz+cAf6WSvfoiImuOLT6/rCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:00:00.219941Z"},"content_sha256":"f23f8a40fc545911189d35db4aec9813bec268147ed011826cd14f970c8ba515","schema_version":"1.0","event_id":"sha256:f23f8a40fc545911189d35db4aec9813bec268147ed011826cd14f970c8ba515"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OP2AKFI4HZZJA4JKJSMPJR3KUX/bundle.json","state_url":"https://pith.science/pith/OP2AKFI4HZZJA4JKJSMPJR3KUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OP2AKFI4HZZJA4JKJSMPJR3KUX/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-25T15:00:00Z","links":{"resolver":"https://pith.science/pith/OP2AKFI4HZZJA4JKJSMPJR3KUX","bundle":"https://pith.science/pith/OP2AKFI4HZZJA4JKJSMPJR3KUX/bundle.json","state":"https://pith.science/pith/OP2AKFI4HZZJA4JKJSMPJR3KUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OP2AKFI4HZZJA4JKJSMPJR3KUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OP2AKFI4HZZJA4JKJSMPJR3KUX","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":"695729449c062bbc7bef68a7497cd76aeb8553e58d9d33f0fc9b8455abf10f9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-06T17:24:11Z","title_canon_sha256":"b14ee85107634bf19b5a01408dce72872a27c7a0af28ab844646717256719f75"},"schema_version":"1.0","source":{"id":"1810.03981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03981","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03981v1","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03981","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"OP2AKFI4HZZJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OP2AKFI4HZZJA4JK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OP2AKFI4","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:f23f8a40fc545911189d35db4aec9813bec268147ed011826cd14f970c8ba515","target":"graph","created_at":"2026-05-18T00:03:44Z","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 Clustered Traveling Salesman Problem with a Prespecified Order on the Clusters, a variant of the well-known traveling salesman problem is studied in literature. In this problem, delivery locations are divided into clusters with different urgency levels and more urgent locations must be visited before less urgent ones. However, this could lead to an inefficient route in terms of traveling cost. This priority-oriented constraint can be relaxed by a rule called d-relaxed priority that provides a trade-off between transportation cost and emergency level. Our research proposes two approaches to","authors_text":"Andr\\'e Langevin, Hoa Nguyen Phuong, Huyen Tran Ngoc Nhat, Martin Tr\\'epanier, Minh Ho\\`ang H\\`a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-06T17:24:11Z","title":"Solving the clustered traveling salesman problem with d-relaxed priority rule"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03981","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:b8978a04c0bf31adeb1f004956d7e9e1dc19bf05226d81b1797f3bb11749d11e","target":"record","created_at":"2026-05-18T00:03:44Z","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":"695729449c062bbc7bef68a7497cd76aeb8553e58d9d33f0fc9b8455abf10f9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-06T17:24:11Z","title_canon_sha256":"b14ee85107634bf19b5a01408dce72872a27c7a0af28ab844646717256719f75"},"schema_version":"1.0","source":{"id":"1810.03981","kind":"arxiv","version":1}},"canonical_sha256":"73f405151c3e7290712a4c98f4c76aa5f8e9d35f8e560fa5a5dd2397cf3d869c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73f405151c3e7290712a4c98f4c76aa5f8e9d35f8e560fa5a5dd2397cf3d869c","first_computed_at":"2026-05-18T00:03:44.146041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:44.146041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HadtLCC+l1KcRz1m/C2VemOZzUh75l/hMrHDWubv598A+M5e19zLgC+LqQIaLv13LZzChB/H4cCBn0FyDZ+XDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:44.146534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8978a04c0bf31adeb1f004956d7e9e1dc19bf05226d81b1797f3bb11749d11e","sha256:f23f8a40fc545911189d35db4aec9813bec268147ed011826cd14f970c8ba515"],"state_sha256":"6311a1c294059cd1fdc132515e0f895cf76e72bf2aa328f6db90bd7d90dc5fd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RV3tzkeLj8hxBtpEEg2k4IkszN7ff+l6Zl5jCV1uBwfMokhJsLPQoIxKCDlIILLUCwArZzRhoUkgyltYG/EjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:00:00.223946Z","bundle_sha256":"93391f97c98f5b66765eb2f3d86f8c335f132e9558b351bf596a7c13d32da00d"}}