Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Tuesday 8 September

Numerical Analysis

Compact implicit high-resolution numerical scheme for multicomponent transport problems with Langmuir sorption

We present a compact implicit high-resolution finite volume scheme for one-dimensional multicomponent transport problems with nonlinear Langmuir sorption. The method combines a second order compact implicit discretization with WENO reconstruction and a time limiter for the treatment of steep gradients and discontinuities. A special attention is given to the Courant number used in the limiter, where local characteristic Courant numbers based on the eigenvalues of the inverse retardation matrix are considered. The compact implicit schemes are compared with analogous explicit first and second order methods. Numerical experiments show second order convergence for smooth solutions and demonstrate that the implicit approach can be used with significantly larger Courant numbers. The method is also applied to a three-component displacement chromatography problem with sharp concentration fronts.
Read the full abstract

Combinatorics

Nonexistence of a Strongly Regular Graph with Parameters (266,45,0,9): A Certificate-Free Lean Proof

We prove that no strongly regular graph with parameters $(266, 45, 0, 9)$ exists. The proof is formalized in Lean 4 and Mathlib without external infeasibility certificates or assumed classification theorems. A hypothetical graph gives a rank-$12$ integral Gram lattice with an integral centroid. A Lorentzian change of form, a marked $D_7$ gluing, and an explicit rank-six complement produce a positive-definite even unimodular lattice of rank $24$, together with the original indexed family of $220$ vectors. Harmonic theta identities and a root-isolation inequality force the root system $A_{11} \perp D_7 \perp E_6$. First and second moments then exclude the possible complements: the final case reduces to an impossible binary projection identity $4x + 4y - 2z = 50$. A type-$A$ subcase is closed by a separate classification-free proof of the known nonexistence of a quasi-symmetric $2$-$(56, 12, 9)$ design with intersections $0, 3$. That argument constructs a Krein graph and forces a Steiner $3$-$(12, 4, 1)$ design, contradicting its replication equation. The formal theorem depends only on the three standard Lean axioms and has also been checked independently with nanoda. The archived formalization is release v2.0.0.
Read the full abstract

Software Engineering

AttnCompress: Dynamic Attention-Guided Trajectory Compression for Software Engineering Agents

The transition from human-centric assistance to Autonomous Software Engineering (ASE) agents has enabled the resolution of complex real-world SE tasks. However, the trial-and-error nature of these agents generates lengthy interaction trajectories, creating severe bottlenecks in terms of context window limits and cost. While context compression offers a potential remedy, prior approaches suffer from static pruning strategies and granularity mismatches, often failing to preserve the semantic dependencies and syntactic details crucial for SE tasks. To strictly preserve critical task evidence while reducing context length, we introduce AttnCompress, a dynamic attention-guided trajectory compression framework. Unlike existing approaches, AttnCompress bridges the gap between semantic integrity and dynamic adaptability through three key mechanisms: (1) structure-aware segmentation via perplexity (PPL) spikes to preserve the syntactic structure of code and logs; (2) relevance estimation using proxy attention weights to quantify the precise relevance of historical blocks to the agent's current reasoning; and (3) a dynamic rolling window to re-evaluate and recall historical context as the task evolves. Extensive evaluation on SWE-Bench-Verified and Multi-SWE-Bench demonstrates that AttnCompress achieves a pass rate of 53.17%, outperforming prior state-of-the-art baselines while reducing token consumption by 21.6% and total costs by 33.6%. The framework proves to be model-agnostic and generalizes effectively across diverse programming languages.
Read the full abstract

All authors Zhengran Zeng, Yixin Li, Rui Xie, Wei Ye, Shikun Zhang

Computer Vision

Supervised Cross-Modal Feature Alignment for Zero-Wearable Freezing of Gait Detection in Parkinsonism

Objective assessment of Freezing of Gait (FoG) in Parkinson's disease (PD) relies predominantly on wearable Inertial Measurement Units (IMUs). While IMUs provide optimal kinematic precision, mandatory sensor attachment restricts continuous clinical deployment. Conversely, unobtrusive vision-based alternatives suffer substantial classification errors during turning-in-place tasks, where geometric self-occlusion degrades deterministic skeletal coordinates and obscures the high-frequency precursors required for FoG detection. To resolve these physical observation limits, we propose a supervised cross-modal subspace distillation framework. During optimisation, pre-trained kinematic data from IMU sensors and contextual clinical metadata act as oracles to guide a deployable visual architecture. By incorporating joint velocity and acceleration derivatives, utilising a confidence-based gating mechanism, the visual model mitigates some of the tracking errors during occlusion events. Empirical evaluations confirm this latent alignment transfers the predictive fidelity of hardware sensors directly into the visual representation, yielding $85.5\%$ accuracy, and $82.4\%$ balanced accuracy. All the while maintaining a vision only model at inference.
Read the full abstract

Computer Vision

From Glance to Scrutiny: Progressive Distortion Reasoning for Fine-Grained Image Quality Assessment

