Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Saturday 12 September

Computational Physics

Digital quantum lattice Boltzmann evolution by reversible compute and open-system reset

Turbulent fluid simulation is computationally demanding because nonlinear interactions couple a wide range of scales. Quantum computing offers another computational model, but fluid evolution is nonlinear and dissipative whereas closed gate-based dynamics is linear and reversible. The lattice Boltzmann method (LBM) is an attractive discrete target because streaming is a local permutation, yet conventional collision reconstructs a nonlinear equilibrium and applies dissipative relaxation. We present a digital quantum lattice Boltzmann (QLBM) algorithm that keeps that nonlinear timestep in computational-basis registers. Each step writes the updated populations into a clean destination bank, uncomputes the workspace, and resets the obsolete source. The resulting channel is completely positive and trace preserving (CPTP), composes without intermediate measurement, and applies to any lattice Boltzmann stencil that can be evaluated reversibly into a clean bank. Forced D3Q19 homogeneous isotropic turbulence, in direct numerical simulation (DNS) and Smagorinsky large-eddy simulation (LES) at Reynolds number 15000 over one million lattice steps, shows statistical agreement in mass, energy budgets, spectra, and intermittency. The three-dimensional calculations use a digital-register emulator of the circuit. A separate D2Q9 implementation compiles the same contract to reversible gates and agrees bit-exactly with its integer twin. Two-bank storage and serial lattice depth limit near-term feasibility.
Read the full abstract

Differential Geometry

Analytic Torsion for Symmetric Contact Manifolds

We review the definitions of the Rumin complex and analytic contact torsion for contact manifolds. We then compute the contact torsion for symmetric contact manifolds. To this end, we use a representation-theoretic description of the relevant operators and spaces of differential forms. Our computation of the contact torsion for symmetric contact manifolds relies on a recent result by Rumin that reduces the problem to harmonic forms. Following a construction by Boothby and Wang, the contact manifolds under consideration are total spaces of $S^1$-principal bundles over Kähler manifolds. This allows us to interpret the harmonic forms as Dolbeault cohomology with coefficients in a certain holomorphic line bundle of the base Kähler manifold, thereby simplifying the computation by allowing us to use results from complex geometry. Furthermore, we generalise Rumin's result to the equivariant case and, using the previous considerations, determine the equivariant contact torsion for the case of isolated fixed points.
Read the full abstract

Optics

Vortex solitons in star networks

I consider vortex solitons in two-dimensional star networks created by several one-dimensional line waveguide arrays (or rays) brought in close proximity. First waveguide in each array belongs to the ring of certain radius and its modal field overlaps with modal fields of waveguides from other rays laying on this ring, as well as with modal fields of waveguides in this line array. This creates a system with discrete rotational symmetry that is capable of supporting various localized linear vortex states due to local coupling between waveguides on the central ring, where line arrays approach each other. Localized vortex states emerge from the continuum of the states extended along the rays of the structure upon variation of the radius of the central ring. I show how different vortex modes with progressively increasing topological charges emerge when the number of rays in structure and, therefore, its discrete rotational symmetry increases. Each such linear localized mode gives rise to a family of thresholdless vortex solitons in nonlinear optical medium, whose topological charges are limited by the discrete rotational symmetry of the system. Vortex solitons in star networks exhibit qualitatively different behavior with increasing power depending on whether the propagation constant of linear vortex that gives rise to a family of solitons is located above or below the band of extended states. Stability properties of vortex solitons nontrivially depend on their topological charge and discrete rotational symmetry of the system, showing very different picture from usual ring-like waveguide arrays.
Read the full abstract

Rings and Algebras

On flat pseudo-Euclidean solvable Malcev algebras

A pseudo-Euclidean Malcev algebra is a Malcev algebra equipped with a non-degenerate symmetric bilinear form. In this paper, we introduce a curvature operator for pseudo-Euclidean Malcev algebras, generalizing the notion of curvature for pseudo-Euclidean Lie algebras. We define flat pseudo-Euclidean Malcev algebras and show that every flat Euclidean solvable Malcev algebra which is also a Lie algebra remains flat in the classical Lie algebra curvature sense. Furthermore, we develop the flat double extension construction for flat pseudo-Euclidean Malcev algebras and prove that every flat Lorentzian Malcev algebra with a degenerate center can be obtained via the flat double extension of a flat Euclidean Malcev algebra. Moreover, we demonstrate that all flat Lorentzian nilpotent Malcev algebras arise from the flat double extension of a Euclidean abelian Lie algebras. Finally, we establish that any flat Lorentzian nilpotent Malcev algebra is necessarily a Lie algebra and is flat in the classical Lie algebra curvature sense.
Read the full abstract

Differential Geometry

Local rigidity of constant mean curvature hypersurfaces in space forms (II)

