Peer Revenue Now accepting positions

Papers

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

All of arXiv

Sunday 8 November

Systems and Control

GFM Control Automatic Compliance Toolbox

The increasing penetration of converter-interfaced generation reduces system inertia, short-circuit strength, and voltage support. European grid codes, including the ENTSO-E Network Code on Requirements for Generators and the ACER Demand Connection Code, now define disturbance-based validation procedures for grid-forming (GFM) generation and converter-based demand. Commercial RMS tools, however, lack an integrated workflow aligned with these recent requirements. This paper presents an automated Python-PowerFactory compliance toolbox and an RMS test bench for a co-located system comprising a 1 MW GFM photovoltaic (PV) plant, a 0.3 MW GFM battery energy storage system (BESS), and a 1 MW converter-interfaced dynamic load at a 20 kV point of common coupling fed from a 110 kV grid. Extended virtual synchronous machine models and a DCC-oriented load model are tested in batch, with results automatically extracted and plotted for assessment. Results show compliant RMS performance for the slower, electromechanical tests, while the paper identifies which tests require complementary electromagnetic transient (EMT) verification.
Read the full abstract

All authors Tejas Kunbi, Rahul Rane, Dan Wu, Aleksandra Lekić

Game Theory

Welfare in Envy-free Contracts: When Agents Have Sparse Interests

We study welfare maximization under envy-free contracts, where a principal assigns tasks and offers success-contingent payments to heterogeneous agents with hidden effort. For unit-demand agents, we establish a sharp complexity boundary: the problem is polynomial-time solvable when each agent is interested in at most two tasks, but NP-hard with at most three interests. Our algorithm analyzes tree-structured dependencies among forced assignments and reduces optimization to maximum-weight independent set in a perfect graph. When agents may receive multiple tasks, no polynomial-time constant-factor approximation exists unless $\mathrm{P}=\mathrm{NP}$. Finally, with homogeneous success probabilities and rewards, we establish a welfare- and revenue-preserving equivalence between unit-demand contract design and envy-free pricing. This yields polynomial-time welfare maximization without restricting interests, while revenue maximization remains NP-hard.
Read the full abstract

Plasma Physics

Regulating pedestal pressure profile by microtearing modes in the EAST tokamak

The pedestal pressure profile plays a critical role in determining the overall confinement of tokamak fusion plasmas. This letter reports the first evidence on regulating pedestal pressure profile by microtearing modes (MTMs) via limiting the pedestal gradient, which was thought to be limited by kinetic ballooning modes over the last decades. This is observed in an ITER-baseline-like target plasma in the EAST tokamak. MTMs arrest the recovery of pedestal electron temperature (and hence pressure) by clamping its gradient at a critical value while leaving the density profile essentially unaffected. Global fluid and local gyrokinetic simulations confirm the excitation of MTMs when the pedestal electron temperature gradient exceeds a threshold value in this experiment. This finding reveals MTMs as an alternative electromagnetic micro-instability that imposes an additional constraint in determining the pedestal structure in tokamaks.
Read the full abstract

All authors Jinze Shi, Youwen Sun, Kaixuan Fan, Tonghui Shi, Shifan Wang, Hailin Zhao, Qing Zang, Ziqiang Zhou, Hua Yang, Xuemin Wu, Jinyue Liu, Haoyu Nan, Qun Ma, Hui Sheng, Jinyi An, Jian Xu, Shuai Gu, Huihui Wang, Kaiyang He

Machine Learning

MCSA: Multi-Cutoff Spectral Aggregation in SO(3) Equivariant GNNs for Interatomic Potentials

Machine Learning Interatomic Potentials (MLIPs) based on Equivariant Graph Neural Networks (EGNNs) have achieved remarkable progress in atomistic modeling. However, accurately representing atomic interactions across different spatial scales remains challenging. In this work, we investigate the radial spectral properties of SO(3)-equivariant message passing and establish that the cutoff radius controls the characteristic spatial-frequency scale of radial interactions. Based on this analysis, we propose Multi-Cutoff Spectral Aggregation (MCSA), a plug-and-play module that aggregates radial kernels with different cutoff radii to enrich multi-scale geometric representations. To achieve efficient implementation, we exploit the compact support of radial kernels to fuse cutoff-dependent radial weights before angular tensor-product operations, avoiding redundant angular computations while preserving rotational equivariance. Extensive experiments across representative EGNN backbones demonstrate consistent improvements in energy, force, and stress prediction, as well as enhanced accuracy in higher-order properties, including phonon dispersion and lattice thermal conductivity. Further evaluations on layered materials with distinct interaction scales demonstrate the effectiveness of physically motivated cutoff selection. Code is available at: https://github.com/JF-Tan/MCSA.
Read the full abstract

All authors Junfu Tan, Mengfan Wu, Yu Zhu, Yu Shi, Yifang Qin, Chang Liu, Bonan Zhu, Ziheng Lu

Mesoscale and Nanoscale Physics

Electron cooling mediated by transverse optical phonons in doped SrTiO$_3$

