CaSKG introduces a calibration layer for procedural skill graphs: instead of retrieving over raw edges, it scores edge direction and reliability before task-conditioned expansion. The novelty is concentrated in the offline pipeline that fuses semantic, lexical, I/O, structural, and repair evidence, then applies direction-conditioned counterfactual probes that remove, substitute, and reorder skill pairs, producing a state-filtered weighted graph.1

Context

The constraint CaSKG removes is the dependence of retrieval on edges that are already reliable. Where full-library prompting preserves coverage at high context cost and vector retrieval treats skills as independent texts, CaSKG shifts the reliability computation to graph construction time; the downstream agent policy and task interface are unchanged, so an agent can use the new retrieval without retraining.1

Assessment

The quantitative claim is broad: across six LLM backbones and two benchmarks, CaSKG obtains the highest task score in all twelve combinations, improving GoS macro-average ScienceWorld from 72.62 to 80.50 and ALFWorld success from 80.01% to 86.79% with fewer mean environment steps. This is evidence that edge calibration helps, but the abstract provides no confidence intervals, per-task breakdowns, or probe-level ablations, so the size of the effect is not firmly established.1

Caveats

AI hypothesisThe strongest alternative explanation is that the gains come from the high-recall candidate graph or the LLM judge rather than from the counterfactual calibration itself. A change of mind would therefore require an ablation that fixes the candidate graph and removes only the counterfactual probes, plus a comparison on held-out tasks not used to tune the graph.1