{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B4OBPOLY6IZNXG5WTTOZB3TJQ6","short_pith_number":"pith:B4OBPOLY","canonical_record":{"source":{"id":"1409.5166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-17T23:29:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"28b66d9000a3fbdee16a74fa71e4488434cc2b60afdf289df9834b4e8f2cda86","abstract_canon_sha256":"21516c83b0d8c6789748d2a3db01ab0c4299cb33bc7a3189132d049d2224bf27"},"schema_version":"1.0"},"canonical_sha256":"0f1c17b978f232db9bb69cdd90ee6987b11c86b97198c36bbc6fcdddfebe73c6","source":{"kind":"arxiv","id":"1409.5166","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5166","created_at":"2026-05-18T02:42:30Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5166v1","created_at":"2026-05-18T02:42:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5166","created_at":"2026-05-18T02:42:30Z"},{"alias_kind":"pith_short_12","alias_value":"B4OBPOLY6IZN","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B4OBPOLY6IZNXG5W","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B4OBPOLY","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B4OBPOLY6IZNXG5WTTOZB3TJQ6","target":"record","payload":{"canonical_record":{"source":{"id":"1409.5166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-17T23:29:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"28b66d9000a3fbdee16a74fa71e4488434cc2b60afdf289df9834b4e8f2cda86","abstract_canon_sha256":"21516c83b0d8c6789748d2a3db01ab0c4299cb33bc7a3189132d049d2224bf27"},"schema_version":"1.0"},"canonical_sha256":"0f1c17b978f232db9bb69cdd90ee6987b11c86b97198c36bbc6fcdddfebe73c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:30.774911Z","signature_b64":"TNnvjkroVbOgHjw3DnTaUQqSzJELEXnnDyQfT+G+jfQuoLxcXudebrlQUWRI8wAb4KJVNi507YzFKXIclphiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f1c17b978f232db9bb69cdd90ee6987b11c86b97198c36bbc6fcdddfebe73c6","last_reissued_at":"2026-05-18T02:42:30.774127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:30.774127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.5166","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-18T02:42:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3H4zcMHq07q+dK6pzBwlWsWJChEqV7r8EQck8Rv5dW3uk+boBno9TdzlxX4INAA8tCpyEsBtnGYUFWHcpvS+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:52:40.968403Z"},"content_sha256":"f4dbce52311e73d1ea14bcf16007ee7e3d45ddb58ac7aec152b044cf523f8995","schema_version":"1.0","event_id":"sha256:f4dbce52311e73d1ea14bcf16007ee7e3d45ddb58ac7aec152b044cf523f8995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B4OBPOLY6IZNXG5WTTOZB3TJQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Andrew Lim, Hu Qin, Yubin Xie, Zizhen Zhang","submitted_at":"2014-09-17T23:29:46Z","abstract_excerpt":"This paper introduces a multi-period inspector scheduling problem (MPISP), which is a new variant of the multi-trip vehicle routing problem with time windows (VRPTW). In the MPISP, each inspector is scheduled to perform a route in a given multi-period planning horizon. At the end of each period, each inspector is not required to return to the depot but has to stay at one of the vertices for recuperation. If the remaining time of the current period is insufficient for an inspector to travel from his/her current vertex $A$ to a certain vertex B, he/she can choose either waiting at vertex A until"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5166","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-18T02:42:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bC50EZgE3MTmLJZrAUmP5BEy7XlU3e9CXEwniZkzBvh++ut9kiGdKe+pP10PghqF5W6ssXlDf/u/uI8s/8KJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:52:40.968745Z"},"content_sha256":"1746bc64c0290012e0cabe1a5f8451ff220d8b5601d040f23dc0a39ff6117026","schema_version":"1.0","event_id":"sha256:1746bc64c0290012e0cabe1a5f8451ff220d8b5601d040f23dc0a39ff6117026"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4OBPOLY6IZNXG5WTTOZB3TJQ6/bundle.json","state_url":"https://pith.science/pith/B4OBPOLY6IZNXG5WTTOZB3TJQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4OBPOLY6IZNXG5WTTOZB3TJQ6/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-27T06:52:40Z","links":{"resolver":"https://pith.science/pith/B4OBPOLY6IZNXG5WTTOZB3TJQ6","bundle":"https://pith.science/pith/B4OBPOLY6IZNXG5WTTOZB3TJQ6/bundle.json","state":"https://pith.science/pith/B4OBPOLY6IZNXG5WTTOZB3TJQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4OBPOLY6IZNXG5WTTOZB3TJQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B4OBPOLY6IZNXG5WTTOZB3TJQ6","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":"21516c83b0d8c6789748d2a3db01ab0c4299cb33bc7a3189132d049d2224bf27","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-17T23:29:46Z","title_canon_sha256":"28b66d9000a3fbdee16a74fa71e4488434cc2b60afdf289df9834b4e8f2cda86"},"schema_version":"1.0","source":{"id":"1409.5166","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5166","created_at":"2026-05-18T02:42:30Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5166v1","created_at":"2026-05-18T02:42:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5166","created_at":"2026-05-18T02:42:30Z"},{"alias_kind":"pith_short_12","alias_value":"B4OBPOLY6IZN","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B4OBPOLY6IZNXG5W","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B4OBPOLY","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:1746bc64c0290012e0cabe1a5f8451ff220d8b5601d040f23dc0a39ff6117026","target":"graph","created_at":"2026-05-18T02:42:30Z","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":"This paper introduces a multi-period inspector scheduling problem (MPISP), which is a new variant of the multi-trip vehicle routing problem with time windows (VRPTW). In the MPISP, each inspector is scheduled to perform a route in a given multi-period planning horizon. At the end of each period, each inspector is not required to return to the depot but has to stay at one of the vertices for recuperation. If the remaining time of the current period is insufficient for an inspector to travel from his/her current vertex $A$ to a certain vertex B, he/she can choose either waiting at vertex A until","authors_text":"Andrew Lim, Hu Qin, Yubin Xie, Zizhen Zhang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-17T23:29:46Z","title":"A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5166","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:f4dbce52311e73d1ea14bcf16007ee7e3d45ddb58ac7aec152b044cf523f8995","target":"record","created_at":"2026-05-18T02:42:30Z","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":"21516c83b0d8c6789748d2a3db01ab0c4299cb33bc7a3189132d049d2224bf27","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-17T23:29:46Z","title_canon_sha256":"28b66d9000a3fbdee16a74fa71e4488434cc2b60afdf289df9834b4e8f2cda86"},"schema_version":"1.0","source":{"id":"1409.5166","kind":"arxiv","version":1}},"canonical_sha256":"0f1c17b978f232db9bb69cdd90ee6987b11c86b97198c36bbc6fcdddfebe73c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f1c17b978f232db9bb69cdd90ee6987b11c86b97198c36bbc6fcdddfebe73c6","first_computed_at":"2026-05-18T02:42:30.774127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:30.774127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TNnvjkroVbOgHjw3DnTaUQqSzJELEXnnDyQfT+G+jfQuoLxcXudebrlQUWRI8wAb4KJVNi507YzFKXIclphiCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:30.774911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5166","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4dbce52311e73d1ea14bcf16007ee7e3d45ddb58ac7aec152b044cf523f8995","sha256:1746bc64c0290012e0cabe1a5f8451ff220d8b5601d040f23dc0a39ff6117026"],"state_sha256":"35974332a876595bdf558f3c0400c6bc5975afd991490e0d68d1f55b48134b38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZT5mGvfkqzeIwi6LfTLpo5K0Ut4QeReKN12RWml00EV+Hx+4RKWAU+i6rizQ2BYsLMwbTug2p8zKkpsBWD7sAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T06:52:40.970634Z","bundle_sha256":"9cbf27ca90e8fe72dd1455ceb560f34569fff0b64f846b457fbe4fe00801f73d"}}