Decides record pairs without false merges
Each pair matched, sent to review or kept apart so that no two different people are merged
Can AI do this?
Not settled yet The benchmark tested this, but the models' answers do not settle yet whether they master it. 0 of 4 models in the current benchmark master it.
| Model | Tier | Probability of mastery | Status |
|---|---|---|---|
| gemini-4-argon | Flagship | 82% | Not shown |
| gemini-3.5-flash-lite | Low cost | 59% | Not shown |
| gpt-6-luna | Low cost | 82% | Not shown |
| claude-haiku-5-5 | Low cost | 83% | Not shown |
Mastered means a probability of at least 90% that the model has this knobit, estimated from its graded answers. “Not shown” means the answers do not settle it either way. How the models are tested.
What it looks like in practice
Expected result: Each pair matched, sent to review or kept apart so that no two different people are merged
How it is assessed: Zero false merges on the decided pairs; true matches proven by identifiers are kept
Related knobits
Builds on
All 16 knobits of Define the matching rules.
Source: Graded on its own by rmd-matching