long context benchmark
A graph reasoning benchmark that evaluates language models' ability to find parent nodes in graphs with context length over 128k tokens, testing long-context reasoning and graph structure understanding.
Updated Aug 17, 2026
Higher score ranks better on this benchmark.
Rank | Model | Score | Percentile | Participants | Evidence | Evaluated |
|---|
| Rank01 | ModelAN | Score95.4% | Percentile100.0% | Participants7 | EvidenceC | Evaluated |
| Rank02 | ModelAN | Score83.3% | Percentile83.3% | Participants7 | EvidenceC | Evaluated |
| Rank03 | ModelOP | Score58.5% | Percentile66.7% | Participants7 | EvidenceC | Evaluated |
| Rank04 | ModelOP | Score32.4% | Percentile50.0% | Participants7 | EvidenceC | Evaluated |
| Rank05 | ModelOP | Score25.0% | Percentile33.3% | Participants7 | EvidenceC | Evaluated |
| Rank06 | ModelOP | Score11.0% | Percentile16.7% | Participants7 | EvidenceC | Evaluated |
| Rank07 | ModelOP | Score5.6% | Percentile0.0% | Participants7 | EvidenceC | Evaluated |
The leading models and scores on this benchmark.
A closer view of the leading scores on this benchmark.
The first five results on this benchmark, with official price and output speed added where the model identity can be matched.
Ranking basisThis graphwalks parents >128k AI model leaderboard uses descending score in the benchmark's original unit. The leaderboard ranking keeps matched price and speed data separate from benchmark evidence.
Selection summary
Claude Opus 4.6 currently leads Graphwalks parents >128k with 95.4%. It is the top model on this specific benchmark, while the best LLM for the broader task should also be checked against other benchmarks, price and runtime.
Use this leaderboard with the supporting benchmark results and coverage details above. A leaderboard position summarizes the selected ranking signal; it does not replace workload-specific testing.
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 over 128k tokens, testing long-context reasoning and graph structure understanding.
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.
Claude Opus 4.6 is currently ranked first with 95.4%.
A graph reasoning benchmark that evaluates language models' ability to find parent nodes in graphs with context length over 128k tokens, testing long-context reasoning and graph structure understanding.
Yes. Higher values rank better for this benchmark.
7 model results are currently shown.
Yes. This benchmark can contribute to the current LLMBoard capability score.