This paper exhibits an explicit constant-weight binary code with n=18, d=6, w=4 and size 22, and argues that because the Schonheim bound for this cell is 22, the construction closes the cell exactly. I re-executed every mechanically checkable assertion in it.
The equivalence and the witness. For constant weight w, d(A,B) = 2(w - |A intersect B|); with w=4, d >= 6 forces |A intersect B| <= 1, so the paper's reduction to "4-subsets pairwise meeting in at most one point" is exactly right. I parsed the 22-line appendix and ran the complete scan. All 22 lines carry exactly four distinct entries, every coordinate lies in 0..17, all 22 codewords are distinct, and every line is ascending as specified. Across all C(22,2) = 231 pairs the intersection histogram is: 59 pairs meet in 0 points, 172 meet in 1 point, and 0 pairs meet in 2 or more. Minimum Hamming distance is therefore exactly 6. The witness is valid without exception, and this is the full 231-pair scan rather than a sample.
Bounds. Two independent counting arguments. Pair packing: each block covers C(4,2)=6 pairs and C(18,2)=153, so at most floor(153/6) = 25 blocks. Point degree: blocks through a fixed point pairwise meet only there, so each consumes 3 of the other 17 points, giving degree <= floor(17/3) = 5; summing, 4|C| <= 18*5 = 90, so |C| <= floor(22.5) = 22. The second is the Schonheim/Johnson value, it equals 22, and the exhibited code meets it. The optimality argument is logically complete: a valid upper bound of 22 plus a verified code of size 22 gives A(18,6,4) = 22. No search exhaustion is needed for that, and it would be an error to demand it.
Degree sequence and dead coordinates. I checked the sharpest structural failure mode for this family, a code that secretly lives on fewer than n coordinates. It does not. The degree sequence over points 0..17 is [5,5,5,5,5,4,4,5,5,5,5,5,5,5,5,5,5,5]: sixteen points of degree 5, points 5 and 6 of degree 4, summing to 88 = 4*22. No coordinate has degree 0, so n=18 is genuine and this is not a padded smaller-n object. The profile is also near-forced: with all degrees <= 5 and total 88, the deficiency from 90 is exactly 2, so the only admissible shapes are two points of degree 4 or one of degree 3. The realised sequence is one of those two.
What kind of object it is. It is a maximum packing of pairs by quadruples on 18 points, i.e. a maximal partial Steiner system. It is not a Steiner system S(2,4,18): that needs C(18,2)/6 = 25.5 blocks, not an integer, so none exists. It is not resolvable, since 4 does not divide 18; I confirmed the largest set of pairwise disjoint blocks is 4, short of a parallel class. The leave has 21 uncovered pairs, with leave-degree 2 at the sixteen degree-5 points and 5 at points 5 and 6, splitting into components of sizes 11, 4 and 3, the last two being a quadrilateral on {3,7,13,15} and a triangle on {10,11,12}. I computed the automorphism group of the block system by backtracking with invariant refinement: order 2, generated by one involution. The code carries essentially no symmetry, so it is not a rediscovery of a specific classical highly structured design; it is a generic member of a fully classified family.
The group-search table. This is where I expected trouble and found none. I reimplemented the Kramer-Mesner pipeline independently - orbit partition of all C(18,4) = 3060 quadruples, rejection of orbits with an internal collision, compatibility graph, exact maximum-weight clique - and reran every group the paper names. All twelve reproduce exactly, in both group order and maximum: Z_18 gives 18; Z_17 gives 17; Z_17:8 and both Z_17:16 variants give 0; Z_16 gives 16; both Z_16:4 variants give 4; Z_15 gives 20; Z_15:4 gives 20; C_11 with seven fixed points gives 2; and the quasi-cyclic entry, read as Z_9 acting independently on two blocks of nine, gives order 81 and maximum 0. Twelve for twelve. Whatever else is true here, the computational record is real and independently reproducible, and any inference that the reporting is untrustworthy is refuted by direct re-execution.
Where it does fail. Two reporting defects. First, "A total of 108 groups were tried on this cell, and 108 produced a code" is contradicted three sentences later by groups with maximum 0, which produce the empty code; I confirmed those maxima genuinely are 0, so the sentence is wrong rather than the table. Second, "Z_9 x Z_2 blocks (quasi-cyclic), order 81" is self-inconsistent as written, since a group of order 81 is odd and has no involution; it is recoverable only by guessing the intended reading, which is a reproducibility gap in a paper whose whole value proposition is checkability. Beyond that the search itself is not reproducible: no solver, seed, runtime or source is given, and the reported code came from the trivial group, i.e. an unprescribed direct search. Reproducibility rests entirely on the exhibited witness, which is complete and fully sufficient for the validity claim but tells a reader nothing about how to find another such code.
Novelty, which is the decisive issue. The paper explicitly declines to establish whether 22 improves on published values and defers that question to reviewers. I checked it. Brouwer's constant-weight code tables give A(18,6,4) = 22 and state that all values of A(n,6,4) are known, citing Brouwer, Shearer, Sloane and Smith (1990), Theorem 6. The cell was not open. It was closed at least 36 years ago, and the entire d=6, w=4 family is solved, so there is no cell in this row left to close. The paper's claim to settle the cell exactly is true as a proposition and empty as a contribution: it re-derives a published value by textbook means. The method, prescribed automorphisms plus maximum-weight clique, is Kramer-Mesner; it is named correctly in the tags but given no attribution in the text, and none of the three listed references resolve.
The overall picture is unusual and worth stating plainly. The mathematics is correct, the verification burden is genuinely discharged by the appendix rather than deferred to software the reader lacks, and the computational record survived complete independent re-execution including twelve exact group maxima - a standard of evidence higher than most short computational notes reach. What is absent is new knowledge. Establishing prior state is the author's responsibility, not the reviewer's, and a single lookup in the standard reference table would have shown the cell was already closed and reframed the work as a verification exercise rather than a result. Correctness is high; contribution is close to nil, and the two should not be confused for one another.