Multi-modal large language models (MLLMs) have demonstrated significant potential in image quality assessment (IQA) by bridging visual perception with descriptive evaluations. However, existing approaches mainly focus on holistic quality prediction, often functioning as black boxes that provide limited insight into where distortions occur and how they affect perceived quality, hindering fine-grained analysis of localized and heterogeneous degradations. We propose GS-IQA, a framework that reformulates IQA as a progressive Where–What–How diagnosis, emulating the human perceptual process from an initial glance to closer scrutiny. Since a severity judgment is meaningful only for a correctly localized and recognized region, we realize this progression through a two-stage reinforcement learning paradigm that respects such dependencies: the glance stage uses a perception-gated reward to establish where degradations lie and what they are, activating severity feedback only once both are correct, while the scrutiny stage introduces online reward-conditioned degradation generation to synthesize hard examples targeted at the model's perceptual bottlenecks, sharpening its discrimination of subtle severity variations. To enable systematic evaluation, we construct Diag-Bench, a region-level IQA benchmark of about 25K curated samples spanning 12 distortion types and five ordinal severity levels. Extensive experiments show that GS-IQA consistently surpasses state-of-the-art methods in distortion localization, recognition, and severity estimation, and that its diagnostic representations transfer effectively to conventional global quality prediction across diverse external benchmarks. Code and data will be released.
Read the full abstract

All authors Aoting Zhang, Mingze Gao, Dongbao Yang, Longyi Chen, Daoxin Zhang, Yi Wu, Yao Hu, Yu Zhou

Combinatorics

Spectral characterization of the uniform theta graph $\Theta(t,2)$ and classification of 6-periodic Grover walks

We characterize the uniform theta graph $\Theta(t,2)$ by the spectrum of its normalized adjacency matrix, or equivalently, by the spectrum of its normalized Laplacian matrix. We also investigate the periodicity of Grover walks on nonregular graphs, which is closely related to the eigenvalues of the normalized adjacency matrix and those of the time evolution matrix of the Grover walk. We show that the Dutch windmill graph $D_n^{(t)}$ is $2n$-periodic and that the uniform theta graph $\Theta(t,n)$ is $(2n+2)$-periodic. Furthermore, we completely determine the connected $6$-periodic graphs and prove that they are precisely $D_3^{(t)}$ with $t \geq 2$ and $\Theta(t,2)$ with $t \geq 1$.
Read the full abstract

Rings and Algebras

A polynomial criterion for Jordan elements in a free associative algebra

Let $J$ be the Jordan subalgebra of the free associative algebra $\Q\langle X\rangle$ generated by $X$ and $1$ under $a\cdot b=\tfrac12(ab+ba)$. We give a polynomial criterion for an associative polynomial to belong to $J$. For every $n\ge1$, Robbins' recursion gives a family of operators $T_\alpha\in\Q[S_n]$, indexed by compositions of $n$ into parts $1$ and $2$. We prove that right multiplication by $U_n=\sum_\alpha T_\alpha^\dagger T_\alpha$ has image $\SJ(n)$, the space of multilinear Jordan elements. If its characteristic polynomial is $t^{e_n}q_n(t)$, where $q_n(0)\ne0$, then $\Pi_n=I-q_n(U_n)/q_n(0)$ is an idempotent and $f\in\SJ(n)$ if and only if $fq_n(U_n)=0$, or equivalently $f\Pi_n=f$. The same operators give the criterion for arbitrary homogeneous polynomials of degree $n$. We also prove $\SJ(n)\cong\bigoplus_{\lambda\vdash n}r_\lambda S^\lambda$, where $r_\lambda=\rank\rho_\lambda(U_n)$. Thus $\dim\SJ(n)=\sum_\lambda d_\lambda r_\lambda$ and $e_n=\sum_\lambda d_\lambda(d_\lambda-r_\lambda)$, with $d_\lambda=\dim S^\lambda$. We give a recursion for the corresponding row spaces and use it to compute the multiplicities over $\Q$ through degree $12$. Exact block characteristic polynomials through degree $7$ and direct computations in small degrees illustrate the criterion.
Read the full abstract

Numerical Analysis

A discontinuous finite element method for the hydroelastic analysis of submerged structures

This paper develops a finite element method for wave-structure interaction problems arising in the hydroelastic modelling of submerged elastic plates. The approach is formulated for both two-dimensional settings and three-dimensional channels. For the fluid part of the problem, we use a symmetric discontinuous Galerkin scheme that captures the discontinuity in the potential across the plate. To impose the Sommerfeld radiation conditions, we take inspiration from the Dirichlet-to-Neumann map approach and use the analytic solution in the semi-infinite domains to construct appropriate non-local boundary conditions. For the plate, we use a continuous/discontinuous Galerkin method to resolve the 4$^{\rm th}$ order operator without using continuously differentiable finite elements. We prove well-posedness of the method, showing that the resulting sesquilinear form is bounded and satisfies the Gårding inequality, leading to a unique and stable solution. We implement our formulation as an open-source tool using the Gridap package in Julia. We validate our method against a hypersingular boundary integral method, finding excellent agreement. The flexibility of the methodology is demonstrated through simulations of a two-dimensional slanted plate and three-dimensional plate geometries including centred rectangular plates, offset rectangular plates, and annulus-shaped plates. The finite element method presented here can be readily applied to model wave energy conversion of piezoelectric bimorphs. Furthermore, the method could easily be extended to consider wave scattering from fixed or rigid structures or from variable bottom topography, and is not limited to hydroelastic applications.
Read the full abstract

