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

Monday 14 September

High Energy Physics (Phenomenology)

Heavy-quark expansion at leading power for local QCD operators in gradient flow

Gradient flow provides finite-flow-time QCD operators, whose matrix elements can be computed on the lattice and related to renormalized QCD operators through perturbative matching. We develop a matching framework that relates local flowed-QCD operators to the corresponding operators in heavy-quark effective theory (HQET) at leading power in the heavy-quark expansion. By combining the flowed-QCD-to-HQET matching relation with conventional QCD-to-HQET matching, we obtain a mass-dependent conversion relation between flowed-QCD operators and renormalized QCD operators. As a first application, we calculate the one-loop matching coefficients for heavy-light currents and derive the corresponding conversion coefficients. We find that heavy-quark mass effects in the matching and conversion coefficients can be numerically important when the flow scale is not much larger than the heavy-quark mass scale, highlighting the need for mass-dependent matching in precision lattice applications of gradient flow to heavy-quark observables.
Read the full abstract

All authors Yun-Han Gui, Xin-Qiang Li, Xiang-Peng Wang, Ya-Dong Yang

Computer Vision

SparseTalk - Sparsifying 3D Gaussian Language Fields for Efficient 3D Visual Question Answering

3D Gaussian language fields provide an explicit, spatially grounded representation for 3D visual question answering (VQA), but their dense semantic features can require tens of thousands of embeddings per scene, resulting in substantial storage, memory, and inference costs. We investigate how much of this representation is actually necessary for downstream reasoning. Starting from a full embedding representation, we systematically sparsify its semantic embeddings, including the previously underexplored regime below a single image-equivalent block down to 8 visual tokens. We compare random, geometric, semantic, and joint spatial-semantic selection strategies and introduce an object-based sparsification method that distributes the token budget across detected object instances while retaining background context. Experiments on ScanQA and MV-ScanQA reveal substantial redundancy in dense Gaussian language fields. Strong VQA performance is retained with only a few hundred semantic embeddings, corresponding to less than 1% of the original representation. Object-based selection performs well relative to others, with only modest observed changes down to 256 tokens. At this budget, SparseTalk retains 0.80% of SplatTalk's 32,076-token inference input and 0.332% of the mean 77,207-Gaussian dense field, increasing inference throughput while reducing decoded-feature memory 125-fold.
Read the full abstract

Materials Science

Navigating Sparse Singlet Fission Chemical Space: An Intelligent Generative-Predictive Paradigm

Singlet fission (SF) offers a promising route to surpass the Shockley-Queisser limit by converting a photoexcited singlet exciton into two triplet excitons, thereby enhancing photovoltaic energy conversion efficiency. However, realizing efficient SF process requires stringent energetic requirements among low-lying excited states that render SF molecules intrinsically rare within the vast chemical space. This extreme sparsity presents a grand challenge for molecular discovery. Due to low hit rates and trial-and-error computational waste on nonviable structures, conventional high-throughput virtual screening faces significant constraints, even when accelerated by machine learning models. Here, we establish a synergistic generative-predictive framework for the targeted inverse design of SF molecules by integrating a structure generator, a properties predictor and a multi-criteria validation workflow. By continuously coupling generative exploration with SF predictive models, the framework progressively enriches SF species and achieves a success rate of approximately 90% in generating molecules that satisfy the target SF energetic criteria. High-throughput evaluation of about 100 million generated structures with time-dependent density functional theory (TDDFT) validation of just a random 1% subset confirmed a 90.8% success rate for SF candidates. All together, we constructed an SF database of 283,559 candidates with favorable energetics of excited states and synthetic accessibility. From it, we identified a key fragment strongly associated with the requirements for SF, namely, CN([O])N(C)[O]. These findings establish an efficient route for overcoming the sparsity difficulty in SF molecular discovery and provide interpretable design principles for the development of novel excited-state functional materials.
Read the full abstract

All authors Longfei Lv, Li Fu, Si Zhou, Lingzhi Zhao, Jijun Zhao

Materials Science

Demonstrate of High-Performance Top-Gate ALD Crystalline In2O3 Transistor Enabled by Lattice-Matched HfO2 and In2O3 Heterostructure

