Peer Revenue Equity in science

Papers

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

All of arXiv

Friday 28 August

Numerical Analysis

Quantile Randomized Kaczmarz for Streaming Linear Systems with Massart Noise

Quantile randomized Kaczmarz (QRK) has proven to be an efficient solver for corrupted linear systems and has received much attention. It was recently shown by Cai et al. (SIAM J. Matrix Anal. Appl. 47(2):802-823, 2026) that using $O(\log T/\log(1/\beta))$ samples for computing the quantile is necessary and sufficient for QRK to converge linearly over $T$ iterations when solving linear systems with a $\beta$-fraction of arbitrary corruptions, as long as $\beta$ is small enough. However, it remains unclear how large the corruption level $\beta$ can be, and how to compute the required subsample size $D$ explicitly, without hidden constants. This paper studies streaming linear systems with Massart noise via QRK using an order-optimal batch size $D=O(\log T)$ in each update. The independence of samples from previous iterations in the streaming setting enables a sharper analysis, yielding explicit, computable bounds on both the tolerable corruption level and the required subsample size. In particular, we establish linear convergence for corruption levels of up to approximately 7%. We also discuss how the constants improve under oblivious noise.
Read the full abstract

All authors Emeric Battaglia, Jian-Feng Cai, Junren Chen, Anna Ma, Deanna Needell, Tong Wu

Cryptography and Security

DisCTI: Who Needs to Know Timely? Automated Sector-Aware Cyber Threat Intelligence Dissemination

The timely dissemination of cyber threat intelligence (CTI) is critical for organizations to mount swift and effective incident response. When valid CTI is delivered to the right sector at the right time, identical attacks can often be contained or mitigated. However, today's rapidly expanding CTI landscape overwhelms analysts, who must sift through massive and heterogeneous feeds. Existing platforms such as the Malware Information Sharing Platform (MISP) provide sector tagging features (e.g., energy, finance, government), but in practice, these remain largely unmapped (98% of events are left uncategorized). This lack of automated and timely sector mapping severely limits the operational value of shared intelligence, leaving organizations that belong especially to the critical information infrastructure sector exposed. To address this gap, we formulate sector-targeted CTI dissemination as a multilabel classification problem. Leveraging deep field knowledge of CTI structures and sector-specific threat patterns, we construct a novel data set of 872 sector-labelled CTI events from a threat intelligence platform (TIP). We then apply BERT, a transformer-based model, to automate the mapping of CTI events to sectors. Using the structured threat information expression (STIX) format for cross-platform interoperability, our approach achieves a macro-averaged F1-score of 0.89 at a Hamming loss of 0.055 on the custom dataset, i.e. 94.5% of individual sector-label assignments are correct. These results not only demonstrate the feasibility of sector-aware, automated CTI dissemination but also highlight how embedding expert field knowledge into machine learning design fills a crucial gap in the threat intelligence pipeline, enabling faster and context-relevant defensive action.
Read the full abstract

All authors Fajar Wijitrisnanto, Alsharif Abuadbba, Yansong Gao, Nan Wu

Computation and Language

Lexically conditioned realization ambiguity in Korean predicate morphology

This paper examines Korean surface realization as distinct from morphological analysis. It asks whether a sequence of canonical morphemes and grammatical category labels uniquely determines the corresponding surface form. The answer is negative for a restricted but theoretically revealing class of Korean predicates. In these cases, formally identical or near-identical stem-ending configurations yield different outputs depending on lexical identity and realization class membership. We analyze this phenomenon as homonymy with inflectional divergence, focusing on regular versus digeut irregular pairs, regular versus bieup irregular pairs, and reu irregular versus reo irregular pairs. These cases show that stem shape and ending alone do not always determine surface realization. Instead, lexical meaning, subcategorization, and semantic role structure help identify the intended predicate; the predicate determines the realization class; and the realization class determines the surface form. Korean realization thus reveals a limit of bare morphological representation.
Read the full abstract

Combinatorics

Intersections of Oriented Graphs and Tournaments

Given two tournaments of order $n$, Bollobás and Scott defined their discrepancy as the largest deviation of their overlap from its random average under relabelling, and they asked whether the resulting discrepancy is always $\Omega (n^{3/2})$. We answer this question by proving that there is an absolute constant $c>0$ such that every pair of tournaments $T,U$ of order $n$ has discrepancy at least $cn^{3/2}$. More generally, if $D$ and $H$ are oriented graphs of order \( n \) with \( e(D) = p \binom{n}{2} \) and \( e(H) = q \binom{n}{2} \) satisfying $16/n \leq p, q \leq 1 - 16/n$, then there is an absolute constant \( c > 0 \) such that their discrepancy is at least $c(p(1-p)q(1-q))^{3}n^{3/2}$. We also show that these two-graph estimates extend to intersections of any fixed number of graphs, tournaments, and oriented graphs.
Read the full abstract

