Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Sunday 13 September

Quantum Gases

Fast dynamical control of quantum droplets via Feshbach resonances

We propose a variational shortcut-to-adiabaticity scheme for the fast dynamical control of one-dimensional quantum droplets in ultracold Bose-Bose mixtures. The control is implemented through time-dependent mean-field (MF) and beyond-mean-field (BMF) nonlinearities, which can be adjusted by tuning intra- and interspecies scattering lengths near Feshbach resonances. Using a bright-droplet variational ansatz, together with inverse engineering, we derive time-dependent interaction protocols that connect prescribed initial and target self-bound states while suppressing residual excitations. We analyze three representative settings: simultaneous control of the MF and BMF terms, control with fixed BMF nonlinearity and time-dependent MF interaction, and control with fixed MF nonlinearity and time-dependent BMF interaction. For the constrained cases, additional variational degrees of freedom are introduced to optimize the protocols while respecting the imposed restrictions. Direct numerical simulations of the extended Gross-Pitaevskii equation confirm final fidelities exceeding $0.99$ on short time scales, and show that the optimised protocols are robust against finite calibration errors of the nonlinear control strength. Our results provide a route toward fast state-to-state manipulation of self-bound quantum fluids and may be useful for controlled matter-wave engineering in ultracold mixtures.
Read the full abstract

All authors Jing Li, Thomas Fogarty, Thomas Busch, Andreas Ruschhaupt

Numerical Analysis

Computer-assisted local maximality of regular polygons for torsional rigidity

We study torsional rigidity as a function of the labeled vertices of a convex polygon. Starting from the distributed second shape derivative, we derive the Hessian with respect to vertex coordinates. At a regular polygon, dihedral symmetry makes this matrix block circulant in radial-tangential coordinates, reducing its spectrum to the eigenvalues of Hermitian matrices of order two. We also derive an exact second-variation Galerkin identity and guaranteed functional residual majorants. Finite elements approximate the PDE solutions entering the Hessian, and FLINT/Arb provides the interval arithmetic needed for certification. In the scale-invariant setting, we certify exactly four zero eigenvalues generated by similarities and $2n-4$ strictly negative eigenvalues for $5\leq n\leq25$. The regular polygons in this range are therefore strict local maximizers, modulo similarities, of torsional rigidity divided by area squared. We prove broken regularity of the first and second material derivatives at each fixed regular polygon, and deduce an $O(h^2)$ error bound for the exact Galerkin Hessian and its eigenvalues on meshes fitted to the coarse fan.
Read the full abstract

Software Engineering

Enhancing Automated Unit Test Generation for NLP Libraries Using Large Language Models

Automated unit test generation tools like EvoSuite perform well on general-purpose software but often struggle with domain-specific software such as Natural Language Processing (NLP) libraries, where inputs must follow semantic, syntactic, and structural constraints. Large Language Models (LLMs) can generate domain-relevant test code, but tests produced by LLMs alone often fail to compile or achieve sufficient coverage. We propose LLMSuite, a hybrid test generation framework that integrates self-refinement prompting with class-level LLM reasoning into the search-based testing process. In this mechanism, the LLM iteratively improves its test snippets based on feedback from previous generations. This enables the model to produce increasingly precise, domain-consistent code fragments that steer the evolutionary search toward exercising complex and otherwise hard-to-reach behaviors. When no objective improves over multiple generations in the underlying evolutionary algorithm, these refined snippets are parsed and injected into EvoSuite's population to expand the search space. To support our evaluation, we constructed a new dataset comprising 100 classes drawn from five widely used Java NLP projects. We also re-implemented CodaMOSA, a recent hybrid SBST-LLM technique, in Java to enable a direct comparison. Across this dataset, LLMSuite improves branch and line coverage by approximately 10% and 8%, respectively, and achieves an 11% higher mutation score than CodaMOSA-J. Compared to EvoSuite, LLMSuite yields roughly 15% higher branch and line coverage and 5% higher mutation score. Against an LLM-only baseline, it improves structural coverage by 36% and mutation score by about 24.7 percentage points. Finally, LLMSuite complements manually written test suites by exercising domain-specific behaviors that are often left untested.
Read the full abstract

Robotics

Language-Guided Representation Learning for Robust Cross-Sensor Material Recognition

Robots need touch to manipulate objects safely and reliably, as many properties, such as softness, texture, and contact stability, are hard to infer from vision alone. However, vision-based tactile sensors yield different observations of the same material due to variations in optics, elastomer properties, and illumination, leading to poor generalization when trained on a single or multiple sensors. We propose a language-guided distillation framework for learning sensor-robust tactile representations. Language encodes high-level semantic properties of touch (e.g., rough, soft, slippery) that remain invariant across sensing hardware, providing a natural sensor-agnostic supervisory signal. We construct a 39K-sample touch-language dataset with human-annotated material labels and train a tactile encoder to align sensor-specific tactile images with language embeddings in a shared semantic space. We evaluate our approach for few-shot learning and cross-sensor transfer and benchmark it on six existing tactile datasets. Our method achieves 95% accuracy in the 100-shot setting, improves cross-sensor transfer by an average of 13.3% accuracy, and yields up to 19% accuracy gains across six existing tactile datasets. These results demonstrate that language-guided distillation enables scalable and hardware-agnostic tactile representation learning. Code and dataset are available at https://mashood3624.github.io/Language_Tactile/
Read the full abstract

