Peer Revenue Equity in science

Papers

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

All of arXiv

Thursday 27 August

Information Theory

Selective Interference Suppression of Siamese-Net in Heterogeneous Interference Channels

We study an end-to-end learnt short-block codes for a $N$-user real Gaussian interference channel with heterogeneous pairwise interference strengths, while keeping single-user decoding at every receiver. In this paper, we study the case wherein only a few dominant interferers exist and investigate whether Siamese-style coupled training can adapt selectively to encode (& decode) to ensure optimal performance corresponding to best tradeoff between orthogonality and coding gain or it enforces unnecessary global orthogonality oblivious of the reality. Our work focuses on a 4-user unequal-interference configuration with one dominant pair $(1,2)$ (of strength $\Lambda$) and a weak pair (with weak background coupling ($\lambda$)), through which we demonstrate a selective interference suppression phenomenon where the learned codebooks become near-orthogonal primarily for the dominant pair, while weakly coupled pairs retain alignment needed for coding gain. We quantify this behaviour using latent-space cross-user similarity statistics (worst-case coherence measure, average similarity measure, etc) and connect these geometric signatures to the observed BLER robustness under unequal interference. It seems that the SiameseNet selectively suppresses the interferences from various interferring user pairs to yield optimal tradeoff between coding gain and BLER dictated by orthogonality.
Read the full abstract

All authors Arkadeep Sinha, Shubham Paul, R. Manivasakan, Nambi Seshadri, R. David Koilpillai

Machine Learning

Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification

Nearest neighbor classification relies fundamentally on how locality is defined, yet conventional $k$-NN imposes the same neighborhood cardinality throughout the feature space. This assumption can be inadequate for data whose local geometry varies substantially across the underlying manifold. We introduce Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification (CARSANN), a geometry-driven framework that adapts the spatial support of each neighborhood according to local geometric complexity. CARSANN first estimates intrinsic dimensionality using TwoNN and constructs an intrinsic representation through principal component analysis. Local mean curvature is then estimated using a shape-operator-based formulation and controls neighborhood scale: highly curved regions receive stronger radius shrinkage, whereas approximately flat regions retain broader spatial support. Unlike methods that modify only the number of neighbors or the local metric, CARSANN explicitly adapts the spatial extent of local evidence. Experiments on more than 70 real-world OpenML datasets show that CARSANN consistently improves upon standard $k$-NN and is competitive with adaptive nearest-neighbor methods. In a controlled comparison using the same base neighborhood size, CARSANN achieves higher balanced accuracy on 40 of 45 datasets, increasing mean balanced accuracy from 0.6506 to 0.7528. The advantage also persists against $k$-NN with fixed $k=5$. Friedman and Nemenyi tests confirm that the improvements are statistically significant. These results indicate that local manifold curvature can serve as an effective geometric control variable for adapting neighborhood support, providing a complementary paradigm to cardinality-based nearest-neighbor adaptation.
Read the full abstract

Computer Vision

Depth-Aware Pothole Detection Using YOLO and RT-DETR at the Edge

Pothole detection and its severity measurement is still an important challenges in urban infrastructure management, where late maintenance directly contributes to vehicle damage, road accidents, and escalating repair costs. Existing automated approaches depend on 2D RGB images and cannot measure physical depth of potholes. In this paper, we present a depthaware pothole detection framework and then compare five architectures: YOLOv8n, YOLOv8nSeg, YOLOv9t, RTDETRL, and RTDETRX for RGB-D sensor fusion-based detection and automated depth measurement. A custom offline augmentation pipeline is used here to simulate adverse road monitoring conditions. All models are trained on the PothRGBD dataset with an 80% training and 20% validation split and evaluated using Precision, Recall, mAP@50, and mAP@50_95. Before measuring the depth data, all depth maps are corrected for camera tilt using RANSAC ground-plane orthorectification and all zero-valued sensor pixels are cast to NaN before any statistic is computed. YOLOv8nSeg achieves the highest mAP@50 of 0.9556 and mAP@50_95 of 0.6758 with the most accurate depth estimate of 2.96 cm with the pixel-precise Dseg algorithm. YOLOv8n achieves the fastest inference at 3.6ms. RTDETRX achieves the highest detection confidence at 92.70%. An important finding is that even after full RANSAC orthorectification, bounding box models overestimate pothole depth by 0.16 to 0.21 cm compared to pixel precise segmentation masks. This confirms that the pavement inclusion bias is structural rather than a calibration artifact.
Read the full abstract

Quantum Physics

Machine Learning-Based Characterisation of the Non-Markovian Dynamics of a Nitrogen-Vacancy Centre

