ICDT Paper Verifiability & Proof Audit
Audits and strengthens the mathematical verifiability, proof completeness, and theoretical rigor of ICDT database research papers.
The ICDT Reproducibility skill strengthens the theoretical verifiability of research papers targeted at the International Conference on Database Theory (ICDT). It systematically audits mathematical proofs, ensuring every theorem, lemma, and stated bound maps directly to a complete and self-contained proof while eliminating unproven leaps. Built for database theorists and computer science researchers preparing conference submissions or camera-ready LIPIcs proceedings, this skill pinpoints missing reduction cases, checks matching upper and lower bounds, flags unproven conjectures, and guarantees consistency between conference papers and arXiv full versions.