domains / families / research / soda-reproducibility

soda-reproducibility

separate

Use when hardening the verifiability of a SODA (ACM-SIAM Symposium on Discrete Algorithms) paper, where reproducibility means checkable mathematics — complete proofs in the submitted full version, stable statement-proof correspondence, explicit constants and model assumptions, and certificates for any machine-checked step.

When to use

• hardening verifiability of SODA papers
• auditing reproducibility of mathematical claims
• checking statement-proof correspondence
• verifying external theorem hypotheses
• auditing probability budgets
• validating machine-checked steps
• pre-submission audit sequence

When not to use

• reproducibility involving seeds and GPUs
• packaging and anonymity of artifacts
• camera-ready formatting

Skill page

Source