In this work, we demonstrate high-mobility top-gate (TG) atomic-layer-deposited (ALD) crystalline In2O3 transistors through simultaneous interface and crystallinity engineering. First, a HfO2/In2O3/HfO2 stack is employed, enabling epitaxial-like crystallization of the ultrathin In2O3 channel, because of the lattice matching between monoclinic phase HfO2 and cubic phase In2O3. Second, an oxygen-rich gate insulator process is applied using high-dose O3 precursor and elevated deposition temperature, effectively suppressing oxygen scavenging during gate dielectric deposition, significantly reducing interfacial defect formation. Third, the homogeneous In-O bonding network in crystalline In2O3 exhibits substantially enhanced resistance to oxygen scavenging by source/drain contacts, which significantly improves the immunity to threshold voltage (VTH) roll-off at short channel length compared to amorphous In2O3. As a result, high-performance TG long-channel In2O3 transistors are achieved with a high mobility of 163 cm2/V s and a steep subthreshold slope of 64 mV/dec. High-performance TG short-channel In2O3 transistors with high ION of 1650 {\mu}A/{\mu}m at VD of 1 V, large on/off ratio over 1010 and VTH of -0.27 V are demonstrated. These results establish lattice-engineered crystalline In2O3 as an effective strategy for high-mobility, aggressively scaled TG oxide transistors suitable for BEOL-compatible applications.
Read the full abstract

All authors Kai Jiang, Chen Wang, Ziheng Wang, Zhiyu Lin, Mengwei Si

Artificial Intelligence

HazardAuditor: From Executable Threats to Safer Computer-Use Agents

Computer-use agents increasingly interact with browsers, terminals, file systems, and external services, introducing safety risks that emerge through runtime behavior rather than generated content alone. Existing guard models target static prompts and responses and are poorly suited to agent execution; existing executable safety platforms produce evaluation verdicts rather than the normalized supervision a guard model needs to learn across heterogeneous agent frameworks. We introduce HazardAuditor, an execution-grounded framework that closes both gaps. Its infrastructure runs heterogeneous agents (Claude Code, Codex, Hermes, and OpenClaw) in controlled environments and normalizes their interactions into a canonical event representation for cross-framework supervision. We further observe that token-level post-training objectives create a structural mismatch for generative guards, causing longer rationales to dominate gradient updates. Guard Policy Optimization (GuardPO) addresses this by converting deterministic safety outcomes into sequence-level advantages and normalizing rationale and verdict regions, making the safety decision the effective unit of optimization. Across multiple benchmarks and heterogeneous computer-use systems, HazardAuditor improves accuracy by up to 16.5 percentage points over the strongest prior guard. Code, models, and evaluation artifacts will be available at https://yunhao-feng.github.io/HazardAuditor/.
Read the full abstract

All authors Yunhao Feng, Ruixiao Lin, Ming Wen, Yanming Guo, Xingjun Ma, Yutao Wu, Xinhao Deng, Shouling Ji

Combinatorics

A proof of the resistance diameter conjecture for line graphs

We prove the conjecture of Xu, Li, Hua, and Pan that the resistance diameter does not increase under the line-graph operation. For every finite connected simple graph $G$ with at least one edge, we establish $D_r(L(G))\le D_r(G)$, with equality if and only if $G$ is a cycle or $K_4$. The proof combines an exact electrical representation of $L(G)$ by stars with a sharp budget inequality for the branch core. This inequality controls the combined error terms arising from the comparison of degree-two paths and is central to both the diameter bound and the equality analysis.
Read the full abstract

Statistics Applications

Temporal Seam Score for Assessing Continuity at Known Transitions in Time Series

Long environmental records increasingly combine observations from successive observing or processing systems. Transitions between these systems create temporal seams that may reflect imperfect harmonization or changes in the observed process. We introduce the Temporal Seam Score (S-score, or S), a signed, robust measure for assessing continuity at a known transition time. The complete time series is fitted with a seam-blind model accounting for trend, seasonality, and optional covariates. The residual contrast between symmetric windows around the transition is compared with matched reference contrasts calculated within the contributing segments. The S-score is the standardized departure of the seam contrast from this reference. An S-score near zero indicates that the seam is consistent with ordinary temporal variability. Its sign indicates the direction of the discontinuity, while its magnitude (|S|) indicates how exceptional the discontinuity is. Simulation showed that |S| reflects the imposed discontinuity relative to residual variability: a 20% shift produced a median |S| of 2.58 at a residual coefficient of variation of 0.10, compared with 0.84 at 0.50. In a MODIS-to-Sentinel-3 vegetation record, 121 of 500 sites yielded finite S-scores, of which 90 met all reliability criteria. Among these reliable sites, median S was +0.217 and median |S| was 0.627, indicating little systematic directional displacement and a median seam departure below one reference spread. The S-score provides a general and auditable diagnostic for evaluating temporal continuity across generations of sensors, algorithms, and observing systems without requiring temporal overlap, thereby supporting harmonization quality assurance and more reliable attribution analyses based on long-term environmental records.
Read the full abstract

Computer Vision

AdaVSkip: Adaptive Visual Token Skipping Across Layers For Efficient MLLMs Inference

