{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FUXEL56EHZZKLYCEU6RD5GA3QY","short_pith_number":"pith:FUXEL56E","canonical_record":{"source":{"id":"1408.5348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-22T16:18:09Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"0c92b19bfc49d16e216a7e6d9367e8eaa7e0b13ae55bbb27a4d31a0127bd5268","abstract_canon_sha256":"8687f841809e9da8417970702fcc2bf4234c9f98e1930bbb2767c39f34a0199c"},"schema_version":"1.0"},"canonical_sha256":"2d2e45f7c43e72a5e044a7a23e981b862a9934b71f812ebaa4b242323e860a48","source":{"kind":"arxiv","id":"1408.5348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5348","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5348v1","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5348","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"FUXEL56EHZZK","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FUXEL56EHZZKLYCE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FUXEL56E","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FUXEL56EHZZKLYCEU6RD5GA3QY","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-22T16:18:09Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"0c92b19bfc49d16e216a7e6d9367e8eaa7e0b13ae55bbb27a4d31a0127bd5268","abstract_canon_sha256":"8687f841809e9da8417970702fcc2bf4234c9f98e1930bbb2767c39f34a0199c"},"schema_version":"1.0"},"canonical_sha256":"2d2e45f7c43e72a5e044a7a23e981b862a9934b71f812ebaa4b242323e860a48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.180981Z","signature_b64":"C0LSlfjVd8E4iCD493aLPYDPwVPokhjjVJ9JoCM5i4hiFpTbaVa5zfLZiTPN2mdSGNUrewKHJq1p1tzUpA0MCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d2e45f7c43e72a5e044a7a23e981b862a9934b71f812ebaa4b242323e860a48","last_reissued_at":"2026-05-18T02:44:33.180525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.180525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5348","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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXIFXJaTuuMgecjRqdmH4xr15SK73SYlk91ZlQ10PbpUHWNRqSHmkoF6eVlcOHLqB7LQsaFMzscu6elwXcA1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:47:02.476625Z"},"content_sha256":"4c98f8d2413d60ca8e4664d2a4406c17e2635a2692aa0835d3b62f6e983fa512","schema_version":"1.0","event_id":"sha256:4c98f8d2413d60ca8e4664d2a4406c17e2635a2692aa0835d3b62f6e983fa512"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FUXEL56EHZZKLYCEU6RD5GA3QY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bat Algorithm is Better Than Intermittent Search Strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"math.OC","authors_text":"Simon Fong, Suash Deb, Xin-She Yang","submitted_at":"2014-08-22T16:18:09Z","abstract_excerpt":"The efficiency of any metaheuristic algorithm largely depends on the way of balancing local intensive exploitation and global diverse exploration. Studies show that bat algorithm can provide a good balance between these two key components with superior efficiency. In this paper, we first review some commonly used metaheuristic algorithms, and then compare the performance of bat algorithm with the so-called intermittent search strategy. From simulations, we found that bat algorithm is better than the optimal intermittent search strategy. We also analyse the comparison results and their implicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5348","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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTnW37EjBtmh92tASzHm2xkG5B0c0VXUtLbPgu2Lj1IZ7/e3VTtYOUqCzjSNDqEVAIcioyuN34ChsCybw7G1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:47:02.477254Z"},"content_sha256":"2885bc736c8371a8aeb9e1f0816cc80c2224c97d2b3a8adc69f6a8965eab979b","schema_version":"1.0","event_id":"sha256:2885bc736c8371a8aeb9e1f0816cc80c2224c97d2b3a8adc69f6a8965eab979b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUXEL56EHZZKLYCEU6RD5GA3QY/bundle.json","state_url":"https://pith.science/pith/FUXEL56EHZZKLYCEU6RD5GA3QY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUXEL56EHZZKLYCEU6RD5GA3QY/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-05-26T10:47:02Z","links":{"resolver":"https://pith.science/pith/FUXEL56EHZZKLYCEU6RD5GA3QY","bundle":"https://pith.science/pith/FUXEL56EHZZKLYCEU6RD5GA3QY/bundle.json","state":"https://pith.science/pith/FUXEL56EHZZKLYCEU6RD5GA3QY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUXEL56EHZZKLYCEU6RD5GA3QY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FUXEL56EHZZKLYCEU6RD5GA3QY","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":"8687f841809e9da8417970702fcc2bf4234c9f98e1930bbb2767c39f34a0199c","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-22T16:18:09Z","title_canon_sha256":"0c92b19bfc49d16e216a7e6d9367e8eaa7e0b13ae55bbb27a4d31a0127bd5268"},"schema_version":"1.0","source":{"id":"1408.5348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5348","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5348v1","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5348","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"FUXEL56EHZZK","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FUXEL56EHZZKLYCE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FUXEL56E","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:2885bc736c8371a8aeb9e1f0816cc80c2224c97d2b3a8adc69f6a8965eab979b","target":"graph","created_at":"2026-05-18T02:44:33Z","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 efficiency of any metaheuristic algorithm largely depends on the way of balancing local intensive exploitation and global diverse exploration. Studies show that bat algorithm can provide a good balance between these two key components with superior efficiency. In this paper, we first review some commonly used metaheuristic algorithms, and then compare the performance of bat algorithm with the so-called intermittent search strategy. From simulations, we found that bat algorithm is better than the optimal intermittent search strategy. We also analyse the comparison results and their implicat","authors_text":"Simon Fong, Suash Deb, Xin-She Yang","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-22T16:18:09Z","title":"Bat Algorithm is Better Than Intermittent Search Strategy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5348","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:4c98f8d2413d60ca8e4664d2a4406c17e2635a2692aa0835d3b62f6e983fa512","target":"record","created_at":"2026-05-18T02:44:33Z","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":"8687f841809e9da8417970702fcc2bf4234c9f98e1930bbb2767c39f34a0199c","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-22T16:18:09Z","title_canon_sha256":"0c92b19bfc49d16e216a7e6d9367e8eaa7e0b13ae55bbb27a4d31a0127bd5268"},"schema_version":"1.0","source":{"id":"1408.5348","kind":"arxiv","version":1}},"canonical_sha256":"2d2e45f7c43e72a5e044a7a23e981b862a9934b71f812ebaa4b242323e860a48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d2e45f7c43e72a5e044a7a23e981b862a9934b71f812ebaa4b242323e860a48","first_computed_at":"2026-05-18T02:44:33.180525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:33.180525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C0LSlfjVd8E4iCD493aLPYDPwVPokhjjVJ9JoCM5i4hiFpTbaVa5zfLZiTPN2mdSGNUrewKHJq1p1tzUpA0MCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:33.180981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c98f8d2413d60ca8e4664d2a4406c17e2635a2692aa0835d3b62f6e983fa512","sha256:2885bc736c8371a8aeb9e1f0816cc80c2224c97d2b3a8adc69f6a8965eab979b"],"state_sha256":"40f54a5c74412334387e192970c5e91498a53197813b138802556053b2fa308b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jjndP/TfDMw0+ksQIiOqzk1jwI6BN/cBF8IoPZp3qhDnjIxes7Awjl5Y9hFSSObvBmgYzgjqe0s04llY2rC/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:47:02.480697Z","bundle_sha256":"3c5a0ad6be0238d438d120613d5e10a8a33abebb8b555adafa49c293bda443e4"}}