Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Software Engineering

Engineering Reliable Commit Gates for Agentic AI: Cost-Aware Verification Portfolios under Common-Mode Data Failures

Agentic systems commit state-changing actions, but additional verifiers can inherit the same upstream fault. We present VP-CONTROL, a runtime-assurance design and deterministic benchmark for cost-aware commit gates. Its 48 task templates yield 2,880 scenarios across six fault regimes. A fixed-call 2 x 2 experiment separates verifier-model diversity from evidence-source diversity. On frozen proposals from two local actor families, a cross-model vote over shared evidence approves 62.9% of unsafe proposals, versus 22.9% with an independent source. The source effect is 40.9 percentage points, compared with 11.3 for model diversity. A portfolio controller selects verification plans using only deployment-observable metadata. Approximate cluster-adjusted calibration at a nominal 5% per-task target yields 1.9% unsafe execution and 38.2% automated safe coverage on the locked test. Matched-budget portfolios also improve on fixed verification policies. Transfer remains conditional: unseen fault families yield 16-26% risk, and a FinQA check fails to reproduce the source effect with the tested small verifiers. A preregistered live HTTP/SQLite study tests concurrent writes and lost responses. After-check races defeat verifier-only gates; transactional partial guards prevent only covered failures, while a full atomic guard records no unsafe effects across 216 episodes. Idempotent request identifiers prevent duplicate effects after lost responses. The results motivate explicit evidence lineage, cost-aware selection, and commit-time enforcement, while exposing the limits of approximate calibration and local-tool generalization.
Read the full abstract

All authors Zihao Zheng, Baichuan Li, Junyi Yao, Jiayu Long

Representation Theory

Quasi-Whittaker supermodules over Lie superalgebras

In this paper, we develop a general theory of quasi-Whittaker supermodules over Lie superalgebras induced from an arbitrary ideal. We determine the quasi-Whittaker vectors in universal supermodules, establish an irreducibility criterion, and classify several families of irreducible supermodules. The odd part produces a new irreducibility phenomenon absent from the Lie algebra setting. As applications, we determine all irreducible quasi-Whittaker supermodules over the $N=1$ super Schrödinger algebra and the $N=1$ $\frac{3}{2}$-conformal Galilei superalgebra, and over the complete spectrum-generating superalgebra in a special case.
Read the full abstract

All authors Wenting Gao, Baiying He, Shiyuan Liu, Jialin Xu

High Energy Physics (Theory)

Timelike Entanglement from Spacetime Density Matrices: A Lattice Realization

We investigate timelike entanglement in quantum field theory using spacetime density matrices and provide a microscopic lattice realization. For a two-dimensional free real scalar field, we extend Gaussian diagonalization methods to the generally non-Hermitian reduced spacetime density matrix and determine its complete nonzero spectrum in the generic regular case, together with all integer Rényi moments. The real-time replica construction identifies these moments with Lorentzian branch-point twist-operator correlation functions. We test this identification against the full four-point function on a circle, boundary two-point functions with Dirichlet and Neumann boundary conditions, and massive form-factor predictions, finding quantitative agreement in both magnitude and phase across distinct causal regimes. The boundary setup exhibits a finite causally connected window in which every integer Rényi entropy is real, showing that reality is not equivalent to causal disconnection. These results provide a microscopic lattice foundation for timelike entanglement and for Lorentzian twist-operator methods beyond equal-time regions.
Read the full abstract

Solar and Stellar Astrophysics

Eclipse Properties and Superhump Evolution in the SU UMa-Type Dwarf Nova Z Cha

