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

Saturday 12 September

Quantum Physics

Open Quantum Systems

Open quantum systems describe quantum systems that interact unavoidably with their environments. These notes introduce the physical origins of decoherence and dissipation in realistic settings, developing the theoretical framework of reduced dynamics and quantum master equations within the connection to thermodynamics in the quantum regime. Additionally, a set of relevant exercises are proposed to reinforce the acquisition of knowledge. The text equips readers with the tools to model and analyze open quantum dynamics.
Read the full abstract

Statistical Methodology

Asymptotic Theory for Restricted Maximum Likelihood Estimators in Generalized Linear Mixed Models

Developing an asymptotic theory for restricted maximum likelihood (REML) estimators in generalized linear mixed models (GLMMs) has remained an open problem for decades. In this paper, we establish the asymptotic distributions of the REML and maximum likelihood (ML) estimators for GLMMs when both the number of clusters and the cluster sizes tend to infinity. Under very mild conditions, requiring only finite-moment assumptions on the random effects rather than normality and imposing no restriction on the relative rates at which the number of clusters and the cluster sizes diverge, both estimators are proved to be asymptotically normal with an explicit block-diagonal covariance structure, and the bias-correction property of REML is established. Simulation studies support the asymptotic results, and a genetic data analysis illustrates the methodology.
Read the full abstract

Statistical Methodology

Restart Degeneration of the Swing Filter and a Simple Repair

The Swing filter extends a feasible line through its previous recording and restarts from a fitted value at the last accepted sample. We show that this inherited endpoint causes a singular loss of compression on rough input. For uniformly sampled Brownian motion at fixed tolerance, every fixed number of recording times converges to the first continuous feasibility boundary, with alternating boundary errors. The longest post-first segment tends to zero in probability. The segment-count ratio against a continuous approximation through true sampled knots diverges almost surely whenever that boundary precedes the observation horizon. For unit Gaussian increments, constrained least squares and no maximum lag, the first mean segment length has quadratic order in the tolerance $E$, the second has linear order, and every fixed mean from the third onward has order $E\log E$. We explain the logarithm through the conditional survival tail and prove a geometric bound on the subsequent approach to the stationary coefficient in the large-tolerance limit. The stationary mean satisfies $C_E\sim\gamma_{\mathrm{Swing}}E\log E$. An explicit one-dimensional kernel specifies the single coefficient $\gamma_{\mathrm{Swing}}\approx1.8120703$ and admits a $3/4$ Wasserstein contraction and convergent evaluation brackets. The decimal is not a certified error interval. A half-budget slope corridor, true endpoint chords and one-sample bridges repair the degeneration while preserving the original error bound, continuous output and constant working memory. Including bridge costs, the long-stream mean span per output segment is asymptotic to $21\zeta(3)E^2/(8\pi^2)$. Its explicit coefficient follows from the known Brownian anchored lifetime. Thus a change to the recording rule restores the quadratic scale.
Read the full abstract

Artificial Intelligence

ClinAgent: A ReAct-Based Agent for Conversational Access to Clinical Trial Information

Querying clinical trial registries remains a manual and error-prone process, requiring researchers to navigate large volumes of semi-structured data without support for natural language interaction or cross-source synthesis. To address this, we introduce ClinAgent, a conversational system based on agentic Retrieval-Augmented Generation (RAG) that enables clinicians and researchers to query clinical trial information in plain language and receive grounded, up-to-date responses across multi-turn interactions. The system centers on a Large Language Model (LLM) agent following the ReAct paradigm, which iteratively reasons over queries, selects among a set of integrated tools, and refines its actions based on intermediate outputs. These tools include a ClinicalTrials.gov search interface, a PubMed module, and a Python-based analyzer operating on a locally cached structured dataset of clinical trials. We evaluate the system using a three-phase framework assessing operational effectiveness, planning quality, tool-use efficiency, and expert qualitative judgments, comparing three LLM backends: Gemini 3.0 Flash and two variants of DeepSeek V3.2 (thinking and non-thinking). Results reveal complementary strengths, with DeepSeek (thinking mode) excelling in planning quality, while Gemini achieves the highest overall performance and strongest expert ratings. Overall, our findings highlight the potential of agentic AI systems to improve the accessibility and synthesis of clinical trial information, supporting more efficient and user-centered biomedical research workflows.
Read the full abstract

All authors Antonino Vaccarella, Riccardo Cantini, Domenico Talia, Paolo Trunfio, Marianna Talia, Rosamaria Lappano, Marcello Maggiolini

Graphics

GaussAnything: Semantic Intent-Driven Refinement of Evolving Gaussian Scenes for Standalone VR

