The work describes a two-level system for mathematical research assisted by AI: an “evidentiary” layer that tracks what evidence supports each claim, and an “inferential” layer that treats proof obligations as a graph with rules for when premises are combined. The framework aims to prevent untrusted AI output from being treated as fully justified simply because it sounds convincing or already exists in some formal form.

Instead of assuming closure in prose, the architecture derives closure from the graph structure. It also distinguishes a positive candidate (plausible and worth further work) from an earned result (checked in a way that licenses use), while requiring reference grounding and a precise link between the checked object and the stated claim.