The interaction between a quantum system and its environment can be characterized by the spectral density function: knowing its structure is important for optimizing applications of quantum technologies such as quantum sensing protocols. In this work, we present the first experimental demonstration of a machine learning-based reconstruction of reaction-coordinate spectral density parameters from NV centre Rabi dynamics. Unlike the previous work, we recover all spectral density parameters rather than only the central frequency, and benchmark the performance of the neural network against the Cramér-Rao bound and maximum likelihood estimator. Our results demonstrate that the model predicted by the neural network can reliably reproduce the NV dynamics over the estimation window, and can produce estimates for some parameters with variances comparable to that of maximum likelihood.
Read the full abstract

All authors Tom Lannon, Mauro Paternostro, John Martin Gregg, Amit Kumar

Information Retrieval

Beyond the Vacuum: Combinatorial Strategy Selection for Competitor-Aware Generative Engine Optimization

Generative Engine Optimization (GEO) has emerged as a novel paradigm for transforming content to increase visibility in Large Language Model (LLM) responses. Traditional GEO methods, however, select rewriting strategies in isolation, ignoring a critical externality: as adoption of content optimization grows, optimal strategies for rewriting content change. We formalize GEO as a competitor-aware strategy selection problem and propose a two-phase pipeline to solve it: (1) We use Bayesian Optimization of Combinatorial Structures (BOCS) to efficiently search the space of rewriting strategies, (2) We generate preference pairs and grounded reasoning traces from the BOCS black-box observations to fine-tune a language model to analyze a document corpus and propose optimal rewriting strategy combinations. We achieve state-of-the-art performance across several impression metrics over existing agentic and single-heuristic methods on both geo-bench and our synthetically augmented competitive dataset geo-bench_comp. Our method also transfers to multiple out-of-distribution datasets, proving effective across domains, queries, and document types.
Read the full abstract

All authors Vaibhav Sourirajan, Yao Zhang, Himanshu Kumar, Sahil Wadhwa, Mann Patel, Amirfarrokh Iranitalab

Probability

Oriented planar maps and annular mating of trees

We study a class of oriented annular planar maps which are closely related to bipolar-oriented maps. We prove that such maps can be encoded by a 2D lattice walk which converges to a 2D Brownian path in the scaling limit. We further prove a mating-of-trees result for the annulus, where the aforementioned Brownian path and a generalization encodes an LQG annulus decorated by a counterclockwise space-filling SLE loop with parameter $\gamma=16\kappa^{-1/2}\in(0,2)$.
Read the full abstract

All authors Xingjian Di, Nina Holden, Zhenfeng Tu, Pu Yu

Information Retrieval

LitCurate: A Configuration-Driven AI-Assisted Framework for Scientific Database Construction with an Application to Lower-Mantle Equation-of-State Data

The growing scientific literature contains decades of experimental and computational results that could support data-driven and physics-based modeling, yet much of this infor- mation remains locked in publications and is not readily usable for large-scale analysis or sci- entific software. Building structured databases from the literature is particularly challenging whenrelevantstudiesmustfirstbediscoveredamonglargecollectionsofpapersandreported quantities must be extracted with enough scientific context to remain usable. We present LitCurate, an open-source framework for building scientific databases from the literature using large language models within an auditable, stage-wise curation workflow. LitCurate integratesliteraturediscovery, relevancescreening, full-textprocessing, andstructuredinfor- mation extraction while retaining intermediate results and provenance, allowing researchers to inspect and revise individual stages rather than treating automated curation as a black- box process. We apply LitCurate to construct an equation-of-state database of lower-mantle and lower-mantle-relevant high-pressure mineral phases from experimental and theoretical studies, comprising 1,334 entries from 205 papers. The resulting dataset links reported equation-of-state parameters to mineral phases, compositions, equation formulations, meth- ods, and parameter constraints, and labels values as source-reported or citation-reported when provenance can be determined. The records are available through a searchable web application. By connecting scientific literature to traceable, machine-readable data, LitCu- rate provides a reusable approach for transforming accumulated literature into resources for scientific analysis and computational modeling.
Read the full abstract

All authors Abin Shakya, Wilson Samuels, Dominica Wilson, Gioia A. Marchi, Israa Draz, Chenxing Luo, Renata M. Wentzcovitch

Robotics

One year in a forest: Analyzing the challenges of autonomous navigation in subarctic environments