All authors Mashood M. Mohsan, Muhayy Ud Din, Binzhao Xu, Ahmad Abubakar, Irfan Hussain

Rings and Algebras

Fast tensor transforms and ring-valued orthogonal matrices: an application to cryptography

We present a generalization of the Fast Fourier and fast Walsh transform algorithms to tensor products of $n$ arbitrary $q\times q$ matrices over a commutative ring, reducing the cost of applying such a tensor product from $q^{2n}$ to $nq^{n}$ ring operations. We then give an explicit construction of square orthogonal matrices over a commutative unitary ring, starting from a prescribed first row, and specialize this construction to ${\mathbb Z}/256{\mathbb Z}$. Combining these two ingredients, we propose a symmetric cryptosystem in which the secret key determines~$n$ orthogonal matrices over ${\mathbb Z}/256{\mathbb Z}$ whose tensor product encrypts a block of $q^n$ bytes; encryption and decryption both exploit the fast tensor product algorithm. We give three examples of implementations.
Read the full abstract

Group Theory

Essential quotients of the cohomology of products of symmetric and alternating groups

We calculate the quotient of the mod-two cohomology of a product of symmetric and alternating groups by the ideal of negligible elements, namely those that restrict trivially to any order-two subgroup. This quotient arises in the study of cohomological invariants of fields, as by work of Serre the ideal of negligible elements coincides with the ideal of elements that pull back trivially in Galois cohomology. Our calculations answer questions recently posed to us by J-P. Serre, whose recent results we build on. It is a pleasure to share these results on the occasion of his 100th birthday.
Read the full abstract

Cryptography and Security

The Stochastic Deputy: Structural Tenant Isolation for Tool-Using LLM Agents

Multi-tenant tools commonly accept a tenant identifier and validate it against the caller's entitlement. For a large language model (LLM) agent, that pattern delegates resource selection to a process whose context may contain attacker controlled instructions. We formalize this stochastic deputy problem and present a structural defense: remove tenant identity from the Model Context Protocol (MCP) tool schema, bind scope to a verified credential, and enforce it below the agent. In a 373-trial ablation across eight model configurations and two transports, a correctly validated tenant parameter served every out-of-scope attempt: 26 of 26, or 26 of 41 plausible-pretext trials overall. With the parameter removed, no tool signature could express the read. Twelve of 56 trials instead escaped the interface by forging writable scope, showing that interface invariance requires cryptographically protected context. On a production dataset containing multiple GBs of data, set-valued scope caused a measured $57\times$ latency ratio under function-wrapped membership predicates; a JSON_TABLE lateral join recovered index access where the tenant key was indexed. The evaluation also exposes deployment limits, including an entitlement-size query-planner cliff and incomplete index coverage. The result is a tenant-isolation argument that depends on enforceable interfaces and credentials rather than model compliance.
Read the full abstract

All authors Mirza Samad Ahmed Baig, Syeda Anshrah Gillani, Asher Ali, Muhammad Hamzah Siddiqui

Computation and Language

Func-R1: Incentivizing Mathematical Function Reasoning in Multimodal Large Language Models

Performing deliberate mathematical reasoning in visual contexts is a hallmark of advanced Multimodal Large Language Models (MLLMs) and requires a sophisticated synthesis of perceptual grounding and symbolic logic. However, in the realm of mathematical functions, our investigation reveals a critical modality interference phenomenon: even advanced models, while performing textual computational reasoning, tend to disregard or misinterpret essential visual cues. To address this challenge, we propose Func-R1, which synergistically harmonizes precise visual perception and rigorous logical reasoning. Concretely, built upon an explicitly decoupled architecture, we employ a hierarchical post-training framework to progressively identify critical visual evidence and conduct in-depth theoretical reasoning. Furthermore, the Perception-Aligned Theoretic Optimization (PATO) strategy is proposed to steer policy updating towards internalizing fundamental theoretical properties while dynamically rectifying heterogeneous visual information throughout the reasoning process. Extensive experiments across diverse benchmarks demonstrate that Func-R1 delivers the optimal performance among open-source MLLMs, even surpassing GPT-5 with an 8.4% improvement on MathVerse's function-oriented tasks.
Read the full abstract

All authors Mingze Yin, Xiaohan Wang, Dian Li, Haichao Yao, Yilin Zhao, Youjun Chen, Gang Liu, Jintai Chen, Yiheng Zhu, Chang-Yu Hsieh, Aimin Pan

Machine Learning

Privacy Preserving Gossip Learning

