{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AWCY6ONVTTSJTP2Z7Z6XQPHCYS","short_pith_number":"pith:AWCY6ONV","schema_version":"1.0","canonical_sha256":"05858f39b59ce499bf59fe7d783ce2c48df875742c598f7493bd01e27dfc038e","source":{"kind":"arxiv","id":"1606.06041","version":1},"attestation_state":"computed","paper":{"title":"Bandit-Based Random Mutation Hill-Climbing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"Diego Pe\\'rez-Lie\\'bana, Jialin Liu, Simon M. Lucas","submitted_at":"2016-06-20T09:53:29Z","abstract_excerpt":"The Random Mutation Hill-Climbing algorithm is a direct search technique mostly used in discrete domains. It repeats the process of randomly selecting a neighbour of a best-so-far solution and accepts the neighbour if it is better than or equal to it. In this work, we propose to use a novel method to select the neighbour solution using a set of independent multi- armed bandit-style selection units which results in a bandit-based Random Mutation Hill-Climbing algorithm. The new algorithm significantly outperforms Random Mutation Hill-Climbing in both OneMax (in noise-free and noisy cases) and R"},"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":"1606.06041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-20T09:53:29Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"d64915e760571e8388a85d2008601ba9af5722a0ddf490b1ee9b6aea9d32ee9c","abstract_canon_sha256":"7e559de2be8524bb9322f2cb2932ee08ffb6008e5bc50a69bc7d01975c6a0760"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:15.578036Z","signature_b64":"RsjqkPTfGN5xgT44K3/qFJ2WkbxTpcmi2hzZQFGCl+7XD96cY8F1u8SaEdS7gqWoiIfnBYNWwoiQ9fZAz2dcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05858f39b59ce499bf59fe7d783ce2c48df875742c598f7493bd01e27dfc038e","last_reissued_at":"2026-05-18T01:12:15.577703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:15.577703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bandit-Based Random Mutation Hill-Climbing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"Diego Pe\\'rez-Lie\\'bana, Jialin Liu, Simon M. Lucas","submitted_at":"2016-06-20T09:53:29Z","abstract_excerpt":"The Random Mutation Hill-Climbing algorithm is a direct search technique mostly used in discrete domains. It repeats the process of randomly selecting a neighbour of a best-so-far solution and accepts the neighbour if it is better than or equal to it. In this work, we propose to use a novel method to select the neighbour solution using a set of independent multi- armed bandit-style selection units which results in a bandit-based Random Mutation Hill-Climbing algorithm. The new algorithm significantly outperforms Random Mutation Hill-Climbing in both OneMax (in noise-free and noisy cases) and R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06041","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":"1606.06041","created_at":"2026-05-18T01:12:15.577754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06041v1","created_at":"2026-05-18T01:12:15.577754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06041","created_at":"2026-05-18T01:12:15.577754+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWCY6ONVTTSJ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWCY6ONVTTSJTP2Z","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWCY6ONV","created_at":"2026-05-18T12:30:07.202191+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/AWCY6ONVTTSJTP2Z7Z6XQPHCYS","json":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS.json","graph_json":"https://pith.science/api/pith-number/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/graph.json","events_json":"https://pith.science/api/pith-number/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/events.json","paper":"https://pith.science/paper/AWCY6ONV"},"agent_actions":{"view_html":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS","download_json":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS.json","view_paper":"https://pith.science/paper/AWCY6ONV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06041&json=true","fetch_graph":"https://pith.science/api/pith-number/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/graph.json","fetch_events":"https://pith.science/api/pith-number/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/action/storage_attestation","attest_author":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/action/author_attestation","sign_citation":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/action/citation_signature","submit_replication":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/action/replication_record"}},"created_at":"2026-05-18T01:12:15.577754+00:00","updated_at":"2026-05-18T01:12:15.577754+00:00"}