Subarctic regions have the potential to see increased deployment of autonomous robots in applications including forestry, mining, and environmental monitoring. In these conditions, an autonomous system's reliance on GNSS or cloud computing is precarious due to dense tree canopies and atmospheric attenuation, necessitating onboard sensing and data processing. However, established exteroceptive modalities, including cameras, lidars, and radars, are typically evaluated in structured urban settings or in environments that lack significant seasonal variations. To address this, we present a field report on a year-long deployment of a mobile robot in a subarctic boreal forest. We evaluate 64 km of data using nine odometry, localization, and mapping methods and assess their performance across seasonal changes. The performed experiments suggest that the environment changes significantly hinder the performance of state-of-the-art techniques, which show increased fragility when subject to conditions characterized by self-similar scenes or tall snowbanks. Additionally, complex Simultaneous Localization and Mapping (SLAM) algorithms offer limited accuracy gains over a proprioceptive baseline while significantly increasing system fragility. Furthermore, by correlating the position drift with features and confidence weight distribution, we show that visual-based SLAM methods are particularly affected by the seasonal changes. Additionally, we investigate the task of cross-season localization in a prior map. While lidar-based methods successfully completed localization runs between seasons, radar and visual methods are prone to failure due to a few matching features between runs, even within the same season. Finally, we detail the challenges and lessons learned from this year-long trial, including a multi-season Teach and Repeat (T&R) evaluation using both radar and lidar-based pipelines.
Read the full abstract

All authors Matěj Boxan, Nicolas Lauzon, Veronica Vannini, Mathis Turgeon-Roy, François Pomerleau

High Energy Physics (Theory)

The Late-time Ramp of the Double-Scaled SYK Model from the large-$n$ tail of Cactus Diagram

We derive the late-time ramp of the finite-temperature spectral form factor in the double-scaled SYK model directly from cactus diagrams, which is introduced as a multi-trace generalization of chord diagram in Ref \cite{Berkooz:2020fvm}. Although single-trace observables admit an exact chord-diagram description, multi-trace sums are obstructed by the chord-intersection weights $q_{IJ}$, which cannot be averaged independently to $q$. Our key idea is that the non-analytic contribution responsible for the ramp is controlled by the large-order tail of the Cactus-diagram expansion and is insensitive to finite changes in its low-order analytic terms. Decomposing the contribution with $n$-cross-trace-pairings Cactus diagram into two buds $B_n$ and a kernel $\mathcal K_n$, we determine their large-$n$ asymptotics with fixed $0\leq q<1$ and resum the resulting tail. For $\beta_L=\beta+it$ and $\beta_R=\beta-it$, we obtain \begin{equation*} Z_s^{\mathrm{sing}}(\beta+it,\beta-it) =s_p c_N \frac{|t|}{2\pi} \int_{E_{min}}^{E_{max}} e^{-2\beta E} dE+O(1), \qquad s_p=\begin{cases}2,&4\mid p,\\1,&4\nmid p.\end{cases} \end{equation*} This result reproduces the linear ramp predicted by random matrix theory, including its temperature dependence and symmetry factor, and agrees with the semiclassical predictions. It provides a direct microscopic origin of the ramp within the general $q$-deformed quantum algebra. While the plateau lies beyond the scope of the present analysis and calculation.
Read the full abstract

Quantum Physics

Quantum SEDONet: Spectrally-Embedded Quantum Deep Operator Networks for Partial Differential Equations

Quantum DeepONet accelerates neural-operator inference by evaluating an orthogonally parameterized network on a quantum computer, reproducing in ideal simulation the accuracy of its classical counterpart at asymptotically lower inference cost. Its trunk network, however, receives query coordinates with limited spectral structure, requiring the network to learn oscillatory features through its nonlinearities. We propose Quantum SEDONet (Spectral-Embedded Deep Operator Network), which assigns each trunk coordinate a spectral basis according to its boundary condition: Fourier features for periodic coordinates and Chebyshev features for bounded, non-periodic coordinates. The basis is selected per coordinate rather than per problem, allowing both representations within a single problem. Under unary amplitude encoding, the embedding incurs no additional qubits or circuit depth when its dimension remains within the network width, while increasing the parameter count by only a few percent. Across four benchmarks, Quantum SEDONet reduces the mean relative L2 error by 54.1% for the antiderivative, 49.6% for advection, 36.0% for Burgers, and 36.2% for a mixed-boundary channel Poisson problem. Quantum and classical evaluation paths agree to within 10^-8 throughout. The channel Poisson problem simultaneously uses Fourier features in the periodic direction and Chebyshev features in the bounded direction, demonstrating coordinate-wise boundary-matched spectral embedding without additional quantum-resource cost.
Read the full abstract

All authors Muhammad Abid, Arth Sojitra, Bipin Tiwari, Omer San

Mesoscale and Nanoscale Physics

Turning Zeeman splitting into switchable charge polarization in a double quantum dot

A magnetic field that acts identically on two quantum dots is not expected to move charge between them. Nevertheless, we show that a uniform Zeeman field can strongly reconfigure and even reverse the single-electron charge polarization of an asymmetric open double quantum dot. Using a symmetry-preserving Green's-function equation-of-motion approach, we identify regimes where the preferred dot occupation reverses while the system remains in the single-electron charge sector. Two distinct mechanisms produce this behavior. Unequal gate levels produce different occupation responses because the Zeeman-shifted resonances lie at different positions relative to the reservoir chemical potential, whereas unequal onsite interactions distinguish the dots through their many-body addition spectra. Coulomb blockade stabilizes the single-electron sector, causing the reservoir-mediated response to appear as spatial charge redistribution rather than a change in total occupation. Our results establish a mechanism for magnetic control of charge polarization at fixed electrostatic detuning.
Read the full abstract

