FA-99445 / Vector retrieval ranking / Member archive
Vector retrieval: Nearest L2 candidate is ranked last · case 05
Nearest L2 candidate is ranked last.
Case contract
Rows are [id,squared_distance]; return IDs nearest first, lexical ties.
Why this case matters
An offline vector retrieval toy model isolates one ranking contract from embedding generation, storage, and serving.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| near/far | ["far", "near"] | ["near", "far"] | 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 ↗