GABench - Graph Theory - Node Level (Text-Paired Graphs): leaderboard
GABench (2026) gives an LLM agent, run in the OpenClaw harness, graph-analysis questions over real graphs that it must answer by calling graph tools rather than reading the graph from the prompt; a DeepSeek-V4-Flash judge checks the final answer against a ground truth computed by executing the reference tool trajectory. This board covers node-level tasks that compute a structural graph property on text-paired graphs (the HIV and PCBA molecule collections). Score is the task success rate in percent; higher is better.
Metric: Task success rate (%; share of tasks whose final answer a DeepSeek-V4-Flash judge marks consistent with the verified ground truth; node-level graph theory (centralities, paths, bridges, cycles, diameters and similar structural properties) with its 54 graph-algorithm tools on text-paired graphs (the HIV and PCBA molecule collections, 200 generated tasks per dataset and category); LLM agent in the OpenClaw harness, one run). Source: arxiv.org. Saturation forecast: Around February 2027. 6 models tracked.
Top models
| # | Model | Score | Overall rank |
|---|---|---|---|
| 1 | Gemini 3 Flash | 70.58 | #164 |
| 2 | DeepSeek V4 Pro | 64.29 | #188 |
| 3 | GPT-5 Mini | 49.12 | #348 |
| 4 | GLM-5-Turbo | 28 | #231 |
| 5 | GLM-4.5 Flash | 17.39 | #979 |
| 6 | Qwen 3 235B A22B | 15 | #623 |
No result here: #1 Claude Fable 5.2, #2 Gemini 4 Carbon, #5 Claude Opus 5.5.
Interactive version: theaggregate.ai/benchmark?slug=gabench-graph-theory-node-level-text-paired-graphs · How It Works · Data refreshed daily, snapshot 2026-11-13.