We propose a decentralized privacy-preserving learning algorithm in which each agent holds a single private sample and a shared model. Samples are learned sequentially, and each update must preserve the endpoint mappings at previously learned samples while protecting private data. This gives each agent three roles: (i) a learner that updates the model parameters, (ii) a teacher whose sample is learned at the current iteration, and (iii) a protected agent whose sample has already been learned. We build on Tuning without Forgetting (TwF) method to preserve previously learned mappings and show that TwF provides an indistinguishability guarantee for the learner whenever the set of protected agents contains another sample with the same label. For the teacher, we formulate a minimax optimal control problem that models the differential privacy noise as a worst-case disturbance to prevent performance loss while maintaining the same level of privacy for the gradient. For the protected agents, we compute the projections locally and aggregate them using a private push-sum gossip protocol. We prove geometric convergence of the decentralized gossip algorithm and of the distributed projection for TwF.
Read the full abstract

Optics

Sub-kHz linewidth integrated extended-DBR Pockels lasers using lithium tantalate

Tunable low-noise lasers are crucial components employed in modern metrology. Advances in photonic integrated circuit technology have provided a new platform for compact integrated lasers with large output powers, frequency-agile tuning, and narrow linewidths. For instance, lithium niobate extended-DBR lasers can yield output powers in the tens of mW, GHz-level tuning ranges, and tuning rates in the hundreds of MHz. However, noise levels achievable in other integrated laser designs remain challenging to reach. Here, we address this challenge by implementing extended-DBR lasers in lithium tantalate, thereby achieving intrinsic linewidths as low as 24 Hz, output powers of 10 mW, with tuning features on par with those of lithium niobate. The extended-DBR laser is assembled with modern packaging solutions to improve its robustness and demonstrate long-term stability with a free-running frequency drift within a range of 232 MHz over 19 hours. These benefits, in conjunction with lithium tantalate's suitability for volume manufacturing, promise to considerably expand accessibility to a new generation of widely tunable and low-noise integrated lasers.
Read the full abstract

All authors Hugo Larocque, Zhuoya Yuan, Zihan Li, Giovanni Scarioni, Annika Schoels, Jiale Sun, Anat Siddharth, Xin Ou, Simone Bianconi, Tobias J. Kippenberg

Systems and Control

Comparative Evaluation of MILP, MPC, and Reinforcement Learning for Commercial Battery Dispatch Under Time-of-Use Tariffs

Battery energy storage systems (BESS) paired with rooftop photovoltaics (PVs) can deliver measurable cost savings under time-of-use (TOU) electricity tariffs; however, the relative performance of model-based and model-free dispatch strategies remains insufficiently benchmarked on full-year, real-world commercial datasets. This paper presents a full-year (2023) comparative evaluation of three BESS dispatch approaches using data from a commercial PV installation operating under a TOU tariff. The examined strategies include: (i) a mixed-integer linear programming (MILP) formulation with perfect foresight, providing an oracle performance benchmark under the assumed model; (ii) a model predictive control (MPC) scheme based on a day-ahead persistence forecast, representing a low-complexity deployable approach; and (iii) a soft actor-critic (SAC) deep reinforcement learning agent trained under causal information constraints. The MILP benchmark achieves an annual cost reduction of 24.6% relative to a no-storage baseline. The persistence-based MPC approach recovers 99.2% of this benchmark using only prior-day data. In contrast, the evaluated SAC agent yields an annual cost higher than the no-storage baseline. This outcome is analyzed in the context of known challenges in reinforcement learning for energy systems, including limited observability and reward design. Overall, the results indicate that, for the studied dataset and tariff structure, persistence-based MPC captures nearly all achievable economic benefits under practical deployment constraints, whereas the considered RL configuration does not yield competitive performance under the same information limitations.
Read the full abstract

All authors Hafiz Majid Hussain, Wajiha Samar, Lurian Klein, Pedro Nardelli

Distributed Computing

CATS: A Carbon-Aware Task Simulator for Reducing AI Data Center Emissions

The rapid rise of generative AI is accelerating cloud data center expansion, with electricity demand projected to double by 2026. Because carbon-intensity varies by more than 5.5x across grids and times of day, where and when inference tasks execute significantly affects operational emissions. We address this issue with three aspects in this paper. First, we compile a global alignment dataset unifying 140 operational and planned cloud regions across 8 major providers with five-minute carbon-intensity traces for 145 grid regions from 2022 to 2024, revealing that 50% of current sites lie in medium-to-high carbon-intensity grids, indicating a siting-carbon mismatch and unrealized carbon reduction potential. Second, we develop CATS (Carbon-Aware Task Simulator), a flexible trace-driven framework that profiles six AI inference tasks across multiple GPU types, synthesizes realistic diurnal curve, geographical and task mixes, and SLA constraints, and evaluates spatial and temporal schedulers against two baselines while reporting comprehensive metrics including carbon emissions, energy consumption, runtime, queue delay, and hardware utilization. Third, we quantify achievable CO2 savings under realistic constraints: in a 24-hour trace with 600,000 tasks at fleet utilization of 0.37, spatial shifting reduces CO2 by 38.4% versus speed-first baseline, while temporal shifting yields 16% savings with bounded SLA violations at 3.27%. These results advocate locating future data centers in low carbon-intensity grids and demonstrate that carbon-aware scheduling on today's fleets can achieve substantial operational emissions reduction.
Read the full abstract

