FA-100054 / Preference pair construction / Member archive

Preference pairs: ineligible responses become pair endpoints · case 04

ineligible responses become pair endpoints.

Member previewVariant 4 · 3 implementations · 6 checks per implementation

Case contract

Candidates are [id,score,eligible]. Select the highest and lowest scored eligible candidates; return [best_id,worst_id], or None with fewer than two eligible candidates.

Why this case matters

A small deterministic preference-data transform makes pair semantics inspectable without a training framework.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
excluded maximum	`["x4", "b4"]`	`["a4", "b4"]`	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.