Peer Revenue Publish or profit

Papers

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

All of arXiv

Saturday 5 September

Functional Analysis

Powers, Roots, and Positivity

There is a remarkable variety of natural generalizations of the notion of scalar positivity to square matrices. The lists and tables indicate those that we consider here; they are practically exhaustive of those that arise in practice and theory. Since positive scalars are closed under taking arbitrary powers and roots, it is natural to ask which of these matrix generalizations enjoy analogous closure properties. Our purpose here is to examine and advance these generalizations with respect to their closure under integer powers and fractional matrix roots. In addition to surveying known results, we establish for several important classes of matrices that positivity is preserved under fractional powers, showing that key structural features are retained under matrix roots. The role of Pick functions in the analysis is emphasized throughout. Proofs, counterexamples, and related results are presented, and summary tables are included to provide a concise and useful reference.
Read the full abstract

Commutative Algebra

On the Matlis Reflexive Modules

Matlis duality, first introduced by Eben Matlis in 1958, stands as one of the most elegant and powerful tools in commutative algebra, establishing a striking contravariant equivalence between Artinian and Noetherian modules over complete local rings. In this paper, we undertake a thorough and systematic investigation of Matlis reflexive modules — those modules for which the canonical evaluation homomorphism into the double Matlis dual is an isomorphism. Our exposition begins with a detailed historical narrative, tracing the intellectual trajectory from classical Pontryagin duality through Grothendieck's dualizing complexes to the modern formulation of Matlis duality. We then develop the core theory from first principles, demonstrating that the class of Matlis reflexive modules constitutes a Krull-Schmidt category — a result that generalizes the classical decomposition theorems for modules of finite length. Over complete Noetherian local rings, we prove that Matlis reflexive modules coincide precisely with the class of minimax modules (those possessing a Noetherian submodule whose quotient is Artinian). We establish full closure properties, including stability under submodules, quotients, extensions, and finite direct sums, with rigorous and self-contained proofs. The paper also surveys recent applications to generalized local cohomology, change-of-rings results, and connections to pure-injective modules and linear compactness, and concludes with a discussion of open problems and future research directions.
Read the full abstract

Computer Vision

DINO Eats Geometry: Self-Supervised Sign Representations that Absorb Articulated Hand Geometry

Handshape and orientation are geometric components of sign language, yet many sign encoders learn from appearance alone. We introduce SignDEG (DINO Eats Geometry), a temporal sign encoder that uses articulated hand geometry as a pre-training target and requires only video at inference. Frozen DINOv3 features of tracked hands and faces feed per-stream temporal Transformers. Geometric latent prediction (GLP) supervises an intermediate block with WiLoR latents, MANO articulation, and 3D joints, including at masked frames. Geometric relation transfer (GRT) matches cross-video frame-similarity distributions at the final block. Both objectives are learned jointly with temporal self-distillation; WiLoR and the geometry heads are then discarded. Under the SHuBERT public-data evaluation protocol, SignDEG reaches 17.9/24.5 BLEU-4 on How2Sign/OpenASL, compared with 16.2/23.2 for SHuBERT. Rank-1 adaptation improves ASL Citizen and Sem-Lex recognition by 0.02 Recall@1 each, and phonological classification improves across 16 attributes. Removing GRT while retaining GLP reduces How2Sign BLEU-4 by 1.4 and ASL Citizen Recall@1 by 0.034. The results support transferring articulated structure into an appearance encoder without running a hand reconstruction model at deployment.
Read the full abstract

All authors Junyi Hu, Zhewen He, Haomian Huang, Zhenhua Li, Zhifei Li, Shuaihang Yuan, Yi Fang

Astrophysics of Galaxies

Interstellar Complex Organic Molecules and Molecular Outflows in NGC 1333 IRAS 4B and 4B' Observed Using NOEMA

We present interferometric observations with the Northern Extended Millimeter Array (NOEMA) of NGC 1333 IRAS 4B and 4B', two young stellar objects (YSOs) within the Perseus molecular cloud. YSOs, especially Class 0 protostars, are rich in gas-phase interstellar complex organic molecules (iCOMs), but relatively little is known about the spatial distribution of these important prebiotic molecules. Various molecules were imaged within IRAS 4B and the surrounding area in the 145 GHz spectral range, revealing hundreds of molecular transitions within the warm inner envelope of IRAS 4B. This work provides derived physical parameters (rotational temperature, column density, velocity shift with respect to local standard of rest, and full-width at half-maximum spectral line width) for 11 molecules toward IRAS 4B including methanol (CH$_3$OH and isotopologues), methyl formate (HCOOCH$_3$), dimethyl ether (CH$_3$OCH$_3$), acetaldehyde (CH$_3$CHO), ethanol (C$_2$H$_5$OH), glycolaldehyde (CH$_2$OHCHO), acetone (CH$_3$COCH$_3$), and isocyanic acid (HNCO). Out of these molecules, 10 are iCOMs (excluding HNCO) that trace the inner envelope of IRAS 4B and mark it as a rich source of organic material. There is a strong spatial correlation between the continuum emission of IRAS 4B and iCOM molecular emission and among various iCOMs with each other. Physical parameter and integrated intensity maps show that IRAS 4B is a binary protostar system that drives a jet in a north-south orientation and an outflow in a northwest-southeast orientation. IRAS 4B' also drives a west-east outflow but shows no evidence of molecular emission cospatial with its continuum emission.
Read the full abstract