Soft transverse optical (TO) phonons in doped SrTiO$_3$ couple to electrons through the polarization field, quadratically in the paraelectric phase and, additionally, linearly in the polar phase due to the onset of spontaneous polarization. We investigate heat flow between a three-dimensional electron gas and soft TO phonons. For two-TO-phonon scattering, the heat flow of hot electrons crosses over from $T^5$ to $T^3$ at the Bloch-Gruneisen temperature. In the polar phase, an additional one-TO-phonon channel emerges, yielding a softer temperature dependence of the heat flow, $T^3$ at low and $T$ at high temperatures, with the spectral weight set by the spontaneous polarization. This channel may dominate at low temperatures and leads to a nonmonotonic temperature dependence of the heat flow in the vicinity of the polar transition.
Read the full abstract

Machine Learning

Do Feature Interactions Break Explainability? Provable Explanations for Any-Order Neural Additive Models

Post-hoc explanation methods for neural networks are often heuristic and lack provable guarantees. A common alternative to such methods that was studied in recent years is to compute a cardinally-minimal subset of input features that is provably sufficient to determine the model's prediction. For general neural networks, however, finding such explanations is computationally intractable. In contrast, recent work showed that this problem becomes more tractable for a particular family of neural networks, namely neural additive models (NAMs), though standard NAMs are highly restrictive because they exclude feature interactions altogether. In this work, we study the computation of provably minimal and sufficient explanations for neural networks with restricted feature interactions, bridging the gap between fully general neural networks and purely additive models. We first prove that even with constant-order interactions, the problem is $\Sigma_2^P$-hard, implying that worst-case exponential complexity is unavoidable. We then identify two provably tractable settings: one based on sparsity in the interaction structure and another based on a stronger interaction-aware notion of sufficiency. Under either of these settings, we develop algorithms that compute provable explanations for neural networks with any-order interactions while retaining much of the computational efficiency of additive models. Empirically, we show that these explanations are significantly smaller and faster to obtain than those produced by standard algorithms, while being derived from models that achieve much higher accuracy than standard NAMs. Overall, our results help expand the class of neural networks that admit efficient provable explanations, while clarifying the fundamental role of feature interactions in shaping their complexity.
Read the full abstract

All authors Idan Refaeli, Yizhak Yisrael Elboher, Guy Katz, Shahaf Bassan

Machine Learning

SGA-Sparse: Training Native SwiGLU Gates for Activation-Sparse and Low-Bit LLMs

Activation sparsity can reduce FFN weight traffic during single-user LLM decoding, but active channels must be identified early enough to avoid fetching unused weights. In pretrained SwiGLU models, training-free routing with the native gate performs substantially worse than routing with the up activation at high sparsity. We show that this ordering reverses after sparsity-aware training. Based on this insight, we introduce SGA-Sparse, which converts pretrained SwiGLU LLMs into fixed-budget activation-sparse models by training the existing gate projection directly as a top-k router. SGA-Sparse updates all model parameters end-to-end while preserving the original SwiGLU activation and introducing no auxiliary router parameters. After approximately 30B training tokens, LLaMA models from 1B to 8B achieve uniform per-token 75-85% FFN channel sparsity while remaining within 0.2-2.7 pp of their original dense checkpoints in average zero-shot accuracy. Because post-training quantization degrades sparsity-trained checkpoints, we further study two complementary quantization-aware training (QAT) recipes: continued-QAT largely recovers performance at 4-bit weight quantization, while joint-QAT performs better for the more aggressive sub-4-bit target. To compare activation sparsity with dense low-bit quantization, we translate the sparsity-induced reduction in weight traffic into an equivalent bit-width. Under this unified weight-traffic metric, our 2.5- and 1.5-bit-equivalent models establish a new accuracy-traffic Pareto frontier: the 2.5-bit-equivalent models match dense 3-bit QAT accuracy, while the 1.5-bit-equivalent models approach dense 2-bit models and outperform dense ternary models by 1.3 pp on average. These results establish native-gate training as a practical approach for combining high FFN sparsity with low-bit weights.
Read the full abstract

Analysis of PDEs

Support of stochastic porous medium equations on bounded domains

We study the spatial support of stochastic porous medium equations on bounded domains. Under a local nondegeneracy condition, additive noise gives full distributional support at every fixed positive time. For the Dirichlet problem with nonlocal multiplicative noise, we prove that the solution is either identically zero or has full support; excluding the zero state requires a separate non-hitting assumption. For a Neumann model, nonzero initial mass excludes the zero state and yields full support. The proofs combine Galerkin approximation with terminal Malliavin estimates. Numerical results illustrate the propagation mechanisms.
Read the full abstract

Systems and Control

Grid-forming Control of Offshore Wind through a Diode-Rectifier HVDC System: a 2 GW Case Study

