Skip to content
Open access

Citation Intent Classification via Exponential Borda Fusion and SciBERT

Jul 2026 · Algorithms · Vol 19, pp. 612 · 0 citations · 38 references

TL;DR

This study presents a clear and reliable framework for classifying the intent behind scientific citations that combines multi-model reasoning with concepts from social choice theory, and enhances interpretability.

Abstract

This study presents a clear and reliable framework for classifying the intent behind scientific citations. It combines multi-model reasoning with concepts from social choice theory. Instead of using a single model, this framework employs three open Large Language Models Gemma, LLaMA, and Mistral. Additionally, we combine their ranked outputs using an exponentially weighted Borda method. By doing so, this approach increases agreement among high-confidence predictions, maintains ranking information, and produces stable, high-quality supervision signals. Consequently, it boosts reliability while remaining transparent. To create a strong experimental basis, we built a large, balanced dataset from the UnarXive corpus, which contains structured full-text scientific articles and citation networks. First, we automatically pulled citation contexts and organized them within a DuckDB-based analytical setup. Then, we rebalanced the dataset across rhetorical categories to enhance representativeness and minimize bias. Finally, we categorized each citation context into one of five roles: background, methodology, comparison, extension, or critique. As a result, the resulting dataset provides a robust foundation for training and evaluation. We trained a SciBERT classifier using these ensemble-generated annotations and tested it on a five-category citation intent classification task. The model achieved a macro F1-score of 0.83, an outstanding result for this type of classification. Indeed, this level of performance shows strong reliability given how challenging it is to differentiate closely related citation functions. Moreover, it demonstrates that combining multiple models produces valuable and distinct supervision signals, capturing subtle rhetorical and semantic patterns that single models often overlook. Furthermore, the framework enhances interpretability. Specifically, the explicit weighting system clarifies how each model contributes to the final outcome. In addition, the deterministic tie-breaking method ensures the outputs are consistent and reproducible. Taken together, these design choices maintain explainability without sacrificing effectiveness.

Read PDF

Similar papers

Open access 2026

SciCiteVal: A Multi-Domain Dataset for Scientific Citation Verification

Citations are an integral and important part of scientific papers. However, there exist erroneous citations ranging from careless mistakes to deliberate misconduct, and there are currently few studies or benchmark datasets dedicated to automated citation verification. To bridge this gap, we introduce SciCiteVal , a nov...

Qin-Yue Liu, Yong-Xing Zhou, Cyril Labbé · 1 citation
#large language models Open access Sep 2026

SciRep: A Ranking-Aware Representation Model for Scientific Text

Results demonstrate that the proposed ranking-aware distillation mechanism significantly enhances scientific text representation quality while maintaining efficient inference, offering a more effective contrastive learning method for domain-specific retrieval tasks.

Bing-Hao Fu, Jun Wang · 0 citations
Open access Sep 2026

A Ranking Framework of Scientific Publications Using Temporal and Lexical Relevance and Citation Behavior

The results show that combining temporal, lexical relevance, and self-citation signals produces publication rankings that consistently differ from traditional citation- and recency-based methods while providing interpretable approach for examining multiple aspects of scientific publications.

A. Khatoon, Tehmina Amjad · 0 citations

Towards Automatic Evolution Tree Generation from Citation Graphs

EvoTree is proposed, a staged framework that decouples conceptual backbone learning from temporal refinement and is the only method with non-trivial marginal-paper detection on the annotated set, and is the only method with non-trivial marginal-paper detection on the annotated set.

Ze-Xing Zhao, Yun-Tong Hu, Liang Zhao · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.