Statistical Methodology

Three Case Studies of Two-stage MCMC for Fast Bayesian Inference of Large Spatio-temporal Data

High dimensional spatio-temporal models can quickly run up against computational limitations. Recursive or multi-stage Bayesian algorithms are one way to address this computational challenge. Here we consider an increasingly used two-stage algorithm. The first stage models locations independently and in parallel across space. Resampling particles from this stage-one model with Metropolis-within-Gibbs methods and suitably computed acceptance ratios can impose spatial dependence across locations at a low computational cost, while targeting the same posterior distribution as the single-stage MCMC algorithm at a fraction of the overall computational cost. In this paper we show three complete examples of how two-stage MCMC algorithms can be used to efficiently fit Bayesian spatio-temporal models to large datasets. Specifically, we consider: a spatio-temporal self-exciting count model on areal data utilizing intrinsic conditional autoregressive (ICAR) prior distributions; a spatio-temporal model of point-referenced data using a stationary, isotropic distance-based covariance function; and a binary model fit to data on a spatial lattice utilizing a latent Gaussian process to capture all spatio-temporal dependence. In each example, we define the model and describe the corresponding two-stage MCMC approach. We then compare the resulting posterior samples and computational efficiency with those obtained using a standard single-stage MCMC algorithm. While varying across the three examples and numerous parameters, the two-stage approach often achieves roughly an order of magnitude higher computational efficiency, with the two-stage and single-stage algorithms producing closely agreeing posterior samples.
Read the full abstract

Computation and Language

Pull: Lazy Materialization of Working Memory for Stateful LLM Conversations

As LLM conversations grow to hundreds of turns, full-context injection incurs $O(N^2)$ cumulative token costs, while lossy summarization or hard truncation irreversibly discards historical state. We propose Pull, a session router that maintains an addressable metadata directory via a local, deterministic Purifier (zero LLM calls, millisecond-level latency). At query time, the LLM lazily materializes only the turns it needs; unmaterialized turns remain accessible but collapsed. Unlike irreversible compression, Pull's materialization is reversible; subsequent queries can expand any collapsed turn. On LoCoEval (128 conversations, 12,780 turns), Pull reduces per-query context tokens (Phase 2) by 75.1 percent on single-hop tasks with equivalent quality ($\Delta = -0.002$, n.s.) and by 72.0 percent on multi-hop tasks with no quality loss ($\Delta = +0.017$). A controlled routing benchmark (7,831 queries x 10 methods) shows that entity lifecycle tracking is empirically a prerequisite for distance-independent routing. On BEAM 1M (14 conversations, 263 questions), Pull improves F1 by +55.2 percent over a truncation baseline.
Read the full abstract

Statistics Applications

Zero-Inflated Model Lab: An Interactive Shiny Application for Modelling Count Data with Excess Zeros

Count data often contain a large number of zeros in ecological and environmental research, arising from factors such as true species absence, imperfect detection, or the rarity of certain events. Choosing and interpreting suitable statistical models, like Poisson, Negative Binomial, zero-inflated, or hurdle models, can be difficult for non-experts because of the models' assumptions and diagnostic requirements. To address this, we introduce an interactive web application built in R with the Shiny framework that helps users analyse, compare, and interpret count-data models that may exhibit zero inflation. The application enables users to upload datasets, explore distributions and relationships among variables, and fit a variety of models including Poisson, Negative Binomial, zero-inflated, and hurdle approaches. It incorporates tools for model comparison using information criteria, visualisation of coefficient estimates and confidence intervals, assessment of variable importance, and diagnostic checks based on simulated residuals. Importantly, the app provides clear visualisations of both the count-generating and zero-generating processes, making it easier to communicate components that are typically challenging to interpret. To improve accessibility, the tool offers guided explanations of outputs and diagnostics, making it valuable for both research applications and teaching. A case study using environmental count data illustrates how the application helps users identify zero inflation, choose appropriate models, and gain insight into the ecological processes underlying the data. Overall, the application narrows the gap between advanced statistical methods and practical analysis, supporting reproducible workflows and enhancing the clarity and interpretability of models for zero-inflated count data.
Read the full abstract

Signal Processing

A Novel Pulse Radar Framework for ISAC-FD-enabled URLLC Systems