All authors C. C. Sarver, M. M. Giese, D. C. Lis, S. L. Widicus Weaver

Machine Learning

Representation Learning for Sample-Efficient CATE Estimation by Leveraging Multiple Outcomes

Estimating conditional average treatment effects (CATE) enables efficient targeting of interventions, but many applications have limited experimental samples, making it difficult to estimate heterogeneous effects from high-dimensional covariates. In such settings, policymakers and medical practitioners often succumb to the curse of dimensionality or apply off-the-shelf dimension reduction methods that may not preserve treatment heterogeneity. Yet these domains often come with large historical datasets measuring a wide range of outcomes – a source of supervision that is rarely exploited in practice. Following causal representation learning, we hypothesize that such domains with high-dimensional covariates have lower-dimensional underlying dynamics. We can thus leverage the diverse outcomes measured in historical data to learn a lower-dimensional representation of the covariates. Theoretically, we prove that when the auxiliary outcomes satisfy a set of surrogacy conditions and the representation retains relevant covariate information, the original CATE is identified when the high-dimensional covariates are replaced by the learned representation. Combined with existing dimension-dependent rates for CATE estimation, the result implies greater sample-efficiency on the same experimental sample. Additionally, we characterize the bias-variance tradeoff when the assumptions do not hold perfectly, and show that the representation-based estimator can still achieve lower error when the reduction in estimator variance outweighs the bias due to compression. Empirically, we evaluate the method on synthetic data and semi-synthetic medical data.
Read the full abstract

All authors Maitreyi Swaroop, Shikha Bhat, Samantha Rodriguez, Tamar Krishnamurti, Bryan Wilder

Information Theory

Scaling Bayesian Bandit Encoding with Shared Learning

A communication system must choose error protection and decoding effort as channel conditions change. A Bayesian bandit encoder (BBE) uses receiver feedback to learn which transmission configuration to select. We study a receiver that decodes by guessing error patterns, using Guessing Random Additive Noise Decoding (GRAND). We extend BBE's selection component to 1,008 code and decoder configurations by learning shared performance patterns offline and updating their weights online. Decoder noise models remain fixed. On a six-configuration training-selected shortlist, sharing reduces accumulated utility loss by 33.5% relative to independent learning. A fixed training-selected configuration matches the shared learner that searches the full catalog. After channel changes, the pruned shared learner first meets a near-optimal selection criterion in 88.5% of events by 2,000 packets, compared with 54.2% for pruned independent learning with the same discounting. The results support combining sharing and pruning for configuration selection, although packet losses remain high for the tested codes under severe noise.
Read the full abstract

Quantum Physics

Quantum Sensing of Non-Repeatable Events Enhanced by In-Sensor Quantum Reservoir Computing

High-density nitrogen-vacancy (NV) ensembles in diamond enable sensitive magnetometry. Many quantum-sensing protocols rely on reproducible target fields, allowing repeated measurements under different sensing conditions. In dynamical decoupling (DD) magnetometry, sweeping the interval between $\pi$ pulses across repeated measurements enables estimation of the frequency and amplitude of an unknown alternating field. For non-repeatable events, however, the same field waveform cannot be reproduced for measurements under different settings. Here we propose NV-based in-sensor quantum reservoir computing (NV-QRC) for sensing such events. Field-driven many-body dynamics and simultaneous fluorescence readout from multiple spatial regions provide a classical classifier with multiple features from a single event. For binary phase classification, we benchmark NV-QRC against DD magnetometry using a single pulse sequence fixed in advance. We show that NV-QRC can retain class-dependent information in regimes where the fixed-DD protocol fails to capture it. These results identify non-repeatable-event sensing as a promising application of quantum reservoir computing.
Read the full abstract

Probability

Sample genealogies within a Brownian excursion