Diode-rectifier-unit (DRU)-based high-voltage direct current (HVDC) transmission considerably reduces the volume and weight of the offshore converter platform for remote wind farms and, hence, its cost, but shifts the task of forming and regulating the offshore AC network to the wind-turbine converters. This paper examines which grid-forming control strategy is the most suitable for DRU power transfer. The DRU commutation relationship shows that the delivered active power depends on the offshore voltage magnitude (but not on the converter voltage angle), so the angle-based active-power loop of virtual synchronous machine control is not closed through the rectifier. A $P-V/Q-{\omega}$ grid-forming architecture, which regulates active power via the voltage magnitude and derives frequency from the reactive power error, is therefore adopted. Electromagnetic transient simulations of a 1GWaggregated grid-forming turbine on a 66 kV collector network with a $\pm$525 kV bipolar DRU link show that the commanded power is delivered over 800 to 1000MW with the offshore voltage held near nominal. The paper also examines how grid-forming operation changes the allocation of control duties within the Type-4 turbine: once the grid-side converter forms the network, DC link regulation must move to the machine-side converter, which limits the achievable bandwidth of the DC-link control. Extending the system to 2 GW with two 500 MW grid-following units achieves full power transfer in simulation, but with the grid-forming converter loaded beyond its continuous rating and a steady-state offshore frequency deviation of approximately 1.8 Hz.
Read the full abstract

All authors Ishi Nigam, Saif Alsarayreh, Tuanku Badzlin Hashfi, Miloš Cvetković, Joris van Doorn, Aleksandra Lekić

Machine Learning

EbbFlow: PINN-Inspired Progressive Curriculum for MeanFlow Training

MeanFlow learns interval-average velocity for few-step generation, but its fixed temporal sampler mixes diagonal and interior supervision throughout training. We interpret temporal coordinates as collocation points: diagonal samples provide a stochastic boundary target, whereas finite intervals supply a differential-consistency target. The diagonal fraction controls how often the consistency component appears, while interval length enters its gradient through an explicit factor. Motivated by this distinction, EbbFlow uses Temporal Supervision Allocation (TSA) to schedule the diagonal fraction and interval geometry. It starts with diagonal supervision, then admits interior samples and expands their maximum interval; a left-anchored interval law preserves coverage across time. The per-sample loss, target, backbone, and inference procedure remain unchanged. In matched class-conditional ImageNet $256\times 256$ runs without classifier-free guidance (DiT-B/2, one training seed per method, 400k updates), EbbFlow achieves 50k-sample FID of 39.65 at one network evaluation and 36.02 at two-evaluation ODE sampling, versus 44.82 and 39.86 for MeanFlow. Gradient probes show a mid-training difference in component geometry. Ablations support allocation scheduling and left-anchored intervals, although a fixed full-horizon variant performs better at one evaluation. These results suggest that temporal sampling is a useful training control whose benefits depend on the inference protocol.
Read the full abstract

All authors Mengfan Yuan, Xunheng Kuang, Jianbin Chen, Lei He

Information Theory

A Characterization of $q$-Ary $2$-Designs and a $3$-Design Obstruction for Doubly-Extended Reed-Solomon Codes

Let $\mathcal{C}_k$ be the doubly extended Reed–Solomon code with parameters $[q+1,k,q-k+2]_q$, where $q\ge3$ is a prime power and $2\le k\le q$. We prove a conjecture of Wu and Zhou by showing that the minimum-weight codewords of $\mathcal{C}_k$ do not form a $q$-ary $3$-design when $2\le k\le q-1$. Using shortening, we extend this obstruction to every nonempty weight class with $3\le w<q+1$. We also establish that each individual nonempty positive-weight class of $\mathcal{C}_k$ forms a $q$-ary $2$-design if and only if $\gcd(k-1,q-1)=1$. Consequently, every nonempty positive-weight class below full support has exact $q$-ary design strength $2$ when this coprimality condition holds, and $1$ otherwise.The three-design obstruction follows by applying a classical subset-product character identity to a marginal covering count for three prescribed nonzero symbols. The comparison between weights rests on a covering-count formulation of the classical MDS coset-weight relations. For every linear $[n,k,d]_q$ MDS code with $2\le k\le n-1$, this formulation shows that the $q$-ary $2$-design property at any one nonempty positive weight is equivalent to the same property at every nonempty positive weight.More generally, for $2\le t\le\min\{k,d\}$, we prove that the $q$-ary $t$-design property at any $t-1$ distinct nonempty positive weights forces it at all nonempty positive weights.
Read the full abstract

Networking

Edge Computing for Computer Vision in IoT: Feasibility and Directions

The convergence of decentralized architectures integrating Machine Learning, Computer Vision and Low Power Wide Area Networks is increasingly becoming an integral part of our daily existence. Internet of Things serves as a real-time data conduit enhancing decision making via embedded technology and continuous data exchange. This paper explores the feasibility of Edge Computing as a foundational pillar in this evolving landscape. We experiment under real world, dynamic conditions, evaluate the technological aspects, strategies, process flows and key observations under the broad Edge Computing domain. Research pathways include Multi-access Edge topologies in future 6G networks, model quantization, and satellite-enhanced communication platforms. Additionally, a discussion is added supporting the advanced AI functionalities, including zero-shot learning, multi modal perception, and decentralized generative AI, thereby broadening the scope of intelligent applications across various domains. The significance and research objective of this study are threefold: (1) evaluation of LoRaWAN and satellite IoT communication strategies, (2) analysis of CV workloads on edge hardware and (3) future research directions where Edge Computing can support low-latency, energy-efficient and socially impactful IoT applications. By explicitly addressing these aspects, we aim to establish a clear link between the technological feasibility, ultimately with a practical and socioeconomic relevance.
Read the full abstract

