{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MQNAE4R7J7232XLOFR3NYJQRCO","short_pith_number":"pith:MQNAE4R7","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"},"canonical_sha256":"641a02723f4ff5bd5d6e2c76dc261113a0bde7d5f4c0928bbdc7d8a8462dace7","source":{"kind":"arxiv","id":"1604.04138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04138","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04138v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04138","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"MQNAE4R7J723","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MQNAE4R7J7232XLO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MQNAE4R7","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MQNAE4R7J7232XLOFR3NYJQRCO","target":"record","payload":{"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"},"canonical_sha256":"641a02723f4ff5bd5d6e2c76dc261113a0bde7d5f4c0928bbdc7d8a8462dace7","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"},"source_kind":"arxiv","source_id":"1604.04138","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-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wy8dUnDq1p5ESJE6oJORsD9RRoP83JfWsQD9arsiP5B7DBudHGBbzf5sH9XxziexACXL245wUxdmwTT2f01/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:32:20.685255Z"},"content_sha256":"732dd0553e28cc7014cdbd4136a2661e84332b0b3c5621e96fac0dfe4ae3a055","schema_version":"1.0","event_id":"sha256:732dd0553e28cc7014cdbd4136a2661e84332b0b3c5621e96fac0dfe4ae3a055"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MQNAE4R7J7232XLOFR3NYJQRCO","target":"graph","payload":{"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"},"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-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yr4q4DwIaoP35POdVUZUzDTwrZKCml19qszsfdafZmbjRopJzT5KB+naLjtEX3bdQJR738yrZZSz7XGS3UsDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:32:20.685633Z"},"content_sha256":"42293d5929c8ffb7e5375889b64d708115494b5e83581734fe8cc3fa5e13d479","schema_version":"1.0","event_id":"sha256:42293d5929c8ffb7e5375889b64d708115494b5e83581734fe8cc3fa5e13d479"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO/bundle.json","state_url":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQNAE4R7J7232XLOFR3NYJQRCO/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-24T12:32:20Z","links":{"resolver":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO","bundle":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO/bundle.json","state":"https://pith.science/pith/MQNAE4R7J7232XLOFR3NYJQRCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQNAE4R7J7232XLOFR3NYJQRCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MQNAE4R7J7232XLOFR3NYJQRCO","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":"78c48860bf838de43a01142932ab43cd91dcb5559ad570863bb1c3444cbda5db","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-14T12:52:20Z","title_canon_sha256":"3d18bb29fc281703587909f8f661fd4feaff5e5c3057a79dc4fbabdcce6d71a7"},"schema_version":"1.0","source":{"id":"1604.04138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04138","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04138v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04138","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"MQNAE4R7J723","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MQNAE4R7J7232XLO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MQNAE4R7","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:42293d5929c8ffb7e5375889b64d708115494b5e83581734fe8cc3fa5e13d479","target":"graph","created_at":"2026-05-18T01:17:06Z","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":"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","authors_text":"Eneko Osaba, Fernando Diaz, Pedro Lopez-Garcia, Roberto Carballedo, Xin-She Yang","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-14T12:52:20Z","title":"An Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04138","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:732dd0553e28cc7014cdbd4136a2661e84332b0b3c5621e96fac0dfe4ae3a055","target":"record","created_at":"2026-05-18T01:17:06Z","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":"78c48860bf838de43a01142932ab43cd91dcb5559ad570863bb1c3444cbda5db","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-14T12:52:20Z","title_canon_sha256":"3d18bb29fc281703587909f8f661fd4feaff5e5c3057a79dc4fbabdcce6d71a7"},"schema_version":"1.0","source":{"id":"1604.04138","kind":"arxiv","version":1}},"canonical_sha256":"641a02723f4ff5bd5d6e2c76dc261113a0bde7d5f4c0928bbdc7d8a8462dace7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"641a02723f4ff5bd5d6e2c76dc261113a0bde7d5f4c0928bbdc7d8a8462dace7","first_computed_at":"2026-05-18T01:17:06.542107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:06.542107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8lAxuUtQhHqm8pxIcJQVnKJEx64PakR1qHRH10O48nSqdY3pkh/FWnQqe3WBZLRsgIA/vW+WrbSVBsf9PknACw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:06.542897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:732dd0553e28cc7014cdbd4136a2661e84332b0b3c5621e96fac0dfe4ae3a055","sha256:42293d5929c8ffb7e5375889b64d708115494b5e83581734fe8cc3fa5e13d479"],"state_sha256":"a902030b026d0e0495319bcf970c678421b376666ccb91a678c91957feb8c717"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6hLpDOxHLHe9n1blxoyZnkZuhew+I7vQxjcyQNx6z7oxdUzmDUc3mNxcflt/y95be5LouWC5XkOuqDPVMR/DCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T12:32:20.687717Z","bundle_sha256":"740ab2a909f3d16978e6c34cb3b5aecaa3e1d41af38fa9b5e0b9775d818b0f9b"}}