{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XPJFXBRNLSU6PB54RHXG3IIOX2","short_pith_number":"pith:XPJFXBRN","canonical_record":{"source":{"id":"1801.02335","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2018-01-08T08:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"f51641e74cb2b1f4e12b07ec563842ad9103720e1e8839f62e92e8afff80b1cd","abstract_canon_sha256":"16d8b5acdbc9a981de5c12ee1fd2e4e56b1b1ad11c6879b20ae701502be89879"},"schema_version":"1.0"},"canonical_sha256":"bbd25b862d5ca9e787bc89ee6da10ebea6dcd8449a26f5dcf6d3be360932da30","source":{"kind":"arxiv","id":"1801.02335","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02335","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02335v1","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02335","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"XPJFXBRNLSU6","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XPJFXBRNLSU6PB54","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XPJFXBRN","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XPJFXBRNLSU6PB54RHXG3IIOX2","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02335","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2018-01-08T08:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"f51641e74cb2b1f4e12b07ec563842ad9103720e1e8839f62e92e8afff80b1cd","abstract_canon_sha256":"16d8b5acdbc9a981de5c12ee1fd2e4e56b1b1ad11c6879b20ae701502be89879"},"schema_version":"1.0"},"canonical_sha256":"bbd25b862d5ca9e787bc89ee6da10ebea6dcd8449a26f5dcf6d3be360932da30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:32.006566Z","signature_b64":"hPRLUQMa6hFok8HU/6b2Pn3ULoS8J5QhmXlmQXZ0ZN/+YcFivNceu1NKmHkFM+L+uvYYkWeuNiLfO8heO1nxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd25b862d5ca9e787bc89ee6da10ebea6dcd8449a26f5dcf6d3be360932da30","last_reissued_at":"2026-05-18T00:26:32.005920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:32.005920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02335","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:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TaB90prUmE+A+tr95sORRCtODPnvPATKgal2gCd07xdyfScsl9rm1SkLD1WAjnPK71cjM3u9foANps+KB3GfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:02:20.545564Z"},"content_sha256":"9329e6c1d330d9f7a61277898ad6c61d474ccad84079bb307d6934d58b6bd8c1","schema_version":"1.0","event_id":"sha256:9329e6c1d330d9f7a61277898ad6c61d474ccad84079bb307d6934d58b6bd8c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XPJFXBRNLSU6PB54RHXG3IIOX2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Enhancing Genetic Algorithms Using New Crossovers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ahmad B. A. Hassanat, Esra'a Alkafaween","submitted_at":"2018-01-08T08:25:29Z","abstract_excerpt":"This paper investigates the use of more than one crossover operator to enhance the performance of genetic algorithms. Novel crossover operators are proposed such as the Collision crossover, which is based on the physical rules of elastic collision, in addition to proposing two selection strategies for the crossover operators, one of which is based on selecting the best crossover operator and the other randomly selects any operator. Several experiments on some Travelling Salesman Problems (TSP) have been conducted to evaluate the proposed methods, which are compared to the well-known Modified c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02335","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:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rC5FuTZgaDo2x7Yrt53kHOOf14/4QzEzWW2gVEen3W6NAcGou1vuMKGzhIggGcvvqoOv1AleZ5hQG69RNSRNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:02:20.546200Z"},"content_sha256":"921b0b8ec18b8b852b55d3c0cb3a1d05cc6c3e3696b2fe39d5451e448a9a61ce","schema_version":"1.0","event_id":"sha256:921b0b8ec18b8b852b55d3c0cb3a1d05cc6c3e3696b2fe39d5451e448a9a61ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPJFXBRNLSU6PB54RHXG3IIOX2/bundle.json","state_url":"https://pith.science/pith/XPJFXBRNLSU6PB54RHXG3IIOX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPJFXBRNLSU6PB54RHXG3IIOX2/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-07T05:02:20Z","links":{"resolver":"https://pith.science/pith/XPJFXBRNLSU6PB54RHXG3IIOX2","bundle":"https://pith.science/pith/XPJFXBRNLSU6PB54RHXG3IIOX2/bundle.json","state":"https://pith.science/pith/XPJFXBRNLSU6PB54RHXG3IIOX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPJFXBRNLSU6PB54RHXG3IIOX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XPJFXBRNLSU6PB54RHXG3IIOX2","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":"16d8b5acdbc9a981de5c12ee1fd2e4e56b1b1ad11c6879b20ae701502be89879","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2018-01-08T08:25:29Z","title_canon_sha256":"f51641e74cb2b1f4e12b07ec563842ad9103720e1e8839f62e92e8afff80b1cd"},"schema_version":"1.0","source":{"id":"1801.02335","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02335","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02335v1","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02335","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"XPJFXBRNLSU6","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XPJFXBRNLSU6PB54","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XPJFXBRN","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:921b0b8ec18b8b852b55d3c0cb3a1d05cc6c3e3696b2fe39d5451e448a9a61ce","target":"graph","created_at":"2026-05-18T00:26:32Z","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 investigates the use of more than one crossover operator to enhance the performance of genetic algorithms. Novel crossover operators are proposed such as the Collision crossover, which is based on the physical rules of elastic collision, in addition to proposing two selection strategies for the crossover operators, one of which is based on selecting the best crossover operator and the other randomly selects any operator. Several experiments on some Travelling Salesman Problems (TSP) have been conducted to evaluate the proposed methods, which are compared to the well-known Modified c","authors_text":"Ahmad B. A. Hassanat, Esra'a Alkafaween","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2018-01-08T08:25:29Z","title":"On Enhancing Genetic Algorithms Using New Crossovers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02335","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:9329e6c1d330d9f7a61277898ad6c61d474ccad84079bb307d6934d58b6bd8c1","target":"record","created_at":"2026-05-18T00:26:32Z","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":"16d8b5acdbc9a981de5c12ee1fd2e4e56b1b1ad11c6879b20ae701502be89879","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2018-01-08T08:25:29Z","title_canon_sha256":"f51641e74cb2b1f4e12b07ec563842ad9103720e1e8839f62e92e8afff80b1cd"},"schema_version":"1.0","source":{"id":"1801.02335","kind":"arxiv","version":1}},"canonical_sha256":"bbd25b862d5ca9e787bc89ee6da10ebea6dcd8449a26f5dcf6d3be360932da30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbd25b862d5ca9e787bc89ee6da10ebea6dcd8449a26f5dcf6d3be360932da30","first_computed_at":"2026-05-18T00:26:32.005920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:32.005920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hPRLUQMa6hFok8HU/6b2Pn3ULoS8J5QhmXlmQXZ0ZN/+YcFivNceu1NKmHkFM+L+uvYYkWeuNiLfO8heO1nxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:32.006566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02335","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9329e6c1d330d9f7a61277898ad6c61d474ccad84079bb307d6934d58b6bd8c1","sha256:921b0b8ec18b8b852b55d3c0cb3a1d05cc6c3e3696b2fe39d5451e448a9a61ce"],"state_sha256":"bf270cb3f355e69576598a421b953a718f93702b611f4a4d13bbe8c1cfe9c9a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfYesniXfGJLteRVLQwL3ficZSA3Cr63ycALU1e34jdfccwXhG605NzNQMXQapzbsL41Kye2O09ZcoIGPDrFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:02:20.549415Z","bundle_sha256":"5aee8fa60b1857794cc27859e077071039f739a5e50f75956c67080d26592788"}}