Graphics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 11 September
Many scientific applications require modeling how diffusive systems evolve over time, not merely their eventual steady states. While conventional steady-state analysis of partial differential equations (PDEs) on complex geometries is already hindered by costly volumetric meshing, transient analysis further requires sequential time stepping and careful step size selection. Grid-free Monte Carlo solvers such as walk on spheres (WoS) and walk on stars (WoSt) avoid this meshing bottleneck but remain largely limited to steady-state problems. We generalize WoS, for pure Dirichlet problems, and WoSt, for mixed Dirichlet–Neumann problems, to heat equations with initial conditions and time-dependent source and boundary data. We equip each random walk with a finite time budget and sample an exit time at every spatial step. If the exit time exceeds the remaining budget, the walk samples an interior point and evaluates the initial condition; otherwise, it continues with a reduced budget, accumulating source and boundary contributions. Our main technical contribution is a suite of kernel sampling and variance reduction techniques, including a low-bias, tabulation-free exit time sampler and efficient rejection samplers. Unlike grid-based transient solvers, our method directly estimates the solution at any requested time without volumetric meshing or sequential time marching. It also retains the parallel, progressive, and output-sensitive evaluation of WoS and WoSt while eliminating time step selection and temporal discretization bias entirely. Finally, we show how sharing walks enables efficient estimates at multiple target times.
Cryptography and Security
Self-Verifying Anomaly Detection using Explainable AI for Cybersecurity of DER Networks
The rapid growth of Distributed Energy Resources (DERs) has significantly expanded the cyber attack surface of modern power grids. Furthermore, increasing sophistication in attack techniques demands anomaly detection systems (ADS) that are accurate, interpretable, and reliable to support DER cybersecurity. While ML-based ADS provide strong detection capabilities, their black-box nature reduces operator trust and limits Security Operation Center's (SOC) ability to effectively interpret alerts and respond, highlighting the need for explainable Artificial Intelligence (XAI) to ensure transparency and operational confidence. This paper presents an XAI-based anomaly detection framework tailored for DER networks (ExCYDER). The proposed framework uses a self-verifying mechanism that validates ADS alerts to ensure trustworthy decision-making. ExCYDER combines LightGBM with SHAP to check whether each model decision aligns with its feature-attribution evidence, allowing the system to confirm that its internal reasoning is consistent and reliable. Experiments on a realistic DNP3 dataset achieved over 98% detection accuracy, an average rule–SHAP consistency of 44.6%, a SHAP latency of 14.5 ms per alert, and a confidence deviation within 5%, demonstrating stable verification behavior with minimal computational overhead. The framework distinguished between coherent and inconsistent alerts without compromising detection accuracy, demonstrating that integrated verification within XAI-based ADS enhances interpretability, auditability, and operational robustness for DER-focused SOCs.
Read the full abstract
Artificial Intelligence
Hybrid Physics-AI Framework of Body Center of Mass Dynamics from Wrist-Worn Sensors
Wrist-worn IMU has been widely used for daily-life health monitoring. Yet, it does not fully represent whole-body dynamics, for which the body center of mass (COM) is considered the physiological reference standard. Therefore, this work proposes a simplified kinematic model (KM), which is designed to map the wrist IMU to the COM acceleration. It is built upon several reductive assumptions that enable the solvability of the dynamic equations based on wrist IMU measurements alone. This work further proposes three types of hybrid AI modeling methods, namely human kinematic model-based neural network (HKM-NN) models, to leverage the power of both grey-box and black-box modeling. The HKM-NN methods include serial learning (ser-) and two approaches of simultaneous learning (sim1- and sim2-). The proposed models are trained and tested using our dataset, which includes wrist IMU measurements and ground-truth COM measurements from 10 healthy volunteers during six gait activities and sit-to-stand (SS) transitional movement. The results demonstrate the feasibility of estimating COM acceleration from wrist IMU measurements. Our KM model yields satisfactory results, with an error ranging from 6.7% to 12.5% for gait activities and 5.6% for the SS. In comparison with the KM model, our HKM-NN models significantly enhance the performance, achieving 5.3% to 9.3% errors for gait activities, and the best error of 3.9% for the SS. In addition, the HKM-NN models demonstrate distinct robustness characteristics under noisy test conditions, with sim1-/sim2- generally maintaining greater robustness under Gaussian perturbations, while the KM model exhibits comparatively strong robustness under salt-and-pepper noise. These findings highlight the importance of combining biomechanical structure with data-driven learning for wearable sensing applications operating under imperfect and noisy measurement conditions.
Read the full abstract
Computation and Language
Breaking the Token Ceiling: Distilling Smaller, Stronger Byte Models
Small models are made more capable through distillation from a larger one that shares their tokenization scheme. However, do distilled byte and token models behave similarly in terms of scaling trends as compute and data increases? To enable this comparison, we introduce two variants to efficiently convert token logits to Byte Logits: 1) approximate: Marginalize-It, and 2) exact: End-Of-Token. We then present the first large scale study of overtraining decoder-only dense transformer models varying two dimensions simultaneously: the tokenization scheme (Tokens, Bytes, Bytes w/ eot) and the training objective (Distillation vs. Cross-Entropy), sweeping layer-parameter-matched models with roughly 1 billion parameters up to 1 trillion bytes of data. Across eight benchmarks spanning three categories: Multiple Choice QA, Language Generation, and Machine Translation, we find that Token-1B models outperform byte models (End-Of-Token-1B and Bytes-1B) in the low-FLOP regime but eventually plateau; byte models start worse yet surpass Token-1B models with more compute, reaching a higher downstream task performance ceiling. Extrapolating the average top-1 error vs. validation BPB scaling laws predicts that, asymptotically, distilled End-Of-Token-1B outperforms distilled Token-1B by up to 4%. They are also far more data efficient, matching the performance of distilled Token-1B using only one-sixth of the training data. Moreover, by operating over a small vocabulary of 256 bytes instead of on the order of 100K tokens, they circumvent the need for top-k truncation during logit dumping, while also reducing logit storage costs to roughly one-fifth. Finally, our downstream performance scaling laws predict that our distilled End-Of-Token-1B models asymptotically surpass the Llama 3.2-1B, Gemma-3-1B-pt, and Gemma 2B models on averaged downstream tasks by up to 6.5%, 8.1%, and 2.1%, respectively.
Read the full abstract
Commutative Algebra
The Eisenbud-Huneke-Ulrich conjecture and bounds on minimal generators
We prove the Eisenbud–Ulrich conjecture on the powers of linearly presented ideals in characteristic zero. More generally, we study stabilization bounds for powers of m-primary ideals in a polynomial ring with partially linear resolutions, making further progress toward the more general Eisenbud–Huneke–Ulrich conjecture. We prove a global generation result on relevant higher syzygy bundles, which is a crucial ingredient to the proof of the Eisenbud–Ulrich conjecture. We also establish lower bounds for the number of minimal generators in two settings: ideals generated by quadrics and ideals that are virtually linearly presented. Motivated by these results, we formulate a conjecture predicting sharp lower bounds for the number of minimal generators of such ideals.
Read the full abstract
Statistics Theory
PDE-constrained inverse problems at the $\sqrt{n}$ rate via debiased physics-informed neural networks
We study the problem of estimating unknown parameters in PDE-constrained inverse problems from noisy observations, where the PDE solution is approximated using Physics-Informed Neural Networks (PINNs). While PINNs have demonstrated remarkable empirical success, existing estimators often inherit the slow nonparametric convergence rate of the neural-network solution, leading to biased and statistically inefficient inference for the finite-dimensional parameters of interest. To address this, we propose a two-step debiased estimation procedure that combines neural-network-based nonparametric estimation with an influence-function-based bias correction. By eliminating the first-order sensitivity of the estimator to errors in the nuisance function, our procedure yields a $\sqrt{n}$-consistent and asymptotically normal estimator without requiring undersmoothing of the neural network component. We further extend this framework to Bayesian inference by replacing the original likelihood with a debiased quasi-likelihood and establish a Bernstein-von Mises theorem showing that the resulting posterior contracts at the $\sqrt{n}$-rate with an asymptotic covariance matching that of the frequentist estimator. As a by-product of our analysis, we establish near-minimax optimal convergence rates for estimating a nonparametric regression function and its derivatives in Sobolev spaces using neural networks. Extensive numerical experiments corroborate our theoretical findings and demonstrate the necessity of the proposed debiasing procedure for valid statistical inference in PDE-constrained inverse problems.
Read the full abstract
Materials Science
$Ab$ $initio$ Study of Substitutional Defects in Li$_{3}$OCl Solid Electrolyte for Li-ion Batteries
Improving ion transport in solid electrolytes and cathode coatings remains a key challenge for all-solid-state Li-ion batteries because their room-temperature ionic conductivity is still substantially lower than that of liquid electrolytes. In our previous combined experimental and theoretical study, we showed that thermal neutron irradiation enables defect engineering in LiBO$_2$ through the transmutation of $^6$Li and $^{10}$B, generating lattice vacancies that enhance ionic conductivity. Here, we examine whether this approach can be extended to Li$_3$OCl, a representative antiperovskite solid electrolyte. Using density functional theory, we investigate substitutional defects at Li sites involving B, He, and H, associated with B doping and the neutron-capture reactions $^{6}\mathrm{Li}+n\rightarrow\,^{3}\mathrm{H}+\alpha$ and $^{10}\mathrm{B}+n\rightarrow\,^{7}\mathrm{Li}+\alpha+\gamma$. We evaluate defect formation energetics, the resulting structural distortions, and compare these substitutional defects with other mono-, di-, and trication substitutions at Li sites. Our results show that substitutional defects associated with neutron irradiation provide a feasible route to tune the defect chemistry of antiperovskite solid electrolytes and support neutron-driven defect engineering as a strategy for developing advanced materials for high-performance all-solid-state Li-ion batteries.
Read the full abstract
Distributed Computing
Argus: Orchestrating Cross-Layer GPU Performance Measurements around Semantic Regions
GPU developers and automated optimizers need performance evidence for semantic code regions–such as neural-network operator implementations and pipeline stages–but this evidence is fragmented across profiling tools. Answering a region-level question can require manually constructing probes and program variants, isolating interfering measurements, and mapping evidence to regions and execution contexts. We present Argus, a region-centric measurement planner and runtime that automates this workflow. Clients identify regions with boundary markers and select signals and execution scopes. Argus preserves region identity across compilation, execution, and measurement variants, constructs interference-aware multi-run plans, and orchestrates transformations and profiling across backends. It joins compiler-, hardware-, and system-level evidence using region identity and dynamic execution context, producing reports that record measurement origins and attribution ambiguity. We evaluate Argus across agentic kernel optimization, persistent megakernel optimization, and cross-level PGO. Across 44 persistent-GEMM and attention configurations, Argus improves 39/44 cases and raises AlphaEvolve's geometric-mean speedup from 5.4% to 8.9%. On a persistent TinyLlama-1.1B decode megakernel, an optimization agent reaches 1.65 ms/token with Argus versus 4.92 ms/token without it, producing a kernel $2.1\times$ faster than PyTorch with CUDA Graphs. Finally, Argus-guided cross-level PGO improves compute–communication overlap, increasing throughput by 7% on average across five multi-GPU settings.
Read the full abstract
Machine Learning
FRIST: FMRI Representation Informed Shared-space Training Improves EEG-only Individual-Finger BCI Decoding
Finger-level motor decoding is important for naturalistic brain-computer interface (BCI) control, yet individual-finger decoding from scalp electroencephalography (EEG) remains challenging because finger representations are spatially close in the sensorimotor cortex and blurred by volume conduction. Leveraging the high spatial resolution of functional MRI (fMRI), we introduce fMRI Representation-Informed Shared-Space Training (FRIST), a two-stage EEG decoding framework that first learns fMRI-informed spectral projections from simultaneous EEG-fMRI recordings and then uses fMRI-derived class geometry to guide residual refinement of EEG predictions. FRIST transfers information across recordings through shared finger labels without requiring paired trials and uses only EEG at inference. We evaluated 12 able-bodied participants during movement execution (ME) and motor imagery (MI) under two-class and three-class chronological session-held-out decoding simulating the online scenario. Using EEGNet as the EEG feature extractor, FRIST increased group average accuracy from 66.93% to 74.53% for two-class ME, from 44.83% to 56.58% for three-class ME, from 80.78% to 85.63% for two-class MI, and from 60.93% to 69.90% for three-class MI compared with the EEG-only EEGNet baseline. FRIST is also shown to improve EEG-only decoding when the target participant's own fMRI data were unavailable. FRIST also generalized across multiple EEG decoding backbones, reaching 87.40% in two-class MI and 72.54% in three-class MI with EEG Conformer as the EEG feature extractor. These findings indicate that fMRI provide useful spatial constraints for EEG representation learning. FRIST improves noninvasive EEG-based finger-level BCI decoding, offering a multimodal strategy for integrating the spatial specificity of fMRI with real-time applicability of EEG.
Read the full abstract
Thursday 10 September
Machine Learning (Statistics)
Drift-admissibility via Optimal Transport
We introduce structure-aware optimal transport diagnostics for assessing whether empirical time-series dynamics are compatible with a prescribed predictable-drift class. Our approach translates a pathwise property of stochastic processes into a finite-dimensional projection problem over empirical transition laws, encoding admissibility as row-wise moment constraints on local couplings and quantifying deviations via a Kullback–Leibler projection gap $G_{\lambda,k}$. This yields both a principled diagnostic and a scalable Bregman–Dykstra algorithm that retains the efficiency of Sinkhorn-type methods while incorporating structural constraints. Calibrated against a Brownian reference null, $G_{\lambda,k}$ separates process classes that are indistinguishable by second-order statistics alone—including fractional Brownian motion and BSS processes sharing identical Hurst indices—without asymptotic resampling or continuous-time recovery. This positions the method as a general tool for structure-aware model validation of sequential data.
Read the full abstract
Genomics
scPyviewer: a Python-native interactive viewer from AnnData single-cell data
Motivation: Interactive web tools enabling non-programmers to explore single-cell datasets, embeddings, gene expression, metadata, and marker genes are standard laboratory infrastructure. However, actively maintained tools (e.g., ShinyCell, ScRDAVis, sCIRCLE) rely on R Shiny and require Seurat objects. Python/scanpy, the dominant framework for single-cell RNA-seq and spatial analysis, lacks a lightweight, native option pairing a shareable viewer with a scriptable Python API. Sharing scanpy results currently requires converting to Seurat or sharing code notebooks. Results: We present scPyviewer, a web viewer that ingests AnnData objects directly and reproduces incumbent interaction patterns within the Python stack. In a feature-parity audit against three R Shiny tools, scPyviewer matches or exceeds baseline capabilities (7/7), uniquely offering native AnnData ingestion without conversion and cross-dataset comparison over shared genes and matched cell types. Benchmark tests across three datasets (22,315 to ~313,000 cells) show scPyviewer renders every core view faster (up to 3.6x speedup) using lower memory (5.2x lower on the smallest dataset). On 313,000 cells, scPyviewer completes all views while Seurat exhausts an 8 GB memory limit and fails. Beyond the app, scPyviewer exposes a Python API returning Matplotlib figures and pandas tables for publication-ready output. Availability and implementation: Implemented in Python 3.11 (scanpy 1.11.5, anndata 0.12.19, streamlit 1.59.2, plotly 6.9.0) with a one-command interface to reproduce benchmarks, figures, and launch the app. Source code: https://github.com/xuan13hao/scPyviewer.git
Read the full abstract
Functional Analysis
Observable diameter of product measures with a power-type interior zero
We determine the asymptotic order of the observable diameter of $\ell^p$-product spaces associated with a probability measure on $[0,1]$ whose density has a power-type interior zero. Different vanishing orders are allowed on the two sides of the zero. For every $1 \le p \le \infty$, we obtain sharp two-sided estimates and show that the asymptotic order is governed by the larger of the two vanishing orders. In the case $p=2$, the transition occurs exactly at the threshold for the spectral gap.
Read the full abstract
Statistical Methodology
Reference-State Bootstrap Correction and Kernel Characterization of Residual-Based Fit Indices in Structural Equation Models
Sampling error affects the finite-sample values of residual-based fit indices. We show that the unweighted comparative fit index ($CFI_u$) rests on a quadratic-kernel maximum mean discrepancy and that a Gaussian-kernel comparative fit index (KCFI) converges to $CFI_u$ as bandwidth increases. Because kernel discrepancies lack an analytic sampling correction, we extend expected-discrepancy bootstrap methods to a fitted-correlation reference state: the sample is transformed to reproduce the fitted correlation matrix, then resampled and refitted to estimate the exact-fit sampling component. Across 18 confirmatory factor analysis conditions, this correction reduced the root mean square error (RMSE) of both indices by 62%-87%. Under normality it matched an analytic residual-covariance estimator of $CFI_u$ within .0001, and in small samples it outperformed ordinary bootstrap correction in accuracy and availability. Corrected KCFI had lower RMSE than identically corrected $CFI_u$ in all 29 nonnormal conditions, even against a common target, but in six heavy-tailed small-sample conditions the analytic estimator was more accurate than both. The results validate the reference-state correction where it is needed and delimit where the analytic estimator is preferable.
Read the full abstract
Quantum Physics
Comment on arXiv:2510.21705 "Fundamental Impossibility of a Superradiant Neutrino Laser" and comment on arXiv:2510.21692 "Can Bose-Einstein Condensates Enhance Radioactive Decay?"
We show that the small value of the neutrino cross-section rules out superradiance in the laboratory.
Machine Learning
MRFlow: Mechanism-Structured Residual Flow Matching for Virtual Cell Perturbation Prediction
Predicting cellular responses to chemical and genetic perturbations is a central test for AI virtual cells, yet many single-cell models reduce each condition to an average expression shift. This target is misaligned with perturbation biology: rare states, resistant subpopulations, and context-dependent effect sizes may coexist under the same intervention. MRFlow treats virtual-cell prediction as conditional transport between empirical single-cell measures. Control and perturbed cells are embedded in a variational latent state space, greedy low-cost supervision is constructed over detached minibatch states, and a conditional flow-matching vector field transports control populations toward perturbed populations. The field decomposes into a mechanism-structured affine dictionary, which recombines shared latent response operators with a low-rank condition-specific correction, and a spectrally controlled residual field for nonlinear cell-level variation. Genetic perturbations are encoded through a regulatory-graph GCN, chemical perturbations through Morgan fingerprints, and both enter the same conditional dynamics interface. Across eight gene and drug perturbation benchmarks, MRFlow attains the highest composite score while preserving competitive raw performance on differential-expression and distributional metrics. The results support latent distribution transport as a principled and empirically effective formulation for perturbation-aware virtual cell modeling.
Read the full abstract
Metric Geometry
Jensen's inequality on parity classes of jump M-convex functions
We prove Jensen's inequality on each coordinatewise parity class of a jump $M$-convex function on $\mathbb{Z}^n$, without assuming strong base orderability or a finite effective domain. If a finite convex combination of domain points has its barycenter in the same parity class, then the barycenter belongs to the domain and satisfies Jensen's inequality. We also prove that every domain point admits an affine support on its entire parity class. The set of support vectors is characterized by at most $3^n-1$ local inequalities, which yield optimality certificates, attained duality, and an exact formula for linear growth and stability under linear perturbations. The same conclusions hold for distributions with finite first moment supported on domain points of a single parity class, provided their mean lies in that class. We characterize equality by contact sets and give a quantitative bound on the Jensen gap. The proof combines induction on dimension with the known closure under infimal convolution: convolution with an even-box indicator gives finite-domain supports, a quadratic kernel proves barycenter feasibility, and a fixed local kernel yields global supports. A two-dimensional example shows that total parity alone does not suffice.
Read the full abstract
Statistics Theory
Optimal Linear Functional Estimation for Proportionally High-Dimensional Linear Models
We study estimation of a linear functional in random-design linear models when $\gamma=p/n \in (1, \infty)$ under the dense regime where the design covariance is unknown, and neither the regression vector nor the precision matrix is assumed sparse. Suppose the spectrum of the design covariance belongs to $[\ell,L]$, we establish the minimax mean squared rate for the linear functional has the order $n^{-\alpha(\kappa,\gamma)}$, where the exponent $\alpha(\kappa,\gamma)$ has an explicit elliptic-integral representation and $\alpha(\kappa,\gamma) < 1$ when both $\kappa > 1$ and $\gamma > 1$. We propose the Bocca estimator, which combines empirically calibrated resolvents through a complex contour integral to attain the optimal rate.
Read the full abstract
Sound
How Robust Are Neural Audio Codecs for African Speech? A Multi-Task Benchmark and the Limits of Perceptual Quality
Neural audio codecs enable low-bitrate speech compression and tokenization, yet their robustness on accented and multilingual speech remains under-evaluated. We benchmark seven open-source neural codecs (DAC, EnCodec, FocalCodec, LanguageCodec, SemantiCodec, UniCodec, WavTokenizer) on three African speech datasets afrinames, afrispeech dialog, afrispeech multilingual, reporting signal-level quality (NISQA, UTMOS, ViSQOL, STOI, F0-RMSE) alongside two downstream tasks: automatic speech recognition (ASR) and speaker verification (ASV). Our analysis yields four findings. First, signal metrics differ sharply in downstream validity: reference-based structural/intelligibility measures (ViSQOL, STOI) and prosodic error (F0-RMSE) track ASR and ASV degradation far more reliably than neural mean-opinion-score predictors (NISQA, UTMOS). Second, intelligibility and speaker-identity preservation diverge sharply across architectures, and the apparent identity ranking itself depends on the ASV backend. Third, degradation is strongly domain-dependent and largest for conversational dialog. Fourth, the resulting degradation is partly recoverable: parameter-efficient codec adaptation (LoRA, $\sim$1–3% of parameters) on roughly 35 hours of African speech reduces the compression-induced word-error-rate gap, recovering recognition toward the uncompressed baseline (developed in companion work). These results motivate task-aware, domain-representative, and adaptation-aware evaluation of speech codecs as a prerequisite for inclusive deployment.
Read the full abstract
Differential Geometry
A counterexample to Yau's bounded-mean-curvature embedding question
Yau asked whether every complete Riemannian manifold with bounded Ricci curvature and positive injectivity radius admits an isometric embedding into some Euclidean space with bounded mean curvature. We construct a counterexample: a smooth complete metric on $\mathbb{R}^4$ with bounded Ricci curvature, positive injectivity radius, and unbounded full curvature. The Gauss equation then forces every $C^2$ isometric immersion of this metric into a finite-dimensional Euclidean space to have unbounded mean curvature. The metric is assembled from disjoint curvature peaks whose Ricci contractions stay uniformly bounded. A short-geodesic curvature estimate and the Jacobi equation give the uniform injectivity-radius bound. The construction works in every dimension at least four, and in dimension four the Ricci curvature may be chosen to tend to zero at infinity.
Read the full abstract
Other Condensed Matter
Quasi-static loading of granular media as a linear complementarity problem
The discrete quasi-static response of rate-independent dissipative granular media is addressed. Granular systems are conventionally simulated with methods that are intrinsically dynamic, such as the discrete element (DEM) and discontinuous deformation (DDA) methods, with the particles' accelerations and damping being essential aspects. In contrast, quasi-static methods derive from the static stiffness relationships among the particles. With frictional contacts, an assembly's stiffness is incrementally non-linear and dependent on the direction of loading. The paper resolves this difficulty by casting the response as a linear complementarity problem (LCP). The approach benefits from a foundation of past research on existence, uniqueness, and stability of LCP solutions, which are expounded in a concise set of rules. The LCP of a granular system is derived, accounting for geometric effects that arise from curvatures of particles at their contacts, frictional contact stiffnesses, and displacement constraints on the particles. The paper describes eight aberrant conditions (pathologies) of granular systems, in the forms of various bifurcations and instabilities. When placed in the context of an LCP, the eight conditions are unambiguously defined. These pathologies include three types of bifurcation: discrete, continuous-bounded (not yet reported in the literature), and continuous-unbounded. Not yet reported in the literature is an abrupt discontinuous change in movements upon a continuous change of the data. Methods and results are illustrated with examples of granular systems. Results show that instability and bifurcation are pervasive conditions near failure; that failure and softening are sensitive to the geometric contours of the particles at contacts; and that quasi-static systems can encounter states that require a dynamic transition to resolve a lack of paths consistent with loading.
Read the full abstract
Cryptography and Security
Intrusion Detection for Agentic Processes: Evidence-Based Runtime Monitoring
Agent deployments increasingly combine language-model inference with retrieval, delegation, tool execution, external-system access, and human approval. Security-relevant deviations can therefore emerge across an evolving process rather than in one isolated input or action. Building on the author's earlier black-box architecture for agentic processes and the subsequent evidence-claim model, this paper proposes an Agentic-Process Intrusion Detection System (A-IDS), an evidence-aware security interpretation layer for runtime intrusion detection whose monitored object is the agentic process itself. A-IDS compares evidence-supported observations with a governed and versioned expectation baseline for workflow state, authorization, communication, and mandatory events. Its conceptual contribution combines dynamically due governed expectations, visibility separated from three-valued matching, explicit unresolved observation states, and bounded findings that separate evidentiary status from operational impact. The model further identifies the monitoring plane itself as an attack surface when adversarial content reaches semantic evidence producers through otherwise legitimate observation paths. Some observations may be produced outside the operational agent's self-report path, but the model does not assume complete observability or universally trustworthy capture. Prompt injection is treated both as an input-security problem and as a possible origin of later process deviations and cross-agent influence paths. A-IDS does not infer malicious intent from anomalous behavior, does not treat an unobserved event as proof of non-occurrence, and does not claim a new anomaly detector, temporal logic, or provenance model. The contribution is conceptual: it does not validate an implementation, demonstrate empirical detection performance, establish causal attribution, or provide an enforcement mechanism.
Read the full abstract
Chaotic Dynamics
Pole-organized cusp catastrophes in locally nonlinear resonator networks
A resonator with one localized cubic nonlinearity can acquire additional cusp pairs when it is coupled to an otherwise linear network. At first-harmonic order, the cusp locus is a phase contour of the driving-point receptance $G(\Omega)$ at the nonlinear coordinate. We resolve that contour into the contribution of an active pole and its background. For a lightly damped, isolated modal pole on a slowly varying, nearly real background, cusp-pair birth occurs once the participation of that pole at the nonlinear coordinate exceeds a closed-form threshold set by its damping half-width and that background. On the weak-mixing hardening branch generated by a pole above the primary resonance, the birth coupling then grows as the square root of the damping at fixed mode separation, and of the mode separation at fixed damping. The curvature of the full cusp contour determines whether the local fold set opens a gap (beaks type) or creates an isolated loop (lips type). The isolated-pole approximation reduces this classifier to a background-receptance rule whose range of validity is quantified on 100 random networks. The same ensemble tests the pole ladder numerically, while multi-harmonic continuation follows the whole reconnection sequence—connected band, gap, isolated lens, none—in the original equations at the fold of the birth locus, where the classifier is least protected. The construction also extends to coupled-mode Kerr networks, where the driving-point response sets the intrinsic fold geometry and the drive-port transfer response sets its accessibility.
Read the full abstract
Neural and Evolutionary Computing
Per-Node Activation Function Evolution in Indirectly Encoded Substrates: Solvability, Limits, and Emergent Diversity
Biological neurons achieve computational diversity through specialized types: tonic, bursting, adapting, and fast-spiking cells coexist within the same circuit. Artificial neural networks, by contrast, apply a single activation function uniformly to all nodes, which limits what they can represent. We show that this uniformity creates hard limits for evolutionary search: across sparse evolved substrates, monotonic functions fail to solve parity beyond its smallest instance, XOR, while a single oscillatory unit suffices at all tested scales. The gap is one of search and sparsity, not representation: monotonic networks can represent parity with a modest number of hidden units, and gradient descent recovers that solution. We evolve, to our knowledge for the first time in indirect encoding, per-node activation function assignments from an 18-function palette across more than 4,500 experimental runs spanning Boolean logic, regression, and spatial classification. Testing each of the 18 functions individually on Parity-4 reveals a three-tier solvability structure: oscillatory functions achieve 100%, intermediate functions 6.7-80%, and all 9 monotonic functions 0%. This divide is not universal. Recurrence collapses it, and gradient descent inverts it entirely, showing that the barrier is specific to evolutionary search in sparse substrates. What activation functions a network can use, beyond its topology and weights, determines what evolutionary search can solve. Indirect encoding discovers heterogeneous per-node activation assignments unlikely to be chosen by hand.
Read the full abstract
Neural and Evolutionary Computing
Multi-Behavioral Evolved Substrates Through Neuromodulation and Activation Selection
Open-ended artificial life systems must acquire diverse competencies from a single evolving genotype. Biological brains combine neuromodulation, which reconfigures circuits without changing connections, with diverse neuron types matched to specific computational roles. Can artificial evolution achieve something analogous in indirectly encoded substrates? Using indirectly encoded substrates evolved via CPPNs, we show through more than 10,000 experiments that neuromodulation alone is insufficient: under evolutionary search, monotonic activation functions impose a 75% ceiling on parity tasks that persists regardless of capacity, topology, or population size. This is an evolutionary search barrier, not a representational limit, since Adam gradient descent achieves 100% on the identical architecture. We combine neuromodulation with per-task activation function selection, matching oscillatory primitives to parity tasks and monotonic to threshold tasks, producing multi-behavioral evolved substrates. The result: 100% simultaneous 5-task success across all 30 seeds (median 14 generations). This generalizes across the oscillatory activation class: all four functions reach 100% (30 seeds each). Neither mechanism suffices alone. The barrier extends to higher-arity and asymmetric tasks, while multi-layer depth provides an alternative path. For open-ended evolution, the computational primitive should itself be an evolvable trait. At inference, one evolved genotype expresses many behaviors.
Read the full abstract
Portfolio Management
Admissible Portfolio Optimization: Information Constraints, Conditional Efficient Frontiers and the Price of Causal Identification
Mean–variance portfolio choice takes the conditioning information as given, so that two errors about it, using variables not available at the decision time and treating common variation as idiosyncratic, pass into the portfolio unseen. This paper turns what that practice assumes into a condition declared before estimation, certified from data and priced when it fails. The conditioning information becomes a decision variable subject to admissibility constraints on availability, arbitrage, statistical separation and, for interventional claims, invariance across regimes; an order in which no risk–return quantity enters selects an information class, and the classical problem is solved inside it. We prove that solutions exist, that the value of information is monotone only under an embedding that portfolio constraints can break, so that selection by decision loss admits look-ahead information whenever offered, that the two-stage solution and the joint envelope are minimal elements of two orders on one set, that the diversifiable part of risk is a property of the admissible class, and that causal identification has an explicit price. Allocation performance is downstream of the framework, since the information decision enters the decision regret at second order and the reported risk at first order, while the weights themselves move at first order. On market data the condition holds on small sets of individual securities and fails on pre-diversified portfolios and on books of realistic size, where a factor model with diagonal residual understates its portfolio's variance by a factor that the consequence statistic announces in advance; selecting the same information by decision loss yields portfolios that promise a fraction of the risk they realize.
Read the full abstract
High Energy Physics (Phenomenology)
Dark-State Interference in an Effective Confined Three-Level Color System
In this work, a QCD-inspired effective model describes dark-state interference in a confined three-state system with two low-energy $Q\overline{Q}$ states, $|1\rangle$ and $|2\rangle$, and a gluon-excited hybrid state, $|H\rangle$. A stationary chromoelectric flux-tube background enters the unperturbed Hamiltonian, while a time-dependent chromoelectric perturbation couples $|1\rangle$ and $|2\rangle$ to $|H\rangle$ in a $\Lambda$-type configuration. Under two-photon\footnote{We retain standard terms like “two-photon” from the EIT literature only by mathematical analogy, but they do not refer to electromagnetic photons but to the effective frequencies and energy mismatches of chromoelectric perturbations and gluonic excitations that connect confined states.} resonance and within a Markovian Gorini-Kossakowski-Sudarshan-Lindblad master equation, the system forms a coherent superposition that decouples from $|H\rangle$, strongly suppressing the steady-state probe susceptibility $\operatorname{Im}\chi_{\text{CE}}$ as lower-state decoherence vanishes. A phenomenological non-Abelian correction to the hybrid energy mainly shifts and reshapes the transparency window rather than creating the interference itself. The model is not a first-principles QCD calculation of medium opacity but a controlled effective link between dark-state interference in quantum optics and reduced confined color dynamics.
Read the full abstract
Emerging Technologies
Movable-Element STAR-RIS for Integrated Sensing and Communication: Architectures, Opportunities, and Practical Challenges
Simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs) extend conventional reflecting-only surfaces by enabling controllable full-space propagation. Yet, once deployed, the physical locations of their elements remain fixed, leaving the surface geometry unable to adapt to users, sensing targets, blockage, or near-field focusing conditions. This article develops a system-level perspective on movable-element STAR-RIS (ME–STAR–RIS) for integrated sensing and communication (ISAC), where the surface jointly reconfigures its electromagnetic response and the physical positions of its elements. We explain how geometric reconfiguration can reshape the effective aperture, spatial correlation, interference nulls, and sensing illumination while preserving STAR-RIS full-space operation. A two-timescale control architecture separates relatively slow element motion from fast beamforming and transmission/reflection control. A 100-realization illustrative case study compares ME–STAR–RIS with an otherwise identical fixed STAR-RIS under a passive coupled transmission/reflection response. The results show a substantially improved sampled communication–sensing tradeoff and, importantly, a rapid saturation of the rate gain with modest element travel. We conclude with representative use cases, implementation constraints, and a research roadmap covering mobility overhead, channel acquisition, mutual coupling, near-field operation, hardware impairments, and learning-assisted predictive control.
Read the full abstract
Combinatorics
Probability threshold for the stability of $\alpha(G(n,r,s))$
Let $G(n,r,s)$ be a graph $(V,E)$ such that $V = \binom{[n]}{r}$ and $E = \{(u, v)| |u \cap v| = s\}. $In this paper we study the probability threshold for the exact stability of the independence number of $G(n, r, s)$ where $r > 2s+2$. We improve the previous result of Pyaderkin that implied asymptotic stability of the independence number.
Read the full abstract
Signal Processing
Movable-Element STAR-RIS for 6G Non-Terrestrial Networks: Architectures, Enabling Technologies, and Open Challenges
Non-terrestrial networks (NTNs) are emerging as a key component of 6G systems by extending ubiquitous and resilient connectivity across satellite, aerial, and terrestrial layers. However, severe propagation loss, rapidly varying geometry, Doppler, blockage, and stringent payload and energy constraints make efficient beam and propagation control particularly challenging. Movable-element STAR-RIS (ME-STAR-RIS) offers a new approach by combining full-space transmission/reflection control with reconfigurable surface geometry, thereby introducing an additional spatial degree of freedom for geometry-aware NTN operation. In this article, we first describe the operating principle, movement constraints, and potential hardware realizations of ME-STAR-RIS, and then present representative satellite-borne, aerial-relay, and cross-tier NTN architectures. We discuss the key enabling mechanisms, including joint geometry–electromagnetic optimization, mobility-aware channel acquisition, multi-timescale control, and predictive configuration. A LEO-centered numerical case study compares ME-STAR-RIS with an otherwise identical fixed STAR-RIS and demonstrates the benefit of element mobility across different transmit powers, movement ranges, and surface sizes, while revealing diminishing returns from increasingly large displacements. Finally, we discuss the main hardware, CSI, scalability, near-field, sensing, security, reliability, and standardization challenges, and highlight promising directions toward practical ME-STAR-RIS-enabled NTNs
Read the full abstract
Information Theory
The kernel-block rank profiles of the $\mathbb{Z}_2\mathbb{Z}_4$-linear and the $\mathbb{Z}_{2^s}$-linear Hadamard codes, and a complete classification of the $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes
The kernel of a binary code containing the zero word partitions the binary coordinates into blocks, two coordinates lying in the same block when every kernel word takes the same value in both, and the kernel-block rank profile is the multiset of the dimensions of its linear span punctured on those blocks. For the family $H^{t_1,t_2,t_3}$ of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes, this invariant is known explicitly and gives a complete classification of the family. In this paper, we compute it for the $\mathbb{Z}_2\mathbb{Z}_4$-linear and $\mathbb{Z}_{2^s}$-linear Hadamard families with which those codes are compared, and we prove that it is constant for every nonlinear $\mathbb{Z}_2\mathbb{Z}_4$-linear Hadamard code and for every nonlinear $\mathbb{Z}_{2^s}$-linear Hadamard code $\bar H^{a_1,\dots,a_s}$ with $s\geq2$. The second statement is obtained without any rank formula, by exhibiting coordinate permutations that preserve the code and act transitively on its kernel blocks, which makes the argument uniform in $s$. We also prove a descent theorem: if $\bar H^{a_1,\dots,a_s}$ is nonlinear and $a_1\geq2$, then the code punctured on one kernel block is the $\mathbb{Z}_{2^{s-1}}$-linear Hadamard code $\bar H^{a_1,\dots,a_{s-1}}$. Consequently, the constant local rank equals $rank(\bar H^{a_1,\dots,a_{s-1}})$ and is at least $t-\kappa+2$, where $2^t$ is the length and $\kappa$ the kernel dimension. These results separate every nonlinear $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard code from every $\mathbb{Z}_4$-linear, $\mathbb{Z}_2\mathbb{Z}_4$-linear and $\mathbb{Z}_{2^s}$-linear Hadamard code of the same length, except for the single infinite family $H^{1,1,t-4}$ and $\bar H^{2,0,t-5}$ with $t\geq5$. The members of this infinite family agree in the rank, kernel dimension and the kernel-block rank profile, but a two-block refinement separates them.