The advent of large-scale time-domain surveys provides both opportunities and challenges for understanding accretion disk evolution in cataclysmic variables (CVs). Using high-cadence photometry from the Transiting Exoplanet Survey Satellite (TESS), we investigate the eclipsing SU UMa-type dwarf nova Z Cha. Leveraging eclipses as a natural probe, we examine the evolution of the accretion disk through variations in eclipse depth, O–C of eclipse minima, and positive superhump (PSH) amplitude. During superoutbursts, all three quantities exhibit quasi-periodic modulations with a common period of $\sim$2 days, consistent with the precession period of an eccentric disk. We interpret these correlated variations as evidence of an eccentric, precessing disk: O–C traces the periodic shift of the system's brightness center, while eclipse depth and PSH amplitude vary with the orientation of the disk bulge relative to the line of sight. In quiescence (Sectors 13 and 93), PSHs with periods of $\sim$0.0762 days show linearly decreasing amplitudes and periods, indicating gradual shrinkage of the eccentric disk and a slowing precession. Remarkably, a coherent signal with a period of $\sim$0.0729~days ($\epsilon^{-}\approx-0.02$) appears in the same quiescent intervals. This signal may represent negative superhumps (NSHs) coexisting with PSHs, although an orbital sideband of the PSH cannot presently be excluded with the available data. If confirmed as NSHs, their coexistence with PSHs would challenge the classical tilted-disk model, and could be explained by retrograde apsidal precession of an eccentric disk, where the inner disk precesses retrogradely (NSHs) and the outer disk progradely (PSHs); this interpretation remains to be tested by further observations.
Read the full abstract

All authors Qi-Bin Sun, Sheng-Bang Qian, Li-Ying Zhu, Qin-Mei Li, Wen-Ping Liao, Fu-Xing Li, Wen-xu Lin, Min-Yu Li, Ping Li, Zi-Mo Li, Tao Wang, Mao-Han Zhang, Eduardo Fernandez-Lajus

Quantum Physics

Low-cost algorithm-to-execution framework for surface-code quantum computing

Fault-tolerant quantum computing is progressing from demonstrations of individual logical components toward the execution of useful quantum algorithms on large-scale error-corrected processors. Realizing this transition requires co-design across algorithms, fault-tolerant implementations, and hardware resources. Here we develop an algorithm-to-execution framework for low-cost surface-code quantum computing that carries the structure of a computation from hierarchical logical descriptions to circuit-specific spatial organization, non-Clifford resource planning, and physical resource evaluation. We apply the framework to twenty benchmark circuits spanning seven algorithm families and to a hierarchically reconstructed application-scale elliptic-curve discrete-logarithm workload. Under the stated error and resource-supply models, combining circuit-specific layouts with hybrid non-Clifford implementation reduces space–time volume by up to 12.70x relative to an all-synthesis Litinski fast-block baseline. Circuit-specific layouts reduce both modeled runtime and space–time volume in eighteen benchmarks, while the remaining two retain the fast layout. These results show that the physical cost of fault-tolerant computation emerges from the interaction between algorithm structure, error-corrected implementation, and hardware organization rather than from aggregate logical resource counts alone.
Read the full abstract

All authors Yunxin Tang, Zixuan Huo, Junxiang Huang, Zhou You, Zhirao Wang, Zhenai Ding, Yumeng Zeng, Yangyu Lu, Yiming Huang, Zongkang Zhang, Haipeng Xie, Ruipeng Xing, Qiming Ding, Ying Li, Jinzhao Sun, Xiao Yuan, Yuan Yao

Artificial Intelligence

Decoupling Readiness from Release for Tail-Aware Scheduling of Agentic LLM Workflows

Agentic LLM workflows consist of sequences of model turns interleaved with tool interactions, so their end-to-end completion time depends not only on inference speed but also on when ready turns are released. Most runtimes release each turn immediately upon readiness. Under contention, this eager release policy can accumulate released but unfinished work; once submitted, those turns can no longer be reordered by the workflow-level policy, increasing tail latency. We present a tail-risk-aware turn release scheduling method that jointly decides which ready turn to release next and how much released but unfinished work to maintain. The method uses a mean–Conditional Value-at-Risk (CVaR) objective to capture the evolving tail risk of unfinished workflows, incorporates online estimates of turn work when prioritizing ready turns, and adapts the released work budget to observed queue pressure. We evaluate the method using real agent execution traces from software engineering tasks across multiple LLMs and workflow arrival rates. The method performs comparably to eager release under light load and substantially reduces the P95 of workflow flow time under contention, achieving up to a \(3.50\times\) speedup.
Read the full abstract

All authors Bochao Feng, Jianjiang Li, Haojie Wang, Lin Qiao, Yinghui Li, Yukun Yan, Jidong Zhai

High Energy Physics (Experiment)

Production of Light Nuclei and Hypernuclei in Heavy-Ion Collisions

