FA-100633 / Mixture of experts dispatch / Member archive
Tokens with too few available routes are partially dispatched · case 03
Tokens with too few available routes are partially dispatched.
Case contract
For each token’s ranked routes, select up to k experts; emit the token with its selected list only if at least minimum routes survive.
Why this case matters
A deterministic toy router makes this dispatch decision independently inspectable.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| minimum two | [[0, [["e3", 3], ["f3", 2]]], [1, [["e3", 1]]], [2, []]] | [[0, [["e3", 3], ["f3", 2]]]] | 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 ↗