Function group_verified_semantic_pairs 

pub fn group_verified_semantic_pairs(
    units: &[SemanticGroupingUnit],
    verified: &[VerifiedSemanticPair],
    config: &GroupingConfig,
) -> SemanticGrouping

Group verified registered-rule pairs without treating pair compatibility as transitive.

Rules are grouped independently, so a unit cannot connect two different semantic claims merely because it participates in both. Within a rule, a verified pair is a binary relation with similarity 1.0; any pair the verifier did not accept is absent and therefore reads as incompatible to complete-linkage refinement. This turns a partially connected match graph into cohesive groups while retaining every accepted relation no group can express as an UngroupedSemanticPair.

Invalid and duplicate inputs are ignored with explicit accounting. The normal verifier cannot create either, but this keeps persisted or adapter supplied pair data fail-closed.