UnWeaving the knots of GraphRAG -- turns out VectorRAG is almost enough
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915918619082752 |
|---|---|
| author | Tuora, Ryszard Galiński, Mateusz Godziszewski, Michał Karpowicz, Michał Czyżnikiewicz, Mateusz Kozakiewicz, Adam Ziętkiewicz, Tomasz |
| author_facet | Tuora, Ryszard Galiński, Mateusz Godziszewski, Michał Karpowicz, Michał Czyżnikiewicz, Mateusz Kozakiewicz, Adam Ziętkiewicz, Tomasz |
| contents | One of the key problems in Retrieval-augmented generation (RAG) systems is that chunk-based retrieval pipelines represent the source chunks as atomic objects, mixing the information contained within such a chunk into a single vector. These vector representations are then fundamentally treated as isolated, independent and self-sufficient, with no attempt to represent possible relations between them. Such an approach has no dedicated mechanisms for handling multi-hop questions. Graph-based RAG systems aimed to ameliorate this problem by modeling information as knowledge-graphs, with entities represented by nodes being connected by robust relations, and forming hierarchical communities. This approach however suffers from its own issues with some of them being: orders of magnitude increased componential complexity in order to create graph-based indices, and reliance on heuristics for performing retrieval. We propose UnWeaver, a novel RAG framework simplifying the idea of GraphRAG. UnWeaver disentangles the contents of the documents into entities which can occur across multiple chunks using an LLM. In the retrieval process entities are used as an intermediate way of recovering original text chunks hence preserving fidelity to the source material. We argue that entity-based decomposition yields a more distilled representation of original information, and additionally serves to reduce noise in the indexing, and generation process. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_29875 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | UnWeaving the knots of GraphRAG -- turns out VectorRAG is almost enough Tuora, Ryszard Galiński, Mateusz Godziszewski, Michał Karpowicz, Michał Czyżnikiewicz, Mateusz Kozakiewicz, Adam Ziętkiewicz, Tomasz Information Retrieval Artificial Intelligence Computation and Language I.2.4; H.3.3; I.2.7 One of the key problems in Retrieval-augmented generation (RAG) systems is that chunk-based retrieval pipelines represent the source chunks as atomic objects, mixing the information contained within such a chunk into a single vector. These vector representations are then fundamentally treated as isolated, independent and self-sufficient, with no attempt to represent possible relations between them. Such an approach has no dedicated mechanisms for handling multi-hop questions. Graph-based RAG systems aimed to ameliorate this problem by modeling information as knowledge-graphs, with entities represented by nodes being connected by robust relations, and forming hierarchical communities. This approach however suffers from its own issues with some of them being: orders of magnitude increased componential complexity in order to create graph-based indices, and reliance on heuristics for performing retrieval. We propose UnWeaver, a novel RAG framework simplifying the idea of GraphRAG. UnWeaver disentangles the contents of the documents into entities which can occur across multiple chunks using an LLM. In the retrieval process entities are used as an intermediate way of recovering original text chunks hence preserving fidelity to the source material. We argue that entity-based decomposition yields a more distilled representation of original information, and additionally serves to reduce noise in the indexing, and generation process. |
| title | UnWeaving the knots of GraphRAG -- turns out VectorRAG is almost enough |
| topic | Information Retrieval Artificial Intelligence Computation and Language I.2.4; H.3.3; I.2.7 |
| url | https://arxiv.org/abs/2603.29875 |