OmniVerifier-C1: Decomposed Graded Verifier for Rule-Governed Generative World Modeling
TLDR
Proposes OmniVerifier-C1, a decomposed graded verifier for rule-governed generative world modeling, using decoupled reinforcement learning to provide fine-grained pointwise critiques beyond binary verifiers.
Reasoning
The paper introduces a novel verifier that decomposes complex rules into fine-grained components and provides continuous scoring, with theoretical justification for pairwise verification. Strengths include a clear training framework and empirical comparisons against binary verifiers, though the abstract omits specific benchmark details and explicit limitations.
Read-first score
Read-first score 22.8, weighted from topical fit, citation, graph, method, reproducibility, and recency signals. Original total remains 18.
Field roles
Rank sensitivity
Stability: volatile; rank range: 111.