{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:CALJGN55NQDWPQHBDLTAU5KHKA","short_pith_number":"pith:CALJGN55","canonical_record":{"source":{"id":"2201.09424","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-24T02:43:08Z","cross_cats_sorted":[],"title_canon_sha256":"e317834458b4b228a4df6bc4d6ad09789495f27fe36019b12382bc8b5da8bc96","abstract_canon_sha256":"c916ce5ea6e186cf5841b9894558315b0c2df2a694a369d2e396d058b6b7c2e6"},"schema_version":"1.0"},"canonical_sha256":"10169337bd6c0767c0e11ae60a7547501aa81afb78a2241271cbda0c8d630c87","source":{"kind":"arxiv","id":"2201.09424","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.09424","created_at":"2026-07-05T04:00:22Z"},{"alias_kind":"arxiv_version","alias_value":"2201.09424v2","created_at":"2026-07-05T04:00:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09424","created_at":"2026-07-05T04:00:22Z"},{"alias_kind":"pith_short_12","alias_value":"CALJGN55NQDW","created_at":"2026-07-05T04:00:22Z"},{"alias_kind":"pith_short_16","alias_value":"CALJGN55NQDWPQHB","created_at":"2026-07-05T04:00:22Z"},{"alias_kind":"pith_short_8","alias_value":"CALJGN55","created_at":"2026-07-05T04:00:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:CALJGN55NQDWPQHBDLTAU5KHKA","target":"record","payload":{"canonical_record":{"source":{"id":"2201.09424","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-24T02:43:08Z","cross_cats_sorted":[],"title_canon_sha256":"e317834458b4b228a4df6bc4d6ad09789495f27fe36019b12382bc8b5da8bc96","abstract_canon_sha256":"c916ce5ea6e186cf5841b9894558315b0c2df2a694a369d2e396d058b6b7c2e6"},"schema_version":"1.0"},"canonical_sha256":"10169337bd6c0767c0e11ae60a7547501aa81afb78a2241271cbda0c8d630c87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:22.001229Z","signature_b64":"fLJpfGqiM8QJVIe7zafnHwEn5a11xn4vgPsvlSuNeFZCZEOsjmE0be/LWTtU+t4X+2B6f1+r8hP13IrbI/XhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10169337bd6c0767c0e11ae60a7547501aa81afb78a2241271cbda0c8d630c87","last_reissued_at":"2026-07-05T04:00:22.000754Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:22.000754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.09424","source_version":2,"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-07-05T04:00:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PRl0+L1P4oGHPWjGW2Rt5K8gl0iH4GTtPLRs8O9Dt1Ic99Cz4RBk0VkCN3OJlEZlGRbJ+cnwZ6xwmtFBlqfGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:15:04.771346Z"},"content_sha256":"2a85cd9fed920208fc773e4957bd9eb339134a000d461230ed8c5223dce111a6","schema_version":"1.0","event_id":"sha256:2a85cd9fed920208fc773e4957bd9eb339134a000d461230ed8c5223dce111a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:CALJGN55NQDWPQHBDLTAU5KHKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiongzhi Zheng, Wenchang Xu, Wentao Li, Yawei Hong, Yongfu Chen","submitted_at":"2022-01-24T02:43:08Z","abstract_excerpt":"The multiple Traveling Salesmen Problem (mTSP) is a general extension of the famous NP-hard Traveling Salesmen Problem (TSP), that there are m (m > 1) salesmen to visit the cities. In this paper, we address the mTSP with both the minsum objective and minmax objective, which aims at minimizing the total length of the $m$ tours and the length of the longest tour among all the m tours, respectively. We propose an iterated two-stage heuristic algorithm called ITSHA for the mTSP. Each iteration of ITSHA consists of an initialization stage and an improvement stage. The initialization stage aims to g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09424","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.09424/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:00:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOP6cXcRRaa33SNTMkRsXrR7FzvhPZk6tb3MaNqgDhW62AUCRfvAPp3FEfaIzLKm85LQjFw2PQE67yIEolG2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:15:04.771693Z"},"content_sha256":"b0ea2316c2483b718e5fb8147c8e595b547d90633193ced1fce9a81886fb0f4f","schema_version":"1.0","event_id":"sha256:b0ea2316c2483b718e5fb8147c8e595b547d90633193ced1fce9a81886fb0f4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA/bundle.json","state_url":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CALJGN55NQDWPQHBDLTAU5KHKA/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-08-23T14:15:04Z","links":{"resolver":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA","bundle":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA/bundle.json","state":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CALJGN55NQDWPQHBDLTAU5KHKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:CALJGN55NQDWPQHBDLTAU5KHKA","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":"c916ce5ea6e186cf5841b9894558315b0c2df2a694a369d2e396d058b6b7c2e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-24T02:43:08Z","title_canon_sha256":"e317834458b4b228a4df6bc4d6ad09789495f27fe36019b12382bc8b5da8bc96"},"schema_version":"1.0","source":{"id":"2201.09424","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.09424","created_at":"2026-07-05T04:00:22Z"},{"alias_kind":"arxiv_version","alias_value":"2201.09424v2","created_at":"2026-07-05T04:00:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09424","created_at":"2026-07-05T04:00:22Z"},{"alias_kind":"pith_short_12","alias_value":"CALJGN55NQDW","created_at":"2026-07-05T04:00:22Z"},{"alias_kind":"pith_short_16","alias_value":"CALJGN55NQDWPQHB","created_at":"2026-07-05T04:00:22Z"},{"alias_kind":"pith_short_8","alias_value":"CALJGN55","created_at":"2026-07-05T04:00:22Z"}],"graph_snapshots":[{"event_id":"sha256:b0ea2316c2483b718e5fb8147c8e595b547d90633193ced1fce9a81886fb0f4f","target":"graph","created_at":"2026-07-05T04:00: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.09424/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The multiple Traveling Salesmen Problem (mTSP) is a general extension of the famous NP-hard Traveling Salesmen Problem (TSP), that there are m (m > 1) salesmen to visit the cities. In this paper, we address the mTSP with both the minsum objective and minmax objective, which aims at minimizing the total length of the $m$ tours and the length of the longest tour among all the m tours, respectively. We propose an iterated two-stage heuristic algorithm called ITSHA for the mTSP. Each iteration of ITSHA consists of an initialization stage and an improvement stage. The initialization stage aims to g","authors_text":"Jiongzhi Zheng, Wenchang Xu, Wentao Li, Yawei Hong, Yongfu Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-24T02:43:08Z","title":"An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09424","kind":"arxiv","version":2},"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:2a85cd9fed920208fc773e4957bd9eb339134a000d461230ed8c5223dce111a6","target":"record","created_at":"2026-07-05T04:00: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":"c916ce5ea6e186cf5841b9894558315b0c2df2a694a369d2e396d058b6b7c2e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-24T02:43:08Z","title_canon_sha256":"e317834458b4b228a4df6bc4d6ad09789495f27fe36019b12382bc8b5da8bc96"},"schema_version":"1.0","source":{"id":"2201.09424","kind":"arxiv","version":2}},"canonical_sha256":"10169337bd6c0767c0e11ae60a7547501aa81afb78a2241271cbda0c8d630c87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10169337bd6c0767c0e11ae60a7547501aa81afb78a2241271cbda0c8d630c87","first_computed_at":"2026-07-05T04:00:22.000754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:00:22.000754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fLJpfGqiM8QJVIe7zafnHwEn5a11xn4vgPsvlSuNeFZCZEOsjmE0be/LWTtU+t4X+2B6f1+r8hP13IrbI/XhBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:00:22.001229Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.09424","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a85cd9fed920208fc773e4957bd9eb339134a000d461230ed8c5223dce111a6","sha256:b0ea2316c2483b718e5fb8147c8e595b547d90633193ced1fce9a81886fb0f4f"],"state_sha256":"cc160f4188b16cb42dbcb0f5e76e55505db946534f604e040c47fa5ee98399ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08kYOBCW3Xl4bfD/+H2SWvz9gz3t2BqQi9FIUdxtj9xJR0JvDShm7q2GUmZj87elsUAYh3GLe7aFzH356hU+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T14:15:04.774830Z","bundle_sha256":"c0557abf6085655262ea6b55f0e69cec369f1395f682477acae850fe6d27bfbf"}}