This is the second article of a sequence of research on the local rigidity of constant mean curvature (CMC) hypersurfaces in space forms. In the previous one, we studied the local rigidity of CMC hypersurfaces whose the number of the distinct principal curvatures satisfies $g\leq 3$. In this paper, we study the local rigidity of CMC hypersurfaces with $g\geq 4$. When $g>4$, we prove that if the $k$-order mean curvatures $H_k$, $(k=2,\cdots, g-1)$ are constant and there exist enough multiple principal curvatures, then the CMC hypersurface is an isoparametric hypersurface. When $g=4$, if $H_2$ and $H_3$ are constant, then the CMC hypersurface is an isoparametric hypersurface.
Read the full abstract

Computation and Language

Thought without systematicity? Evaluating reasoning models on rule induction tasks

A central tenet of human cognition is systematicity, the principle that understanding one concept is inherently tied to understanding close variations of that concept. Do reasoning models robustly exhibit such systematicity? If so, we would expect consistent performance on structurally equivalent variants of the same task. Here, we extend established rule induction tasks from cognitive science to assess the systematicity of thought in current reasoning models. Each task family has compositional structure that we use to create structurally equivalent task variations through task isomorphisms such as recombination and substitution. We find that despite being able to correctly solve a task, models often fail on structurally equivalent variants of the same task. These findings suggest that many model behaviors lack systematicity, rendering it difficult to robustly establish the cognitive abilities of reasoning models beyond the particular contexts they were evaluated in.
Read the full abstract

Machine Learning

Hardware-Aware Learned Representation Compression for Distributed In-Sensor Vision

In-sensor computing reduces the cost of transmitting high-resolution image data by performing early-stage processing near the sensor. However, the logic chip integrated with a CMOS image sensor (CIS) is tightly constrained in compute and memory, limiting conventional deep neural network partitioning. We present OASIS, a distributed in-sensor vision framework that uses a lightweight encoder to generate compact, task-relevant representations before off-chip transmission. The encoder is trained end-to-end using task, entropy, and reconstruction objectives, while the decoder is used only during training. OASIS supports two complementary deployment paths. The first applies 4-bit quantization and Huffman coding while preserving the spatial structure required by classification and dense-prediction tasks. The second uses Sobol-based hyperdimensional computing (HDC) to transform the encoder latent into a fixed-dimensional binary hypervector for associative-memory classification. For the SwinViT-based VWW model, mapping a $3\times3\times8$ latent to a 64-dimensional hypervector provides an additional $1.77\times$ communication reduction with less than one percentage point of accuracy loss relative to the 128-dimensional configuration, yielding an overall $18{,}816\times$ reduction compared with raw 8-bit image transmission. We implement the digital near-sensor pipeline on an AMD Xilinx Zynq UltraScale+ FPGA and characterize it using direct board-level power measurements and Vivado post-implementation analysis, together with circuit-simulated CIS models and a 7-nm ASIC projection. Across visual wake-word classification, hand tracking, and eye tracking, OASIS reduces total system energy by approximately $2\times$-$4.5\times$ while maintaining competitive accuracy, demonstrating a practical hardware-algorithm co-design path for communication-efficient in-sensor vision.
Read the full abstract

All authors Chengwei Zhou, Abu Masum, Xuming Chen, Mehran Moghadam, Sreetama Sarkar, Arnab Sanyal, Md Abdullah-Al Kaiser, M. Hassan Najafi, Sercan Aygun, Gourav Datta

Numerical Analysis

Subspace embeddings with the rerandomized SRHT

This work studies subspace embeddings obtained by two normalized real Walsh transforms, two independent sign diagonals, and uniform coordinate sampling without replacement. The main result shows that the prescribed sample size $k=\min\{n,\lceil Cr/\varepsilon^2\rceil\}$, for a universal constant $C$, suffices to preserve all squared norms on each fixed $r$-dimensional subspace within $1\pm\varepsilon$ with probability at least $0.99$. The result holds for every ambient Walsh dimension and all ranks, and answers Problem TR-01 in the Open Problems in Numerical Linear Algebra repository. The proof controls joint entry cumulants of the transformed projection through connected graph contractions and Walsh character identities. These estimates then bound the expected trace of even powers of a product of centered projections. A two-projection decomposition converts this estimate into control of both spectral edges. Bernoulli sampling at arbitrary densities and a deterministic upper bound near full sampling yield the prescribed number of coordinates.
Read the full abstract

Artificial Intelligence

SAILOR: Solver-Assisted Interactive LLM-based Optimization Recovery