Artificial Intelligence

AERA: Adaptive Evidence Residual Allocation for Efficient Test-Time Reasoning

Test-time scaling improves language-model reasoning by generating additional candidate solutions, but allocating the same inference budget to every problem is computationally wasteful. Existing adaptive stopping methods commonly rely on confidence, agreement, or answer stability, implicitly assuming that stronger current evidence indicates that further computation is unnecessary. We show that this assumption can fail: checkpoint-level correctness evolves non-monotonically, and observable evidence may strengthen before an answer collapses or weaken before it recovers. Motivated by this mismatch, we introduce Adaptive Evidence Residual Allocation (AERA), a sequential controller that learns whether additional computation is likely to recover a better answer from checkpoint-observable evidence. AERA characterizes cumulative response prefixes using answer-distribution, temporal, re-solving, semantic, and compute features, and repeatedly decides whether to stop or allocate the next response block. Future checkpoint correctness is used only to construct offline supervision and is never available to the controller at inference time. Across GSM8K and GPQA Diamond, AERA identifies question-specific residual opportunities while substantially reducing inference computation. In a frozen-threshold incremental-generation evaluation on 300 untouched GSM8K questions, AERA achieves 92.61% accuracy versus 93.01% with 128 responses while reducing completion tokens by 95.99%. These results suggest that adaptive reasoning should estimate the future value of computation rather than equating present confidence with correctness.
Read the full abstract

Artificial Intelligence

SABER: Stability-Aware Early Exit for LLM Reasoning via Adversarial Branch Probing

Large Reasoning Models (LRMs) achieve strong reasoning capabilities, yet long-chain reasoning becomes inefficient once the intermediate answer stabilizes across reasoning steps: additional reasoning yields little marginal benefit while incurring substantial inference cost. Existing early-exit methods based on confidence or entropy poorly capture reasoning stability, while consistency-based approaches rely on multi-step trajectory agreement, requiring sequential evaluations that delay exit. To better balance efficiency and reliability, we propose SABER, a training-free framework for stability-aware early exit via adversarial branch probing. SABER constructs simple yet effective semantic perturbations around intermediate reasoning states to form adversarial branches, and applies lightweight probing to estimate their likely final outcomes without full trajectory rollouts. When the probed outcomes remain consistent across branches, SABER exits early; otherwise, it continues reasoning. Experiments across multiple reasoning benchmarks and model architectures show that SABER reduces reasoning token consumption by 30.2%–39.8% on average while maintaining competitive accuracy with full-length reasoning.
Read the full abstract

All authors Wanli Cheng, Haiya Xiang, Juntao Li, Hongling Wang, Wenliang Chen

Cosmology and Nongalactic Astrophysics

Learning the averaged history of an inhomogeneous universe from its present day density field

In this work, we investigate whether machine learning can be used to infer averaged cosmological quantities directly from the present day matter density distribution. Using an implementation of the simplified silent universe framework, we generate a dataset consisting of 92610 independent relativistic, simplified cosmological simulations spanning a range of initial conditions and average cosmological parameters. We train a convolutional neural network to take the present-time matter density field as input and predict the averaged matter, cosmological constant, curvature, and kinematical backreaction density parameters as well as the Hubble parameter, at both initial and present time. The network achieves coefficients of determination exceeding 0.9 for all predicted quantities, with error distributions showing that only a small fraction of predictions reach percent-level errors or above. Although our use of the simplified silent universe approximation precludes direct application of the trained model to observational data, the results provide a proof-of-principle that neural networks can successfully recover averaged cosmological properties, including backreaction, at different epochs, simply from the late-time matter distribution. More broadly, our findings demonstrate that information about the averaged cosmological history of a universe is encoded in its present-time density field and can be extracted using machine learning techniques. This opens the possibility of applying similar approaches to more realistic cosmological simulations and observational probes such as N-body simulations and weak-lensing maps, ultimately providing a new avenue for constraining the large-scale evolution of the Universe.
Read the full abstract

High Energy Physics (Phenomenology)

Magnetic Moments and Radiative Transitions of the $T_{cc}(3875)^+$ and its partner states

