{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:76GSOWQGMADR3HWMXUAOK6NQRS","short_pith_number":"pith:76GSOWQG","schema_version":"1.0","canonical_sha256":"ff8d275a0660071d9eccbd00e579b08c8fff3130622d37b022b0ce5cced31949","source":{"kind":"arxiv","id":"1607.04324","version":1},"attestation_state":"computed","paper":{"title":"Random-Key Cuckoo Search for the Travelling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Aziz Ouaarab, B. Ahiod, Xin-She Yang","submitted_at":"2016-04-14T12:40:50Z","abstract_excerpt":"Combinatorial optimization problems are typically NP-hard, and thus very challenging to solve. In this paper, we present the random key cuckoo search (RKCS) algorithm for solving the famous Travelling Salesman Problem (TSP). We used a simplified random-key encoding scheme to pass from a continuous space (real numbers) to a combinatorial space. We also consider the displacement of a solution in both spaces using Levy flights. The performance of the proposed RKCS is tested against a set of benchmarks of symmetric TSP from the well-known TSPLIB library. The results of the tests show that RKCS is "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1607.04324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-14T12:40:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"17243863814b47a7e53deb8786c9a8a0a17dd1c78c65153eb03d8ca8190836de","abstract_canon_sha256":"358923233fcc22d4dd6405f1eac68a7a2a04bb7bd04983b72baa126d28b2d787"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:01.502053Z","signature_b64":"a0PyUIGl/vu6SG8LYOD1p0lvRYQWCzZgW1WeQXwQspPP9lf+fP02KnuDs21eQvth8ZWp/AhWRM7BiEJs489NAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff8d275a0660071d9eccbd00e579b08c8fff3130622d37b022b0ce5cced31949","last_reissued_at":"2026-05-18T01:11:01.501438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:01.501438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random-Key Cuckoo Search for the Travelling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Aziz Ouaarab, B. Ahiod, Xin-She Yang","submitted_at":"2016-04-14T12:40:50Z","abstract_excerpt":"Combinatorial optimization problems are typically NP-hard, and thus very challenging to solve. In this paper, we present the random key cuckoo search (RKCS) algorithm for solving the famous Travelling Salesman Problem (TSP). We used a simplified random-key encoding scheme to pass from a continuous space (real numbers) to a combinatorial space. We also consider the displacement of a solution in both spaces using Levy flights. The performance of the proposed RKCS is tested against a set of benchmarks of symmetric TSP from the well-known TSPLIB library. The results of the tests show that RKCS is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04324","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.04324","created_at":"2026-05-18T01:11:01.501541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04324v1","created_at":"2026-05-18T01:11:01.501541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04324","created_at":"2026-05-18T01:11:01.501541+00:00"},{"alias_kind":"pith_short_12","alias_value":"76GSOWQGMADR","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"76GSOWQGMADR3HWM","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"76GSOWQG","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/76GSOWQGMADR3HWMXUAOK6NQRS","json":"https://pith.science/pith/76GSOWQGMADR3HWMXUAOK6NQRS.json","graph_json":"https://pith.science/api/pith-number/76GSOWQGMADR3HWMXUAOK6NQRS/graph.json","events_json":"https://pith.science/api/pith-number/76GSOWQGMADR3HWMXUAOK6NQRS/events.json","paper":"https://pith.science/paper/76GSOWQG"},"agent_actions":{"view_html":"https://pith.science/pith/76GSOWQGMADR3HWMXUAOK6NQRS","download_json":"https://pith.science/pith/76GSOWQGMADR3HWMXUAOK6NQRS.json","view_paper":"https://pith.science/paper/76GSOWQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04324&json=true","fetch_graph":"https://pith.science/api/pith-number/76GSOWQGMADR3HWMXUAOK6NQRS/graph.json","fetch_events":"https://pith.science/api/pith-number/76GSOWQGMADR3HWMXUAOK6NQRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76GSOWQGMADR3HWMXUAOK6NQRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76GSOWQGMADR3HWMXUAOK6NQRS/action/storage_attestation","attest_author":"https://pith.science/pith/76GSOWQGMADR3HWMXUAOK6NQRS/action/author_attestation","sign_citation":"https://pith.science/pith/76GSOWQGMADR3HWMXUAOK6NQRS/action/citation_signature","submit_replication":"https://pith.science/pith/76GSOWQGMADR3HWMXUAOK6NQRS/action/replication_record"}},"created_at":"2026-05-18T01:11:01.501541+00:00","updated_at":"2026-05-18T01:11:01.501541+00:00"}