Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Plasma Physics

Modeling of plasma transport during edge-localized mode in tokamak using a kinetic Vlasov-Poisson code

A kinetic parallel transport code KOBRA based on a finite-volume method is developed to study edge localized mode (ELM) plasma transport from the mid-plane to divertor targets. The large scale separation between the Debye length (~cm) and the connection length (~10-20 m) leads to prohibitive computational cost in full 6D simulations. To alleviate this, an adaptive-mesh refinement (AMR) strategy is employed. Comparisons with uniform-grid simulations show that AMR accurately reproduces the characteristic ELM dynamics, including the rapid rise and slow decay of divertor fluxes, as well as the early-time peak induced by fast electrons. Analysis of the electron distribution and self-consistent electric field reveals that AMR efficiency is closely linked to phase-space evolution. Overall, AMR achieves comparable physical accuracy while reducing memory usage by 30-40% and accelerating computations by up to a factor of two, demonstrating its effectiveness for high-dimensional kinetic ELM simulations.
Read the full abstract

Differential Geometry

Non-strict negativity of holomorphic bisectional curvature for compact relative Kähler fibrations

Strict negativity of holomorphic bisectional curvature need not pass from the base and fibers of a compact holomorphic fibration to its total space, even when the Kodaira-Spencer map is everywhere injective. We construct a compact relative Kähler fibration over a genus-two curve, with a smooth projective threefold as total space and an everywhere injective Kodaira–Spencer map, whose induced fiber metrics have strictly negative holomorphic bisectional curvature, whereas the total space admits no Kähler metric with this curvature property. This gives a negative answer to an open problem posed by To and Yeung. We also construct compact, effectively parametrized Monge-Ampère fibrations from universal quaternionic abelian surfaces over Shimura curves. For products of these families, the generalized Weil-Petersson metric has nonpositive holomorphic bisectional curvature and strictly negative holomorphic sectional curvature, but its mixed bisectional curvatures vanish. Thus strict bisectional negativity can fail both for the existence of a metric on the total space and for the natural metric on the parameter space, despite effective variation at every point.
Read the full abstract

Quantum Physics

Entanglement Meets Reality: A Network Engineering Assessment and Forecast of Rackable Entanglement Sources

Quantum networks are transitioning from labo- ratory experiments to real-world deployments, with entangle- ment as their fundamental resource. Since an entanglement source effectively defines a quantum network, its performance directly impacts the reliability, scalability, and efficiency of future quantum communications. In this work, we investigate rack-mountable plug-and-play entangled-photon sources from a network engineering perspective, shifting the focus from device characterization to deployment-oriented performance evaluation. Building upon an extensive experimental campaign, we assess commercially deployable hardware across multiple operating conditions, evaluate current state-of-the-art capabilities, and pro- vide an outlook on future generations of entanglement sources. We identify and evaluate two key performance indicators (KPIs): multi-photon generation, capturing deviations from ideal single- pair emission, and entanglement quality, quantified through the reconstructed two-qubit density matrix. By combining the measured detected-pair rate with the one-way hashing bound derived from each density matrix, we estimate a lower bound on the achievable distillable-entanglement generation rate, providing a compact metric that captures the trade-off between pair throughput and entanglement quality. Finally, we translate these experimental results into lower bounds on the quantum-memory coherence time required for entanglement distillation, directly linking optical source performance to the hardware requirements of future quantum repeater nodes.
Read the full abstract

All authors Laura d'Avossa, Daniela Salvoni, Angela Sara Cacciapuoti, Marcello Caleffi

High Energy Physics (Phenomenology)

Connecting Vector-like Muons, pNGB Dark Matter and Electroweak Phase Transition through Collider and Gravitational Wave

