{"total":14,"rows":[{"id":"2503.16419","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","created":"2025-03-20","cited_by_count":464,"area":"lr"},{"id":"2504.10903","title":"Efficient Reasoning Models: A Survey","created":"2025-04-15","cited_by_count":95,"area":"lr"},{"id":"2503.24377","title":"Harnessing the Reasoning Economy: A Survey of Efficient Reasoning for Large Language Models","created":"2025-03-31","cited_by_count":36,"area":"lr"},{"id":"2507.02076","title":"Reasoning on a Budget: A Survey of Adaptive and Controllable Test-Time Compute in LLMs","created":"2025-07-02","cited_by_count":31,"area":"lr"},{"id":"2509.13990","title":"Slim-SC: Thought Pruning for Efficient Scaling with Self-Consistency","created":"2025-09-17","cited_by_count":13,"area":"lr"},{"id":"2502.19830","title":"Revisiting Self-Consistency from Dynamic Distributional Alignment Perspective on Answer Aggregation","created":"2025-02-27","cited_by_count":11,"area":"lr"},{"id":"2511.07396","title":"C3PO: Optimized Large Language Model Cascades with Probabilistic Cost Constraints for Reasoning","created":"2025-11-10","cited_by_count":8,"area":"lr"},{"id":"2601.11340","title":"Neural Chain-of-Thought Search: Searching the Optimal Reasoning Path to Enhance Large Language Models","created":"2026-01-16","cited_by_count":8,"area":"lr"},{"id":"2508.20395","title":"Measuring Reasoning Utility in LLMs via Conditional Entropy Reduction","created":"2025-08-28","cited_by_count":6,"area":"lr"},{"id":"2601.21494","title":"The Path of Least Resistance: Guiding LLM Reasoning Trajectories with Prefix Consensus","created":"2026-01-29","cited_by_count":4,"area":"lr"},{"id":"2602.08948","title":"CoRefine: Confidence-Guided Self-Refinement for Adaptive Test-Time Compute","created":"2026-02-09","cited_by_count":3,"area":"lr"},{"id":"2605.07654","title":"Reliable Chain-of-Thought via Prefix Consistency","created":"2026-05-08","cited_by_count":3,"area":"lr"},{"id":"2511.01203","title":"FEval-TTC: Fair Evaluation Protocol for Test-Time Compute","created":"2025-11-03","cited_by_count":1,"area":"lr"},{"id":"2602.06527","title":"HyPER: Bridging Exploration and Exploitation for Scalable LLM Reasoning with Hypothesis Path Expansion and Reduction","created":"2026-02-06","cited_by_count":0,"area":"lr"}],"next_cursor":null}