Deploying reconstructed 3D environments on standalone VR headsets are constrained by limited compute and memory, and conventional level-of-detail policies optimize for visibility without accounting for the user's explicit inspection intent. We present GaussAnything, a native OpenXR system for intent-conditioned reallocation and progressive publication of evolving semantic Gaussian+SDF scenes. GaussAnything resolves class- or instance-level queries to persistent 3D objects and reallocates a fixed Gaussian resident budget toward the selected object while retaining global context, applying incremental, stable-identity updates coordinated with the TSDF-derived mesh through a source-epoch mechanism. Across eight scenes, an object query concentrates 88-90% of the fixed client budget onto the queried object without enlarging it, on-device rendering reproduces the host render to within a small margin (up to 36.7 dB), and the standalone client renders each stereo frame at a steady-state GPU cost of roughly 10 ms within the frame budget of standard standalone panels.
Read the full abstract

All authors Dmitrii Maliukov, Timofei Kozlov, Dmitrii Plotnikov, Miguel Altamirano Cabrera, Dzmitry Tsetserukou

Neurons and Cognition

Hierarchical emergence of network bursting in a four-cell central pattern generator model

How can a neural circuit rhythmically burst when none of its constituent neurons can endogenously do so? We address this question through a bottom-up reconstruction of a 4-cell neural circuit modeled after the swim central pattern generator (CPG) of the sea slug Dendronotus iris. We first map the intrinsic regimes of a swim interneuron (SiN) model neuron and show that slow mutual inhibition can generate anti-phase bursting in a half-center oscillator (HCO) assembled from tonic-spiking or quiescent cells. A slow–fast phase-space deconstruction explains this pairwise rhythm as a release mechanism. We then move on to CPG parametrization, in which cells 1 and 2 are quiescent, while cells 3 and 4 are tonic spikers but their isolated HCO can only exhibit tonic spiking or suppression. Bursting therefore does not arise at either the cellular or HCO level. It appears only after the two modules are assembled into the complete 4-cell network, where cross excitation, cross inhibition, and rectified electrical coupling act together to support a robust network rhythm-generation. Event-based symbolic encoding and GPU-parallel parameter sweeps show that this higher-order collective state occupies extended parameter domains rather than a single tuned point, and they quantify how the network interactions reshape those domains and the spike counts per burst. Symbolic sweeps identify the healthy range of activity regimes (periodic sequences) and transition boundaries; Lempel–Ziv complexity is used as a descriptor of aperiodic symbolic output rather than as proof of chaos or dynamical instability. Our results establish a hierarchy of rhythm generation—from intrinsic cell dynamics, through conditional HCO bursting, to bursting that emerges only in the fully assembled 4-cell CPG—and provide experimentally accessible predictions for perturbing its chemical and electrical couplings.
Read the full abstract

Machine Learning

ReH-FUSE: Reliability-Aware Hierarchical Fusion of Experts for Multimodal Emotion Recognition in Conversation

Multimodal emotion recognition in conversation (ERC) requires adapting to the instance-dependent reliability of different evidence sources. Lexical content may be decisive, vocal expression may provide complementary cues, or accurate recognition may require cross-modal interaction; fixed fusion does not explicitly account for this variation. We propose ReH-FUSE, a reliability-aware framework with dialogue-aware text, audio, and cross-modal experts. Its decision-level router first models the relative preference between text and audio and then balances the resulting unimodal mixture against the cross-modal expert. This factorization separates unimodal competition from cross-modal selection. Across three independent runs on IEMOCAP, ReH-FUSE achieves 74.34% weighted F1 and 73.11% macro F1; on MELD, it achieves 68.03% weighted F1. Controlled ablations show that learned routing outperforms uniform expert averaging and benefits from cross-modal interaction.
Read the full abstract

Computation and Language

ShopEase: A Generative AI-Based Multi-Agent Framework for Intelligent Enterprise Customer Support Using Hybrid Retrieval-Augmented Generation

Enterprise customer support systems must answer customer questions correctly, retrieve the right policy information, use customer context, and pass difficult cases to human agents when needed. This paper presents ShopEase, a Generative AI-based multi-agent framework for enterprise customer support. The system combines six components: Intent, CRM, Memory, Hybrid RAG, Escalation, and Supervisor, and uses LLaMA 3.2 running locally through Ollama for response generation. The retrieval module combines FAISS (dense retrieval) and BM25 (sparse retrieval), and six configurations are evaluated: BM25-only, FAISS-only, Fair RRF, Weighted RRF, RRF with Cross-Encoder, and Top-10 Hybrid with Cross-Encoder. Instead of using a fixed mapping between intent and policy, the policy category is decided directly from the retrieved documents. The system was evaluated on 2632 held-out customer queries across six categories: Refund, Return, Shipping, Cancellation, Damaged Product, and Unknown. FAISS-only achieved the highest accuracy of 85.37% (2247 correct predictions), closely followed by Weighted RRF at 85.07%. BM25-only achieved only 55.74% accuracy. Adding cross-encoder reranking did not improve results: RRF with Cross-Encoder reached 83.24%, and Top-10 Hybrid with Cross-Encoder reached 81.88%, while also increasing response latency. Category-level analysis shows strong performance on Shipping, Cancellation, and Return, while Unknown queries remain the main source of errors. Statistical testing using McNemar's test shows no significant difference between FAISS-only and Weighted RRF, though both perform significantly better than Fair RRF and the cross-encoder configurations. Overall, dense retrieval gives the best accuracy on this dataset, and additional reranking adds processing time without improving classification performance.
Read the full abstract

