Nuclear Experiment
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 31 August
We report measurements of spin-dependent electron scattering from a polarized $^3$He target, $\vec{^3\textrm{He}}(\vec{e},e')X$, performed at the Thomas Jefferson National Accelerator Facility (Jefferson Lab). The $^3$He spin-dependent virtual-photoabsorption cross sections $\sigma_{TT}$ and $\sigma_{LT}$, or equivalently the spin structure functions $g_1$ and $g_2$, and their moments were extracted for $0.032 \leq Q^2 \leq 0.23$~GeV$^2$, with coverage from the two-body breakup threshold through the nucleon-resonance region. The moment $I_1(Q^2)$ reaches a plateau below $Q^2 \simeq 0.1$~GeV$^2$, consistent with the Gerasimov–Drell–Hearn (GDH) expectation, while the moment $I_{TT}(Q^2)$, still dominated by the finite-virtuality breakup response, peaks at $Q^2 \simeq 0.1$~GeV$^2$ and turns toward the expected GDH value. Together, the two moments constitute the first observation of a nucleus approaching its GDH sum-rule value at the real-photon point. The moments $I_2(Q^2)$ and $I_{LT}(Q^2)$ yield, respectively, the lowest-$Q^2$ nuclear test of the Burkhardt–Cottingham sum rule and the first nuclear test of the Schwinger sum rule. Besides testing fundamental sum rules, these data provide stringent benchmarks for ab initio calculations of the spin structure of light nuclei.
Medical Physics
Unimodality and Radial Monotonicity of the Magnetic Resonance Fingerprinting T1/T2 Matching Objective
Magnetic resonance fingerprinting (MRF) estimates tissue parameters by matching an acquired MR signal time course to entries in a Bloch- or EPG-simulated dictionary. However, no study has yet proven the uniqueness of the matching results. In two earlier studies by exhaustive objective mapping I showed that for two widely used MRF sequences the normalized-correlation objective exhibits a single dominant peak at the true T1/T2 values and decreases smoothly away from that peak. These empirical properties motivated the fast MRF-ZOOM search algorithm even without using a pre-generated signal dictionary, but their theoretical basis has remained incomplete. The purpose of this work is to develop a mathematical framework for the MRF matching objective under normalized-correlation matching.
Read the full abstract
Statistical Methodology
Causal inference with staggered entries and effects that change over calendar time
Studies with staggered entry, in which individuals enroll at different calendar times, are ubiquitous in medicine and related disciplines. Because these studies usually have a fixed administrative end of follow-up, identification of the estimand of interest relies on assumptions about the right-censoring mechanism. The assumptions are often considered plausible only conditional on covariates, including the time an individual entered the study (E). Yet, censoring assumptions formulated conditional on E are ill-posed due to positivity violations. Here, we study the consequences of this issue for common procedures in causal survival analysis, such as those based on marginal structural models. We further give conditions for valid identification and introduce sensitivity analyses to assess practical implications. We illustrate our methodology through two case studies. The first builds on the seminal article by Hernán et al. (2000) on the effect of zidovudine treatment. The second reanalyzes a recent study on the effect of the mRNA vaccine in patients receiving immune checkpoint inhibitors.
Read the full abstract
Soft Condensed Matter
Experimental Observation of Mesoscopic Dynamic Fluctuations in Water-Alcohol Mixtures
We applied a dynamic fluctuation measurement method to liquid water-methanol mixtures over a wide range of compositions and temperatures. This method, which we developed in recent years, combines ultrasonic and inelastic X-ray scattering techniques to detect mesoscopic-level fluctuations - that is, the degree of heterogeneity - in liquids using sound waves. As a result, it was found that dynamic fluctuations exist across a wide range of compositions and temperatures, including pure substances (water and methanol). Furthermore, in the low-methanol composition range (approximately 20% mol or less), the strength of dynamic fluctuation increased toward lower compositions and lower temperatures, suggesting that the origin of the fluctuation lies in the low temperature (supercooled) region of water alone. Conversely, this indicates that in the range below 20% methanol, fluctuations in water alone are dominant rather than the mixed effects of water and methanol. We performed similar dynamic fluctuation measurements on water-ethanol and water-glycerol mixtures at room temperature. We found that dynamic fluctuations exist universally across the entire composition range, and confirmed an increase in the strength of dynamic fluctuations toward lower compositions in the regions approximately below 15% and below 20%, respectively. This revealed that the phenomenon is not unique to methanol systems but is a common behavior shared by water-alcohol mixtures. It has long been known that water-alcohol mixtures exhibit various thermodynamic anomalies, but the mechanisms behind them have not yet been fully elucidated. The present results are expected to provide a new direction for discussion on this issue.
Read the full abstract
Combinatorics
Prime and Touchard Congruences of Mixed-Type Bell Numbers
This paper establishes a comprehensive combinatorial and arithmetic framework for mixed Stirling and mixed Bell numbers, bridging partition structures, Touchard polynomials, and prime-power congruences. Furthermore, we develop to $p$-adic valuation theory, proving prime-power Touchard congruences and higher-order modulo-$p^2$ refinements that generalize classical arithmetic properties of combinatorial sequences.
Read the full abstract
Statistical Computation
Multifidelity Computer Model Emulation Via Diffusion Model Steering and Targeted Maximum Likelihood
We develop a multifidelity method for fusing low-resolution simulations with computationally expensive high-resolution simulations, which are run infrequently and are therefore prone to bias. We formulate this fusion as a constrained optimization under missing-not-at-random (MNAR) selection bias. This formulation searches for the exponentially tilted high-resolution distribution that minimizes KL divergence from the biased baseline, subject to moment constraints derived from low-resolution simulations. This optimization requires first estimating the biased baseline conditional density $f$ as a nuisance parameter. We estimate $f$ using a score-based diffusion model. To eliminate the generative model's regularization bias that harms the downstream task, we apply targeted maximum likelihood estimation (TMLE). TMLE debiases $\hat{f}$ via a targeted exponential tilting, rendering the target parameters insensitive to first-order nuisance estimation errors. To execute this computationally, we adapt generative model steering, a technique originally developed for human-preference alignment. Using Feynman-Kac steering with a reward function based on our formulation, we simultaneously execute the exponential tilts for MNAR and TMLE at inference time, avoiding expensive retraining costs. Code available [here](https://github.com/Jong-Min-Moon/multifidel_emul_by_FK).
Read the full abstract
Sunday 30 August
Dynamical Systems
Spectral dimension reduction of dynamical systems on graphons
Spectral dimension reduction approximates a dynamical system on a large network by a low-dimensional system whose variables are weighted averages of the node states, with weights given by dominant eigenvectors of the network. Its effectiveness is closely related to the low-rank structure of the interaction matrix. We develop a graphon analogue of this reduction for dynamical systems on dense graph limits. For graphon dynamical systems, we formulate the reduction in terms of the compact self-adjoint integral operator associated with the graphon. This operator-theoretic setting gives a continuum analogue of the spectral/SVD-based framework used for finite networks: the eigenfunctions provide the reduction basis, and the decay of the corresponding singular values quantifies the effect of discarded modes. For finite-rank graphons, we prove exact reduction results for two classes of graphon dynamical systems. We also show that, for finite-rank graphons, the reduced system preserves equilibria, linear stability, and local bifurcations. For infinite-rank graphons, we derive error bounds for the spectral reduction. Numerical examples using finite-rank and infinite-rank graphons illustrate the exact and approximate regimes of the theory.
Read the full abstract
Machine Learning
Skill-Latent Rewards: LLM-Guided Reward Formulation for Hierarchical Reinforcement Learning
Long-horizon reinforcement learning under sparse and delayed feedback remains an open challenge. Existing return-decomposition methods redistribute episodic rewards to ease credit assignment, but they operate on raw state–action transitions and disregard the subgoal structure that governs meaningful progress in complex tasks. We propose Skill-LR, a hierarchical reinforcement learning framework in which a vision–language model identifies the agent's active subgoal at each timestep and a large language model generates a matching latent reward formulation through a two-stage prompting process. By conditioning reward signals on the currently active subgoal, Skill-LR produces stage-specific credit that evolves with the hierarchical plan, reducing temporal variance and improving sample efficiency. On multi-stage MiniGrid and BabyAI benchmarks, including DoorKey and Unlock-to-Unlock, Skill-LR converges faster and more reliably than sparse environmental rewards and strong credit-assignment baselines such as RUDDER and LaRe, demonstrating that subgoal-aligned latent rewards offer a principled path toward stable, interpretable credit assignment in long-horizon tasks.
Read the full abstract
Artificial Intelligence
When Should LLM Agents Forget? Memory Filtering Under Query-Critical Resolver Errors
LLM memory systems often delete facts classified as stale. We show that this hard-filtering step can reduce downstream accuracy when resolver errors delete query-critical facts. Across three models, a controlled sensitivity intervention moves hard-drop from gains of +0.186 to +0.230 at perfect resolution to losses of -0.176 to -0.181 at the lowest tested reliability. Paired targeted interventions show that false-drop causes significantly greater degradation than false-keep, while a non-deleting baseline can still fail when incorrect labels steer generation. On a frozen 102/102 calibration/test split, a simple deployment-matched gate reaches 0.655 accuracy versus 0.641 for always hard-drop and 0.662 for test-informed oracle selection. Global-accuracy crossovers require gold labels and are model- and task-specific diagnostics, not deployment thresholds. Deletion should instead be treated as cost-sensitive: validate query-critical false-drop risk on matched data, or default to label-free retention when such validation is unavailable.
Read the full abstract
Classical Analysis and ODEs
New bound on the Hausdorff dimension of Kakeya sets in $\mathbb{R}^4$
We obtain a slight improvement to the trilinear bound of Guth-Zahl by application of Wang-Zahl's resolution of 3-D Kakeya to tubes inside a thickened neighborhood of a variety. This is combined with the planebrush argument of Katz and Zahl to obtain the new bound of 3.073.
General Topology
Arbitrary Stage Spectra for Raikov Remainders Along Quotient Towers
Let $\theta$ be an ordinal and let $(N_\alpha)_{\alpha\leq\theta}$ be a continuous increasing tower of closed normal subgroups of a Hausdorff topological group $G$, with $N_0=\{e\}$. Write $\rho G$ for the Raikov completion of $G$, and put $K_\alpha=\overline{N_\alpha}^{\rho G}$ and $H_\alpha=GK_\alpha$. The successive and limit differences of the groups $H_\alpha$ mark the first stages at which points of $\rho G$ become old quotient points. For every nonzero ordinal $\theta$ and every set $S\subseteq(0,\theta]$, there is a Hausdorff pseudocompact Boolean group with a continuous tower of closed normal subgroups such that every member of the tower is pseudocompact and the nonempty strata occur exactly at the stages in $S$. The terminal quotient can simultaneously be chosen isomorphic to $\mathbb Z/2\mathbb Z$, and for every $\delta<\theta$ the successive factor $N_{\delta+1}/N_\delta$ is compact exactly when $\delta+1\notin S$. Thus a tower may have a single nonempty stratum at a limit stage even when every successive factor is compact. For a closed normal subgroup $N$ of $G$, let $\widehat q:\rho G\to\rho(G/N)$ extend the quotient homomorphism and put $K=\overline N^{\rho G}$. Over $gN\in G/N$, the fiber in $\rho G\setminus G$ is $g(K\setminus N)$, homeomorphic to $\rho N\setminus N$, while for $y\in\widehat q(\rho G)\setminus(G/N)$ the entire $\widehat q$-fiber lies in $\rho G\setminus G$ and is homeomorphic to $\rho N$. For precompact kernels this gives a canonical decomposition, and nested quotients give the two-stage identity underlying the transfinite filtration. Further results concern pseudocompact Raikov remainders and include countable Abelian examples.
Read the full abstract
Computers and Society
Mapping the Authorized Boundary: A Comparative Policy-Vignette Study of Generative AI Governance in Australian Higher Education
Australian universities regulate students' use of generative artificial intelligence (GenAI) through overlapping policies, procedures, guidance, and assessment instructions, but these environments may classify identical conduct differently. We applied 15 standardized student-use vignettes to the public policy environments of 20 Australian universities and produced 300 university-case classifications. We analyzed binding instruments (Layer A) separately from the full official environment (Layer B), then classified each combination as clearly permitted, permitted with conditions, potential policy breach, clearly prohibited, or indeterminate. We measured cross-university divergence with normalized Shannon entropy. We classified 120 combinations (40.0%) as clearly prohibited, 97 (32.3%) as potential policy breaches, 27 (9.0%) as permitted with conditions, and 56 (18.7%) as indeterminate; none met the strict threshold for clearly permitted. Disclosed language rewriting and a disclosed AI-drafted paragraph produced the highest divergence, whereas an explicit assessment prohibition produced unanimity. Binding instruments remained silent on GenAI in 100 combinations, and guidance clarified 88. The primary researcher led the coding with AI assistance and manually reviewed all 201 queued rows. An independent human second coder, who used no AI assistance, coded a blind 75-row sample. Overall agreement reached 57.3% (unweighted Cohen's kappa = 0.395; bootstrap 95% CI [0.244, 0.539]). The findings distinguish permission-gated from disclosure-based architectures and show that written policies regulate the retention of AI-generated text more clearly than process-only assistance does. Comparative policy-vignette testing evaluates whether written governance supports defensible classifications; it does not predict misconduct or enforcement decisions.
Read the full abstract
Machine Learning
Not All Synthetic Data Are Equal: Expert-Committee Audit Screening for Imbalanced Crash-Injury-Severity Prediction in Automated Driving Systems
Automated driving systems (ADSs) are increasingly operating on public roads, raising safety concerns, yet reliable prediction of crash injury severity remains difficult because crash reports are limited, severe outcomes are rare, and injury classes are highly imbalanced. Existing augmentation methods mainly increase minority-class sample size but rarely assess whether generated samples are credible for safety-critical prediction. This study proposes Expert-Committee Audit Screening (ECAS), a credibility-aware sample acceptance framework for ADS crash injury severity prediction under data imbalance. Using 1,477 incident-level ADS crashes from the National Highway Traffic Safety Administration Standing General Order records, ECAS audits generated minority samples through a real-data-only expert committee based on label support, boundary separation, committee agreement, and local plausibility. Within-class percentile normalization and Pareto non-dominated sorting select accepted samples without manually assigned evidence weights. With a fixed backbone combining normalizing flow augmentation and a Tabular Prior-data Fitted Network (TabPFN) classifier, the best ECAS configuration achieved the highest balanced accuracy, macro-F1, and minor-injury recall among all evidence configurations. Local neighborhood analysis showed that ECAS-accepted samples were better supported by nearby real minority crashes than unscreened retained samples. Shapley additive explanations and partial dependence plots further indicated that lower injury severity classes were mainly associated with crash counterpart and pre-crash movement, whereas moderate-plus injuries were more sensitive to posted speed limit and operating context. These findings support a shift from quantity-oriented augmentation to credibility-aware sample acceptance for ADS safety prediction and risk governance.
Read the full abstract
Human-Computer Interaction
TransCAVE-E: A distributed virtual reality testbed for adaptive external human-machine interfaces
External human-machine interfaces (eHMIs) are evolving from predefined displays toward adaptive communication strategies that respond to changing traffic and road-user states. This transition requires experimental infrastructure that supports human-in-the-loop (HIL) interaction, software-in-the-loop (SIL) algorithm execution, reusable experiment orchestration, and synchronized multimodal human-factors evaluation. This paper presents TransCAVE-E, a distributed virtual-reality testbed for developing and validating adaptive and intelligent eHMIs. The platform integrates three coupled modules: a Scenario Design Center for configurable traffic environments and experimental conditions; an eHMI Algorithm Module for bidirectional real-time coupling between simulation and external algorithms; and a Data Management System that synchronizes trajectories, eye-tracking, physiological, system-log, and subjective data. A distributed multi-agent architecture supports synchronous interaction among pedestrians, human drivers, automated vehicles, and other traffic entities. Two use cases demonstrate the platform. In an AV-pedestrian experiment, an intent-recognition-based eHMI improved decision efficiency by 12.8% and 13.0% in yielding and non-yielding scenarios, reduced gaze distraction by 17.1% in the yielding scenario, and reduced unnecessary prompts by 40% in the non-yielding scenario while maintaining interaction safety. An HV-AV study further demonstrated real-time SIL validation of a game-theoretic information-disclosure strategy under active driver interaction. TransCAVE-E provides an extensible and reproducible infrastructure for closed-loop evaluation and iterative refinement of intelligent human-vehicle communication strategies.
Read the full abstract
Statistical Methodology
Aggregation Distortion in Multilevel Mediation: Estimand Geometry, Design Dependence, and Diagnostics
Researchers often summarize mediation in clustered data with a single-level product-of-coefficients estimator. We show what this pooled analysis estimates and why the target depends on the design. The pooled a-path is weighted by the within-between variance composition of the treatment. The pooled b-path uses a different weight, based on the mediator variance that remains after residualizing on treatment and covariates. Because these weights generally differ, the pooled indirect effect can differ from a level-respecting combination of the within- and between-level indirect effects. We derive the pooled probability limit and split this difference into a nonlinearity term and a weight-mismatch term. Equal b-paths remove the distortion, but equal a-paths do not. Allowing the two weights to vary gives a bilinear surface with saddle geometry, sharp corner bounds, and a zero-distortion frontier. We also define a design-standardized indirect effect and practical diagnostics. Simulations verify the identities and show that a common decompose-first, cluster-weighted construction can overstate apparent distortion. In an ECLS-K:2011 illustration with 8,363 children in 753 baseline schools, the within-level weights were 0.723 and 0.896, a difference of -0.173 (95% bootstrap CI [-0.193, -0.151]). The conventional construction produced 1.76 times the absolute distortion of the identity-consistent construction. The identity-consistent AD interval included zero. Thus, the application shows unequal weighting and sensitivity to construction, not evidence of nonzero population distortion.
Read the full abstract
Algebraic Geometry
Specht ideals for the imprimitive complex reflection group $G(r,1,n)$: geometric orbit types and a dominance theorem
Moustrou, Riener, and Verdure related the dominance order on partitions to Specht ideal and variety inclusion for $S_n$; we previously extended this to direct products of symmetric groups. Here we take a first step toward the imprimitive complex reflection group $G(r,1,n)=(\mathbb{Z}/r\mathbb{Z})\wr S_n$. The correct geometric invariant of a point $x\in K^n$ is a pair $(\mu,z)$: a classical partition $\mu$ on the $r$-th powers of the nonzero coordinates, together with the number $z$ of zero coordinates. We construct a $G(r,1,n)$-invariant ideal $I_{(\mu,z)}$ for each such pair, and show that a dominance order on $(\mu,z)$, with $z$ taking strict priority over $\mu$, exactly characterizes both ideal inclusion and reverse variety inclusion. We settle a monomial criterion in three regimes, recover the classical $B_n$-Specht ideal theory at $r=2$ when $z=0$, and establish radicality of $I_{(\mu,z)}$ at the two extremes of the $z=0$ level. Four computational examples, checked exhaustively for group invariance, illustrate the construction throughout.
Read the full abstract
Computation and Language
Named Entity Recognition using Sliding Window Approach
Named Entity Recognition (NER) is a core NLP task, but transformer-based sentence-level models struggle with long documents because of fixed input-length limits: truncation drops content, and non-overlapping chunking fragments entities at segment boundaries. We introduce an inference-only pipeline that extends a frozen NER model, MahaNER-BERT, fine-tuned on the MahaNER corpus, to document-level prediction via overlapping sliding windows that are merged into a single annotation, without any retraining or architectural change. We evaluate the pipeline on six document-level corpora built from the MahaNER test set using two strategies: Normal Repeat, which duplicates sentence sequences to extend length while preserving contextual continuity, and Random Repeat, which concatenates distinct sequences to produce longer, heterogeneous inputs, each instantiated at three length levels, across several sliding-window configurations. The model retains a macro F1-score of up to 0.8902, with variation staying below one percentage point regardless of document length or construction strategy. Compared with the conventional non-windowed approach, the sliding-window pipeline avoids the boundary-fragmentation errors introduced by non-overlapping segmentation, yielding consistently higher and more stable document-level F1-scores.
Read the full abstract
Performance
Rolling Round-Robin Rate: Standard Heterogeneous Throughput for SPEC CPU
SPEC CPU has long provided a common foundation for comparing processor, compiler, memory-system, and platform performance. Its multi-copy SPECrate mode measures homogeneous throughput by running many copies of the same benchmark at once. That mode remains valuable, but modern cloud and server systems commonly run heterogeneous collections of jobs whose interactions are shaped by shared caches, memory bandwidth, power management, operating-system scheduling, and noisy neighbors. SPEC CPU 2026 introduces Rolling Round-Robin Rate (RRR), an exhibition run style that uses the existing rate suites to generate deterministic heterogeneous multiprogrammed workloads. This paper describes RRR as a benchmark methodology and proposes a SPEC-like scoring model for future RRR reporting: compute per-benchmark average throughput and coefficient of variation from per-copy ratios, compute a SPEC-style geometric mean for each copy across the suite, and average that population of copy geomeans to form a suite score with its own coefficient of variation. RRR therefore preserves the familiar SPEC throughput tradition while exposing richer information about variability, interference, and heterogeneous-system behavior.
Read the full abstract
Computation and Language
Confident but Wrong: A Constrained Decoding Diagnostic for Low-Resource Automatic Post-Editing
Automatic Post-Editing (APE) for low-resource languages (LRLs) often fails to improve Machine Translation (MT), and the score alone cannot say why: whether more training would help, or whether the training data is too inconsistent to learn from. We introduce a black-box, inference-time diagnostic that tells these two cases apart without retraining or annotation. It varies an edit-distance penalty $\lambda$ that drives the model from free editing towards copying the MT, and reads two signals: (1) the shape of the Translation Edit Rate (TER)-vs-$\lambda$ curve, U-shaped if edits from the model reduce error and monotonically decreasing if none does; and (2) the ordering of constraint variants that trust model confidence to increasing degrees, which shows whether confidence tracks edit quality. Across decoder-only and encoder-decoder models on English-Sinhala, the diagnostic exposes two failure modes consistent with a heterogeneous post-edit signal as the underlying cause: Binary Collapse, where the model copies the MT or makes off-target edits, and Confident Miscalibration, where the confidence signals we test do not separate useful edits from unnecessary ones. The pattern holds on English-Marathi and English-Tamil, with the failure modes tracking the post-edit distribution rather than MT quality or language family. Beyond diagnosis, the curve shape prescribes a concrete next step for practitioners; in the favorable case, a static constraint yields a free inference-time accuracy gain. We release the first English-Sinhala (~66k) and a new English-Tamil (~39k) APE datasets with all code.
Read the full abstract
Functional Analysis
Uniform Kreiss boundedness does not imply strong Cesàro boundedness
We construct a uniformly Kreiss bounded operator on a separable Hilbert space which is not strongly Cesàro bounded. This gives a negative answer to a question of Cohen, Cuny, Eisner and Lin.
Computer Vision
ReCalMatch:Reliability-Calibrated Semantic Guidance for Semi-Supervised Fine-Grained Recognition
Semi-supervised fine-grained visual recognition is highly vulnerable to overconfident pseudo-label errors: visually similar categories frequently produce high-confidence yet incorrect predictions, and consistency regularization then reinforces these errors throughout training. Existing semi-supervised learning (SSL) methods estimate pseudo-label reliability almost entirely from the visual classifier itself—maximum probability, adaptive thresholds, or entropy—signals that remain blind to whether a predicted class is semantically compatible with the visual representation. We propose ReCalMatch, a reliability-calibrated semantic framework for semi-supervised fine-grained recognition. Rather than treating textual semantics as auxiliary supervision, ReCalMatch uses multi-aspect semantic prototypes as calibration evidence for pseudo-label learning. We construct class-conditioned semantic prototypes from class names and domain-specific semantic aspects, and measure a visual–semantic agreement score between each unlabeled embedding and its pseudo-label prototype. This agreement is combined with prediction confidence and entropy into a single reliability weight that down-weights pseudo-labels that are visually confident but semantically inconsistent. A semantic consistency term and a semantic margin regularizer further sharpen prototype separability under limited labels. Extensive experiments on CUB-200-2011, Stanford Dogs, NABirds, and iNaturalist18 show that ReCalMatch consistently improves strong SSL baselines, with the largest gains in low-label regimes where pseudo-label noise is most severe.
Read the full abstract
Combinatorics
Multiplicity bounds for nonzero upper-Laplacian eigenvalues of simplicial complexes
Let $K$ be a finite pure ridge-connected $d$-dimensional simplicial complex with at least two facets, and let $m_K(\lambda)$ denote the multiplicity of a positive eigenvalue $\lambda$ of its upper Laplacian $L_{d-1}^{\mathrm{up}}(K)$. We obtain upper bounds for $m_K(\lambda)$ in terms of the basic combinatorial parameters $f_d(K)$ and $f_{d-1}(K)$, the numbers of facets and ridges, $p_d(K)$, the number of pendant facets, and $q_d(K)$, the number of quasi-pendant ridges. The quantity $\theta_d(K)=d f_d(K)-f_{d-1}(K)+1$ arises as the cyclomatic number of a natural reduced facet–ridge incidence graph. We prove \[ m_K(\lambda)\le 2\theta_d(K)+p_d(K), \qquad m_K(\lambda)\le 2\theta_d(K)+q_d(K)\quad(\lambda\ne d). \] We also characterize the complexes for which equality is attained in these bounds. Finally, for every finite pure $d$-dimensional simplicial complex, we prove the sharp inequality $m_K(d)\ge p_d(K)-q_d(K)$, which is a higher-dimensional analogue of Faria's inequality. For $d=1$, our results reduce to the corresponding multiplicity bounds for graph Laplacians.
Read the full abstract
Analysis of PDEs
Higher regularity of regular free boundaries for the Kolmogorov obstacle problem
We establish higher regularity of the regular free boundary for non-negative solutions of the Kolmogorov obstacle problem \[ \mathcal K u=\chi_{\{u>0\}}, \qquad \mathcal K=\Delta_x+x\cdot\nabla_y-\partial_t. \] Assume that the contact set satisfies a quantitative thickness condition at a free-boundary point. We prove that, in a neighborhood of that point, the free boundary is a non-characteristic \(C_{\mathcal K}^{1,\beta}\) hypersurface for some \(\beta\in(0,1)\). Equivalently, its inward non-degenerate normal is Hölder continuous with respect to the intrinsic Kolmogorov distance, and the deviation of the graph from its tangent hyperplane is of order \(O(r^{1+\beta})\) at intrinsic scale \(r\). The proof combines the half-space blow-up and differentiability theory at regular points with boundary Harnack estimates in asymptotically cylindrical intrinsic Lipschitz domains. A principal difficulty is that the diffusion derivatives determining the normal do not satisfy the homogeneous Kolmogorov equation. We introduce a \(\mathcal K\)-harmonic-replacement argument that converts the commutator sources into an \(O(r)\) error under intrinsic blow-up and yields a contraction estimate for the oscillations of derivative quotients. This gives Hölder continuity of the non-degenerate normal. In addition, a boundary decay estimate for the transport derivative $Yu=(x\cdot\nabla_y-\partial_t)u$ provides the required improvement in the coupled time-transport direction. Combining these estimates with the available control in the degree-three variables yields a full intrinsic improvement of flatness.
Read the full abstract
General Relativity and Quantum Cosmology
A general static and spherically symmetric black hole in traceless metric-affine bumblebee gravity
We construct and analyze a general exact static and spherically symmetric black hole solution in traceless metric-affine bumblebee gravity by considering a vacuum expectation value with temporal and radial components. The temporal component remains constant and the auxiliary geometry is Ricci flat, while Lorentz symmetry breaking is transferred to the physical metric through the metric-affine deformation. After introducing the areal radius and normalizing the Killing time at spatial infinity, the geometry is controlled by a single invariant deformation parameter. The resulting spacetime is asymptotically conical, possesses a regular Killing horizon, and retains the causal structure of the Schwarzschild black hole, with a curvature singularity located at the origin. Initially, we examine its thermodynamic properties, gravitational Doppler effect, and tidal forces. Lorentz symmetry breaking modifies the Hawking temperature and the magnitude of the tidal field, although the characteristic ratio between radial stretching and transverse compression is preserved. The thermodynamic-topology analysis reveals no critical point within the admissible black hole sector. Furthermore, massless scalar perturbations are also investigated through WKB and characteristic time domain solution, showing decaying profiles throughout the sampled parameter range and deformation-dependent quasinormal frequencies. Finally, light deflection and perihelion advance are used to establish stringent Solar System bounds on the invariant deformation, which, at leading order, depends on a combination of the temporal and norm sectors of the bumblebee field.
Read the full abstract
Machine Learning
The Sequential Price of Continual Learning
Sequential task updates are fundamental to continual learning, but their recency bias can impose a lasting performance cost. We study this cost in an overparameterized linear-regression model with i.i.d. task sampling. We prove that distribution-level forgetting and population loss converge to the same stationary limit. We quantify the additional loss incurred by sequential exact fitting, or the sequential price. In more homogeneous task geometries, it equals the intrinsic loss asymptotically attained by joint training, making the total loss twice as large. We further analyze fixed-strength elastic weight consolidation (EWC) under general task curvatures and characterize its stationary sequential price at every regularization strength. Under strong regularization, the price decays inversely with EWC strength while the mean-square coupling horizon grows proportionally. Experiments on Jester and Rotated MNIST support the predicted sequential price and its reduction by EWC, with quantitative agreement on real-world tasks satisfying the theory's assumptions and qualitative agreement under nonlinear finite-step training.
Read the full abstract
Differential Geometry
Sphere Theorems for Immersed Hypersurfaces with Constant Scalar Curvature
We prove sphere theorems for closed connected immersed hypersurfaces of constant scalar curvature in Euclidean space. Combining Ros's rigidity argument with the filling theorem of Huisken and Sinestrari, we show that every two-convex such hypersurface is a round sphere. As a consequence, Yau's conjecture holds for closed connected immersed hypersurfaces in \(\mathbb R^4\). Using Gromov's filling theorem, we also obtain higher-dimensional rigidity results under a principal-curvature index condition and an explicit scalar-curvature pinching condition.
Read the full abstract
Probability
Dimer model and random lattice permutations with general weights
The dimer model and random lattice permutations are two fundamental objects at the interface of probability, combinatorics, and mathematical physics. We study these models on finite periodic boxes in $\mathbb Z^d$ within a common framework. For the dimer model, edges connecting arbitrary vertices carry a weight which depends on their relative displacement and dimer configurations are weighted through their occupied edges. Superimposing two independent perfect matchings gives the double-dimer model, whose configurations are collections of disjoint loops. Permutations, instead, are weighted through the spatial displacement of their jumps. For broad classes of weights of finite or infinite range we prove long-range order and the occurrence of macroscopic loops. This extends nearest-neighbour results to arbitrary-range edges and jumps. In particular, long-range weights yield long-range order and macroscopic loops already in dimensions $d=1,2$. In dimension two, this behaviour is qualitatively different from that of the nearest-neighbour model. We complement these results with sharp absence criteria.
Read the full abstract
Machine Learning
GBFRVFL: Granular-Ball Computing-Based Fuzzy Random Vector Functional Link Network
In practical machine learning tasks, data are often contaminated with noise, outliers, and class imbalance, which can degrade the performance of conventional models. While random vector functional link (RVFL) networks offer fast training and strong generalization, they do not explicitly handle uncertainty or exploit local data structure. To address these limitations, we propose a fuzzy granular-ball random vector functional link (GBFRVFL) framework that leverages granular-ball computing to abstract raw samples into adaptive granular balls. Within this framework, we introduce two membership assignment schemes: (i) F-GBRVFL, which incorporates fuzzy membership to quantify the reliability of each granular ball, and (ii) SDAP-GBRVFL, which we propose, incorporates a novel statistical density-adaptive pythagorean membership (SDAPM) scheme that dynamically adjusts membership and non-membership values based on class variance, local sparsity, and granular-ball compactness. These schemes enhance robustness to noise, outliers, class imbalance, and uncertainty in granular-ball distributions, while retaining the computational efficiency of RVFL networks. Extensive experiments on 37 benchmark UCI and KEEL datasets under both clean and noisy conditions demonstrate that the proposed models consistently outperform baseline models, achieving superior accuracy and stability. The results validate the effectiveness of integrating granular-ball computing with adaptive membership schemes for reliable, scalable, and noise-tolerant learning.
Read the full abstract
Robotics
Do World Models Make Better Robots? A Survey of Evaluation Benchmarks for Predictive Embodied Intelligence
Robot learning now advances along two tracks that rarely meet. On one side, direct Vision-Language-Action (VLA) policies map observations to actions and are scored by closed-loop task success. On the other, predictive and generative world models forecast future observations and are scored by open-loop prediction or generation quality. A natural question sits between them: does world modelling earn a measurable, closed-loop advantage over a direct policy, and for which robotic capabilities? We argue that the field cannot yet answer this question, and that the reason is a gap in how it is measured, not in the models themselves. World-model benchmarks score prediction without ever executing it, while task-success suites host a single policy and never build a world-model versus VLA contrast. This survey maps the evaluation landscape around that gap. We catalogue 160 web-verified benchmarks spanning 2017 to 2026 and organise them by evaluation mode, robotic capability, and model family into four lanes: policy suites, embodied agents, world model evaluation, and prediction-to-action bridges. Across the corpus, 138 of 160 benchmarks are model-agnostic and only 11 (7%) build an explicit VLA-versus-world-model contrast; counterfactual capability is almost entirely unmeasured, and only four benchmarks turn prediction into executed action. We contribute an operational taxonomy, a coverage comparison against the eight closest surveys (ours is the only one to cross capability with model family), an evaluation loop that isolates the advantage of prediction, and an actionable protocol of four advantage-aware metrics anchored on named testbeds. The organising claim is not that world models help or do not help, but that answering the question requires benchmarks built to ask it.
Read the full abstract
Machine Learning
Graph, Loop, and Harness Engineering for Zero-Trust Agentic Data Engineering and Analytical Processing
Large language model agents increasingly automate data workflows, but end-to-end cloud data engineering and analytical execution require reliable coordination across code, data, infrastructure, and runtime environments. We present two zero-trust frameworks. Zero-Trust Agentic Data Engineering generates, deploys, and verifies complete cloud data-engineering solutions from natural-language tasks, with completion conditioned on repository, deployment, runtime, and policy evidence. Zero-Trust Agentic OLAP combines governed Data Preparation with verified Online Analytical Processing (OLAP), permitting production promotion only after validation and evidence-bound approval, and releasing analytical answers only after Same-Snapshot Execution, Exact Result Equivalence, deterministic grounding, and reflection. Both frameworks share three abstractions: graph engineering for evidence-gated workflow structure, loop engineering for bounded recovery, and agent-harness engineering for zero-trust execution. We evaluate both frameworks under nominal execution, controlled failures, bounded recovery, and policy-constrained conditions, measuring verified completion, recovery, authorization enforcement, production promotion, and verified OLAP execution.