We study an extension of the Standard Model with two complex scalar singlets, $S_2$ and $S_3$, charged under $\mathbb{Z}_2$ and $\mathbb{Z}_3$, respectively, and a muon-philic vector-like lepton $\psi$ carrying the same $\mathbb{Z}_3$ charge as $S_3$. The pseudoscalar associated with the $\mathbb{Z}_2$ sector remains stable due to the CP symmetry of the potential and serves as the dark matter (DM) candidate, with its mass generated through the corresponding soft breaking of the global $U(1)$ symmetry. The vector-like muon couples to the $\mathbb{Z}_3$ scalar and renders the second pseudoscalar unstable, thereby realizing an effectively single-component pNGB DM scenario. The pNGB nature strongly suppresses the tree-level spin-independent direct-detection cross section, while viable parameter regions reproduce the observed relic abundance and satisfy LHC monojet constraints. We further compute the one-loop contribution to DM-nucleon scattering and find that the resulting cross section remains below current experimental limits while being potentially accessible to future direct-detection experiments. At a multi-TeV muon collider, scalar mediated $ t$-channel processes can significantly enhance vector-like-muon pair production. We perform a detailed multivariate analysis for a future muon collider at 3 TeV center-of-mass energy. We also identify viable benchmark points exhibiting strong first-order electroweak phase transitions (SFOEWPT) with successful bubble nucleation, which can generate potentially observable stochastic gravitational wave (GW) signals. These results highlight the complementarity of dark matter searches, muon-collider probes, and SFOEWPT, with the resulting GW signals providing an additional probe of the extended scalar sector.
Read the full abstract

Formal Languages and Automata

Beyond the Turing threshold: Productive grammars generate essentially undecidable languages

Emil Post's productive sets are not even semi-computable, let alone computable, being thus essentially incomputable. Accordingly, formal languages whose set of words is a (completely) productive set are essentially undecidable. In this article, I elaborate on Post productivity from the viewpoint of formal language theory: I design formal grammars that emulate the construction of productive sets of natural numbers and are thus beyond Turing-decidability.
Read the full abstract

General Topology

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.
Read the full abstract

All authors Oleksiy Dovgoshey, Navjay Singh Jaiswal, Surinder Pal Singh Kainth, Gursimar Kaur, Olga Rovenska

Atomic Physics

Delay-engineered dynamical phases in a programmable non-Markovian spin oscillator

Non-Markovian dynamics offer a new route towards engineering non-equilibrium matter, where memory and feedback act as programmable resources for controlling order in time. Here we report the realization of a non-Markovian spin oscillator in a hot vapour $^{129}$Xe-Cs co-magnetometer with programmable feedback delay and gain. By tuning these parameters, we observe a hierarchy of dynamical phases, including time-crystalline response, nonlinear bifurcations, and frequency-comb formation. The measured spectra and phase boundaries are captured by linear stability analysis of delayed Bloch equations, revealing these phenomena as different manifestations of the same memory-induced instability structure. These results establish time-delayed feedback as a powerful strategy for controlling non-equilibrium phases, enabling quantum sensing, frequency referencing, and synchronization within a single spin-based platform.
Read the full abstract

All authors L. M. Ellis, L. M. Rushton, J. D. Zipfel, P. Bevington, M. Jayaseelan, W. Chalupczak, V. Guarrera

Robotics

SwarmNxt: Open-source Software-Hardware Platform for Fast and Agile Aerial Swarms

Aerial robot swarms have the potential to transform time-critical safety, security, and search-and-rescue operations. By coordinating multiple robots, they can rapidly survey disaster sites, map collapsed or GPS-denied environments, and search cluttered areas faster than a single robot, reducing response times and minimizing risks to first responders. Realizing this potential, however, requires robust autonomous swarm navigation, which remains an active research challenge. Progress is further constrained by existing platforms, as commercial drones are often closed-source or lack the onboard computational resources needed for agile, vision-based collective flight. Moreover, developing, deploying, and maintaining software across multiple aerial robots requires significant engineering effort. To address these challenges, we present SwarmNxt, an open-source software platform built on the open-source OmniNxt drone hardware. SwarmNxt provides an end-to-end toolkit, including detailed hardware assembly instructions with a video tutorial, automation tools for parallel software deployment and swarm-wide updates, and a ROS 2-based framework for autonomous navigation. The platform integrates state-of-the-art control, planning, and depth estimation into a single ROS 2 multi-agent system, providing an open research infrastructure for physical swarm experimentation. We validate SwarmNxt through two real-world experiments: a six-drone swarm performing decentralized planning with high-speed inter-drone collision avoidance, and a four-drone swarm executing collective flight with onboard depth estimation in an obstacle-filled environment. Both experiments were run indoors with global position from external motion capture; perception, planning, and control run onboard.
Read the full abstract

