FA-98448 / Beam search bookkeeping / Member archive
Beam search: backtrace follows pre-prune beam slots · case 03
backtrace follows pre-prune beam slots.
Case contract
At each layer, parent_ids names prior hypotheses and selected contains indices into that array; return token paths by following indices from final nodes.
Why this case matters
Beam decoders rely on consistent hypothesis state while expanding and ranking candidates.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| crossed ancestry | [["a", "d"]] | [["b", "c"]] | 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 ↗