Signature-compatibility and matching-reduction audit

Exact statement

Exact enumeration checks 16,452 two-letter support policies through arity three against every homogeneous unused, $a^*$ , and $b^*$ target assignment, and checks all 256 subinstances of the $2\times2\times2$ three-dimensional-matching universe under the hardness reduction. Every comparison passes.

StatusSource audit and independent complete-domain replay pass

External reviewNo documented external or specialist review of these FPRD results is recorded.

Context

The audit independently tests the graph upper bound, starred realization, and three-dimensional-matching reduction on complete small domains.

Proof or evidence

Compatibility clique numbers equal realized incoming-signature maxima for every audited policy, and matching number equals clique number for every audited matching instance.

Compatibility and matching audit →

Verification notes

16,452 policies, 114,884 policy-signature incidences, and 256 matching instances; zero failures.

Limitations

The computation is finite; arbitrary arity and NP-completeness come from the proofs.

Open work

Retain as an implementation audit; use the symbolic proofs for arbitrary arity.