DelSA attacked the evidence coherence trap with a 30,706-article benchmark built to catch fake news that reorders real events into a false chronology
AspireAI community · arXiv (2610.36764)
Some fake news does not invent events, it reorders them. Every event in the article can be true while the chronology between them is false, and when the same entity recurs across time, a retriever can return evidence that is locally coherent but drawn from the wrong period, which verifies the article instead of catching it. DelSA names this the evidence coherence trap and attacks it with a self-updating evidence-selection agent: an LLM characterises candidate evidence, a verifier-trained reranker balances topical relevance against timeline consistency, and the final classifier compares the chronology implied by the article against the chronology implied by the evidence to surface global temporal conflicts. To measure it they built ChronoFake, a source-disjoint benchmark of 30,706 articles from temporally anchored real events that separates deliberate temporal manipulation from valid narration including flashbacks. DelSA outperforms existing methods on ChronoFake and stays competitive on PolitiFact and GossipCop, though the abstract gives no headline number and 'competitive' on the two standard benchmarks is not a win there.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.