Statistics Theory

A dynamic residual measure of inaccuracy based on varextropy

In this paper, we introduce a variance-based inaccuracy measure for order statistics based on the concept of varextropy. The proposed measure provides a framework for quantifying the variability of the inaccuracy function between an order statistic and its parent distribution. We establish a transformation property of the proposed measure under strictly increasing differentiable transformations. We establish theoretical upper and lower bounds for this measure. We further develop a dynamic residual version of the proposed inaccuracy measure and establish characterization results for the underlying distribution. Furthermore, we derive bounds for the dynamic residual inaccuracy measures based on extropy and varextropy. Finally, a nonparametric estimator of the proposed measure is developed and applied to real data to assess the goodness-of-fit of candidate distributions and facilitate model selection. 1.
Read the full abstract

Computer Vision

Event-Level Emotion Recognition in the Wild Using Deep Facial Expression Analysis

Facial emotion recognition (FER) in real-world environments remains challenging due to unconstrained imaging conditions, including multiple faces, occlusions, pose variations, and complex lighting. Most existing studies focus on individual facial emotion classification and do not address the analysis of collective emotional states at the event level. This paper proposes an end-to-end pipeline for event-level emotion recognition from photographs. The approach detects faces in each image, classifies facial expressions using a deep convolutional neural network, and aggregates face-level emotion probabilities to estimate the overall emotional distribution of a public event. A comparative evaluation of several CNN architectures on the FER- 2013 and RAF-DB datasets demonstrates that transfer learning with EfficientNet-B2 trained on RAF-DB is more suitable for real-world RGB data. The proposed method is evaluated on a real-world event dataset containing 1658 images. Experimental results show stable emotion distributions across event subsets, confirming the effectiveness of event-level aggregation for emotion analysis in the wild.
Read the full abstract

Nuclear Experiment

Measurement of $\mathrm{^{75}As}(\mathrm{n},\gamma)\mathrm{^{76}As}$ reaction relevant to 0$\nu\beta\beta$ decay searches of $\mathrm{^{76}Ge}$ and astrophysical $s$-process temperatures

The cross sections and resonance structures of $\rm^{75}As$(n,$\gamma$)$\rm^{76}As$ reaction are critical to the neutrinoless double-$\beta$ (0$\nu\beta\beta$) decay searches of $\rm^{76}Ge$, the $s$-process nucleosynthesis of nuclear astrophysics, and Neutron Resonance Capture Analysis for determining the elemental and isotopic composition of archaeological and cultural heritage. We report a high-precision measurement of the $\rm^{75}As$ neutron capture cross sections from 1~eV to 1~MeV, performed at the Back-n facility of the China Spallation Neutron Source using the Time-of-Flight method. In the resolved resonance region, nineteen resonance structures of $\rm^{75}As$(n,$\gamma$)$\rm^{76}As$ reaction have been discovered for the first time, and inconsistencies between evaluated libraries has been resolved. Resonance parameters for the newly observed structures were extracted with the $R$-matrix code SAMMY. These findings will help refine the theoretical predictions of half-lives and decay constants for the double-$\beta$ decay searches of $\rm^{76}Ge$. Astrophysical Maxwellian-averaged cross sections were calculated based on the averaged cross sections in the unresolved resonance region. And the $\rm^{75}As$(n,$\gamma$)$\rm^{76}As$ reaction rates were derived over the astrophysically relevant temperature range in both the main and weak $s$-processes nucleosynthesis. The present reaction rates deviate significantly from the recent theoretical predictions, and the uncertainties are significantly reduced.
Read the full abstract

All authors Yu-Bing Li, Zhen-Dong An, Wei Jiang, Cheng Li, Yu-Gang Ma, Jie Ren, Xi-Chao Ruan, Rui-Rui Fan, Jing-Yu Tang, Xiang-Zhou Cai, Hong-Wei Wang, Chen-Chen Guo, Di Sun, Ting Liu, Jun-Heng Hu, Hao Liang

Number Theory

