FA-100088 / Preference pair construction / Member archive
Preference pairs: only adjacent candidates are paired · case 03
only adjacent candidates are paired.
Case contract
Candidates are [id,score]. Return every unordered pair [higher_id,lower_id] once; tied scores are skipped. Order follows input index pairs.
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 |
|---|---|---|---|
| nonadjacent pair | [["a3", "b3"]] | [["a3", "b3"], ["a3", "c3"], ["c3", "b3"]] | 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 ↗