aiqbench analysis
Composing insight from the full article — this may take a moment.
VeriCypher: Named-Entity Verification for GraphRAG via Text-to-Cypher Generation
arXiv:2511.08274v2 Announce Type: replace Abstract: Knowledge graph question answering has traditionally focused on Resource Description Framework (RDF) graphs, SPARQL queries, and triple-based representations. Labeled Property Graphs (LPGs), however, pose a different challenge for LLM-based query generation: executable Cypher queries must align with schema structure, traversal direction, property keys, and literal entity values. This motivated us to introduce VeriCypher, an LLM-based text-to-Cypher framework for question answering over LPGs. It combines query generation conditioned on Cypher-like graph schema summaries with runtime execution, LLM-based query evaluation, and iterative correction where the central mechanism is named-entity verification: the system extracts node labels, relationship patterns, property keys, and literal values from generated queries, checks them against the target graph and schema, and turns mismatches into correction instructions for the next generation step. We evaluate VeriCypher on the CypherBench benchmark across multiple domains and LLM backbones. Compared with an LLM baseline, this method consistently improves answer correctness and query robustness. Ablation results further show that named-entity verification helps correct hallucinated schema elements and entity values, supporting more reliable LLM-based question answering over heterogeneous property graphs.
Read the full article at arXiv