Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 28 August
We construct a new family of permutation group polynomials over finite fields of odd characteristic and explicitly provide its companion. Moreover, we precisely determine the number of permutation group polynomials of this form and those that are equivalent to this new family. In addition, we completely solve the problem of enumerating permutation group polynomials of the various forms presented in Hasan and Kumar (2026), as well as permutation group polynomials which are equivalent to these families.
Number Theory
Generalized Fermat equation over number fields
Let $K$ be a number field and $A,B,C\in\mathcal{O}_K\setminus\{0\}$. Put $S_K=\{\mathfrak{P}:\mathfrak{P}\mid2\}$ and $S_K'=\{\mathfrak{q}:\mathfrak{q}\mid2ABC\}$. We establish two criteria for the non-existence of non-trivial solutions of $Ax^p+By^p=Cz^p$ over $K$ for sufficiently large prime exponents $p$. Both criteria use a valuation bound on the $S_K'$-unit equation at a fixed $\mathfrak{P}\in S_K$. The first excludes all non-trivial solutions in $K^3$ when $v_{\mathfrak{P}}(A)=v_{\mathfrak{P}}(B)=m$ and $v_{\mathfrak{P}}(C)=m+k$, with $k>4v_{\mathfrak{P}}(2)$. The second, under an explicit nonvanishing condition on the coefficient valuations, excludes solutions $(a,b,c)\in(K^\times)^3$ whose $\mathfrak{P}$-valuations are not all equal. In particular, it excludes non-trivial primitive integral solutions with $\mathfrak{P}\mid abc$. Neither criterion restricts the residue degree of $\mathfrak{P}$. Both criteria hold unconditionally over every totally real field; over general number fields, we assume residual modularity and Eichler–Shimura-type conjectures. The first criterion covers a new coefficient range. In particular, under the corresponding $S_K$-unit bound, $x^p+y^p=2^rz^p$ has no non-trivial solutions in $K^3$ for each fixed $r\geq5$ and sufficiently large prime $p$. This bound holds for a set of real quadratic fields of relative density $1$. For a family of imaginary quadratic fields of relative density $5/6$, we explicitly determine the $S_K$-unit solutions and verify the valuation bound for both criteria when $A,B,C\in\{\pm2^r:r\in\mathbb{Z}_{\geq0}\}$, including the same $r\geq5$ conclusion.
Read the full abstract
Machine Learning
Generalized Gibbs Ensemble Weighting for Forecast Combination
Forecast combination is a reliable way to improve predictive performance when several forecasting models are available. Simple aggregation rules such as the mean, median, trimmed mean, inverse-loss weighting, and exponential weighting are often strong baselines, but their relative performance can vary across datasets, forecast horizons, deployment settings, and levels of disagreement among base forecasters. We develop Generalized Gibbs Ensemble Weighting (GGEW), a probabilistic framework that treats forecasting models as experts and assigns ensemble weights using a Gibbs-style exponential transformation of normalized predictive loss. The framework extends this basic weighting rule through numerical stabilization, diversity-aware score corrections, and online hyperparameter adaptation. GGEW produces a family of related methods, including Stable Gibbs weighting, Directional Gibbs-NCL, and Symmetric Gibbs-NCL. These variants share one core algorithm and differ only in the score used inside the exponential weighting rule. For sequential deployment, we adopt a UCB-style bandit mechanism, called online Local-UCB, to adapt the learning rate, diversity strength, and Gibbs variant without evaluating the full hyperparameter grid at every prediction step. We evaluate GGEW on official M4 competition forecast submissions and external rolling-origin deployment experiments using Monash Traffic Hourly, Electricity Hourly, and Solar Weekly datasets. Results suggest that Gibbs-style adaptive weighting is a useful and competitive tool across several benchmark settings, although its relative performance varies across datasets, forecast horizons, deployment protocols, and forecast disagreement groups. The contribution is not a universal dominance claim, but a framework and empirical study motivating further investigation of when adaptive Gibbs-style forecast combination is useful.
Read the full abstract
Econometrics
Causal Non-causal State Space Models and the Modelling of Financial Bubbles
In this paper, we study causal non-causal state space models to model time series characterised by a local explosive increase followed by a sharp decrease such as stock prices. To motivate the use of causal non-causal state space models, we show that the causal non-causal convolution autoregressive model introduced by Gourieroux and Zakoian (2017) can be consistent with the rational expectations stock price model. As in a causal state space model, a central question is how to perform state and parameter inference in the causal non-causal state space model, which we discuss in the paper. We also study the causal non-causal convolution autoregressive model in more detail, providing some new results for the model. To illustrate the usefulness of causal non-causal state space models, we use the causal non-causal convolution autoregressive model to estimate the size of the dot-com bubble in both real time and a posteriori with the stable non-causal autoregressive model considered also by Gourieroux and Zakoian (2017) as a benchmark.
Read the full abstract
Software Engineering
RESTCov: A Tool for Structural Coverage Analysis of REST APIs
REST APIs are widely used in modern software systems, but developers and testers often lack visibility into which parts of an API specification are exercised by a test suite. Traditional coverage analysis usually relies on source-code instrumentation, which is impractical for REST APIs that are distributed, externally maintained, and hence accessible only through black-box execution. This paper presents RESTCov, a lightweight tool that computes structural REST API coverage from an OpenAPI specification and observed HTTP request/response logs, reporting coverage across paths, operations, parameters, media types, status codes, and status classes. RESTCov produces both machine-readable results and a human-readable HTML report, helping users inspect coverage gaps, diagnose specification-log mismatches, and evaluate REST API test suites without requiring access to the implementation. Screencast: https://youtu.be/mNz2P43OyUc Repository: https://github.com/2tolgahan2/RESTCov
Read the full abstract
Computation and Language
H-Scale: Hessian-Guided Scale Refinement for NVFP4 Sub-Byte LLM Inference
The NVIDIA Blackwell architecture, with native support for the ultra-fine-grained NVFP4 format, opens new opportunities for accelerating large language model (LLM) inference. NVFP4's micro-block design, such as a group size of 16, offers strong representational flexibility for capturing local weight distributions and isolating outliers, but it also introduces a large and highly sensitive space of per-group scaling factors. Existing post-training quantization (PTQ) methods primarily focus on refining quantized weight values, leaving this scale-selection step underexplored. To address this gap, we propose H-Scale, a lightweight post-processing method for NVFP4 per-group scale refinement. Instead of minimizing plain weight reconstruction error, H-Scale selects hardware-valid group scales using a diagonal second-order proxy derived from calibration activations, thereby targeting layer output perturbation more directly. It is designed as a drop-in replacement for RTN-style scale selection in diverse NVFP4 pipelines, requires only modest offline calibration, and introduces strictly zero overhead at inference time. Under a fixed evaluation protocol, experiments on mainstream LLMs show that H-Scale generally improves a broad range of NVFP4 baselines and brings several variants closer to the BF16 reference.
Read the full abstract
Soft Condensed Matter
Geometry-Controlled Dynamic Tensiometry Resolves Intrinsic Surfactant Adsorption Kinetics
At short times, interfacial tension depends on experimental geometry because surfactant transport to the interface depends on the mass-transfer conditions.A predictive description therefore requires more than a dynamic tension curve or a fitted adsorption constant: interfacial thermodynamics, diffusion, and adsorption kinetics must be identified separately. Here, we combine equilibrium and diffusion measurements with a microfluidic EDGE tensiometer that provides a nearly stationary interface and controlled micrometer-scale transport. Equilibrium properties and diffusion are determined independently, leaving adsorption kinetics as the key unknown. Dynamic tension is then calculated using a nonequilibrium thermodynamic description, without assuming instantaneous equilibrium between the adsorbed layer and the subsurface solution. For the nonionic surfactant C$_{10}$E$_{8}$, equilibrium thermodynamics and transport are independently constrained, and a single intrinsic adsorption rate constant describes several concentrations. We extend the framework to SDS by including electrostatic interactions and subsurface-concentration dynamics, capturing transient depletion and replenishment. Once thermodynamic, transport, and kinetic parameters are identified, the model predicts dynamic interfacial tension beyond the geometry and conditions used to determine them. The microfluidic EDGE tensiometer thus provides both a reliable short-time tensiometry method and a quantitative framework for identifying the physical mechanisms governing surfactant mass transfer at interfaces.
Read the full abstract
Software Engineering
CC4M: Code Clone Analysis and Visualization for Microservices
Microservice architecture supports software evolution by decomposing a system into small, loosely coupled services that can be deployed independently. Contrary to the expectation of high modularity, prior studies have reported that code clones exist across service boundaries, some of which are co-modified in the same version. Such clones may require changes to be propagated across service boundaries, thereby undermining service independence and increasing maintenance costs. However, existing tools do not support microservice-aware clone analysis. We present CC4M, a microservice-aware clone analysis and visualization tool. CC4M detects and enriches clone pairs with service-boundary, co-modification, file-category, and metric information. The enriched clones are visualized in an interactive scatter plot with explicit service boundaries, supporting metric-based filtering to prioritize clones with potentially higher maintenance impact. Using an open-source microservice application, we illustrate how CC4M helps identify the potential impact scope of code changes. A demo video and the tool are available at https://www.youtube.com/watch?v=0xOIQPFbkUg and https://doi.org/10.5281/zenodo.21204195, respectively.
Read the full abstract
Statistical Methodology
SCAN: Sequentially Detecting Change-points via Adaptive Nonparametric Inference
Modern time series are often long, serially dependent, and non-stationary. Existing change-point methods either target specific changes or become computationally intensive when using nonparametric costs on long series. Many also require thresholds to be carefully calibrated under serial dependence. We introduce SCAN, an offline method for detecting multiple distributional change-points in long, serially dependent univariate time series. SCAN compares adjacent windows using an integral probability metric, calibrates local discrepancies with a dependence-aware bootstrap, and refines candidate locations using a scaled 1-Wasserstein criterion, enabling detection of changes in mean, variance, and broader distributional structure within a unified framework. An ensemble over multiple window sizes reduces sensitivity to window size and threshold specification. We establish consistency of the estimated number and locations of change-points under exponential alpha-mixing dependence, and show that the localization statistic reduces to a CUSUM-type statistic under pure mean shifts. In simulations with up to one million observations, SCAN generally achieves higher covering and F1-scores than competing methods across mean and joint mean-variance shifts, particularly under serial dependence. On real data, SCAN identifies labeled activity transitions in sensor data and interpretable structural changes in hourly Bitcoin prices. Implementations are available in the Python package scan-cpd and R package scanr.
Read the full abstract
Astrophysics of Galaxies
Dissecting ultra-diffuse galaxies in the field
Context. Ultra-diffuse galaxies (UDGs) in the field are faint, diffuse systems that remain poorly represented in the literature due to the need for spectroscopic confirmation and the difficulty of obtaining high S/N emission line measurements. Aims. We present a spectroscopic study of 17 blue UDG candidates in the field using optical emission lines to confirm their diffuse nature and properties. Methods. We derived spectroscopic redshifts($z_{\rm spec}$) for our field UDG candidates. We then computed their effective radii ($r_{\rm eff}$) and central surface brightnesses ($\mu_{0,g}$). We measured the H$\alpha$ and H$\beta$ emission line fluxes in the 17 spectra and derived star-formation rates (SFR) from the line-luminosity relation. We performed forced photometry on our sample to obtain photometric fluxes and applied an aperture correction on the H$\alpha$ integrated fluxes, propagating the correction to the derived SFRs. We then computed stellar masses ($M_*$) using colour relations and estimated dust attenuation and corrected the SFRs accordingly. Two sources were further examined as potential giant low surface-brightness galaxies(GLSBGs). Results. We identify nine confirmed UDGs, eight other low surface-brightness galaxies (LSBGs), including one GLSBG. The $z_{\rm spec}$ of our field UDGs span a range of $0.015-0.037$, their $r_{\rm eff}$ spans $1.69-4.99$ kpc and $\mu_{0,g}$ between $24.05-24.98~{\rm mag~arcsec}^{-2}$. Galaxies exhibit low to moderate dust content, with an average V-band attenuation of 0.29 mag. The spectroscopically confirmed UDGs presented in this work, after the aperture correction performed, lie along the star-forming main sequence. Conclusions. Our results indicate that blue field UDGs are characterised by heterogeneous dust attenuation and occupy the same region of the star formation-stellar mass plane as dwarf LSBGs.
Read the full abstract
Robotics
DeicticVLA: Unifying Instruction Modes Based on Language and Deictic Gestures in a Single VLA
Vision-Language-Action models (VLAs) allow users to specify manipulation tasks in natural language, but distinguishing a target or placement goal among objects of the same category or similar appearance requires detailed expressions that VLAs may not use reliably. We propose DeicticVLA, which canonicalizes Language Instruction (LI), Vision-Language Instruction (VLI), and Visual Instruction (VI) into a text prompt and deictic masks through text-prompt completion and deictic gesture grounding, enabling a single pretrained VLA to handle all three instruction modes. With a shared backbone, demonstrations, and matched training steps, we compare two RGB visual prompting methods, two separate-channel mask prompting methods, and three training strategies in simulation. Under two-stage training, the four prompting methods achieve high in-distribution success but differ in their ability to use deictic masks in unseen layouts. Across methods, training-strategy ablations show that two-stage training improves such use, while retaining second-stage LI data mitigates forgetting without reducing VLI and VI performance. In three real-world tasks, one policy supports all modes. VLI and VI outperform LI under unseen expressions, appearance changes, and novel objects. For unseen categories, both achieve 100% success, compared with 16.7% for jointly trained LI. These results demonstrate the unified three-mode interface and guide DeicticVLA design.
Read the full abstract
Materials Science
Charge transfer and competing symmetry breaking drive orbital reconstruction and emergent ferromagnetism in insulating oxide superlattices
Electron correlation, hopping, and ligand-to-metal charge transfer collectively lead to diverse electronic and magnetic phenomena in 3$d$ transition-metal oxides, where directional d orbitals make hopping highly sensitive to symmetry-dependent orbital overlap. Heterostructure engineering with atomically flat interfaces adds symmetry-breaking charge transfer as a further route to emergent behavior, yet whether interfacial mismatch between constituent oxides of a superlattice shapes ground states independent of epitaxial strain remains unresolved. Here we examine superlattices combining NdNiO$_3$ with Mott-insulating NdMnO$_3$. Varying layer thickness and combining transport with X-ray spectroscopy, we show that electron transfer from NdMnO$_3$ to NdNiO$_3$ drives a room-temperature insulating state with a distinct electronic structure, accompanied by a reversal in orbital symmetry beyond simple strain considerations, underscoring the interface's central role. These reconstructions stabilize an emergent ferromagnetic insulating state arising from interfacial Ni$^{2+}$-O-Mn$^{4+}$ superexchange. Our results establish a pathway to interface-engineered ferromagnetic insulating phases via competing interactions, with potential for spin-insulatronic applications.
Read the full abstract
High Energy Physics (Phenomenology)
Expansion attractor in classical Yang-Mills theory
Applications of the concept of a hydrodynamic attractor have been mostly constrained to the context of hydrodynamization in heavy ion collisions. Deepening the understanding of the general phenomenon requires generalizing it to other contexts in order to see which facettes are truly universal and not a peculiarity of equilibrating conformal Bjorken flow. As part of this endeavor, this work aims to study the behaviour in a system that does not hydrodynamize, but nevertheless loses memory through expansion. We find that the system goes through three stages. At early times, expansion drives the ratio $P_L/\epsilon$ to converge to $-1$ as $\tau^{-2}$. This memory loss is partially restored at intermediate times, when interaction dominated degrees of freedom through expansion dominated evolution grow quadraticallly in time. At late times, interactions shuffle of information in state space without significant memory loss or restoration.
Read the full abstract
Signal Processing
Experimental and Signal Processing Techniques for Fault Diagnosis on a Small Horizontal-Axis Wind Turbine Generator
Small HAWT is a technology characterized by non-trivial critical points, basically because it is targeted for domestic use and therefore cheap manufacturing and control must conjugate with good efficiency under possibly complex flow conditions (especially in urban environment). Therefore, dynamical control optimization and noise and vibration mitigation are pressing issues for this kind of technology. Despite it is peculiar of small HAWTs that the generator constitutes a non-negligible fraction of the total mass and therefore the electromechanical coupling is relevant, condition monitoring of small HAWT generators is an overlooked topic. The present work is a test case study of damage diagnosis on a permanent magnet generator of a HAWT having 3 kW of maximum power and 2 meters of rotor diameter. The experimental analysis is conducted through wind tunnel tests and on a generator test rig where a damaged and an undamaged generators have been driven at different rotational speeds. Vibration measurements are collected in the wind tunnel through radial accelerometers near the rear bearing of the shaft and in the test rig through uni-axial accelerometers (fixed in radial positions, in order to be aligned with front and rear bearings). The test rig data result being particularly useful for studying the low-frequency tail of the vibration spectrum, where the characteristic frequencies of the bearing are located. The experimental data are analyzed in the time and frequency domain for feature extraction: a fault in the cage of the bearing supporting the generator is diagnosed using in particular the spectral coherence analysis.
Read the full abstract
Materials Science
Band-like Carriers in a Soft, Anharmonic Lattice: Lead-Halide Perovskites
Lead-halide perovskites APbX3 present a striking dichotomy: they exhibit band-like electronic transport despite their exceptionally soft and anharmonic lattices. Optically and electrically, they resemble conventional direct-gap semiconductors, exhibiting light carrier masses and steep absorption onsets, whereas their lattices display liquid-like dynamics, including overdamped octahedral motions, quasielastic Raman central peaks, and exceptionally low thermal conductivities. Solution-processed films nevertheless sustain micrometre-scale carrier diffusion at defect densities that would severely suppress transport in conventional semiconductors. Here, we argue that these apparently disparate properties emerge from a common microscopic framework: a soft, strongly anharmonic, and polar [PbX3]- framework, strongly influenced by the Pb 6s2 lone pair, which simultaneously shapes the antibonding orbital character of the band edges, the magnitude and multiple timescales of the dielectric response, and the slow relaxational dynamics that dress every charge carrier. We therefore invert the conventional order and develop the lattice before the electronic structure, because the nominally cubic phase is better viewed as a thermally fluctuating ensemble of locally symmetry-broken configurations rather than a single geometry. Within this framework, we discuss excitons, Frohlich large polarons in the intermediate-coupling regime, carrier transport, defect tolerance, dimensional reduction in two-dimensional and nanocrystalline derivatives, and symmetry-breaking phenomena. We critically assess three contested issues - defect tolerance, ferroelectricity, and the interpretation of the T-3/2 mobility law - and identify seven open questions together with the key measurements needed to resolve them
Read the full abstract
Numerical Analysis
Inverse Source Problem for a Time-Fractional Diffusion-Wave Equation with a Singular Inverse-Square Potential
This paper investigates an inverse source problem for a time-fractional diffusion-wave equation with a singular inverse-square potential. The source term is assumed to consist of a known temporal factor and an unknown spatial component, which is to be recovered from terminal-state measurements. The well-posedness and regularity of the forward problem are established within an appropriate energy framework by exploiting Hardy-type inequalities and the spectral properties of the associated singular elliptic operator. The terminal observation operator is then shown to be compact, and uniqueness of the spatial source is established under a suitable nondegeneracy condition on the temporal factor. To stabilize the resulting ill-posed inverse problem, a Tikhonov regularization approach is introduced. The gradient of the regularized functional is derived through an adjoint problem involving a right-sided fractional derivative, leading to an adjoint-based conjugate gradient method with an exact line search for the numerical reconstruction of the unknown source. Numerical experiments are conducted on both one-and two-dimensional spatial domains, using both exact and noisy terminal data, to demonstrate the effectiveness and stability of the proposed source reconstruction method.
Read the full abstract
Graphics
What Will This Copper Look Like Later? Forecasting Surface Appearance and Rendering It as a PBR Material
Digital design requires predicting how a metal surface will look later in its oxidation; this paper presents such a pipeline for copper. Given a fixed-camera observation, the system forecasts appearance 10 accelerated units ahead and converts it into the albedo, normal, roughness and metallic maps a renderer consumes. Forecasting is evaluated as an authoring tool would use it, on a copper specimen the system has not observed: an entire recording is held out, so training and checkpoint selection use one specimen and the test set is the whole of a second, recorded on a different day and condition. Under this protocol a learned spatio-temporal model with a monotone oxidation state, the most accurate forecaster within a single recording, is less accurate than copying the last observed frame on an unseen specimen, in both directions, as are three further trained architectures. The only forecaster that transfers is a closed-form global color extrapolation with no trained parameters, improving on copy-last-frame by 13.4% and 50.6%, with a margin that increases with horizon to +16.7% and +55.5% at t+10. Two controls qualify this: correcting every frame for the photometric drift measured on a non-oxidizing reference region leaves both margins intact, ruling out uncontrolled exposure as their source, and a moving-block bootstrap over the 6 independent windows each recording contains separates the larger margin from zero but leaves the smaller one not individually significant. The mechanism is measured: a learned susceptibility map encodes where corrosion begins on the training specimen and misleads on a new one, whereas the global color trajectory is what specimens share. The pipeline therefore deploys the closed-form forecaster for unseen specimens and the learned model only for continuing one already observed. Code, splits, protocol and leakage audit are released.
Read the full abstract
Computational Physics
A Synthetic Iterative Scheme for Non-Gray Phonon Boltzmann Transport Equation with Dual Relaxation Times
Solving the non-gray Callaway phonon Boltzmann transport equation allows a dual-relaxation-time approximation of separate normal and resistive scatterings and resolving the mode-dependent spectrum. The conventional iterative scheme (CIS) for deterministic solutions avoids a monolithic phase-space inversion, but its collision-source iteration can become prohibitively slow at a large characteristic length of a material. Existing synthetic acceleration schemes address either non-gray single-relaxation models or gray dual-relaxation models, leaving mode-resolved dual-relaxation transport without a dedicated acceleration framework. We develop a general synthetic iterative scheme (GSIS) for the stationary, linearized, non-gray Callaway equation, where synthetic approximations for the normal-process pseudo-temperature and phonon drift velocity are provided by exact energy and quasi-momentum balance laws closed with first-order Chapman-Enskog constitutive relations and non-equilibrium terms evaluated from the kinetic solution. The resistive-process pseudo-temperature is retrieved from the two quantities. Each iteration couples an upwind nodal discontinuous Galerkin kinetic sweep and a hybridizable discontinuous Galerkin solution of the synthetic equations to achieve high-order spatial discretization. A branch- and frequency-resolved Fourier analysis identifies the deterioration of CIS and shows that the GSIS contraction factor remains bounded away from unity for the considered graphene material. Asymptotic analysis indicates that GSIS reduces to a consistent discretization of a Guyer-Krumhansl-like equation and Fourier's law of heat conduction in the hydrodynamic and diffusive limits, respectively.
Read the full abstract
Materials Science
uMOF: A Universal Database, Benchmark, and Machine Learning Interatomic Potentials for Metal-Organic Frameworks
Foundation machine learning interatomic potentials (MLIPs) deliver near-ab-initio accuracy at a fraction of the computational cost, yet their promise for Metal-organic Frameworks (MOFs) remains largely unrealized as large unit cells make first-principles training data expensive to generate, fine-tuned models are scarce, and experimentally grounded benchmarks are scarcer still. We introduce uMOF, a three-part contribution addressing this gap. First, we release the largest and most accurate density functional theory dataset for MOFs to date, computed at the r$^2$SCAN-D4 level of theory across 85524 configurations spanning 19950 unique frameworks and 79 elements, covering empty and gas-loaded structures, geometry optimizations, equations of state, and finite-temperature molecular dynamics. Second, we release a literature-mined benchmark of 3986 verified property values (3146 experimental) extracted from 626 papers by a seven-stage, checkpointed multi-pass large language model pipeline, linked to more than 650 crystallographic information files. Third, we release two universal MLIPs for MOFs, uMOF-MH and uMOF-POLAR, fine-tuned from two architecturally distinct MACE foundation models on the uMOF dataset. On near-equilibrium, “Tier-1” properties (bulk modulus, phonon-derived heat capacity) the uMOF models perform comparably to existing foundation and fine-tuned baselines. On harder, dynamics-sensitive properties like gas adsorption enthalpies via Widom insertion and adsorption isotherms, the uMOF models outperform every baseline we test, including MOF-specialized gas-capture models trained on datasets up to three orders of magnitude larger, cutting error by more than 80% to within experimental uncertainty. We trace this advantage to the physical diversity of the training data and to level of theory where a small (1.7%) fraction of MD simulations is decisive for MLIP stability.
Read the full abstract
Artificial Intelligence
Speculative Probing: LLM Monitoring at Speculative-Decoding Cost
Real-time classification during language model inference is valuable for safety filtering, behavioral analysis, and model monitoring, but current approaches force a trade-off between accuracy and efficiency. Hidden-state probes are fast but limited: they are either not context-aware: operating on a single vector and cannot model interactions across positions; or they are very costly: having dedicated classifier models (Llama Guard, Qwen Guard, LLM-as-judge) or performing computation on hidden states for all tokens and then pooling the results (MultiMax). This shows an intrinsic trade-off between efficiency and accuracy. However, we find that the speculative-decoding module in recent LLMs can be repurposed for efficient high-quality classification. By appending a trained soft prompt at the end of the target sequence, we can repurpose the speculative-decoding module into a sequence classifier. At inference time in a speculative-decoding pipeline, the KV cache is already in GPU memory, so classification adds negligible overhead. We evaluate on four classification tasks across four models (Qwen3.5-4B, 9B, 27B, MiniCPM4.1-8B). Our small probes consistently outperform zero-shot GPT-5.4-mini and, on multilingual prompt safety, match or beat specialized 8B safety classifiers (Qwen3Guard-Gen-8B, Llama-Guard-3-8B) without running a full LLM.
Read the full abstract
Instrumentation and Methods for Astrophysics
Broadband heterodyne interferometry with a chirped femtosecond laser in the H-band
Infrared heterodyne interferometry offers a scalable alternative to direct interferometry for long-baseline telescope arrays. However, at near-infrared wavelengths, its sensitivity is limited by the electronic detection bandwidth and shot noise from the optical reference. Parallel detection via spectral multiplexing has long been identified as a potential means to increase the signal-to-noise ratio of heterodyne interferometers. We propose a new heterodyne detection architecture based on highly dispersed broadband pulses from a mode-locked laser, fast photoreceivers, and numerical correlation. This enables straightforward spectral multiplexing with commercial components to increase the SNR, while extending instantaneous wavelength coverage to simultaneous J- and H-band operation. The scheme also supports high-resolution spectroscopic imaging ($R \simeq 10^{3}-10^{4}$). We derive the SNR of a two-arm heterodyne interferometer based on balanced photodetection and apply the model to the proposed scheme, using measurements from a single-spectral-channel, all-fiber interferometer operating at 1.56 micrometer over an 8 nanometer bandwidth. We experimentally demonstrate an SNR exceeding 2 for a spectral flux density of 188 pW/nm, with an integration time of 0.4 ms. Scaling the integration time and number of spectral channels suggests that fringe visibility of the brightest H-band stars could be achieved with 1 m$^2$ telescopes within the typical atmospheric coherence time. These results represent a significant step toward broadband, scalable heterodyne interferometers, demonstrating the potential of ultrafast laser and telecommunications technologies for astronomical interferometry in the J+H bands. By combining broadband spectral multiplexing with numerical correlation, the architecture also opens a route to direct spectro-imaging without an additional spectrometer.
Read the full abstract
Distributed Computing
Great Expectations: Benchmarking the Real-World Performance of RVV 1.0 in HPC
Following the ratification of the RISC-V Vector Extension (RVV 1.0), new commercially available silicon has been adopting the extension. This paper revisits the question of RISC-V viability for High-Performance-Computing (HPC) by benchmarking the latest RVV 1.0-capable hardware (SiFive X280 (Tenstorrent Blackhole), SpacemiT X60 (K1) and X100/A100 (K3), and T-Head C920v2 (Sophon SG2044)). We assess these platforms using standard HPC benchmarks (BLAS, FFTW, HPL, HPCG) and synthetic workloads (STREAM, FMA throughput) and compare them to a state-of-the-art HPC ARM64 chip (NVIDIA Grace). Our findings show that while RVV 1.0 delivers significant performance improvements over scalar execution, hardware-specific implementation challenges remain. We detail these performance characteristics and discuss the remaining hurdles for RISC-V, including RVV, to become a mainstay in the HPC landscape.
Read the full abstract
Computer Vision
Ex-Sim(3)-Reg: 2D-3D Correspondence Pruning via Extended Sim(3) Registration
Learning-based image-to-point-cloud (I2P) registration has garnered increasing attention in recent years. Nevertheless, existing methods still struggle with severe outliers under challenging scenarios with unseen, low-inlier, or distorted cases. A fast and robust 2D-3D correspondence pruning method is therefore highly desirable. Recently, a promising scheme lifts 2D-3D correspondences to 3D-3D correspondences using depth priors, casting correspondence pruning as a Sim(3) registration problem. However, depth priors estimated from monocular images are inherently noisy, which undermines the reliability of this scheme. In this paper, to explicitly model non-negligible depth noise, we reformulate correspondence pruning as an extended Sim(3) registration problem and propose a simple yet effective pruning algorithm termed Ex-Sim(3)-Reg. We further provide a theoretical analysis to justify the effectiveness of our method. Extensive experiments on the 7-Scenes, RGBD-V2, ScanNet, and TUM datasets demonstrate that Ex-Sim(3)-Reg achieves up to 24.7% improvement in registration recall over state-of-the-art baseline methods. Code is released at github.com/anpei96/ex-sim3-demo
Read the full abstract
High Energy Physics (Experiment)
Characterizing Single-Signal Events from Atmospheric-Neutrino Neutral-Current Interactions in Large Liquid Scintillator Detectors
Neutral-current interactions of atmospheric neutrinos in large liquid scintillator detectors offer a new opportunity to study single-signal events (hereafter singles), characterized by a prompt energy deposition on the MeV-to-GeV scale and no identified delayed signal. In this work, we systematically investigate the model dependence of atmospheric-neutrino singles due to the primary neutrino-nucleus interaction, residual-nucleus de-excitation, and secondary interactions in the scintillator. Our results show that the dominant model dependence originates from the primary neutrino-nucleus interaction, especially for neutral-current processes on carbon, whereas de-excitation is essential for the singles selection yet leads to relatively small spectral variations among realistic models. Secondary-interaction effects are also subdominant overall. We further present the predicted event rates and prompt-energy spectra for neutral-current singles, along with the charged-current contribution. Separately, we estimate the low-energy contribution from elastic scattering of sub-\SI{100}{\MeV} atmospheric neutrinos on free protons. These results highlight the physics potential of current and future large liquid scintillator detectors, such as the Jiangmen Underground Neutrino Observatory, to study atmospheric-neutrino singles, probe neutrino-nucleus interaction models, and improve background estimates for rare-event searches.
Read the full abstract
Data Structures and Algorithms
A Tight Analysis of Khatri-Rao Oblivious Subspace Embeddings
We study random sketching matrices with Khatri-Rao structure. In particular, we consider the Khatri-Rao product (i.e., column-wise tensor product) $A_1\odot\cdots\odot A_d \in \mathbb R^{(n_1 \cdots n_d) \times m}$ of random matrices $A_i \in \mathbb R^{n_i \times m}$ whose columns are isotropic, independent and sub-Gaussian (e.g., Gaussian matrices). Khatri-Rao sketching matrices are widely applied in randomized algorithms for linear algebraic computation and data analysis, when the input data has tensor structure that allows for fast multiplication with $A_1\odot\cdots\odot A_d$. However, existing theory is not able to fully explain their performance in practice. In particular, despite significant attention, our best bounds for the important oblivious subspace embedding property with Khatri-Rao matrices lag behind what is achievable with standard unstructured matrices. For embedding a $k$-dimensional subspace to $(1\pm \epsilon)$ error, Bujanović et al. \cite{bujanovic2025subspace} prove that sketching dimension $m = O(k^{3/2}/\epsilon^2)$ suffices in the special case of $d = 2$. Their dependence on $k$ is weaker than the tight bound of $O(k/\epsilon^2)$ known for unstructured sub-Gaussian sketching matrices. In this work, we close this gap, showing that $m = \tilde O(k/\epsilon^2)$ suffices for subspace embedding with a Khatri-Rao sketching matrix with any fixed order $d$. Our proof is simple, leveraging just two basic properties of the Khatri-Rao sketching distribution: 1) the columns of $A_1\odot\cdots\odot A_d \in \mathbb R^{(n_1 \cdots n_d) \times m}$ are independent and isotropic, and 2) each column of $A_1\odot\cdots\odot A_d \in \mathbb R^{(n_1 \cdots n_d) \times m}$ satisfies a weak Johnson-Lindenstrauss type moment property.
Read the full abstract
Systems and Control
Managing Inherent Risk: On the Conceptualization of Risk in Defense Systems
Certain defense systems are, by nature, deployed in a civilian environment in order to serve a defensive function for that environment. However, the risk involved with their deployment and operation poses a challenge for the public acceptance of these systems. Compared to safety engineering for civilian systems, the risk constellation is quite different. While reducing risk of safety-critical systems is generally desirable, defense systems are required to produce intended mission effects, which may include harm to an attacking target. In both cases, not all risk can be eliminated. The complex risk constellation of defense systems has implications for the systems' designs. We compare the concepts of risk in existing standards from both the civilian and the military domains. An extended constellation of risks needs to be considered, including risk caused by external threats to security. By including this risk constellation in public communication about defense systems, we aim to stimulate a productive debate.
Read the full abstract
Image and Video Processing
Do Medical Vision Models Reason About Anatomy? Probing the Spatial Inductive Biases of Learned Visual Representations
Interpreting a CT scan means comparing structures on either side, judging how far apart organs sit, and knowing where each one belongs. Medical vision encoders are evaluated on diagnostic accuracy, or through assembled multimodal systems where a failure is hard to attribute, so it remains unclear whether their representations support any of this. We construct SPAR-Bench, eight probes over multi-organ abdominal CT that separate coordinate localization, relational reasoning, and spatial queries, and apply them to five architectural configurations and three medical foundation models, frozen and finetuned. Probes that ask for a comparison within the slice stay at chance, and neither pretraining scale, finetuning, nor architecture closes the gap. Probes that appear solved in domain fall to chance under zero-shot transfer, indicating that their accuracy reflects recall of canonical anatomy rather than computation over the image. Reading the same frozen features with a pooled head rather than the full set of tokens moves relational recovery from 0.7% to 67.8%, so pooled probing understates what a representation holds. Questions the encoders answer well are answered at chance by four open-weight MLLMs. Our results suggest these encoders carry a map of where organs usually lie, and little of the machinery for comparing structures within a particular patient. Code and data will be available at https://spar-bench.github.io.
Read the full abstract
Nuclear Theory
The iconic $^{238}$U: ab initio nuclear structure theory towards the limit of the periodic table
The ab initio description of heavy and superheavy nuclei constitutes one of the holy grails of nuclear theory, bearing on the synthesis of the heaviest elements and the limits of nuclear stability. Over the last fifteen years, many-body expansion methods, whose numerical cost scales polynomially with system size, have extended first-principles calculations to medium-mass nuclei and a few spherical closed-shell heavy systems. The largest portion of the nuclear chart is however composed of heavy deformed doubly open-shell nuclei and has remained completely out of reach. This is due to two major obstacles: (i) the huge computational cost of beyond mean-field calculations in very large single-particle bases, and (ii) a dubious collapse of the mean-field energy at large prolate deformation. While a highly efficient numerical implementation of the novel deformed self-consistent Green's function formalism removes the first difficulty, the second is cured by the inclusion of many-body correlations beyond the deformed mean field. Presenting the first ab initio calculation of the iconic $^{238}$U nucleus, this work brings the upper-end of the nuclear chart within reach of theoretical predictions based on first principles.
Read the full abstract
Robotics
Stay Seated: Learning Omnidirectional Humanoid Locomotion on a Passive Mobile Chair with Casters
Humanoid robots with quasi-direct-drive actuators continuously generate joint torque while standing, whereas seated humans delegate weight support to chairs during desk work. As a first step toward seated loco-manipulation, we study omnidirectional seated locomotion on a passive mobile chair, requiring unfixed pelvis-seat contact and intermittent foot-floor propulsion of the robot-chair system. We extend a standard standing velocity-tracking environment with a passive-chair model, seated-state rewards, critic-only chair observations, and task-tailored contact settings. The policy is learned without motion-imitation rewards; its actor uses only proprioception and velocity commands, without contact sensing or chair states. In random-command evaluation, the policies tracked omnidirectional commands through nearly all 20-s rollouts, and the best seated policies could outperform the Standing policy in velocity tracking. Across four training seeds, a $2^3$ full-factorial comparison of symmetry regularization (SY), foot-slip regularization (FS), and command curriculum (CC) showed that FS reduced CoT but increased tracking error and that some FS-only policies converged to stationary local optima. Combining FS with either SY or CC avoided this failure without retuning FS, while SY improved bilateral leg symmetry during longitudinal motion. Direction-resolved analysis showed CoT ordered backward $<$ lateral $\ll$ forward, with planted-leg extension in backward and lateral motion and knee flexion following heel contact in forward motion. The learned policy achieved zero-shot sim-to-real transfer to a Unitree G1 and generated omnidirectional seated locomotion.
Read the full abstract
High Energy Physics (Experiment)
Next generation tracking and vertexing detectors
Precise and efficient track and vertex reconstruction is essential to exploit the physics potential of collider experiments. The requirements of future tracking systems are determined by the collider type and its collision environment, required measurement precision, and beam structure. This contribution reviews the requirements and challenges of vertexing and tracking detectors at future $e^+e^-$, $e^-$-hadron, $\mu^+\mu^-$, and hadron colliders. Several common trends emerge across the different collider types. Tracking systems require increasingly precise spatial measurements, low-material designs, and, in some cases, integrated particle identification capabilities. Monolithic active pixel sensors are currently the leading option for vertex detectors at $e^+e^-$ and $e^-$-hadron colliders. Tracker concepts range from gaseous detectors, which provide many measurements per track and can achieve very low material budgets, to silicon and scintillating-fibre trackers, which provide fewer but more precise measurements and can tolerate higher hit rates. At 10 TeV parton centre-of-mass colliders, precision timing throughout the tracking system is needed for beam-background rejection or pile-up mitigation. For future hadron colliders specifically, radiation tolerance beyond that demonstrated by existing sensor technologies is required. Ultimately, meeting the vertexing and tracking requirements of future colliders will require substantial R&D and the integrated optimisation of sensors, front-end electronics, readout, cooling, powering, and mechanics.