Natural-language descriptions of optimization problems may be incomplete or vague about numerical information that a solver requires, including costs, capacities, demands, bounds, and penalties. A language model can translate the description into code, but when a required value is absent it must either stop or guess. We present SAILOR, a proof-of-concept system that detects such unsupported numerical choices, asks the user targeted follow-up questions, and updates the optimization model before returning a solution. Questions are prioritized using uncertainty and solver-derived estimates of how strongly each missing value affects the current model. We evaluate the pipeline on 1,723 instances from seven masked benchmarks using an idealized simulator that returns ground-truth values. Exact objective-value agreement ranges from 27.0% to 87.6% across datasets, with 1.4–5.7 questions per instance on average. These results establish feasibility under controlled branch-and-reveal feedback; they do not measure performance with human users or general structural model repair. Code is available at: https://github.com/sshaghayeghs/SAILOR.
Read the full abstract

Operator Algebras

Schatten norms on Hilbert $C^*$-modules via pure states

Let $(\mathscr{E}, \langle \cdot, \cdot\rangle)$ be a Hilbert $C^*$-module over a $C^*$-algebra $\mathfrak{A}$. The space of adjointable operators on $\mathscr{E}$ is denoted by $\mathcal{L}\left(\mathscr{E}\right)$. The sets of all states and pure states on $\mathfrak{A}$ are denoted by $\mathcal{S}\left(\mathfrak{A}\right)$ and $\mathcal{P}\left( \mathfrak{A}\right)$, respectively. For $\tau\in\mathcal{S}\left( \mathfrak{A}\right)$, let us define $\mathcal{N}^{\mathscr{E}}_{\tau}:=\left\lbrace x\in\mathscr{E}:\tau\left( \left\langle x,x\right\rangle\right)=0 \right\rbrace$. The Hilbert completion of ${\mathscr{E}}/{\mathcal{N}^{\mathscr{E}}_{\tau}}$ is denoted by $\mathscr{E}_{\tau}$. For $T\in\mathcal{L}(\mathscr{E})$, the operator $T_{\mathscr{E}_\tau}\in\mathbb{B}\left( \mathscr{E}_\tau\right)$, is defined by $T_{\mathscr{E}_\tau}\left(x+\mathcal{N}^{\mathscr{E}}_{\tau}\right)=Tx+\mathcal{N}^{\mathscr{E}}_{\tau}$. In this paper, we show that $\mathscr{E}_{\tau}={\mathscr{E}}/{\mathcal{N}^{\mathscr{E}}_{\tau}}$ when $\mathfrak{A}$ either is a $C^*$-algebra of compact operators or is commutative. We introduce a quantity in the context of Hilbert $C^*$-modules, denoted by $\pi^{\mathscr{E}}_k(\cdot)$ for $k\geq1$. We prove that $\pi^{\mathscr{E}}_k(T)\leq\sup_{\tau\in\mathcal{P}\left( \mathfrak{A}\right)}\left\|T_{\mathscr{E}_\tau}\right\|_{\left(k\right)}\leq{\pi}^{\mathscr{E}^{\sharp}}_k(T_{\mathscr{E}^{\sharp}})$ for every $T\in\mathcal{L}\left(\mathscr{E}\right)$, where the space $\mathscr{E}^{\sharp}$ is constructed as the extension of $\mathscr{E}$ by the embedding of $\mathfrak{A}$ into its enveloping von Neumann algebra $\mathfrak{A}^{**}$.
Read the full abstract

Analysis of PDEs

Structurally stable singularities and Lipschitz stable optimal transport metrics for the compressible Euler equations

It is well known that solutions to the compressible Euler equations can develop singularities in finite time. In this paper, we carry out a detailed analysis on behaviors of solutions up to the time of the first singularity for the one-dimensional compressible Euler equations with general smooth initial data. Our main results consist of three parts. First, for an open dense set of $C^3$ initial data, we show that the solution of Euler equations is twice continuously differentiable except at most finitely many points when the first singularity happens, using Thom's Transversality Theorem. Second, for any initial data in the open dense set of $C^3$ functions given in the first result, we provide the precise asymptotic description of the solution in a semi-neighborhood in the $(x,t)$-plane of each singular point at the time of the first singularity, and verify that the solution has a cusp-type singularity with Hölder exponent $1/3$ at each singular point. The proofs of the first two results are based on the representation of the solution in terms of a semilinear system. Third, for smooth initial data with small BV norm, we construct two Finsler type optimal transport metrics, then under these metrics show that the solution depends Lipschitz continuously on the initial data up to the time of the first singularity, with uniformly bounded Lipschitz constants. In particular, the $C^{1/3}$ generic singularity is stable in this sense. On the other hand, since our first two results hold for an open and dense set of initial data, any Hölder continuous cusp singularity with exponent other than $1/3$ is unstable under initial perturbations.
Read the full abstract

Computation and Language

CRITICS - Critical Science Without Borders: Language Models to Promote Critical Thinking in Science Education

