Demo Data from EDBT 2026 / reviewers in the wild / expert
Abhinav Angirekula
dblp:319/6857
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0007-0295-0527ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 91% Graph data management · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › retrieval-augmented generation
graph-based retrieval-augmented generation |
0.9 | 1 | 2025 | CG-RAG: Research Question Answering by Citation Graph Retrieval-Augmented LLMs · SIGIR 2025 |
Information retrieval
question answering |
0.9 | 1 | 2025 | CG-RAG: Research Question Answering by Citation Graph Retrieval-Augmented LLMs · SIGIR 2025 |
Information retrieval
retrieval-augmented generation |
0.9 | 1 | 2025 | CG-RAG: Research Question Answering by Citation Graph Retrieval-Augmented LLMs · SIGIR 2025 |
Graph data management
citation network |
0.3 | 1 | 2025 | CG-RAG: Research Question Answering by Citation Graph Retrieval-Augmented LLMs · SIGIR 2025 |
Methods — techniques the papers use, named apart from their topics
sparse retrieval · 0.9large language model · 0.9graph encoding · 0.9dense retrieval · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CG-RAG: Research Question Answering by Citation Graph Retrieval-Augmented LLMsabstractResearch question answering requires accurate retrieval and contextual understanding of scientific literature. However, current Retrieval-Augmented Generation (RAG) methods often struggle to balance complex document relationships with precise information retrieval. In this paper, we introduce Contextualized Graph Retrieval-Augmented Generation (CG-RAG), a novel framework that integrates sparse and dense retrieval signals within graph structures to enhance retrieval efficiency and subsequently improve generation quality for research question answering. First, we propose a contextual graph representation for citation graphs, effectively capturing both explicit and implicit connections within and across documents. Next, we introduce Lexical-Semantic Graph Retrieval (LeSeGR), which seamlessly integrates sparse and dense retrieval signals with graph encoding. It bridges the gap between lexical precision and semantic understanding in citation graph retrieval, demonstrating generalizability to existing graph retrieval and hybrid retrieval methods. Finally, we present a context-aware generation strategy that utilizes the retrieved graph-structured information to generate precise and contextually enriched responses using large language models (LLMs). Extensive experiments on research question answering benchmarks across multiple domains demonstrate that our CG-RAG framework significantly outperforms RAG methods combined with various state-of-the-art retrieval approaches, delivering superior retrieval accuracy and generation quality. Yuntong Hu, Zhihan Lei, Zhongjie Dai, Allen Zhang 0005, Abhinav Angirekula, Zheng Zhang 0047, Liang Zhao 0002 |
SIGIR | 5 |
| 2024 | Non-Euclidean Spatial Graph Neural NetworkabstractSpatial networks are networks whose graph topology is constrained by their embedded spatial space. Understanding the coupled spatial-graph properties is crucial for extracting powerful representations from spatial networks. Therefore, merely combining individual spatial and network representations cannot reveal the underlying interaction mechanism of spatial networks. Besides, existing spatial network representation learning methods can only consider networks embedded in Euclidean space, and can not well exploit the rich geometric information carried by irregular and non-uniform non-Euclidean space. In order to address this issue, in this paper we propose a novel generic framework to learn the representation of spatial networks that are embedded in non-Euclidean manifold space. Specifically, a novel message-passing-based neural network is proposed to combine graph topology and spatial geometry, where spatial geometry is extracted as messages on the edges. We theoretically guarantee that the learned representations are provably invariant to important symmetries such as rotation or translation, and simultaneously maintain sufficient ability in distinguishing different geometric structures. The strength of our proposed method is demonstrated through extensive experiments on both synthetic and real-world datasets. Zheng Zhang 0047, Jingcheng Zhou, Abhinav Angirekula, Allen Zhang 0005, Liang Zhao 0002 |
SDM | 5 |