arXiv preprints from January 1, 2026 through September 30, 2026 — 14:40:19 EST
Recent advancements in large language models (LLMs) have significantly enhanced their reasoning capabilities. However, they continue to struggle with basic character-level tasks, such as counting letters in words, a problem rooted in their tokenization process. While existing benchmarks have highlighted this weakness through basic...
In this report, we introduce DASD-4B-Thinking, a lightweight yet highly capable, fully open-source reasoning model. It achieves SOTA performance among open-source models of comparable scale across challenging benchmarks in mathematics, scientific reasoning, and code generation -- even outperforming several larger models. We begin by...
We provide a characterization of the red supergiant (RSG) progenitor candidate for the nearby Type II-plateau supernova (SN) 2025pht in NGC 1637. The star was first detectable in 2001 by the Hubble Space Telescope (HST) and then again in a dozen bands by the James Webb Space Telescope (JWST) in 2024. This "quasi-snapshot" of the...
Solid state materials can display varieties of atomic structural orders ranging from crystalline to amorphous, underlying their properties and diverse functionalities. Procrystal has emerged as a new category of solids, featuring a long-range ordered lattice framework tiled with disordered atomic or molecular structures on the lattice...
Group Relative Policy Optimization (GRPO) has become a standard approach for training mathematical reasoning models; however, its reliance on multiple completions per prompt makes training computationally expensive. Although recent work has reduced the number of training steps required to reach peak performance, the overall wall-clock...
Human preference evaluations are widely used to compare generative models, yet it remains unclear how many judgments are required to reliably detect small improvements. We show that when preference signal is diffuse across prompts (i.e., all prompt types are similarly informative), proportional allocation is minimax-optimal: no...
We present Speculative Rollout with Tree-Structured Cache (SRT), a simple, model-free approach to accelerate on-policy reinforcement learning (RL) for language models without sacrificing distributional correctness. SRT exploits the empirical similarity of rollouts for the same prompt across training steps by storing previously...
A proof of the security of the Bitcoin protocol is made rigorous, and simplified in certain parts. A computational model in which an adversary can delay transmission of blocks by time $Δ$ is considered. The protocol is generalized to allow blocks of different scores and a proof within this more general model is presented. An approach...
With the hardware offloading of network functions, network interface cards (NICs) undertake massive stateful, high-precision, and high-throughput tasks, where timers serve as a critical enabling component. However, existing timer management schemes suffer from heavy software load, low precision, lack of hardware update support, and...
We investigate a "deep zero problem" proposed by Hedenmalm. We show that there is a natural connection between Hedenmalm's problem and the classical HRT conjecture in time-frequency analysis. This connection allows us to show that Hedenmalm's problem 5.2 in [5] as well as some of its natural analogs have affirmative answers.
We give an algorithm for reducing the number of generators of the Khovanov chain complex of the torus braid $ft^k_n = (σ_1σ_2\cdots σ_{n-1})^k$ on $n$ strands by applying Bar-Natan Gaussian elimination along a distinguished set of Gaussian elimination isomorphisms. We call the resulting complex $\mathcal{FT}^k_n$ a \emph{whittled...
Recent advances in transformer-based lightweight object tracking have established new standards across benchmarks, leveraging the global receptive field and powerful feature extraction capabilities of attention mechanisms. Despite these achievements, existing methods universally employ sparse sampling during training--utilizing only...
We compute the minimum crossing numbers for a family of Turaev genus 2 links to verify the Qazaqzeh-Chbili-Lowrance conjecture for the family.
We propose Knowledge Boundary Discovery (KBD), a reinforcement learning based framework to explore the knowledge boundaries of the Large Language Models (LLMs). We define the knowledge boundary by automatically generating two types of questions: (i) those the LLM can confidently answer (within-knowledge boundary) and (ii) those it...
Split Federated Learning (SFL) enables collaborative training between resource-constrained edge devices and a compute-rich server. Communication overhead is a central issue in SFL and can be mitigated with auxiliary networks. Yet, the fundamental client-side computation challenge remains, as back-propagation requires substantial...
Traditional technology mapping suffers from systemic inaccuracies in delay estimation due to its reliance on abstract, technology-agnostic delay models that fail to capture the nuanced timing behavior behavior of real post-mapping circuits. To address this fundamental limitation, we introduce GPA(graph neural network (GNN)-based...
We develop a data-driven framework for identifying non-Markovian dynamical equations of motion for open quantum systems. Starting from the Nakajima--Zwanzig formalism, we vectorize the reduced density matrix into a four-dimensional state vector and cast the dynamics as a Volterra integro-differential equation with an operator-valued...
In this paper we study the Fourier estimator of Malliavin and Mancino for the spot volatility. We establish the convergence of the trigonometric polynomial to the volatility's path in a setting that includes the following aspects. First, the volatility is required to satisfy a mild integrability condition, but otherwise allowed to be...
We propose an inverse-squeezing Kennedy receiver for discriminating binary phase-shift-keyed displaced squeezed vacuum states. The receiver combines a Kennedy-type nulling displacement, an orthogonally oriented inverse-squeezing operation and photon-number-resolving detection with a maximum-a-\emph{posteriori} threshold rule. Its key...
Effective retrieval in complex domains requires bridging the gap between structured metadata and unstructured content. Existing systems typically isolate these capabilities, relying on either symbolic filtering or vector similarity, failing to capture their interplay. In this work, we propose DSL-R1, a unified framework that...
Developing safe, effective, and practically useful clinical prediction models (CPMs) traditionally requires iterative collaboration between clinical experts, data scientists, and informaticists. This process refines the often small but critical details of the model building process, such as which features/patients to include and how...
Machine learning interatomic potentials (MLIPs) enable efficient modeling of molecular interactions with quantum mechanical (QM) accuracy. However, constructing robust and representative training datasets that capture subtle, system-specific interaction motifs remains challenging. We introduce PANIP (PAirwise Non-covalent Interaction...
The existence of multiple, equally accurate models for a given predictive task leads to predictive multiplicity, where a Rashomon set of models achieve similar accuracy but diverge in their individual predictions. This inconsistency undermines trust in high-stakes applications where we want consistent predictions. We propose three...
Recent ALMA observations with 0''.1 resolution reveal characteristic substructures in circumstellar disks around young Class I sources, providing clues to the early stages of morphological disk evolution. In this paper, we applied PRIISM imaging to ALMA archival Band 6 continuum data of the circumstellar disk around the Class I...
Knowledge graphs (KGs) have commonly been constructed using predefined symbolic relation schemas, typically implemented as categorical relation labels. This design has notable shortcomings: real-world relations are often contextual, nuanced, and sometimes uncertain, and compressing it into discrete relation labels abstracts away...