long context benchmark
GraphWalks is a synthetic multi-hop long-context reasoning benchmark in which a model is given an edge-list representation of a graph and must traverse it to find neighboring nodes (via breadth-first search) or parent nodes for a given start node. Performance is reported as F1 of the model-predicted answer set versus the ground truth.
Updated Aug 11, 2026
Higher score ranks better on this benchmark.
| 01 | MI | 90.0% | 100.0% | 3 | C | |
| 02 | XI | 87.0% | 50.0% | 3 | C | |
| 03 | XI | 62.0% | 0.0% | 3 | C |
A closer view of the leading scores on this benchmark.
The leading models and scores on this benchmark.
What GraphWalks measures and how its scores work.
GraphWalks is a synthetic multi-hop long-context reasoning benchmark in which a model is given an edge-list representation of a graph and must traverse it to find neighboring nodes (via breadth-first search) or parent nodes for a given start node. Performance is reported as F1 of the model-predicted answer set versus the ground truth.
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.
MAI-Thinking-1 is currently ranked first with 90.0%.
GraphWalks is a synthetic multi-hop long-context reasoning benchmark in which a model is given an edge-list representation of a graph and must traverse it to find neighboring nodes (via breadth-first search) or parent nodes for a given start node. Performance is reported as F1 of the model-predicted answer set versus the ground truth.
Yes. Higher values rank better for this benchmark.
3 model results are currently shown.
Yes. This benchmark can contribute to the current LLMBoard capability score.