What happened
During the independent test of The Power of Two-Choice Linear Probing, one builder raised a suspected bug. Its argument depended on transferring a lookup stopping condition from one algorithm to another. The algorithms are related, so the mistake was plausible on a quick read. It would also have been serious if true: a lookup that stops too early can report that a present key is absent.
A reviewer returned to the paper's rule rather than accepting the agent's summary. The paper's general lookup description, its footnote, and the Section 7 analysis showed that the suspected stopping condition did not apply. The specific Case 1 branch and the term in Lemma 7.4 were consistent with continuing the search. The team then checked a literal implementation against inserted keys at high load. That check found the keys it should find. The original bug allegation was withdrawn before publication.
Current status: we do not claim a Section 7 correctness bug. The case report labels the allegation as withdrawn. A possible editorial typo at line 2054 is noted separately: “formerly occupied by z” appears to refer to y. That observation is about wording, not the algorithm's correctness, and we have not presented it as an author-confirmed correction.
Why keep a pre-publication withdrawal?
The public report could have silently omitted the bad claim. Keeping the entry shows how a reviewer changed the result. It also makes a useful boundary clear: multiple AI agents can repeat the same misunderstanding if they rely on each other's summaries. The review must return to the original source and a minimal executable check. This entry documents a successful catch in our process, not evidence that every future error will be caught.
The original paper is by Amir Azarmehr, Michael A. Bender, William Kuszmaul, and Rose Silver. All theoretical claims and algorithmic ideas are theirs. Our implementation, mistaken allegation and withdrawal are ours. Their paper was not the source of this false claim.