Seed-Anchored Budget-Bounded Graph Rendering for Question Answering on Industry-Standard Power-Grid Information and Exchange Models
Not on the map. Why?
Abstract (arXiv)
Large language model question answering over power-grid models must respect a fixed context budget. We introduce seed-anchored graph rendering, a deterministic method that prioritizes query-local graph evidence without adding method-specific tuned or learned parameters beyond the shared hop bound and context budget. The method provides a checkable condition under which predefined seed-local answer-bearing render units are preserved in a greedy bounded-context prefix. We evaluate the approach on Common Information Model (CIM) network models exchanged through the Common Grid Model Exchange Standard (CGMES). On two budget-binding CGMES encodings, naive descriptions-first rendering retains local evidence for every single-hop item but only 0.12 and 0.00 of multi-hop items, whereas seed-anchored rendering retains all such evidence. On a preregistered fresh 100-item bank from the SmallGrid topology family, accuracy rises from 0.450 to 0.970 under a fixed 8,000-character context budget. Under a common retrieval and rendering pipeline, the standards-native seed-anchored graph matches or exceeds extracted graph representations produced by LightRAG, Microsoft GraphRAG, and HippoRAG, while avoiding LLM graph-construction tokens. The results are specific to the evaluated CIM/CGMES models, reader, and context budget; they concern budget-bounded retrieval rather than general question answering.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 39 references that are in the map. First posted on arXiv 2 Sep 2026.
Builds on
19 of 39 references.
References · 19
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,383
- 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
- 2024From Local to Global: A Graph RAG Approach to Query-Focused Summarizationcited by 1,411
- 2024LightRAG: Simple and Fast Retrieval-Augmented Generationcited by 310
- 2024HippoRAG: Neurobiologically Inspired Long-Term Memory for Large Language Modelscited by 273
- 2025From RAG to Memory: Non-Parametric Continual Learning for Large Language Modelscited by 223
- 2017pandapower - an Open Source Python Tool for Convenient Modeling, Analysis and Optimization of Electric Power Systemscited by 79
- 2023Text2KGBench: A Benchmark for Ontology-Driven Knowledge Graph Generation from Textcited by 48
- 2025When to use Graphs in RAG: A Comprehensive Analysis for Graph Retrieval-Augmented Generationcited by 46
- 2024ElecBench: a Power Dispatch Evaluation Benchmark for Large Language Modelscited by 12
- 2025AdaGReS:Adaptive Greedy Context Selection via Redundancy-Aware Scoring for Token-Budgeted RAGcited by 6
7 more
- 2021An Intelligent Question Answering System based on Power Knowledge Graphcited by 4
- 2026Reliable Graph-RAG for Codebases: AST-Derived Graphs vs LLM-Extracted Knowledge Graphscited by 4
- 2025Benchmarking Vector, Graph and Hybrid Retrieval Augmented Generation (RAG) Pipelines for Open Radio Access Networks (ORAN)cited by 2
- 2025GridCodex: A RAG-Driven AI Framework for Power Grid Code Reasoning and Compliancecited by 1
- 2025Comparing RAG and GraphRAG for Page-Level Retrieval Question Answering on a Math Textbookcited by 1
- 2026ContextRAG: Extraction-Free Hierarchical Graph Construction for Retrieval-Augmented Generationcited by 1
- 2026GraphSteal: Structural Knowledge Stealing from Graph RAG via Traversal Reconstructioncited by 1
Built on by
Not cited yet.