All authors Charbel Toumieh, Niel Mistry, Benjamin Jarvis, Simon Jeger, Peize Liu, Shaojie Shen, Dario Floreano

Software Engineering

Agent-Integrated Software: Interaction Contracts and Continuous Assurance

Embedding an intelligent agent in an existing application creates a persistent coordination problem: users can revise goals and manipulate shared objects while delegated execution continues. We argue that dependable integration requires an explicit correspondence between task-level interaction and application behavior. We introduce Agent-Integrated Software (AIS) as a software pattern combining a conventional core, direct interaction, and a built-in agent, and Intent-Level Interaction Abstraction (IIA) as the task semantics through which users inspect and control delegated work. An open transition-system model relates AIS execution to IIA states and events. Interaction contracts constrain this relation through task bindings, role-specific authority, control transitions, and outcome evidence; continuous assurance maintains scoped claims as their dependencies change. A compact disclosure contract and conditional propositions illustrate why local component validity is insufficient and how selected admission invariants can be separated from planning. Contrasting software domains expose the framework's assumptions and limits. This perspective develops a research agenda spanning application abstraction, development support, controlled execution, quality assessment, and human supervision, with the aim of making agent integration a maintainable software engineering discipline.
Read the full abstract

Computer Vision

DINO-Med: A Unified Patch-Based Adaptation Framework for Multi-Modal Medical Image Analysis Applied to Liver Fibrosis Staging

Adapting natural-image foundation models like DINOv3 to multi-modal medical imaging is challenging due to the significant domain gap between natural color images and multi-channel medical scans. We present a unified, patch-based framework that processes raw multimodal imaging through training-free registration, automated localization, and mask-filtered patch extraction. This architecture culminates in a hierarchical strategy that aggregates patch-level insights into subject-level diagnostics. Using liver fibrosis staging as a case study, we evaluate four patch-level feature representations: handcrafted Radiomics features, learned ResNet features, pre-trained foundation model SAM-Med2D features, and frozen DINOv3 features. To ensure a controlled comparison, all models utilize the same lightweight MLP head and are evaluated across both rigid and deformable registration settings. Our training protocol focuses on mild fibrosis (S1) and cirrhosis (S4) classes only, enabling a single classifier to address both substantial fibrosis detection and cirrhosis staging. Evaluated via 10 random train (90%)/ test (10%) splits on 360 subjects from the CARE 2025 Liver Track 4 cohort, our DINOv3-based framework significantly outperforms all baselines, achieving the best classification accuracy of 78.4% for S1 and 75.8% for S4.
Read the full abstract

All authors Boya Wang, Ruizhe Li, Chao Chen, Xin Chen

Functional Analysis

A note on the stability of Arens products under small perturbations of multiplication

In this short note, we study the small perturbations of multiplication structure of a Banach algebra $\mathcal A$, and its impact on the two Arens products on the bidual $\mathcal A^{**}$. We show that the property of being \say{Arens irregular} is stable under sufficiently small perturbation in the multiplication structure of a Banach algebra. Further we show that for any Banach function algebra which is equivalent to a uniform algebra, the Arens regularity is stable under small perturbation on the multiplication structure of the original Banach function algebra.
Read the full abstract

Computer Vision

Brain-PACE: A Deep Siamese MRI Framework for Modelling Longitudinal Brain Acceleration

