Get started

Experimental results

An introduction to GABench and its test questions, followed by graph data agent success rates across four task families and construction query cost reductions relative to PK/FK rules.

#Paper and question source: GABench

The four graph-analysis experiments use questions from our work, GABench. Its 10,400 tasks assess agents’ ability to plan, use graph tools, and answer from their results.

#Overview of test questions

Task familyWhat the questions ask
Graph retrievalRetrieve node attributes, edges, and graph statistics.
Graph theoryCompute centrality, shortest paths, and global structural properties.
Graph machine learningPerform node classification, link prediction, and graph classification.
Open-ended graph question answeringUse graph evidence to develop insights, predictions, and explanations.
  • NAG: Numerical-Attribute Graph, with numerical node attributes.
  • TAG: Text-Attributed Graph, with textual node attributes.
  • TPG: Text-Paired Graph, paired with a graph-level text description.

#Experimental setup and reading the results

The four graph-analysis experiments use GLM-5-turbo as the base model; rows identify the agent harness. A model-only row in the source results denotes OpenClaw. These four tables report only SR (task success rate), as a percentage with two decimal places; higher is better.

Each SR column is ranked independently: the highest score is bold, the second-highest score is underlined, and ties share the same marking. Retrieval and theory compare OpenClaw and iGraph; machine learning and open-ended question answering compare Hermes, Claude Code, OpenClaw, and iGraph.

#Graph retrieval

Retrieval SR is reported at the node, edge, and graph levels.

Base modelGLM-5-turbo
SR (%)
Select graph type · Graph retrieval
Graph retrieval · SR (%) ↑
Agent harnessNAGNumerical-Attribute GraphTAGText-Attributed GraphTPGText-Paired Graph
NodeEdgeGraphNodeEdgeGraphNodeEdgeGraph
OpenClaw8.336.256.6772.9118.1827.2760.0011.1142.86
iGraph31.0094.7418.67100.00100.0082.50100.00100.00100.00
BestSecond bestHigher is better

#Graph theory

Graph-theory SR is reported at the node, edge, and graph levels.

Base modelGLM-5-turbo
SR (%)
Select graph type · Graph theory
Graph theory · SR (%) ↑
Agent harnessNAGNumerical-Attribute GraphTAGText-Attributed GraphTPGText-Paired Graph
NodeEdgeGraphNodeEdgeGraphNodeEdgeGraph
OpenClaw24.0026.817.4061.029.5221.6628.0013.3310.49
iGraph37.5338.1445.0094.4488.2488.89100.00100.00100.00
BestSecond bestHigher is better

#Graph machine learning

NC denotes node classification, LP link prediction, and GC graph classification. Scores measure the agent’s success rate (SR) on the corresponding tasks.

Base modelGLM-5-turbo
SR (%)
Select graph type · Graph machine learning
Graph machine learning · SR (%) ↑
Agent harnessNAGNumerical-Attribute GraphTAGText-Attributed GraphTPGText-Paired Graph
NCLPNCLPGC
Hermes61.5490.9054.3587.187.14
Claude Code95.2378.5786.7989.5388.89
OpenClaw26.6665.1819.3636.7726.74
iGraph90.00100.0095.00100.0085.00
BestSecond bestHigher is better

#Open-ended graph question answering

Insight and Prediction identify the two open-ended task categories. Both are compared using SR.

Base modelGLM-5-turbo
SR (%)
Select graph type · Open-ended graph question answering
Open-ended graph question answering · SR (%) ↑
Agent harnessNAGNumerical-Attribute GraphTAGText-Attributed GraphTPGText-Paired Graph
InsightPredictionInsightPredictionInsightPrediction
Hermes0.008.221.2815.1216.288.11
Claude Code7.633.7018.5920.0029.6320.69
OpenClaw7.653.2213.5610.4714.2912.50
iGraph25.008.6055.0042.5035.0021.00
BestSecond bestHigher is better

#Graph construction agent

The baseline graph is built using primary-key and foreign-key (PK/FK) rules. Results compare query cost after the construction agent optimizes the graph schema. Optimization queries guide the search and evaluation of candidate graph schemas; held-out queries assess improvements on a separate query set.

BaselinePK/FK
Cost reduction (%) ↑
Construction agent versus PK/FK rule-based construction
DatasetOptimization queriesHeld-out queries
Amazon27.33%53.20%
AVS14.80%20.71%
MAG11.79%19.91%
StackExchange8.40%6.74%
Best supplied result per datasetLarger reduction is better

For each dataset, select the supplied result with lower costs on both optimization and held-out queries: the first result set for Amazon and AVS, and the second for MAG and StackExchange. Both reductions in a row come from the same result set and retain the reported values. This is a per-dataset best-result summary.

Percentages indicate cost reduction relative to PK/FK rule-based construction; larger reductions are better. Rows represent different datasets and are not ranked against one another.

iGraphDocumentation