{"total":15,"rows":[{"id":"2505.20674","title":"PonderLM: Pretraining Language Models to Ponder in Continuous Space","created":"2025-05-27","cited_by_count":44,"area":null},{"id":"2510.00931","title":"Making, not Taking, the Best of N","created":"2025-10-01","cited_by_count":6,"area":null},{"id":"2607.11022","title":"When the Reward Suite Is Leaky: A Preregistered Causal Contrast of Natural Verifier False Positives in RLVR","created":"2026-07-13","cited_by_count":4,"area":null},{"id":"2506.13593","title":"Calibrated Predictive Lower Bounds on Time-to-Unsafe-Sampling in LLMs","created":"2025-06-16","cited_by_count":3,"area":null},{"id":"2502.20315","title":"LangProBe: a Language Programs Benchmark","created":"2025-02-27","cited_by_count":2,"area":null},{"id":"2505.04528","title":"Beyond Theorem Proving: Formulation, Framework and Benchmark for Formal Problem-Solving","created":"2025-05-07","cited_by_count":2,"area":null},{"id":"2605.25252","title":"Quantifying Empirical Compute-Supervision Tradeoffs in RLVR","created":"2026-05-24","cited_by_count":2,"area":null},{"id":"2502.16701","title":"Beyond Release: Access Considerations for Generative AI Systems","created":"2025-02-23","cited_by_count":1,"area":null},{"id":"2607.08665","title":"Resample or Reroute? Recoverable Stopping Debt Without Identified Action Selection","created":"2026-07-09","cited_by_count":1,"area":null},{"id":"2509.04583","title":"Instance-Wise Adaptive Sampling for Dataset Construction in Approximating Inverse Problem Solutions","created":"2025-09-04","cited_by_count":0,"area":null},{"id":"2604.00324","title":"The Persistent Vulnerability of Aligned AI Systems","created":"2026-03-31","cited_by_count":0,"area":null},{"id":"2609.33142","title":"Knowing Is Not Choosing: What Explicit Verification Adds Beyond Generative Preference","created":"2026-09-27","cited_by_count":0,"area":null},{"id":"2609.40190","title":"Cheap to Draw, Expensive to Trust: Certifying Test-Time Scaling Curves","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.01110","title":"How Much Can Language Models Gain from Test-Time Computation?","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.15372","title":"Fewer Bits, More Tries: Recovering Capability Under Memory Constraints","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}