We systematically investigate the magnetic moments (MMs) and radiative decay widths of S-wave doubly heavy tetraquark states based on chromomagnetic interaction (CMI). They provide a complementary probe to distinguish compact from molecule structures in addition to the mass spectrum and strong decay properties. Using the CMI eigenvectors, we compute the MMs and M1 transition rates for the tetraquarks in the compact configuration. We predict the MM of the observed $T_{cc}(3875)^+$ with $I(J^P)=0(1^+)$ to be 0.45 $\mu_N$ when treating it as a compact tetraquark state, whereas the MM of the $0(1^+)$ $DD^*$ molecule is about $-0.07\,\mu_N$. Five radiative transition channels related to the $T_{cc}(3875)^+$ are identified with widths ranging from $6.07$ keV to $306.37$ keV. Our results show that the MMs of the $J^P=1^+$ $bc\bar{q}\bar{q}^\prime$ ($q/q^\prime=u,d,s$) and $J^P=1^+$ $QQ\bar{n}\bar{s}$ ($Q=b,c; n=u,d$) states are influenced by the diquark-spin mixing. Through the analyses of radiative transitions between different tetraquark states, we find that such processes in the $QQ\bar{n}\bar{n}^\prime$, $QQ\bar{s}\bar{s}$, and $bc\bar{n}\bar{s}$ cases may serve to reveal the tetraquark structures of the initial or final states. We also define the magnetic coupling matrices characterizing the MMs of the tetraquark system with $J^P=1^+$, with which the range of MM can be constrained. The present study provides a valuable reference point for the search of exotic states in future particle physics experiments.
Read the full abstract

All authors Jing Wu, Yi-Kun Wang, Kai-Bao Chen, Yan-Rui Liu, Jian-Bo Cheng, Wei-Hua Yang

Artificial Intelligence

When Teacher Guidance Misleads: Reward-Aligned On-Policy Distillation

On-policy distillation (OPD) has recently emerged as a popular post-training paradigm for large language models (LLMs), providing an efficient way to transfer the knowledge and capabilities of teacher models into student models. However, teacher guidance on student-generated prefixes is not always reliable. Training should optimize the model to generate responses that are more likely to be correct, or equivalently, to get higher outcome rewards. But during OPD, the teacher model may provide guidance that discourages the student from moving toward correct trajectories or moves the student toward incorrect ones, which is misaligned with outcome reward. Such misaligned guidance is unreliable, as it would mislead the optimization process and ultimately degrade model performance. To mitigate misaligned teacher guidance, we propose Reward-Aligned On-Policy Distillation (RA-OPD). The key insight is to keep only trajectories whose induced updates move the student toward correct trajectories or discourage the student from moving toward incorrect ones. Specifically, for each sampled trajectory, RA-OPD checks whether its trajectory-level distillation return is consistent with its outcome reward and then filters out the misaligned trajectories. RA-OPD selects more reliable trajectories to improve student model performance without requiring additional computational cost. We evaluate RA-OPD on math and code benchmarks using models from the Qwen3 family and the DeepSeek-R1 family. Across seven math benchmarks and three code benchmarks, RA-OPD significantly outperforms standard OPD and other tested OPD variants.
Read the full abstract

All authors Siyuan Gan, Yuhan Li, Xiran Wang, Linjian Meng, Boyan Wang, Zhen Zhao, Jing Huo, Yang Gao

Mesoscale and Nanoscale Physics

Significant modulation of acoustoelectric current associated with charge density wave transitions

We studied acoustoelectric (AE) currents in materials that undergo charge density wave (CDW) transitions, induced by a surface acoustic wave (SAW) on a piezoelectric substrate. The polarity and magnitude of the AE current in NbSe$_3$ and 2H-TaSe$_2$ were modulated due to their CDW transitions. We also found that the sign of the AE current depends on the SAW propagation direction with respect to the crystalline axis of the substrate.A phenomenological model assuming strain-modified conductivity can qualitatively account for the significant modulation of the AE current associated with the CDW transition, as well as the SAW propagation orientation dependence. The present results offer a powerful probe for exploring SAW-electron interactions in van der Waals materials, thereby highlighting their potential for advancing the emerging field of straintronics.
Read the full abstract

All authors Natsumi Nikaido, Takuya Kawada, Koji Fujiwara, Jihoon Park, Nan Jiang, Kouta Kondou, Shintaro Takada, Yasuhiro Niimi

Numerical Analysis

A Two-Level Preconditioner Based on Dominant Components for Time-Dependent Multiscale High-Contrast Problem

In this work, we develop a two-level overlapping preconditioner for time-dependent problems in high-contrast multiscale media. We present a coarse-space construction based on multiscale methods, with emphasis on the relaxed nonlocal multicontinuum (NLMC) method. The NLMC space can be separated into components representing the high-permeability regions and the low-permeability background. We show that the complete NLMC space effectively preconditions the heterogeneous stiffness operator, whereas the high-permeability component alone captures the contrast-dependent global modes. For suitable small time-step sizes, the mass matrix controls the low-permeability contribution and only the high-permeability component in NLMC space is required for the global coarse correction in the two-level preconditioner. For general time-step sizes, performance can be maintained by using the full NLMC space or augmenting the high-permeability component with a standard multiscale space. The proposed coarse-space construction lowers the computational cost while preserving robustness with respect to coefficient contrast and fine-scale resolution. To further improve efficiency, the multiscale basis functions can be constructed by iteratively solving the relaxed energy-minimizing formulation. We demonstrate the robustness, efficiency and scalability of the proposed method through several numerical experiments.
Read the full abstract