Machine Learning

scBIG++: Learning Across Genes and Cells to Predict Single-Cell Perturbation Responses

Predicting single-cell transcriptional responses to genetic and chemical interventions supports gene-function discovery and regulatory analysis. Existing studies often focus only on highly variable genes, restricting the expression changes available for downstream analysis. Cells exposed to the same intervention can also show heterogeneous expression responses, with coordinated gene programs active to different degrees. We propose scBIG++, a full-gene perturbation prediction framework that models this heterogeneity by connecting expression-adaptive gene modules with population-conditioned generation. To preserve shared gene structure while accommodating cellular variation, Gene-Relation Clustering organizes genes into common windows, within which Dynamic SoftSub learns expression-dependent submodule memberships. This shared organization enables Set-GCAE to exchange information about corresponding gene groups across control cells, placing individual representations in their source-population context. The cell representations initialize a latent flow, while their pooled summary and the perturbation representation condition response generation. Generated states are decoded into expression profiles covering all assayed protein-coding genes retained after preprocessing, supporting comprehensive analysis of perturbation-induced expression changes. Experiments across six genetic and chemical settings spanning 6,539–19,451 genes demonstrate competitive perturbation-effect recovery and full-gene expression reconstruction under unseen targets and combinations, cross-cell-line transfer, and held-out compounds. Our implementation is available at https://github.com/ttruan2426-dot/scBIG.
Read the full abstract

All authors Jiafa Ruan, Zican Qiao, Zongxin Yang, Ruijie Quan, Yi Yang

Software Engineering

Replay Fidelity in LLM Agent Evaluation: Randomness, Hidden State, and Test Oracles in AppWorld

Reproducibility in large language model (LLM) agent evaluation depends on replay fidelity: which parts of an execution trace are reconstructed, controlled, and compared. This matters for agent debugging, failure analysis, and counterfactual evaluation of stateful tool use. We audit all 71 unsuccessful executions in a fixed historical AppWorld corpus using 284 isolated fixed-code replay attempts. Reconstructed declared settings admit 42 cases under printed-output, pre-oracle database-delta, and native-verdict/test-count checks; resetting the random-number generator before each interaction admits 68. The 26-case gap contracts to four under database/oracle checks, with one endpoint unknown. Mechanism studies identify four materialized-state discrepancies despite matching outputs and verdicts. In one admitted endpoint pair, an identical API call yields matching responses but different row effects; common future Python RNG removes that deterministic difference in two paired repetitions. A separate JWT credential-equality program and alignment controls expose authentication/write differences, with missing repetitions retained. For all 10 affected post-oracle export cases, native export from retained output trackers restores the reference comparison without changing original cached contents. A purposeful 12-case BFCL pilot shows no discrepancy under its tested public-state, return, and verdict checks. We preserve resource censoring and infrastructure deviations. The contribution is a bounded empirical characterization of replay eligibility, hidden state, and test-oracle integration, without estimating debugger accuracy, repair gains, or method-ranking distortion.
Read the full abstract

Systems and Control

Spot Markets for AI Inference: Dynamic Capacity Allocation and Pricing on a Shared Accelerator Fleet

Inference providers size their accelerator fleets for the interactive peak and sell spare capacity through fixed discounts, such as batch tiers at half price. However, inference differs from conventional cloud capacity in four respects: capacity depends on the latency tier through batching, moving weights between models is slow and costly, spot demand can wait until its deadline, and power can bind. In this paper, we develop a framework for dynamic capacity allocation and pricing of AI inference on a shared accelerator fleet. We consider a provider that serves several models under a power cap and sells each model in an interactive tier with a speed promise and in a spot tier for preemptible work with a deadline. In each period, the provider chooses how many replicas of each model to keep loaded and what spot price to quote. We show that one interactive token displaces a fixed number $\rho_m>1$ of spot tokens, and that the optimal spot price lies midway between the interactive price and the effective cost of capacity in the deadline window, which is close to the prevailing half price only when the fleet is slack. We further show that a spot tier raises the optimal reliability of the interactive tier, and that placement should follow persistent demand shifts while prices absorb transients. Building on these results, we design a model predictive controller based on a linear program with explicit approximation bounds, which solves each period in milliseconds. Numerical experiments on a simulated week with a measured daily demand profile, a flash crowd, and a grid curtailment show that the controller raises profit by 7.4% over fixed half-price practice, captures 93% of the gain available with perfect forecasts, keeps the interactive promise through both events, and leaves spot buyers better off.
Read the full abstract

Computer Vision

Disentangling Where and When:Factored Spatio-Temporal Explanations for Video Action Recognition

Post-hoc explanation methods for video action recognition typically conflate spatial appearance and temporal dynamics into a single saliency or importance map. We propose a perturbation-based framework that disentangles these contributions into a spatial appearance mask ($M_a$) and a temporal motion mask ($M_m$). The two masks are jointly optimized against a frozen action recognition model through factored perturbation architecture, with nearest frame replacement to identify important temporal dynamics. A separation penalty discourages the appearance mask from spending budget on frames that the motion mask has already discarded. A ReLU-based area constraint penalizes explanations larger than an assigned budget. To evaluate these explanations, we introduce a separation protocol that sweeps spatial pixels and temporal frames independently, backed by proofs characterizing the proposed method. Across EPIC-Kitchens-55, EGTEA Gaze+, and Something-Something V2, our method attains the lowest deletion AUC against leading baselines while producing masks roughly five times sparser.
Read the full abstract