In this article, we apply Itô's excursion theory to find the joint law of minima of a Brownian excursion conditioned to go above level $1$ over the intervals defined by $k$ independent identically distributed (i.i.d.) points of intersection of the excursion with level $a \in (0,1]$. This approach offers an intuitive way to find the joint law of coalescent times of an i.i.d. sample of k particles alive at time $a$ in Aldous' continuum random tree of height $1$. This can be thought of as “sampling of the limit" of critical Galton-Watson trees conditioned to survive a large time, agreeing with some special cases obtained in [4] and [5] which instead consider “the limit of sampling" from critical Galton-Watson trees.
Read the full abstract

Analysis of PDEs

The entropy production is not always monotone for the Kac equation

In 1966, McKean conjectured that the entropy production of Kac's caricature of a Maxwellian gas is nonincreasing in time \cite{McKean66}. We disprove this conjecture for the standard uniform-angle Kac equation. Our counterexamples are smooth, strictly positive, even mixtures of two Gaussians at different temperatures. We also show that every entropy derivative beyond the first violates its expected sign at some time along the same solution. The initial densities can be chosen with unit mass and second moment. mass and second moment.
Read the full abstract

Computation and Language

Steering Geometry: Validating Human Value Geometry in LLM Steering Space

As large language models (LLMs) are increasingly deployed in alignment-sensitive contexts, activation steering has emerged as a lightweight, inference-time alternative to fine-tuning methods (e.g., RLHF, DPO) for behavioral control. However, existing work typically validates steering on isolated behaviors, leaving it unclear whether steering vectors encode coherent semantic structure or merely exploit behavior-specific shortcuts. We investigate whether the latent geometry of LLM steering vectors reflects theory-specified structure in human values and morality. Using Schwartz's Theory of Basic Human Values as our primary fine-grained framework, we introduce a 26K-sample benchmark covering 20 human values and analyze distribution-driven methods (e.g., CAA, SphericalSteer, ODESteer) and behavior-centric approaches (e.g., COLD-Steer, BiPO) across diverse model families and sizes. We find that distribution-driven methods recover human value topologies aligned with theoretical predictions (Spearman $\rho$ up to 0.51, $p < 10^{-13}$). In contrast, behavior-centric methods achieve comparable steering performance but show little correlation with the expected value geometry. Geometric fidelity improves with model scale but drops after instruction tuning. Finally, better geometric alignment also leads to more human-consistent transfer across values: steering one value correctly lifts compatible values and suppresses opposing ones. Code and data are available at: https://github.com/DeepRCL/Steering_Geometry.
Read the full abstract

All authors Mohammad Mahdi Abootorabi, Armin Saghafian, Ali Bazshoushtari, Hamid Rezaei, EunJeong Hwang, Vered Shwartz, Parvin Mousavi, Purang Abolmaesumi

Computer Vision

Object-Aware Background-Controlled Editing via Weighted Velocity Guidance

Training-free image editing steers diffusion or flow-matching generative models at inference time by modifying prompt-conditioned denoising velocities. Existing velocity-based editors often apply prompt-induced residuals globally over the latent space and rely on the model to localize semantic changes implicitly. For object-centric edits, these residuals are rarely zero outside the target object, so small non-target components can accumulate during multi-step integration, causing background drift and unstable object boundaries. We propose Object-Aware Velocity Control (OAVC), a training-free framework that introduces object-level control into the velocity-integration process. OAVC decouples where semantic residuals are allowed to act from how they are injected into the dynamics. It constructs a background-anchored reference interface under the source prompt and then performs object-localized safe semantic injection under the target prompt. A constrained injection operator suppresses drift-inducing velocity components, while time-adaptive spatial weighting stabilizes the transition near object boundaries. OAVC requires no training or modification of pretrained model parameters. Experiments on object-centric image and video benchmarks with image and video rectified-flow backbones show improved background preservation, structural fidelity, boundary stability, and temporal consistency while retaining effective localized editability.
Read the full abstract

All authors Wuji Wang, Yue Wu, Chenhao Yi, Shuhui Wang

Numerical Analysis

Convergence rates of randomly pivoted methods for low-rank approximation

Randomly pivoted Cholesky, QR, and LU are iterative algorithms that form structured low-rank approximations of a matrix by sampling columns, or rows and columns, from the residual. We give convergence rates for these methods that depend on the decay of the singular values of the original matrix. The rates hold, up to a constant, when pivots are drawn from an approximation to the exact distribution. This extra degree of freedom can be used to trade exact sampling for cheaper approximations. We use it to establish rates for variants of randomly pivoted LU, including one that picks pivots using a sketch of the input matrix.
Read the full abstract

Nuclear Experiment

Direct measurement of $^{18}$F($\alpha,p$)$^{21}$Ne cross sections with ANASEN

