Can you trust this paper?

· a first-pass review, with every answer labelled by what backs it

An AI wrote this maths paper, and a computer checked a formal version of its main theorem. Before trusting it, a reviewer still has to answer these questions by hand. Our agent answered them in seconds.

Still yours to judge: is the result new, and does it matter. The agent gives no verdict on the paper.

Review the paper with the copilot → one step at a time, with pictures, a chat, and code the agent runs for you

The evidence behind each answer (click to open):

Formal status

Statement versus claim human check needed

Paper, main theorem
Lean statement,

A proof checker confirms the right-hand side. Whether it says the same thing as the left-hand side is for a reader to judge.

Worked example

Recomputed here in exact rational arithmetic: distinct denominators, each at least 2, summing to the target.

Small cases recomputed: exhaustive search

cups neededfirst b that needs themhardest fraction therelog log b

This is the quantity the theorem bounds, computed exactly for small b. It illustrates the claim and does not test it: the theorem only speaks about b beyond an unstated threshold.

Proof map parsed from source

What does actually depend on?

Edges come from the paper's own cross-references. A result used without being cited by label would not appear.