We review recent STAR and ALICE measurements of light-nucleus and hypernucleus yields, femtoscopic correlations, and collective flow presented at SQM 2026. Statistical-hadronization calculations provide a useful baseline for integrated yields but do not simultaneously describe all measured light-nucleus ratios across collision energies and system sizes. For bound states with mass number $A<4$, current coalescence calculations provide a broadly consistent description of yields, femtoscopic correlations, and collective flow, although the quantitative hypertriton comparison depends on the assumed few-body wave function. The suppressed production of resonant $^{4}$Li relative to compact $^{4}$He indicates an effect of nuclear structure and late-stage dynamics. However, the quantitative model comparison also depends on the treatment of feed-down from unstable states. In high-multiplicity $p$+$p$ collisions, pion-deuteron femtoscopy further indicates that most observed (anti)deuterons are formed through nucleon fusion after strong decays of short-lived resonances. Taken together, these measurements show that production chronology and internal nuclear structure leave measurable imprints on the physics observables.
Read the full abstract

Software Engineering

What a Random Draw from the MCP Registry Contains, and What Tool-Use Benchmarks Contain Instead

Studies of the Model Context Protocol (MCP) server ecosystem draw their samples in ways that quietly select for servers that work: reference sets, popularity lists, hand-curated frames, or pipelines that repair a server until it starts. We report what an unrepaired probability sample actually contains. From a 24,135-server registry census we draw 400 npm/stdio servers with a published seed and probe each one over the wire. Only 48.8% complete an initialize handshake, against 66.7% for a hand-curated frame measured with the same instrument, and the dominant failure is not missing credentials (13.3%) but servers that never start at all (37.5%). Among the 195 that do run, hard conformance is total: zero fatal JSON Schema violations across 2,766 advertised tools. Optional safety annotations are the real variance, and the tool-level omission rate on a random draw is 58.8% against 41.5% on the curated frame, so curation flatters this figure too. We then compare the tool descriptions these servers advertise against two tool-use benchmark corpora using one method held constant. Real MCP tools show 2.8% near-duplication at cosine 0.70, and all of it lies within single servers: cross-author near-duplication is 0.0% at every threshold tested. BFCL v4 shows 16.7%, of which 16.4 points lie between independently presented tasks. UltraTool shows 0.3%, cleaner than real tools, so this is a property of BFCL and not of synthetic corpora as a class. Separately, 68.8% of raw BFCL rows and 85.6% of raw UltraTool rows are exact name-plus-description repeats, against 0.4% for real MCP, so any statistic computed over these releases without global deduplication measures repetition rather than tools. All figures regenerate from released scripts and a published seed.
Read the full abstract

Machine Learning

When More Is Not Better: Component Anti-Synergy in a P300 Speller

P300 brain-computer interface (BCI) spellers can provide hands-free communication for people with severe motor impairments. Modern pipelines combine multiple individually promising components, often assuming that 'more-is-better'. We tested this assumption using a four-component full-factorial experiment varying the inclusion of Euclidean Alignment (EA), xDAWN spatial filtering, subject calibration, and language model priors on a public P300 dataset. Performance was evaluated using accuracy, repetitions, and information transfer rate (ITR) with mixed-effects models. Results show that the value of components is conditional rather than additive. Calibration was the strongest singular contributor, while EA compensated for its absence in zero-calibration settings. Adding independently useful components could also reduce performance, revealing component anti-synergy. Contrary to conventional wisdom, LM support was not universally beneficial: its effect depends strongly on the strength of the underlying EEG pipeline, while results from a larger LM showed a similar pattern. Together, these findings challenge maximal 'all-on' pipeline design and highlight the value of selecting spatial and language-support components according to the quality of available EEG evidence.
Read the full abstract

Game Theory

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.
Read the full abstract

All authors Haolong Li, Zehan Lin, Huahua Miao, Xiaowei Wu

Analysis of PDEs

Global existence and time decay for a bipolar Euler-Poisson system with one pressureless and undamped fluid

