{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MTY5SR5LU4TY7ZH5Z76WPH33ZS","short_pith_number":"pith:MTY5SR5L","canonical_record":{"source":{"id":"1409.3078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-10T14:15:29Z","cross_cats_sorted":[],"title_canon_sha256":"e02a80c0ed2b4d8179fb0dfa722c9b843f0d78f9364f5035aa8c44c53beb7d35","abstract_canon_sha256":"99c0f1637c52017d29482e2cb5f3efb13901ffdf22459a8e00f41f17ba4bd5e6"},"schema_version":"1.0"},"canonical_sha256":"64f1d947aba7278fe4fdcffd679f7bcc827ad925ce83bf6d9705461b23c3d357","source":{"kind":"arxiv","id":"1409.3078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3078","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3078v1","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3078","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"MTY5SR5LU4TY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MTY5SR5LU4TY7ZH5","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MTY5SR5L","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MTY5SR5LU4TY7ZH5Z76WPH33ZS","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-10T14:15:29Z","cross_cats_sorted":[],"title_canon_sha256":"e02a80c0ed2b4d8179fb0dfa722c9b843f0d78f9364f5035aa8c44c53beb7d35","abstract_canon_sha256":"99c0f1637c52017d29482e2cb5f3efb13901ffdf22459a8e00f41f17ba4bd5e6"},"schema_version":"1.0"},"canonical_sha256":"64f1d947aba7278fe4fdcffd679f7bcc827ad925ce83bf6d9705461b23c3d357","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:08.406095Z","signature_b64":"QBzTC1IsOkjOQRWIgiK4eWbZ6lLW4/MNpHfW5pgDgQ9yUI876N1A3oUgwt8+7UUSlKVYOvhMVCTWjBQyQ0f4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64f1d947aba7278fe4fdcffd679f7bcc827ad925ce83bf6d9705461b23c3d357","last_reissued_at":"2026-05-18T02:43:08.405678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:08.405678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3078","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:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"svrJYde2XNUbnYOgb+nd0wt4ptXlwF/2XmloQqwVHVepkKedtWm892cfEHP7mIg1ATyyXqR7w7BiDkB9Xmz+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:26:59.968984Z"},"content_sha256":"4232622d3d9cf31c1752856f79bc39cbc9aa7bcb9e83874de7248f6fd4275271","schema_version":"1.0","event_id":"sha256:4232622d3d9cf31c1752856f79bc39cbc9aa7bcb9e83874de7248f6fd4275271"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MTY5SR5LU4TY7ZH5Z76WPH33ZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An improved genetic algorithm with a local optimization strategy and an extra mutation level for solving traveling salesman problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Keivan Borna, Vahid Haji Hashemi","submitted_at":"2014-09-10T14:15:29Z","abstract_excerpt":"The Traveling salesman problem (TSP) is proved to be NP-complete in most cases. The genetic algorithm (GA) is one of the most useful algorithms for solving this problem. In this paper a conventional GA is compared with an improved hybrid GA in solving TSP. The improved or hybrid GA consist of conventional GA and two local optimization strategies. The first strategy is extracting all sequential groups including four cities of samples and changing the two central cities with each other. The second local optimization strategy is similar to an extra mutation process. In this step with a low probab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3078","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:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCEIMJR31YN17asVS2f5YqPvq/crmfNbmaMRlnI+jDtHpfvzA+BOoNiaOAhxA5VaSGfqRGU9T7uEqTCt9CA0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:26:59.969659Z"},"content_sha256":"839a31cd88d9d40dbc136598f3badaa2e4d8e006a60bda6cf6ee21135656e20a","schema_version":"1.0","event_id":"sha256:839a31cd88d9d40dbc136598f3badaa2e4d8e006a60bda6cf6ee21135656e20a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTY5SR5LU4TY7ZH5Z76WPH33ZS/bundle.json","state_url":"https://pith.science/pith/MTY5SR5LU4TY7ZH5Z76WPH33ZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTY5SR5LU4TY7ZH5Z76WPH33ZS/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-11T08:26:59Z","links":{"resolver":"https://pith.science/pith/MTY5SR5LU4TY7ZH5Z76WPH33ZS","bundle":"https://pith.science/pith/MTY5SR5LU4TY7ZH5Z76WPH33ZS/bundle.json","state":"https://pith.science/pith/MTY5SR5LU4TY7ZH5Z76WPH33ZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTY5SR5LU4TY7ZH5Z76WPH33ZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MTY5SR5LU4TY7ZH5Z76WPH33ZS","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":"99c0f1637c52017d29482e2cb5f3efb13901ffdf22459a8e00f41f17ba4bd5e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-10T14:15:29Z","title_canon_sha256":"e02a80c0ed2b4d8179fb0dfa722c9b843f0d78f9364f5035aa8c44c53beb7d35"},"schema_version":"1.0","source":{"id":"1409.3078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3078","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3078v1","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3078","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"MTY5SR5LU4TY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MTY5SR5LU4TY7ZH5","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MTY5SR5L","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:839a31cd88d9d40dbc136598f3badaa2e4d8e006a60bda6cf6ee21135656e20a","target":"graph","created_at":"2026-05-18T02:43:08Z","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 Traveling salesman problem (TSP) is proved to be NP-complete in most cases. The genetic algorithm (GA) is one of the most useful algorithms for solving this problem. In this paper a conventional GA is compared with an improved hybrid GA in solving TSP. The improved or hybrid GA consist of conventional GA and two local optimization strategies. The first strategy is extracting all sequential groups including four cities of samples and changing the two central cities with each other. The second local optimization strategy is similar to an extra mutation process. In this step with a low probab","authors_text":"Keivan Borna, Vahid Haji Hashemi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-10T14:15:29Z","title":"An improved genetic algorithm with a local optimization strategy and an extra mutation level for solving traveling salesman problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3078","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:4232622d3d9cf31c1752856f79bc39cbc9aa7bcb9e83874de7248f6fd4275271","target":"record","created_at":"2026-05-18T02:43:08Z","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":"99c0f1637c52017d29482e2cb5f3efb13901ffdf22459a8e00f41f17ba4bd5e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-10T14:15:29Z","title_canon_sha256":"e02a80c0ed2b4d8179fb0dfa722c9b843f0d78f9364f5035aa8c44c53beb7d35"},"schema_version":"1.0","source":{"id":"1409.3078","kind":"arxiv","version":1}},"canonical_sha256":"64f1d947aba7278fe4fdcffd679f7bcc827ad925ce83bf6d9705461b23c3d357","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64f1d947aba7278fe4fdcffd679f7bcc827ad925ce83bf6d9705461b23c3d357","first_computed_at":"2026-05-18T02:43:08.405678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:08.405678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QBzTC1IsOkjOQRWIgiK4eWbZ6lLW4/MNpHfW5pgDgQ9yUI876N1A3oUgwt8+7UUSlKVYOvhMVCTWjBQyQ0f4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:08.406095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4232622d3d9cf31c1752856f79bc39cbc9aa7bcb9e83874de7248f6fd4275271","sha256:839a31cd88d9d40dbc136598f3badaa2e4d8e006a60bda6cf6ee21135656e20a"],"state_sha256":"fd74769a338cbb47e72ee66f8d8d08ec8d2ccd1d465a5c9d3406b5994cc50080"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMMb+oHyd5cov7EvaGb8wkQavbP3b/XFP6HdouhVZgSVWAW4VmC8QfERz2mPsomQj6nQojuOaKW6NR779YaGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:26:59.973535Z","bundle_sha256":"c877431b805eb4f485397751eb74787298cb281b1b8ba5abf50ad9adc967e2fb"}}