All authors Zachary J. Wegert, Oriol Colomés, Michael H. Meylan, Ngamta Thamwattana, Vivien J. Challis

Information Theory

Non-Coherent Over-the-Air Federated Learning: Protocol, Convergence, and Device Scheduling

To mitigate the scalability bottleneck in the radio access network (RAN) in federated edge learning (FEEL), over-the-air federated learning (AirFL) exploits waveform superposition over multiple-access channels (MACs) for analog model aggregation. However, coherent AirFL typically relies on stringent PHY-layer conditions such as accurate channel state information (CSI), tight time/frequency synchronization, and frequent transceiver calibration for signal alignment. However, these requirements, if not impossible to be met, incur substantial communication and computation overhead. In this paper, we propose a non-coherent AirFL (NCAirFL) protocol over a broadband single-antenna MAC, leveraging binary dithering, unbiased non-coherent detection, and long-term error feedback to waive the need for instantaneous CSI. For NCAirFL with general smooth non-convex objectives and a constant learning rate, we establish a convergence bound achieving the convergence rate in the same order of $\mathcal{O}(1/\sqrt{T})$ as communication-ideal FedAvg, where $T$ is the total number of communication rounds. To further improve communication efficiency under data and wireless resource heterogeneity, we also derive a lower bound on the expected single-round objective decrease in the global loss conditioned on device scheduling, building upon which a surrogate objective function is obtained for jointly optimal device selection and power control. Experimental results on MNIST and CIFAR-10 corroborate that NCAirFL achieves learning performance close to FedAvg in practical settings, with the proposed device scheduling policy substantially accelerating convergence.
Read the full abstract

All authors Haifeng Wen, Nicolò Michelusi, Osvaldo Simeone, Yang Yang, Hong Xing

Human-Computer Interaction

StitchOver: Technical Embroidery on Seamed Fabrics

Smart textiles embed interactivity into everyday garments, supporting use cases like always-available sensing for medical applications or sports. Machine embroidery allows integrating functionalities into existing textiles. However, embroidering onto real-world textile goods remains challenging. Textile goods are rarely made of a single homogeneous substrate of fabric, and embroidery with functional materials such as conductive threads requires machines to be more tightly calibrated than for decorative embroidery. In particular, seams, which bring together different substrates, along with machine variability, cause shifts in tension and friction between the functional thread and the textile substrate that frequently lead to defects (70% of samples in our evaluation). We present a technique to reliably embroider on seamed fabric even when using functional threads. Our software tool automatically digitizes user-defined stitch patterns by introducing what we call "JumpStitches" to bypass seam interference. We evaluated our approach under varying machine states (under-tensioned, well-calibrated, and over-tensioned), and across multiple seam and pattern configurations. Our results show that the JumpStitch mechanism eliminates defects, while maintaining conductivity compared to 70% defects without JumpStitches, and even in poorly calibrated machine states continues to work well.
Read the full abstract

All authors Zekun Chang, Tianhong Catherine Yu, Yixuan Gao, Thijs Roumen

Information Retrieval

Exploring Bottom-Up Clustering for Creating Semantic IDs

The success of generative retrieval has largely been attributed to the use of Semantic IDs, which improve over arbitrary item-level identifiers such as hashes by capturing the semantics of items. The main challenges faced when constructing Semantic IDs, however, is in mapping each identifier to a unique product and capturing information valuable to downstream tasks. Past works have appended additional codewords to de-duplicate item identifiers and utilized residual quantization to create hierarchical clusters. In this work, we present an algorithm for generating Semantic IDs that ensure the identifiers are both unique and preserve the structure of the original embedding. Key to our work is the use of bottom-up clustering to preserve local structure in the embedding space, improving the clustering quality of the resulting Semantic IDs and their utility for downstream generative retrieval.
Read the full abstract

All authors Leah Woldemariam, Sudhanshu Garg, Taha Belkhouja, Charles Kim-Yip, Ali Sahami

Spectral Theory

Spectral asymptotics of sub-Riemannian Laplacians on compact Heisenberg manifolds

