Graph models that manipulate the frequency spectrum of user-item interactions to separate preference signals from noise often report significant improvements, but concerns about evaluation rigor and reproducibility persist. We conduct a reproducibility and replicability study that examines three major families: (i) spectral denoising methods, (ii) graph signal processing (GSP) models, and (iii) spectral propagation approaches. Reproducing published pipelines reveals a polarized landscape: while several works are fully reproducible, others rely on flawed metric implementations and incomplete hyperparameter disclosures. In particular, we observe systematic inflation of Recall in the spectral denoising methods due to an implementation error, and theoretically invalid ranking metrics in GSP models due to unordered prediction lists; conversely, the graph filtering models are consistently reproducible. Beyond reproduction, we establish a unified evaluation protocol on four datasets with consistent splits and hyperparameter optimization for all baselines, showing that strong classical methods (e.g., SLIM, Item-kNN) remain highly competitive and that no single spectral model dominates across domains. We further analyze robustness under varying data sparsity and assess beyond-accuracy properties, finding that spectral filtering often improves catalog exploration even when accuracy gains are marginal. Our code is available at https://github.com/sisinflab/Mind_the_Metric_SIGIR-26.
Domenico de Gioia, Claudio Pomo, Ludovico Boratto et al.· Annual International ACM SIG...· 0 citations
As Large Language Models (LLMs) become foundational to next-generation Intelligent Information Systems, the bridge between natural language interfaces and structured database systems remains a critical bottleneck. While Text-to-SQL generation enables cooperative support for complex query formulation, ensuring the reliability of these generated queries at inference time is a central challenge. Conventional methods rely on coarse execution-based signals, which may limit their ability to capture the nuanced semantic alignment required for high-stakes database environments. In this work, we propose the use of Outcome Reward Models (ORMs) as a fine-grained, probabilistic feedback mechanism for test-time verification in Text-to-SQL tasks. We introduce GradeSQL, a framework for training task-specific ORMs that assign scalar utility scores to candidate SQL queries based on their semantic correctness and alignment with database schema. Our approach is evaluated on the BIRD and Spider benchmarks across multiple open-source LLM families. Experimental results demonstrate that ORM-based verification consistently outperforms traditional execution-based heuristics.
M. Tritto, G. Farano, Dario Di Palma et al.· Journal of Intelligence and...· 2 citations