We study the Cauchy problem for a three-dimensional bipolar Euler–Poisson system in which one fluid is pressureless and undamped, while the other is subject to momentum relaxation. For sufficiently small smooth perturbations of a constant equilibrium, we prove the global existence and uniqueness of smooth solutions under an irrotationality assumption on the initial velocity of the pressureless fluid, together with algebraic time-decay estimates. The main difficulty is that the velocity of the pressureless fluid is dissipated only indirectly through the Poisson coupling, and this mechanism degenerates strongly at high frequencies, leading to a regularity-loss structure. We overcome this difficulty by combining refined Green-function estimates, a low–middle–high frequency decomposition, and high-order nonlinear energy estimates adapted to the asymmetric regularity hierarchy. The result establishes a global small-data theory for this asymmetric regime, in which pressure and damping are simultaneously absent from the same fluid.
Read the full abstract

Plasma Physics

Particle-resolved pathways to energetic-ion formation in a fluctuating low-current hollow-cathode plume

Energetic-ion formation in a low-current hollow-cathode plume is investigated using experiments, self-consistent electrostatic particle-in-cell (PIC) simulation, and particle-resolved analysis. Retarding potential analyzer measurements show a substantial energetic-ion population over discharge currents of 0.8-3.5 A, while probe measurements reveal broadband plume fluctuations. Two-point phase-derived frequency-wavenumber measurements do not resolve a continuous ion-acoustic dispersion branch within the principal apparent-wavenumber interval. Because the inferred wavenumber is obtained from a cross-spectral phase defined modulo 2pi, the fluctuation diagnostics do not provide an unambiguous modal attribution for the energetic-ion population. A representative PIC plume, used as a qualitative kinetic reference, likewise develops broadband time-dependent electrostatic fluctuations together with a nonthermal energetic-ion population. Particle-resolved analysis shows that the energetic outflow is dominated by ions generated through ionization inside the plume, while source localization biases access to distinct trajectory and escape families. Matched field controls further show that time-averaged and frozen fields strongly suppress access to high-energy trajectories relative to the full time-dependent field over the analyzed interval. At the single-particle level, ion kinetic-energy gain is determined by electrostatic-field work accumulated along the actual trajectory, with different escape families exhibiting distinct radial and axial work contributions. These results establish a source-trajectory-field-work pathway for energetic-ion formation that can be identified without first assigning the fluctuating plume to a unique resolved plasma mode.
Read the full abstract

All authors Baisheng Wang, Zilong Peng, Yinjian Zhao, Zhongxi Ning

Functional Analysis

Typical dynamical properties of operators on $\ell_p$

We investigate the typical dynamical properties of hypercyclic operators in $\mathcal{L}_M(X)$, the set of all bounded linear operators on $X$ whose norms are at most $M$, when $X=\ell_p$, $1< p<\infty$. We show that, with respect to SOT$^*$, a typical operator $T\in \mathcal{L}_M(X)$ is weakly mixing, is weakly disjoint from a given hypercyclic operator $S$, is not topologically ergodic, and satisfies $(T,T^2,\dotsc,T^k)$ is disjoint hypercyclic for any $k\geq 2$. We also show that the similar typical dynamical properties for the concrete family $\mathcal{M}=\{I+B_w\in \mathcal{L}(X)\colon w\in c_0(\mathbb{Z})\}$, endowed with the norm topology, where $B_w$ is a bilateral weighted backward shift.
Read the full abstract

Rings and Algebras

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.
Read the full abstract

Astrophysics of Galaxies

Fast Dynamical Modelling of Milky Way Globular Clusters – II. Impacts of Black Hole Prescriptions

The populations of stellar-mass black holes (BHs) in globular clusters (GCs) play a key role in their dynamical evolution, however the mechanisms surrounding their formation and retention are uncertain. In this work, we extend the analysis of Paper I by fitting coupled rapid cluster evolution and multimass equilibrium models to a large sample of Milky Way GCs, under a variety of prescriptions for stellar evolution, BH formation and supernovae (SN) natal kicks. We explore the impacts of adopting SSE or PARSEC (through SEVN) prescriptions for BH initial-final mass relations, the rapid or delayed SN fallback mechanisms, and an ad hoc grid of kick strengths ejecting between 40 and 80 per cent of all BHs formed. All models reproduce the same present-day conditions despite starting from notably different initial BH populations, due to the correlation found between the initial cluster densities and initial BH mass fractions. A linear relationship is found between the (log) initial half-mass density and the initial BH mass fraction, with the SEVN models resulting in median densities ($\rho_{h,0} \sim 10^{7.2\pm1.1}\,{M_\odot pc^{-3}}$) nearly an order of magnitude higher than those of SSE ($\rho_{h,0} \sim 10^{6.4\pm0.9}\,{M_\odot pc^{-3}}$). We also find that both the bottom-light initial mass functions and the present-day BH mass fractions previously inferred are relatively robust against the stellar evolution models and natal kick prescriptions assumed. Finally, we discuss the implications of these results on the expected numbers and properties of dynamical binary-BH mergers, and the growth of intermediate-mass BHs.
Read the full abstract