High Energy Physics (Phenomenology)

Celestial probes of dark matter electromagnetic interactions

We investigate the neutrino flux from the Sun and Earth, as well as the heating of Jupiter and white dwarfs, induced by the annihilation of spin-$1/2$ dark matter particles captured through their electromagnetic interactions with nuclei. Using current data, we derive constraints on the electromagnetic moments and compare them with existing bounds from direct dark matter searches, laboratory experiments, and astrophysical observations. We find that celestial bodies provide leading constraints in several regions of parameter space: the Earth is particularly sensitive to millicharged dark matter, while massive white dwarfs provide powerful probes of the magnetic dipole moment, charge radius, and anapole moment in regions where direct searches lose sensitivity. We illustrate the implications of these constraints in simplified models of Dirac and Majorana dark matter with radiatively generated electromagnetic moments, as we discuss the complementarity between capture in celestial bodies and other dark matter searches.
Read the full abstract

High Energy Physics (Theory)

Holographic Ensembles in Type IIB

We study holographic ensembles in type IIB string theory on the Schur twisted AdS$_5 \times S^5$ background, and its corresponding boundary partition function: the Schur index of $\mathcal{N}=4$ SYM. In the supergravity limit the two natural ensembles are either at fixed flux on $S^5$, corresponding to a boundary theory at fixed rank, or its conjugate choice of fixed potential on the boundary of AdS$_5$, corresponding on the boundary to a grand canonical ensemble of theories at fixed chemical potential. Due to the self-dual nature of the five-form in type IIB supergravity the choice of ensembles is not seen in the standard bulk action, but rather by the coupling of an additional topological term. We compute the bulk partition function to one loop, including the Kaluza-Klein determinant and the measure of the ensemble-changing sum, and show that depending on the sign of this topological term it matches the perturbative boundary partition function in either the canonical or the grand canonical ensemble.
Read the full abstract

High Energy Astrophysical Phenomena

Rapid Variability and Broadband Spectral Modeling in the Flaring Activity of BL Lacertae

We report a multi-wavelength study of two flaring episodes of the blazar BL Lacertae during MJD 60500-60800 (9 July 2024 - 5 May 2025). The source reached a daily-averaged $\gamma$-ray flux of $(1.03 \pm 0.05) \times 10^{-5} \, \mathrm{ph \, cm^{-2} \, s^{-1}}$ ($E > 100$ MeV) on MJD 60588 (5 October 2024). Using orbit-binned data from the Large Area Telescope (LAT) onboard the Fermi Gamma-ray Space Telescope, we identify a minimum flux halving timescale of $\tau = 1.33 \pm 0.29$ hr. This constrains the upper limit on the $\gamma$-ray emitting region size to $R \le 2.0 \times 10^{15}$ cm, as well as its distance from the central supermassive black hole to $R_\mathrm{H} \le 5.9 \times 10^{16}$ cm, assuming a Doppler factor of $\delta = 14.8$ derived from the spectral energy distribution (SED) modeling. We find tentative evidence for sub-minute $\gamma$-ray variability with a minimum doubling time of $0.7 \pm 0.2$ min ($p$-value = 0.03). This may originate from an extremely compact region with a size of $R \le 1.8 \times 10^{13}$ cm, suggesting that the emission arises from magnetohydrodynamic substructures, such as plasmoids within a magnetic reconnection zone. Spectral analysis reveals a significant “softer-when-brighter” trend ($r = 0.96, p = 4.5 \times 10^{-4}$) during the minute-scale flare peaks, indicating a complex interplay between particle acceleration and radiative cooling. The SED is reproduced using a one-zone leptonic model, in which synchrotron self-Compton (SSC) and external Compton (EC) scattering effectively account for the high-energy emissions. The reduced magnetic field strengths and hard electron injection spectral indices observed during the flaring states suggest enhanced particle acceleration efficiency, possibly associated with relativistic magnetic reconnection.
Read the full abstract

All authors Xin Chang, Dingrong Xiong, Chenxu Liu, Rui Xue, Tingfeng Yi, Jia Zhang, Yu Pan, Xingzhu Zou, Xinlei Chen, YeHao Cheng, Yuanpei Yang, Jinghua Zhang, Xiangkun Liu, Yuan Fang, Guowang Du, Tao Wang, Xufeng Zhu, Zhongxiang Wang, Sarira Sahu, Xiaowei Liu

Cryptography and Security

Not to Break, but to Attest: Adversarial Probes for Privacy-Preserving LLM Verification