Brain age estimation has become a popular research proxy for assessing brain health and disease, yet longitudinal trajectories of brain ageing are still poorly defined, and clinical use is limited. Building on existing Siamese longitudinal frameworks, we develop Brain-Predicted Age Acceleration (Brain-PACE) to directly estimate the pace of structural brain ageing from paired T1-weighted MRI. Brain-PACE identified accelerated ageing in $42.6$% of participants with mild cognitive impairment. Faster Brain-PACE was associated with greater functional and cognitive impairment (FAQ; $r=0.35$, ADAS13; $r=0.30$, CDR-SB; $r=0.32$) and greater regional tau burden in the posterior cingulate ($r=0.59$), precuneus ($r=0.47$), and entorhinal cortex ($r=0.37$). These associations were stronger than those observed when pace was calculated indirectly from repeated cross-sectional brain age estimates, suggesting that direct longitudinal modelling captures complementary information relevant to ongoing pathological change. Methodologically, Brain-PACE extends the LILAC framework by combining spatial attention with soft label distribution learning and a Cramér distance objective, improving probabilistic performance and reducing prediction bias while providing measures of predictive uncertainty. Together, these findings support Brain-PACE as a complementary longitudinal imaging phenotype with sensitivity to relevant clinical and biological changes in early neurodegeneration.
Read the full abstract

All authors Samuel Maddox, Jacob Newman, Saber Sami, Michal Mackiewicz, for the Alzheimer's Disease Neuroimaging Initiative, the Australian Imaging Biomarkers, Lifestyle flagship study of ageing

Algebraic Geometry

Generic vanishing conjecture for divisors

Generic vanishing conjecture proposed by Pareschi and Popa is about the relationship between the existence of subvarieties of codimension $>1$ of principally polarized abelian varieties representing minimal cohomology class and the positivity of their ideal sheaves twisted by the principal polarization. Inspired by their formulation, we prove a codimension $1$ analog of generic vanishing conjecture.
Read the full abstract

Numerical Analysis

Deep operator learning for efficient sampling from invariant measures of stochastic differential equations

We introduce an amortized neural sampler that combines operator learning with flow methods for sampling. It maps SDE coefficient functions to pushforwards from a reference measure to the invariant measures, enabling efficient sampling across families of stochastic differential equations. Our framework shifts traditional sampling cost to an initial training phase, after which new SDE instances require only one encoder pass and a few ODE solver steps, independent of mixing time. To handle problems in high dimensions, we use Lagrangian trajectory sensors for the coefficient functions and cross attention in the architecture. We also theoretically establish the expressivity and resolution invariance of our framework. Experiments on 1D and 2D SDE families show competitive accuracy with substantial speedups over MCMC in regimes with slow mixing, transfer across sensor counts, and demonstration results on a 64D interacting particle SDE where traditional grid approaches are infeasible.
Read the full abstract

Computer Vision

Vision Transformer-Based Multi-Level Feature Fusion for Multi-Label Sewer Defect Classification

Automated classification of sewer defects is essential for infrastructure condition assessment and maintenance decision-making, but existing deep learning methods struggle to balance classification accuracy and computational complexity in large-scale multi-label scenarios. This study develops Sewer-Transformer-ML, a hierarchical vision Transformer with multi-level feature fusion, together with two lightweight architectures, Sewer-MobileNet-ML and Sewer-Mobile-TransNet, for resource-constrained inspection scenarios. On the Sewer-ML test set, Sewer-Transformer-ML-Base achieved an $F2_{\text{CIW}}$ of 65.68% and an $F1_{\text{Normal}}$ of 92.68%, ranking first on the public leaderboard and exceeding the second-ranked method by 7.6 percentage points in $F2_{\text{CIW}}$. Sewer-MobileNet-ML achieved an $F2_{\text{CIW}}$ of 65.73% with only 17 M parameters, representing an approximately 95% parameter reduction relative to the base model. Under the standard Sewer-Capsule data split, Sewer-Mobile-TransNet achieved 96.43% classification accuracy. When the training set was reduced to 1,177 images, pretraining on Sewer-ML consistently improved model performance. Ablation experiments further showed that direct concatenation was more effective for Transformer features, whereas attention-based fusion better supported multiscale CNN features. These findings provide a computational basis for automated sewer inspection, lightweight model design, and adaptation across civil infrastructure inspection platforms.
Read the full abstract

All authors Xu Fang, Zhuoran Wang, Qing Li, Shengyu Zhang, Guanzhi Deng, Jianbiao He, Qingquan Li