We propose a novel pulse radar framework for integrated sensing and communication (ISAC) systems supporting full-duplex (FD) ultra-reliable low-latency communication (URLLC). Motivated by the stringent delay and reliability requirements of sixth-generation (6G) URLLC services, our framework integrates pulse-based radar sensing with sporadic packet transmissions for URLLC users while accounting for residual self-interference (SI) inherent in FD systems. We adopt a time-structured approach in which the silent intervals of the radar pulse are opportunistically exploited for communication. A key focus is minimizing the total energy consumption of the base station, which is critical for sustainable radar-assisted wireless networks. To this end, we jointly optimize the sensing pulse width, beamforming vectors, and URLLC scheduling while ensuring communication and sensing quality-of-service (QoS) constraints. We formulate a non-convex mixed-integer optimization problem addressing sensing and communication requirements jointly. Sensing performance, quantified via the Cramer-Rao bound (CRB), is reformulated using the Schur complement. Finite blocklength capacity approximations capture the URLLC constraint, while probabilistic constraints are modeled using cumulative distribution functions. The original non-convex problem is decomposed into two sub-problems via an alternating optimization algorithm. Simulation results reveal important trade-offs between sensing time, energy consumption, and residual SI. Our proposed method improves system performance while explicitly accounting for SI, and demonstrates improved URLLC reliability with reduced energy consumption. The results show that proper design of the sensing duration and FD scheduling yields a flexible ISAC framework capable of robust operation even under strong interference.
Read the full abstract

All authors Atefeh Rezaei, Ata Khalili, Falko Dressler, and Robert Schober

Computation and Language

How broad is that claim? Mapping Generalisation in NLP Research

Generalisations are common in scientific communication, even though they are semantically ambiguous. An automated method is needed to identify and categorise claims according to their level of generalisation, in order help detect an over-reliance on generalisations and possible misrepresentations of scientific findings. We introduce a comprehensive taxonomy of generalisations in the scientific domain, NLPGenX, which labels claims according to their level of generality and framing within the text. We operationalise this taxonomy with an LLM-powered framework, NLPGenA, that automatically classifies sentences from scientific articles into 5 different generalisation classes. We validate our framework with human annotators and use the framework to construct a large-scale dataset of NLP papers annotated according to generality, with auxiliary labels for hedging and vague descriptors (NLPGens). We use NLPGens to analyse the use of generalisations in NLP papers across multiple venues and subdomains, and to examine associations with citation counts, hedging, and vague descriptors.
Read the full abstract

Classical Analysis and ODEs

Erdős's Robust Polynomial Interpolation Problem: the Optimal Exponential Scale

We determine the optimal exponential scale in Erdős's robust polynomial interpolation problem and identify the leading exponential coefficient for Chebyshev–Lobatto grids. Given $C>0$ and $0\le\rho<1$, put $H=C/(1-\rho)$. We prove that every configuration of $n\ge n_0$ nodes in $[-1,1]$ admits sign data for which every polynomial of degree at most $(1+\epsilon)n$ and uniform norm at most $C$ has error greater than $\rho$ at more than $\epsilon n$ nodes. One may choose $\epsilon\ge e^{-A(1+H)}$ and $n_0\le e^{A(1+H)}$, where $A$ is an absolute constant, and a matching upper bound shows that the exponential order is optimal. For the same obstruction restricted to Chebyshev–Lobatto grids, the optimal parameter $\epsilon_{\mathrm{Ch}}(C,\rho)$ satisfies $\log(1/\epsilon_{\mathrm{Ch}}(C,\rho))=\frac{\pi}{2}H+O(\log(H+1))$ as $H\to\infty$. The proofs combine finite interpolation estimates in Bernstein spaces with periodic sign constructions and averaging. We also establish obstructions for random signs and stability under angular perturbations of the nodes.
Read the full abstract

Nuclear Theory

Stability and Structural Properties of Hot Quark Stars within Perturbative QCD

The hypothesis of strange quark matter (SQM) and the possible existence of strange stars have been extensively investigated within the thermodynamic bag model, typically employing the free Fermi gas approximation with or without perturbative QCD corrections at zero temperature, where quark confinement is modeled by the bag pressure. In this work, based on the perturbative inclusion of quark mass effects, we develop a thermodynamically consistent equation of state (EOS) for SQM at finite temperature, incorporating perturbative corrections up to $\mathcal{O}(\alpha_s)$ in the strong coupling constant $\alpha_s$ while ensuring full adherence to the Maxwell relations. These corrections are essential for accurately describing hot quark stars potentially formed during core-collapse events. We present results for both fixed and running couplings, using a phenomenological model to include the breakdown of the perturbative running of $\alpha_s$ at low momenta. Our results demonstrate that incorporating finite-temperature perturbative QCD corrections leads to SQM configurations that fall within the absolute stability window, with equilibrium energies per baryon lying below that of iron, the most tightly bound nucleus. Our EOS supports compact stars with masses exceeding $1.4\,M_\odot$ (and above $2\,M_\odot$ for some values of the bag constant), in agreement with current astrophysical constraints from pulsar and gravitational-wave observations.
Read the full abstract

Multiagent Systems

Loop-Back Authority in LLM Agent Teams: A Paired Experiment on Flat and Hierarchical Coordination