Multimodal large language models (MLLMs) require substantial computation to process numerous visual tokens across all transformer layers. Most methods for efficient MLLM inference exploit horizontal redundancy by compressing visual tokens. Beyond token reduction, recent studies exploit vertical redundancy through early exit or fixed-layer skipping. However, we find that the extent and distribution of this redundancy vary across inputs and differ between self-attention and MLP modules. Motivated by these observations, we propose AdaVSkip, which equips each layer with two lightweight routers that independently determine whether visual tokens pass through by or skip the self-attention and MLP modules. These decisions collectively define an input-specific visual-computation path, but their discrete and non-differentiable nature makes learning effective paths challenging. To address this challenge, we develop a progressive two-stage training framework that updates only the routers while keeping the backbone frozen. Stage I establishes an initial routing policy through supervised training with input-specific targets derived from module-wise necessity scores. To further align the routing policy with task performance, Stage II uses reinforcement learning to optimize routing decisions with direct feedback from generated answers. It combines an answer correctness reward with a skip-consistency reward that discourages excessive retention of visual-token computation. Across three MLLM backbones, AdaVSkip maintains strong task performance with substantially less computation. On LLaVA-NeXT-7B, AdaVSkip reduces FLOPs by 53.2% while preserving the original model's average performance. Combining it with visual token compression increases this reduction to 91.2%, while retaining 97.2% of the original performance on average.
Read the full abstract

All authors Yuyao Sun, Tao Deng, Shuang Li, Deqing Wang

Software Engineering

woma: a real-time foundation model and its fine-tuned models for endoscopy

woma is a real-time foundation model for gastrointestinal endoscopy: a network trained without labels on about a million endoscopy frames, from which task models are fine-tuned. We contribute a systematic design for production. Requirements and pass marks were fixed before any run, eight candidates screened under pre-registered rules, self-supervised training taken to a stopping rule, then fine-tuning and deployment optimisation, all on one self-contained library, numbat. We also contribute woma itself with two fine-tuned models, every outcome reported met or missed. Our colonoscopy model finds and outlines polyps, names which colon segment is in view, suggests polyp type and grades bowel preparation. Our gastroscopy model names a station out of 22 protocol sites, flags and outlines lesions, and names one of seven findings. Every number was read on data never seen in training, and shipped weights were chosen on that record. In colonoscopy, 96% of polyps in a six-hospital PolypGen set are found at precision >=0.85, and 19 of 19 polyps across fifteen full REAL-Colon videos at 1.6 false alarms per procedure. In gastroscopy, landmark region is named correctly on 92% of frames from unseen patients, and 37 of 39 held-out neoplasia frames are flagged at specificity 0.91. On one workstation GPU every task runs over 1080p video at about 100 frames per second, faster than PyTorch, ONNX Runtime and TensorRT in all four precision regimes tested. TensorRT comes closest: one pass of our foundation model takes it 3 to 27% longer than ours, and we deliver 6 to 31% more frames per second from frame to results. A second build links no vendor library at all – our own kernels over Vulkan – so a site deploys two files and needs no toolkit, no cuDNN and no framework; in f32 it beats the CUDA build on the same card.
Read the full abstract

Artificial Intelligence

Medical Knowledge Simplification for Patients in the Era of LLMs: A Case Study on Diabetes

Complex medical information is often difficult for patients to understand, making effective medical knowledge simplification essential for improving patient comprehension, informed decision-making, and health outcomes. Recent advances in large language models (LLMs) provide a promising approach for simplifying complex medical information into patient-friendly language; however, their effectiveness in real-world patient education remains insufficiently explored through human evaluation. To investigate their practical effectiveness, this paper presents a case study on diabetes knowledge simplification through the implementation and evaluation of MediClear, an LLM-based medical knowledge simplification system enhanced with Retrieval-Augmented Generation (RAG). Public diabetes-related articles from Diabetes Australia, WHO, American Diabetes Association (ADA), NIDDK, and AIHW are indexed in the RAG knowledge base to retrieve clinically grounded information, which is then simplified by the LLM into accessible patient explanations. We evaluate the generated responses using standard readability metrics, including the Flesch-Kincaid Grade Level (FKGL), and conduct a human study involving 10 participants. Results show that MediClear consistently reduces the reading level of generated responses to the recommended patient literacy range while achieving high user satisfaction and willingness for future use. This case study demonstrates the potential of LLMs to improve the accessibility of medical knowledge for patient education.
Read the full abstract

All authors Pallika Kafle, Yipeng Zhou, Guanfeng Liu, Quan Z. Sheng, Cheng-Hsin Hsu

Machine Learning

Omni-Streaming Thinking

