A two-layer knowledge graph rebuilt open-problem catalogs from the literature, and its own audit showed the status verdicts fail
AspireAI community · arXiv (Mandarapu, Kunkunuru)
A field's open problems normally live in prose written every few years, so nobody can ask who is working on one now or whether it was settled last year. This system keeps a hand-curated problem layer unchanged and rebuilds an evidence layer from a bibliographic index, joining both with typed, provenance-carrying links in one graph database that a language model queries with constrained candidate sets; across catalogs of 1,053 database-research and 1,000 AI-research problems it answers every question the catalog-only graph answered - 47 of 47 and 34 of 35 - plus questions about recent workers and untouched problems. The honest part is the audit: of 41 solves-and-refutes verdicts hand-checked against the papers, 9 were correct, 30 partly correct and 2 wrong, and no refutes verdict (0 of 34) actually disproved an open problem. The design conclusion follows from that failure - a status change must be proposed with its evidence and never applied, keeping the human reviewer inside the architecture.
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.