{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:26XZPKGXKI24MIR66HM6HJBWUJ","short_pith_number":"pith:26XZPKGX","canonical_record":{"source":{"id":"2307.07120","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2023-07-14T01:57:10Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b1c64fdc26d1e4c717af9d0d325912cd6bf49f3bd357480045c5ddbaa793ffa6","abstract_canon_sha256":"b75412e3d7e6f6c227621001281a2874e77edb1752a7928d8520f893811fbc7e"},"schema_version":"1.0"},"canonical_sha256":"d7af97a8d75235c6223ef1d9e3a436a24f23c04163f6e6d9535f020f21b32b04","source":{"kind":"arxiv","id":"2307.07120","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.07120","created_at":"2026-07-05T07:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"2307.07120v3","created_at":"2026-07-05T07:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07120","created_at":"2026-07-05T07:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"26XZPKGXKI24","created_at":"2026-07-05T07:06:31Z"},{"alias_kind":"pith_short_16","alias_value":"26XZPKGXKI24MIR6","created_at":"2026-07-05T07:06:31Z"},{"alias_kind":"pith_short_8","alias_value":"26XZPKGX","created_at":"2026-07-05T07:06:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:26XZPKGXKI24MIR66HM6HJBWUJ","target":"record","payload":{"canonical_record":{"source":{"id":"2307.07120","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2023-07-14T01:57:10Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b1c64fdc26d1e4c717af9d0d325912cd6bf49f3bd357480045c5ddbaa793ffa6","abstract_canon_sha256":"b75412e3d7e6f6c227621001281a2874e77edb1752a7928d8520f893811fbc7e"},"schema_version":"1.0"},"canonical_sha256":"d7af97a8d75235c6223ef1d9e3a436a24f23c04163f6e6d9535f020f21b32b04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:31.852797Z","signature_b64":"7fEjMsLJ+PLXIU87cDHNRKPhshLGHgyz6gVMouzO+Ys75Eqp8gxf/kU/j4C/ByS2yc9OvPrOdN8SgZ2c8+MgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7af97a8d75235c6223ef1d9e3a436a24f23c04163f6e6d9535f020f21b32b04","last_reissued_at":"2026-07-05T07:06:31.852362Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:31.852362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.07120","source_version":3,"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-05T07:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQnh2TyszeMa5znr0hQsY8r86L0NlliQjsqZLQulE3rQM8PPvop94JBIJoUcARMiLhIX7pLp/mROcGDVpA9OAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:35:56.669024Z"},"content_sha256":"8d577d7e742259bf22893761e3485a1f4dcd03ae90cf1d85df036c7971c052d8","schema_version":"1.0","event_id":"sha256:8d577d7e742259bf22893761e3485a1f4dcd03ae90cf1d85df036c7971c052d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:26XZPKGXKI24MIR66HM6HJBWUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hybrid Genetic Algorithm for the min-max Multiple Traveling Salesman Problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Changhyun Kwon, Sasan Mahmoudinazlou","submitted_at":"2023-07-14T01:57:10Z","abstract_excerpt":"This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a TSP sequence as the representation of each individual, and a dynamic programming algorithm is employed to evaluate the individual and find the optimal mTSP solution for the given sequence of cities. A novel crossover operator is designed to combine similar tours from two parents and offers great diversity for the population. For some of the generated offspring, we detect and remove intersections between tours to o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07120","kind":"arxiv","version":3},"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/2307.07120/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-05T07:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmIrPy3T7e6e5FmAYnrYal6sn7mxn2U+2UEV/JnWXqn0aEYem9pEYCT4U1XqdR3lLVLxSjEOmEtqwAbiIFRRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:35:56.669577Z"},"content_sha256":"3ae0cbef65d3107e00149491cefcf56680f5c83521e892eca7ff9bd5bda7cfc0","schema_version":"1.0","event_id":"sha256:3ae0cbef65d3107e00149491cefcf56680f5c83521e892eca7ff9bd5bda7cfc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26XZPKGXKI24MIR66HM6HJBWUJ/bundle.json","state_url":"https://pith.science/pith/26XZPKGXKI24MIR66HM6HJBWUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26XZPKGXKI24MIR66HM6HJBWUJ/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-11T15:35:56Z","links":{"resolver":"https://pith.science/pith/26XZPKGXKI24MIR66HM6HJBWUJ","bundle":"https://pith.science/pith/26XZPKGXKI24MIR66HM6HJBWUJ/bundle.json","state":"https://pith.science/pith/26XZPKGXKI24MIR66HM6HJBWUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26XZPKGXKI24MIR66HM6HJBWUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:26XZPKGXKI24MIR66HM6HJBWUJ","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":"b75412e3d7e6f6c227621001281a2874e77edb1752a7928d8520f893811fbc7e","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2023-07-14T01:57:10Z","title_canon_sha256":"b1c64fdc26d1e4c717af9d0d325912cd6bf49f3bd357480045c5ddbaa793ffa6"},"schema_version":"1.0","source":{"id":"2307.07120","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.07120","created_at":"2026-07-05T07:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"2307.07120v3","created_at":"2026-07-05T07:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07120","created_at":"2026-07-05T07:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"26XZPKGXKI24","created_at":"2026-07-05T07:06:31Z"},{"alias_kind":"pith_short_16","alias_value":"26XZPKGXKI24MIR6","created_at":"2026-07-05T07:06:31Z"},{"alias_kind":"pith_short_8","alias_value":"26XZPKGX","created_at":"2026-07-05T07:06:31Z"}],"graph_snapshots":[{"event_id":"sha256:3ae0cbef65d3107e00149491cefcf56680f5c83521e892eca7ff9bd5bda7cfc0","target":"graph","created_at":"2026-07-05T07:06:31Z","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/2307.07120/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a TSP sequence as the representation of each individual, and a dynamic programming algorithm is employed to evaluate the individual and find the optimal mTSP solution for the given sequence of cities. A novel crossover operator is designed to combine similar tours from two parents and offers great diversity for the population. For some of the generated offspring, we detect and remove intersections between tours to o","authors_text":"Changhyun Kwon, Sasan Mahmoudinazlou","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2023-07-14T01:57:10Z","title":"A Hybrid Genetic Algorithm for the min-max Multiple Traveling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07120","kind":"arxiv","version":3},"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:8d577d7e742259bf22893761e3485a1f4dcd03ae90cf1d85df036c7971c052d8","target":"record","created_at":"2026-07-05T07:06:31Z","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":"b75412e3d7e6f6c227621001281a2874e77edb1752a7928d8520f893811fbc7e","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2023-07-14T01:57:10Z","title_canon_sha256":"b1c64fdc26d1e4c717af9d0d325912cd6bf49f3bd357480045c5ddbaa793ffa6"},"schema_version":"1.0","source":{"id":"2307.07120","kind":"arxiv","version":3}},"canonical_sha256":"d7af97a8d75235c6223ef1d9e3a436a24f23c04163f6e6d9535f020f21b32b04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7af97a8d75235c6223ef1d9e3a436a24f23c04163f6e6d9535f020f21b32b04","first_computed_at":"2026-07-05T07:06:31.852362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:06:31.852362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7fEjMsLJ+PLXIU87cDHNRKPhshLGHgyz6gVMouzO+Ys75Eqp8gxf/kU/j4C/ByS2yc9OvPrOdN8SgZ2c8+MgCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:06:31.852797Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.07120","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d577d7e742259bf22893761e3485a1f4dcd03ae90cf1d85df036c7971c052d8","sha256:3ae0cbef65d3107e00149491cefcf56680f5c83521e892eca7ff9bd5bda7cfc0"],"state_sha256":"84f970cdbaf63e0add3547a68036ea1b17e42f05e369b73997b39e0268adb515"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RReCbmAmrPqcC5qdmlMqiSHr4W48wegdZ17K0RluOWhOmA3FM0I8N5y+CmIu+5en7mn7cbEg2Bp2BHgMO/HuCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T15:35:56.673814Z","bundle_sha256":"cb912622559adaaaae22baa0b3ef78f39d051ea87a949cf3e44f5c24df7fe028"}}