Streaming omni-modal models must decide what and when to answer from the video chunks and synchronized audio observed so far. Visual cues often support an interpretation before an utterance or sound event is complete. If that interpretation enters memory as a fact, later reasoning can keep relaying it even after audio contradicts it. We call this failure premature cross-modal commitment. We propose Omni-Streaming Thinking (OST), which generates structured outputs that include evidence observed so far, forecasts of future evidence, and claims based on this evidence. Each claim is initially marked as pending and linked to a future verification interval. Audio and visual evidence are stored separately, and OST checks a claim against the evidence from the specified modality at the end of the verification interval. When contradictory evidence is detected, a refutation process reduces the influence of the claim and its dependent states, and then guides a state update using the new evidence. An answer gate decides whether the answer-critical claims meet the conditions for giving a response. Using a frozen Qwen3-Omni-30B-A3B-Instruct backbone with lightweight adaptation, OST outperforms the strongest open baselines on five streaming and audio-visual benchmarks by more than 10% relative on average. We also introduce OST-DiagBench, which holds video fixed and edits audio to test agreement, absence, contradiction, coexistence, and subtitle-speech conflict. OST reaches d-prime = 2.95, compared with at most 1.38 for open baselines, while reducing vision-induced auditory hallucinations.
Read the full abstract

All authors Enjun Du, Siyi Liu, Ziyu Zheng, Jingyu Li, Yiwen Guo, Yongqi Zhang, Difan Zou

Astrophysics of Galaxies

A comparative analysis of the long-term optical variability characteristics of narrow and broad-line Seyfert 1 galaxies at z > 0.8

We present the results on a comparative analysis of the long-term optical variability characteristics of high-redshift narrow-line Seyfert 1 (NLSy1) galaxies and broad-line Seyfert 1 (BLSy1) galaxies. Our sample spanning the redshift range of $0.8 < z < 2.6$, comprises 2490 NLSy1 and 2490 BLSy1 galaxies matched in the optical brightness$-$redshift plane. We used V-band data from the Catalina Real-Time Transient Survey covering a baseline of 5$-$9 years, and g, r, and i-band data from the Zwicky Transient Facility spanning 5 to 6 years. To characterise variability we estimated the amplitude of variability ($\sigma_m$). We found that NLSy1 galaxies generally exhibit lower $\sigma_m$ compared to BLSy1 galaxies. In both the NLSy1 and BLSy1 galaxy samples, we observed a wavelength dependent variability using data from Zwicky Transient Facility, with $\sigma_m$ gradually increasing towards shorter wavelengths. We found an anti-correlation between $\sigma_m$ and Eddington ratio in the g, r, and i bands for BLSy1 galaxies, whereas this anti-correlation is observed only in the r and i bands for NLSy1 galaxies. For both NLSy1 and BLSy1 galaxies, we found no correlation between $\sigma_m$ in g, r, and i bands and black hole mass. In both the samples, we found that $\sim$90% of the sources showed a bluer when brighter trend. We found no significant time lag between variations in g and r bands in both BLSy1 and NLSy1 galaxies. The observed long-term trends in the optical light curves of our high redshift sample of BLSy1 and NLSy1 galaxies could be driven by variations in the accretion disk.
Read the full abstract

All authors Aratrika Dey, Stalin C.S., Akshith S., Suvendu Rakshit

Computation and Language

MoME: Mixture-of-Memory Embeddings for Context-Aware Sparse Lookup

Scaling large language models efficiently has motivated sparse capacity mechanisms such as Mixture-of-Experts and, more recently, conditional memory: token-indexed embedding tables that augment the backbone with cheap parametric lookups. Existing memory-embedding methods retrieve via a deterministic function of the surface form, which collapses different contextual senses of the same token (e.g., python the language vs. the animal) into a single fixed entry. We introduce Mixture of Memory Embeddings (MoME), a context-aware memory mechanism that replaces each token's single memory row with a mixture of M slots and uses a learned gate over the hidden state to choose which slots to read at each position. In controlled pretraining experiments across nanochat, Llama-3/MobileLLM, and Qwen3 backbones, MoME improves over Value Embedding, Bigram, and STEM baselines in iso-parameter and iso-training-FLOP settings, shows a more promising memory-size scaling trend at sub-billion scale, and remains efficient in training and inference. Qualitative routing analyses on polysemous tokens further suggest that the learned mixture exhibits a degree of semantic interpretability, dispatching the same surface token to distinct memory slots under different senses.
Read the full abstract

Plasma Physics

Two-length spatial correlation function of turbulence in TCV

Spatial correlation functions of density fluctuations are measured in the Tokamak à Configuration Variable (TCV) using a dual-channel Doppler backscattering (DBS) diagnostic. In certain cases, the spatial correlation function exhibits two characteristic length scales. By analogy with nonlinear reduced simulations, the presence of two correlation lengths may be indicative of avalanche-like transport. The correlation functions obtained from DBS are compared with those from short-pulse reflectometry measurements and show reasonable agreement. Both short- and long-range correlations are measured in the same plasma geometry for different heating powers. Short-scale correlation lengths are found to be on the order of 3-5 Larmor radii, while large-scale correlations extend over approximately 5-15 Larmor radii. The correlations are found to decrease towards the very edge of electron cyclotron heated discharges, coinciding with a narrow Er well.
Read the full abstract

