Quantum Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 5 September
Appeals to typicality are common in physics, but it is often unclear what it means for a physical state to be typical relative to a probability measure, and correspondingly unclear what a law that appeals to typicality asserts. Here we consider how one might characterize physical typicality using ideas from the theory of algorithmic randomness. As a concrete example, we show how taking a physical state to be typical relative to a computable measure when it is Martin-Löf random allows one to formulate the distribution postulate in Bohmian mechanics as a statistical constraining law of the theory. Using a toy model, we show how this constraint guarantees the standard Born statistics for computable experimental protocols. Algorithmic Bohmian mechanics (aBM) thus illustrates how algorithmic randomness may be used to provide precise content to a statistical law.
Statistics Applications
From Discrete Trailing Returns to a Continuous Graphical Profile: Return-to-Present Curves
Investment performance is commonly presented either as a conventional cumulative-return chart, which fixes a historical starting date and traces performance forward, or as a trailing-return table, which fixes the current endpoint but reports only a small set of prespecified horizons. These two displays have complementary limitations: fixed-start comparisons are conditional on the selected origin, whereas trailing returns provide only discrete snapshots of the underlying fixed-endpoint return function. We present the Return-to-Present (RTP) curve as a continuous fixed-endpoint representation that brings these perspectives together by holding the evaluation date fixed while allowing the hypothetical historical purchase date to vary over the available history. Familiar 1-month, 3-month, 6-month, 1-year, and longer trailing returns therefore become selected points on a continuous curve. When multiple investments are overlaid, RTP directly displays entry-date sensitivity, persistent relative advantage, crossings, and the timing and magnitude of separation without requiring selection of a single historical origin. The same endpoint-based construction naturally accommodates investments with unequal inception dates, recurring purchases, and retrospective portfolio rotation decisions in which sale and replacement-purchase dates may differ. We illustrate these uses with real investment data and discuss its relationship to momentum. RTP does not define a new return measure; its contribution is a simple graphical organization of familiar realized returns for historical comparison and decision support rather than prediction or statistical inference.
Read the full abstract
Computation and Language
Correction as Annotation: Bootstrapping a Dependency Parser for Documentary Medieval Latin
Medieval documentary sources remain inadequately served by existing natural language processing tools. None of the five readily available Latin treebank models attains usable performance on a collection of 160 inventories compiled in Marseille between 1258 and 1446. The best labelled attachment score is 0.62 and the best morphology-aware score is 0.24. Performance does not correlate with either genre or period proximity. To address this shortfall, in-domain training data was generated as a by-product of using these inadequate models. In each of nine iterations, a model pre-annotated 200 sentences; an expert corrected the annotations; and the corrected sentences were used to train the subsequent model, with batches sampled independently of model state, without active-learning selection. Thirty-three hours of annotation effort over 1,804 sentences increased universal part-of-speech accuracy from 0.80 to 0.98 and labelled attachment from 0.48 to 0.92, outperforming all baselines on the reported metrics while using 97% less training data than the largest one of them. Annotator effort declined from 54% of tokens to a plateau of 14-18%, an operational progress metric that requires no separate gold standard and can serve as a stopping criterion.
Read the full abstract
Number Theory
The Tate conjecture for abelian fivefolds over finite fields
We prove the Tate conjecture for abelian fivefolds over finite fields. The proof constructs correspondences for a residual motive using a Moret–Bailly family, Gross–Schoen heights, and monodromy. We also prove standard conjecture~$D_\ell$ over $\overline{\mathbf F}_p$ and independence of $\ell$ of rational cycle class kernels over algebraically closed fields of characteristic $p$. Over finite fields, rational and numerical equivalence agree with rational coefficients, and higher algebraic $K$-groups vanish rationally.
Read the full abstract
Algebraic Geometry
Polynomial point counts for moduli spaces of curves with marked points
We prove that the number of curves of a fixed genus g with n marked points over finite fields is a polynomial function of the cardinality of the field if and only if g = 0 or 3g + 2n is less than or equal to 24. This confirms a conjecture of Canning, Larson, and the authors.
Computation and Language
Beyond the Flag: Clinical Framing Closes the Moderation Gap in Suicide Risk Measurement
Moderation APIs are built to flag policy-violating content, not to measure graded clinical risk. But a platform's duty does not end at detection: the response owed to passive distress differs sharply from the response owed to active planning with means access, and emerging regulation (e.g., California Senate Bill 243) is turning that distinction into a compliance requirement. We therefore ask how well deployed safety signals recover clinically meaningful severity. We release a benchmark of 516 r/SuicideWatch posts rated by a licensed psychiatrist on a four-level ordinal schema (Indicator, Ideation, Behavior, Attempt) grounded in the Columbia Suicide Severity Rating Scale, and evaluate moderation APIs, prompted LLMs, and supervised baselines under seven ordinal-aware metrics. Three findings. Vendor moderation APIs separate low- from high-severity posts well (0.860 high-risk F1) but measure severity poorly (0.395 macro F1), systematically over-predicting the most severe category. Clinically grounded zero-shot prompting recovers much of that gap (0.562 macro F1), and expert-authored framing (not fine-tuning, added reasoning, or naive multi-agent aggregation) is the effective lever. The value of reasoning depends on register: it hurts on long, noisy Reddit posts and helps on short, clinician-authored statements. We argue graded severity, not a binary flag, is what a proportionate duty of care requires, and release our evaluation framework to support that measurement.
Read the full abstract
Analysis of PDEs
Sharp spectral-scale stability for parabolic equations with measure-valued delay
We study the dependence of parabolic solution operators on a finite signed measure describing the delay law. For a positive self-adjoint generator with compact inverse, a weighted dyadic spectral sum characterizes the norm of the semigroup-integrated memory perturbation. An exact realization identity transfers the matching lower estimate to two positive point delays in a fixed linear equation, using a common smooth, finite-spectral history. For the Dirichlet Laplacian on a nonempty bounded open set, the sharp worst-case modulus on a bounded ball of continuous $L^2$-valued histories is $d\sqrt{\log(e/d)}$, where $d$ is the bounded-Lipschitz distance between the delay measures. This is a rough-history endpoint result: logarithmic spatial regularity of order $\gamma>1/2$ restores resolution-uniform Lipschitz stability in the linear model. The critical order $\gamma=1/2$ retains a square-root double-logarithmic loss. More generally, a reciprocal-square summability criterion over occupied spectral bands gives the exact weighted threshold, including sparse spectra. Consequences include sharp finite-resolution Lipschitz constants, worst-case errors for prescribed midpoint quadrature of the memory measure, and semilinear upper estimates under Hilbert-space-valued local Lipschitz assumptions. The results distinguish sensitivity to the delay law from spatial approximation error and do not preclude uniform approximation of positive-time states on rough history balls.
Read the full abstract
Computer Vision
Adapting Vision Foundation Models to Acoustics for Pose-Free 3D Sonar Reconstruction
Vision foundation models trained on Internet-scale RGB datasets enable remarkable capabilities across a range of tasks, from text-to-video generation to few-shot 3D scene reconstruction. An acoustic foundation model trained on large-scale sonar datasets could enable similar capabilities in the underwater domain, where turbidity and low-visibility conditions make conventional RGB foundation models inapplicable. Unfortunately, a lack of freely available large-scale sonar datasets makes training such a model from scratch impractical. In this work, we demonstrate that vision foundation models can be efficiently adapted to the sonar setting by (1) exploiting the geometric relationship between the two sensing modalities and (2) employing accurate physics-based noise models for synthetic data generation. The resulting sonar adaptation models enable new capabilities: For the first time, we experimentally demonstrate sonar-based pose-free 3D reconstruction.
Read the full abstract
Optimization and Control
Regularized coordinate minimization for nonconvex composite optimization with application to quantized image compression
This paper presents a regularized cyclic coordinate minimization method for solving nonconvex composite optimization problems having the objective function formed as the sum of two terms, one is twice continuously differentiable and the second term is simple and separable. We analyze the convergence behaviour of our coordinate minimization method, in particular we provide convergence rates to a first-order optimality criterion and objective residual depending on the assumptions on the problem. Then, we show that our algorithmic framework can be efficiently applied for solving quantized matrix factorization problems that arise in e.g., lossy image compression. More specifically, on KODAK and CLIC 2024 datasets, our method notably outperforms JPEG at low bit rates, achieving savings in bits per pixel without excessive degradation and remains comparable at higher bit rates. Moreover, we evaluate both the original and quantized compressed images in a classification task using 3 well-known convolutional networks AlexNet, ResNet50 and MobileNetV2 based on floating point and integer arithmetic representations. Remarkably, when comparing the two numerical representations of the convolutional networks, there is no substantially accuracy degradation on ImageNet dataset. The numerical results on image compression and classification using real data show the flexibility and efficiency of our algorithm compared to well-established methods from the literature.
Read the full abstract
Combinatorics
Lonely Runner Relations
We study the Lonely Runner Conjecture (LRC), conceived by Jörg M. Wills in the 1960's: Given positive integers $n_1, n_2, \dots, n_k$, there exists a positive real number $t$ such that for all $1 \le j \le k$ the distance of $t \,n_j$ to the nearest integer is at least $\frac{ 1 }{ k+1 }$. We prove that for any counterexample or tight instance $\mathbf{n}$ of LRC, $\mathbf{m} \cdot \mathbf{n} = 0$ for some $\mathbf{m} \in \mathbb{Z}^k$ with $0 < \| \mathbf{m} \|_1 \le \min(2k+3, \ \frac{ k+1 }{ k-1 } \mathrm{flt}(k))$ where $\mathrm{flt}(k)$ denotes Khinchin's (1948) flatness constant limiting the lattice width of a $k$-dimensional convex body without interior integer points. In other words, potential counterexamples to LRC lie on a finite set of hyperplanes in the parameter space. Our proofs use Fourier analysis and a geometric reformulation of LRC, and our results generalize to the situation of shifted lonely runners of varying measures of loneliness. Our results imply and generalize a theorem of Czerwiński (2012) that when we choose $\mathbf{n}$ at random then, with probability tending to 1, the measure of loneliness $\frac{1}{ k+1 }$ can be replaced by $\frac 1 2 - \epsilon$.
Read the full abstract
Functional Analysis
An interpolation problem for extended Gevrey regularity
We study an interpolation problem in extended Gevrey classes defined by the sequences $M_n^{\tau,\sigma}=n^{\tau n^\sigma}$, $n\in\mathbb N$, $\tau>0$, $\sigma>1$. We show that, under a suitable growth condition on a divergent sequence of derivative orders, estimates of extended Gevrey type imposed only along this sequence imply corresponding estimates for all derivative orders. In particular, we explicitly quantify the change of the parameters in the resulting estimates. To this end, we first establish an equivalence between two definitions of the extended Gevrey classes, one involving the supergeometric factor $h^{n^\sigma}$ and another in which this factor is omitted. We then establish a corresponding interpolation principle for extended Gelfand–Shilov spaces, including a symmetric characterization and a formulation in terms of the associated function of the defining sequence.
Read the full abstract
Machine Learning
SeaCausal-FL: Federated Fuzzy Causal Learning for Maritime IoT Fault Diagnosis and Counterfactual Reasoning
Reliable marine-engine fault diagnosis in maritime IoT is challenged by distributed data ownership, heterogeneous fault distributions, and continuously changing operating conditions. This paper proposes SeaCausal-FL, a federated fuzzy causal learning framework that combines a shared temporal diagnostic path with mechanism-conditioned causal reasoning. An interval type-2 fuzzy layer represents uncertain and overlapping operating mechanisms, while each mechanism is associated with a physics-constrained structural causal model. Before aggregation, locally learned mechanisms are aligned using operating context, causal structure, and conditional intervention-response signatures. Model parameters are then aggregated according to sample, class, mechanism, and mechanism-class evidence instead of client sample size alone. The learned structural equations further support interval counterfactual reasoning through abduction, action, and prediction. Experiments on a marine-engine fault dataset and a real-data-calibrated semi-synthetic causal benchmark show that SeaCausal-FL achieves an average F1 score of 87.07% across four client partitions, with AUROC and AUPRC of 98.98% and 94.81%, respectively. It also maintains strong performance under unseen loads and fault-type omission during training. On the causal benchmark, SeaCausal-FL reaches an Edge-F1 of approximately 0.58 and an Edge-AUPRC of 0.68, reduces coefficient RMSE to about 0.14, and provides favorable counterfactual estimation and intervention decisions.
Read the full abstract
Robotics
GloVLA: Let Geometry Move and Local VLA Interact for Robust Object-Centric Manipulation in Unstructured Environments
Vision-language-action (VLA) models have shown promising generalization for language-conditioned robot manipulation, but deploying them in unstructured environments remains challenging. A single end-to-end VLA policy must simultaneously solve long-range transport of the end effector to task-relevant regions and short-horizon, contact-rich interaction upon arrival. This formulation is inefficient and brittle: small visual shifts, distractors, clutter, occlusions, or unfavorable initial gripper poses can push the policy outside the local state distribution in which it was trained, leading to task failure. We introduce GloVLA, a hybrid framework that explicitly separates object-centric manipulation into two complementary regimes: a geometric transport controller moves the end-effector into interaction-centric handoff regions, and local VLA policies handle only the short-horizon interaction phases. GloVLA is model-agnostic and can be integrated with different VLA backbones with no additional demonstrations and no changes to the action space or success predicate. Experiments on standard LIBERO and LIBERO-Plus Object tasks together with a newly introduced LIBERO-Challenge benchmark ettings with clutter, distractors,illumination changes, visual shifts, and obstruction show that GloVLA improves task success and substantially lowers VLA inference cost compared with full end-to-Challenge, full-trajectory GR00T N1.6execution degrades to 20.9% average success while GloVLA retains 88.5%; on a physical UR10e, overall success improves from 35.6% to 90.0% while mean inference time is more than halved. Videos and additional results are available at https://glovla-project.github.io/
Read the full abstract
Functional Analysis
Schwartz-Class Gabor Windows and the Balian-Low Classification
A lattice Gabor frame consists of a window function and its time-frequency shifts along a lattice. We classify the lattices that admit Schwartz-class and, equivalently, Feichtinger frame windows. Except for symplectically irrational lattices of critical covolume 1, we determine the lattice-dependent achievable window smoothness and decay using the scale of modulation spaces. For symplectically rational lattices, including the rational lattices typically used in digital applications, the classification is governed by an integer lattice parameter introduced herein, the symplectic index gap. Our results extend the classical and amalgam Balian-Low theorems. The companion paper "Tilings, Packings, and Smooth and Compactly Supported Gabor Windows" develops the associated tiling-packing theorem and compact-support constructions.
Read the full abstract
Analysis of PDEs
A model of a multiphase medium based on the closure of moment chains for the Vlasov-Poisson equations
We propose a method for closing moment chains for the Vlasov-Poisson kinetic system (the Landau fluid model), which yields a hyperbolic system of equations at each subsequent step. This system is interpreted as a multicomponent medium, where each component has its own density, velocity, and pressure. The coupling between the components is mediated by an electric field. The principle of closing moment chains is that the final component of the fluid is assumed to be pressureless.
Read the full abstract
Computer Vision
One Model, Two Worlds: Bidirectional Sonar-Optical Translation
Translating between imaging sonar and optical cameras is valuable for underwater perception, but supporting both directions with separate models duplicates storage and computation. A unified bidirectional model is therefore attractive, yet existing approaches largely treat the two directions symmetrically despite their fundamentally different image-formation physics. We argue that sharing a generative model does not require sharing the physics. We introduce the Direction-Asymmetric Realism Bridge (DARB), which retains a shared diffusion-bridge trunk while routing direction-specific physical priors through asymmetric pathways: range-aware modulation for sonar-to-optical translation and polar ray-dependent processing for optical-to-sonar translation. We further show that symmetry in training is also costly: applying a common realism schedule reduces sonar-to-optical PSNR by 2.60 dB. Our Adaptive Realism Supervision (ARS) instead determines when, where, and how strongly perceptual supervision is applied from reconstruction quality and gradient balance. Together, DARB and ARS enable one bidirectional model to match the sonar-to-optical specialist within 0.11 dB PSNR, outperform the optical-to-sonar specialist by 0.70 FID, and surpass two independently trained BBDMs on seven of eight metrics.
Read the full abstract
Signal Processing
Brain-Inspired User Positioning for mmWave Beam Management
Wireless positioning is a key enabling functionality of high-frequency, highly directional wireless systems. Supporting beam tracking depends on accurately translating channel state in- formation (CSI) estimations into position predictions. However, as urban propagation environments are inherently highly complex, determining the process that connects the CSI with the mobile user position is a difficult task. Motivated by this observation, a great amount of effort was put on designing user positioning schemes that employ conventional machine learning approaches, such as k-nearest neighbors (k-NN), and convolutional neural networks (CNNs). However, conventional models achieve low energy efficiency (EE). To counterbalance this disadvantage, brain-inspired neural processing units (NPUs) has recently been introduced. For their optimum operation, NPUs require the execution of a new type of neural models, namely spiking neural networks (SNNs). Inspired by this, in this paper, we present a wireless network architecture that enables CSI acquisition, translation into mobile user position information, and beamforming adaptation through novel convolutional SNN (CSNN) models. To train and assess the models' performance, we created datasets based on realistic ray-tracing-based simulations. We applied the CSNN architecture and compared its performance against fingerprinting k-NNs, and CNNs in terms of both computing- and communication-tailored performance metrics. The results highlight a trade-off between EE and user positioning accuracy.
Read the full abstract
Computer Vision
MobileVLA-R1 2.0: RL-Enhanced Reasoning for Mobile Robot Control
Grounding natural-language instructions into reliable and executable actions remains a fundamental challenge for vision-language-action (VLA) systems on mobile robots, due to the persistent gap between high-level semantic reasoning and low-level locomotion and manipulation control. Existing approaches often rely on implicit reasoning or monolithic action prediction, making it difficult to maintain coherent long-horizon decision making while producing precise and adaptable robot actions. To address this challenge, we propose MobileVLA-R1 2.0, an RL-enhanced VLA framework that explicitly couples structured embodied reasoning with executable mobile robot control. The framework learns multi-granularity reasoning over embodied trajectories through supervised Chain-of-Thought (CoT) alignment and reinforcement learning, improving reasoning-to-action consistency beyond purely behavioral supervision. To support both locomotion and manipulation, we further introduce a reasoning-conditioned action decoder that maps multimodal reasoning representations to task-level action targets, which are subsequently translated into embodiment-specific commands by robot controllers. This design provides a unified perception-reasoning-action interface while decoupling high-level action generation from robot-specific actuation. We conduct extensive evaluations on language-guided navigation, quadruped control, and humanoid mobile manipulation, covering VLN-CE, QUARD, and real-world deployments on Unitree Go2 and G1 robots. MobileVLA-R1 2.0 consistently outperforms strong VLA baselines, achieving an average 1.6 point improvement in SR on VLN-CE and a 10.0 point improvement in full-task success on real-world G1 mobile manipulation tasks over MobileVLA-R1, while demonstrating robust long-horizon instruction following and closed-loop execution across different robotic platforms.
Read the full abstract
Cryptography and Security
It is Not Yet Another Tool: Creating and Deploying an Agentic AI Companion in a Security Operations Center
Security Operations Centers (SOCs) process large amounts of tickets, most of which are low-interest events not worthy of further investigation. The repetitive nature of this task and similarity of the vast amounts of tickets make it a prime candidate for generative AI-based automation. We created and deployed an agentic AI companion utilizing large language models through fieldwork within a SOC for over one year. The design of the SOC AI companion was driven by researchers' participation and interactions within the SOC's daily work. SOC analysts were invited to use it during the last four months of the fieldwork. We analyzed the analysts' usage of the companion and found that in more than 90% of the cases the companion's outputs were reused by analysts in the ticket's closing report. Our results showed that when designed "in the trenches" with the intended users, a SOC AI companion can go beyond being yet another tool, but rather a system that co-evolves with its human users as it traverses through the various types of workloads. Analysts naturally started to shape the AI companion's behaviors to fit their particular needs. Our data show that the more human analysts shape the AI companion's behaviors, the more they become comfortable trusting the output from the AI system, resulting in improved productivity.
Read the full abstract
Quantum Physics
Effects of Trotter Error, Digitization Error, and Initial State Overlap on Tapered Quantum Phase Estimation for Minimum Eigenvalue Computation
We numerically implement full quantum circuits of optimal tapered Quantum Phase Estimation (in the form of an implementable approximate bandwidth-limited DPSS taper) for the purpose of minimum eigenvalue computation, where the Hamiltonian time-evolution unitary is implemented using standard Trotterization, and the taper state is constructed using an optimized bandwidth-limited taper. We illustrate, on representative quantum Hamiltonians, with tractable exact classical numerical quantum circuit simulations, how tapered QPE performs with respect to optimal phase sampling rate, absolute error, Shannon entropy of the optimal phase distribution, when the tQPE algorithm parameters are changed. Those algorithm parameters are Trotter error, finite sampling, imperfect initial states, total evolution time, and digitization error (number of phase qubits). The reported numerical experiments include up to $\ell=10$ phase qubits of precision with $m=3$ additional phase-register error suppression qubits, on a $4$-qubit Heisenberg quantum magnet model Hamiltonian, using up to 12th-order Trotterization. We numerically show i) the steady-state optimal phase sampling rate is determined by the initial state overlap with the ground-state, ii) with respect to phase sampling probability, or overall eigenvalue sampling error rate, there is no strong evolution time dependence for tQPE unless there is high Trotter error, iii) the approximated time-evolution unitaries in tQPE, like in standard QPE, can result in substantial ringing, which leads to non-physical eigenvalue estimates.
Read the full abstract
Category Theory
A new characterization of arithmetical categories and Pixley's theorem
We characterize the arithmetical categories - the exact Mal'tsev categories whose lattices of congruences are distributive - by a simple condition on some suitable pushouts and a finite limit: a regular category is exact arithmetical if and only if, for every triple of regular epimorphisms with common domain, the pairwise pushouts exist and the comparison morphism to the limit of the diagram they form is a regular epimorphism. For a regular category, the validity of this condition for pairs and for triples is equivalent to its validity for $n$-tuples for all $n \ge 2$, and characterizes arithmetical categories among regular ones. For pairs alone the condition reduces to the characterization of exact Mal'tsev categories among regular ones, due to Carboni, Kelly and Pedicchio. For $n$-tuples with $n \ge 4$ nothing further is obtained: arithmeticity is the third and last rung of that ladder. The proof rests on a categorical form of the Chinese Remainder Theorem; in the exact Mal'tsev context this form of the theorem lies close to results of Hoefnagel on majority categories. As a direct application, we give a new proof of Pixley's characterization of arithmetical varieties using a suitable diagram of free algebras.
Read the full abstract
Functional Analysis
A Counterexample to Horn's Coincidence Conjecture
Horn conjectured that whenever $K$ is a nonempty compact convex subset of a Banach space and $F,G:K\to K$ are continuous commuting maps, there exists $x\in K$ such that $F(x)=G(x)$. We give a counterexample in a separable Hilbert space. The construction uses an exactly commuting ladder of coincidence-free maps between finite trees, due to Oversteegen and Rogers.
Read the full abstract
Strongly Correlated Electrons
Magnetization processes and spin dynamics across field-induced phase transitions in the quasi-two-dimensional quantum magnet Cu$_2$(OH)$_3$Br
We present magnetic-field-dependent evolution of magnetization and spin dynamics in the quasi-two-dimensional spin-$1/2$ magnet $\mathrm{Cu_2(OH)_3Br}$, consisting of alternately coupled ferromagnetic Cu1 and antiferromagnetic Cu2 spin chains. Terahertz spectroscopy reveals a pronounced field-direction dependence of the low-energy magnetic excitation spectrum. For magnetic fields applied perpendicular to the spin chains, $B\parallel a$ and $B\parallel c^*$, the spectra undergo abrupt reconstructions at the spin-flop transitions identified independently by high-field magnetization measurements. For $B\parallel b$, by contrast, no spin-flop occurs; instead, the excitation spectrum evolves continuously with field and exhibits a strong terahertz radiation polarization dependence as the ferromagnetic Cu1 subsystem becomes progressively polarized. At higher fields, the complex low-field spectrum is replaced by a reduced set of broad excitations, consistent with a weakening of the coupling between the ferromagnetic and antiferromagnetic chain subsystems. Complementary Raman spectroscopy resolves magnon and spinon excitations alongside several phonon modes and traces the characteristic temperature- and magnetic-field-dependent evolution of the magnetic excitations. The combined spectroscopic and magnetization results map out how a magnetic field reorganizes the coupled ferromagnetic and antiferromagnetic subsystems in $\mathrm{Cu_2(OH)_3Br}$ across field-induced phase transitions.
Read the full abstract
Computer Vision
VDiff-Bench: A Challenging Benchmark for Fine-Grained Image Difference Identification
Multimodal Large Language Models (MLLMs) perform strongly on general visual understanding tasks such as visual question answering, yet they often struggle with a basic comparative skill: identifying what has changed between two similar images. We introduce VDiff-Bench, a challenging multiple-choice benchmark for fine-grained Image Difference Identification. VDiff-Bench contains 1,756 four-way questions over image pairs and covers 10 change categories: position, motion, regional image color, overall image color, appearance/disappearance, noise/resolution, texture, substitution/size, OCR/text, and illumination. Each question corresponds to two image inputs with 4 choices: the true difference, two hard negative descriptions, and a "no difference" distractor. To make the task challenging, we specifically curate ground-truth-conditioned negatives that require models to distinguish the actual change from nearby semantic alternatives. Experiments with 11 state-of-the-art open- and closed-source MLLMs show that fine-grained visual comparison remains brittle: models exhibit uneven performance across sources and change categories, with persistent failures on subtle low-level changes like noises and textures. For instance, three 7-8B-scale open-source MLLMs score 52.5-70.6% on semantic changes but only 8.7-33.3% on low-level changes like noise and texture, falsely assuming no changes between two image inputs. Surprisingly, despite strong performance of other closed-source commercial models, Grok 4.3 demonstrate remarkable performance drop on identifying noise and texture differences between images, falling significantly behind large open-source models like Kimi K2.5 and K3. Overall, VDiff-Bench provides a targeted diagnostic for evaluating comparative visual understanding in MLLMs, exposing failures that are not captured by standard single-image vision-language tasks.
Read the full abstract
Information Theory
Rank and classification of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes
The $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-additive codes are subgroups of $\mathbb{Z}_2^{\alpha_1}\times\mathbb{Z}_4^{\alpha_2}\times\mathbb{Z}_8^{\alpha_3}$. A $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard code is a Hadamard code which is the Gray map image of such a code. A recursive construction of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-additive Hadamard codes $\mathcal H^{t_1,t_2,t_3}$, with all $\alpha_i\neq0$, $t_1\geq1$, $t_2\geq0$, and $t_3\geq1$, is known, as are the linearity and kernel of the corresponding codes $H^{t_1,t_2,t_3}$ of length $2^t$. Their rank, however, was not known in closed form. In this paper, we determine $rank(H^{t_1,t_2,t_3})$ for every admissible triple and obtain an explicit closed formula. The proof computes the dimension of the space spanned by the binary coordinate functions of the code, viewed as Boolean functions of the binary digits of the message. We then use the rank formula, together with the known kernel dimension, to classify the family as far as these two invariants allow. The only pairs of distinct types of the same length sharing both invariants are $\bigl(H^{1,2,t-6},H^{2,0,t-5}\bigr)$ for $t\geq7$ and $\bigl(H^{2,2,t-9},H^{3,0,t-8}\bigr)$ for $t\geq10$. Consequently, the number of distinct pairs $(r,k)$ among the codes of length $2^t$ is $\lfloor(t^2+6)/12\rfloor$ for $3\leq t\leq6$, $\lfloor(t^2+6)/12\rfloor-1$ for $7\leq t\leq9$, and $\lfloor(t^2+6)/12\rfloor-2$ for $t\geq10$. Thus, rank and kernel dimension classify the family completely if and only if $3\leq t\leq6$. We also determine all coincidences with the $\mathbb{Z}_4$-, $\mathbb{Z}_2\mathbb{Z}_4$-, and $\mathbb{Z}_8$-linear Hadamard codes of the same length: there is exactly one infinite family with the first two, namely $H^{2,1,t-7}$ and $H^{5,t-9}$ for $t\geq10$, and exactly five families with the $\mathbb{Z}_8$-linear codes.
Read the full abstract
Numerical Analysis
Weighted Laplace Spaces for Spectral Measures and Rational Approximation
We introduce the weighted Laplace space $H_w$, an RKHS of Laplace transforms on $(0,\infty)$, and study spectral measures in its dual space $H'_w$. For conforming FEM discretizations of the Dirichlet Laplacian on bounded Lipschitz domains, we prove the dual-norm inequality $\|\mu_h\|_{H'_w} \leq \|\mu\|_{H'_w}$, where $\mu = \sum_k\delta_{\lambda_k}$ and $\mu_h = \sum_k \delta_{\lambda_{k,h}}$. The proof combines min-max monotonicity of FEM eigenvalues with a heat-trace representation of the dual norm. We then analyze $H_w$-adapted rational approximation of shifted symbols $\phi(x)=(x+\kappa^2)^{-\beta}$ and give a conditional transfer principle for estimates proved in the corresponding weighted Laplace pre-image norm. Via dual pairing, the norm inequality yields uniform bounds for finite spectral sums and related transformed observables.
Read the full abstract
Networking
Task-Oriented Semantic Communication for Hazard Warning and Remote Operation in Connected Vehicle Platoons
Connected and automated vehicle platoons require reliable dissemination of task-relevant hazard information to enable appropriate downstream responses, with unresolved situations additionally requiring remote human intervention. However, the limited channel bandwidth of V2X communication makes high-volume sensor data transmission challenging, motivating the exchange of only task-relevant information rather than raw sensor data. This paper proposes an integrated semantic and task-oriented communication framework for cooperative hazard response and remote operation in automated vehicle platoons. The framework combines onboard instance segmentation and monocular depth estimation for task-oriented hazard decision-making with Stable Diffusion Variational Autoencoder (SD-VAE)-based semantic scene compression. Task-relevant hazard information and the compact semantic representation are jointly disseminated through a broadcast-based Emergency Semantic Message (ESM) over the existing V2X protocol stack. Evaluation demonstrates that SD-VAE consistently outperforms JPEG and JPEG 2000 on task-relevant reconstruction metrics, exhibiting graceful degradation rather than a sharp cliff effect under low-SINR conditions, demonstrating its feasibility for remote scene reconstruction when human intervention is required. Moreover, an extensive campaign of 7,290 simulation runs shows a low overall inter-vehicle collision rate of 0.99%, with collisions occurring mainly under extreme high-speed and short-gap conditions.
Read the full abstract
Algebraic Geometry
Tropicalization of Fock's inverse spectral transform
The dimer spectral transform gives algebro-geometric action-angle coordinates for cluster integrable systems. Fock gave an explicit formula for its inverse. We study Fock's inverse map in the tropical limit where Harnack spectral curves degenerate to nodal curves. We determine the leading order asymptotics of the classical objects appearing in Fock's formula and show that they are governed by their tropical counterparts. This yields a tropical inverse spectral transform on tropical spectral data. We show that Fock's inverse spectral transform commutes with tropicalization, and also derive a tropical version of Fay's trisecant identity.
Read the full abstract
Classical Analysis and ODEs
Exact Asymptotics of the Multidimensional Nikolskii Constant
We prove the exact asymptotics of the multidimensional normalized $L^1$ Nikolskii constant \[ \mathcal L^*(d)=\Bigl(\frac{\pi}{2}+o(1)\Bigr)2^{-d}, \quad d\to\infty. \] In addition, for each fixed dimension we obtain asymptotics for the positive zeros of the extremal function $\varphi_d$, and determine their limiting distribution as $d\to\infty$. The lower bound follows from the construction of an admissible function and its asymptotic analysis. For the upper bound, we represent $x^{d+1}\varphi_d(x)$ as the product of two solutions of the equation $u''+V_d(x)u=0$, compare this equation with a Bessel model, and analyze relative canonical products.
Read the full abstract
Astrophysics of Galaxies
Connecting the little dots in polarized light
Recent observations of the local Little Red Dot (LRD) analog SDSS~J1025+1402 have revealed that the optical continuum is polarized at the ~1.5% level, while broad Halpha has lower polarization (~0.7%) and a different polarization angle. We explain these properties in a scenario in which LRDs are dust-obscured Little Blue Dots (LBDs) viewed at high inclination and powered by super-Eddington accretion. In this framework, electron scattering in the geometrically thick inner accretion flow produces intrinsic continuum polarization, while unpolarized emission from the outer thin disk dilutes the signal, particularly at optical wavelengths. A circumnuclear dust screen contributes dichroic polarization to both the continuum and broad-line emission. Broad Halpha lacks the intrinsic disk component and therefore has lower polarization and a different position angle. We show that this model quantitatively reproduces the observed polarization properties, although degeneracies between accretion rate and inclination remain. These results illustrate the potential of spectropolarimetry as a probe of accretion-flow geometry and orientation in the little-dot population, complementary to spectral-energy-distribution fitting and line diagnostics.