Prime and Nonprime Totatives: A Sharp Construction and Exact Thresholds

For \(n\ge2\), let \(A(n)=\pi(n)-\omega(n)\) and \(B(n)=\phi(n)-\pi(n)+\omega(n)\) denote the numbers of prime and nonprime totatives of \(n\), respectively, with \(1\) included in \(B(n)\). We construct an explicit injectively parametrized family \(\mathcal C_n\) of composite totatives by completing suitably restricted squarefree products of prime totatives with a larger prime totative that is the unique largest prime factor, making the parametrization recoverable. We prove \(\lvert\mathcal C_n\rvert/A(n)\ge (e^{-\gamma}-o(1))\log A(n)/\log\log A(n)\), realizing the sharp classical leading constant \(e^{-\gamma}\). For the same family, with the same defining parameters, we obtain an effective refinement with error of order \((\log\log A(n))^{-1/4}\) and absolute effectively computable constants. Classical minimal-order results and the prime number theorem show that \(e^{-\gamma}\) is optimal: no family contained in the nonprime totatives can satisfy a uniform lower bound at this scale with a larger leading constant. We also determine exact eventual thresholds. Let \(N_k\) and \(M_k\) be the least integers such that \(\phi(n)>k\pi(n)\) for every \(n\ge N_k\) and \(B(n)>kA(n)\) for every \(n\ge M_k\), respectively. We prove \(M_k\le N_{k+1}\) for every \(k\ge1\), determine \(N_1,\ldots,N_6\) and \(M_1,\ldots,M_5\) exactly, and obtain \(M_k=N_{k+1}\) for \(1\le k\le5\).
Read the full abstract

Robotics

ReWeight: Leveraging Human Data for VLA Post-Training via Demonstration Retrieval and Sample Weighting

Post-training vision-language-action (VLA) models for specific robots and tasks requires in-domain demonstrations, yet collecting diverse robot data is costly. Egocentric human demonstrations provide a scalable alternative, but directly mixing human and robot data can introduce cross-embodiment discrepancies and degrade policy performance. To address this challenge, we introduce ReWeight, a framework that incorporates human data into VLA post-training through demonstration-level retrieval and sample-level weighting. ReWeight learns a cross-embodiment visuomotor representation that combines visual observations with future actions to measure behavioral similarity between human and robot demonstrations. Based on optimal transport, it retrieves human demonstrations relevant to the target robot data and assigns larger weights to samples with smaller cross-embodiment discrepancies. We evaluate ReWeight using $\pi_{0.5}$ across eight simulation tasks and four real-world tasks under both clean and randomized settings. In simulation, ReWeight improves the average success rate of post-trained $\pi_{0.5}$ from 39% with only robot data and 44% with randomly mixed human-robot data to 57%. In the physical experimental setting, it achieves an average success rate of 68.8%, outperforming the baselines by 28.8% and 13.8%, respectively. Overall, ReWeight provides an effective paradigm for transforming abundant egocentric human experience into transferable supervision for robot learning. (Project webpage: https://reweight-vla.github.io/)
Read the full abstract

All authors Chenwei Wang, Dianye Huang, Match W.L. Ko, Chenjia Bai, Zhongliang Jiang

Statistical Methodology

Structured Covariate-Informed Empirical Orthogonal Functions for Spatio-Temporal Environmental Fields

Low-rank representations such as empirical orthogonal function (EOF) decompositions are widely used for analyzing large spatio-temporal environmental fields. However, conventional EOF identifies latent modes solely from covariance structure and does not utilize observed environmental covariates, limiting its ability to incorporate external information into low-rank representations. This study introduces Structured Covariate-Informed EOF (SCIEOF), a covariate-informed extension of EOF that bridges low-rank dimension reduction and prediction-oriented spatio-temporal modeling. SCIEOF embeds spatial and temporal covariates into the latent bases while incorporating spatio-temporal covariates through an additive component, yielding low-rank representations with latent modes informed by observed covariates. Estimation procedures are developed and evaluated through simulation studies and an application to global near-surface air temperature from the MERRA-2 reanalysis. Simulation studies demonstrate that incorporating informative covariates improves latent structure recovery and predictive accuracy, particularly when the spatial basis is appropriately specified. The advantage is more pronounced at moderate-to-large sample sizes, while methods with stronger structural assumptions remain competitive when data are limited. In the MERRA-2 application, SCIEOF achieves competitive or improved predictive performance relative to commonly used methods while providing a compact and physically interpretable low-rank representation. Overall, SCIEOF provides a flexible and computationally scalable framework for integrating structural covariate information into low-rank spatio-temporal representations, extending EOF toward predictive environmental modeling.
Read the full abstract

Artificial Intelligence

UniCAR-RL: Seeing Better before Thinking Deeper in Visual Mathematics

Multimodal Large Language Models (MLLMs) often struggle with complex mathematical visual reasoning primarily due to a lack of fine-grained perception, causing initial visual hallucinations to directly trigger cascading reasoning failures. In traditional end-to-end reinforcement learning (RL), sparse rewards fail to decouple perceptual hallucinations from logical missteps, hindering targeted perception optimization. Alternatively, fine-tuning with perception-enhanced CoT data incurs high costs and hallucinations. In this paper, we address these challenges by proposing UniCAR-RL, an annotation-free RL framework. By explicitly decoupling the optimization of perception and reasoning during the training process, it achieves isolation and optimization of both capabilities. Specifically, UniCAR-RL consists of three synergistic branches: 1) a Caption-RL branch that optimizes perception capabilities through verifier-guided reasoning validation; 2) a Reasoning-RL branch that performs logical reasoning based on a gold image description to halt cascading errors; 3) a QA-RL branch that retains native end-to-end alignment to ensure robust question-answering performance. Experiments show that UniCAR-RL substantially improves MLLMs' mathematical and visual reasoning using only raw short-answer data. Furthermore, it demonstrates strong generalization across diverse architectures and scales.
Read the full abstract