The CRITICS project addresses science accessibility and literacy by converging advanced Machine Translation (MT) based on Large Language Models (LLMs) with educational technology. By leveraging MT systems specifically optimized for scientific content, educational institutions can provide accurate, culturally relevant translations of scientific materials in students' native languages, ensuring that complex scientific concepts are comprehensible while maintaining technical accuracy. Building on these translations, the project explores the design and evaluation of innovative science teaching-learning proposals grounded in curriculum-aligned teaching-learning. Thus, CRITICS will investigate key components of scientific argumentation and critical thinking practices together with textual feedback aligned with learning objectives and assessment criteria inspired by competence-based evaluation frameworks. CRITICS aims to break down language barriers to accessing cutting-edge research and educational materials currently available only in high-resourced languages, thereby facilitating the democratization of scientific knowledge and fostering critical thinking in science education.
Read the full abstract

All authors Rodrigo Agerri, Itziar Aldabe, Elena Cabrio, Mark Cieliebak, Jan Deriu, Mariana Flores, Jurgita Kapociute-Dzikiene, Dovile Kuiziniene, Arantza Rico, Aritz Ruiz-Gonzalez, Aitor Soroa, Mantas Vaskevicius, Serena Villata

Computer Vision

BLInD: Learning Driver Intent as a Distribution over Future Ego Trajectories

We present BLInD (Blind Learned Intent Distribution), a compact network that maps recent vehicle-state history (e.g. speed, curvature, indicator, and vehicle type) to a top-k distribution of future ego trajectories, with no camera, LiDAR, map, or object-track inputs. We find that vehiclestate history alone is sufficient to learn a useful multimodal distribution over near-term ego trajectories, and its low-latency nature makes it well-suited for safety-critical deployment. We investigate two distribution architectures, autoregressive (AR) and flow-matching, and train on both mixed-platform opensource and Wayve datasets. Both generalize without datasetspecific adaptation; the flow-matching model achieves best topk ADE/FDE of 0.15/0.37 m on Wayve, 0.15/0.36 m on Waymo, and 0.28/0.59 m on nuScenes, with the AR model reaching comparable coverage. Integrating the distributions into an AEB trigger task, a strict all-candidates policy reduces false positives from 1.51% to 0.11% with AR (13.7x reduction, 94.9% TP) and to 0.06% with flow-matching (25.1x reduction, 98.7% TP) compared to a 1-CTRV policy with 100% true positive score. BLInD runs in 0.87 ms with the AR head and 2.9 ms with the flow-matching head on an NVIDIA DRIVE Orin ECU making it compatible with real-time deployment on automotive ECUs. While existing learned distribution models rely on scene context and blind vehicle-state models typically collapse to a single path, BLInD is learned, blind, and cross-domain simultaneously, a combination not demonstrated by prior work. These results show that such a distribution provides a controllable and plausible intent sampling interface for downstream systems, with AEB as one instantiation.
Read the full abstract

All authors Flavian Pegado, Ronit Hire, Shreyas Rajesh, Soham Phade

Machine Learning

Optimal Transport for Efficient, Unsupervised Anomaly Detection on Industrial Data

Effective anomaly detection frameworks are a central pillar of the Industry 4.0 paradigm. In this paper, we introduce an Optimal Transport (OT)-based framework for anomaly detection, designed to detect deviations from normal behaviour in time-series sensor data. The OT-based method requires minimal user input and adapts to real-time data without the need for labelled training data. Our method effectively addresses existing limitations related to data labelling, generalisability, and scalability, demonstrating resilience against short-term fluctuations, noise, and data gaps - common challenges in industrial environments. Additionally, our method provides counterfactual explanations improving the auditability of the approach when deployed in industrial settings. The proposed method learns the mapping between normal and observed operating conditions through a sliding reference window that adapts to the dynamicity of the data. We evaluate our approach on three industrial datasets, from shipping, industrial HVAC systems, and publicly available benchmark data. The method was highly effective in identifying anomalies and reducing false positives, outperforming traditional methods, while maintaining computational efficiency and ease of configuration.
Read the full abstract

All authors Abigail Langbridge, Fearghal O'Donncha, James T Rayfield, Bradley Eck

Materials Science

Towards a Metal-Organic Framework with Pore-Confined Electrons

Electrides are an unconventional class of materials in which electrons are localized in crystallographic void spaces rather than solely around atomic nuclei, giving rise to appealing properties such as low work functions, strong electron-donating character, and even superconductivity. Here, we use ab initio methods to investigate metal-organic framework (MOF) electrides, a new class of materials that combines the interstitial electrons of electrides with the permanent porosity and chemical tunability of MOFs. These materials host pore-confined electrons: occupied electronic states localized in the pore space and with bands slightly below or crossing through the Fermi level. Using density functional theory calculations, we establish several design rules for stabilizing pore-confined electrons in MOFs via an anion-electron exchange process and identify candidate MOF electrides. As a proof-of-concept, we also demonstrate that the pore-confined electrons can directly facilitate chemical reactions, substantially lowering the activation barrier for H2 dissociation without requiring adsorption at a surface site. We envision that pore-confined electrons in nanoporous materials may enable a fundamentally new type of catalysis in which chemical reactions take place in the pore space, driven by electron-centered active sites.
Read the full abstract

