{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AWCY6ONVTTSJTP2Z7Z6XQPHCYS","short_pith_number":"pith:AWCY6ONV","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"},"canonical_sha256":"05858f39b59ce499bf59fe7d783ce2c48df875742c598f7493bd01e27dfc038e","source":{"kind":"arxiv","id":"1606.06041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06041","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06041v1","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06041","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"pith_short_12","alias_value":"AWCY6ONVTTSJ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AWCY6ONVTTSJTP2Z","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AWCY6ONV","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AWCY6ONVTTSJTP2Z7Z6XQPHCYS","target":"record","payload":{"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"},"canonical_sha256":"05858f39b59ce499bf59fe7d783ce2c48df875742c598f7493bd01e27dfc038e","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"},"source_kind":"arxiv","source_id":"1606.06041","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:12:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2zvMv5VKooISgMYDHJ090JlHHeAVaAeVOYHaVSt1ZRIk/OvbNZbLJVVv6YSNdtU9ZDG0jRt/AKoQ6I8WaNiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:17:13.145643Z"},"content_sha256":"4fc5b532928abbb12f7cc2af7962959a763eb44c15635c5557c3d0d3a3710b8a","schema_version":"1.0","event_id":"sha256:4fc5b532928abbb12f7cc2af7962959a763eb44c15635c5557c3d0d3a3710b8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AWCY6ONVTTSJTP2Z7Z6XQPHCYS","target":"graph","payload":{"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"},"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:12:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lp6+1x6JK4iXtIVLsjwkYNlpUcr+zOqiDa+LYoC0OhqvfdFj3rCyFwDpShkRmI3YkcS90TLBRDJc5Nz3NAh2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:17:13.146276Z"},"content_sha256":"930afc7a9f2ec278677ca1bf6c3cc3fec4c0039b0b60390a268d62e89342d80c","schema_version":"1.0","event_id":"sha256:930afc7a9f2ec278677ca1bf6c3cc3fec4c0039b0b60390a268d62e89342d80c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/bundle.json","state_url":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/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-03T12:17:13Z","links":{"resolver":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS","bundle":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/bundle.json","state":"https://pith.science/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWCY6ONVTTSJTP2Z7Z6XQPHCYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AWCY6ONVTTSJTP2Z7Z6XQPHCYS","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":"7e559de2be8524bb9322f2cb2932ee08ffb6008e5bc50a69bc7d01975c6a0760","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-20T09:53:29Z","title_canon_sha256":"d64915e760571e8388a85d2008601ba9af5722a0ddf490b1ee9b6aea9d32ee9c"},"schema_version":"1.0","source":{"id":"1606.06041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06041","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06041v1","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06041","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"pith_short_12","alias_value":"AWCY6ONVTTSJ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AWCY6ONVTTSJTP2Z","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AWCY6ONV","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:930afc7a9f2ec278677ca1bf6c3cc3fec4c0039b0b60390a268d62e89342d80c","target":"graph","created_at":"2026-05-18T01:12:15Z","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 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","authors_text":"Diego Pe\\'rez-Lie\\'bana, Jialin Liu, Simon M. Lucas","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-20T09:53:29Z","title":"Bandit-Based Random Mutation Hill-Climbing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06041","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:4fc5b532928abbb12f7cc2af7962959a763eb44c15635c5557c3d0d3a3710b8a","target":"record","created_at":"2026-05-18T01:12:15Z","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":"7e559de2be8524bb9322f2cb2932ee08ffb6008e5bc50a69bc7d01975c6a0760","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-20T09:53:29Z","title_canon_sha256":"d64915e760571e8388a85d2008601ba9af5722a0ddf490b1ee9b6aea9d32ee9c"},"schema_version":"1.0","source":{"id":"1606.06041","kind":"arxiv","version":1}},"canonical_sha256":"05858f39b59ce499bf59fe7d783ce2c48df875742c598f7493bd01e27dfc038e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05858f39b59ce499bf59fe7d783ce2c48df875742c598f7493bd01e27dfc038e","first_computed_at":"2026-05-18T01:12:15.577703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:15.577703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RsjqkPTfGN5xgT44K3/qFJ2WkbxTpcmi2hzZQFGCl+7XD96cY8F1u8SaEdS7gqWoiIfnBYNWwoiQ9fZAz2dcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:15.578036Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fc5b532928abbb12f7cc2af7962959a763eb44c15635c5557c3d0d3a3710b8a","sha256:930afc7a9f2ec278677ca1bf6c3cc3fec4c0039b0b60390a268d62e89342d80c"],"state_sha256":"7b1db64958a04b8259b39c9475dcc329c78770e261804f9108afaa18f9abc8e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qGHRjm68G8ccRCINViX6JeXNMwQLMvR2PdA7ZE3AEl4Dk1MnIa/hMdbS+AMx8yAbqf0d+QSuOm9PNlziCbM3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:17:13.149696Z","bundle_sha256":"6e418ea5bb7db62e95211fda0b0b10c454b540111662b6315860cdf5ebc474a8"}}