The $^{18}$F($\alpha,p$)$^{21}$Ne reaction may impact Asymptotic Giant Branch nucleosynthesis and helium burning on accreting white dwarfs. This reaction has never been directly measured, and constraints from a previous time-inverse measurement leave large uncertainties in the reaction rate. We measured $^{18}$F($\alpha,p$)$^{21}$Ne cross sections directly for the first time covering from $2 \leq E_{cm} \leq 4$ MeV. Combining these results with previous work and comparisons to statistical model calculations results in a substantial improvement in uncertainties in the reaction rate. Cross sections were measured in inverse kinematics at TRIUMF-ISAC using a radioactive $^{18}$F beam and ANASEN with an extended $^{4}$He gas target. Protons were detected in arrays of silicon-strip detectors with the measured trajectories and energies allowing reconstruction of the center-of-mass energy and final state in $^{21}$Ne populated. We found the total cross section is in good agreement with statistical calculations, though population of the second excited state in $^{21}$Ne is greater than predicted. This direct measurement is combined with the previous time-inverse measurement and a new reaction rate is calculated for 0.1–3 GK. The uncertainties in the $^{18}$F($\alpha,p$)$^{21}$Ne reaction rate have been reduced to a sufficient level to allow robust predictions from AGB models. The new recommended rate leads to a 45% increase in $^{19}$F production compared to the previous rate.
Read the full abstract

All authors K. S. Davis, J. C. Blackmon, C. M. Deibel, G. L. Wilson, M. Alcorta, L. T. Baby, D. W. Bardayan, S. Carmichael, S. Chakraborty, C. Esparza, J. Glorius, A. I. Karakas, A. Lennarz, B. Kay, J. Henning, G. W. McCann, S. Pain, C. Ruiz, R. Russell, V. Sitaraman, B. Sudarsan, I. Tolstukhin, L. Wagner, I. Wiedenhöver

Quantum Physics

Efficient Quantum Circuits for Electronic Hamiltonian Simulation without Pauli Expansion

Electronic Hamiltonian simulation is commonly formulated by mapping fermionic operators to qubit operators and subsequently expanding the resulting ladder-operator products into Pauli strings. While general, this procedure obscures the higher-level fermionic structure and can hide opportunities for circuit optimization. Building on ladder-string-pair (Lasp) diagonalization originally developed for Hamiltonian simulation of partial differential equations, we construct time-evolution circuits for the second-quantized electronic Hamiltonian without performing a Pauli expansion. For the most general case of complex-valued coefficients, we present a time-evolution circuit for a two-body fermionic Lasp operator that corresponds to 16 Pauli strings in the Pauli-expansion approach but does not suffer from Trotter error at this stage. Expanding the optimization scope from a single operator to a triad of three fermionic Lasp operators sharing the same four spin-orbital indices enables systematic cancellation of CX gates, reducing the CX-gate count from 36 to 12 in the example considered, still without introducing Trotter error at this stage. For $n$ spin orbitals, further expanding the optimization scope to a sequence of $O(n)$ suitably ordered triads enables a cascade of CX-gate reductions across triad boundaries, reducing the CX-gate count from $O(n^2)$ to $O(n)$. The Lasp-based approach also naturally accommodates controlled time evolution and yields further optimizations for real-valued Hamiltonians. These results demonstrate that the Lasp-based approach enables more efficient time-evolution circuits by preserving high-level circuit structures and thereby expanding the scope of optimization, providing a systematic route toward more efficient electronic Hamiltonian simulation.
Read the full abstract

Machine Learning (Statistics)

Robust conditional dimension reduction for dissimilarity data

Conditional dimension reduction (cDR) learns low-dimensional latent coordinates while accounting for observed covariates that represent known sources of variation in the data. Conditional Multidimensional Scaling (cMDS) is a cDR technique that works directly with dissimilarity data. Its standard squared-stress formulation, however, is sensitive to contaminated dissimilarity, since outliers can dominate the objective and distort the learned configuration. We proposed Robust Conditional Multidimensional Scaling (rcMDS) by replacing the squared-stress criterion with a Fair M-estimation objective. We developed a reweighted conditional SMACOF algorithm to optimize this objective. The proposed algorithm admits computationally tractable updates, and its stabilized objective values decrease monotonically and converge to a finite limit. Experiments on synthetic and real data show that the pro
Read the full abstract

Analysis of PDEs

Carleman Estimates for Wave Equations on the Half-Line: AI-Assisted Weights and Applications

