A field on ReadSearch
Computer Science & AI
Much of the new work in computer science and AI appears first as a preprint on arXiv. ReadSearch reads those listings every day, with papers OpenAlex files under the same subjects, and this page shows the newest it has, from machine learning and language to systems, theory and security.
The newest 1,000 papers, from 4 November 2026 to 5 November 2026: 1,000 arXiv preprints.
Newest papers, page 22
Agent-R$^2$: Scaling Agents for Realistic Productivity Work via Real-Source Data Synthesis
Large language models have made rapid progress in agentic reasoning and tool use, raising expectations for agents that can take over realistic productivity work from humans.QDiff: Differential Testing of Quantum Software Stacks
Over the past few years, several quantum software stacks (QSS) have been developed in response to rapid hardware advances in quantum computing."Blind Compliance": Coercive Control in AI Jailbreaking
The explosion of generative AI systems and concerns surrounding their rapidly scaling capabilities has led to an adversarial cycle between increasingly narrow content restrictions ("guardrails") and…Domain-specific information retrieval
Information Retrieval (IR) is much more than ad hoc web search: a large portion of the information seeking activities takes place in specific domains, often addressing work-related tasks.The probabilistic bound for perfect hashing is sharp only for binary alphabets
We investigate the optimal asymptotic rate $R_q$ of perfect $q$-hash codes, a fundamental extremal problem in combinatorics, information theory, and computer science.From Twisted Facts to Rogue Agents: Can LLMs Reliably Detect Multi-Dimensional Hallucinations?
Large language models (LLMs) are widely used for information access, content production, and agent-based task execution, but their outputs remain vulnerable to subtle, high-risk hallucinations.Signals, Evidence, and Context: User Scrutiny in Real-World LLM Conversations
Large language models (LLMs) often present synthesized answers without making their supporting evidence easy to inspect.Beyond Quadratic Attention: Separable Gaussian Operators for ODE Vision Transformers
Self-attention carries a quadratic cost in token count, which limits how far Vision Transformers can scale with input resolution.Terminal-style Mathematical Modeling Bench: The First Agentic and Verifiable Benchmark for Mathematical Modeling
Mathematical modeling turns an open-ended real-world problem into assumptions, a model, a solution, and a defended recommendation, and its answers matter only if they are both close to a credible…FewStepRL: Fine-tuning Few-step Diffusion Models with Reinforcement Learning
Reinforcement learning (RL) has become a standard post-training method for diffusion models, but most RL objectives roll out the current policy at every iteration, and with a many-step sampler these…Value-oriented policy distillation for interpretable wind farm power control
Wind farm power control can help the system maintain balance and avoid blackouts.Geometric Relevance Is Not Sufficient: Evaluating Focused Post-Training Supervision in Diffusion Docking
Diffusion-based molecular docking requires learning a corrective score field across a broad corruption distribution, yet individual pose errors can differ substantially in their structural…Series-wise Cross-validation for Global Time Series Forecasting
We consider the problem of cross-validation (CV) in time series forecasting, with a focus on global forecasting models based on deep learning.All minimum cuts of symmetric submodular functions
We compute Cunningham's canonical decomposition of a symmetric submodular function on $n$ elements in $O(n^3)$ time.Nowcasting of Tropical Cyclone Wind Fields and Intensity from Geostationary Imagery
High-resolution tropical cyclone surface wind speeds derived from synthetic aperture radar (SAR) observations can support storm structure and intensity modelling, but remain spatially and temporally…Minimum-Cost $k$-Arborescence Packing in $\tilde O(km+k^4 n)$ Time
We give a deterministic, strongly polynomial algorithm running in $\tilde{O}(km+k^4n)$ time that finds $k$ arc-disjoint arborescences of minimum total cost in a directed multigraph with $n$ vertices…Fault-Geometry-Aware Control Allocation for Emergency Quadrotor Landing under Single-Motor Loss of Effectiveness
Partial single-motor loss of effectiveness (LoE) changes the remaining control-authority geometry of a quadrotor and can change which control allocator performs best during emergency landing[cite…The Geometry of Simulated Perspectives: Dissociating Representation and Behaviour in a Multimodal Language Model
Multimodal language models can simulate different observers, yet it remains unclear how assigned perspectives reshape their internal representations and whether these changes govern their judgements.Scaling Neural Motor Decoding via Decoupled Behavioral Pretraining
Recent neural decoding approaches achieve strong performance by training on large collections of paired neural-behavioral recordings, but such datasets are expensive, invasive, and difficult to scale.SplatAnything: Gaussian Spacing Normalization for Feed-forward 3DGS across Arbitrary Scenes
We identify a key limitation of existing feed-forward 3DGS methods: Gaussian attributes are typically predicted in a radial-distance-normalized space that canonicalizes a global radial statistic of…
Get the few papers worth your time in Computer Science & AI every morning.
Choose your topics and ReadSearch reads the new papers in them each day, then brings you the few worth reading, each with its key finding in a sentence.