Differential Geometry

Volume comparison for 3-manifolds with 2-Ricci curvature lower bound and Ricci flow

In this note, we study volume comparison for 3-manifolds with 2-Ricci curvature lower bound. We establish monotonicity and rigidity for geodesic sphere area and ball volume, and derive the pointed Gromov-Hausdorff precompactness under a uniform lower bound on the conjugate radius for 3-manifolds with 2-Ricci curvature lower bound. We also discuss the almost preservation of 2-Ricci curvature lower bound and the local non-collapsing propagation along Ricci flow. Finally, we point out a topological rigidity result on nonnegative scalar curvature.
Read the full abstract

Functional Analysis

$\varepsilon$-isometries without isometric embeddings

We show that there exist two separable real Banach spaces $X$ and $Y$ such that, for every $\varepsilon>0$, there is a standard exact $\varepsilon$-isometry $f_\varepsilon: X\to Y$ whose distortion of every distance is between $0$ and $\varepsilon$, whereas no isometric embedding of $X$ into $Y$ exists, even without a linearity assumption. This gives a negative answer to \cite[Problem 1 and Problem 2]{cheng4} of Cheng and Zhou. The construction combines a snowflaked Lipschitz-free space with the Schur-property theorem of Kalton and the isometric linearization theorem of Godefroy and Kalton.
Read the full abstract

Computation and Language

Inter-Rater Reliability of LLM and Rule-Based Annotation for Inferential Narrative Features: Three Studies on a Turkish Corpus

Datasets that ship automatically generated feature annotations invite a question rarely asked of them: would a human agree with those labels? This report answers that for the Objective Projection corpus, a Turkish narrative dataset whose scenes carry a per-scene applied_rules field from a rule-based detector over six craft features – two prohibitions (emotion labelling, simile) and four positive techniques (materialized metaphor, micro-focus, temporal anchor, atmosphere contradiction). Three studies are reported. Study 1 ($n = 120$) scores the detector against blind labels from the scheme's own author. Study 2 ($n = 100$, a disjoint scene set) scores the detector plus Gemini 2.5 Flash and Grok against an independent non-expert rater whose labels were locked before any machine ran. Study 2b re-runs the identical protocol with Claude Fable 5 (High) and ChatGPT 5.5. The central result concerns one rule. On materialized metaphor – closest to the methodology's theoretical core – the five machine labellers returned positive rates of $0$, $1$, $40$, $72$ and $78$ out of $100$ scenes, against a human count of $9$. Cohen's $\kappa$ was at or indistinguishable from chance for five of six labellers, across both human references and both scene sets: $0.004$, $0.015$, $0.000$, $0.019$, $0.027$. Raw agreement ranged from $74.7\%$ to $84.5\%$, an artefact of class imbalance rather than a sign of competence. We deliberately do not resolve this into a single story. Two readings survive: the feature is genuinely inferential and beyond current automatic detection, or the rule's definition is not yet operational enough for any rater to apply consistently – including the human. Distinguishing them needs a second independent human rater, which this report does not have and therefore does not claim.
Read the full abstract

Quantum Physics

SUTURE: Syndrome-Guided Repair for Segmented Feasibility-Preserving VQAs on Noisy Hardware

Constrained binary optimization is a representative class of NP-hard problems in scheduling, resource allocation, and finance. Segmented feasibility-preserving variational quantum algorithms (VQAs) are a promising approach that restricts ideal circuit evolution to feasible assignments and executes short measure-and-reseed segments. The existing boundary runtime enforces feasibility through purification, which discards measurements that violate the constraints. As problem size and noise increase, feasible measurements become rare; if no shot survives, the execution chain terminates. In our 72-qubit graph-coloring experiment on a real IBM Heron device, 11 of 12 purification chains terminate before completing all segments. We propose SUTURE: syndrome-guided repair, a runtime that repairs infeasible measurements instead of discarding them and is deployable on current quantum devices. SUTURE exploits a parity-check-like structure induced by the problem constraints: violated constraints form a syndrome that detects and localizes corruption and, under suitable structural conditions, often identifies a correction. SUTURE combines three stages: (1) a compile-time profiler that uses the compiled constraints and feasible initialization samples to predict single-flip recovery, with a maximum error of 0.011 across four constraint families; (2) a bounded runtime decoder that replaces purification inside the segmented execution loop; and (3) a regime analysis that identifies when repair is preferable to purification. In simulation up to 120 qubits, SUTURE continues the execution chain far beyond the noise level at which purification collapses. In the same 72-qubit experiment on IBM Heron hardware, SUTURE completes all segments in all 12 runs. In a separate 36-qubit timing experiment, decoding adds 1.6% to execution-path latency and less than 1% to total pipeline latency.
Read the full abstract

