VERITAS creates verifiable sparse-answer search tasks equivalent to exhaustive enumeration by using non-optimizable constraints that are easy to verify but force full traversal.
goal":"Retrieve the most popular repositories among Google users and their star counts
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints
VERITAS creates verifiable sparse-answer search tasks equivalent to exhaustive enumeration by using non-optimizable constraints that are easy to verify but force full traversal.