reasoning benchmark
A graph reasoning benchmark that evaluates language models' ability to find parent nodes in graphs with context length under 128k tokens, requiring understanding of graph structure and edge relationships.
Updated Aug 11, 2026
Higher score ranks better on this benchmark.
| 01 | OP | 89.8% | 100.0% | 11 | C | |
| 02 | OP | 89.0% | 90.0% | 11 | C | |
| 03 | OP | 73.3% | 80.0% | 11 | C | |
| 04 | OP | 72.6% | 70.0% | 11 | C | |
| 05 | OP | 71.5% | 60.0% | 11 | C | |
| 06 | OP | 60.5% | 50.0% | 11 | C | |
| 07 | OP | 58.3% | 40.0% | 11 | C | |
| 08 | OP | 58.0% | 30.0% | 11 | C | |
| 09 | OP | 50.8% | 20.0% | 11 | C | |
| 10 | OP | 35.4% | 10.0% | 11 | C | |
| 11 | OP | 9.4% | 0.0% | 11 | C |
A closer view of the leading scores on this benchmark.
The leading models and scores on this benchmark.
What Graphwalks parents <128k measures and how its scores work.
A graph reasoning benchmark that evaluates language models' ability to find parent nodes in graphs with context length under 128k tokens, requiring understanding of graph structure and edge relationships.
Scores are shown in ratio. This benchmark is not independently verified and has an evidence level of B.
Benchmark scores retain their original unit. Overall score eligibility is shown separately.
Common questions about Graphwalks parents <128k.
GPT-5.4 is currently ranked first with 89.8%.
A graph reasoning benchmark that evaluates language models' ability to find parent nodes in graphs with context length under 128k tokens, requiring understanding of graph structure and edge relationships.
Yes. Higher values rank better for this benchmark.
11 model results are currently shown.
Yes. This benchmark can contribute to the current LLMBoard capability score.