{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:76N3MIVNOCAIB33KPJRXI7NJJN","short_pith_number":"pith:76N3MIVN","schema_version":"1.0","canonical_sha256":"ff9bb622ad708080ef6a7a63747da94b6374242e293e9d89ea0982754597e369","source":{"kind":"arxiv","id":"2506.01107","version":2},"attestation_state":"computed","paper":{"title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.NE","authors_text":"Abderrahim Bendahi, Adrien Fradin, Benjamin Doerr, Johannes F. Lutzeyer","submitted_at":"2025-06-01T18:16:06Z","abstract_excerpt":"The move-acceptance hyper-heuristic was recently shown to be able to leave local optima with astonishing efficiency (Lissovoi et al., Artificial Intelligence (2023)). In this work, we propose two modifications to this algorithm that demonstrate impressive performances on a large class of benchmarks including the classic Cliff$_d$ and Jump$_m$ function classes. (i) Instead of randomly choosing between the only-improving and any-move acceptance operator, we take this choice via a simple two-state Markov chain. This modification alone reduces the runtime on Jump$_m$ functions with gap parameter $"},"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":"2506.01107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2025-06-01T18:16:06Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"75ce15a46241d792f60c0041a8b3f1221ff01a0054ab2e55a06f60fd9cfa54a6","abstract_canon_sha256":"402ea9e7eac391945cfef2aa1c5b4fcdc91648bb3751d9754f7481a3e1c0fd86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:46.727279Z","signature_b64":"g+MmrKM//hI4Yzkq+mKpuiaM4jfkjurXONsUVnYXLnwyRDtCR5+EGvGxr0FfgENmyDzas9EFSEgjm8VKLB1TAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9bb622ad708080ef6a7a63747da94b6374242e293e9d89ea0982754597e369","last_reissued_at":"2026-07-05T12:02:46.726757Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:46.726757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.NE","authors_text":"Abderrahim Bendahi, Adrien Fradin, Benjamin Doerr, Johannes F. Lutzeyer","submitted_at":"2025-06-01T18:16:06Z","abstract_excerpt":"The move-acceptance hyper-heuristic was recently shown to be able to leave local optima with astonishing efficiency (Lissovoi et al., Artificial Intelligence (2023)). In this work, we propose two modifications to this algorithm that demonstrate impressive performances on a large class of benchmarks including the classic Cliff$_d$ and Jump$_m$ function classes. (i) Instead of randomly choosing between the only-improving and any-move acceptance operator, we take this choice via a simple two-state Markov chain. This modification alone reduces the runtime on Jump$_m$ functions with gap parameter $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01107","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.01107/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.01107","created_at":"2026-07-05T12:02:46.726814+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01107v2","created_at":"2026-07-05T12:02:46.726814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01107","created_at":"2026-07-05T12:02:46.726814+00:00"},{"alias_kind":"pith_short_12","alias_value":"76N3MIVNOCAI","created_at":"2026-07-05T12:02:46.726814+00:00"},{"alias_kind":"pith_short_16","alias_value":"76N3MIVNOCAIB33K","created_at":"2026-07-05T12:02:46.726814+00:00"},{"alias_kind":"pith_short_8","alias_value":"76N3MIVN","created_at":"2026-07-05T12:02:46.726814+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/76N3MIVNOCAIB33KPJRXI7NJJN","json":"https://pith.science/pith/76N3MIVNOCAIB33KPJRXI7NJJN.json","graph_json":"https://pith.science/api/pith-number/76N3MIVNOCAIB33KPJRXI7NJJN/graph.json","events_json":"https://pith.science/api/pith-number/76N3MIVNOCAIB33KPJRXI7NJJN/events.json","paper":"https://pith.science/paper/76N3MIVN"},"agent_actions":{"view_html":"https://pith.science/pith/76N3MIVNOCAIB33KPJRXI7NJJN","download_json":"https://pith.science/pith/76N3MIVNOCAIB33KPJRXI7NJJN.json","view_paper":"https://pith.science/paper/76N3MIVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01107&json=true","fetch_graph":"https://pith.science/api/pith-number/76N3MIVNOCAIB33KPJRXI7NJJN/graph.json","fetch_events":"https://pith.science/api/pith-number/76N3MIVNOCAIB33KPJRXI7NJJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76N3MIVNOCAIB33KPJRXI7NJJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76N3MIVNOCAIB33KPJRXI7NJJN/action/storage_attestation","attest_author":"https://pith.science/pith/76N3MIVNOCAIB33KPJRXI7NJJN/action/author_attestation","sign_citation":"https://pith.science/pith/76N3MIVNOCAIB33KPJRXI7NJJN/action/citation_signature","submit_replication":"https://pith.science/pith/76N3MIVNOCAIB33KPJRXI7NJJN/action/replication_record"}},"created_at":"2026-07-05T12:02:46.726814+00:00","updated_at":"2026-07-05T12:02:46.726814+00:00"}