GRainsaCK: a Comprehensive Software Library for Benchmarking Explanations of Link Prediction Tasks on Knowledge Graphs

Roberto Barile, Claudia d'Amato, Nicola Fanizzi
8/12/2025
cs.AI

No official code found. Best implementation: rbarile17/grainsack (4 stars, MIT, last commit 2026-02-22).

Abstract

Since Knowledge Graphs are often incomplete, link prediction methods are adopted for predicting missing facts. Scalable embedding based solutions are mostly adopted for this purpose, however, they lack comprehensibility, which may be crucial in several domains. Explanation methods tackle this issue by identifying supporting knowledge explaining the predicted facts. Regretfully, evaluating/comparing quantitatively the resulting explanations is challenging as there is no standard evaluation protocol and overall benchmarking resource. We fill this important gap by proposing GRainsaCK, a reusable software resource that fully streamlines all the tasks involved in benchmarking explanations, i.e., from model training to evaluation of explanations along the same evaluation protocol. Moreover, GRainsaCK furthers modularity/extensibility by implementing the main components as functions that can be easily replaced. Finally, fostering its reuse, we provide extensive documentation including a tutorial.

View on arXivView PDF

Code Implementations(1)

MIT

A Comprehensive Software Library for Benchmarking Explanations of Link Prediction Tasks on Knowledge Graphs

40Shell, PythonFeb 27, 20258 months agoMIT

Similar Papers

Cite this paper

@article{barile2025grainsack,
  title  = {GRainsaCK: a Comprehensive Software Library for Benchmarking Explanations of Link Prediction Tasks on Knowledge Graphs},
  author = {Roberto Barile and Claudia d'Amato and Nicola Fanizzi},
  year   = {2025},
  eprint = {2508.08815},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.08815v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.08815.svg)](https://codeofpaper.com/paper/2508.08815)

Discussion