All authors Yuzhe Li, Hao Yan, Hao Wang, Xingchen Liu, Ya-Qi Yu, Jihao Wu, Minghui Liao, Wei Chen, Yuliang Liu

Statistical Methodology

Nonparametric Correlation Estimator via Solving Cubic Equations and its Application to Brain Functional Connectivity Analysis

In this paper, we propose a novel nonparametric estimator for the correlation coefficient that is based on solving a cubic equation. This approach allows for the estimation of time-varying correlation coefficients in a nonparametric framework, providing flexibility in capturing complex relationships between variables. Furthermore, we adopt the local linear smoothing technique to correct the boundary effects, which are common in nonparametric estimation. We establish the theoretical properties of the proposed estimator, including consistency and asymptotic normality, and demonstrate its performance through simulation studies. Additionally, we apply our method to analyse dynamic functional connectivity in brain networks under six frequency bands, highlighting its potential for uncovering insights into neural interactions and cognitive processes.
Read the full abstract

All authors Shenyuan Yang, Gary Green, Jian Zhang, André Gouws, Jie Li

Computation and Language

Measuring the Cost of Variety Conflation in Multilingual MT Evaluation: Adding Mozambican Xichangana, Nyanja and Sena to FLORES+

In this paper, we extend FLORES+ with Portuguese-source evaluation sets for three Mozambican Bantu varieties: Xichangana, Mozambican Nyanja, and Sena. We compare Xichangana with the existing Tsonga reference and Mozambican Nyanja with Chichewa, and evaluate NLLB-200, Google Translate, GPT, and a variant-aware NLLB model. Holding system output fixed reveals substantial reference sensitivity. On devtest, changing only the reference from Tsonga to Xichangana reduces spBLEU by 13.10 points for NLLB-200 and 15.30 for Google. On matched Nyanja subsets, replacing Chichewa with Mozambican Nyanja produces smaller but consistent reductions of 3.03 and 6.10 spBLEU, respectively. Variant-aware fine-tuning reverses this pattern on the intended targets: relative to NLLB-200, it improves Xichangana by 7.04 spBLEU and Mozambican Nyanja by 5.33 on devtest, while losing performance on the sibling references. GPT is competitive on Tsonga and Chichewa but substantially weaker on the Mozambican varieties. For Sena, the finetuned model reaches 12.64 spBLEU and 36.21 chrF++ on devtest. These findings motivate variety-aware language identifiers, references, and reporting for cross-border languages or language dialects/variants. The data is publicly available on Hugging Face at https://huggingface.co/datasets/MOZNLP/FLORES_MOZ
Read the full abstract

Machine Learning

Affinity-Aware Sharding for Delayed Tensor Parallelism

Delayed Tensor Parallelism (DTP) removes the blocking all-reduce of tensor-parallel Transformer inference. Every device adds its own partial output to its residual stream (and broadcasts it) immediately, but only gathers (receives) the other devices' partials $\delta$ modules later. A TP to DTP change therefore amounts to a real architecture change, and dense Transformer models need to be retrained or distilled after adaptation. We show that DTP breaks the permutation symmetry of neurons inside FFNs and of KV heads inside attention modules, and that this symmetry breakage makes the sharding itself a modelling decision. We show that maximising the affinity between the KV heads and the FFN neurons co-located on a device, by permuting the dense model before sharding, speeds up the distillation or retraining process. The affinity is measured with a first-order approximation of the damage that losing a head's contribution does to each neuron's output, and the co-located affinity is maximised with a coordinate-ascent optimiser that alternates an exact balanced assignment of neurons with an exhaustive search over the KV head partitions. The whole procedure takes under two minutes on one GPU for Qwen3-0.6B and Danube3-500M. On these models, at $\delta=1$, the affinity-optimised layouts reach any distillation target in about half to two thirds of the steps needed by the naive contiguous layouts, over the whole 10k-step range we tested, and every optimised seed beats every contiguous seed and all but one of the sixteen random layouts. We also show that the co-located affinity score at initialisation predicts the KL to the base model after training, across seventeen layouts ranging from anti-optimised to optimised (Pearson $-0.81$ and $-0.89$).
Read the full abstract