Post-deployment changes to large language models can alter behavior while leaving routine outputs largely unchanged, creating a challenge for AI governance when model weights are proprietary. We present a privacy-preserving zk-SNARK-based audit framework that searches for probes designed in the spirit of adversarial examples to amplify logit drift between an approved model and a modified deployment. Our framework explores complementary probe families under different access models. Token-based probes operate in a black-box setting and require only the input interface, tokenizer, and vocabulary. Embedding-based probes require gray-box access to the embedding interface. Stress probes rely on additional interface capabilities but do not require full white-box access to model weights or architecture. This range allows probe selection to balance sensitivity, access requirements, and deployment cost. We evaluate probe constructions across LLM architectures, model-tampering scenarios representative of post-deployment attacks, and GPU platforms. Importantly, our experimental results demonstrate that token-based probes consistently deliver the strongest mean sensitivity across models and GPU platforms, although operating in a black-box setting. Our Groth16 zk-SNARK workflow remains practical as the probe set scales from 1 to 50, where proving time increases from 1.02 to 1.78 seconds, verification remains near 0.84 seconds, and proof size remains constant.
Read the full abstract

Artificial Intelligence

The Illusion of $\textit{What If}$: Evaluating the Breakdown of Counterfactual Reasoning in LLMs

Counterfactual reasoning requires models to reason beyond the observed world and explain how altered conditions propagate through downstream consequences. Existing benchmarks largely target bounded settings with fixed variables or single gold outcomes, overlooking open-domain scenarios requiring causal-process evaluation. To this end, we present $\textbf{WhatIfBench}$, a diagnostic benchmark for open-domain, open-form, long-horizon counterfactual causal reasoning, containing 220 what-if questions across STEM, HSS, and Hybrid scenarios. To evaluate free-form responses, we further propose $\textbf{PRISM}$, which first converts each natural-language explanation into a Response-Derived Semantic Causal Graph of events, states, and mechanisms. On top of this graph, PRISM then jointly applies a Process Metric assessing graph-level causal validity and a Rubric Metric assessing answer-level explanatory adequacy. Evaluating six frontier LLMs with this framework, we find that WhatIfBench remains far from saturated: even the strongest model reaches only a 64.62% final score. Further analysis reveals persistent causal gaps, premise drift, and topology fragmentation, suggesting that fluent counterfactual narratives often mask fragile causal processes. The benchmark, code, and evaluation scripts are available at $\href{https://github.com/zju-gt/WhatIfBench}{WhatIfBench}$.
Read the full abstract

All authors Yucheng Wang, Yuetian Du, Zhengyi Liu, Rongyu Zhang, Bing Zhao, Boyu Yang, Ming Kong, Lin Qu, Hu Wei, Jie Liu, Qiang Zhu

Soft Condensed Matter

Shape Evolution and Dynamics of Deformable Ring

We numerically investigate the dynamics of a deformable closed ring filled with active particles. The ring is modeled as a flexible boundary made up of passive beads interacting with a harmonic spring force. The interior of the ring is filled with active Brownian particles (ABPs), and their activity is controlled through the rotational diffusion coefficient. We explore how, by systematically varying the activity of ABPs, packing fraction, and size of the ring, we can control the shape deformation and dynamics of the ring. At low packing fractions, low rotational diffusion coefficients, and smaller ring sizes, the ring exhibits highly irregular and strongly deformed shapes due to the uneven spatial arrangement of active particles along the boundary. Increasing the packing fraction, rotational diffusion coefficient, or ring size promotes a more even distribution of active particles within the ring, thereby suppressing shape deformations and fluctuations, driving the ring toward a more circular shape. We further analyze the mean-squared displacement (MSD) of the ring's center of mass and observe a crossover from ballistic to diffusive dynamics, which can be tuned by varying the system parameters. Our results demonstrate that, despite its internal complexity and deformability, the ring exhibits emergent behavior analogous to that of a single effective active particle. This study provides insight into the collective effects of confined active matter and the resulting macroscopic dynamics of deformable systems.
Read the full abstract

All authors Arun Kumar, Partha Sarathi Mondal, Pritha Dolai, Shradha Mishra

Mesoscale and Nanoscale Physics

Multi-dimensional spectroscopy of mobile excitons in two-dimensional semiconductors

Multi-dimensional coherent spectroscopy (MDCS) goes beyond standard linear-response probes and provides a powerful tool for investigating correlations between quasiparticles such as excitons (bound electron-hole pairs). Here we present a microscopic theory of MDCS that accounts for the delocalized nature of excitons in two-dimensional semiconductors. In contrast to the more phenomenological few-level approaches typically employed for modelling MDCS, our theory features mobile excitons with continuous momentum degrees of freedom. We find that the energy continuum associated with exciton momenta is crucial for producing interaction-induced decoherence, as well as capturing the interference between different exciton-polaron quasiparticles in the case of charge-doped semiconductors. Crucially, our calculated MDCS spectra agree well with recent experiments on doped monolayer MoSe$_2$ [Hao et al., Nature Communications 8, 15552 (2017)], and they suggest that the interactions between exciton polarons depend strongly on phase-space filling effects, where exciton polarons compete for electrons. Our results demonstrate that microscopic approaches allow one to gain new insights from the fine structure of MDCS on two-dimensional semiconductors, and they illustrate the utility of microscopic approaches to modelling MDCS experiments more generally.
Read the full abstract

All authors Ned Wheaton, Jeffrey A. Davis, Jesper Levinsen, Meera M. Parish

Information Retrieval

Information-Guided Selective Modality-Interest Alignment for Multimodal Recommendation

Multimodal recommendation (MMRec) aims to enhance recommendation performance by leveraging rich item content from multiple modalities. However, directly incorporating all modality information does not necessarily lead to better preference modeling, since user interests are often more related to a subset of modality signals, while other signals may be weakly aligned with user preferences or even introduce noise. Although recent MMRec methods improve modality utilization through invariant learning, attention mechanisms, graph refinement, or contrastive learning, their alignment processes are often implicit or heuristic and lack a clear objective for selecting modality signals that better match user interests. In this paper, we propose AMUR, an information-guided selective modality-interest alignment framework for multimodal recommendation. Inspired by an information-theoretic view, AMUR aims to enhance modality information that is more related to user interests while reducing the influence of less aligned signals. Specifically, AMUR first refines modality graph structures towards user behavior, and then selectively aligns shared interest-related semantics across modalities. This enables AMUR to improve modality-interest alignment while preserving useful modality-specific complementary information. Extensive experiments on three real-world datasets demonstrate the effectiveness of AMUR over competitive baselines. The code is available at https://github.com/Wenze1/AMUR.
Read the full abstract

All authors Wenze Ma, Chenyu Sun, Yanmin Zhu, Qiwen Gu, Xuhao Zhao

Combinatorics

Special Kirillov-Reshetikhin crystals

We give a uniform realization of Kirillov-Reshetikhin crystals $B^{r,s}$, in terms of PBW crystals, for all affine types, $s \geq 1$, and nodes $r$ in the orbit of the $0$ node in the Dynkin diagram. Our proof is almost uniform except we prove some technical lemmas by first proving the case when the $r$-th fundamental weight $\Lambda_r$ is minuscule by using properties of minuscule crystal and then extend this to the case when $\Lambda_r$ is cominuscule using virtual crystals.
Read the full abstract

Machine Learning

Temporal Memory-Aware Online Test-Time Adaptation on Dynamic Graphs

Test-time adaptation (TTA) on graphs aims to adapt a graph neural network (GNN) that is well-trained on the training graph to the test graph, which involves potential distribution shifts that may harm model generalization and test-time inference. While recent efforts have investigated TTA on static graphs, there is still a research gap on dynamic graphs learned with dynamic GNN (DGNN) models, where both structural connectivity and node semantics evolve continuously over time. This makes adapting a DGNN model for reliable test-time performance substantially challenging. To fill this gap, in this work, we propose a novel framework of temporal memory-aware Online Test-Time Adaptation on Dynamic Graphs, named DGOTTA, to effectively adapt well-trained DGNNs during test time. Specifically, the proposed DGOTTA contains three modules: (1) temporal-aware augmentation, to extend the diversity of test dynamic graphs for addressing complex temporal and spatial shifts; (2) memory-aware model prediction, to alleviate catastrophic forgetting; (3) consistency-guided online adaptation, to enforce temporal alignment and memory smoothness. Extensive experiments on three real-world datasets and four DGNN backbones demonstrate that DGOTTA significantly improves generalization under diverse distribution shifts and multiple model architectures.
Read the full abstract

All authors Bo Li, Xin Zheng, Ming Jin, Can Wang, Shirui Pan

Quantum Gases

Coherence Resonance Phenomena in an Atom-Dimer Two Mode BECs

We investigate the non-equilibrium dynamics of atomic-molecular Bose-Einstein condensates coupled via a Feshbach resonance, with Gaussian white noise acting on both the coupling strength and the detuning. Using the bosonic Josephson-junction and Bloch-sphere formalisms, we examine how coherence (coupling) noise and imbalance (detuning) noise modify the coherence-resonance point as functions of the initial polarization and the Feshbach detuning. Noise plays a more coherent role when its characteristic timescale matches the intrinsic timescales of the dynamics, leading to extrema in the time-averaged purity and the Husimi-Q distribution.
Read the full abstract

Functional Analysis

Rational Bishop determinants and explicit cyclicity criteria

We study finite-fibre determinants for rational Bishop operators and their role in cyclicity for irrational parameters. The paper has two main parts. First, for the constant vector $f=1$, a resultant identity and a discrete Fourier factorization reveal a determinant parity mechanism for general modular orbit order: odd denominators give a nonnegative normalized determinant on the positive fundamental cell, while for even denominators the unique real alternating Fourier mode is the only factor capable of producing a sign-changing zero. We give an explicit example at $(r,q)=(9,16)$ and an analytic infinite family $(r,q)=(3,6n-2)$. Grivaux's zero-free determinant is identified as the consecutive-order subfamily $D_{1,q}$, so these zeros are caused specifically by nonconsecutive modular ordering. Second, we prove an explicit cyclicity criterion that does not require global nondegeneracy or monotonicity of the fibre determinant. A quantitative Remez estimate controls the small-determinant set; cutoff inverses are approximated by endpoint-corrected Fejer polynomials; and an explicit continuity modulus transfers the resulting rational approximants to irrational parameters. This produces a fully explicit continued-fraction gap function for $f=1$ and, more generally, for every polynomial $f$ with $f(0)\ne 0$. The argument also gives the exact degree and leading coefficient of the corresponding polynomial-vector fibre determinants.
Read the full abstract

Artificial Intelligence

Cross-Session Decomposition Attacks: Scaling Risk and Intent-Aligned Retrieval Defense

Scaling laws are usually read as a capability story: lower language-modeling loss yields more useful models. We study a safety consequence of this mechanism in cross-session decomposition attacks, where benign-looking subqueries are asked across independent interactions and later recomposed toward a forbidden objective. We formalize this setting as compositional safety risk and prove a conditional risk-transfer bound: when the reference environment already contains dispersed evidence for a risky reconstruction, the gap between deployed composed risk and reference composed risk is controlled by the model's excess loss on allowed subqueries. Synthetic withholding experiments show that wider transformers assign lower loss to held-out instructions that never appear verbatim in training but are recoverable from injected supporting facts. A 600-intent pretrained-LLM evaluation shows that larger Qwen3 and Gemma3 family members can yield greater harmful-capability uplift under a fixed decomposition-composition pipeline. As a defense, IntentAlign-MiniLM, our 22M-parameter intent-aligned retriever, outperforms much larger embedding models on held-out intent retrieval and yields the best learned-retriever harmful recall across tested guardrails. Code is available in \href{https://github.com/liaodisen/Cross-Session-Decomposition-Attacks}{our GitHub repository}.
Read the full abstract

All authors Disen Liao, Yihan Wang, Freda Shi, Yaoliang Yu

Mesoscale and Nanoscale Physics

Quantum geometric bounds at finite temperature for one-dimensional chiral systems

The geometry and topology of quantum states are intimately related at zero temperature through exact bounds that constrain geometric quantities from below by topological invariants. At finite temperature, however, the analogous relations remain unclear. Here we establish rigorous geometric lower bounds for one-dimensional chiral-symmetric systems at finite temperature within the Uhlmann's framework for mixed states. We show that the Bures length is bounded by a continuous geometric phase angle. We further derive a temperature-dependent bound that interpolates between the zero-temperature limit and a trivial high-temperature regime. Our results are verified analytically and numerically using the Su-Schrieffer-Heeger model and the spinless Kitaev chain model. Finally, we discuss potential ways to detect the geometry of the density matrix in quantum circuits, with the quantum imaginary-time evolution method.
Read the full abstract

Fluid Dynamics

High-Order CFD Modeling of Rotating Actuator Line Systems

High-order computational fluid dynamics (CFD) methods combined with actuator-based blade representations provide an attractive approach for simulating rotating energy systems. In this work, we develop a high-order computational framework that couples the flux reconstruction/correction procedure via reconstruction (FR/CPR) formulation with a rotating actuator line model (ALM). Blade rotation and unsteady aerodynamic forces are implemented through time-dependent source terms applied on a fixed cartesian grid. This approach allows simulations of a fully rotating turbine without using explicit blade geometry. Aerodynamic loads are computed using quasi-steady airfoil data and distributed into the flow field with Gaussian smoothing to maintain numerical stability in the high-order scheme. The framework is tested using a two-bladed vertical-axis wind turbine (VAWT) operating at a low tip speed ratio (TSR). The phase-averaged blade motion and overall load are analyzed to study variations with azimuthal angle. In addition, instantaneous and mean flow fields are examined to describe wake structure and unsteady vortex shedding. Normalized mean wake velocity profiles are used for validation through comparison with experimental measurements and blade-resolved large-eddy simulations (LES) reported in the literature. The results show that the proposed high-order virtual-body framework can reliably capture major blade-loading trends, flow organization, and wake features under strongly unsteady conditions, while maintaining geometric simplicity.
Read the full abstract

Artificial Intelligence

CASTANET: Causality-Aware Spatio-Temporal Adversarial Network Using Traffic Incident Effects

Predicting non-periodic traffic congestion caused by sudden incidents (e.g., accidents and road damage) is crucial for advanced intelligent transportation systems. However, incident-driven congestion is difficult to forecast because incidents are extremely sparse, occur at specific times and locations, and have heterogeneous impacts depending on the traffic context. While recent deep learning approaches have significantly improved periodic traffic forecasting, their performance on non-periodic congestion remains limited, partly because incident records are not explicitly incorporated and their occurrence is strongly biased in space and time. To address these challenges, we propose CASTANET, which integrates spatio-temporal graph neural networks and causal treatment effect estimation to utilize incident records while mitigating selection bias. Experiments on real-world traffic data and accident records from Tokyo, which we treat as incidents, show that CASTANET reduces RMSE by 4.0% overall compared to the best baseline and by 10.1% on incident-conditioned evaluation, with gains reaching 14.55% under severe congestion.
Read the full abstract

All authors Toshiya Kitahara, Ryu Shirakami, Koh Takeuchi, Hisashi Kashima

Nuclear Theory

Microscopic Realization of Topologically Quantized Alignment in Fast-Rotating Nuclei

We present the first quantitative microscopic realization of topologically quantized alignment in a finite nuclear system. The realization is obtained by exact diagonalization of a cranking seniority model, with the first Chern number evaluated over the sphere of cranking-axis orientations and analyzed together with the orientation-averaged alignment and cranking-frame configuration probabilities. The Chern number changes in integer steps as the system evolves from initially paired configurations to increasingly aligned configurations. A new intermediate phase is found in which the Chern number is already nonzero while the alignment continues to evolve toward its quantized value. We show that this deviation originates from the competition among pairing, axial quadrupole splitting, and Coriolis mixing. Thus, our microscopic approach reveals a more nuanced emergence of topologically quantized alignment in realistic nuclei, providing a quantitative stepping stone toward experimental investigations.
Read the full abstract

All authors Ganlong Ding, Sibo Wang, Hiroyuki Tajima, Daisuke Suzuki, Jing Peng, Haozhao Liang

Artificial Intelligence

A Deep Learning-Based Stacking Ensemble Framework for Turbofan Engine Remaining Useful Life Prediction

This study proposes a two-level stacking ensemble framework for Remaining Useful Life (RUL) prediction of turbofan engines, evaluated on the NASA C-MAPSS benchmark using the FD001 and FD003 subsets. The framework integrates four heterogeneous deep learning base learners: Long Short-Term Memory (LSTM), Convolutional Neural Network (CNN), CNN-LSTM, and CNN-GRU, whose out-of-fold predictions are combined by an XGBoost meta-learner to capture complex degradation patterns while mitigating individual model biases. Comprehensive experiments demonstrate that the stacking ensemble achieves superior predictive performance, with Root Mean Square Error (RMSE) of 9.989 and 8.613, Mean Absolute Error (MAE) of 7.081 and 5.195, and R-squared values of 0.899 and 0.906 for FD001 and FD003, respectively. Compared to the best-reported baseline (TCAT: RMSE 11.12 and 11.02), the proposed method achieves RMSE reductions of 10.2 percent and 21.8 percent for FD001 and FD003, respectively. Feature correlation analysis, residual diagnostics, and training convergence curves validate the model's robustness. These findings underscore the efficacy of stacking ensemble methods for prognostics and health management in safety-critical aerospace applications.
Read the full abstract

All authors Limon Bin Hossain, Md. Salehin Seyam, Md Rashedul Islam, Abdur Rahman, Md Sharifuzzaman

Geometric Topology

Entropy and domination for quasi-Hitchin representations

Let $S$ be a closed oriented surface of genus $g\geq 2$. We consider an $n$-pleated representation $\rho: \pi_1(S) \to \mathrm{PSL}_n(\mathbb{C})$ obtained by bending a Hitchin representation $\rho_0:\pi_1(S) \to \mathrm{PSL}_n(\mathbb{R})$ along a maximal geodesic lamination. The space of such $n$-pleated representations was recently introduced by Maloni-Martone-Mazzoli-Zhang who provided a parametrization via shear-bend cocycles. Our main result is that $\rho_0$ dominates $\rho$ in the Hilbert length spectrum and the translation-length spectrum, with a strict domination for $\textit{most}$ curves, that we call $\textit{statistical}$ domination. Using this, we prove some entropy rigidity results: namely, the Hilbert entropy of any quasi-Hitchin representation in the bending fiber is strictly greater than that of $\rho_0$, the same for the translation length entropy when $\rho_0$ is $n$-Fuchsian, and in the latter case a new proof that for hyperconvex representations the Hausdorff dimension of the full limit set increases. The proof involves analyzing the weighted planar networks for finite approximants of the monodromy matrix, and establishing a strict matrix domination for generic monodromy using the equidistribution of closed geodesics in the unit tangent bundle of $S$.
Read the full abstract