llmboard.ai
Benchmarks
CompareRankings
llmboard.ai
Benchmarks
CompareRankings
HomeBenchmarkslong contextGraphWalks

long context benchmark

GraphWalks

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

Models3
Model coverage3
MetricScore
EvidenceB

On this page

  • Ranking
  • Distribution
  • Highlights
  • About
  • FAQ

GraphWalks Ranking

Higher score ranks better on this benchmark.

3 rows
Columns

Show columns

1MIMAI-Thinking-1Microsoft90.0%100.0%3CAug 11, 2026
2XIMiMo-V2.5Xiaomi87.0%50.0%3CAug 11, 2026
3XIMiMo-V2.5-ProXiaomi62.0%0.0%3CAug 11, 2026

GraphWalks Score Distribution

A closer view of the leading scores on this benchmark.

GraphWalks

GraphWalks Highlights

The leading models and scores on this benchmark.

Rank #1MAI-Thinking-190.0%Rank #2MiMo-V2.587.0%Rank #3MiMo-V2.5-Pro62.0%

What is GraphWalks?

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.

Family
GraphWalks
Modality
text
Primary category
long context
Score direction
higher
LLMBoard eligible
Yes
Evaluation key
graphwalks|llm-stats-current

Benchmark scores retain their original unit. Overall score eligibility is shown separately.

FAQ

Common questions about GraphWalks.

Which model scores highest on GraphWalks?

MAI-Thinking-1 is currently ranked first with 90.0%.

What does GraphWalks measure?

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.

Is a higher score better?

Yes. Higher values rank better for this benchmark.

How many models are compared?

3 model results are currently shown.

Does this benchmark affect the overall score?

Yes. This benchmark can contribute to the current LLMBoard capability score.

Rankings

OverallCodingText ArenaPricing

Modalities

All ModelsImage GenerationImage EditingVideo GenerationImage-to-VideoVideo EditingText-to-SpeechSpeech-to-TextEmbeddings

Benchmarks

All BenchmarksReasoningMathCoding

Vendors

All VendorsOpenAIAnthropicGoogle
llmboard.aiCopyright 2026 llmboard.ai