Vision models show a phase transition where accuracy on a zero syntactic-distance global-semantics task collapses to chance beyond a critical scale and does not recover with larger models or data.
arXiv preprint arXiv:2601.19393 , year=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Claims a finite analogue of Gödel incompleteness in K-SAT by building locally indistinguishable SAT/UNSAT pairs in log-width ensemble, implying sublinear deductive systems require wide clauses and exponential proof sizes, reframing SETH as Gödel projection.
Solution independence distinguishes hypergraph dominating set from vertex cover, enabling irreducible self-referential instances that force algorithms to examine nearly the full input.
citing papers explorer
-
Self-Referential $K$-SAT and the Finite Analogue of G\"odel's Incompleteness Theorem
Claims a finite analogue of Gödel incompleteness in K-SAT by building locally indistinguishable SAT/UNSAT pairs in log-width ensemble, implying sublinear deductive systems require wide clauses and exponential proof sizes, reframing SETH as Gödel projection.
-
Solution independence and self-referential instances
Solution independence distinguishes hypergraph dominating set from vertex cover, enabling irreducible self-referential instances that force algorithms to examine nearly the full input.