Under the Evo-GDPO archive admission criterion, what happens if a candidate harness achieves strictly lower mean latency and monetary cost than the frontier, but has a task reward where $r_i < b_r$?

In Evo-GDPO, if a candidate harness fails to provide an admissible Pareto frontier improvement, the archive $\mathcal{B}_n$ remains unchanged.

Explain the archive admission rule for candidate harnesses in Evo-GDPO. Describe the prerequisite condition, the three qualifying improvement pathways, and the outcome when a candidate fails the criterion.

Order the procedural steps for determining whether a candidate harness is admitted to archive $\mathcal{B}_n$ in Evo-GDPO.

Match each Evo-GDPO harness archive admission concept with its correct operational definition.

Evaluate whether Candidate 1 and Candidate 2 qualify for admission into the harness archive $\mathcal{B}_n$ under the Evo-GDPO admission criterion. Provide the admission decision and justification for each candidate.