We develop an AI-assisted search-and-certification workflow for constructing Carleman weights for wave equations on semi-infinite domains. Starting from a weighted cross-term identity used to derive the Carleman estimate, we derive explicit analytical screening conditions and use an AI system to propose symbolic candidate weights subject to those conditions. The search identifies a logarithmic weight structure with concrete parameter values; the subsequent human verification by the authors then retains this structure, derives the admissible parameter range, and rigorously certifies the selected weight by verifying the required quantitative conditions. Based on the identified and certified Carleman weight, the subsequent proofs, analysis, and applications are carried out entirely by the authors: we establish a global Carleman estimate for the wave operator on the half-line and derive a weighted conditional lateral Cauchy stability result. The proposed weight is further used in a finite-depth one-sided reconstruction problem for semilinear wave equations on the half-line, where the initial-time flux induces an endpoint graph stabilizer and a contractive frozen nonlinear reconstruction map. Numerical experiments support the predicted contraction behavior and show improved robustness to noisy data from the Carleman weighting, with the induced endpoint graph term providing further stabilization at higher noise levels.
Read the full abstract

All authors Chenyang An, Yu Wang, Qihao Ye, Zhongqiang Zhang, Qiao Zhuang

Game Theory

Pairwise Maximin Share Allocations Need Not Exist

We study the fair allocation of indivisible goods among agents with strictly positive additive valuations. Pairwise maximin share fairness (PMMS) asks that, for every ordered pair of agents, the first agent value her own bundle at least as highly as the best worst-case share she could secure by repartitioning the two agents' combined bundles into two parts. Whether a PMMS allocation always exists for positive additive valuations has remained open since the notion was introduced. We resolve this question in the negative. We construct an instance with four agents and strictly positive additive valuations that admits no complete PMMS allocation.
Read the full abstract

Combinatorics

About the Cramér Large Deviation Property for Bell Polynomials

If $\boldsymbol{w} = (w_1,w_2,\dots)$ is a sequence in $\mathbb{N}=\{1,2,\dots\}$, the partial Bell polynomials based on $\boldsymbol{w}$ are $B_{n,k}$ for $k \in \mathbb{N}$ and $n\in\{k,k+1,\dots\}$. Let $F(z) = \sum_{n=1}^{\infty} (w_n/n!)z^n$ be the exponential generating function for $\boldsymbol{w}$, and assume the radius of convegence is positive $R>0$. Then $F(z)^k = \sum_{n=k}^{\infty} (k!/n!) z^n B_{n,k}$ for $|z|<R$. Alternatively, defining $Q_{k,n} = (k!/n!)B_{n,k}$, we have $Q_{1,n} = w_n/n!$, and $Q_{k+1,n}=\sum_{m=1}^{n-k} Q_{1,m} Q_{k,n-m}$ for $k\geq 1$. Let us say that the Cramér-type large deviation property holds if $$ \lim_{\substack{n \to \infty\\ k/n \to \kappa}} \frac{1}{n}\, \ln\left(Q_{k,n}\right)\, =\, \mathcal{G}(\kappa)\, ,$$ for every $\kappa \in (0,1)$, where $\mathcal{G}(\kappa)=\inf_{r \in (0,R)} (\kappa \ln(F(r))-\ln(r))$. The (Hardy-Ramanujan) Erdös induction argument suggests this should generally be true as long as two technical conditions are true: one an initial step, and the other a condition for small densities $\kappa$.
Read the full abstract

Networking

Exploring the Initial Performance of NB-IoT NTN over GEO: Measurement and Analysis

With the standardization of Non-Terrestrial Networks (NTN) to provide direct satellite connectivity to massive, low-power Internet of Things (IoT) devices, 3GPP IoT-NTN bridges the worlds of cellular and satellite communications. While holding great potential for global connectivity with IoT devices, there exist several concerns about the system performance of IoT-NTN over Geostationary Earth Orbit (GEO), which covers multiple dimensions such as end-to-end delay and energy consumption considering the ultra-long transmission distance from ground IoT terminals to GEO satellite. To answer these concerns, we have conducted the first comprehensive and in depth measurement for NB-IoT NTN over GEO. Based on real NB-IoT NTN testbeds including both Skylo and Tiantong, measurements covering more than six months confirm that the available implementation of NB-IoT NTN remains in the initial stage. Amplified by ultra-long Round-Trip Time (RTT) between ground IoT terminals and GEO satellite, there exists plenty of time and energy consumption during the access process. Interestingly, it also reveals that as an energy-saving mechanism, Power Saving Mode (PSM) fundamentally reshapes NB-IoT NTN traffic into a bursty and access-driven communication pattern and thus has a considerable influence on the end-to-end delay and energy consumption. Finally, we propose corresponding optimization schemes to reduce the delay and energy, which lays a good foundation for the implementation of NB-IoT NTN in the near future.
Read the full abstract

