C.19.2:4.3 - Admit candidates by one use-bounded predicate
UseBoundedApparatusCandidateEligibilityPredicate@Context is a local eligibility predicate, not a U-kind, relation kind, or candidate-generation method. A candidate is eligible only when it has a credible adaptation path to the same declared use, direct result kind, claimed guarantee, scope and horizon, and non-negotiable constraints. A candidate that cannot meet one of those values stays outside the current option set rather than becoming a “weaker” member of it.
When the claimed guarantee or requirement itself is disputed, use C.11.DUA to appraise its purpose, contribution, burden and current force. Keep apparatus eligibility under the current declaration separate from that appraisal. Resume application under a revised declaration only when the change is available through the authority or agreement that governs it.
When choice is current, preserve the exact C.11 contract:
choose nownames one selected option or an honestly retained tie-set;reject current setreturns to a named candidate-generation pattern or closes with no current application;probe againretains one probe and its epistemic budget because it can still change the choice;reroutenames the actual neighboring question and its subject pattern.
These four dispositions form the complete current C.11 result set. “Configure the rich basis”, “adapt again”, and “use a lighter method” are option or plan contents, not extra choice-result values. A tie is not a hidden winner.