Does authority in AI teams improve the outcome? Organizational theory asserts that authority facilitates decision making, improving quality. Meanwhile, some nascent AI research suggests that revision under authority makes LLM output worse. Multi-agent LLM frameworks default to giving a Manager agent the authority to send a worker's output back for revision. Prior comparisons test the effect of authority using verifiable tasks. We conduct an experiment on an open-ended task, business-intelligence reporting, using a sample of 43 paired laptop products and 86 runs. Each report is written once by a hierarchical team and once by a flat team. We find that flat teams produce higher-quality reports, scoring higher on Utility (d = 0.42, p = 0.009) and Writing Clarity (d = 0.34, p = 0.030). The reports are the same length, but hierarchical team reports use 53% more hedging words such as "may" and "could", and each revision is associated with a 0.14-point drop in Writing Clarity on a 1 to 5 scale. Before any revision, the hierarchical team's first draft is indistinguishable from the flat team's report. In other words, the quality gap can be traced to revision. Authority improves quality when the Manager can verify the work, else when it can only provide feedback it has a negative effect on quality.
Read the full abstract

Analysis of PDEs

On particles and waves

This is an expository article describing the works of Yu Deng, Zaher Hani and Xiao Ma on the long-time derivation of the fluid equations from the statistics of Newtonian particle collisions.

Robotics

A Personalized Dynamic Balance Evaluation Paradigm for Hip Exoskeleton-Assisted Walking under Unexpected Ground Perturbations

Hip exoskeletons may improve recovery from unexpected gait perturbations, yet personalizing assistance remains difficult because balance is multidimensional and human-in-the-loop experiments are small-sample and noisy. We present a participant-specific composite balance cost that integrates seven biomechanical sub-metrics spanning margin of stability, center-of-mass dynamics, and whole-body angular momentum. The sub-metrics are converted to direction-aligned, dimensionless cost features, and nonnegative fusion weights are learned on the simplex. Coupled with an empirical-Bayes hierarchical model, the learned-composite selector estimates each tested condition's posterior probability of being best, P(best), and a high-probability candidate set with size $K_{0.8}$. The framework was evaluated with three participants walking at 1.1 m/s during unilateral belt-slip perturbations across 46 hip-assistance conditions. In the full-budget analysis (B = 4 repeats per condition), the selector concentrated 80% of the posterior probability within 1 to 5 of 46 conditions, compared with 2 to 12 for equal-weight fusion and 4 to 37 for principal component analysis fusion. This smaller candidate set could shorten personalization experiments and limit participants' exposure to repeated perturbations in future studies. Selected-condition trials showed lower observed composite costs than no-torque trials, with nominal p < 0.05 for P2 and P3. Leave-one-repeat-out refits yielded positive mean held-out rank correlations for all participants and moderate stability of the learned weights and candidate sets. These proof-of-concept results support participant-specific composite balance evaluation for candidate selection in perturbation-based human-in-the-loop experiments.
Read the full abstract

Sound

CCMAN: Cognitive Instability-Aware Cross-Modal Attention Network for Interpretable Temporal Biomarkers of Verbal Fluency Speech

Early detection of cognitive decline from speech offers a scalable and non-invasive alternative to conventional clinical assessment. Verbal fluency tasks are particularly informative, but most automated approaches aggregate features across an entire recording, overlooking temporal speech dynamics. We propose the Cognitive Instability-Aware Cross-Modal Attention Network (CCMAN), a transfer learning framework that learns task-agnostic cognitive speech representations from multiple memory-probing tasks before fine-tuning on a minute-long semantic and phonemic verbal fluency task. CCMAN integrates semantic, acoustic, and linguistic information through bidirectional cross-attention, gated multimodal fusion, and transformer-based temporal modelling to derive interpretable biomarkers of cognitive decline. Experiments were conducted on 165.44 hours of speech from 843 participants (498 healthy controls, 245 with mild cognitive impairment, and 100 with dementia). CCMAN achieved Macro-F1 scores of 0.81 and 0.59 for binary and multiclass semantic fluency classification, and 0.77 and 0.53 for phonemic fluency, consistently outperforming strong static and temporal baselines. Statistical analyses showed that semantic drift variance and pause variance, but not mean semantic drift, were significantly elevated in both MCI and dementia relative to healthy controls, while pause duration increased progressively over the task with the steepest slope in dementia, supporting global and progressive temporal speech instability as interpretable biomarkers. Evaluation on the independent PROCESS-2 benchmark further demonstrated the generalisability of the proposed framework, improving the baseline Macro-F1 by up to 9%. These findings support temporal speech instability as a dynamic speech biomarker for robust, interpretable, and generalisable early detection of cognitive decline.
Read the full abstract

All authors Madhurananda Pahar, Caitlin Illingworth, Dorota Braun, Daniel Blackburn, Heidi Christensen

Analysis of PDEs

Optimal location of small favourable regions for Robin eigenvalues with indefinite weights