All authors Xiong Wang, Yumin Du, Bin Gu, Zheng Lin, Xiaoyang Li, Yi Gong, Wei Gong, Linghe Kong

Robotics

IM-ENGINE: Image Editing for Embodied Data Generation

Learning-based manipulation requires supervision that is both semantically meaningful and physically executable, but current data pipelines often provide only one of these properties. Human demonstrations capture intent but are costly to collect and constrained by the human-robot embodiment gap, while simulation can scale data generation but often under-specifies functional behavior. We present IM-ENGINE, a simulator-grounded pipeline that uses image editing as an intermediate representation for embodied data generation. Given a rendered scene with known geometry, depth, segmentation, and camera parameters, IM-ENGINE edits the image to inject task-relevant semantics, recovers explicit 3D state using simulator priors and an unchanged anchor object, refines the state in physics, and converts it into robot-executable supervision. We instantiate the pipeline for dexterous grasp synthesis and goal-state generation. For grasping, IM-ENGINE generates a human grasp in image space, recovers the hand-object interaction, retargets it to a robot hand, and refines it into physically validated robot grasps. For goal generation, it edits a rendered scene into a desired outcome, recovers the target-object pose, and refines it into physically valid, semantically meaningful goals and trajectories. This combination of generative semantic priors and simulator grounding enables scalable task-relevant supervision for robot learning.
Read the full abstract

All authors Yian Wang, Junyi Cao, Xiaowen Qiu, Chuang Gan

Category Theory

Exactness of the 2-categories of abelian and triangulated categories

We introduce a notion of $2$-homological category modelled on pointed homological categories in the sense of Grandis, using bizero objects whose null $1$-cells are zero objects in the hom-categories for formulating $2$-dimensional pointedness. We first prove directly that the $2$-category of di-exact homological categories, which generalize Puppe exact categories, functors preserving all kernels and cokernels, and arbitrary natural transformations is $2$-homological. Its normal subcategories are saturated thick subcategories, and its exact quotients are constructed by a complete three-arrow fraction calculus similar to the one known for Puppe exact categories. We then adapt this proof to prove that the $2$-category of triangulated categories is also $2$-homological; here, instead of the ternary fractions we use the well-known Verdier fractions. Abstracting the common quotient structure of these proofs yields a general criterion, using which we further establish that the $2$-categories of pointed, additive and abelian categories are also $2$-homological. The criterion also applies to categories enriched in semimodules over a fixed commutative rig, with a zero object, and to their full sub-$2$-category with finite biproducts. Their quotients are linear congruence quotients. Combining enrichment with Puppe exactness gives further examples whose quotients are exact linear localizations, including linear abelian categories as the finite-biproduct case. In the abelian and triangulated cases the normal subcategories and quotients are, respectively, Serre subcategories and Serre quotients, and thick triangulated subcategories and Verdier localizations.
Read the full abstract

All authors Elena Caviglia, Zurab Janelidze, Luca Mesiti, Ülo Reimaa

General Economics

Optimal Transport in Economics

Optimal transport provides a common language for allocation, equilibrium, computation, and inference. Its primal problem assigns mass or agents, while its dual variables admit economic interpretations as utilities, prices, and scarcity rents. This review explains why this combination has proved unusually effective in economics. We first present the core results, including Kantorovich duality, integrality, cyclical monotonicity, the canonical distance and quadratic costs, and entropic regularization. We then trace the field's development from planning and operations research to modern analysis, statistics, and computation. The economic literature is organized around two roles for transport: as a model of matching, trade, hedonic equilibrium, and aggregate assignment; and as a tool for coupling distributions, measuring discrepancies, constructing multivariate ranks, solving inverse problems, and certifying economic conclusions. We conclude by examining extensions beyond transferable utility, one-to-one matching, static allocation, and unconstrained transport, together with open questions involving learning and identification across multiple markets.
Read the full abstract

Computer Vision

A Comparative Study of GAN-Based Deep Learning Models for Pneumonia Detection in Chest X-Rays

This study evaluates pneumonia classification in chest X-rays using VGG19, MobileNetV2, ResNet50, and a custom CNN, and explores Generative Adversarial Network (GAN)-based synthetic data augmentation. MobileNetV2 achieved the highest reported accuracy of 88% with balanced class-wise performance. The custom CNN achieved pneumonia recall of 92.67% and precision of 79.43%, highlighting a precision-recall trade-off. Accuracy, F1-score, precision, recall, confusion matrices, and training curves were used to assess performance. Synthetic pneumonia images were combined with real images to investigate whether augmentation could improve classification performance. In the reported VGG19 comparison, augmented-data training accuracy reached approximately 100%, while validation accuracy remained near 50%, below the real-data validation accuracy. This experiment therefore did not demonstrate a validation-performance benefit from GAN augmentation. The classifier comparison highlights differences in accuracy and pneumonia recall, while the augmentation experiment indicates the need for further evaluation of synthetic-image quality and training settings.
Read the full abstract