All authors Sokea Sang, Leanghok Hour, Sanghyeon Lee, Youngsun Han

Logic

Diamonds in mice

Let $M$ be a $(0,\omega_1+1)$-iterable mouse with no largest cardinal. Let $\gamma\leq\kappa$ be uncountable cardinals of $M$, with $\kappa$ regular in $M$. Then $M$ satisfies $\diamondsuit_{\kappa\gamma}^+$, and if $\kappa$ is non-ineffable in $M$ then $M$ satisfies $\diamondsuit_{\kappa\kappa}^+$. Suppose that either $\omega_1^M=\omega_1$ or $M$ satisfies "I am $(0,\omega_1+1)$-iterable". Let $\kappa\geq\omega_1^M$ be a cardinal of $M$. Then $M$ satisfies $\diamondsuit^*_{\kappa\omega_1^M}$.
Read the full abstract

Analysis of PDEs

Poisson problem with Hardy operator on lattice graph $ \mathbb{Z}^d$ and the application to semilinear equations

In this paper, we investigate the analytic properties of the Hardy-type operator $-\Delta + \mu H_0$ on the $d$-dimensional integer lattice graph $\mathbb{Z}^d$, where $\mu \geq -1$ and $H_0$ is a critical Hardy potential at infinity–arising naturally from discrete Hardy inequalities. We derive sharp fixed-pole Green kernel estimates on $\mathbb{Z}^d$ and obtain a necessary and sufficient weighted summability condition characterizing the solvability of the nonnegative Poisson problem associated with this operator. Building upon this classification, we provide a complete characterization of the nonexistence of positive solutions to the semilinear elliptic inequality $$ -\Delta u + \mu H_0 u \geq W u^p \quad \text{in } \mathbb{Z}^d, $$ where $p > 0$, $d \geq 3$, $\mu \geq -1$, and $H_0, W \in C(\mathbb{Z}^d)$ are strictly positive potentials satisfying the asymptotic behaviors $H_0(x) \sim |x|^{-2}$ and $W(x) \sim |x|^{\theta}$ as $|x| \to \infty$, with $\theta \in \mathbb{R}$.
Read the full abstract

Number Theory

Density of Vanishing of Certain Eigenspaces of Cyclotomic Class Groups

For an odd prime $p$, let $A_j$ be the $\omega^j$-eigenspace of the $p$-primary class group of $\mathbb Q(\zeta_p)$. Fix an even integer $d\ge4$, put $N=(p-1)/d$, and let $U_d=(\mathbb Z/d\mathbb Z)^\times$. For a relative density-one set of primes $p\equiv d+1\pmod{2d}$, we prove that the odd block $\bigoplus_{a\in U_d}A_{aN}$ has order at most $p^{\varphi(d)/2-1}$, and reflection shows that the even block $\bigoplus_{a\in U_d}A_{p-aN}$ has $p$-rank at most $\varphi(d)/2-1$. For each $d\in\{4,6\}$, both blocks vanish for a relative density-one set of primes $p\equiv d+1\pmod{2d}$; in particular, the even components vanish in accordance with Vandiver's conjecture. For each $d\in\{8,10,12\}$, the odd block has order at most $p$ for a relative density-one set of primes in the same progression, so every summand $A_{aN}$, $a\in U_d$, is cyclic, in accordance with Iwasawa's cyclicity conjecture. The proof uses an atomless limiting law for products of Dirichlet $L$-values, integrality of generalized Bernoulli norms, the relative class-number formula and reflection. A separate exact computation proves $A_{34}=0$ for every odd prime $p$; a single-file PARI/GP program reproduces the calculation.
Read the full abstract

Operator Algebras

Conjugations on Hilbert $C^*$-modules

This work initiates a systematic development of conjugation theory within the framework of Hilbert $C^*$-modules, extending classical complex symmetric operator theory beyond the Hilbert space setting. We first explore the foundational structure of $*$-conjugate-automorphisms $\sharp$ on $C^*$-algebras and characterize their existence through isomorphisms with opposite algebras. We show that the set $\mathbb{L}_c(\mathscr{E})$ of all adjointable conjugate-linear operators on a Hilbert $C^*$-module $\mathscr{E}$ possesses the structure of a Hilbert $\mathbb{L}(\mathscr{E})$-module. We also introduce the key notion of $\sharp$-conjugation on a Hilbert $C^*$-module and fully characterize such modules in terms of real forms and real $C^*$-algebras. Moreover, we investigate the geometric properties of $\sharp$-conjugate duals. A central achievement is the development of polar decomposition theory for semiregular linear (conjugate-linear) operators acting on a Hilbert $C^*$-module equipped with a $\sharp$-conjugation $C$, thereby extending the celebrated Garcia–Putinar theorem [Trans. Amer. Math. Soc. 359 (2007), 3913–3931]. As a consequence, we show that any $C$-symmetric unitary operator factors as a product of two $\sharp$-conjugations. A comparative analysis of alternative definitions shows that requiring the naive adjoint condition $\langle Cx,y\rangle = \langle x,Cy\rangle^*$ would force the underlying $C^*$-algebra to be essentially commutative, thus justifying the adopted approach. We supply various examples and counterexamples that extensively illustrate our results.
Read the full abstract

