Statistics Applications
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 12 September
Low-cost indoor air-quality sensors could support personalized asthma prevention, but their nonlinear measurement error, delayed exposure effects, time-varying confounding, and heterogeneous lower-tail responses limit risk estimation. We present CAUSALQUANT-ASTHMA, a measurement-error-aware causal quantile distributed-lag framework for short-horizon peak expiratory flow analysis. Sparse reference measurements train a nonlinear calibration model; stabilized sequential generalized-propensity weights address measured exposure assignment; and a susceptibility-modulated, smooth, noncrossing quantile model estimates lag-specific and sustained-exposure contrasts. Because no authorized cohort simultaneously provided dense indoor sensing, reference co-location, and outcome-compatible longitudinal data, evaluation used five semi-synthetic panels with known counterfactual truth, 150 patients and 12,600 patient-days per realization. Across eight methods, CAUSALQUANT achieved a dose-response integrated absolute error of 0.304 plus or minus 0.094, improving 24.2 percent over the strongest measurement-error and propensity-weighted baseline. It also obtained the lowest overall pinball loss, 1.065, while maintaining zero quantile crossings and 78.1 percent coverage for the nominal 80 percent interval. Sensor calibration reduced held-out exposure RMSE by 33.7 percent. Stress tests quantified degradation under sensor noise, missing personal measurements, and hidden confounding. These findings establish methodological feasibility and reproducibility, not clinical effectiveness; prospective, governance-approved external validation is required before patient-level interpretation or deployment.
Machine Learning
STAR: Adaptive Spatial-Temporal Normalization for Unified Microservice Incident Management
Automated incident management in large-scale microservice systems relies on learning robust representations from multimodal observability data, including metrics, logs, and traces. Although recent self-supervised frameworks enable unified modeling for anomaly detection (AD), failure triage (FT), and root cause localization (RCL), they often struggle with non-stationary temporal dynamics and heterogeneous service dependency structures. In this paper, we propose STAR, a Spatial-Temporal Adaptive Representation learning framework that explicitly addresses these challenges through adaptive normalizations. STAR introduces two tightly coupled mechanisms: Temporal Adaptive Normalization (TAN), which dynamically normalizes multivariate time series using multi-scale temporal context, and Spatial Adaptive Normalization (SAN), which performs structure-aware normalization over service dependency graphs. Unlike prior methods that treat normalization as static or task-agnostic, STAR formulates it as a learnable, context-conditioned transformation aligned with the intrinsic properties of microservice systems. The resulting adaptive representations are integrated into a unified self-supervised framework, enabling end-to-end unsupervised support for AD, FT, and RCL tasks. Extensive experiments on two real-world microservice benchmarks demonstrate that STAR consistently outperforms all state-of-the-art baselines, yielding significant and stable improvements across all three tasks. Our results highlight adaptive normalization as a principled and effective mechanism for robust multimodal representation learning in complex software systems.
Read the full abstract
Machine Learning
MaD-RL: Matching Distributions for Calibrating LLMs with Reinforcement Learning
Reinforcement learning (RL) is widely used in language-model post-training to maximize rewards assigned to individual model outputs, such as scores from binary verifiers or reward models trained on human feedback. However, applications such as synthetic-data generation, fairness-related constraint satisfaction, and policy exploration require controlling the distribution of outputs across model generations rather than only maximizing expected reward. We propose a general RL-based framework for Distribution Matching allowing matching the distribution of a latent categorical attribute of model outputs to a specified target distribution. Empirically, we demonstrate that dominant post-training recipes such as Group Relative Policy Optimization (GRPO) reduce output diversity by concentrating policy probability towards a single mode. Entropy regularization and sampling temperature can improve the spread of the distribution but have constrained effectiveness, limited to apply only in token space and toward uniform distributions. We show that prior work in this area is a specific case of Distribution Matching involving the $L_2$ divergence. We then propose reward functions for other divergences such as KL and Jensen-Shannon and motivate them with theoretical justification. Finally, we demonstrate the effectiveness of our approach on a set of experiments involving mathematical reasoning and programming.
Read the full abstract
Machine Learning
Information Design Against Gaming and Learning Adversaries
A principal who deploys a binary classifier with an abstention option must decide which queries the mechanism abstains on. The right choice depends on the adversary. A gaming adversary already knows the classifier and tries to manipulate features across the boundary, so the principal does best by abstaining on queries close to that boundary. The same boundary-localizing rule is the worst possible choice against a learning adversary who does not know the classifier: each abstention now tells the adversary that the boundary is nearby, which is enough to drive a binary search. We analyze this tension. The two natural defenses, abstaining at a fixed rate and abstaining near the boundary, are Blackwell-incomparable: neither can be simulated by post-processing the other's responses. The number of queries needed to reconstruct the boundary to error $\eps$ is $\tilde\Theta(d/\eps)$ under the first defense and $\Theta(d \log(1/\eps))$ under the second, where $d$ is the VC dimension of the classifier family and $\tilde\Theta$ suppresses factors polylogarithmic in $d$ and $1/\eps$. The first rate is a worst case over query distributions; no reconstruction algorithm can close the gap at the distributions that attain it. We characterize the Pareto frontier between the two defense objectives, and confirm both rates on seven binary-classification tasks spanning tabular, image, and language-model-feature inputs: label-plus-counterfactual access extracts the boundary with up to $200\times$ fewer queries than a published label-only baseline.
Read the full abstract
Computation and Language
A Survey on Fake Review Detection: From Pre-trained Language Models to Large Language Models
Online reviews shape consumer decisions, platform governance, and corporate reputation.Fake reviews compromise this information channel by injecting deceptive evidence into rating systems, recommendation pipelines, and public trust mechanisms.The rise of large language models, or LLMs, has changed the problem in two directions.LLMs can generate fluent and context-aware deceptive reviews, while pre-trained language models, or PLMs, and LLMs also provide stronger semantic representations for detection.This survey reviews fake review detection from an information fusion perspective, covering 211 studies published from 2018 to early 2026.We organize existing work by evidence source and fusion level, covering review text, sentiment, rating behavior, temporal metadata, user-product graphs, multimodal content, external knowledge, and LLM-generated signals.We trace the development from traditional machine learning and deep learning to PLM-based and LLM-based methods, and examine how different approaches combine textual, behavioral, structural, and multimodal evidence.We also analyze reported performance trends on widely used Amazon, Yelp, and OpSpam benchmark families, while noting the limitations caused by different label construction procedures, data splits, and evaluation protocols.Finally, we identify open problems in adversarial generation, cross-domain transfer, uncertainty-aware fusion, missing-source robustness, interpretability, and trustworthy evaluation for AI-generated deceptive content.
Read the full abstract
Computation and Language
LLMersion: A Local-First AI Agent Framework for Low-Cost Home Language Learning toward Educational Equity
Artificial intelligence helps education most where an essential provision has been rationed by cost. For language learners that provision is a teacher's voice, which binds listening, reading, speaking, and writing into one act. Published evidence shows why most learners lack it, from a global shortage of 44 million teachers to heavy household tutoring bills, and why technology has not substituted for it: computer-assisted language learning proved effective but narrow, applications presuppose connectivity 2.6 billion people lack, and One Laptop per Child's randomized evaluation found that hardware without capable software teaches nothing. We distill eight difficulties and four binding constraints, and argue that small open-weight models dissolve the last: a complete four-skill stack now fits a \$200-class laptop and, on community measurements, generates at the pace speech is consumed, for about one US cent of electricity per study hour. We therefore propose LLMersion, a scheme for AI for education that runs entirely at home, over the learner's own documents, with an AI-written, AI-understood, AI-updated codebase anyone can customize; present LLMersion-1, a released open-source prototype (https://github.com/QM378/LLMersion ); and outline the vision of a private learning agent.
Read the full abstract
General Mathematics
Coven-Meyerowitz T2 necessity through coprime stripe collapse
We prove that every finite subset of the integers which tiles by translations satisfies the Coven-Meyerowitz condition T2, with no restriction on the number of prime factors or their exponents. Together with the necessity of T1 and the sufficiency of T1 and T2 proved by Coven and Meyerowitz, this gives their proposed characterization of finite integer tiles. The proof uses strong induction on a cyclic tiling period. Character identities produce periodic Boolean product stripes; integral descent to a coprime quotient and the Frobenius identity force a common orientation. Independent phase shifts then give smaller-period tilings from which the mixed cyclotomic zeros of the original factors can be recovered. A companion Lean formalization verifies the unrestricted T2 necessity statement.
Read the full abstract
Complex Variables
Geometric index theorems for holomorphic foliations and curves
Let $M$ be a complex surface endowed with a holomorphic projective connection and let $C \subset M$ be a compact smooth holomorphic curve. Given two singular holomorphic foliations $\mathcal{F}$ and $\mathcal{G}$ near $C$, with $C$ not $\mathcal{G}$-invariant, we attach to every point $p \in C$ an index $\mathrm{Ind}(\mathcal{F},\mathcal{G},C,p) \in \mathbb{C}$ of $\mathcal{F}$ relative to the reference $\mathcal{G}$, and we prove that these indices add up to $T\mathcal{G} \cdot C$. When $C$ is $\mathcal{F}$-invariant the index is the Camacho–Sad index corrected by the order of tangency of $\mathcal{G}$ with $C$, and the index formula reduces to the Camacho–Sad formula. The main applications are two contact formulas. At a tangency point $p$ of $\mathcal{G}$ with $C$, let $k(\mathcal{G},C,p)$ be the ratio of the curvatures at $p$ of the leaf of $\mathcal{G}$ and of the curve; it is a projective invariant, although each curvature separately depends on a choice of metric. If $\mathcal{G}$ has no singular points on $C$ and only simple tangencies with $C$, then $$ \sum_{p} \frac{1}{1 - k(\mathcal{G},C,p)} = \frac{2}{3}\left( C \cdot C + g - 1 \right), $$ where $g$ is the genus of $C$: the number of tangencies depends on $\mathcal{G}$, but this weighted count does not. For a pencil of lines in the projective plane it is the Plücker formula for the class of a plane curve. The second formula asserts that, for a curve in general position with respect to $\mathcal{F}$ and $\mathcal{G}$ which is not a geodesic, the total index of the tangencies of $\mathcal{F}$ with $\mathcal{G}$ along $C$ equals the number of tangencies of $\mathcal{G}$ with $C$ minus one third of the number of inflection points of $C$; in particular, it does not depend on $\mathcal{F}$.
Read the full abstract
Robotics
DeViGrasp: Robust Visual Mobile Grasping for Quadruped Manipulators under Degraded Perception
Quadruped manipulators enable mobile grasping in complex environments, yet their whole-body control policies remain vulnerable to unreliable onboard visual perception. Existing methods are typically developed under relatively reliable observations and have not systematically examined how occlusion, segmentation-mask dropout, depth noise, and target-localization jitter affect grasp reasoning and target tracking. To address this gap, we introduce DeViGrasp-Bench, a benchmark for mobile grasping under degraded vision that incorporates controlled visual degradations, seen and unseen objects, multiple difficulty levels, and complex terrains, and evaluates task success, execution efficiency, and action smoothness. We further propose DeViGrasp-Net, a teacher–student framework that combines state-conditioned grasp reasoning with reliability-aware temporal target estimation. The privileged teacher attends to offline grasp candidates conditioned on object, robot, end-effector, and task states, while the deployable student fuses dual-view segmented-depth observations with current, memory, and recovery target hypotheses through Target Hold Memory and Temporal Memory Attention. DeViGrasp-Net outperforms VBC across degradation levels, unseen objects, and complex terrains, and surpasses an adapted DQ-Net across all evaluated degradation levels. Under the Difficult setting, it achieves a success rate of 62.3%, improving upon VBC and DQ-Net by 16.1 and 4.3 percentage points, respectively; under the Hard setting, its margin over DQ-Net increases to 10.5 percentage points. Ablation studies confirm the complementary benefits of grasp-aware supervision and reliability-aware temporal memory.
Read the full abstract
Artificial Intelligence
An Affordable AI-Integrated Smart Cane for Multimodal Mobility Assistance of Visually Impaired Users
Visual impairment affects over 2.2 billion people worldwide, yet conventional white canes cannot detect elevated hazards or provide semantic environmental context. Existing AI-assisted navigation systems typically rely on expensive hardware or cloud connectivity, limiting accessibility in resource-constrained settings. This paper presents an affordable (\$88 USD), fully offline AI-integrated smart cane designed for multimodal mobility assistance on an ultra-low-power Raspberry Pi Zero 2W. The system fuses RGB vision sensing with Time-of-Flight (ToF) distance estimation, pairing an INT8-quantized SSD MobileNet V1 model with distance-aware vibrotactile feedback and real-time audio alerts. To ensure operational robustness on constrained hardware, a multiprocessing architecture isolates sensor acquisition, neural inference, and haptic feedback into independent processes with fail-safe sensing support. Experimental evaluation across indoor mobility scenarios demonstrates a macro-averaged F1-score of 0.82 (precision: 0.85, recall: 0.81), a mean end-to-end latency of 330\,ms, and a peak power draw of 2.8\,W. A preliminary usability study with 12 participants (SUS: 78.5, NASA-TLX) demonstrated positive user perception and enhanced obstacle awareness. The proposed prototype validates the feasibility of deploying privacy-preserving, edge-native assistive intelligence for cost-sensitive mobility assistance.
Read the full abstract
General Physics
Towards a picture of the natural world derived from relativity and quantum theory
I contend that physics should provide a coherent account of reality, in addition to be an efficient algorithm for the prediction of empirical results. This article offers pictures of reality derived from theories of modern physics. In particular it is shown that Bose quantum fields may be interpreted as pure wave fields via the Weyl-Wigner representation. The most relevant result being the existence of a stochastic vacuum field, corresponding to the quantum vacuum fluctuations of the standard, canonical, formulation of field theory. That field provides explanations for the particle (photons) behaviour of the electromagnetic field. Also a realistic interpretation is offered for the interference experiments with actual particles, like atoms. The interpretation of classical general relativity is standard but emphasis is made on the principle of equivalence. Problems like the spacetime singularities (black holes) and the empirical violation of Bell inequalities are touched but slightly. Asides from these problems the main incompleteness of the article is the absence of a realistic interpretation of Fermi fields.
Read the full abstract
Hardware Architecture
SiliconBench: Speed, Memory, and Fidelity for LLM Serving on Unified-Memory Desktops
Concurrent local LLM serving on unified-memory desktops must preserve memory headroom and output fidelity, which speed-only rankings overlook. We introduce SiliconBench, which evaluates nine Apple Silicon serving engines through three lenses: speed, memory, and fidelity. We evaluate chat and agent serving on Qwen3, Qwen3.5, and Gemma 4. We use a classification task to check for quality regressions against an NVIDIA reference. DGX Spark provides a complementary serving-performance reference. Three desiderata guide interpretation: serving architecture readiness, memory discipline, and multi-node scaling. On Qwen3-0.6B, vllm-metal alone more than doubles throughput on both workloads from concurrency 1 to 16. CUDA vLLM and SGLang show stronger concurrency scaling on the same prompts. Explicit memory budgets do not guarantee memory headroom: two stacks complete every request while memory use approaches physical capacity and throughput declines. The newer model architectures have narrower engine support. Their evaluated implementations match the fidelity reference. Only three stacks satisfy the completion, fidelity, and model-coverage gates. Comparisons on larger dense and MoE models reinforce the importance of scheduling prompt processing alongside ongoing generation: vllm-metal's packed prefill-decode path maintains lower first-token latency than omlx under concurrent load. In the tested two-machine configurations, tensor parallelism over Thunderbolt RDMA scales while pipeline parallelism over TCP regresses. We release benchmark code, per-run results, and maintenance journals, supported by a workflow combining bounded agent fixes with human review.
Read the full abstract
Differential Geometry
Bounded curvature manifolds without Euclidean isometric immersions of bounded mean curvature
For every integer $n\ge2$, we construct a smooth complete Riemannian metric $G_n$ on $\mathbb{R}^n$ with full curvature norm at most one and injectivity radius at least one for which no $C^2$ isometric immersion into a finite-dimensional Euclidean space has bounded mean curvature. In dimension two, bounded second fundamental form would give uniformly controlled finite Jacobian representations of the Laplacian of the conformal factor. We construct disjoint conformal blocks for which the curvature remains bounded while the finite Jacobian representation cost tends to infinity. Taking Euclidean products gives all higher dimensions. The result answers Yau's Problem~52 negatively under the stronger assumption of bounded full curvature.
Read the full abstract
Software Engineering
Not All Agents Are Equal: Code Quality and Post-Merge Maintenance Across Five Autonomous Coding Agents in the Wild
Autonomous coding agents now open pull requests in public repositories at a scale that was out of reach two years ago, yet little is known about what happens to that code after it lands. This paper studies 37,623 provenance-labeled pull requests (PRs) from five commercial agents (OpenAI Codex, Devin, GitHub Copilot, Cursor, and Claude Code) and a matched human baseline, drawn from 2,807 GitHub repositories between December 2024 and July 2025. We combine the AIDev dataset with 58,792 cached GitHub API responses to measure security smells in added code, structural maintainability, post-merge churn, revert rates, and human review behavior. Three results stand out. First, quality differences are vendor-specific rather than uniform: Codex-authored PRs were reverted about half as often as human PRs (6.1% vs. 11.5%, odds ratio 0.50), while Devin PRs were reverted more often (14.5%, odds ratio 1.31). Second, agent code pooled across vendors was less likely than human code to contain a security smell (odds ratio 0.63), driven by fewer hardcoded credentials and eval-style constructs. Third, review effort concentrates unevenly: Copilot PRs drew the most human reviews and change requests, and Claude Code PRs waited the longest for a first human review (median 12.6 hours). All pipeline code, statistical reports, and figures are released for replication.
Read the full abstract
General Relativity and Quantum Cosmology
Traversable Hyperbolic Wormholes with a Casimir-Memory Source: Complexity and Shell-Free Matching
Hyperbolically symmetric wormholes provide a setting in which negative energy densities arise from the throat geometry and finite matter configurations can be matched to the hyperbolic Schwarzschild vacuum. We construct such configurations from a matter-first perspective using an effective Casimir source corrected by a gravitational-memory contribution, $\rho(r)=-\alpha/r^4+\eta/r^7$. The $r^{-7}$ term is motivated by the persistent shift of the Casimir vacuum energy after a transient gravitational perturbation, while its promotion to a radial source is treated phenomenologically. The density determines the shape function, and the temporal geometry is fixed through complexity-based conditions. Full vanishing complexity, $Y_{TF}=0$, is first imposed and then relaxed through a one-parameter deformation, $Y_{TF}=(p-3)r_0/(2r^3)$. Decomposing the complexity factor into local and throat contributions shows that local vanishing complexity occurs at $p=\beta'(r_0)$. At this value, besides the constant-redshift solution of the finite-$r$-derivative branch, a second lapse branch is regular in radial distance. We show that pressure-free Darmois matching in the finite-$r$-derivative family requires $p<\beta'(r_0)$, enforcing tangential null and strong-energy-condition violations at the throat throughout the matching domain. The density remains negative in the matter-supported region, implying weak- and dominant-energy-condition violations independently of the lapse branch. The memory parameter modifies the flare-out domain, redshift profile, and matching data, while finite pressure-free junctions permit smooth matching to the hyperbolic Schwarzschild vacuum without thin shells. The construction combines a memory-corrected Casimir source with a unified complexity framework in which the temporal sectors emerge as related branches of the same radial geometry.
Read the full abstract
Probability
Joint Continuity and Selberg–ODE Equivalence for the $\mathrm{Sine}_\beta$ Pair Correlation Function
We address two questions posed by Qu and Valkó in their study of the pair correlation function of the $\mathrm{Sine}_\beta$ process. First, we prove that the pair correlation function admits a jointly continuous version in the inverse-temperature and spatial parameters on $(0,\infty)\times\mathbb{R}$, removing the restriction $\beta>2$ in their joint-continuity result. The argument uses a general observation: separate weak continuity of a family of probability laws, together with stochastic monotonicity in one parameter, implies joint weak continuity. Applied to the terminal value of the Qu–Valkó diffusion, their Palm-density formula then gives the result without differentiating the Fourier expansion. Second, for $\beta=2n$ we give a direct proof that the Qu–Valkó matrix-recursion power series agrees with the Selberg-integral representation recorded by Forrester. A Krawtchouk transform converts the Qu–Valkó system into a $(2n+1)$-dimensional differential system with parameter $-(n+1)$, while a centered Aomoto–Selberg trace system has parameter $n+1$. An explicit triangular differential intertwiner reflects the parameter $\eta\mapsto-\eta$. Matching the unique Frobenius branch of exponent $2$ gives exactly the Selberg normalization. As a consequence, every coefficient of the Qu–Valkó recursion is identified with an even centered moment of the corresponding Jacobi–Selberg trace statistic.
Read the full abstract
Machine Learning
Prior-Free Competitive Ratios for Improving Bandits: Scale, Curvature and Horizon Are Free, but Not Jointly Under Noise
In the improving multi-armed bandits problem, each of $k$ arms has an unknown nondecreasing, discretely concave reward curve $f_i$, and pulling arm $i$ for the $t$-th time yields $f_i(t)$. For sufficiently long horizons, Blum and Ravichandran (ALT 2025) proved that randomized algorithms achieve an $O(\sqrt k)$ approximation to the best single arm when the scale $m=f^*(T)$ of the optimal arm is known ($T\ge2k$), and $O(\sqrt k\log k)$ when it is not ($T>4k$), against an $\Omega(\sqrt k)$ lower bound. The logarithmic factor is unnecessary: a one-page probe-and-commit algorithm achieves competitive ratio $4\sqrt3\,\sqrt k$ for $T\ge2\lfloor\sqrt k\rfloor$, without any knowledge of the scale, and we determine the optimal ratio for every horizon, $\Theta(\sqrt k+k/T)$, also for unknown horizons. Without noise, no prior is needed at all: a random-marginal probing algorithm reading neither the scale $m$, nor the concavity-envelope exponent $\beta$ of Blum, Garicano, Ravichandran and Sharma (UAI 2026), nor the horizon $T$, achieves the optimal $\Theta(k^{\beta/(1+\beta)}+k/T)$ simultaneously for every $\beta$ and every horizon. Under the multiplicative noise model of Blum and Ravichandran, probe-and-commit keeps the same all-horizon order $\Theta(\sqrt k+k/T)$ without knowing the noise level (and $\Theta(\sqrt k)$ on the same range), but the price of priors jumps: for any fixed noise level $\varepsilon\in(0,1/2]$, the uniform price of adaptation $\phi_\varepsilon(k)$ — the worst case over horizons $T\ge16k$ of the loss relative to $k^{\beta/(1+\beta)}$ for algorithms knowing neither $m$ nor $\beta$ — is $\Theta_\varepsilon(\sqrt{\log k/\log\log k})$, the lower bound asymptotic in $k$ at fixed positive $\varepsilon$ and matched by a nested random-permutation probing algorithm, whereas knowing either $m$ or $\beta$ alone restores a constant price.
Read the full abstract
Machine Learning
When the Gradient Sees Rank: Provable Necessity, Causal Recruitment, and Composition in Trained Matrix Memories
Can gradient-based training learn the rank needed to store and compose associations in a matrix memory? In our earlier study, we used a matrix-augmented reasoner on a task that admits a rank-1 solution, leaving this question open. We train matrix memories on $K$ fresh key-value bindings whose exact linear recovery requires $\mathrm{rank}(Z) \geq K$. A fixed linear readout queries a single matrix state without access to the original bindings. Experiments measure recovery by cosine similarity greater than 0.9, a threshold distinct from mathematical equality. Learned effective rank increases with $K$ across the tested grid (Spearman $\rho = 1.0$ at $d = 16$). Training-time rank caps produce a recovery transition near $k = K$: at $d = 8$, $K = 4$, rank 3 gives at most 0.0004 recovery and rank 4 gives 0.97. Four of five seeds retain at least 0.9996 recovery through 21-fold self-application of the trained operator. On the entity subspace, the learned operator has effective rank close to $K$ and approximates the ideal cycle. For the single converged seed capped below $K$, a calculation using the entity-subspace operator and ideal cycle predicts the measured cosine within 0.008 through seven applications. Extending training resolves several initial failures, but recovery still declines at larger matrix dimensions with encoder width fixed.
Read the full abstract
Fluid Dynamics
Task-preserving neural segmentation of overlapping shocks and vortex cores in compressible flows
Shock fronts and vortex cores often coexist and overlap in compressible flows, where walls, wakes and shear layers also produce strong gradients. Refining a network to detect one structure can therefore degrade its prediction of the other without revealing the loss in the optimized score. We present a task-preserving formulation for simultaneous shock and vortex-core segmentation. The experiments use two solvers and include supersonic diamond-airfoil flows at several incidences and Reynolds numbers, together with circular- and elliptical-cylinder flows. A shared primitive encoder feeds separate shock and vortex decoders with independent sigmoid outputs, allowing the two classes to overlap. Adaptation is confined to the relevant branch: zero-initialized adapters supply rotational diagnostics only to the vortex decoder, while corrected shock supervision updates only the shock decoder. All dependencies of the protected output remain fixed, and bitwise equality is verified on every evaluation field. Compression and conservation-jump (Rankine–Hugoniot) signatures provide weak shock supervision; rotation and topology provide vortex candidates. Analytical oblique-shock rays, Billig's bow-shock correlation and an isentropic vortex supply references independent of these labels. Under the same corrected-target budget, the restricted model and a capacity-matched shared-decoder U-Net obtain comparable shock agreement. Their airfoil vortex-core Dice overlap scores, however, are 0.83 and 0.08, respectively. A soft retention penalty recovers most of the U-Net's lost core agreement. The frozen shock-adapted models locate the tested analytical oblique-shock rays within 0.003 chord. An additional branch identifies expanding-flow regions, which are distinguished from centred Prandtl–Meyer expansion fans through comparison with ideal shock–expansion theory.
Read the full abstract
Statistical Methodology
Component-weighted sparse group LASSO for finite mixture regression models
When analyzing heterogeneous data with latent subpopulations, finite mixture regression (FMR) models are effective as they allow for variations in regression coefficients across mixture components. Variable selection is important at two levels: (1) at the group level by removing completely irrelevant covariates across all subpopulations and (2) at the individual level by removing irrelevant covariates within each subpopulation. However, existing variable selection methods for FMR focus solely on individual-level regression coefficient selection, providing no mechanism for group-level variable elimination. We introduce a component-weighted sparse group LASSO regularization method that performs efficient variable selection at both levels simultaneously in finite mixture regression models belonging to the exponential family. We develop a novel optimization procedure through a Majorization-Minimization algorithm. Simulation studies under Gaussian and Poisson mixture regression settings demonstrate reliable recovery of the true sparsity structure at both levels. The method is illustrated by analyzing two real datasets.
Read the full abstract
Combinatorics
An endpoint exception to a conjectured equality characterization for Laplacian eigenvalue products
We give eight-vertex counterexamples to the equality characterization in Conjecture 20 of Chen, Guo, Li and Wang, Electron. J. Combin. 32(4) (2025), P4.37. The examples occur at the included endpoint $k=3n/4$ and extend to infinite families, including a family for which both the graph and its complement are connected. These examples do not contradict the numerical inequality in that conjecture.
Read the full abstract
Number Theory
The Waring-Goldbach problem in short intervals under the Generalized Riemann Hypothesis
Let N be a sufficiently large odd integer. We study the representation of a large integer m N^k as a sum of m almost equal k-th powers of primes, where the common distribution scale is at least N^theta. Assuming the Generalized Riemann Hypothesis (GRH), we prove that for any epsilon > 0 one may take theta > 1/2, provided that m < k(k+1)/2 and that m, k are odd integers sufficiently large. This is achieved by employing a new tool closely related to earlier work. For sufficiently large m, by refining the discussion of the minor arcs, we further show that under GRH the equation has a solution provided m > 16k log k + 4k + 2. Moreover, we give an asymptotic formula for the number of solutions, with main term involving N^{2k theta (1 - (1 - 1/k)^{m_1}) + theta(m-1) + 1 - k}, where m_1 = 4k. Under GRH and for sufficiently large m, k, the short-interval Waring-Goldbach problem is essentially settled.
Read the full abstract
General Physics
New Barrow holographic dark energy: cosmological dynamics and cosmic chronometer analysis
We formulate new Barrow holographic dark energy (NBHDE) as a second-order expansion of the Barrow entropy correction near the standard holographic dark energy (HDE) limit, adopting the future event horizon as the infrared cutoff. Writing the Barrow factor in exponential form identifies $(\Delta/2)\ln S_{\rm BH}$, rather than $\Delta$ alone, as the expansion parameter. In a flat universe containing pressureless matter and NBHDE without a cosmological constant, we derive the background equations, establish consistency with the integral definition of the future event horizon, and recover HDE exactly at $\Delta=0$. We assess this approximation against the unexpanded Barrow holographic dark energy (BHDE) density, locally and through independently normalized background evolutions. Across $0.50\leq c\leq1.20$ and $0\leq\Delta\leq0.003$, the maximum fractional density difference remains below $1\%$ over $-0.99\leq z\leq5$, while the normalized Hubble rates differ by less than $0.074\%$ over $0\leq z\leq5$. Within this domain, the Barrow correction modestly changes the expansion rate and acceleration transition but more strongly affects the dark energy equation of state and phantom crossing. At $c=0.80$, $w_{d0}$ shifts from $-1.031$ in HDE to $-0.900$ at $\Delta=0.003$. We perform a conditional comparison with 36 spectroscopic cosmic chronometer (CC) measurements. At fixed $H_0=67.4\,{\rm km\,s^{-1}\,Mpc^{-1}}$ and $\Omega_{m0}=0.30$, the minimum lies on the HDE boundary at $\Delta=0$ and $c=0.8457$. Minimizing over $c$ at $\Delta=0.003$ gives $c_{\min}=0.6879$, with $\Delta\chi_{\rm CC}^2\simeq1.0\times10^{-3}$. NBHDE therefore provides a self-consistent, quantitatively controlled framework near the HDE limit, showing that Barrow corrections can alter dark energy behavior even when their effect on $H(z)$ is largely compensated by changing $c$.
Read the full abstract
Optimization and Control
Asymmetric Weighted Earliness-Tardiness: Scheduling with a Nonrestrictive Common Due Date
Single-machine asymmetric weighted earliness–tardiness (AWET) scheduling asks how to sequence jobs around a common synchronization date when early and late completion incur unrelated job-dependent penalties. At the boundary nonrestrictive date $d=\sum_jp_j$, a compact V-shaped schedule reduces the continuous-time problem to a quadratic choice of a nonempty early set. We establish four complementary results for this model. First, the positive-integer problem is strongly NP-complete by a unary-polynomial reduction from Restricted Exact Cover by 3-Sets. Second, unrestricted AWET admits a polynomial-time $(3+2\sqrt2+\varepsilon)$-approximation based on an anchored semidefinite relaxation and deterministic marginal thresholding. Third, when the earliness and tardiness ratio orders are strict reversals, the problem is weakly NP-complete but has an exact two-resource pseudopolynomial dynamic program. Fourth, for fixed total refinements whose ratio permutation is separable, an exact separating-tree recurrence and coordinated geometric trimming yield an FPTAS. The proofs use different manifestations of the same canonical objective: scale-separated prefix penalties, positive-semidefinite minimum-kernel covariance, a dominant completed load square, and a bounded four-coordinate decomposition interface. Together, the results show that the decisive issue is not merely whether the two ratio orders agree, but whether their interaction can be controlled by a global certificate or compressed into a bounded constructive interface.
Read the full abstract
Statistical Mechanics
Maxwell-J$\"u$ttner averaged nonaffine theory of relativistic shear viscosity
We formulate a Maxwell-Jüttner averaged extension of relativistic nonaffine shear-viscosity theory for a classical gas of massive particles. The starting point is the relativistic nonaffine response formula derived from generalized Langevin dynamics, where proper-momentum dissipation produces a Lorentz-factor enhancement of the viscosity. Since a thermal relativistic gas is not characterized by a single Lorentz factor, we replace this scalar enhancement by an equilibrium momentum average over the Maxwell-Jüttner distribution. Within the scalar transverse mean-field closure used in this work, the minimal relativistic correction is the Maxwell-Jüttner mean of the Lorentz factor and becomes a finite-mass enhancement function of $\zeta=mc^2/(k_BT)$. In the general closure, the averaged object is the full product of the Lorentz factor, the zero-frequency memory kernel, and the nonaffine affine-force correlator. This construction separates kinematic relativistic enhancement from dynamical dissipation encoded in the bath memory and collective mode spectrum. We derive the nonrelativistic and ultrarelativistic limits, show that a specified effective hard-sphere scaling reproduces the classical square-root law as a consistency test, and identify the assumptions under which a cubic high-temperature law follows. Comparison with relativistic kinetic-theory examples clarifies that the memory kernel is not equivalent to a relaxation time unless a microscopic closure is specified. Retaining the full frequency dependence instead yields a relaxation spectrum. A single dominant pole reduces this spectrum to one shear relaxation time and gives the usual transient shear equation.
Read the full abstract
Information Theory
Linear Programming Bounds for Locally Recovery Codes II
We give a polynomial-size linear programming bound for $q$-ary all-symbol locally recoverable codes with locality parameters $(r,\delta)$, without assuming linearity. The key idea is to keep, for every ordered pair of codewords and every selected recovery view, the joint Hamming weight on the helper set, the recovered coordinate, and the rest of the code – rather than collapsing this triple into a single distance, as earlier formulations do. Averaging this three-block distribution over recovery views of the same length yields exact identities linking it to the global distance distribution, together with nonnegative product-Krawtchouk constraints that encode locality and spectral positivity simultaneously. The resulting LP has polynomially many variables, its optimum dominates the ordinary Delsarte bound, and an earlier outside-distance formulation, the convex-hull bound of Li–Wei–Xiong, and the dual-based bound of Gruica–Jany–Ravagnani all arise from it as coarser marginals. Exact rational certificates over $q=2,3,4$ show the bound is strictly stronger than the best of these prior LPs in thirteen of fifteen tested cases, pinning down seven exact maximum code sizes and twelve exact maximum linear dimensions.
Read the full abstract
Mathematical Physics
Gauged AKSZ sigma models
We propose a new class of sigma models that extend AKSZ sigma models, which we refer to as gauged AKSZ sigma models. These models are constructed using QP-manifolds. The compatibility between the AKSZ structure and gauging is characterized by geometric conditions on the target graded manifold. As an example, we explicitly analyze the gauging of higher Courant sigma models in higher dimensions. When fluxes and boundaries are introduced into gauged higher Courant sigma models, generalizations of momentum maps and Hamiltonian $G$-spaces arise as consistency conditions for the models.
Read the full abstract
Graphics
Non-uniform B-spline optimization method for generating swept surfaces
Swept surface construction is widely used in computer-aided design. We propose a novel optimization method using non-uniform B-splines to improve the approximate accuracy of swept surfaces. First, discrete points on the swept shape are computed, and geometric properties such as surface area, discrete curvature, first-order derivatives, and their rotation angles are used to derive a distribution function representing surface irregularity, with weights adjusted from samples. Then, feature points are selected based on the distribution function to determine control points for the approximate non-uniform B-spline surface via inverse calculation, producing an optimized approximation. Finally, the number of feature points is adjusted based on the estimated approximation error. Experiments on 969 randomly generated sweep samples and 1 pipe example show that the proposed algorithm achieves similar accuracy with fewer control points, reducing them by about 15.85% at a specified accuracy of 0.01. Moreover, with ample sampling points, it reduces the average error by approximately 51.35% when the feature point multiple is 10 times the path control points, outperforming comparable methods.
Read the full abstract
Cryptography and Security
Transparent Identity Verification Approach Using MPC and Efficient Credential Status Handling
A secure and privacy-preserving identity verification process is essential for digital ecosys- tems. Current eKYC frameworks that rely on Zero-Knowledge Proofs (ZKPs) face high computational cost, rigid circuit design, complex integration, and expensive on-chain verification. The W3C 2021 BitString- based credential status mechanism also suffers from inefficient updates and poor scalability in large- scale deployments. We propose a transparent and cost-effective identity verification framework based on Multi-Party Computation (MPC). It enables private off-chain code execution and produces runtime proofs anchored to a blockchain. The framework introduces a multidimensional bit-matrix model with efficient compression. Using ZSTD, the credential data is reduced to 76 bytes compared to 140 bytes with GZIP, cutting storage and bandwidth costs. The system also supports fine-grained status updates and Layer-2 blockchain anchoring for tamper-evident, low-cost verification. The system employs reusable verifiable presentations (VPs) with unique access tokens, enabling cost-free verification and stronger access control. Selective disclosure preserves user control and strengthens privacy. Finally, the system integrates SHA3 hashing and Falcon post-quantum signatures. This guarantees robustness against quantum attacks, transparency, and scalability. It is a future-proof solution for national-scale identity verification, as demonstrated by experimental findings and security studies that validate its robustness and applicability.
Read the full abstract
Analysis of PDEs
A counterexample to quasiconcavity for the Gaussian $p$-Capacity potentials in convex rings
We construct a smooth, strictly convex ring that admit a unique solution of Gaussian $p$-Capacity problem whose super-level sets are nonconvex. This result provide a negative answer.