01 / SUPER EDGE-MAGICEvery tree up to 23 points
A tree is a branching network with no loops. The current expert packet confirms that every tree with 2 to 23 points (2 ≤ n ≤ 23) is super edge-magic. That's a special kind of numbering. The project's records say the best published result covered all trees up to 17 points. This is a computer result, checked independently. A specialist still needs to confirm the published record, and a human still needs to review it.
02 / ODD-GRACEFULEvery tree up to 24 points
The odd-graceful conjecture is a guess that every tree can be numbered in a certain way. The current package confirms it for every tree up to n = 24. The project's check of past work found the best published limit was 12. The main evidence is exact certificate files, plus independent counting and checking. A certificate is a saved numbering for one tree that a program can re-check.
03 / UNICYCLIC GRACEFULNESSTruszczyński's conjecture up to 19 points
A unicyclic graph is a network with exactly one loop. Every one with at most 19 points is confirmed graceful (another special numbering). The known exceptions are left out. Those are single rings Cn where n leaves a remainder of 1 or 2 when divided by 4 (n ≡ 1 or 2 mod 4). The project records n ≤ 9 as the earlier full-check limit it could confirm. That still needs the same expert check of past work.
04 / REPRODUCIBILITYIndependent checkers, not one solver
The certificate files can be rebuilt exactly, every time. A separately written checker, in the Rust language, checks each numbering. It confirms no two trees are the same shape, using a standard ID for each shape (a canonical key). It also checks the total against Otter's known tree counts. The unicyclic result has two separate checkers, one in Python and one in Rust.