All authors Nolan Dickson, Vincent Hénault-Brunet, Fotios Fronimos Pouliasis, Mark Gieles, Daniel Marín Pina, Peter J. Smith

Machine Learning

Measuring the Value of World-Model Updates: A Counterfactual Utility Protocol for Continual Adaptation

Continual world models must decide whether new data justify changing the model. Fixed replay schedules and prediction-error triggers specify when to update, but neither reveals the value of an individual update: one deployment run cannot show how the same model would have performed at that moment had it held its parameters. We introduce the fork ledger, which branches a deployment stream at pre-registered decision points into matched update and hold continuations under common random numbers. It evaluates both continuations on the same episodes and records $\Delta R = R_{\mathrm{update}} - R_{\mathrm{hold}}$. Always applying one fixed update mechanism lowers return on all three simulated control tasks: CartPole ($-144.0$; checkpoint-bootstrap $95\%$ CI $[-185.4,-116.1]$, against a converged return near $650$), Walker ($-82.8$; $[-101.1,-61.7]$) and Cheetah ($-18.6$; $[-29.0,-6.6]$). Divergence is an outcome of applying the update, so the estimand counts every attempted fork; restricted to the $693$ of $720$ that did not collapse, CartPole and Walker are unchanged in sign ($-113.4$ and $-82.1$) and Cheetah becomes unresolved ($-3.9$; $[-17.5,+13.0]$). The task is the unit of inference: each contributes $240$ attempted forks over five pretrained checkpoints crossed with two drift directions. The ledger makes counterfactual utility observable for a fixed mechanism, allowing triggers to be judged by the updates they select rather than by surprise detection alone.
Read the full abstract

Mesoscale and Nanoscale Physics

Emergence of spin-orbit coupling among spin, atomic orbital, and Bloch dynamics in Janus double-transition-metal MXenes

We found a spin-orbit coupling to cause a simultaneous correlation among three degrees of freedom, the electronic spin, orbital, and Bloch dynamics in an investigation into the electronic structure of Janus double-transition-metal MXenes, Mo$_2$HfC$_2$OS and W$_2$HfC$_2$OS. In this paper, it is also revealed that the spin-orbit coupling causes a staggered spin configuration with a trigonal pattern around the $\Gamma$ point near the insulating gap. We developed a reduced Hamiltonian describing the electronic states and show that the spin-orbit coupling cannot be equated with conventional forms for a single electron in solids, LS, Rashba, and Dresselhaus couplings, even in the approximation under the low-energy and small wave number condition. Because of the intrinsic shape of the conduction band, a trigonally alternating spin-momentum locking emerges with the spin axis perpendicular to the layer plane. The theoretical analysis shows that these Janus materials can provide a platform for exploring the spin-related phenomena due to the trigonal spin-momentum locking other than Rashba and Dresselhaus types.
Read the full abstract

Cryptography and Security

Empirical Evaluation of Data Poisoning Attacks in Supervised Learning

Data poisoning corrupts training data to degrade a model or to plant attacker-controlled behavior. This study evaluates two representative training-time attacks, label flipping and backdoor poisoning, on MNIST and Fashion-MNIST with three baseline classifiers: Logistic Regression, Linear SVM, and Random Forest. Clean training is compared with poisoning rates of 5%, 10%, and 20% using clean-test accuracy, macro-precision, macro-recall, macro-F1, and, for backdoors, attack success rate. Label flipping caused clear degradation, largest for Logistic Regression and Linear SVM, while Random Forest stayed comparatively stable. Backdoor poisoning reached attack success rates from 0.9667 to 1.0000 on both datasets and all three models while often keeping clean-test performance near baseline. The results separate indiscriminate poisoning, which shows up in standard metrics, from targeted backdoor poisoning, which stays comparatively stealthy while embedding highly effective malicious behavior, and they support security-oriented evaluation beyond conventional clean-test metrics.
Read the full abstract

