FA-100100 / Preference pair construction / Member archive
Preference pairs: pair cap is applied before duplicate removal · case 05
pair cap is applied before duplicate removal.
Case contract
Rows are [pair_key,chosen,rejected]. Keep the first row per pair_key, then return the first limit rows; limit is nonnegative.
Why this case matters
A small deterministic preference-data transform makes pair semantics inspectable without a training framework.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| dedup before cap | [["a5", "x", "y"], ["a5", "x", "z"]] | [["a5", "x", "y"], ["b5", "u", "v"]] | Failed |
MEMBER ARCHIVE
The complete case is available to members.
This record includes three runnable implementations, regression fixtures, execution results, and source hashes.
Member access is invitation-based. Sign in with your invited account to inspect the sources.
Sign in to the archive ↗