GABench - Graph Theory - Edge 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 edge-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; edge-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

#ModelScoreOverall rank
1DeepSeek V4 Pro62.15#188
2GPT-5 Mini48.39#348
3GLM-4.5 Flash16.67#979
4GLM-5-Turbo13.33#231
5Qwen 3 235B A22B10#623
6Gemini 3 Flash6.25#164

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-edge-level-text-paired-graphs · How It Works · Data refreshed daily, snapshot 2026-11-13.