All authors Olivier Panico, Pascale Hennequin, Sascha Rienäcker, Oleg Krutkin, Benoit Labit, Yanick Sarazin, the TCV team

Physics Education

Data-driven modeling in the introductory physics laboratory: Scaling analysis and data collapse in the specific heat of water experiment

We present a data-driven redesign of the classic specific-heat-of-water experiment that uses scaling analysis and data collapse for model construction rather than beginning with a previously established thermodynamic formula. The activity combines structured experimental and analytical guidance with instructor-mediated questioning, while the thermodynamic description is deliberately postponed. Students collect temperature-time data under different conditions and obtain a collapsed relation between the mass-normalized energy input and temperature rise through successive rescaling. They formulate an empirical model from this relation and test it using additional data not included in its construction. In the post-experimental discussion, the thermodynamic description shows that the fitted empirical constant characterizes the combined response of the water and calorimeter and approximates a quantity that depends weakly on water mass. Reanalysis of the mass-dependent data separates the two contributions, with limited precision over the available water-mass range. The copper cup is an intentional feature of the instructional design: its contribution is large enough to require physical interpretation but varies little enough over the explored mass range for the data to collapse approximately onto a single relation. The same apparatus thereby supports empirical model construction, thermodynamic interpretation, and separation of the component contributions.
Read the full abstract

