{"total":13,"rows":[{"id":"2401.16439","title":"Distribution-Specific Auditing For Subgroup Fairness","created":"2024-01-27","cited_by_count":4,"area":null},{"id":"2404.17316","title":"Certified MaxSAT Preprocessing","created":"2024-04-26","cited_by_count":3,"area":null},{"id":"2501.17493","title":"Certifying Pareto-Optimality in Multi-Objective Maximum Satisfiability","created":"2025-01-29","cited_by_count":2,"area":null},{"id":"2407.04419","title":"The Complexity of Symmetry Breaking Beyond Lex-Leader","created":"2024-07-05","cited_by_count":1,"area":null},{"id":"2508.07015","title":"Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach","created":"2025-08-09","cited_by_count":1,"area":null},{"id":"2504.18443","title":"Pseudo-Boolean Proof Logging for Optimal Classical Planning","created":"2025-04-25","cited_by_count":0,"area":null},{"id":"2507.02916","title":"Efficient Certified Reasoning for Binarized Neural Networks","created":"2025-06-25","cited_by_count":0,"area":null},{"id":"2511.16637","title":"Faster Certified Symmetry Breaking Using Orders With Auxiliary Variables","created":"2025-11-20","cited_by_count":0,"area":null},{"id":"2601.16855","title":"Orbitopal Fixing in SAT","created":"2026-01-23","cited_by_count":0,"area":null},{"id":"2607.00815","title":"Streaming LRAT Certificates into Lean Theorems","created":"2026-07-01","cited_by_count":0,"area":null},{"id":"2607.21199","title":"Towards a Certifying Grounder","created":"2026-07-23","cited_by_count":0,"area":null},{"id":"2607.28459","title":"LeanCSP: A Framework for Certifying Constraint Reformulation and Solving in Lean","created":"2026-07-30","cited_by_count":0,"area":null},{"id":"2609.20873","title":"The Refutation Gap: Certifying Both Halves of an Optimality Claim","created":"2026-09-16","cited_by_count":0,"area":null}],"next_cursor":null}