Robotics

Testing Between the Test Cases: Proving End-to-End Steering in Conditions You Never Drove

AI-based automated vehicle testing is challenging because a model that passes every test condition can still fail in the real world. Formal verification offers a way to directly address this gap. On a simulated highway and an arterial road we trained two small end-to-end steering networks each in CARLA, one on clear conditions alone and one on clear, fog, night and low sun. All four models were driven against a 2.19 ft lane-departure budget. Without driving again, we used bound propagation, a formal method that reads the trained weights, to compute how far steering can drift at every disturbance strength between two captured images. One calculation covers more than a campaign could drive: on the arterial it spans 133 poses, where ten intensities each would be 10^133 combinations, in minutes on one GPU. Not only did formal verification find conditions that broke the clear-trained policy without simulation testing, it provided some preliminary evidence for potential failures between the test cases. Our overall conclusion is that formal verification is a viable complement to simulation, and could be adopted as a part of verification and validation for automated driving.
Read the full abstract

Computation and Language

Robust Multimodal Sentiment Analysis with Incomplete Modalities via Semantic-aware Completeness based Reconstruction

Recent multimodal sentiment analysis studies increasingly adopt text-centric fusion approaches to exploit the rich sentiment information inherent in the textual modality. However, these approaches often suffer from performance degradation during inference due to partially missing or noisy data in real-world scenarios, especially when sentiment-related cues are missing. To address this issue, we introduce a new completeness estimation approach that quantifies the degree of sentiment-relevant information preserved in incomplete data to guide the reconstruction of missing semantics. Furthermore, we propose a training strategy that stabilizes multi-task learning while jointly optimizing sentiment prediction and completeness estimation. Extensive experiments and in-depth analyses on three benchmark datasets demonstrate that the proposed approach enables more accurate semantic reconstruction, leading to more precise sentiment prediction.
Read the full abstract

All authors Han-Jun Choi, Byunggill Joe, Saim Shin, Jin Yea Jang

Numerical Analysis

Full-window branch discovery and loss-selected EnKF continuation for data assimilation

We develop a framework for offline full-window branch discovery, optionally followed by online continuation with an ensemble Kalman filter (EnKF). Three mechanisms drive the branch search: adjoint path-kernel (APK) differentiation balances kernel differentiation and correction-stabilized path perturbation, shifting the optimization from exploration to exploitation; an optimized Gaussian initial law broadens the search over initial-state basins; and loss-weighted mixing across independent runs recombines successful path components. We may then select an interior state using a local loss and continue online with an EnKF. In 40-dimensional Lorenz-96 experiments, the mean offline path RMSE of APK is 4.3 times smaller than that of population weak-$\mathrm{4D\text{-}Var}_x$. The resulting APK-EnKF method has a mean online RMSE 64 times smaller than that of ordinary EnKF.
Read the full abstract

Disordered Systems and Neural Networks

Irrationality Measure Controls Long-Wavelength Charge Fluctuations in Quasiperiodic Systems

Quasiperiodic order is characterized by irrational frequencies whose rational approximability known as irrationality measure defines distinct arithmetic classes. We establish that this arithmetic classification has direct physical consequences for long-wavelength charge fluctuations. In translation-covariant quasiperiodic systems, the infrared scaling of charge fluctuation is governed by the interplay between the irrationality exponent of irrational frequency and the large-harmonic decay of the hull charge profile: the latter determines the available charge weight, while the former controls how efficiently that weight is transferred to the infrared. Consequently, all algebraic irrational frequencies share the same arithmetic scaling, whereas exceptionally well-approximable transcendental frequencies can exhibit strongly enhanced infrared fluctuation scaling. We further prove that occupied states separated from the Fermi level by a gap stable throughout the hull contribute only an analytic infrared background, leaving the nontrivial scaling to near-Fermi states. Our results extend to general translation-covariant multi-frequency quasiperiodic systems.
Read the full abstract

Neurons and Cognition

The Platonic brain bridge hypothesis: brain networks as architectural priors for multimodal large language models

