cs.AI · 2608.30235 Copy arXiv ID · Aug 31, 2026 Save LLM-Based Knowledge Graph Completion Combining Discrete Structural Coding with Similar Entity Information Authors: Jiaqi Wang , Dongying Lin , Yang Yang , Yinan Liu , Bin Wang , Xiaochun Yang
Organizations: School of Computer Science and Engineering, Northeastern, University, Shenyang 110819, China · University of Galway, Galway, Ireland
Abstract Knowledge graph completion requires models to use both textual descriptions and relational structure. Existing LLM-based methods either encode KG structure as discrete tokens or refine a restricted set of candidate entities, and these two directions have largely been studied separately. We propose CoSC for LLM-based KGC, which combines discrete structural coding with similar entity information. Specifically, an LLM generates an initial candidate entity ranking from discrete structural codes, after which information from entities with structures similar to that of the query entity refines the ranking. Experiments on FB15k-237 show that CoSC outperforms existing baselines on MRR and Hits@10 while remaining competitive on Hits@1.
Explore similar work Apr 23, 2026 · Qizhuo Xie, Yunhui Liu, Yu Xing +4 Knowledge Graph Completion
Jun 4, 2026 · Dongxiao He, Ruqiong Zhang, Zhizhi Yu +4 Knowledge Graph Completion Gnn-Based Detectors
Apr 23, 2026 · cs.AI J/K move · Enter open · S save
Qizhuo Xie, Yunhui Liu, Yu Xing, Qianzi Hou +3
State Key Laboratory for Novel Software Technology, Nanjing University, China
Large Language Models (LLMs) have shown immense potential in Knowledge Graph Completion (KGC), yet bridging the modality gap between continuous graph embeddings and discrete LLM tokens remains a critical challenge. While recent quantization-based approaches attempt to align these modalities, they typically treat quantization as flat numerical compression, resulting in semantically entangled codes that fail to mirror the hierarchical nature of human reasoning. In this paper, we propose GS-Quant, a novel framework that generates semantically coherent and structurally stratified discrete codes for KG entities. Unlike prior methods, GS-Quant is grounded in the insight that entity representations should follow a linguistic coarse-to-fine logic. We introduce a Granular Semantic Enhancement module that injects hierarchical knowledge into the codebook, ensuring that earlier codes capture global semantic categories while later codes refine specific attributes. Furthermore, a Generative Structural Reconstruction module imposes causal dependencies on the code sequence, transforming independent discrete units into structured semantic descriptors. By expanding the LLM vocabulary with these learned codes, we enable the model to reason over graph structures isomorphically to natural language generation. Experimental results demonstrate that GS-Quant significantly outperforms existing text-based and embedding-based baselines. Our code is publicly available at https://github.com/mikumifa/GS-Quant.