Software Engineering

NumericalDiff: Numerical Program Differencing via Value-Based Trace Alignment and Intervention

Numerical programs implementing the same computational task can exhibit different numerical behavior because of their execution stacks, program representations, or program logic. Source text and final outputs alone provide limited diagnostic information: numerical differences can propagate through corresponding computations, while distinct executions can produce equal outputs. We present NumericalDiff, an execution-based method that records assignment-level numerical events, aligns traces using a tolerance-aware longest common subsequence independent of variable names and source locations, and optionally reexecutes after replacing one intermediate value with its counterpart. Among the original and all single-intervention executions, it lexicographically maximizes matched events and minimizes unmatched events. NumericalDiff supports code comparison across language and framework front ends, currently including NumPy, PyTorch, JAX, C, C++, Fortran, and Octave. We evaluate NumericalDiff on 36 controlled cases comprising 675 pair/input instances: 36 execution-stack, 588 program-representation, and 51 program-logic instances. All 24 operator-injection instances expose trace differences, including three with tolerance-equal final outputs, while complete trace alignment is achieved for all 441 canonical cross-representation instances. Within the 51 program-logic instances, intervention improves 24 alignments and raises macro-average matching coverage from 0.4210 to 0.6513. The results show that value-based trace alignment and reexecution can delimit propagated numerical differences across heterogeneous implementations.
Read the full abstract

Multiagent Systems

Deterministic Narrative Gravity: Bridging Theory of Mind and Historical Simulation through ABM-LLM Architectures

Historical social simulation faces a fundamental reproducibility challenge: the stochastic nature of large language models (LLMs) introduces a digital butterfly effect that prevents exact replication across multi-turn runs. Furthermore, the inability to control low-level server parameters in commercial LLM hosting environments severely limits reproducibility. To overcome this opacity, we present a deterministic multi-agent framework coupling LLMs to an Agent-Based Modelling (ABM) pipeline grounded in Theory of Mind (ToM) and Cognitive Archaeology, and validate exact artifact identity within local, pinned execution environments using SHA-256 hashing. Run locally at temperature zero with clean per-call model reloads, the system injects differentiated cognitive states per turn through dissonance-driven behavioural modes and gated internal voices. Evaluating seven model configurations spanning 4B to 31B parameters against an ablated baseline reveals clear operational boundaries. Small models ($\leq$8B) suffer from context capacity overload, producing repetitive, specular dialogue loops. However, at $\geq$12B parameters, the ABM scaffolding breaks the monotonous response patterns seen in ablation. Crucially, these scaffolded models exhibit spontaneous diegetic expansion: they coherently expand scenario lore through tactically motivated, anachronism-free details rather than escalating into aggression. By resisting the structural pull toward premature scene closure, scaffolded sessions sustain an open terminal Narrative Vector ($V_N = \mathrm{Open}$ in 12/21 overall; 9/9 in official $\geq$12B configurations) whereas unscaffolded ablation never does (0/21). This framework provides a transparent, auditable benchmark architecture for virtual archaeology, with the full pipeline released as open-source software to enable independent replication.
Read the full abstract

High Energy Physics (Phenomenology)

The first-order phase transitions and gravitational waves from an effective theory inspired by four-stack intersecting D6-brane models

First-order phase transitions in the early Universe can generate stochastic gravitational-wave backgrounds in frequency bands targeted by proposed deci-Hz observatories. We study the gravitational-wave consequences of the right-handed gauge symmetry breaking $SU(2)_{R_1}\times SU(2)_{R_2}\to SU(2)_R$ in a Pati-Salam effective theory inspired by four-stack intersecting D6-brane models. The ultraviolet construction fixes the gauge structure and particle multiplicities, while the scalar masses and quartic couplings are treated as renormalized inputs below the supersymmetry-breaking scale. Using a one-loop finite-temperature potential with ring resummation, we follow a strongly supercooled transition at the few-TeV scale through nucleation, percolation, completion, and reheating. The leading-order friction diagnostic does not support a runaway wall, so sound waves dominate the gravitational-wave signal, with turbulence as a sub-leading contribution; the finite acoustic lifetime suppresses the peak. For the fast-wall reference case, the spectrum peaks at $f_{\rm peak}=0.611$ Hz with $h^2\Omega_{\rm GW,peak}=1.232\times10^{-11}$, in the deci-Hz band targeted by DECIGO and BBO. We present its dependence on the wall speed, renormalization scale, and thermal screening, together with a noise-only comparison for several proposed detector configurations.
Read the full abstract

All authors Haotian Huangfu, Tianjun Li, Qi Sun, Rui Sun, Wenxing Zhang

Computer Vision

DynOLAT: OLAT Video Prediction for Controllable Dynamic Full-Body Relighting

