Backtesting LLMs on resolved events assumes models reason only from pre-cutoff knowledge, yet pretrained models inevitably leak post-cutoff knowledge. We introduce a claim-level evaluation framework that decomposes prediction rationales into atomic claims and applies Shapley values to quantify each claim’s decision impact, yielding (-weighted ecision-ritical eakage ate) – an interpretable metric measuring what fraction of decision-driving reasoning is contaminated. We further propose (-upervised rediction with xtracted laims), an inference-time architecture that interleaves temporally-filtered retrieval with claim-level supervision, producing predictions grounded entirely in pre-cutoff evidence. Across three LLMs, the ablation experiments confirm retrieval and supervision are jointly necessary; and a three-task probe further illstrates that the performance cost of temporal enforcement scales with each task’s reliance on post-cutoff information.

生成讲解博客的中文版本

生成AI智能校验的中文版本