GraphWalks: Results as Published

GraphWalks gives a model a directed graph as a long edge list and asks one graph question in a single answer, with no tools. The two task types are a breadth-first search from a start node to a given depth, which returns only the nodes at exactly that depth, and a parents query, which returns the nodes with an edge pointing into a given node. The public dataset has 1,150 examples, split into inputs of 128k and shorter and inputs from 256k to 1M. Each answer ends with a 'Final Answer:' line of node IDs and is scored by recall, precision and F1 against the true set.

Every number here is read from the same catalog file as the benchmark table, data version 2026103001, and is the number the table shows for that model and test. Where one page printed a model under several setups, each value is listed. The catalog is public in armanobosyan/sugra-llm-benchmarks; a wrong number can be reported from the table, with Report an error under the value, or as an issue in that repository.