Accurate lighting response is essential for realistic dynamic human relighting, because shadows, highlights, and color changes should follow the target illumination in both direction and relative strength. Current learning-based relighting methods can generate visually plausible videos, but they often exhibit imprecise lighting responses: shadows and highlights may drift away from the target direction, and the output brightness may not faithfully follow the relative intensities in the target environment, making the result closer to appearance harmonization than controllable relighting. To address this issue, we propose DynOLAT, a generalizable OLAT video prediction framework for dynamic full-body humans. Instead of directly synthesizing a single relit appearance, our method predicts temporally consistent One-Light-At-a-Time (OLAT) basis videos from flat-lit inputs, and then linearly combines the predicted bases according to the target environment map. This OLAT-based formulation makes the directional response explicit in the predicted bases, while the relative lighting strength is determined by the linear weights derived from the environment map. We further introduce a dynamic capture pipeline and the first large-scale dynamic full-body OLAT dataset, comprising over 24 million frames from 224 identity-outfit combinations, where different outfits of the same person define separate combinations. Experiments show that DynOLAT responds more faithfully to variations in target lighting direction and relative intensity than the tested baselines, enabling controllable video relighting while preserving fine appearance details and temporal coherence. The dataset and processing tools will be publicly released to foster future research.
Read the full abstract

All authors Taoming Liu, Yinji ShenTu, Guangzhao He, Yudong Jin, Yukang Ye, Siyu Zhang, Fan Jia, Wei Hua, Hujun Bao, Xiaowei Zhou

Computer Vision

Viscot-steer: Disentangling and Transferring Visual Chain-of-Thought via Activation Steering

Visual chain-of-thought (visual-CoT), also known as "thinking with images", equips LVLMs with the ability to locate and use key visual evidence for reasoning. However, acquiring such visual-CoT capabilities requires costly post-training and tightly couples them to a specific backbone, making transfer to other LVLMs difficult. Existing cross-model transfer methods typically treat visual-CoT as a monolithic capability, using a unified representation that ignores the functional distinction between grounding and reasoning and introduces stage-irrelevant interventions. To address this problem, we propose Viscot-steer, a training-free activation steering framework for transferring visual-CoT capabilities across heterogeneous LVLMs. Specifically, Viscot-steer first disentangles visual-CoT into grounding and reasoning vectors and extracts them from the source-model layers associated with the corresponding capabilities. It then aligns the vectors with the activation space of the target model and steers the grounding and reasoning layers during bounding-box prediction and reasoning-trace generation, respectively. Across benchmarks covering high-resolution visual understanding, general visual perception and reasoning, and mathematical visual reasoning, Viscot-steer transfers capabilities from different visual-CoT models to architecturally diverse LVLMs and outperforms the strongest capability-transfer baseline by an average of 1.86 percentage points on the primary evaluation metrics.
Read the full abstract

All authors Ningning Wang, Beier Zhu, Xingyu Zhu, Kaiyun Yang, Xun Yang

Networking

Multi-Granularity Communication-Computing Resource Mapping for User Association in MEO-Assisted LEO Satellite Networks

Low-Earth-orbit (LEO) satellite networks are evolving into spaceborne communication-computing infrastructures. Their user association must jointly account for the radio link and the CPU, GPU, NPU, memory, cache, storage, energy, queue, and thermal states that determine executable service capacity. This paper studies a MEO-assisted LEO architecture in which medium-Earth-orbit (MEO) regional state aggregators collect and relay time-stamped telemetry, the network operation control center (NOCC) maintains the global logical resource view and makes the final association decisions, and LEO satellites provide access and onboard execution. We develop a multigranularity representation and service-primitive-driven mapping that converts a service-level request into a target-LEO-dependent quantized resource vector. The integer formulation, exact mixed-integer linear programming (MILP) reference, and a capacity-aware primal-dual algorithm share the same mapped objective. Experiments use real-world service bandwidth traces, a 1584-satellite LEO shell, multiple traffic seeds, controlled load and mapping error, delayed telemetry, and temporal sessions. Relative to static mapping, the proposed method improves realized utility by 10.64% and lowers end-to-end outage by 5.70 percentage points. Target quantization reduces signaling by 19.84% with negligible utility loss. Additional load, delay, temporal, runtime, and exact-MILP audits delimit the operating region and remaining mapping uncertainty.
Read the full abstract

All authors Yi Jing, Chunxiao Jiang, Jiawei Wang, Jiachen Sun, Yafeng Zhan

Combinatorics

On the Kőnig-Egerváry theorem for $k$-trees

The famous Kőnig-Egerváry theorem is equivalent to the statement that a graph is bipartite if and only if the matching number equals the vertex cover number for every induced subgraph. Bessy, Ochem, and Rautenbach (J. Graph Theory 91 (2019) 73-87) generalized this theorem to $k$-paths by introducing the class $\mathcal{G}_k$ of graphs where, for every induced subgraph, the maximum number of disjoint paths of order $k$ equals the minimum number of vertices intersecting all such paths. They provided complete structural characterizations of graphs in $\mathcal{G}_k$ for $k \in \{3, 4\}$, and for odd $k$ when no cycle of order less than $k$ is present. Inspired by this nice work, we extend the Kőnig-Egerváry theorem to $k$-trees (i.e., trees with exactly $k$ vertices). We define the class $\mathcal{J}_k$ of graphs where, for every induced subgraph, the maximum number of disjoint trees of order $k$ equals the minimum number of vertices intersecting all such trees, and provide complete structural descriptions of graphs in $\mathcal{J}_k$ for all $k \ge 3$.
Read the full abstract