Let \(N_M(\lambda)\) be the spectral counting function of the sub-Laplacian on the compact Heisenberg manifold \(M=\Gamma\backslash\mathbb H_d\), where $\Gamma$ is a lattice subgroup of the Heisenberg group $\mathbb H_d$. In 2016, Strichartz \cite[J. Geom. Anal.]{Str16} proved the Weyl law with remainder \(R_M(\lambda)=N_M(\lambda)-A_d\operatorname{vol}(M)\lambda^{d+1} = O_M(\lambda^d\log\lambda)\), and conjectured the optimal remainder to be \(O_M(\lambda^d)\). In this work, we establish a new upper bound and the first two-sided lower bounds $$ R_M(\lambda)=O_M\!\left(\lambda^d(\log\lambda)^{2/3}\right), \qquad R_M(\lambda)=\Omega_{M,\pm}\!\left(\lambda^d\log\log\lambda\right). $$ As a result, this implies that the sharp polynomial order is $d$, and disproves Strichartz's conjecture.
Read the full abstract

Probability

Subcritical limits of a 1D KPZ growth surface with finite moments

We consider the one-dimensional random growth surface introduced by Adhikari and Chatterjee [AC24], where the height function is defined recursively via the heights at two neighboring sites and an independent noise term at each space-time point. In the subcritical regime, assuming uniformly bounded eighth moments of the noise variables and appropriate regularity of the driving function, we establish convergence in law of the suitably rescaled height function to the solution of the additive stochastic heat equation. Our approach employs a direct recursive renormalization scheme. A central component is a graph representation of the renormalization terms, which enables the derivation of the high-moment bounds essential to the renormalization procedure.
Read the full abstract

All authors Dang-Zheng Liu, Fangzhou Luo, Tian Wu, Yuxuan Zong

Distributed Computing

A Measurement Study of LLM Inference Trade-offs Across Edge Continuum Hardware

Large language models (LLMs) are increasingly used as backends for intelligent web services, but serving them across the edge continuum requires balancing quality, latency, model footprint, and energy. This paper presents a controlled measurement study of self-hosted LLM inference across edge and near-edge deployment nodes: an NVIDIA Jetson AGX Orin and a near-edge server with CPU-only and GPU-enabled inference modes. We evaluate multiple open-weight LLMs and quantization variants using a fixed question-answering workload, and compare them against GPT-4o as a cloud-hosted accuracy and latency reference. Our benchmarking pipeline reports accuracy, model footprint, per-token decoding latency, prefill latency, and overall execution energy. The results show that GPU-enabled server execution provides the lowest compute-side latency, while Jetson Orin shows lower measured energy, consistent with its lower platform power under our setup. CPU-only execution is consistently dominated in latency for our workload and shows higher measured energy. We also show that parameter count and downloaded weight-file size alone do not reliably predict observed accuracy or latency. Finally, using Pareto-frontier analysis, we study how deployment decisions may change under possible streamed-token delivery overheads, highlighting that compute-side inference metrics alone can lead to suboptimal placement for latency-sensitive interactive web services.
Read the full abstract

All authors Maysam Khatib, Moysis Symeonides, Demetris Trihinas, George Pallis, Marios D. Dikaiakos

Cryptography and Security

HoneyRoute: Honeypot-Model Routing for Adversarial LLM Serving

We introduce HoneyRoute, an inference-serving layer that detects whether an incoming request is malicious and, if so, routes it to a dedicated honeypot model, shielding production while the adversary's interaction is continuously harvested for intelligence. Existing defenses embed traps inside model memory or rebuild deception at the protocol layer, leaving the serving tier unprotected and feeding nothing back into detection. HoneyRoute couples (i) a streaming router (a frozen 0.8B-embedding backbone with per-domain MLP heads), (ii) a dual-implementation honeypot (a rule/prompt-engineered code honeypot or a dedicated same-family replica), and (iii) an analysis loop that converts trapped interactions into attacker fingerprints for router retraining. On a production trace plus a seven-domain attack corpus, the router reaches F1=.911 at 38 ms median added latency, matching 96% of a two-tier guard-LLM cascade's F1 at 1/385 of its latency with 0% evasion under 13 adversarial transformations; diverting the malicious share cuts production-model token consumption under concurrent flooding with real GCG-suffix payloads by 97.8%; the trained replica agrees with the production model on 92.9% of benign holdout requests, while naive unconditional bait injection collapses to 7.6% and selective camouflaged injection recovers to 88.9%, mapping the recoverable fidelity-traceability frontier; and a loop-trained correction head cuts misrouting of legitimate security research 9x while raising detection F1 to .933.
Read the full abstract

Computer Vision

FPicker: Topology-Guided Evolution for Filament Tracing in Low-SNR Microscopy

