Anonymous, unrefereed, certificate-backed candidate presenting one explicit connected cubic graph on 48 vertices with minimum maximal matching number 15 and independent domination number 16. This lowers the known candidate-order upper bound to 48; it does not establish global minimality, uniqueness, priority, independent reproduction, formal verification, specialist review, peer review, or impact.