Reproduce “Approximation and Hardness for the Data Validation Problem” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Antoine Tinguely, G. Wessel van der Heijden
The paper studies how to choose checks of uncertain task-order constraints under a limited budget. A check is allowed only for a precedence in the graph’s transitive reduction, so one probe can change which others are eligible. The authors prove an m-approximation under uniform costs and success probabilities, and show strong NP-hardness even with deterministic outcomes and unit costs and rewards.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.