analiza aiqbench
This paper tackles local citation recommendation, retrieving references for a given sentence, and argues that graph-free retrieval can avoid the popularity and recency bias of citation-graph-based tools. The authors release the LCRC dataset (14,735 statements from astrophysics reviews, with full-text citation targets) and report gains of 8.0% in Recall@25 and 6.9% in NDCG@25 over dense retrieval baselines, without fine-tuning. For AI readers, the main value is the dataset and the comparison of retrieval methods on full-text scientific documents, though the gains are measured on a single domain and should be validated more broadly.
Local Citation Recommendation Without Graph Signals
arXiv:2610.15832v1 Announce Type: cross Abstract: Resolving correct citations can be a time-consuming task for research writers. We address local citation recommendation (LCR), where the goal is to retrieve appropriate references for a given sentence. Web tools generally depend on the existing citation graph, which may bias results toward citation count or more recent publications. LCR research using full paper texts has been limited by the lack of publicly available data. We present a new dataset, the Local Citation Recommendation Corpus (LCRC), containing 14,735 scientific statements derived from astrophysics review papers, each with one or more citation targets whose full text is accessible via API. Using this dataset we systematically compare retrieval methods and develop a citation recommendation system that avoids citation graph bias while achieving 8.0% improvement in Recall@25 and 6.9% improvement in NDCG@25 over dense retrieval baselines without model fine-tuning. To support reproducibility, we make our code and dataset publicly available.
Abstract:Resolving correct citations can be a time-consuming task for research writers. We address local citation recommendation (LCR), where the goal is to retrieve appropriate references for a given sentence. Web tools generally depend on the existing citation graph, which may bias results toward citation count or more recent publications. LCR research using full paper texts has been limited by the lack of publicly available data. We present a new dataset, the Local Citation Recommendation Corpus (LCRC), containing 14,735 scientific statements derived from astrophysics review papers, each with one or more citation targets whose full text is accessible via API. Using this dataset we systematically compare retrieval methods and develop a citation recommendation system that avoids citation graph bias while achieving 8.0% improvement in Recall@25 and 6.9% improvement in NDCG@25 over dense retrieval baselines without model fine-tuning. To support reproducibility, we make our code and dataset publicly available.
Accepted at WASP 2026, co-located with AACL-IJCNLP 2026. 16 pages, 3 figures, 2 tables. Dataset: this https URL Code: this https URL
Information Retrieval (cs.IR); Computation and Language (cs.CL); Digital Libraries (cs.DL)
H.3.3; I.2.7; H.3.7
arXiv:2610.15832 [cs.IR]
(or arXiv:2610.15832v1 [cs.IR] for this version)
https://doi.org/10.48550/arXiv.2610.15832 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 273 cuvinte
Subiecte conexe
Guiding Federated Graph Recommendation with LLM-encoded knowledge
arXiv · 16 iun. 2026

Game-Theoretic Disempowerment: Loss of Control to Agencyless AI
LessWrong · 27 sept. 2026
Integrating Factual and Normative Industrial Knowledge via Constraint-Aware Graph Attention for Process Plan Recommendation
arXiv · 28 iul. 2026
CondPSE: A Polynomial-Filtered Structural Encoder with Conditional Modulation for Graphs
arXiv · 29 iul. 2026