Combinatorics

Uniformly Weighted Graphical Designs

A graphical design is a subset of vertices of a graph, along with a weight for each chosen vertex, that can perfectly average chosen subspaces of functions on the graph. A design is uniformly weighted if all the weights are equal, and several well-known combinatorial objects such as orthogonal arrays, combinatorial block designs and t-wise permutations are uniformly weighted graphical designs. While one might expect to see uniformly weighted designs in structured graphs, they do not always exist. In this paper we characterize the existence of uniformly weighted graphical designs, and use our result to provide several families of graphs that have, and do not have, such designs. Our results offer a polyhedral view of the structures that control the existence and cardinalities of these designs. In particular, we characterize all uniformly weighted designs of threshold graphs, and provide a geometric proof of the duality of linear codes and linear orthogonal arrays. We also provide a novel construction for graphs whose Laplacian characteristic polynomials are almost irreducible, to produce families without uniformly weighted designs.
Read the full abstract

Systems and Control

Competitive One-Step-Ahead Control of Friedkin–Johnsen Networks: Potential Games, Stability, and the Price of Competition

This paper studies competitive one-step-ahead control of Friedkin-Johnsen networks with overlapping player influence. The one-step interaction is an exact potential game with a unique Nash equilibrium obtained from a symmetric positive-definite system. Sequential best-response sweeps converge for every frozen network state, parallel sweeps obey an exact Jacobi condition (and always converge with two players), and one-sweep implementations require an augmented state-action stability test. For marginal networks, a signed left-right damping condition is sufficient for exact-equilibrium stability and becomes a sharp first-order instability test when its sign is reversed. A resolvent identity clarifies the feedback geometry, while a control-aware centrality identifies the goal conflicts that matter most. We characterize attainable equilibria under unconstrained, convex, and sparse goal restrictions and give a closed form for the same-state welfare loss caused by competition. Numerical examples verify the stability thresholds, geometry, and welfare predictions.
Read the full abstract

Cellular Automata and Lattice Gases

Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics

I explore Conway's Game of Life (GoL) on six composite Archimedean lattices. On the Kagome lattice, on which small gliders and puffers appear particularly frequently across inputs, I use the output of a symmetry-constrained evolutionary search algorithm to construct a novel glider gun. The glider gun comprises four interacting bouncers and stably emits a small glider every 276th generation. Serving as an extension of classical GoL, I also propose cells with a phase degree of freedom and an associated local phase rule, which on the Kagome lattice is demonstrated to host phase-periodic gliders. This enables the possibility of phase-sensitive and interference-based computations.
Read the full abstract

Software Engineering

Predicting LLM Performance from Prompt Linguistic Features: An Empirical Study in Requirements Engineering

Background. LLM outputs are highly sensitive to prompt formulation: small wording changes can substantially affect output quality. This matters in software engineering, where prompts guide requirements analysis, code generation, and artefact synthesis. Poor formulations yield unreliable artefacts, yet practitioners lack principled ways to assess a prompt before inference, making selection depend on costly LLM calls and trial-and-error refinement. Aims. We investigate whether measurable linguistic properties of prompts can predict LLM performance before inference, enabling low-cost prompt selection and refinement, validated on binary requirements classification targeting F1, F2, precision, and recall. Method. We generate 9,000 linguistically controlled prompt variants from 100 initial prompts by varying 30 linguistic metrics, evaluated with five open-source LLMs on 625 annotated requirements. Regression predictors are trained via stratified 10-fold cross-validation with permutation-based significance testing; feature importance analysis identifies cross-LLM and model-specific predictors. Results. Linguistic features significantly predict prompt performance across all targets (R2 in [0.38,0.42], q<0.05). Syntactic and morphosyntactic features drive most predictive signal; cross-LLM predictors include compound dependency distribution, conjunction density, and word/sentence length, reflecting sensitivity to domain vocabulary and complex structures. Conclusions. Results suggest practical implications for prompt engineering, including overlap between linguistic patterns that reduce LLM performance and those that increase human comprehension difficulty, and the irrelevance of lexical variety as a quality dimension. More broadly, linguistic profiling combined with standard regression provides an effective, interpretable, low-cost prior before costly optimisation pipelines.
Read the full abstract

All authors Quim Motger, Alessio Miaschi, Xavier Franch, Mohammad Amin Zadenoori, Alessio Ferrari

Graphics

Visual Cue Interactions in AR-Guided Needle Insertion: A Prostate Biopsy-Inspired Phantom Study

