{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MQNAE4R7J7232XLOFR3NYJQRCO","short_pith_number":"pith:MQNAE4R7","schema_version":"1.0","canonical_sha256":"641a02723f4ff5bd5d6e2c76dc261113a0bde7d5f4c0928bbdc7d8a8462dace7","source":{"kind":"arxiv","id":"1604.04138","version":1},"attestation_state":"computed","paper":{"title":"An Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.NE","authors_text":"Eneko Osaba, Fernando Diaz, Pedro Lopez-Garcia, Roberto Carballedo, Xin-She Yang","submitted_at":"2016-04-14T12:52:20Z","abstract_excerpt":"Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric traveling salesman problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obta"},"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":"1604.04138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-14T12:52:20Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"3d18bb29fc281703587909f8f661fd4feaff5e5c3057a79dc4fbabdcce6d71a7","abstract_canon_sha256":"78c48860bf838de43a01142932ab43cd91dcb5559ad570863bb1c3444cbda5db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:06.542897Z","signature_b64":"8lAxuUtQhHqm8pxIcJQVnKJEx64PakR1qHRH10O48nSqdY3pkh/FWnQqe3WBZLRsgIA/vW+WrbSVBsf9PknACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"641a02723f4ff5bd5d6e2c76dc261113a0bde7d5f4c0928bbdc7d8a8462dace7","last_reissued_at":"2026-05-18T01:17:06.542107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:06.542107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.NE","authors_text":"Eneko Osaba, Fernando Diaz, Pedro Lopez-Garcia, Roberto Carballedo, Xin-She Yang","submitted_at":"2016-04-14T12:52:20Z","abstract_excerpt":"Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric traveling salesman problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04138","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":"1604.04138","created_at":"2026-05-18T01:17:06.542236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04138v1","created_at":"2026-05-18T01:17:06.542236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04138","created_at":"2026-05-18T01:17:06.542236+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQNAE4R7J723","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQNAE4R7J7232XLO","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQNAE4R7","created_at":"2026-05-18T12:30:32.724797+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/MQNAE4R7J7232XLOFR3NYJQRCO","json":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO.json","graph_json":"https://pith.science/api/pith-number/MQNAE4R7J7232XLOFR3NYJQRCO/graph.json","events_json":"https://pith.science/api/pith-number/MQNAE4R7J7232XLOFR3NYJQRCO/events.json","paper":"https://pith.science/paper/MQNAE4R7"},"agent_actions":{"view_html":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO","download_json":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO.json","view_paper":"https://pith.science/paper/MQNAE4R7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04138&json=true","fetch_graph":"https://pith.science/api/pith-number/MQNAE4R7J7232XLOFR3NYJQRCO/graph.json","fetch_events":"https://pith.science/api/pith-number/MQNAE4R7J7232XLOFR3NYJQRCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO/action/storage_attestation","attest_author":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO/action/author_attestation","sign_citation":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO/action/citation_signature","submit_replication":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO/action/replication_record"}},"created_at":"2026-05-18T01:17:06.542236+00:00","updated_at":"2026-05-18T01:17:06.542236+00:00"}