Can Transformers Learn to Verify During Backtracking Search?

ArXi:2605.22221v1 Announce Type: cross Backtracking search underlies classical constraint solvers, planners, and theorem provers. Recent transformer-based reasoning systems explore search trees over their own intermediate steps. A common