Open-source LLMs can format graph repairs well and delete the violating edge, but exact-matching the intended repair is rare (up to 38%), and the validity metric used is trivially satisfied by deleting any edge.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Graph Repairs with Large Language Models: An Empirical Study
Open-source LLMs can format graph repairs well and delete the violating edge, but exact-matching the intended repair is rare (up to 38%), and the validity metric used is trivially satisfied by deleting any edge.