Multimodal large language models predict brain activity, but alignment has remained a measurement, not a design tool. We propose the Platonic brain bridge hypothesis: omni models, which jointly process video, audio and text, share brain-like representations usable in both directions. From model to brain, seven omni models show stable brain-likeness across participants, and our encoding experts lead the Algonauts 2025 out-of-distribution leaderboard by mean score. From brain to model, we make three contributions. Brain-MoE ties the experts of a frozen model to the seven cortical networks, raises held-out accuracy in all 15 model-benchmark pairs and exceeds capacity-matched random experts in 14. Brain-AVQA, to our knowledge the first audiovisual benchmark with cortical-network labels for every question, supplies the pretraining questions. Brain-Scope finds sparse features that predict brain responses, steer routing and, when removed, weaken brain prediction. Human brain organization is therefore a usable architectural prior for multimodal large language models.
Read the full abstract

All authors Pengfei Zhang, Biao Tian, Xiangang Li, Li Liu

Algebraic Geometry

Perverse Euler Characteristics of Hermitian Locally Symmetric Spaces

We prove that finite-volume locally Hermitian symmetric spaces of noncompact type have nonnegative perverse Euler characteristics. To show this, we obtain a nefness result for the logarithmic cotangent bundle of a smooth toroidal compactification. Combining this with a positivity criterion for Euler characteristics of perverse sheaves, we deduce the nonnegativity result. We further prove that the inequality is strict for perverse sheaves with full support. As applications, we get nonnegativity results for perverse Euler characteristics on various moduli spaces.
Read the full abstract

Software Engineering

LLMVul: A Vulnerability-Labeled Dataset of LLM-Generated C/C++ Functions from Real Production Repositories

Large language models (LLMs) are increasingly used to generate and assist with software development, yet existing vulnerability datasets largely focus on human-written code or controlled prompting environments. This limits the ability to study security weaknesses in LLM-generated code as it appears in real-world software projects. We present LLMVul, a vulnerability-labeled dataset of LLM-generated C/C++ functions mined from real production repositories. We mine AI-assisted development activity from GitHub over a 4 year period, from November 13, 2022 to September 3, 2026, using provenance signals such as commit metadata and AI-related authorship evidence. After filtering and deduplication, LLMVul contains 21,430 unique C/C++ functions from 226 repositories, together with repository, commit, function, provenance, and AI-tool metadata. We establish vulnerability labels using an ensemble of complementary static-analysis and pattern-based techniques and assign Common Weakness Enumeration (CWE) categories to confirmed vulnerable functions. To assess labeling reliability, we additionally conduct independent manual annotation and measure inter-rater agreement using Cohen's kappa ($k=0.79$). LLMVul contains 1,540 ensemble-vulnerable functions spanning 17 unique CWE categories, providing substantially more real-world LLM-generated vulnerable C/C++ functions than existing vulnerability-oriented LLM code benchmarks. By preserving both code-level vulnerability labels and generation/provenance metadata, LLMVul enables reproducible research on vulnerability detection, security evaluation of LLM-generated code, and analysis of vulnerability patterns in AI-assisted software development. The LLMVul dataset is publicly available at https://doi.org/10.5281/zenodo.22668216.
Read the full abstract

Networking

The Towers Were Standing: A Cause Decomposition of Cellular Outages During Hurricane Helene

Hurricane Helene produced the largest absolute cell-site outage in the public FCC record, peaking at 4562 sites. The conventional model is physical: towers destroyed. Helene did destroy over 1700 miles of fibre, but almost none of it was cell sites. We present the first cause-decomposed study of the FCC's Disaster Information Reporting System, reconstructing 80 state-days and 580 county-days from 24 daily filings by two reconciled independent extractions. Damage to cell sites is negligible: 1.1% of attributed cell-site-days across six states, at most 3.8% anywhere. The sites were standing. What took them out divides by terrain: pooled, power dominates at 63.2%, but in mountainous North Carolina severed transport (backhaul) reaches 52.2% against 47.3%, and in Tennessee 69.9%. North Carolina's transport share rises from 7.0% to 85.0% across the event (h̊o} = 0.92). Seventeen days after landfall, on 15 October, 47 sites lost transport across six contiguous North Carolina counties with no rainfall, no power loss, no damage, and recovery by the next report. Independent active-probe measurement corroborates it: responsive /24s fall 1.02% for twelve hours while Tennessee stays flat. We release the dataset. Backup power is the standard resilience investment; here it addresses the smaller half of the problem.
Read the full abstract