Signal Processing

Synergizing CKM and ISAC for Environment-Aware Wireless Networks

Channel knowledge map (CKM) and integrated sensing and communications (ISAC) have emerged as two key technologies for sixth-generation (6G) and beyond wireless networks, enabling a new paradigm toward environment-aware system design. CKMs provide static or stochastic wireless environment information a priori by learning location-dependent mappings from transceiver positions to channel knowledge of various types, whereas ISAC exploits wireless signals to sense environmental objects in real time. CKM and ISAC have primarily been studied separately in prior works, while their integration offers a promising approach for enhancing the environment awareness of 6G networks and further improving both sensing and communication capabilities. On the one hand, sensing can support CKM construction by providing location-tagged measurements and richer environmental observations, while also enabling real-time CKM refinement in dynamic environments. On the other hand, CKM can enhance sensing by offering prior environmental information for clutter mitigation, and CKM and sensing information can be jointly leveraged to improve communications. This article provides an overview of the complementary interactions between CKMs and ISAC, with particular emphasis on three design approaches: sensing-assisted CKM construction and refinement, CKM-assisted sensing, and joint CKM- and sensing-enhanced communications. We also discuss future research directions for achieving environment-aware wireless networks.
Read the full abstract

All authors Juncong Zhou, Yilong Chen, Yuan Guo, Zixiang Ren, Han Hu, Jie Xu, Rui Zhang

Combinatorics

Independence number and odd dominating models

A dominating $K_t$-model, introduced by Illingworth and Wood [J. Graph Theory, 2025], is a sequence $(T_1,\dots,T_t)$ of pairwise vertex-disjoint subtrees of $G$ such that every vertex of $T_j$ has a neighbour in $T_i$ for $1\leq i<j\leq t$. Let $\text{had}_{\text{d}}(G)$ denote the maximum order of such a model. We prove two dominating-model analogues of improvements to the classical Duchet-Meyniel bound [Ann. Discrete Math., 1982]. The first extends a result of Kawarabayashi, Plummer, and Toft [J. Combin. Theory Ser. B, 2005]. Every $n$-vertex graph $G$ with $\alpha(G)\geq2$ satisfies $\text{had}_{\text{d}}(G)\geq(n+\omega(G))/(2\alpha(G)-1)$. Second, we prove a constant-factor improvement of the Duchet-Meyniel bound for dominating models: every graph $G$ satisfies $\text{had}_{\text{d}}(G)>0.51075n/\alpha(G)$. This qualitatively extends the results of Fox [SIAM J. Discrete Math., 2010] and Balogh and Kostochka [Discrete Math., 2011]. An odd dominating $K_t$-model is a dominating $K_t$-model with an assignment of one of two colours to each vertex of $V(T_1)\cup\dots\cup V(T_t)$, such that every edge of each $T_i$ is bichromatic and, for $1\leq i<j\leq t$, some edge between $T_i$ and $T_j$ is monochromatic. Let $\text{had}_{\text{od}}(G)$ denote the maximum order of such a model. Our constant-factor improvement of the Duchet-Meyniel bound relies on our next result: every claw-free graph $G$ satisfies $\text{had}_{\text{od}}(G)\geq 2\chi(G)/3$, generalising a result of Chudnovsky and Fradkin [J. Graph Theory, 2010]. The factor 2/3 is best possible [arXiv:2512.20392]. For $t\geq2$, we prove that every $n$-vertex graph with no odd dominating $K_t$-model has independence number at least $(n+t-1)/(2t-2)$. For the stronger notion in which every vertex of $T_j$ has a neighbour of the same colour in $T_i$, we prove the analogous results with $(n+t-1)/(2t-2)$ replaced by $(n+t-1)/(3t-3)$.
Read the full abstract

Machine Learning

Not Yet in the Profile: Uncertainty-Aware Dynamic User Profiling by Learning from Future Interactions

On the Web, user profiling builds compact user representations from interaction histories for efficient personalization, and dynamic user profiling updates them as users' behavior and preferences change. However, new user behavior can be ambiguous, and its interpretation differs across users. To address this, we introduce Uncertainty-aware Adaptive Profile Manager (UAPM), which separates the claims in a user profile from interpretations of new behavior that are not yet confirmed, through a Profile, a Buffer, and a Rulebook. UAPM records user-specific interpretation and update rules in the Rulebook, keeps ambiguous evidence in the Buffer outside the Profile as evidence for later decisions, and writes supported general and situational characteristics to the Profile. We train UAPM with Privileged On-Policy Distillation with Dual Specialization (POPD-DS), which learns from recorded future interactions during training without access to them at deployment. Its first stage, Dual Specialization, distills a stronger model into a current-only Student and a future-informed model that becomes the Teacher. In the second stage, privileged on-policy distillation (POPD), only the fixed Teacher receives future interactions and guides the Student's own management decisions alongside task rewards. Experiments on three Web personalization tasks show that UAPM outperforms multiple baselines under the same downstream input budget, improving on the best same-budget baseline by up to 5%.
Read the full abstract