Robotics

LePlanner: An Iterative Amortized Controller For World Models

World models trained with joint-embedding predictive architectures learn compact, structured latent representations from physical interaction, yet planning in these latent spaces typically relies on one of two costly approaches. Search-based planners such as CEM, MPPI, and iCEM optimize action sequences through many predictor rollouts, achieving strong performance at the cost of high per-decision compute and latency. Policy-based methods amortize inference into a single forward pass but can degrade on contact-rich tasks where the demonstration distribution is multimodal. We propose LePlanner, an amortized iterative controller that learns to construct and refine latent action sequences through a frozen world-model predictor. LePlanner is trained with an arrival-and-hold objective that encourages the controller to reach the goal at the earliest feasible horizon and remain there. This addresses horizon-reset procrastination, a failure mode in which repeated receding-horizon replanning continually postpones goal arrival. An additional action-Gaussian loss keeps generated actions near the support of the offline dataset. Across navigation, contact-rich manipulation, and continuous-control environments, LePlanner matches or exceeds search-based planners while requiring an order of magnitude fewer predictor evaluations and 3-49x lower wall-clock time per decision. It achieves success rates of 98% on PushT, 100% on Reacher, 100% on TwoRooms, and 92% on the OGBench Cube task. These results show that much of the structure discovered through online search can be amortized into a lightweight iterative policy, enabling fast, horizon-aware, nonlinear physical control without online optimization.
Read the full abstract

All authors Saksham Bansal, Om Naphade, Chayan Aggarwal, Vrishin M

Machine Learning

Pre-training with Graph Transformers

This article investigates pre-training strategies for graph transformers in the biochemistry domain. By conducting comprehensive experiments, the study reveals that supervised pre-training using computed properties as labels provides the highest performance gain on downstream tasks. The results also highlight the importance of constraining model capacity to mitigate overfitting in graph transformers.
Read the full abstract

Commutative Algebra

The classification of some polynomial maps in dimension three

In the paper, we classify all polynomial maps of the form $H=(u(x,y),\allowbreak v(x,y,z),h(x,y,z))$ in the case that $JH$ is nilpotent and $\deg_zv\geq 2\deg_zh$. Then we give the structure of $H=(u(x,y),v(x,y,z),h(x,y,z))$ if $JH$ is nilpotent and $\deg_zh\leq 3$.

Sound

CRAF: Cross-View Residual-Aware Fusion for Deepfake Speech Detection

Recent advances in speech synthesis and voice conversion have made deepfake speech increasingly realistic, making generalization to unseen spoofing attacks a critical challenge. Pretrained speech and audio models offer a promising direction for improving robustness to such unseen attacks. Self-supervised learning (SSL) models capture fine-grained, low-level acoustic characteristics, whereas Auditory Large Language Models (ALLMs) provide higher-level contextual representations. These complementary views can provide useful cues for improving generalization to unseen attacks. However, direct fusion does not explicitly disentangle information shared across the two views from view-specific complementary information, limiting effective cross-view integration. To address this, we propose CRAF, a cross-view residual-aware fusion framework that uses ALLM-guided cross-view attention to enrich SSL representations and adopts ALLM as a high-level reference to separate ALLM-explainable information from complementary SSL residual information. The residual is selectively refined through adaptive gating and integrated through SSL-primary fusion. Experiments on ASVspoof 5 show that CRAF with Kimi-Audio achieves an EER of 5.96% and a minDCF of 0.1192, demonstrating robustness to unseen spoofing attacks.
Read the full abstract

All authors Minh-Xuan Phan, Khalid Zaman, Candy Olivia Mawalim, Masashi Unoki

Computation and Language

Sweet Talkers: How Query Formulation Shapes Sycophancy in Romantic Relationship Advice

