In the news
frb100-40 After Two Decades: An Optimality Certificate and a Preregistered Search Study
arXiv cs.AI · Published · 3 min read
In 30 seconds
- What happened
- Researcher proved the optimal solution to frb100-40, a 20-year-old graph benchmark, by finding a 100-vertex independent set and verifying it with a clique partition.
- Why it matters
- Matters for algorithm developers testing constraint solvers and combinatorial optimization heuristics on standard benchmarks.
- Watch out
- Preregistered experiments found no statistical acceleration from new repair operators over baseline methods, suggesting the search barrier is fundamental.
- eval
- benchmark
The patterns behind this
Each one covers how the technique works, when it earns its cost, and where it breaks.
The Agent Architect
One pattern, one tradeoff, one production failure story. A short weekly briefing for people building agentic systems.
Weekly email, one-click unsubscribe. We only use your address to send the briefing.