frb100-40 After Two Decades: An Optimality Certificate and a Preregistered Search Study

arXiv:2609.02804 · cs.DM, cs.AI · Submitted 2026-09-02 · Read on arXiv

cs.DM, cs.AI

Submitted: 2026-09-02

Updated: 2026-09-02

Code: https://github.com/fmoessbauer/LibMVC

Project page: https://rb-bench.github.io/benchmarks/hidden-opt-graph.html

Terminology

• Benchmark — 9× in this paper · explained in 2 episodes
• Core — 9× in this paper · explained in 2 episodes
• Verifier — 4× in this paper · explained in 2 episodes
• Ablation — 3× in this paper · explained in 1 episode
• Verification — 2× in this paper · explained in 2 episodes
• Clustering — 1× in this paper · explained in 2 episodes
• Hamming Distance — 1× in this paper · explained in 2 episodes
• Phase Transitions — 1× in this paper · explained in 2 episodes
• Pruning — 1× in this paper · explained in 4 episodes
• Trace — 1× in this paper · explained in 2 episodes

Sources

• Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks

Related papers

• Automated Inference of Graph Transformation Rules