Theoretical Economics

Social Preferences and Cooperation: Beliefs, Robustness, and the Limits of Altruism

We study a mechanism of cooperation in the Prisoner's Dilemma (PD). Incorporating social preferences as efficiency concerns into the PD game, we study how altruism translates into cooperation. Under complete information, cooperation requires the opponent's altruism to clear a threshold. We then introduce a subjective extension of Bayesian Nash equilibrium that relaxes the Common Prior Assumption, letting players hold heterogeneous, potentially misspecified beliefs about each other's altruistic type. Cooperation then depends on beliefs about altruism rather than altruism itself, and can be sustained even when opponents are, on average, only weakly altruistic. When fear of exploitation dominates the temptation to defect, beliefs about the opponent's cooperation become strategic complements, so a cooperative and an uncooperative equilibrium can coexist under identical payoffs and an identical, correctly specified prior. Using multiplier preferences, we then study how robust this belief-driven cooperation is to model misspecification. Cooperation is fragile: it survives only above a threshold level of confidence in one's own belief, and can unravel even when the belief itself correctly supports cooperation. As a formal extension, the same robust-control apparatus, applied to a player's action choice, nests Nash equilibrium, Bayesian Nash equilibrium, and logit Quantal Response Equilibrium as limiting cases. Cooperation depends less on how altruistic agents are than on what they believe about each other, and how confident they are that this belief is right.
Read the full abstract

Computers and Society

Characterizing Bluesky Content Moderation Service: From Automation of Service to Landscape of Harms

Empirical research on content moderation is fundamentally constrained by the opaque deployment of moderation systems on major social media platforms. To this end, the recent emergence of decentralized platforms with transparent, public moderation logs presents an unprecedented opportunity for independent audits. In this work, we leverage this architectural transparency to conduct the first large-scale audit of the default moderation system on Bluesky, the Bluesky Moderation Service (BMS). Analyzing its 10.6M moderation labels from 2025, we investigate three foundational aspects: (i) its mechanism (the degree of automation versus human oversight), (ii) its efficacy (accuracy in detecting harms), and (iii) its purpose (the landscape of harms it identifies). Our findings reveal a human-AI collaborative system where labels for sexual and graphic content are applied automatically in seconds, while nuanced and high stakes labels require more human oversight, taking hours or days. Through a manual annotation study, we find the BMS operates with high precision (0.837), but struggles with low recall (0.222), with our annotators identifying 4.5$\times$ more harmful content than the moderation system in a random sample. Finally, unsupervised clustering of the most frequently applied labeled posts uncovers detected harms ranging from hostility in discourse toward protected groups to the spread of sexually explicit and other graphic content. Our work offers a look into the operational realities of a deployed moderation system, providing a concrete data-driven foundation for designing more effective and transparent moderation systems.
Read the full abstract

All authors Pushpdeep Singh, Sayeh Jarollahi, Ayan Majumdar, Vabuk Pahari, Abhijnan Chakraborty, Krishna P. Gummadi, Ingmar Weber, Abhisek Dash

Artificial Intelligence

RAMamba-Net: A Reliability-Aware and Mamba-Based Multimodal Fusion Network for Auditory Attention Detection

Auditory attention decoding (AAD) identifies the attended speaker from physiological signals, supporting neuro-steered hearing devices and natural human-machine interaction. Electroencephalography (EEG) is the dominant modality for AAD but provides incomplete evidence in naturalistic audio-visual scenes, motivating EEG and electrooculography (EOG) fusion. Existing approaches remain limited by weak cross-modal interaction, inefficient temporal modeling, and low robustness to sample variations. To address the limitations, we propose RAMamba-Net, a reliability-aware Mamba-based multimodal fusion network for AAD. RAMamba-Net employs a Mamba-enhanced band-aware convolutional Transformer to capture band-specific EEG patterns and long-range temporal dynamics. A dual-branch temporal-spatial encoder models EOG temporal and inter-channel dependencies. Cross-modal attention enables explicit modality interaction. Then, a reliability-aware module is introduced to estimate sample-wise modality weights for feature and prediction consistency, thereby enhancing multimodal fusion. Experiments on two AAD benchmarks demonstrate that RAMamba-Net effectively exploits complementary EEG-EOG information, yielding accuracy gains of 5.76% over unimodal baselines, together with more robust decoding and discriminative representations. Further analyses show that explicit cross-modal interaction improves multimodal alignment, while the reliability-aware module suppresses unreliable modality evidence and is robust to signal perturbation and parameter variation.
Read the full abstract