Large language models (LLMs) are increasingly used for emotional support and relationship advice, where a model's tendency to preserve a user's face can inadvertently reinforce harmful interpersonal behaviors. To systematically examine this risk, we developed the Romantic Relationship Advice-Seeking Prompts (RRASP) dataset of 2,400 prompts across five relationship themes and evaluated social sycophancy using the ELEPHANT framework on two consumer-facing models, GPT-5 Mini and Gemini 3 Flash. Contrary to our initial hypothesis, grammatical mood alone did not produce systematic differences in sycophantic behavior, suggesting that what a user implies matters more than how they phrase it. Instead, perspective-driven framing had a stronger influence, with gaps between original and flipped prompts widening in follow-up responses. Consistent increases in framing and moral sycophancy across turns indicate that models become more likely to accept a user's stated premises and affirm their ethical stance as a dialogue progresses. Notably, Gemini 3 Flash exhibited substantially smaller increases in moral sycophancy than GPT-5 Mini, suggesting it is more resistant to reinforcing ethically problematic positions across turns.
Read the full abstract

All authors Helena Choi, Edric Castel Hao, Karl Bautista, Francis Gabriel Magleo, Renzo Panti, Danielle Beatrice Olalia

Machine Learning

Accuracy Is Not Service: A Decision-Aware Benchmark for Intermittent-Demand Forecasting

A contract-logistics spare-parts operator is paid on order-level service: an order counts only if every requested line is fulfilled, yet forecasters are selected based on line-level forecast accuracy. This disconnect matters when demand is intermittent and lumpy, histories are short, and lead times span months. We benchmarked 38 forecasting methods spanning classical, intermittent-demand, machine-learning, deep-learning, and pretrained foundation models. A common decision-aware protocol evaluates them on an industrial panel drawn from a live contract and two public datasets. Forecast-accuracy rank and order-service rank are negatively correlated on the industrial panel, at -0.555, across methods evaluated on 20,330 real multi-item orders. Service is more closely associated with the direction of cumulative forecast bias, including over-prediction during zero-demand periods, than with point accuracy. Examining bias in Chronos-2's instance normalization yields a training-free correction that lifts the per-material fill proxy from 77.5% to 92.0% (14.5 percentage points) at the 90% policy target and raises the complete-order fill rate from 54% to 63%. For reproducibility, we release RUF (Regenerate-Until-Fidelity), a method for generating fidelity-certified synthetic panels on which the findings reproduce. For intermittent demand, the lowest-error forecast need not deliver the highest service. Bias direction helps explain this gap, which can be reduced without retraining.
Read the full abstract

Quantum Physics

What Output-Equivalence Oracles Miss: An Empirical Study of Equivalence-Invisible Bug Fixes in Quantum Transpilers

Quantum compilers face the test oracle problem, judged by an output-equivalence oracle: the compiled circuit must compute the same unitary as the original, modulo global phase and a qubit-layout permutation. This oracle, by construction, checks only that semantic map, not the circuit's own layout, permutation, or phase records: a defect there, or in a fixed-seed run's determinism, can pass unseen though the record is public. This empirical software engineering study of quantum transpiler correctness uses repository mining to measure how often this happens in real merged compiler fixes: a systematically identified corpus of Qiskit transpiler bug-fixes, classified by an independently dual-coded, source-validated fault-manifestation taxonomy. Nineteen of 68 fixes (28%, 95% Wilson CI 19-40%) repair faults invisible to this equivalence screen, even one augmented with compilation-validity, circuit-quality, and performance checks, and an extended 104-fix corpus over a wider window holds at the same rate with a tighter interval (29/104, 27.9%, CI 20-37%). A conservative floor remains even restricted to the one unconditionally equivalence-invisible channel (a corrupted layout or permutation record): 10 of 68 fixes (15%, CI 8-25%) beneath the 28% headline. The gap is not Qiskit-specific: it replicates in tket (7/21, 33%), with Cirq smaller but consistent. We detected no systematic differences on five inexpensive PR-level characteristics (19 vs 49, underpowered alone; the extended 29-vs-75 corpus tightens every interval toward zero). This class dominates the invisible set, concentrating at representation-boundary crossings. We release the corpus, codebook, and coding artifacts for quantum software testing research. Here we only measure it.
Read the full abstract

Computer Vision

TotalSynth: Robust Whole-Body Synthetic CT from MRI and CBCT