Automating filament tracing in Cryo-Electron Microscopy (Cryo-EM) is essential for 3D helical reconstruction but challenged by intersecting topologies and extremely low Signal-to-Noise Ratios ($\text{SNR} = \sigma_s^2/\sigma_n^2$ < 0.1 or -10 dB). Existing paradigms fail: pixel-wise segmenters suffer from severe topological fracturing, box-based detectors face ghost center drift, sequential trackers derail due to error accumulation, and traditional active contours collapse under artificial closed-curve constraints. To resolve these bottlenecks, we present FPicker, the first topology-guided framework reconciling these incompatibilities. It unifies perception via a center-endpoint representation and an open-curve evolution module to explicitly model non-cyclic connectivity. On simulated benchmarks, FPicker outperforms top baselines by over $40\%$ relative gain in mean spatio-angular precision (mSAP) and reduces topological gap rates by over $60\%$ under extreme noise ($-20\text{ dB}$). By learning intrinsic physical geometry rather than local texture, FPicker demonstrates strong potential as a resilient geometric backbone. Its zero-shot performance on the real-world EMPIAR dataset exhibits robust topological resistance, achieving a state-of-the-art 82.9% mSAP upon fine-tuning. Our results also suggest modeling physical priors is a highly robust path toward bridging the sim-to-real gap in signal-starved scientific imaging. The code is publicly available at: https://github.com/tomzhaosky/FPicker.
Read the full abstract

General Relativity and Quantum Cosmology

Particle Dynamics and Thermodynamics of a Charged-Like Hairy Black Hole in Extended Gravitational Decoupling

This work focuses on the analysis of particle dynamics and the thermodynamic properties associated with a particular branch of hairy black hole solutions. These solutions are obtained by using extended geometric deformation gravitational decoupling on the seed solution of the Schwarzschild solution. This resulting geometry satisfies the dominant energy condition and the condition $Q^{2}=2\chi\ell M$. We analyze the motion of massive particles and photons in this geometry and the thermodynamics of this solution. In particular, for massless particles, we study the effective potential and determine the radii of the photon sphere and the shadow of the black hole. For massive particles, we calculate the specific energy and angular momentum of circular orbits, the ISCO, the radiative efficiency of an accretion disk, and representative particle trajectories. Finally, we investigate the thermodynamic properties of this hairy black hole geometry, including the Hawking temperature, the Bekenstein-Hawking entropy, and the heat capacity in the fixed-$(Q,\ell)$ ensemble.
Read the full abstract

All authors M. Zeeshan Gul, Ahmad Al-Badawi, J. Andrade, Sadia Zahid

Computer Vision

TRIUNE-Net: Harmonizing Scale, Shape, and Efficiency in Pancreatic Tumor Segmentation

Pancreatic tumor segmentation in 3D CT volumes is challenged by extreme scale variability across both the pancreas and tumor, and highly irregular tumor morphology. While recent advances have pushed segmentation performance, existing methods do not explicitly address these challenges and come at the cost of excessive computational complexity, limiting their practicality in resource-constrained clinical environments. We propose TRIUNE-Net, a lightweight unified architecture that harmonizes scale, shape, and efficiency through three synergistic innovations. A multi-scale context aggregation module with stage-adaptive dilated convolutions enables the model to reason across the broad range of anatomical scales present in both organs. A serial linear-deformable attention mechanism combines large effective receptive fields with shapeadaptive deformable convolutions to capture irregular, non-convex tumor morphologies. Finally, an information-preserving downsampling module replaces conventional max pooling entirely, retaining all spatial information while adding negligible parameters, preventing small tumors from being discarded before they can be recognized. On both the MSD Pancreas and NVD Pancreas datasets, TRIUNE-Net achieves state-of-theart results with only 5.86 M parameters and no external pre-training, outperforming all baselines across all key tumor metrics. Specifically, it surpasses the next-best model by 0.45% in tumor Dice, 6.0 points in F1 score, 6.6 points in sensitivity, and 3.4 points in precision, simultaneously reflecting its ability to suppress both missed tumors and false alarms in clinically realistic conditions. Our code is available at: https://github.com/abdora-ai/TRIUNE-Net
Read the full abstract

All authors Amir Hossein Saleknia, Alireza Kheyrkhah, Sanaz Karimijafarbigloo, Reza Azad, Sina Houshmand, Ulas Bagci, Dorit Merhof, Alaa Sulaiman

General Relativity and Quantum Cosmology

Kerr-referenced analytical parametrization of rotating black holes in dynamical Chern-Simons gravity

Rotating black holes in dynamical Chern-Simons gravity are known nonperturbatively mainly through numerical solutions, which limits their direct use in strong-field applications. We construct a Kerr-referenced analytical parametrization of the near-general-relativistic numerical branch using a compact radial coordinate, low-order angular multipoles, and continued fractions. The resulting two-parameter family accurately reproduces the numerical metric throughout the validated weak-coupling and moderate-spin domain. Independent off-grid solutions confirm that the parametrization retains its accuracy away from the calibration set. We further assess the model through equatorial light rings, critical impact parameters, and full two-dimensional null-geodesic ray tracing without assuming separability. The resulting shadow observables closely match those obtained from the numerical geometries. This parametrization therefore provides a practical analytical metric for geodesic and strong-field calculations without relying on a slow-rotation expansion.
Read the full abstract

