{"total":29,"rows":[{"id":"2512.20578","title":"Can LLMs Predict Their Own Failures? Self-Awareness via Internal Circuits","created":"2025-12-23","cited_by_count":14,"area":null},{"id":"2602.03845","title":"Parallel-Probe: Towards Efficient Parallel Thinking via 2D Probing","created":"2026-02-03","cited_by_count":14,"area":null},{"id":"2506.10139","title":"Unsupervised Elicitation of Language Models","created":"2025-06-11","cited_by_count":11,"area":null},{"id":"2506.08572","title":"The Geometries of Truth Are Orthogonal Across Tasks","created":"2025-06-10","cited_by_count":9,"area":null},{"id":"2510.11905","title":"LLM Knowledge is Brittle: Truthfulness Representations Rely on Superficial Resemblance","created":"2025-10-13","cited_by_count":9,"area":null},{"id":"2602.13540","title":"On Calibration of Large Language Models: From Response To Capability","created":"2026-02-14","cited_by_count":7,"area":null},{"id":"2606.17056","title":"The Value Axis: Language Models Encode Whether They're on the Right Track","created":"2026-06-15","cited_by_count":7,"area":null},{"id":"2505.16170","title":"When Do LLMs Admit Their Mistakes? Understanding The Role Of Model Belief In Retraction","created":"2025-05-22","cited_by_count":6,"area":null},{"id":"2512.07404","title":"On LLMs' Internal Representation of Code Correctness","created":"2025-12-08","cited_by_count":5,"area":null},{"id":"2605.20745","title":"The Hidden Signal of Verifier Strictness: Controlling and Improving Step-Wise Verification via Selective Latent Steering","created":"2026-05-20","cited_by_count":5,"area":null},{"id":"2510.06107","title":"Distributional Semantics Tracing: A Framework for Explaining Hallucinations in Large Language Models","created":"2025-10-07","cited_by_count":3,"area":null},{"id":"2604.12373","title":"Masked by Consensus: Disentangling Privileged Knowledge in LLM Correctness","created":"2026-04-14","cited_by_count":3,"area":null},{"id":"2605.09969","title":"The Truth Lies Somewhere in the Middle (of the Generated Tokens)","created":"2026-05-11","cited_by_count":3,"area":null},{"id":"2605.27668","title":"Aligning LLMs with Human Uncertainty: A Beta-Bernoulli Calibrator for LLM Forecasting","created":"2026-05-26","cited_by_count":3,"area":null},{"id":"2601.09001","title":"Entropy Sentinel: Probing Entropy Traces for LLM Monitoring","created":"2026-01-13","cited_by_count":2,"area":null},{"id":"2602.00710","title":"Learning More from Less: Unlocking Internal Representations for Benchmark Compression","created":"2026-01-31","cited_by_count":2,"area":null},{"id":"2602.01999","title":"From Latent Signals to Reflection Behavior: Tracing Meta-Cognitive Activation Trajectory in R1-Style LLMs","created":"2026-02-02","cited_by_count":2,"area":null},{"id":"2603.15653","title":"Recursive Language Models Meet Uncertainty: The Surprising Effectiveness of Self-Reflective Program Search for Long Context","created":"2026-03-07","cited_by_count":2,"area":null},{"id":"2604.03754","title":"Testing the Limits of Truth Directions in LLMs","created":"2026-04-04","cited_by_count":2,"area":null},{"id":"2608.17124","title":"A decodability criterion predicts when hidden-state selection beats majority voting in large language models","created":"2026-08-17","cited_by_count":2,"area":null},{"id":"2604.05397","title":"Confidence Should Be Calibrated More Than One Turn Deep","created":"2026-04-07","cited_by_count":1,"area":null},{"id":"2604.11662","title":"A Robust Evaluation of Probe Robustness: Lessons for Reliable OOD Uncertainty Quantification","created":"2026-04-13","cited_by_count":1,"area":null},{"id":"2608.08266","title":"On the Robustness of LLMs' Internal Representation of Code Correctness","created":"2026-08-08","cited_by_count":1,"area":null},{"id":"2601.17728","title":"Unsupervised Elicitation of Moral Values from Language Models","created":"2026-01-25","cited_by_count":0,"area":null},{"id":"2604.24801","title":"Architecture Determines Observability of Transformers","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2605.14746","title":"Selective Safety Steering via Value-Filtered Decoding","created":"2026-05-14","cited_by_count":0,"area":null},{"id":"2606.01000","title":"Trust Functions: Near-Lossless Weak-to-Strong Generalization by Learning When to Trust the Weak Teacher","created":"2026-05-31","cited_by_count":0,"area":null},{"id":"2606.11445","title":"Forecasting Future Behavior as a Learning Task","created":"2026-06-09","cited_by_count":0,"area":null},{"id":"2610.18121","title":"Narrative Lookahead in LLMs: Event-Level Decodability, Predictive Advantage, and Steering","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}