We consider the positive principal eigenvalue of an elliptic problem with a Robin boundary condition and bang–bang indefinite weight $\kappa\mathbf 1_D-\mathbf 1_{\Omega\setminus D}$, and ask where a favourable region $D$ of prescribed small volume $|D|=\delta$ should be located. Put $\varepsilon=\delta^{1/N}$ and $\tau_\delta=\alpha_\delta\varepsilon$. We prove that there is a finite threshold $\tau_*=\tau_*(N,\kappa)$, independent of the ambient domain, such that $\delta^{2/N}\Lambda_\delta(\alpha_\delta)\to\Lambda_{\mathbb H}(\tau)$ whenever $\tau_\delta\to\tau<\infty$. If $\tau<\tau_*$, optimal small regions concentrate at the boundary. If $\tau>\tau_*$, their concentration centres move to distances much larger than $\varepsilon$ from the boundary, and after recentring and rescaling the favourable sets converge in measure to the whole-space optimal ball. At $\tau=\tau_*$, the half-space problem admits a compact boundary optimiser as well as minimising sequences escaping to infinity. In the finer regime $\tau_\delta=\tau_*+\sigma\varepsilon+o(\varepsilon)$, we determine the first-order competition between the boundary and interior configurations. Tangential symmetry of compact threshold optimisers reduces the geometric correction to mean curvature. In particular, every fixed finite Robin coefficient is asymptotically in the boundary regime. Numerical experiments illustrate the boundary–interior transition, the three cases in the first-order selection law, and the curvature-dependent boundary location; for $N=2$ and $\kappa=1$ they suggest a transition near $\tau_*\approx3.2$.
Read the full abstract

Distributed Computing

TriCalRAG: A Three-Strategy, Retrieval-Augmented Benchmark for On-Premise LLM-Based Root Cause Analysis in AIOps

Operational logs create a need for private, resource-efficient incident analysis, but aggregate detection scores can conceal severe prediction bias. We present TriCalRAG, a reproducible benchmark for log-anomaly detection with generated root-cause and remediation outputs across BGL, HDFS, Thunderbird, and OpenStack. The primary evaluation compares Qwen2.5-14B and Mistral-Small-22B, served through vLLM on one NVIDIA RTX PRO 6000 GPU (96 GB), under zero-shot, few-shot, and retrieval-augmented generation (RAG) prompting across three data-sampling seeds. We report F1, bootstrap confidence intervals, predicted-positive rates, throughput, and memory use, with DeepLog as a held-out classical baseline. Mistral-Small attains a higher macro-averaged F1 than Qwen2.5-14B (0.644 versus 0.560), whereas Qwen provides approximately twice the throughput. A separate log-probability evaluation compares raw decisions with Contextual Calibration (CC) and Batch Calibration (BC): neither correction consistently improves prediction-balance diagnostics across prompting strategies. Supplementary single-run comparisons extend evaluation to 4-bit Llama-3.1-70B via local Ollama and Claude Haiku 4.5 via Anthropic's cloud API; RAG improves F1 on all four datasets for both models. Claude's reported aggregate F1 increases from 0.566 to 0.695, while the estimated API cost rises from \$0.94 to \$2.15 per 1,000 incidents. Local deployment ablations show approximately 41-fold throughput scaling with batching and 20% lower latency with 4-bit quantization on the tested workload. These findings support retrieval as useful context for anomaly decisions, while the supplementary protocols, unvalidated explanation quality, and prediction-balance diagnostics limit broader claims about RCA accuracy and probabilistic calibration.
Read the full abstract

Computer Vision

From Visual Feedback to Textual Reviews: A Multi-Agent Vision-Language Framework for Image-Grounded Review Assistance

Visual feedback in the form of user-uploaded images and videos is becoming increasingly common in e-commerce platforms because it provides authentic evidence of product quality, defects, packaging conditions, and real-world usage. However, visual feedback alone often lacks the contextual explanations and subjective opinions necessary for informed decision-making, while many users provide limited textual feedback due to the effort required to compose detailed reviews. To bridge this gap, we introduce image-grounded review assistance, a novel task that aims to generate editable review drafts from user-uploaded product images. Unlike conventional image captioning, which focuses on objective visual description, the proposed task requires product-specific understanding, sentiment estimation, and evidence-driven review composition under challenging real-world conditions, including degraded image quality, excessive zoom-in, target ambiguity, and partial product visibility. We propose a multi-agent vision-language framework consisting of four specialised roles: product grounding, visual sentiment estimation, visual evidence generation, and review synthesis. The framework employs explicit intermediate representations, including product entities, predicted ratings, and evidence summaries, to improve interpretability and visual grounding. Experiments on a curated subset of the Amazon Reviews Electronics dataset demonstrate the feasibility of generating coherent, product-aware, and sentiment-aware review drafts from visual feedback. To the best of our knowledge, this is the first study to formulate image-grounded review assistance as a multi-agent vision-language reasoning problem, providing a practical step toward AI-assisted review authoring in e-commerce systems.
Read the full abstract