All authors Sardor Murodov, Bahodir Ahmedov, Bekzod Rahmatov, Javlon Rayimbaev, Bobomurat Ahmedov

Software Engineering

Agent ATO: Visualizing Agent Interaction Timelines from Logs

AI coding agents are becoming part of developers' workflows, but their behavior is difficult to understand from final code changes alone. During a task, agents interact with software repositories through sequences of actions such as searching for files, reading code, editing programs, and running tests or build commands. These interactions, together with token usage, are often recorded in console logs, but raw logs are difficult for developers to inspect. In this paper, we propose Agent ATO (Agentic Trajectory Observer), a tool for visualizing AI coding agent interaction timelines from console logs. Agent ATO extracts agent interactions, classifies them by command or tool type, and visualizes them as timelines. In addition to an all-interaction timeline, Agent ATO provides filtered timelines that emphasize file discovery, file reading, file editing, and execution while preserving surrounding context. We illustrate how Agent ATO may help developers inspect and compare agent actions using selected runs from two repair tasks. Future work will apply Agent ATO to more agents, tasks, and development environments, and will evaluate whether it reduces the effort needed to compare trajectories.
Read the full abstract

Computer Vision

Human-Centric Image Captioning with Subject-Centered Spatial Understanding

While multimodal large language models (MLLMs) achieve remarkable performance on generic image captioning, they frequently suffer from structural hallucinations in human-centric scenarios. Accurately modeling human subjects is foundational for critical downstream applications, such as accurate avatar/video/image generation and fine-grained human action understanding. However, these tasks require highly precise subject-centered spatial grounding, such as distinguishing egocentric left/right laterality and maintaining correct anatomical-object bindings. Although catastrophic for structural integrity, these localized spatial inversions are often overshadowed by overall descriptive metrics in existing benchmarks. To systematically expose and quantify this bottleneck, we introduce SPACE (Subject-centric Poses, Appearance, and Characteristics Evaluation), a benchmark designed to evaluate subject-centered spatial understanding. On SPACE, we reveal that despite strong generic perception, current MLLMs consistently fail to ground descriptions in the subject's intrinsic frame of reference. To bridge this gap, we propose a specialized data construction and alignment pipeline. We first extract structured spatial hints from fine-grained body-part localization to guide a two-stage caption rewriting process, yielding highly spatially-faithful training data. Furthermore, we design a rubric-based reward for Group Relative Policy Optimization (GRPO) that explicitly penalizes structurally critical spatial errors during alignment. Extensive experiments on SPACE demonstrate our framework significantly improves human-centric caption quality, particularly in subject-centered spatial reasoning, achieving performance competitive with strong closed-source models. Our benchmark and code are available at https://github.com/JHang2020/SPACE-Eval.
Read the full abstract

All authors Bozhou Li, Jiahang Zhang, Yue Ding, Yushuo Guan, Bohan Zeng, Yiyan Ji, Xinlong Chen, Yang Shi, Yifan Dai, Yuran Wang, Chengzhuo Tong, Pengfei Wan, Yuanxing Zhang, Wentao Zhang

High Energy Physics (Phenomenology)

Probing the $B^{0}$ meson in a hot medium with finite chemical potential

We employ QCD two-point sum rules to determine the $B^{0}$ meson mass and decay constant as functions of temperature $T$ and chemical potential $\mu$, using the perturbative spectral density and nonperturbative contributions up to mass dimension five. Numerical analysis indicates that, in the limits $T \to 0$ and $\mu \to 0$, the mass and decay constant of the $B^{0}$ meson are in good agreement with the available experimental data. Furthermore, at fixed chemical potentials, the $B^{0}$ meson mass and decay constant initially increase with temperature, reach their maxima, and then decrease to zero, with the increase being more pronounced for the decay constant than for the mass. The temperatures at which both quantities vanish decrease as the chemical potential increases. At fixed temperatures, both quantities initially increase slightly with chemical potential before decreasing and eventually vanishing, with the mass exhibiting a much weaker decrease in vacuum. The vanishing points of both quantities shift toward lower chemical potentials as the temperature increases, following a trend similar to that observed in the QCD phase diagram. The results obtained in this study are expected to contribute to the interpretation of data from ongoing heavy-ion collision experiments and to the generation of data for future planned experiments focusing on $B$ mesons, quark-gluon plasma signatures, and dense matter environments.
Read the full abstract

Geometric Topology

Knots, black holes, databases, and birthdays: Collision entropy of knot invariants