Purpose: To develop and evaluate TotalSynth, a reusable pretrained framework for whole-body synthetic CT (sCT) generation from MRI and cone-beam CT (CBCT) images. Materials and Methods: In this retrospective technical study, the dataset was assembled between 2020 and 2026 from SynthRAD challenge data, four prostate cohorts, and BIC-MAC. After registration quality control, 1450 of 1800 public challenge pairs were retained; 350 were excluded for insufficient registration quality or major source/CT mismatch. The corpus also included 84 additional prostate MRI/CT and 60 external BIC-MAC MRI/CT cases. Three 5-fold model families were evaluated with image-domain, anatomy-aware, registration-based, and uncertainty metrics. Age and sex were not consistently available across public datasets. Results: The released MRI-to-CT model achieved an overall MAE of 67.49 HU, SSIM of 0.920, and PSNR of 29.28 dB. The CBCT-to-CT model achieved an overall MAE of 53.55 HU, SSIM of 0.939, and PSNR of 32.09 dB. The unified model maintained similar performance on MRI inputs (MAE, 67.68 HU) and CBCT inputs (MAE, 54.22 HU). On external BIC-MAC data, MRI-to-CT MAE was 100.91 HU without fine-tuning and 62.21 HU after fine-tuning. Conclusion: TotalSynth provides reusable MRI- and CBCT-based CT synthesis models with broad anatomical coverage, while external evaluation highlights the need for local validation and optional fine-tuning under domain shift.
Read the full abstract

All authors Valentin Boussot, Cedric Hemon, Anais Barateau, Caroline Lafond, Jean-Claude Nunes, Jean-Louis Dillenseger

Quantum Algebra

An integral representation of eigenfunctions for the deformed Noumi–Sano operators

The deformed Noumi-Sano operator $H_{n, m}^d(x, y)$ of order $d$ is a simultaneous extension of the Macdonald operator and the Noumi-Sano operator. In this paper, we construct an integral transform associated with eigenvalue problem of $H_{n, m}^d(x, y)$. Using the integral transform, we obtain an integral representation of eigenfunctions for $H_{n, m}^d(x, y)$.
Read the full abstract

Machine Learning

Graph Neural Networks for Influence Maximization in Social Networks: An Unsupervised Minimum Dominating Set Approach

The Minimum Dominating Set (MDS) problem is a classic NP-hard combinatorial optimization problem with critical applications in social network analysis, including viral marketing, influence maximization, public health interventions, and information dissemination. Identifying a minimal set of influential individuals whose reach covers an entire social network is central to these applications, yet remains computationally challenging at scale. Graph neural networks (GNNs) have emerged as powerful tools for learning over graphs, and recent work explores their application to hard combinatorial problems. This paper presents a novel unsupervised GNN framework for the MDS problem that eliminates the need for ground-truth solutions during training. Trained on 12,000 synthetic graphs with diverse structural properties, our method achieves up to 55x faster inference than metaheuristic baselines and up to 14x faster inference than supervised learning approaches, while finding optimal or near-optimal dominating sets on real-world social network benchmarks. Our learned heuristic generalizes effectively to unseen graph distributions, demonstrating strong practical applicability for large-scale social network analysis.
Read the full abstract

Algebraic Geometry

Contact Rigidity and Comparison Kernels for Type A lci Schubert Varieties

Let $X_w$ be a Type A local complete intersection Schubert variety. We prove Contact Rigidity: the existence of two smooth singular components forces some pair of singular components to contain a common Schubert subvariety of codimension one in each. If the singular locus is a single smooth component $X_z$, the rational comparison kernel is $IC_z$, and $P_{u,w}(q)=1+q^{(\ell(w)-\ell(z)-1)/2}$ for every $u\leq z$. The first proof combines pattern avoidance with a computer-assisted finite overlap classification, rectangle inheritance, and extremal repairs. The second establishes the hypotheses of Woo's theorem and uses Euler characteristics and Bruhat triangularity to identify the entire perverse kernel.
Read the full abstract

Disordered Systems and Neural Networks

On Rare Nonresonant Regions and Subdiffusive Transport in an Interacting Disordered Quantum Chain

We study rare nonresonant regions in a canonical one-dimensional disordered quantum spin chain by directly implementing the iterated Schrieffer-Wolff construction underlying the recent work of De Roeck, Giacomin, Huveneers and Prosniak on subdiffusive transport. For finite systems, we compute the probability that a disorder realization remains nonresonant through successive scales of the flow, while separately monitoring operator proliferation and the spatial localization of dressed local observables. The survival probability decays at most exponentially with system size over the numerically accessible regime. Resolving this decay scale by scale yields failure rates associated with successive Schrieffer-Wolff steps. The first rate is obtained analytically in excellent agreement with numerics, while higher-scale rates decrease rapidly throughout the regime studied. These results support the summability mechanism required for exponentially rare but parametrically long nonresonant regions, which provide the insulating bottlenecks responsible for subdiffusive transport. At the smallest couplings studied, the survival probability under our conditions exceeds the rigorous lower bound by six to seven orders of magnitude, demonstrating how conservative the constants required by the proof are while confirming that its underlying physical mechanism is quantitatively visible at accessible scales. More broadly, our results show how direct numerical implementations can provide an independent and physically transparent test of technically demanding constructive proofs, a methodology that may become increasingly useful as machine-assisted proofs become more common.
Read the full abstract