Despite the apparent simplicity of the motor action involved during percutaneous needle procedures, manipulating the tool's direction becomes challenging when clinicians cannot directly visualize internal anatomy and must rely on ultrasound images, which increase cognitive demand. Augmented reality (AR) offers the promise to assist with these tasks by providing pertinent visual information in the clinician's field of view. However, simply providing visual information that ignores meaningful visual cues can complicate depth perception and spatial understanding. In this work, we introduce and evaluate three visualization techniques for needle alignment developed during design sessions with medical experts: a localized focus-and-context window, a color-based proximity encoding, and an explicit trajectory overlay. These techniques were evaluated in a user study (n=26) including clinical experts (n=7) using a prostate-biopsy-inspired phantom. Results from this study suggest that cue effects depended on the surrounding cue configuration and user expertise. For novices, explicit trajectory overlay improved targeting accuracy and reduced retreat behavior, but its effect on completion time varied across cue configurations, with slower performance when the overlay was presented alone. For experts, the focus-and-context window reduced completion time and retreat events, while color-based proximity overlay improved completion time. Subjectively, color cues were often perceived as helpful even when their effects on accuracy were not consistent. These results suggest that AR guidance strategies for percutaneous interventions should consider user expertise and visual context.
Read the full abstract

All authors Xinrui Zou, Mingxu Liu, Thomas T. Jones, Braden Millan, Sandeep Gurram, Peter A. Pinto, Raisa Z. Freidlin, Alejandro Martin-Gomez

Solar and Stellar Astrophysics

Spectral Synthesis for Classical Ae Stars: H${\alpha}$ and CaII

Classical Ae stars (CAe) are main sequence, A-type stars with H${\alpha}$ emission but no signature of dust; they are thought to be the cool extension of the classical Be (CBe) stars to lower stellar masses. We investigate the use of H${\alpha}$ and the CaII IR triplet observed at low spectroscopic resolution ($R=1800$) as diagnostics for the circumstellar disks of the CAe stars. Using a sample of 159 CAe stars from the LAMOST survey (DR5), we find that circumstellar disk masses and star/disk viewing inclination angles can be reliably determined from low resolution H${\alpha}$ profiles. The CAe disk mass distribution agrees well with the previous range found for late-type CBe stars, although there is an apparent increase in disk mass for the latest CAe spectral sub-types (A3 and A4) which we attribute to selection effects. Over the spectral range A2 through B6, the average disk-to-star mass ratio for the CAe and CBe stars is consistent with $\log_{10}(M_{\rm disk}/M_*)=-9.1$. A minority of the CAe sample ($\sim$16%) also show emission in the CaII IR triplet. The observed emission is well within the range predicted by the disk models, and there is statistical evidence that the CaII emitters have systematically larger H${\alpha}$ disk masses.
Read the full abstract

Classical Analysis and ODEs

Optimal polynomial meshes beyond geometric boundary regularity via Green sublevels

We establish a potential-theoretic sufficient condition for a compact subset of the real line to admit an optimal polynomial mesh. The criterion bounds the cardinality of a norming set by a linear term in the polynomial degree plus the number of connected components of a Green sublevel at height $\alpha/n$, where $\alpha>0$ is fixed. By combining this principle with an estimate due to Andrievskii, we prove that every uniformly perfect compact subset of $\mathbb{R}$ admits an optimal polynomial mesh. A standard product argument then produces optimal meshes on finite Cartesian products; in particular, it yields an optimal mesh on the planar Cantor dust $C\times C$, which is self-similar, totally disconnected, and has empty interior.
Read the full abstract

General Mathematics

Wirsching's Positive-Predecessor-Density Program: Proofs of Conjectures 1 and 3

Wirsching (2003) reduces uniform positive predecessor density for the $3n+1$ map to a chain of five conditions, organized into three conjectures. We prove two of them. Conjecture 1 concerns his path-counting generators: in the convolution carrying them to his Elka functions the partition weights grow subexponentially while the binomial ratio decays geometrically, so a window of width $O(\sqrt{\ell})$ dominates and its radius fits inside the hypothesis. Conjecture 3 concerns the asymptotics near 0 of an invariant density $\varphi$, a base-3 analogue of the Fabius density, against an explicit $\varphi_0$ due to Berg and Krüppel. The exact log-Laplace transform of $\varphi$ splits into a smooth part, a log 3-periodic correction $H$, and a doubly exponentially small remainder. Berg and Krüppel represented that correction as an infinite product in 1998; their analysis did not determine whether it is constant. We give $H$ as a Fourier series with coefficients in closed form in $\Gamma$ and $\zeta$; a classical zero-free theorem for $\zeta$ shows it is not constant, and we enclose its oscillation rigorously. Wirsching's comparison class fixes one phase of $H$, and there Conjecture 3 holds with limit $e^{H(0)}$, certified to lie in $(0.53412203666478,0.53412203666479)$. Off that class the phase sweeps a full period, so the unrestricted asymptotic $\varphi(t)\sim\kappa\varphi_0(t)$ fails. Condition $(\star4)$ follows, at every window radius, with $\mu=1/3$: what Wirsching's argument needs is weaker than Conjecture 3 itself, and the same saddlepoint chain settles it directly. With Conjecture 1 the chain reduces to the single condition $(\star3)$. Conjecture 2 is his route to it and remains open.
Read the full abstract