Optimization and Control

Riccati Stability Without Auxiliary Matrices

In the 2004 collection Unsolved Problems in Mathematical Systems and Control Theory, Erik Verriest posed the problem of characterizing Riccati stability “without invoking additional matrices.” We give such a characterization through a scalar invariant of the resolvent family. The invariant is defined by covariance balances using at most $n^2+1$ frequency–direction pairs. A finite-dimensional separation argument shows that this covariance radius equals the optimal common ellipsoidal norm of the resolvent family. Combined with the strict bounded real lemma, this yields a necessary and sufficient condition for Riccati stability involving only the Hurwitz property of the first matrix and a single scalar inequality. The invariant reduces to the ordinary spectral radius for one matrix, lies between the pointwise spectral-radius and unscaled small-gain levels of the resolvent family, and coincides with the operator-space spectral radius of Shalit and Shamovich for the natural resolvent function space. The main results have been formally verified in the Lean proof assistant.
Read the full abstract

Quantum Algebra

Iterative construction of the R-matrices in arbitrary dimensions

We investigate a special ansats that allows for an iterative solution of the constant Yang-Baxter equation. Testing this ansatz, we construct four sequences of the constant R-matrices. In each sequence the R-matrices act on the tensor squares of vector spaces of linearly growing dimensions. Each R-matrix also depends on a single complex parameter. By analyzing the spectra of the R-matrices, we conclude that the first and the third series are associated with the symmetric tensor representations of the quantum groups U_q(sl(2)) and U_q(sl(2|1)), respectively. The other two series appear to be related to representations of quantum groups in the case where q is a root of unity. The elements of the second series are associated with nilpotent representations of U_q(sl(2)). We also check the correspondence between these R-matrices and link invariants. Applying the Reshetikhin-Turaev procedure to the first, second, and fourth sequences yields, respectively, colored Jones polynomials, ADO invariants, and Alexander polynomials. To our surprise, a similar calculation for the third series yields a trivial result, identically equal to 1.
Read the full abstract

Robotics

Bundle Length Tradeoffs in Decentralized Multi-Robot Task Allocation Under Degraded Communications

Bundle length B is commonly fixed when configuring multi-task multi-robot task allocation (MRTA) algorithms. MinSum and MinMax are known to favor different task distributions, but the role of B in this objective tradeoff has not been systematically characterized. Additionally, degraded-communication evaluations also often retain settings selected under ideal communication, leaving whether nominal bundle-length tuning transfers under message loss unresolved. We examine both questions for ACBBA, PI, and HIPC across six bundle lengths in 300 paired ten-target Collaborative Visit scenarios under ideal communication and 25% Bernoulli packet loss. Under ideal communication, increasing B from 1 to 12 reduces MinSum cost by 19.0%, 23.0%, and 31.8% for ACBBA, PI, and HIPC, respectively, while increasing MinMax cost by 45.6%, 94.3%, and 67.6%. Under packet loss, the lowest-mean MinSum setting shifts from B = 12 to B = 2 for ACBBA and PI. Repeated paired cross-fitting shows that retaining the ideal-network setting incurs held-out MinSum penalties of 14.4% and 7.2%, respectively, and increases MinMax cost by 30.0% and 41.8% relative to the loss-conditioned MinSum setting. HIPC retains a deep MinSum operating region, while the MinMax setting remains stable for all three allocators. Experiments at two additional target loads reproduce the ACBBA and PI MinSum shifts.
Read the full abstract

Software Engineering

KG-Commit: A Dynamic Knowledge Graph for Online Just-in-Time Software Defect Prediction

Just-in-time software defect prediction (JIT-SDP) aims to identify risky commits as they arrive and provide developers with timely feedback. This need for low latency has led most approaches to rely on commit-level information and overlook the broader project context in which a change occurs. Incorporating this context is challenging because it requires both efficient retrieval for incoming commits and continual maintenance as the repository evolves. We introduce KG-Commit, a dynamic knowledge graph that incrementally maintains repository history, within-file code structure, and commit semantics as the project evolves. It also uses an AST-delta mechanism to track structural changes between file edits and relies on lightweight graph inference running entirely on CPU. Our evaluation on 11 Apache software projects against six baselines shows that KG-Commit achieves the highest aggregate Macro-F1 (0.704), G-Mean (0.706), and AUC (0.809) using our selected inference pipeline. Under a realistic online protocol, it outperforms LR, HGB, RF, and DeepJIT on all 11 projects, LApredict on 10, and JITLine on 9 projects in Macro-F1, with the aggregate paired difference significant in every case. KG-Commit processes each commit in approximately 1.33~s, with a cost that remains stable as the graph grows and is compatible with commit rates observed in real-world projects. These findings show that rich project context can be efficiently maintained and exploited for online JIT-SDP.
Read the full abstract