Cryptography and Security

Enforcement of In-Kernel Stateful Security Policies via eBPF

Many attacks against workloads running on multi-tenant systems are multi-step and history-dependent: sequences of innocuous operations whose malicious nature emerges only over an execution trace. Defending against them requires security policies that are stateful, are enforced within the kernel, and have a precise semantics. Currently deployed proposals fail on at least one count: kernel's built-in syscall filtering and classical MAC frameworks are stateless, while current eBPF-based tools express their policies through ad hoc YAML rules that cannot capture temporal relations among events, and whose semantics is defined only by the implementation. We present BPFence, an in-kernel runtime-verification framework that satisfies the properties above. BPFence provides a policy language with a formal semantics that can express temporal relations among events. It also provides a type system that statically distinguishes events the kernel can control from those it can only observe. Every well-typed policy is compiled into a finite-state monitor proved correct with respect to its semantics, and then into eBPF programs that run inside the kernel. We evaluate BPFence on seven case studies drawn from real-world attack patterns, and on a set of micro- and macro-benchmarks to show that the enforcement overhead remains compatible with production deployment.
Read the full abstract

Logic in Computer Science

Specification-Driven Data Architecture Reconstruction: From Physical Code to Logical and Conceptual Specifications

Legacy database migrations often begin with incomplete or outdated documentation, leaving physical data definition language (DDL) as the principal evidence of data architecture. However, DDL does not fully encode conceptual intent, and model-generated completions can be plausible without being correct. This study proposes and evaluates a provenance-aware, deterministic-first pipeline for reconstructing logical and conceptual data specifications from Oracle-oriented DDL while explicitly separating observed facts, deterministic derivations, and large language model (LLM) suggestions. The pipeline performs DDL investigation, parsing, consolidation, primary-key backfilling, type normalization, and declared relationship-graph construction before optional LLM-assisted enrichment. It preserves source provenance in the deterministic catalog and declared relationship graph, and records inferred primary-key and foreign-key candidates in a separate reviewable overlay. We evaluated the implementation on 249 artifactized schema samples comprising 1,225 SQL files. The pipeline completed 244 samples (97.99%); 52 completed samples contained no extractable DDL. Across completed samples, the deterministic path reconstructed 208 tables and recovered 278 declared foreign-key records; 168 of the reconstructed tables lacked an explicitly parsed primary key before backfilling. LLM enrichment generated 100 foreign-key candidates in 36 samples, but the parent-table admissibility rate was only 17.9% for logical-specification candidates and 17.5% for conceptual-specification candidates. These findings show that the proposed deterministic-first architecture can preserve an auditable structural baseline, quantify observed primary-key and relationship gaps, and prevent model-generated hypotheses from being silently promoted to source-grounded architectural facts.
Read the full abstract

Social and Information Networks

The Interconnectedness Coefficient: A Semi-Local Graph-Theoretic Measure for Connector Vertices between Cohesive Network Regions

The Interconnectedness Coefficient (IC) is a bounded semi-local graph-theoretic node measure designed to identify connector vertices between cohesive network regions. Such connector vertices, also referred to as bridging nodes, may mediate between locally cohesive regions even when they are neither hubs nor themselves highly clustered. The IC preferentially assigns high values to weakly clustered focal vertices whose adjacent vertices remain strongly clustered after exclusion of the focal connection. Candidate vertices are required to have degree at least two. The construction is partition-free, uses information within radius two, and requires no predefined community or module partition. The range and extremal properties of the score are derived analytically. Exact graph families isolate its maximal response to fully cohesive branches, its controlled response to a single cohesion defect, its invariance under a cohesion-free hub extension, and a sharp fragmentation threshold. A separate application to a Human Interactome Map reveals pronounced degree-dependent stabilization of IC values near the network's mean clustering level. This behavior follows directly from the multiplicative definition. If focal clustering tends to zero while mean leave-one-out cohesion in the neighborhood stabilizes, the IC converges to that neighborhood-cohesion level. Among the highly ranked IC vertices are proteins with established interface, scaffold, and adaptor roles in molecular complexes. The IC is therefore positioned as a semi-local connector measure for cohesive network regions.
Read the full abstract