Data Structures and Algorithms

Diva++: Dynamic Range Filtering over Hard Workloads

Range filters are compact probabilistic data structures that answer approximate range emptiness queries. They are used in many domains, e.g., in key-value stores, to quickly rule out the existence of keys in a given query range and avoid searching for them in storage. However, all existing range filters exhibit at least one of three shortcomings: (1) they do not provide any false positive rate or performance guarantees, (2) they do not support variable-length keys and query ranges, and (3) they do not allow dynamic updates. We introduce Diva, the first range filter to address all the above challenges simultaneously. Diva learns the dataset's distribution by sampling keys and storing them in a cache-efficient trie. It compresses keys in-between samples by removing their longest common prefix and truncating their suffixes while leaving enough bits in the middle (i.e., an infix) to differentiate the keys in sorted order. It stores infixes in constant-time dynamic data blocks, which it splits to handle insertions and expansions. It processes a range query by traversing the trie and checking for the inclusion of infixes in the target query range. We mathematically prove that Diva provides the best possible trade-off between memory and false positive rate on many common real-world data distributions. We extend these benefits to a wider range of real-world workloads by introducing Diva++, an enhanced Diva variant. Diva++ saves memory by removing redundancies among infixes using order-preserving entropy encoding. It then removes any remaining identical infixes and uses the freed space to store more bits of the original keys within compact binary tries. We compare Diva and Diva++ to all prior range filters, and show that they achieve a false positive rate on par with the state of the art on real-world datasets while supporting dynamicity and variable-length queries and keys.
Read the full abstract

Dynamical Systems

Devaney chaos in a Two-Dimensional Space with Weak Topology

It is well known that a finite-dimensional linear system cannot be chaotic. In this article, it shows that Devaney chaos with the weak topology can be generated by a linear map, where the weak topology into a two-dimensional Euclidean space is induced by a linear functional. Especially, it gives the equivalent conditions to be strongly transitive (weakly transitive, strongly sensitive,weakly sensitive, dense periodic points, respectively). Besides, we show that for a matrix with two conjugate complex eigenvalues, strong transitivity (sensitivity, respectively) is equivent to weak transitivity (sensitivity, respectively), which does not hold if we consider a matrix with two real eigenvalues. Finally, in two-dimensional space with weak topology, we show that weak transitivity and weak density of periodic points do not imply weak sensitivity and that weak transitivity and fixed point do not imply Li-Yorke chao, which show that there is a significant difference between the dynamic properties of weak topology and the dynamic properties of norm topology.
Read the full abstract

Signal Processing

Joint User Association and Pilot Assignment via Phase-Shifted Pilots for Scalable Cell-Free mMIMO

Cell-free massive multiple-input multiple-output (CF-mMIMO) promises uniform service across the coverage area, and this service relies on accurate channel estimation for every user equipment (UE). These estimates are obtained from orthogonal pilot sequences, whose number is bounded by the channel coherence block. As a result, the sequences are reused as the UE density increases and the resulting pilot contamination limits the scalability. This paper proposes a joint user association (UA) and pilot assignment (PA) framework built on the adaptive phase-shifted (APS) pilot design, in which all UEs share a single full-band pilot and a per-UE phase shift applied in the frequency domain places their channel impulse responses (CIRs) in contiguous, non-overlapping intervals of the time domain at the access point (AP). The number of UEs that an AP can separate is thus set by the number of subcarriers rather than by the number of orthogonal sequences, and the UA is formulated as a $\mathbf{0/1}$ knapsack problem whose item weights are the numbers of taps and whose capacity is the number of subcarriers. Analysis and simulations show that the proposed design more than doubles the number of UEs scheduled by the conventional interleaved (CI) benchmark. It attains the same mean-squared error (MSE) as the CI benchmark under an equal total pilot power, and a lower MSE under an equal per-subcarrier power. It further improves the 5th-percentile connectivity and Jain's fairness index by penalizing the number of existing connections of a UE in the value assigned to each candidate link.
Read the full abstract

All authors Mumtaz Ozlen, Ahmet Sacid Sumer, Ahmed Naeem, Huseyin Arslan

Physics and Society

Criticality and universality in network dismantling