Analysis of PDEs

Emergence of a convex strange term via homogenization of non-local energies at the critical exponent

We derive the $\Gamma$-limit of convolution-type and discrete energies subject to Dirichlet boundary conditions on periodically perforated domains at the critical exponent. We assume that the length-scale of the non-local interactions is much smaller than the side-length of the cubic perforations and prove that a separation of scales occurs. Exploiting the analogies between the variational frameworks of our interest, we employ a unified argument to overcome the technical difficulties that arise from the scaling invariance of the energies. Our multiscale analysis yields a novel observation that is not related to the non-local nature of the functionals, but rather to the analysis at the critical exponent: we prove that the energy density of the $\textit{strange term}$ is convex, even in the vector-valued setting.
Read the full abstract

General Mathematics

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.
Read the full abstract

Numerical Analysis

The tubal Arnoldi method for tensor function approximation

This paper describes Krylov subspace methods based on the tensor t-product for approximating quantities associated with third-order tensor functions. Specifically, it introduces the tensor-tubal Arnoldi method, which projects highdimensional tensor problems onto lower-dimensional tensor Krylov subspaces. The derived method exploits novel algebraic properties of the t-product to address large-scale tensor computations efficiently. Applications include the evaluation of parameter-dependent tensor functions and the solution of multidimensional ordinary differential equations. Numerical experiments illustrate the effectiveness and accuracy of the proposed methods compared with other approaches.
Read the full abstract

Information Theory

A Tight Second-Order Converse Bound for Variable-Length Feedback Codes

We study variable-length feedback (VLF) codes over a discrete memoryless channel under average decoding-time and error-probability constraints. In the non-vanishing error probability regime, Polyanskiy, Poor, and Verdú (2011) derive achievability and converse bounds on the logarithm of the maximum achievable codebook size. These bounds establish the $\epsilon$-capacity but leave an order-$\log N$ gap in the second-order expansion, where $N$ is the average decoding time. Yavas and Tan (2025) improve the coefficient of $\log N$ in the achievability bound from $-1$ to $-\frac{C}{C_1}$, where $C$ is the channel capacity and $C_1$ is the largest Kullback–Leibler divergence between two conditional output distributions. We derive a converse with the same coefficient, establishing the second-order fundamental limit for every positive-capacity discrete memoryless channel with finite $C_1$. The result also covers the moderate-deviations and error-exponent regimes, including polynomially decaying error probabilities. The converse uses Rényi entropy and the extrinsic Jensen–Shannon divergence. We also derive necessary properties of asymptotically optimal VLF codes. First-order-optimal codes must have an early-stopping branch, and second-order-optimal codes must additionally exhibit communication and confirmation behavior. Finally, for the binary erasure channel, we determine the exact minimum expected decoding time for every message-set size and admissible error probability.
Read the full abstract

Statistical Mechanics

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.
Read the full abstract

All authors Gianmarco Spera, Axel Fotso Ndefo, Keaton J. Burns, Alexander Mietke

Machine Learning

Local Robustness Quantification for Naive Bayes Classifiers and Generative Forests: a General Approach

We provide methods for calculating the robustness of the predictions of two types of generative classifiers whose underlying distribution is a Probabilistic Graphical Model (PGM): naive Bayes classifiers and generative forests (a probabilistic extension of random forests). Following the paradigm of robustness quantification, we define the robustness of a prediction as the extent to which the distribution of the classifier can be perturbed without changing this prediction. We consider perturbations obtained by varying the local models of the PGMs within general neighborhoods and focus in particular on epsilon-contamination, total variation distance and chi-squared divergence balls. We test our methods on benchmark datasets, demonstrate that the robustness value of a prediction serves as an indicator for its trustworthiness and compare our approach with other such indicators.
Read the full abstract