Combinatorics

Weak Dissolution of Groups for Rearrangement

Suppose that $k$ of $n$ classrooms are to be dissolved and their students moved to the other classrooms so that the numbers of students in any two remaining classrooms differ by at most $d$. We give a necessary and sufficient condition on the numbers of students for this to be possible whichever $k$ classrooms are dissolved. Moreover, we determine how small the largest classroom can be when this is possible. In particular, when all classrooms have different sizes, the smallest possible size of the largest classroom is $d+\lceil (n-d-1)(n-d)/(2k)\rceil$ if $k<(n-d-1)/2$, and it is $n$ or $n+1$ otherwise. This extends the results of Siriseriwan and Sripatak, who studied the case $d=0$.
Read the full abstract

All authors Pholphum Kamthorntaksina, Teeradej Kittipassorn, Patid Srikirinth, Puttimet Tulabadee, Nattaporn Witchayapongkul

High Energy Physics (Phenomenology)

Holographic dissociation of tetraquark and hybrid meson in the spinning plasma

We explore the dissociation of the tetraquark \(Z_c\) and the hybrid meson \(\pi_1\) in a spinning quark-gluon plasma described by the planar limit of a spinning Myers-Perry black hole. Both states are treated within one holographic framework, using a non-quadratic dilaton profile whose parameters are fixed by the \(Z_c\) and \(\pi_1\) mass spectra. Spectral functions are computed in the longitudinal and transverse channels. The boost parameter and temperature both lower the peak height and broaden the width, and the effect is stronger in the transverse channel. In both channels, the heavier 2S states melt before the 1S states. Furthermore, the two exotic channels display distinct dissociation behaviors within the same effective framework. This provides a unified holographic approach to compare how different exotic states behavior, without requiring a dynamical calculation of their binding energies.
Read the full abstract

Artificial Intelligence

When Self-Consistency Hurts: The Hidden Cost of Majority Voting in Small Language Models

We study prompted chain-of-thought (CoT) with self-consistency (SC), i.e. sampling N traces and plurality-voting, on small language models, a regime where per-query compute budgets are tight yet SC is commonly applied with a fixed sample budget inherited from large-model practice, regardless of instance difficulty. Across two model families (Qwen-2.5-0.5B, Gemma-3-1B) at FP16 and MLX-Q4 (4-bit quantisation in Apple's MLX framework), on GSM8K and MATH-500, we run 8 per-task and 4 task-pooled experiments at n=200-400 with 1,000x paired-bootstrap confidence intervals (CIs). Our first result is an upper bound: an oracle gate deciding per prompt whether to invoke SC reaches 109-174% of always-SC's accuracy at 23-30% of its compute in all 12/12 cases, so at N=5 always-SC is dominated everywhere on our grid. That margin is exactly the rate at which SC flips correct greedy answers to wrong, here 3-10.5% of prompts, which on Qwen-Q4 x MATH-500 exceeds the wrong-to-right rate and leaves always-SC 3 pt worse than always-greedy. Our second result is a deployable approximation: a gate over greedy-pass signals skips 45-99% of SC calls, with bootstrap CI half-widths under 5 pt, removing 36-79% of always-SC compute. Accuracy retention at those operating points has point estimates of 98.1-98.8%, which we report as point estimates because their CIs are wide (lower bounds 76-86%) over an SC accuracy of only 15-36%. The evidence covers N=5 on two <=1B families and two math benchmarks, which is the scope we claim. Code is available at https://github.com/heywanrong/SiftSC.
Read the full abstract

All authors Wanrong Yang, Lingfang Li, Jun Zhang, Dominik Wojtczak

Computer Vision

Source-Anchored Visual Autoregression for Extreme Image Compression

In the extreme-low bitrate range below $0.01$ bpp, image compression becomes a constrained generation problem: the reconstruction depends on inferring plausible missing details while staying close to the input image. Autoregressive token models provide an efficient coarse-to-fine prior for this setting, but the transmitted early-scale tokens often leave object identity and texture underdetermined, which can lead to source-inconsistent reconstructions. We introduce Source-Anchored Visual Autoregression (SAVAR), a generative codec built on Visual Autoregressive (VAR) modeling. SAVAR transmits early-scale tokens and a compact caption. The tokens provide image-specific layout information, while the caption supplies global semantics. SAVAR reconstructs a partial VQ-VAE latent from the retained scales, maps it to the start-of-sequence initialization, and uses the same latent to condition the caption embedding before adaptive layer normalization, separating two roles that are typically driven by a shared condition in VAR-style generation. On the Kodak and CLIC2020 datasets in the extreme-low range, SAVAR reduces perceptual distortion relative to matched ARPC retained-scale operating points, lowering LPIPS by about $8$–$9\%$ and DISTS by up to $22\%$ at a lower bpp. It reconstructs a $512 \times 512$ image in about $218$ ms on one NVIDIA L20X GPU, retaining fast autoregressive decoding in the evaluated setting.
Read the full abstract

All authors Bingxin Wang, Yuan Lan, Yang Xiang, Yiqing Huang