Identifying the smallest set of elements whose removal dismantle a complex network, known as the network dismantling problem, is a fundamental task with many practical applications. Whereas network dismantling has been extensively studied over the past decade, most work has focused on developing efficient algorithms for large but finite networks. By contrast, the physics of the network dismantling process, namely how the network structural connectivity is affected by the removal of nodes or edges, remains largely unexplored in the thermodynamic limit. Here, we shed light on this understudied aspect of network dismantling by introducing an adaptive biased percolation process able to optimally dismantle a network. Through a systematic analysis of synthetic network models, we find that the proposed percolation process displays a universal phase transition, characterized by the abrupt and simultaneous disappearance of both the giant connected component and the largest 2-core, across networks with markedly different degree distributions. Simulations on real networks further support this universality, indicating that the physics of network dismantling is insensitive to a broad range of topological properties. Together, these results suggest that a topology-agnostic theory could be developed to explain the critical behavior of network dismantling.
Read the full abstract

All authors Lorenzo Cirigliano, Claudio Castellano, Minsuk Kim, Filippo Radicchi, Hanlin Sun

Neural and Evolutionary Computing

Tensor-Accelerated Eager Multi-Resolution Grids for Evolving Large-Scale Substrates

In neuroevolution, indirect encoding generates neural network connectivity from a compact genome rather than specifying each connection. ES-HyperNEAT automatically discovers where to place hidden nodes by examining CPPN output patterns: it recursively subdivides space using a quadtree, expanding regions where CPPN outputs show high variance. This adaptive approach discovers network topology without manual substrate specification, extending the fixed-grid HyperNEAT framework built on NEAT. However, the quadtree resists tensorization. Each depth level depends on the parent's variance, forcing sequential evaluation. Different CPPNs produce different subdivision patterns, preventing batching. And variable leaf counts are incompatible with JAX's static shape requirement for JIT compilation. Our prior work confirmed these limits at depths exceeding 5, and a JAX reimplementation of the quadtree yielded only marginal speedup despite batched optimizations, motivating the eager reformulation presented here. We present EMR-HyperNEAT, which evaluates all positions at all resolutions up front, then filters using the same variance criterion: ES-HyperNEAT's subdivide_if(var > $\theta$) becomes eval_all(); filter(var > $\theta$). This performs more CPPN queries than necessary, but all queries become independent and parallelizable across both cores and population members, reducing complexity from \BigO($4^D$) to \BigO($4^D/P$) across $P$ parallel cores. Recurrent substrate configurations become feasible through a connection type taxonomy. The experiments section validates 12-34$\times$ on-device GPU speedup on XOR at depths 5-7, and empirically higher solve rates across benchmarks.
Read the full abstract

All authors Romain Claret, Michael O'Neill, Paul Cotofrei, Kilian Stoffel

Astrophysics of Galaxies

Cluster Ages to Reconstruct the Milky Way Assembly (CARMA). V. The chronological merger tree of the Milky Way

We present a new age determination of 24 globular clusters (GCs) dynamically associated with the main accretion events experienced by the Milky Way (MW), as part of the Cluster Ages to Reconstruct the Milky Way Assembly (CARMA) project's effort to trace the Galaxy's assembly history. We used deep and homogeneous archival Hubble Space Telescope data, and applied the CARMA isochrone-fitting code to derive homogeneous estimates of age, metallicity, reddening, and distance modulus for systems dynamically associated with Gaia-Sausage-Enceladus (GSE), the Sagittarius dwarf galaxy (Sag), the Helmi streams (H99), and the Sequoia galaxy (Seq). These 24 new determinations are supplemented by 11 previously studied GSE clusters to construct the complete age-metallicity relation (AMR) of the GSE system. We find that each progenitor system describes a well-defined AMR, with a distinct slope and extent reflecting its individual star-formation efficiency and chemical enrichment history. By fitting analytical AMR models within a Markov chain Monte Carlo framework, we quantify the stellar mass and accretion time for each progenitor galaxy. This results in the first detailed merger tree obtained from strictly homogeneous chronological information, according to which the Low-energy-Kraken-Heracles (LKH) system is the first merger experienced by the MW that brought GCs in, followed by Sequoia, H99, GSE, and finally Sgr. The most significant events in terms of stellar mass are LKH, GSE, and Sgr, which together contribute a total of approximately 2.5 x 10^9 solar masses. This corresponds to more than 95% of the stellar mass accreted by the MW from mergers massive enough to host GCs.
Read the full abstract

All authors Fernando Aguado-Agelet, Chiara Zerbinati, Davide Massari, Matteo Monelli, Santi Cassisi, Cristiano Fanelli, Carme Gallart, Edoardo Ceccarelli, Yllari Kay González Koda, Tomás Ruiz-Lara, Sara Saracino, Maurizio Salaris

Computer Vision

ShiftSplit-AD: Separating Domain Shift from Defects in Foundation-Feature Visual Anomaly Detection

