Function queue 

pub fn queue(
    candidates: &[Candidate],
    costs: &AttentionCosts,
    gate: WipGate,
) -> Queue

The next-action queue (§1): the QUEUE_MAX_ROWS highest-effective-scoring next actions, in one list. The cap is uniform — every state competes for the same slots, so a low-scoring row of any kind can fall below the cut (§7) — but what competes is the attention price score / cost(action), so a cheap decision outranks an expensive review of the same raw worth.

Two rows are not priced but shaped: dispatch is metered by the WIP gate rather than a divisor, so at capacity its rows leave the queue entirely; and proposals collapse into one digest row per project, since at a divisor below one a large triage backlog would otherwise crowd out everything else.