Machine Learning

Exploring napping paradigm for Recurrent Spiking Neural Networks

Biological organisms minimize free energy by balancing two competing demands on their internal world model: it must be accurate enough to predict sensory input, yet simple enough to generalize beyond it. Two mechanisms regulate this balance offline: sleep reduces complexity through gradual synaptic downscaling, while stochastic noise attenuates precision, relaxing the constraint sensory input imposes on synaptic reorganization. Engineered Spiking Neural Networks (SNNs) leave this balance unaddressed, favoring instantaneous, noiseless weight normalization instead. This paper investigates the hypothesis that a biologically inspired micro-sleep paradigm, napping – combining proportional weight scaling with continuous stochastic membrane activity – can replicate the stability of normalization while shedding model complexity. We evaluate this in an unsupervised recurrent SNN trained via trace-based spike-timing-dependent plasticity (STDP) on Gabor-preprocessed MNIST. We tune napping across three regularization regimes by sweeping its duration and membrane noise level, then compare the best configuration against weight normalization. Across all three regimes, well-tuned napping matches the accuracy of normalization: accuracy peaks at brief durations and low noise, then declines monotonically as either grows. Clustering diverges, with the strongest geometric separation arising at longer durations and higher noise – the two terms of free energy pulling apart, accuracy rewarding data fit and structure rewarding the simpler representation that gradual, noisy downscaling induces. This gain carries a simulation cost normalization avoids, so napping is most compelling where representational structure, rather than raw classification efficiency, is the priority.
Read the full abstract

Statistics Theory

Can one regularizer reproduce posterior means at two noise levels?

Consider Gaussian denoising with a fixed prior and varying noise variance. When the prior has a density, maximum a posteriori estimation uses its negative logarithm as a fixed regularizer; only the weight of the quadratic data term changes with the noise variance. We ask whether a fixed regularizer can also recover the posterior mean. Although a suitable regularizer exists at each variance, we prove that no single regularizer works at two distinct positive variances for any compactly supported prior other than a point mass. This holds even for nonconvex and nonsmooth regularizers. A residual computed from two denoiser evaluations gives positive lower bounds on the uniform approximation error and excess mean squared error of estimators using a common regularizer. Numerical examples illustrate these bounds and the cost of reusing a regularizer across noise levels.
Read the full abstract

Optimization and Control

Equilibrium bias and convergence in augmented primal–dual dynamics with sampled constraints

This work studies the stability and convergence of augmented primal-dual dynamics when constraint values are estimated from samples. Unbiased constraint observations can produce a biased augmented multiplier signal, shifting the equilibria of the mean dynamics. For componentwise inequalities, we give a necessary and sufficient condition for preserving the Karush-Kuhn-Tucker (KKT) equilibria and construct a convex example with a locally exponentially stable equilibrium that violates complementarity. To address this bias, constraint values are estimated recursively before forming the augmented multiplier signal. For smooth convex conic problems, a joint energy analysis establishes boundedness of the primal, dual, and estimation states, vanishing estimation error, and almost sure convergence of the primal-dual iterates to a single KKT point under global regularity and bounded conditional second moments. The result allows nonunique solutions and multipliers while keeping the number of samples per iteration fixed. Numerical studies illustrate the predicted equilibrium bias and examine convergence with nonunique KKT points and nonlinear constraints.
Read the full abstract

All authors Kang Liu, Mengxiao Chen, Siqi Xiong, Yi Xia

Discrete Mathematics

Tournaments not inducible by five voters

How many members must a committee have before its pairwise majorities can express any collective preference? With enough voters every pattern of pairwise majorities, or tournament, can arise, but a committee of $k$ voters produces only some; for odd $k$, let $N(k)$ be the least number of alternatives on which some tournament arises from no $k$ voters. Only $N(3) = 8$ is known; for five voters our companion paper gave $12 \le N(5) \le 38$ and the first explicit example of moderate size, on 43 vertices. We show $13 \le N(5) \le 22$. The upper bound comes from nine tournaments on 22 vertices that five voters cannot produce: eight one-vertex deletions of doubly regular tournaments on 23 vertices, including every deletion of one of them, and one arc reversal. The Paley tournament on 23 vertices, which Bachmeier et al. (2019) left open after six weeks of SAT solving, is beyond five voters, and so is every other doubly regular tournament on 23 vertices. The lower bound comes from an analysis of all tournaments on 12 vertices. Both doubly regular tournaments on 19 vertices, the Paley tournament and one other, arise from five voters, but not with unit margin, that is, not with every majority carried by three votes to two. The method is a search that places one alternative at a time and exploits the tournament's symmetries; four of the negative results are certified by machine-checkable proofs, and all results are reproducible from a public repository.
Read the full abstract