PACE Solver Description: Minimum Hitting Set Computation Via Core-Guided MaxSAT Solving.

This paper describes our hybrid MaxSAT and mixed integer programming approach for finding minimum hitting sets as submitted to the 2025 PACE challenge. We also discuss hitting set specific challenges, lower bounds, preprocessing and design choices. 2012 ACM Subject Classification Theory of computation -> Discrete optimization; Theory of computation -> Constraint and logic programming; Theory of computation -> Automated reasoning