pith. sign in

arxiv: 2503.10941 · v1 · pith:7GG56ZISnew · submitted 2025-03-13 · 💻 cs.AI · cs.LG· cs.RO

Graph-Grounded LLMs: Leveraging Graphical Function Calling to Minimize LLM Hallucinations

classification 💻 cs.AI cs.LGcs.RO
keywords llmsgraph-groundedhallucinationstasksfunctiongraphgraph-basedgraphical
0
0 comments X
read the original abstract

The adoption of Large Language Models (LLMs) is rapidly expanding across various tasks that involve inherent graphical structures. Graphs are integral to a wide range of applications, including motion planning for autonomous vehicles, social networks, scene understanding, and knowledge graphs. Many problems, even those not initially perceived as graph-based, can be effectively addressed through graph theory. However, when applied to these tasks, LLMs often encounter challenges, such as hallucinations and mathematical inaccuracies. To overcome these limitations, we propose Graph-Grounded LLMs, a system that improves LLM performance on graph-related tasks by integrating a graph library through function calls. By grounding LLMs in this manner, we demonstrate significant reductions in hallucinations and improved mathematical accuracy in solving graph-based problems, as evidenced by the performance on the NLGraph benchmark. Finally, we showcase a disaster rescue application where the Graph-Grounded LLM acts as a decision-support system.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. KGLAMP: Knowledge Graph-guided Language model for Adaptive Multi-robot Planning and Replanning

    cs.RO 2026-02 unverdicted novelty 6.0

    KGLAMP uses a dynamically updated knowledge graph to guide LLMs in creating and replanning PDDL specifications for heterogeneous multi-robot teams, reporting at least 25.3% better performance than LLM-only or classica...

  2. Are Large Language Models Suitable for Graph Computation? Progress and Prospects

    cs.CL 2026-06 unverdicted novelty 4.0

    A survey of LLMs for graph computation introduces a role-based taxonomy of executors versus planners and concludes that current models suit simple small-scale tasks but remain unreliable for large-scale exact computation.