Artificial Intelligence

Portable Semantics, Private Dialects: Reuse and Negative Transfer in Latent Communication Between Language-Model Cells

In shared-genome language-model societies, restricted evidence visibility favors reusable, value-indexed latent packet interfaces, whereas the sole high-performing globally visible model in the parent study learned an episode-entangled code. This companion study asks whether independently trained societies share one packet language, where strict zero-shot transfer fails, and whether inherited interface state helps or harms later learning. First, a leakage-controlled causal interoperability audit over all 30 ordered pairs of six independently trained restricted societies – under sealed held-out structure and a preregistered raw/orthogonal/linear/nonlinear alignment ladder – shows the six semantically similar interfaces do not form one raw language: one same-initialization pair is exactly interoperable in both directions, a second shows asymmetric partial compatibility, and all 26 cross-initialization directions fail every frozen alignment rung. Second, within the tested decomposition and a single sealed source formulation, a source-span control localizes strict zero-shot failure to interpretation and execution of the new operator instructions. Third, in a matched adaptation factorial, the globally trained communication interface acts as a severe negative-transfer prior: reinitializing only the packet reader, writer, and mouth raises final depth-three accuracy from 0.169 to 0.857. Fourth, across two restricted checkpoints and two independently frozen target streams each, inherited interfaces never exceeded fresh-interface controls by the preregistered 0.10 margin. All primary conclusions are bounded to a near-transfer 17-state setting; the negative-transfer factorial concerns one globally visible parent-cohort checkpoint, while an appendix adds a post hoc tagged-global twin case study.
Read the full abstract

High Energy Physics (Theory)

Massless contraction of massive particles in the infinite boost limit

Massless particles, defined through Wigner's induced representations of the Poincaré group, are obtained as a limit of infinitely boosted massive particles wherein the massive little group undergoes an Inönü–Wigner contraction to the massless one. It is demonstrated that the spin-$s$ multiplet of a massive representation re-organizes into the direct sum of massless particles with helicities in the range $[-s,s]$. This group theoretic result is the Hilbert space counterpart of the Stückelberg formulation of massive fields of spin $s$ in the high-energy limit, where the Stückelberg fields become independent massless fields of spins $s'\leq s$ in integer steps. It therefore also provides the kinematic setting of the Goldstone equivalence theorem.
Read the full abstract

Numerical Analysis

Scalable Approximate Selected Inversion Based on Single-Level Incomplete $LDL^T$ Factorization and Spectral Corrections for Large Sparse Systems

This article introduces four parallel numerical techniques for computing entries of the inverse of large sparse symmetric systems, all grounded in incomplete $LDL^T$ (ILDL) factorizations: (1) the selected inversion method (SelInv), which applies the $LDL^T$ factorization to recover entries of the matrix inverse within the sparsity pattern of the computed factors; (2) an approximate inversion method based on a truncated Neumann series expansion applied to the inverse of the L factor (NInv), providing an alternative at the cost of reduced accuracy; (3) a Mix approximation that merges the best of both SelInv and NInv; and (4) Mix-SPAI, which applies sparse approximate inverse (SPAI) refinement on the output of the Mix method to improve entry-level accuracy. To further improve accuracy while maintaining a stable sparsity pattern, we additionally employ a low-rank correction based on eigenvector updates, providing an alternative to tightening the drop tolerance. We report the performance of the proposed numerical techniques on a comprehensive collection of sparse matrices from scientific and industrial applications.
Read the full abstract

Information Theory

Maximal Kolmogorov Complexity in a Hamming Ball