All authors Utsav Kumar Nareti, Ayush Bansal, Kumari Priya, Chandranath Adak, Soumi Chattopadhyay, Muhammad Saqib, Saeed Anwar

Analysis of PDEs

Nonconstant weakly harmonic maps with constant trace

We construct a nonconstant weakly harmonic map from a three-dimensional ball into the two-sphere with constant trace. This gives an affirmative answer to a question raised by Rivière in 1995.

Machine Learning

Refusal Reads Only a Slice of What the Model Knows: Harm-Keyed Routing and Its Exceptions Across Model Families

Alignment applied after pretraining is shallow in a measurable way: a single direction in a model's residual stream can be edited out, and the model stops refusing harmful requests. That fact says how easily refusal can be removed, not what the refusal decision was reading in the first place. We ask what it reads, and we separate that from what the model comprehends. Across four open-weight models spanning three families, moral comprehension is native to pretraining: a low-rank moral subspace crystallizes during pretraining, and alignment rotates it once without rebuilding it. The refusal gate, in contrast, is a fresh post-training construction with only a weak pretraining precursor, written into a narrow control-token channel where the refusal decision is orthogonal to the moral-judgment decision. The central result is causal and comes from one model, OLMo-3. A nested interchange rank sweep patches successively larger slices of the moral subspace between matched requests and reads how much of refusal's response transfers: as the basis widens, moral judgment keeps reading more of it, while refusal levels off at the level of a single harm direction, and about three-quarters of refusal's causal input lies outside the moral subspace altogether. Refusal reads the harm percept, not the moral content that judgment reads on the same patches. The picture is not uniform across families. Llama reads broad moral content; Qwen reads beyond the single harm cue but is unresolved at our sample size; GPT-OSS reads harm, and its refusals can be argued in either direction by its own reasoning trace. Where refusal reads only a low-rank slice and routes around the bulk of what the model knows, a rank-one edit removes it. Whether widening what refusal reads would also deepen the behavior is the open question this raises.
Read the full abstract

Software Engineering

Fabrication After Tool Failure: Tool-Augmented Agents Assert Values Their Tools Did Not Return

Tool-augmented language models are evaluated on whether they reach the right answer, not on whether they report honestly when a tool fails to supply one. We isolate this post-failure decision with a benchmark of 1,024 items spanning 16 internal-system domains and eight tool-failure types, in which a tool call is enforced and the returned payload is guaranteed to be unusable. Under a deployment-style system prompt, 14.10% of responses are dishonest: the model either asserts a value the payload cannot support or declines while citing a fabricated policy or capability limit. The rate is governed almost entirely by whether the failure is signalled. When the tool returns status:error, dishonesty is absent (0.0%); when it returns status:ok with a redacted, corrupted, stale, malformed, empty or truncated value, dishonesty reaches 45.3%. The behaviour is not an artefact of our prompts: it appears under a neutral prompt (10.17%) and under the shipped prompt of every production agent framework we evaluate, reaching 24.67% under CrewAI's, and none of the nine frameworks we audit specifies what the model should do when a tool fails. Comparing prompt-level defences, we find that the operative variable is not deference to tool output but the absence of a named failure state. Appending a single sentence that requires the model to emit retrieval_status: OK or FAILED before answering reduces dishonesty from 14.10% to 0.87%, with one item of 688 worsening against 92 improving, and transfers unchanged into three foreign agent scaffolds. The emitted flag is faithful in 99.7-99.9% of declarations, giving a runtime detector that needs only a regular expression.
Read the full abstract

All authors Arham Sethi, Arsen Kenzhebayev, Saanvi Paturi, Vatsal Raina, Vyas Raina, Ivaxi Sheth

Quantum Physics

Universal computation with magic Hamiltonians

In the conventional theory of quantum computation, universality is discussed in terms of properties of unitary gate sets. In many experimental setups, however, we instead have access to a parametrized set of Hamiltonians, which can be exponentiated for any desired time. Accordingly, we formulate a continuous analogue of universality, where adding one expensive Hamiltonian control to a cheap set of local control operators allows for universal computation. We find several concrete sets of 1- or 2-local Pauli generators $S$ and $n$-qubit “magic" Hamiltonians $H$ that together generate the full Lie algebra $\mathfrak{su}(2^n)$, with a special focus on the Ising Hamiltonian $J$. We propose a method to directly implement any unitary by exponentiating these generator sets, and give bounds on the needed time of application of the magic Hamiltonian $H$. We find that the number of applications of $H$ needed to approximate any unitary up to accuracy $\epsilon$ scales exponentially in the number of qubits as expected from the standard application of the Solovay-Kitaev theorem. We also find phase transitions in the size of the generated Lie algebras as the parameters of the Ising Hamiltonian are varied. We find an algorithmic application of the Chow/Rashevskii technique to implement unitaries corresponding to iterated commutators.
Read the full abstract