All authors Oluseyi Olukola, Oare Danielle Addeh, Esther Abiodun Konan, Nick Rahimi

Computer Vision

CamPilot: A Multi-Agent Cinematic Assistant for Camera-Controlled Movie Generation

The integration of large language models (LLMs) into video generation has enabled rapid text-to-video creation and improved visual quality. However, it still falls short of professional filmmaking, where cinematographic language is less refined than human-crafted camera work and multi-shot continuity remains challenging. To address these limitations, we introduce CamPilot, a multi-agent framework that integrates cinematographic planning and camera-work control to produce more coherent, logically structured, and human-aesthetic movies. CamPilot adopts a GRPO-based learning paradigm to learn camera work planning from 14K real-world professional movies, internalizing motion patterns and composition principles that support reasoning over shooting techniques (e.g., camera angle, motion, and focal behavior) and cross-shot relationships for controllable camera-viewpoint generation. Multiple agents further collaborate and evolve to improve overall output quality. To support this work and further studies in this domain, we establish CamEval, a benchmark for evaluating camera work quality and cinematic engagement. Empirical results show that CamPilot outperforms state-of-the-art text-to-movie generation methods on cinematographic control and quality, highlighting the impact of professional camera design on movie generation.
Read the full abstract

All authors Yang Wu, Stefano Petrangeli, Ishita Dasgupta, Yu Shen

Human-Computer Interaction

"Coder first, advocate second, college student third": The Liminality of Going to College as a Blind Computing Student

Blind or low vision (BLV) students are less likely to graduate from college, particularly in computing. Prior work documents accessibility challenges in high school and college, but we lack understanding of the transition process that produces this "leaky pipeline." To address this, we interviewed ten BLV college students about going to college to study computing. We analyzed our data through the lens of life transition, specifically Intersecting Liminality. Our findings reveal that some BLV students face such immense digital accessibility and college acclimation barriers that the only way forward as coders is to take on a "second job" as a blind advocate or drop out of the computing major. We argue that the college transition is a critical point for analysis and technological intervention, and further, that Intersecting Liminality provides a useful lens for HCI scholars to unpack the compounding challenges that prevent some BLV students from completing computing degrees.
Read the full abstract

Quantum Algebra

On Diagrammatic Categorification of Verma Modules I: Braiding

In this paper, we study the extensions of KLRW algebras to tensor products of Verma module representations of $\mathfrak{sl}_2$. Our motivation is to construct a theory of Khovanov homology for knot complements in $S^3$ (and which also categorifies the Gukov-Manolescu two-variable series for knot complements), which will be done in the second part of this work. We construct the categorification of R-matrices for Verma modules as functors given by derived tensor products with diagrammatic bimodules and explicitly compute their projective resolutions. We also prove these braiding functors induce an action of the braid group on the relevant categories. Then, we describe how to incorporate strands in finite-dimensional representations of $\mathfrak{sl}_2$, thereby establishing functors that serve as the Khovanov homology on a braid complement. In the case of the unknot, this gives knot homologies in $S^1\times D^2$, which we compare to Annular Khovanov Homology through several examples and show they are very closely related, conjecturing they are of the same dimension. We conclude with a proposal for the categorification of the cups and caps of Verma module colored strands, which we build upon in the next paper.
Read the full abstract

Networking

Message-Level Scheduling for RLNC-Coded Multi-Source Traffic

This paper studies weighted decoding-delay minimization for multiple RLNC-coded message streams that compete for finite processing capacity at a destination. Packet arrivals are exogenous, while the scheduler only determines the processing order of packets already available at the destination. A trace-conditioned offline scheduling formulation shows that a batch-release subclass is strongly NP-hard even with a single processing unit. Message-Aware Innovation-Deficit Scheduling (MAIDS) is then developed to prioritize each serviceable message according to its weight and remaining decoding deficit. For a single processing unit, MAIDS is shown to be exactly optimal under nonblocking progressive arrivals with equal weights and under common activation with arbitrary positive weights, while the unrestricted weighted online problem admits no universal deterministic $O(1)$ competitive ratio. Simulation results on streaming and batch benchmarks show that MAIDS consistently reduces weighted decoding delay relative to the tested baselines, remains close to the offline optimum on average, and recovers the predicted exact performance boundaries.
Read the full abstract