The minimal Kolmogorov complexity of a string within Hamming distance r of a given string x is the algorithmic rate-distortion function of x, and Vereshchagin and Vitanyi characterized completely which shapes it can have. This paper is about the opposite extreme. For a binary string x of length n let g_x(r) denote the maximal Kolmogorov complexity of a string within Hamming distance r of x; we study which values, and more generally which functions of r, this quantity can attain. First we characterize, up to an additive error O(log n), the possible values of the triple (C(x),r,g_x(r)): writing r_k for the radius of a Hamming ball of cardinality about 2^k, a triple (k,r,l) is realizable if and only if log V(r_k + r) < l < min{n, k+log V(r)}, where V(a) is the cardinality of a ball of radius a. In particular, for r_k+r > n/2 both bounds collapse to n and only l = n is realizable. The two ends of this interval correspond to the two extreme ways of placing a set of complexity k in the cube: a single Hamming ball, where the lower bound comes from Harper's isoperimetric inequality, and an error-correcting code, which for the intermediate parameters we relax to a family of centers with bounded covering multiplicity, in the spirit of list decoding. Then we turn to the function r -> g_x(r) as a whole: we establish four properties that it always has, and show that the minimal and the maximal functions consistent with these properties are both attained, for every complexity level k. Which intermediate profiles are attainable remains open.
Read the full abstract

Robotics

GeoTrussRover: Morphological Computation with Contact-Semantic Control Primitives

Reconfigurable robots can change their contact geometry when a fixed body cannot negotiate an obstacle. A variable-geometry truss (VGT) distributes this shape change through a load-bearing structure, but coupling it to a mobile base creates a high-dimensional coordination problem. GeoTrussRover combines an electrically actuated VGT, a wheeled base, and contact-semantic morphology planning and control. We solve one source traversal and extract four contact-semantic primitives that describe coordination among 21 members. Physics-constrained projection adapts them to unseen step heights with the same contact topology. When every phase remains feasible, adaptation does not recompute the complete motion. If one phase violates the new physical constraints, only that phase is recomputed. A full-space QP then tracks the adapted motion and corrects member and wheel errors. For transfer from 0.10m to 0.075m, the method reduces objective-function evaluations by 63.7% relative to full recomputation. Contact-phase feasibility analysis covers step heights from 0.10 to 0.46m, or 1.08 to 4.97 wheel radii, with the upper value near the theoretical feasible boundary. The electric prototype traverses 2.11 wheel radii. The resulting low-dimensional representation stores task coordination in a hyper-redundant, load-bearing morphology and reuses it during locomotion.
Read the full abstract

All authors Muyuan Ma, Yi Zhang, Yang Yang, Xuanyan Zheng, Ruiqi Hu, Boxuan Ke, Zhenyu Chen, Yicong Lin, Xin Hao Yang, Daliang Xiao, Zhinan Hou, Wanhao Niu, Yuan Sun, Yan Yang, Yue Xie

Computer Vision

R4Tun: LLM-guided adaptive segmental tunnel lining segmentation in point clouds

Automated inspection of segmental tunnel linings requires adaptive segmentation from 3D point clouds, yet expert-tuned pipelines often degrade when tunnel conditions vary. This paper presents R4Tun, a large language model (LLM)-driven adaptation framework that extends an expert-designed pipeline (SAM4Tun) with bounded parameter tuning informed by structured context: memory ($m$), state ($s$), and knowledge ($k$). Evaluated on 30 selected Seg2Tunnel subsets (13 regular, 17 complex) across three LLMs, the full $m+s+k$ design raised mean Intersection-over-Union (mIoU) from 0.18 to 0.43–0.48 and overall accuracy (OA) from 0.42 to 0.59–0.65 relative to the static SAM4Tun baseline, with the near-reference regular (staggered) subsets reaching mIoU 0.784–0.796 across LLMs. Across 270 (30 tunnels $\times$ 3 different LLMs $\times$ 3 context settings) runs, the LLMs showed similar parameter-adjustment trends (with overlapping 95% CIs on mean gains) and consistently adjusted a shared set of critical parameters. These results support R4Tun as a controlled, label-free, cross-LLM adaptation mechanism in the tested SAM4Tun–Seg2Tunnel setting, demonstrating consistent accuracy gains; we position R4Tun as a mechanism contribution rather than a deployable final-inspection system, in which each bounded parameter change is auditable via logged rationales.
Read the full abstract

All authors Xinghui Tao, Zehao Ye, Guangming Wang, Jelena Ninić, Brian Sheil