2609.15124 · 14 Sep · 36 pages, 4 figures and 2 table. Earlier version posted on Jxiv (https://doi.org/10.51094/jxiv.4171). Version 1 substantially expanded the instructional framing and implementation materials; Version 2 streamlines overlapping discussion and strengthens the overall argument; Version 3 significantly improved the content following consultation

Machine Learning

Refinement-Based Flow Policy Optimization

Flow-based policies offer an expressive representation for online reinforcement learning, but conventional flow matching requires samples drawn from the distribution to be modeled. This poses a challenge when the desired action distribution is defined only implicitly by a Q-function, since directly sampling actions from the resulting distribution is generally intractable. We propose Refinement-Based Flow Policy Optimization (RFPO), a novel framework for training a flow policy in online reinforcement learning by alternating between Q-guided sample refinement and self-target flow matching. RFPO first generates actions from Gaussian noise using the current flow policy and then uses a finite-step stochastic refinement procedure to move them toward an energy-based distribution induced by the Q-function. Each refined action is then paired with its corresponding initial noise sample and used as a fixed target for flow-matching training. By repeatedly refining its own outputs and learning from the resulting targets, RFPO incorporates Q-guidance into the policy without requiring direct samples from the target distribution, while retaining the capacity to represent multiple action modes. We further provide a theoretical analysis of the distributional dynamics induced by RFPO. Across six continuous-control tasks, RFPO matches or outperforms a standard Gaussian-policy baseline on almost every task. Experiments on six synthetic two-dimensional target distributions with diverse geometries demonstrate that RFPO captures complex multimodal structure without mode collapse.
Read the full abstract

Software Engineering

DepthBenchCAD: When Does Deeper Auditing Yield More Reliable Conclusions?

Generative CAD models are expected to remain behaviorally correct after parameter edits, so increasing the number of edit checks is often treated as a direct route to more reliable evaluation. Under a fixed budget, however, auditing each program more thoroughly reduces the number of tasks and independent generations that can be evaluated, which can ultimately make model-level estimates less accurate. We study this phenomenon and the conditions under which it arises. We decompose behavioral evaluation into three evidence levels: task templates, stochastic generations, and within-program edits. We define an average failure risk that is invariant to audit depth, and combine three-level variance with measured execution costs to analyze the tradeoff between deeper edit auditing and broader independent coverage. Experiments across two CAD environments and five generation systems show that the value of deeper auditing depends on where evaluation uncertainty originates. When template heterogeneity or generation stochasticity dominates, additional edit checks can increase total estimation error; when within-program state variation is large and generation is expensive, deeper auditing is more valuable. Variance and cost estimates from calibration predict the direction of this change and provide a diagnostic basis for allocating evidence on held-out tasks. These results show that the thoroughness of program inspection can diverge from the reliability of model evaluation, and they help determine whether the next unit of budget should be spent on a new task, a new generation, or additional edit checks.
Read the full abstract

All authors Hongye Yang, Zhihao Xie, Shengjun Xiong, Boxiao Huang

Number Theory

The Dynamical Mordell–Lang Conjecture for Relatively Étale Systems over Products of Curves

We establish the dynamical Mordell–Lang conjecture over \(\mathbb C\) for endomorphisms that are relatively étale over arbitrary endomorphisms of finite products of smooth projective curves. In particular, we establish the conjecture for arbitrary endomorphisms of product of smooth projective curves and relatively étale skew products. The arithmetic input is our unconditional theorem for split endomorphisms over \(\overline{\mathbb Q}\), proved by reducing to a simultaneous Hasse principle for the local periods of critical points and analyzing local inertia in joint arboreal towers. We combine this arithmetic input with relative étaleness, simultaneous algebraic specialization preserving wandering base coordinates, prescribed-reduction \(p\)-adic embeddings, and \(p\)-adic interpolation to obtain the result in the complex case.
Read the full abstract

Computer Vision

DNF-SR: Dual-Input and Negative-Aware Feature Fine-Tuning for Real-World Image Super-Resolution

Benefiting from the powerful generative priors of diffusion models, diffusion-based real-world image super-resolution (Real-ISR) methods have demonstrated impressive performance.To achieve efficient Real-ISR, several recent works have designed one-step diffusion-based models.Howerver, unmediatedly feeding LR into a diffusion model creates a distributional gap with the model's original input.A straightforward approach to reduce the distribution gap is to introduce noise to the LR latents. However, directly adding noise inevitably corrupts the content of the LR images.In this study, we propose DNF-SR, a Dual-input and Negative-aware Feature fine-tuning method for Real-ISR.Specifically, we use a dual-input strategy that concatenates the original LR image with the noisy LR input and feeds them into a diffusion-based image editing model, ensuring both high-fidelity one-step super-resolution and improved perceptual and content consistency.Additionally, the noise present in the noisy LR input introduces randomness and diversity into the outputs. We exploit this property and propose a post-training optimization method, Negative-aware Feature Fine-Tuning (NF2T), which guides the model toward producing higher-quality results.NF^2T classifies multiple outputs into positive and negative subsets and then defines implicit policy improvement directions in both the image and feature spaces, thereby further enhancing the stability of the optimization.Extensive experiments show that DNF-SR outperforms other methods.Code will be released.
Read the full abstract

All authors Shuhao Han, Wenjie Liao, Hayden Vance, Hang Dong, Rui Zhang, Chun-Le Guo, Chongyi Li

General Relativity and Quantum Cosmology

Inspiral waveforms of charged compact binaries and observational constraints

Electric charges carried by compact objects can affect binary dynamics and imprint characteristic signatures on gravitational-wave signals. We derive next-to-leading-order post-Newtonian frequency-domain waveforms for charged compact binaries in both the gravitational-quadrupole and electric-dipole dominated regimes, including electromagnetic corrections beyond leading-order electric-dipole radiation that reduce the degeneracy between the component charge-to-mass ratios. Using gravitational wave events from GWTC-5.0, we place constraints on the charge-to-mass ratio and mass of each component of the binary system.
Read the full abstract

All authors Zi-Han Zhang, Wen-Hong Ruan, Tan Liu, Zong-Kuan Guo

High Energy Physics (Phenomenology)

Did LZ see modified gravity?

We investigate whether the recently reported high-energy nuclear recoil event by the LUX-ZEPLIN (LZ) collaboration can be interpreted as a signal of freeze-in dark matter (DM) in a non-standard cosmological history. We consider DM production from the Standard Model thermal bath during an era of modified expansion preceding Big Bang nucleosynthesis. Requiring consistency with the observed DM abundance, cosmological and collider constraints, we identify viable parameter regions that can accommodate the LZ event. Our results demonstrate the potential of direct detection experiments to probe non-standard cosmological histories and, more broadly, alternative theories of gravity.
Read the full abstract

Optics

Enhanced Spin-Orbit Interaction of Light through Complex Fresnel Reflection

Spin-orbit interaction (SOI) of light manifests as the generation of a spin-dependent vortex beam and the spin-Hall effect when a spin-polarized beam interacts with an optical interface at normal and oblique incidence, respectively. The weak SOI limits its widespread use for quantifying physical quantities in various applications. We demonstrate a significantly enhanced SOI effect, approaching the strong-coupling regime, by retroreflecting a nonparaxial focused beam of light at a multilayer dielectric mirror. The large difference in angle-of-incidence-dependent Fresnel reflection coefficients (r-TE, r-TM ) introduced by the mirror simultaneously enhances the spin-orbit-converted vortex-beam amplitude and the spin-Hall effect in the reflected beam. Near-field superposition of the orthogonal polarization components in the reflected beam yields a spatially nonuniform beam field with C-, V-, and L- polarization singularities. These topological features are mapped and are used to demonstrate the transverse and 3D spin-Hall effect in the focal region. The superposition of enhanced optical near-fields and the lossless broadband nature of the mirror reflectivity are expected to enable a variety of polarization topologies and to tailor their features via designed mirror reflectivities.
Read the full abstract

Materials Science

Ionic-Radius Mismatch as a Structural Lever for Tuning Phase Transitions and Luminescent Thermometry

The widespread implementation of luminescence thermometers requires a comprehensive understanding of the structural factors governing their thermometric performance. Establishing such structure-property relationships is essential for the rational design of sensing materials with application-tailored characteristics. This is particularly relevant for phase-transition-based luminescence thermometers, which offer exceptionally high relative sensitivities. The systematic analysis of K3Lu(PO4)2:Eu3+ demonstrates that introducing co-dopant ions with a controlled ionic-radius mismatch provides an effective strategy for tailoring phase-transition characteristics. This approach enables both the phase-transition temperature and thermal operating range to be controlled. Specifically, the transition temperature shifts from 210 K for K3Lu(PO4)2:Eu3+ to 310 K for K3Lu(PO4)2:Eu3+,10%La3+, while the operating range broadens from 30 to 60 K. Importantly, linear correlations between the ionic-radius mismatch parameter, {\Omega}, and the phase-transition temperature, enthalpy, and entropy provide a quantitative framework for controlling the thermodynamics of the transition through compositional engineering. Beyond luminescence thermometry, these relationships establish a general strategy for designing materials exhibiting first-order phase transitions with tailored thermodynamic characteristics, opening opportunities for their optimization across a broad range of functional applications.
Read the full abstract

All authors A. Javaid, M. Szymczak, A. Sieradzki, L. Marciniak

Representation Theory

New runner removal theorems for the cyclotomic Hecke algebras of type $G(r,1,n)$

For the Iwahori-Hecke algebras $\mathcal H_q(\mathfrak S_n)$ of the symmetric group $\mathfrak S_n$ at a primitive $e$-th root of unity, James and Mathas proved a theorem which relates $v$-decomposition numbers $d_{\lambda\mu}^{e}(v)$ for different values of $e$, by adding “empty runners” to the abacus display for the labelling partitions $\lambda,\mu$. Fayers proved a similar theorem, which involves adding “full” runners to these abacus displays. In this paper we use Uglov's map from the set of $r$-abaci for $r$-partitions to the set of $e$-abaci for partitions to extend these theorems to the cyclotomic Hecke algebras of type $G(r,1,n)$.
Read the full abstract

Optimization and Control

Integer Maximization over $\ell_p$ Balls: Hardness and Exact Algorithms

We study the problem of maximizing a linear function over the integer points of an origin-centered $\ell_p$ ball, which we call \BallIPp{p}. For every fixed integer $p\ge2$, we prove that the decision problem over an $\ell_p$-ball is NP-complete. We then focus on the Euclidean case and study how the difficulty of the problem depends on the numerical parameters of the instance. We give two complementary pseudo-polynomial exact algorithms. The first specializes a known radius-budget dynamic program; the same nonlinear-knapsack framework also applies to every fixed finite integer $p$. We then develop a complementary dynamic program over candidate objective values for the Euclidean case. The latter is polynomial in the encoding size of the radius and pseudo-polynomial in the magnitude of the cost coefficients. For a fixed objective value, feasibility can be formulated as a closest vector problem (CVP) instance. This connection gives an exact algorithm whose running time depends on the covering radius of that lattice. Conversely, we show that a rank-$k$ Euclidean closest-vector instance in ambient dimension $d$ reduces to the decision version of a Euclidean \BallIP{} instance in dimension $d+k\le2d$, transferring known bounds under the Exponential Time Hypothesis (ETH). Finally, we study dimension-dependent approaches based on proximity to the continuous optimizer and describe the fixed-level constructions that extend to ellipsoids.
Read the full abstract

Robotics

Legislating World-Model-Based Planning with Legal Reasoning

As robotic systems grow more general, legal norms are needed to integrate them into society. This paper extends the isomorphism problem of aligning legal source texts with their encodings, and measures two key challenges to robot normative control: (1) the grounding isomorphism gap, where perception error grounds false atoms for legal reasoning, and (2) the ontological isomorphism gap, where one legal conclusion admits many faithful translations into planning constraints. The paper introduces a legal planning stack that employs Defeasible Deontic Logic (DDL) to constrain a motion planner. The stack leverages learned world models to plan and to provide legal context, enabling ex ante governance that intervenes before an illegal action is executed. It was deployed on a simulated robot arm pushing a cube across a 3x3 grid. The findings were (1) the legislated agent abided substantially more often than the non-legislated one, and modeling perception uncertainty lifted abidance even further, (2) the legal reasoning ran efficiently at runtime and its verdicts were auditable, and (3) the stack adapted to exogenous signals and endogenous rule changes. Both gaps were measured: (4) world model and probe error corrupted the factual input for the DDL reasoner, and (5) a single law admitted several faithful metric interpretations yielding drastically different abidance. Thus, ex ante legislation functions as intended, and closing these gaps with a standardized mapping from the law to runtime constraints and improved fact grounding from perception will yield robust laws that align robot behavior with society's norms. Project page: https://dylanwaldner-cail.github.io/Legislated-Planner/.
Read the full abstract

All authors Dylan Waldner, Yiannis Kantaros, Guido Governatori, Risto Miikkulainen, Amir Banifatemi

Instrumentation and Methods for Astrophysics

Nii-MALA: A Fast Metropolis-Adjusted Langevin Sampler with Radial Velocity Benchmarks

Markov chain Monte Carlo is widely used for model assessment and parameter fitting in astronomy and astrophysics, leading to numerous ready-to-use packages implementing various sampling techniques. For large-scale analyses involving many individual targets, computational efficiency becomes paramount, as it dictates the overall runtime. We introduce Nii-MALA, a high-performance C implementation of the Metropolis-Adjusted Langevin Algorithm, which leverages Message Passing Interface for parallelization and incorporates automatic differentiation backends for gradient evaluation. The code offers flexible control via a configuration file, allowing users to specify the proposal step sizes for all model parameters across parallel chains. We validate its effectiveness on 15- and 30-dimensional Gaussian distributions and a bimodal distribution, and further benchmark it against several other codes using radial velocity data from 51 Pegasi b. Our benchmarks confirm the efficiency of Langevin sampling over random-walk sampling in obtaining the effective sample size, particularly as the dimensionality of the target function increases. This algorithmic advantage can be effectively leveraged when paired with an efficient automatic differentiation library. However, for complex functions commonly encountered in astronomy—such as radial velocity orbital fitting—the derivative-dependent Langevin sampler shows lower efficiency than parallel tempering or alternative sampling approaches, as revealed by effective sample size analysis.
Read the full abstract

All authors Jian Jiao, Sheng Jin, Wenxin Jiang, Dong-Hong Wu

Econometrics

Low-Rank Denoising for Predict-then-Optimize

A shortest-path decision is often made from edge costs that are only observed through noisy samples, such as the average of $m$ simulation replications. When the mean cost vectors of different instances lie near a $k$-dimensional subspace, projecting the averaged sample onto that subspace should remove noise. We make this precise. The mean squared error of any projection estimator splits exactly into a variance term and a bias term. The best projector is the positive eigenspace of $\Sigma_c - D/m$, where $\Sigma_c$ is the covariance of the true costs and $D$ is the noise covariance. For a rank-$k$ signal, the projection has the error of a sample mean with a factor $d/(\mu k)$ more replications, where $d$ is the number of edges and $\mu$ is an incoherence constant. For a signal that is only approximately low-rank, every rank-$k$ projection has an error floor, and the plain average wins beyond an explicit replication count. A margin bound shows that the chance of choosing a suboptimal path falls at the same improved rate. A projector learned from $n$ noisy instances loses at most an $O(d/n)$ term.
Read the full abstract

Analysis of PDEs

Pullback Attractors for a Non-Autonomous Plate System with Strong Damping and Delay

This paper addresses the existence of pullback attractors for a class of nonlinear non-autonomous strongly damped plate equations with delay. The model contains the biharmonic operator, the strong damping term, a nonlinear source term and a delay operator acting on the history of the solution. The interaction between the strong damping mechanism and the hereditary delay effect gives rise to several analytical difficulties in deriving uniform estimates and proving pullback asymptotic compactness. To overcome these difficulties, we construct a modified energy functional adapted to the strong damping structure and employ the contractive function method to handle the delay term in the history phase space. By establishing the existence and uniqueness of weak solutions, uniform pullback estimates and the pullback asymptotic compactness of the associated non-autonomous process, we prove the existence of pullback attractors for the strongly damped plate equation with delay.
Read the full abstract

All authors Xuxiao Hou, Bin Yang, Yuming Qin, Alain Miranville

High Energy Physics (Theory)

Hyperbolic monopole-type solutions in $SU(3)$ Yang-Mills theory

We construct $S^1$-invariant solutions of the $SU(3)$ pure Yang-Mills theory on four-dimensional Euclidean space using the Cho-Faddeev-Niemi decomposition and a harmonic map from $S^2$ into the flag manifold $F_3=SU(3)/U(1)^2$. The resulting ansatz reduces the full Yang-Mills equations to coupled radial equations. Solving the coupled equations, we derive two types of solutions: analytic self-dual solutions interpreted as noninteracting clusters of hyperbolic monopoles and non-self-dual numerical solutions that can be interpreted as hyperbolic monopole-antimonopole bound states. In the large-mass limit of the hyperbolic monopole-antimonopole bound states, their normalized action approaches the energy of the corresponding non-Bogomolny $SU(3)$ monopole in flat space.
Read the full abstract