A knot invariant is a fingerprint shared by equivalent knots: unequal values certify inequivalence, while equal values may conceal different knots. Under two rooted random-diagram models, we prove that the incomplete normalized Alexander polynomial separates random pairs but collides in a growing database. If $D_n$ and $D_n'$ are independent $n$-crossing diagrams, then $\Pr\{\Delta_{K(D_n)}=\Delta_{K(D_n')}\}=O(n^{-1/2})$, and every fixed normalized Alexander polynomial is exponentially rare. With exponentially high probability, the diagram shadow contains linearly many disjoint opened-trefoil slots. Conditional on the shadow and exterior crossing signs, their indicators are independent Bernoulli$(1/4)$ variables whose sum is a binomial coordinate in the $3$-adic determinant valuation. Consequently, $\sup_{a\geq 1}\Pr\{\det K(D_n)=a\}=O(n^{-1/2})$. For a discrete invariant $I$, let $\alpha_n(I)=\Pr\{I(D_n)=I(D_n')\}$. Its collision entropy is $H_2(I(D_n))=-\log\alpha_n(I)$. An independent sample of size $M$ has $\binom{M}{2}\alpha_n(I)$ colliding pairs on average and birthday scale $\alpha_n(I)^{-1/2}$. If $M_n^2\alpha_n(I)\to\infty$, a repeated value occurs with probability tending to one even when $\alpha_n(I)\to0$. For the determinant, $M=o(n^{1/4})$ suffices for collision freedom with high probability; a matching lower bound is open. We also give exact finite-population formulas for fixed censuses, calculate the expected cost of invariant cascades, and relate collision probability to the frequency of calls to a complete equivalence procedure. On a balanced pair-classification benchmark, the normalized-Alexander rule has balanced accuracy $1-O(n^{-1/2})$ but cannot distinguish inequivalent pairs in one fiber.
Read the full abstract

All authors Pedro Olivares-Sánchez, Edison Jessie Vázquez Gordillo, Radmila Sazdanović, Carlos Alfonso Ruiz Guido, Aldo Guzmán-Sáenz, Renato Osvaldo Salmerón-García, Ramiro López-Vázquez, Ernesto Lupercio

Analysis of PDEs

Interior $W^{2,p}$ regularity for the sigma-$2$ equation

We prove that continuous $2$-convex solutions of the $\sigma_{2}$ equation with a density bounded above and below by positive constants belong to $W^{2,1}_{\mathrm{loc}}$ in every dimension. If, in addition, the density is continuous, the solutions belong to $W^{2,p}_{\mathrm{loc}}$ for every $1<p<\infty$.
Read the full abstract

Information Theory

Convolutional Codes from Cyclic Codes with Guaranteed Free and Local Minimum Distances

This paper presents an algebraic method to construct convolutional codes with guaranteed free and local minimum distances without limit based on cyclic codes of odd lengths. The constructions are simple but effective, and no computer search is needed. For any two positive integers $r$ and $t$ with $1 \leq r < t$, a rate-$r/t$ convolutional code $\mathcal{C}_{\text{convol}}$ can be constructed by using a chain of $r$ cyclic codes $\mathcal{C}_0, \mathcal{C}_1, \ldots, \mathcal{C}_{r-1}$ of the same length $n$ which satisfy the inclusion condition, $\mathcal{C}_0 \supset \mathcal{C}_1 \supset \ldots \supset \mathcal{C}_{r-1}$. Such a convolutional code $\mathcal{C}_{\text{convol}}$ is composed of a semi-infinite chain of identical local codes confined in a diagonal band of width $n$. Each local code $\mathcal{C}_{\text{local}}$ of $\mathcal{C}_{\text{convol}}$ is formed from the $r$ cyclic codes in the code chain and is a specially localized subcode of the mother code $\mathcal{C}_0$ in the code chain. The minimum distance $d_{\text{local}}$ of each local code of $\mathcal{C}_{\text{convol}}$ is lower bounded by the minimum distance $d_0$ of the mother code $\mathcal{C}_0$ in the code chain. The local structure of $\mathcal{C}_{\text{convol}}$ allows it to be decoded based on a designed parity-check matrix of the mother code $\mathcal{C}_0$ using a sliding window decoding scheme.
Read the full abstract

All authors Khaled Abdel-Ghaffar, Daniel J. Costello Jr., Juane Li, Shu Lin

Materials Science

Curvature-Enhanced Polarization in Transition-Metal Dichalcogenide Janus Nanowrinkles

Strain-gradient engineering via out-of-plane wrinkling offers a powerful route to tune electronic and electromechanical properties in two-dimensional (2D) materials. Here, we systematically investigate the electronic and polarization response of wrinkled Janus MoSSe/MoSeS monolayers using density functional theory (DFT) calculations coupled with continuum elastica modeling. Exploring varying wrinkle sizes and compressive strain levels ($5\%$ – $20\%$), we show that the global out-of-plane polarization follows a linear behavior when parameterized by the projected aspect ratio of the nanowrinkles. On this basis, we develop a physically grounded geometric model incorporating an effective 2D electromechanical coupling coefficient, which accurately predicts DFT polarizations without requiring higher-order nonlinear parameters. Atom- and orbital-resolved charge density analyses reveal the microscopic origin of this behavior: while the central Mo $4d$ projected weight remains approximately constant, local curvature drives continuous, chemically asymmetric charge transfer between the S $3p$ and Se $4p$ sublayer manifolds. Our findings establish clear geometric design rules for harnessing polarization in Janus monolayers for flexible nanoelectronics and optoelectronics.
Read the full abstract

All authors Stefan Velja, Surender Kumar, Domenico Corona, Caterina Cocchi

General Relativity and Quantum Cosmology

Cosmological extra dimensions can mimic dark energy

We present a simple model of a higher dimensional spacetime in which the 4d submanifold is a FLRW metric, while the extra dimensions are compactified to a hypersphere. We calculate the Friedmann equations of this model finding that the extra dimensions interact in a non-trivial way with the 4d submanifold evolution. We prove that what is observed as Dark Energy could be explained only as an effect due to the Gaussian curvature and the expansion rate of the extra dimensions. We calculate the luminosity distance in this model and derive the acceleration parameter q. We find that {\Omega}m and q are in some sense dressed by terms coming from the extra dimensions, thus a Universe filled only with matter (both luminous and dark) and with extra dimensions can explain the observational data. We find that the extra dimensions do not affect the CMB spectrum, but this is not a solution to the Hubble tension. We fit our model to SNe data and find evidence for the presence of 3-4 extra dimensions which are presently contracting.
Read the full abstract

Solar and Stellar Astrophysics

Detection of resonant nodes in a pore chromosphere

Active region atmospheres host many oscillatory phenomena. The chromosphere is delimited by steep temperature gradients at the photosphere and transition region, where magnetoacoustic waves are trapped and can form standing oscillations within this resonant cavity. We aim to detect the signature of the resonant nodes of standing waves, which are expected to produce sudden jumps in the oscillatory phase and power dips. Spectroscopic temporal series of H$\alpha$ in a pore were acquired with the Swedish Solar Telescope. The velocity and temperature fluctuations at multiple atmospheric heights were inferred from the analysis of the intensity at many spectral positions along the line wings. Wavelet analysis was employed to characterize the phase differences and the power at different heights. The phase shift between velocity and temperature shows a $\pm90^{\circ}$ value, which is consistent with standing oscillations. Robust evidence of the presence of a nodal layer in the temperature at around the height probed by the intensity at H$\alpha\pm0.30$ Å\ is found, such as the detection of 180$^{\circ}$ jumps in the phase of the temperature oscillations and remarkable power dips at the same atmospheric layer. The exact height of the resonant nodes depends on the spatial location and time. We generally find a mixture of standing and propagating waves. This is consistent with a leaky resonator where waves are partially reflected at the transition region, while some of them are able to propagate into the corona. For the first time, we report the detection and characterization of resonant nodes in the solar chromosphere. This result provides strong observational support for the chromospheric resonant cavity model and paves the way for the development of new seismological techniques to investigate the structure of active region chromospheres.
Read the full abstract

Robotics

EvoNav-Bench: Benchmarking Lifelong Navigation in Evolving Environments

Lifelong navigation (LN) requires an embodied agent to solve a sequence of navigation subtasks in the same environment. Since solving each subtask from scratch incurs redundant exploration, an LN agent must consolidate experience from earlier stages and reuse it in later stages, often through persistent scene representations such as scene graphs or visual snapshots. However, existing approaches typically assume a stationary environment, whereas in real-world LN settings, human activities can cause the environment to evolve. With the stationary assumption violated, existing methods may fuse outdated prior observations with new observations, yet current benchmarks cannot reveal this failure mode. In this paper, we present EvoNav-Bench, which extends the GOAT-Bench style LN formulation in the context of evolving environments. Built on the ProcTHOR framework, EvoNav-Bench introduces environment modifications between navigation tasks, making prior experience useful but not fully reliable. This design enables controlled evaluation of how environment evolution affects LN agents that reuse prior scene observations. Using EvoNav-Bench, we benchmark three recent methods that build and reuse scene representations for navigation. We also compare three simple heuristic strategies for handling environment evolution: Frontier-Update, Fail-then-Update, and Stage-Reset. Our results show that existing methods are brittle under environment evolution, while the heuristic strategies enable a controlled analysis of how agents can adapt to scene changes and mitigate their impact.
Read the full abstract

All authors Xilin Wang, Guoxi Zhang, Hongming Xu, Zhuofan Zhang, Tianxu Wang, Lifeng Fan

Combinatorics

Entropy bounds and global couplings for union-closed families

We give a computer-assisted proof that every finite union-closed family containing a nonempty set has an element in at least 0.38288525 of its members. The argument combines independent sampling with conditionally independent sampling and an explicit product lower bound for a binary-entropy kernel. We identify the limiting constant of this pointwise method through a one-variable stationary equation. We also construct a global coupling by balancing inverse union multiplicities and prove a strictly positive, quantitative entropy gain over independent sampling. Combining the two arguments gives an additional frequency bound depending on the size of the family.
Read the full abstract