All authors Mohsen Hesamolhokama, Mohammad Sina Beyrami Aghbash, Behnam Rohani, Mohammadamin Fazli, Jafar Habibi

Cryptography and Security

SIDE: Sensor Impersonation Detection at the Edge via Sequence Prediction

Some low-cost Internet of Things (IoT) sensor deployments lack device-level source authentication, leaving them vulnerable to impersonation or injected sensor readings. We present a lightweight approach to sensor impersonation detection in a small proof-of-concept study. We formulate detection as a sequence-prediction problem. A model with three LSTM layers and two fully connected layers is trained only on univariate temperature readings from a genuine sensor, and a window of readings is flagged when its mean absolute prediction error exceeds the mean genuine error by more than six standard deviations. The model is converted to TensorFlow Lite in three variants, non-quantized (554 KB), 16-bit weight quantized (298.5 KB), and 8-bit weight quantized (185 KB), targeting an Arduino Nano 33 BLE aggregator. The variants were evaluated with the TensorFlow Lite interpreter on the local server, since on-device execution of LSTM models was not yet supported by TensorFlow Lite for Microcontrollers at the time of the study. On a controlled testbed with the impostor sensor placed in a hotter outdoor location, the three variants reached detection accuracies of 99.980%, 99.972%, and 98.206%, and each flagged the change point when a test sequence switched from genuine to impostor data. Quantization made the model smaller but slower in our measurements. The genuine and impostor distributions were well separated, so these results show detection of a controlled distribution shift and should not be read as evidence of general device authentication.
Read the full abstract

Hardware Architecture

Towards Enabling Distance-Based Memory Addressing

Approximate Nearest-Neighbor Search (ANNS) in high dimensional vector datasets is an application of significant prevalence across different AI applications. However, such an operation is significantly bandwidth limited at large workingset sizes owing to the curse of dimensionality. Traditional indices used to accelerate ANNS rely on search-space pruning as a preprocessing step to alleviate such bandwidth requirement, but such optimization occurs either at the cost of increased bandwidth-inefficiency and/or degradation of search quality. This paper proposes a data-parallel hardware/software mechanism for performing large-scale similarity search in-memory. We propose a novel algorithm to simplify the computation requirement for similarity search across various distance metrics through lightweight primitives to perform a fast and approximate data-parallel brute-force search on the entire vector space. We further build a memory system capable of executing the required operations to generate a distance metric per datapoints, which is then used to enable pruning as a post-processing step. We offer adequate software support for user control over the proposed system. By enabling such search-space pruning as a post-processing step, we achieve near-perfect recall across representative workloads while achieving orders of magnitude performance and energy improvement over state-of-the-art algorithmic approaches on million and billion-scale workloads.
Read the full abstract

All authors Ananth Krishna Prasad, Sharad Bhat, Rajeev Balasubramonian, Mahdi Nazm Bojnordi

Human-Computer Interaction

Adaptive Ecological Momentary Assessment with a Hybrid Language Model: Formative Expert Review and Retrospective Evaluation

Ecological momentary assessment (EMA) measures experience in daily life, but fixed questionnaires and schedules collect information of uneven value and can interrupt participants. We present and retrospectively evaluate EMA-E4B, a hybrid framework for question selection and prompt timing. Separate ridge models propose an item set and delay; a supervised Gemma 4 E4B language layer produces the final structured response and explanation. Evaluation distinguishes proxy action performance, output conformity, and formative judgments of response quality. The data contain 4,372 records from 79 participants and yield 3,516 sequential cases under a participant separated split. One involved domain expert preferred the complete hybrid response in 15 of 20 decisive comparisons, with two ties among 22 reviews. On 75 reused development cases, hybrid question utility and timing similarity were 0.832 and 0.818; the head alone reached 0.852 and 0.818. A separate 60 case comparison with untouched E4B under the same head gave action differences of -0.0031 and -0.0105. Thus, the language layer produced structured responses with action scores comparable to or slightly below the reference configurations, while the expert feedback favored the complete hybrid response. These observations establish a concrete, inspectable framework and clarify the distinct roles of action scoring and response review. Repeated adaptive administration and practical effects on measurement and participant burden remain future research.
Read the full abstract