Visual anomaly detectors based on frozen foundation-model features commonly score distances from test patches to a memory of normal features. Benign acquisition changes can also enlarge these distances, confounding domain variation with defects. We investigate whether structured decomposition of nearest-normal DINOv2 residuals can suppress shift-induced evidence while retaining unseen defects. ShiftSplit-AD decomposes the patch residual matrix into low-rank and row-sparse components and scores the sparse component, with an optional low-rank/sparse fusion. The experiments expose a central trade-off rather than a universal separation: genuine defects can contain correlated, low-dimensional structure, so filtering broad residual activity may also remove defect information. On AeBAD-S, using settings fixed after Bottle development, sparse-only scoring improves image AUROC from 0.6780 to 0.7294 and AUPRC from 0.8052 to 0.8465. Paired bootstrap 95% intervals for the improvements are [0.0238, 0.0808] and [0.0170, 0.0650], respectively. However, sparse-only scoring reduces mean clean AUROC from 0.9890 to 0.9133 on four held-out MVTec categories and degrades Bottle localization. These findings show that residual decomposition can help when domain shift strongly contaminates anomaly evidence, but preserving defect structure remains the limiting problem.
Read the full abstract

Robotics

PHR-VLA: Planning Horizon Reasoning for Vision-Language-Action Models

Vision-language-action models (VLAs) have shown strong promise for general-purpose robotic manipulation by mapping language instructions and vision observations directly to actions. However, most VLAs primarily condition action prediction on current observations and lack an explicit mechanism for reasoning over future task dynamics, which is particularly important for fine-grained, contact-rich manipulation. We present PHR-VLA, a framework that enables planning-horizon reasoning in VLAs through privileged latent representations of future dynamics. PHR-VLA introduces a lightweight auxiliary future head that, during training, aligns the VLA's internal representations with latent dynamics extracted from future observations. Evaluation results demonstrate that local, contact-centric, patch-level latent dynamics supervision from the wrist camera improves success rate on LIBERO from 84.1% to 88.4% and on real-world disassembly tasks from 63.3% to 82.5%. Patch-level supervision from a third-person camera also improves performance on Meta-World from 56.70% to 57.8%. These results demonstrate that privileged latent dynamics alignment provides an effective training signal for improving anticipatory reasoning in VLA policies. Project website: \href{https://davoodsz.github.io/PHR-VLA.github.io/}{https://davoodsz.github.io/PHR-VLA.github.io/}
Read the full abstract

All authors Davood Soleymanzadeh, Kaidi Zhang, Zhiyuan Zhang, Bihao Zhang, Xiao Liang, Yu She, Minghui Zheng

Functional Analysis

On symmetricity of orthogonality with respect to numerical radius norm

We study Birkhoff-James orthogonality and local symmetric points in the space $C(K,X)$ of vector-valued continuous functions equipped with a numerical-radius type (semi-)norm. We extend the theory of abstract numerical ranges to semi-normed spaces and obtain complete characterizations of the left and right symmetric points of $C(K,X)$ with respect to the numerical-radius (semi-) norm. We also establish corresponding results for the space $\mathcal{K}(X)$ of compact operators on $X$.
Read the full abstract

Data Structures and Algorithms

Approximating the Rural Postman Problem below 3/2

We give an approximation algorithm for the rural postman problem with approximation ratio strictly smaller than $3/2$. We obtain this result by adapting to the rural postman problem the technique of sampling from maximum entropy distributions for the metric traveling salesman problem of Karlin, Klein, and Oveis Gharan. We also observe that, for every fixed $\varepsilon>0$, any $\alpha$-approximation algorithm for the metric traveling salesman problem yields an $(\alpha+\varepsilon)$-approximation algorithm for the rural postman problem; this implication is already implicit in the treatment of edges that must be traversed in the work of Lampis on the inapproximability of the traveling salesman problem.
Read the full abstract

All authors Hong Li, Jianping Li, Wei Li, Runtao Xie, Xiaoxiao Yang

Statistical Methodology

Robust model-based clustering via mixtures of multivariate pseudo-Voigt distributions

We propose a multivariate extension of the pseudo-Voigt profile-a weighted convex combination of Gaussian and Cauchy distributions-within a finite mixture modeling framework for robust model-based clustering and outlier detection. To ensure parsimony and coherence within clusters, shared location and scale parameters are imposed between the Gaussian and Cauchy components. Parameter estimation is carried out via an Expectation Maximization algorithm, with latent variables facilitating efficient likelihood-based inference. The performance of the proposed model is evaluated through simulation studies and applications to real-world data. Comparisons with established robust models, including mixtures of contaminated normal distributions, are provided to illustrate the model's clustering accuracy and outlier detection capabilities. The framework is shown to be particularly effective for data characterized by heavy-tailed behavior.
Read the full abstract