General Economics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 12 September
This study examines emission interdependencies within the waste sector and between waste and other economic domains, energy, transport, water, and communications, using Life Cycle Assessment (LCA) methodologies with emphasis on process-based and hybrid approaches. The analysis employs the EXIOBASE multi-regional input-output database. Statistical correlation is applied to identify commonalities and divergences in emission drivers. Results indicate strong correlations among certain landfill waste streams, particularly organic-based materials, as well as links between plastics and wood, suggesting shared decomposition or management pathways. Moderate correlations appear in cross-sectoral interactions, especially between waste, energy, and transport, while weak correlations are observed in processes with distinct treatment mechanisms, such as landfill versus wastewater. Methodologically, the study highlights challenges posed by high-dimensional datasets, including multicollinearity, which limit the effectiveness of linear models. These findings underscore the complexity of sectoral interdependencies and the need for both integrated and material-specific strategies. By demonstrating how systemic tools like EXIOBASE can capture these linkages, the research provides a foundation for constructing more robust emission models and informing targeted mitigation policies. The results contribute to advancing environmental accounting frameworks while offering practical insights for emission reduction planning across interconnected sectors.
Artificial Intelligence
Degraded but Not Entirely Ineffective: PE-Based Deformable Graph Neural Networks
Many real-world scenarios can be represented using graph-structured data. However, traditional GNNs that transmit messages based on first-order neighbors have long faced several fundamental contradictions: increasing depth leads to over-smoothing, long-range dependencies cause over-compression, fixed neighborhoods restrict the receptive field, and on heterophilous graphs, topological neighbors become a source of noise. Although many works have addressed these issues individually, few mechanisms can simultaneously alleviate all of these challenges. To address the aforementioned problems, we propose a Position Encoding-Based Deformable Spatial Aggregation Module (PEBDSAM) that solves them all in one step. Specifically, we utilize a deformable mechanism in the position space to identify relevant nodes to supplement the original first-order neighbor information of GNNs, allowing traditional GNNs to adapt to heterophilous scenarios. Through diagnostic experiments, we obtained several major findings: current offsets fail to have any effect; subsequently, we analyzed the causes of offset failure and why model performance still improves even after offset failure, pointing out future research directions. Based on these diagnostic experiments, we streamlined the original PEBDSAM, resulting in a simplified version, which we call the Position Encoding-Based Spatial Aggregation Module (PEBSAM). In addition, we propose a PEBSAM-Speed to adapt to large datasets. Finally, we designed the module to be plug-and-play and applied it to GCN, GAT, GIN, and GraphSAGE, achieving desirable results on three homophilous datasets and six heterophilous graph datasets.
Read the full abstract
Robotics
Decentralized Multi-Robot Task Allocation Under Degraded Communication: A Benchmark of Performance, Reliability, and Computation
Selecting a decentralized Multi-Robot Task Allocation (MRTA) method for embedded deployment on autonomous platforms requires considering more than route performance alone. We benchmark six decentralized MRTA allocators (CBAA, ACBBA, PI, HIPC, DMCHBA, and DGA) in the Collaborative Visit (CV) scenario to characterize tradeoffs among MinMax and MinSum travel, communication robustness and demand, allocation reliability, computational burden, and scale sensitivity. The core study uses 500 paired ten-target instances across 25 ideal and degraded communication conditions spanning Bernoulli loss, Gilbert–Elliott loss, and Rayleigh fading, with additional campaigns examining pre-allocation, execution-integrated computation, and sensitivity to grid size, robot density, and target load. Across the 24 impaired core conditions, DGA and DMCHBA achieved the lowest mean MinMax travel at 24.49 and 24.78 steps, respectively. HIPC narrowly led mean MinSum travel at 66.95 steps, followed by DGA at 67.22, with both methods occupying the top two in every impaired condition. DMCHBA had the lowest publication intensity at 2.08 publications per team step. In ten-target pre-allocation, HIPC and DMCHBA remained viable and stable in every tested condition, while ACBBA, PI, and DGA lost stability or viability as communication degraded. Under ideal delivery, median full-protocol computation $\Cterm$ in the primary ten-target comparison ranged from 4.88 ms for DMCHBA to 1.346 s for DGA. Static route quality preserved DGA and DMCHBA as the leading MinMax methods, while DGA led MinSum at three of four target loads and HIPC led at 50 targets. Static and execution-integrated computation rankings diverged as task load increased. The results identify distinct allocator operating regions across route objective, communication behavior, reliability, and computational constraints.
Read the full abstract
Spectral Theory
A quadratic comparison of Neumann eigenvalues on thin convex domains in arbitrary dimenstion
Let $\Omega\subset\mathbb R^n$ be a bounded convex domain that is thin around a chosen diameter segment. We compare its Neumann spectrum with the spectrum of that segment weighted by the $(n-1)$-dimensional volumes of its perpendicular sections. We prove an $O(\varepsilon^2)$ comparison of the mean-zero inverse operators and, consequently, an $O(\varepsilon^2)$ eigenvalue comparison for every fixed index in every dimension $n\ge2$. The constants depend only on the dimension and the eigenvalue index. Thin rectangles show that the quadratic exponent is optimal.
Read the full abstract
Computation and Language
When Edit Localization Amplifies Relative Selection Bias: Gradient Geometry, Target Mismatch, and Importance Weighting
Human corrections identify editable spans, but the examples receiving corrections may come from a selective feedback channel. We analyze this interaction at a fixed model checkpoint by decomposing a localized gradient into edited and retained untouched components. Squared relative selection bias is a ratio of quadratics whose derivative has the sign of an explicit quadratic polynomial. Localization can increase, decrease, or nonmonotonically change this diagnostic; its direction depends on component biases and geometry. Oracle importance weighting recovers the population mean for each fixed localization objective, but these objectives have different targets. Against one common full-gradient target, we derive the finite-sample mean-squared error, an analytic optimal retention coefficient, and a fixed-clipping extension. Exact finite-population calculations and 10,000 Monte Carlo repetitions per sample size verify the identities and counterexamples. Public human-post-edit experiments use two translation directions and pretrained models, with declared synthetic selection. An English-German extension differentiates 73.89 million native parameters. In all three declared settings, hard localization has higher relative bias but lower absolute bias than full retention. Untouched-component biases are nonzero and selected component means have negative inner products, so the general criterion applies where the simple unbiased/aligned explanation fails. Output-bias diagnostics show the same endpoint ordering of relative bias across both directions, with one interior maximum. Mechanisms reuse each language's records and include a mixture; they are not independent replications. The evidence separates relative amplification from absolute gradient error and establishes estimation properties, without inferring translation-quality gains or identifying actual complaint propensities.
Read the full abstract
Analysis of PDEs
Stable and Unstable Potential-Well Dynamics for an Indirectly Damped Wave-MGT System with General Focusing Sources
We study a conservative semilinear wave equation coupled through a zero-order interaction to a dissipative Moore–Gibson–Thompson equation on a bounded domain. The wave component carries no direct damping and is driven by a general focusing source $f(u)$. The augmented variable $w=v+\tau v_t$ reveals an exact coupled energy and a coercive potential-well geometry. The source assumptions are formulated through $H_\theta(s)=\frac1\theta sf(s)-F(s)$, $F(s)=\int_0^s f(r)\,d r$, $\theta>2$. Under $L^2$-subcritical $C^1$ growth, smallness at the origin, nonnegativity and radial monotonicity of $H_\theta$, and a nontrivial focusing condition, we establish local well-posedness, the exact energy identity, and a continuation alternative for arbitrary finite-energy data. For nonzero coupling, the linearized semigroup is strongly stable, whereas a wave-branch expansion precludes uniform exponential stability and positive-time compactness. Below the coupled well depth, the stable set is positively invariant and generates global solutions, while data with negative Nehari functional blow up in finite time without a sign condition on the initial velocities. At the critical level $E(0)=d$, nonzero coupling yields a complete trichotomy into stable entry, finite-time blow-up, or a stationary Nehari ground state. Under the same coupling condition, every stable trajectory converges weakly to zero without any compactness hypothesis. A renormalized high-frequency identity shows that vanishing of the accumulated nonlinear high–low flux is equivalent to relative compactness of the orbit and to strong convergence in the natural energy space. We give several sufficient criteria, including finite total variation of the nonlinear force in $L^2(\Omega)$.
Read the full abstract
Graphics
Learnable Persistent Wrinkle Formation in Cloth Simulation
The mechanical memory of fabrics often leads to persistent wrinkles, which reflect key physical properties and habitual wear patterns. Simulating these wrinkles accurately is essential for visual plausibility in digital garments, yet no dedicated approach exists for inferring the parameters that govern their formation due to the lack of precise datasets and estimation methods. We introduce Fabric-101, an inclusive, accurate, and extendable fabric dataset comprising over 101 common fabrics following textile standards. Unlike existing datasets, it captures three physically distinct deformation components (i.e., self-recoverable (elastic), recoverable (friction-driven), and unrecoverable (plastic)), from cyclic loading-unloading measurements. Building on this data, we propose a differentiable cloth simulator combining an elasto-plastic model with friction, designed to capture recoverable and unrecoverable wrinkle formation. Our simulator is differentiable and uses adjoint method to learn fabric physical parameters from the measured hysteresis curves, learning fabric-specific wrinkle behaviors. Through extensive experiments, we demonstrate that our model reproduces persistent wrinkles that are visually and physically similar to real fabrics across diverse materials and motions. Dataset and code are available in https://github.com/GongDeshan/Fabric_101_for_Wrinkles.
Read the full abstract
Computer Vision
Rank-Consistent Set Reasoning for Co-Salient Object Detection
Co-salient object detection (Co-SOD) requires a model to find foreground regions that are salient in individual images and supported by the image group. We present Rank-Consistent Set Reasoning (RCSR), a supervised dense-prediction framework that models a group as an unordered set rather than as a sequence of images or a semantic label. The core idea is to rank how strongly each spatial region agrees with a small collection of learned group slots at every image scale, and to aggregate these ranks with a robust trimmed statistic. This suppresses accidental pairwise matches and prevents one atypical group member from dominating the shared representation. A set encoder builds group slots directly from multi-scale visual features, while a rank-consistency gate measures whether the ordering of candidate regions is stable across group members. The gated slots are decoded jointly with per-image features to produce co-saliency maps. The model contains no natural-language branch, no open-vocabulary detector, and no external segmentation model. We further introduce a group permutation objective and hard-distractor augmentation so that the model learns the properties of a set-level target rather than memorizing image order or isolated visual saliency. We formulate an evaluation protocol for CoCA, CoSal2015, and CoSOD3k, together with tests of group-size robustness, distractor rejection, order invariance, and cross-dataset transfer.
Read the full abstract
Signal Processing
Channel Estimation for Movable Antenna Systems: Challenges, Solutions, and Opportunities
Movable antenna (MA) has emerged as a promising technology for future wireless networks by exploiting channel variation over local antenna movement regions. However, accurate and efficient channel acquisition in MA systems remains challenging due to the trade-off between estimation accuracy and computational complexity. In this article, the MA channel model and the associated estimation framework are first reviewed, where channel information over the movement region is reconstructed from finite measurements by exploiting shared path parameters. The structured dependence of MA observations across space, time, and frequency naturally motivates the adoption of tensor-based modeling for channel estimation. Subsequently, we discuss the tensor-based signal model and corresponding parameter estimation methods from multidimensional observations. These methods are further compared with conventional channel estimation methods in terms of estimation accuracy, computational complexity, and general applicability. Furthermore, a representative case study is provided to illustrate the performance and characteristics of different algorithms under MA channel estimation settings. Finally, some future research directions for tensor decomposition-based channel estimation in MA systems are outlined.
Read the full abstract
General Relativity and Quantum Cosmology
Effective Matter Conversion in Gravitational Collapse and the Dynamical Formation of Regular Black Holes
We study inverse source reconstruction in generalized Vaidya spacetimes. A prescribed density fixes the mass and tangential pressure, while a two-sector decomposition determines a dimensionless radial balance function. We distinguish this function from a time-directed conversion rate and identify the additional null-flux information required for a covariant exchange vector. Positivity restricts the allowed target pressures: a de Sitter core cannot be represented by nonnegative sectors with nonnegative tangential equations of state. An explicit finite-density profile admits a positive vacuum-like completion, finite curvature invariants, and inner and outer trapping horizons above a calculable threshold. Its total source satisfies the null, weak, and dominant energy conditions during monotonic accretion, while the timelike convergence condition fails in the core. We check polytropic, bag-model-inspired, and condensate-inspired profiles and the corresponding cosmological reconstruction. Finally, we compute the stationary endpoint's shadow and compare its exterior deformation with published Sagittarius A* measurements. The construction establishes local curvature regularity and marginal-sphere formation, without claiming a microscopic formation mechanism, perturbative stability, or geodesic completeness.
Read the full abstract
Computational Complexity
Gap Entropy and Almost Instance-Wise Optimal Best-Arm Identification
In the best-arm identification problem, we are given $n$ stochastic arms with unknown means and wish to identify the arm with the largest mean with probability at least $1-\delta$, using as few samples as possible. We consider independent Gaussian rewards with unit variance and means in $[0,1]$. Chen and Li [2016] conjectured that the instance-wise sample complexity of this problem is characterized by the gap entropy, up to an additive term arising from the two-arm problem. In this paper, we resolve their gap-entropy and almost instance-wise optimality conjectures. For an instance $I$, let $\Delta_{[i]}$ be the gap between the largest and the $i$-th largest mean, let $H(I)=\sum_{i=2}^{n}\Delta_{[i]}^{-2}$, and let Ent$(I)$ denote the entropy of the normalized complexities of its dyadic gap groups. For every $0<\delta<0.1$, we show that the order-oblivious instance-wise lower bound is $ {\Theta} (H(I)[\log(1/\delta)+Ent(I)]). $ We also give a single $\delta$-correct algorithm with expected sample complexity $ O ( H(I)[\log(1/\delta)+Ent(I)] +D\log(e+\log(e+D))),D=\Delta_{[2]}^{-2}, $ without prior knowledge of the gaps. Our lower bound removes the dyadic-gap and monotonicity restrictions of previous work, and our upper bound removes the additional polylogarithmic factor multiplying the two-arm term. Thus, a single algorithm attains the instance-wise lower bound up to an additive two-arm term. The main theorems have been formalized and proved in Lean 4.
Read the full abstract
Analysis of PDEs
A Parametrization of Solutions to the Liouville Equation in a Punctured Disc
In this paper, we study parametrization of solutions to the Liouville equation near their isolated singular points. We demonstrate that prescribing asymptotic behaviors forms a new type of problem leading to all such solutions. The harmonic functions determining the asymptotic behaviors play the role of “free data" as the boundary values in the boundary value problems.
Read the full abstract
Machine Learning
Leakage-Safe and Scheduler-Aware Machine Learning for Grid Job Runtime Prediction
Accurate job runtime prediction can improve scheduling-aware resource management in grid and distributed computing environments, but prediction models must be evaluated under realistic deployment constraints. This paper revisits CPU burst time prediction on the GWA-T-4 AuverGrid workload trace and reformulates it as leakage-safe pre-execution job runtime prediction. We define the target as job-level runtime, use only submission-time attributes, exclude post-execution variables, and evaluate models under temporal and cold-start settings rather than relying only on random cross-validation. We compare standard regressors, chronological historical baselines, categorical encoding strategies, and CatBoost with native categorical handling. We further add temporal hyperparameter tuning, runtime predictability analysis, feature ablation, error analysis by job length, and a minimal scheduling simulation. After temporal-validation tuning, CatBoost achieves the strongest deployment-oriented result with R^2=0.239, MAE=27,019, RMSE=46,587, and LogMAE=2.646 on the held-out temporal test set. A single-server simulation over all 69,523 held-out temporal test jobs shows that prediction-informed SJF reduces average waiting time by 50.92% relative to FCFS. The results show that random-split evaluation overestimates performance, categorical-native boosting improves temporal generalization, and long-job underestimation remains a scheduler-relevant challenge.
Read the full abstract
Human-Computer Interaction
Choosing Together: How Dyadic Negotiation Shapes Adaptive Kitchen Design Preferences for Older Adults with Cognitive Impairment and Their Care Partners
Adaptive technology for older adults with cognitive impairment is typically designed around individual preference, yet most of this population lives and cooks with a spouse or family member. This paper examines a co-design workshop in which four dyads and two individuals (N=10) built kitchen cabinet designs from twenty-one options across five features. Thematic analysis of thirty selections identifies recurring patterns: visual access retained through enclosure rather than open shelving, physical effort treated as a household concern, and automation accepted when predictable. Structured analysis of ten interaction episodes shows how some patterns were negotiated in practice, including care partners contributing embodied constraints distinct from the primary participant, and disagreements resolving through documented deliberation. Together, the two analyses show that adaptive technology preferences are not always individual properties but can be shaped through household interaction. We offer candidate design implications for facilitation protocols and collaborative systems supporting shared decision-making in aging-in-place contexts.
Read the full abstract
Category Theory
Compatibility of HRS tilt and completion of $t$-structures in triangulated categories
Let $K$ be a field, and $\mathcal{T}$ a $K$-linear essentially small triangulated category equipped with an extendable $t$-structure $(\mathcal{T}^{\leq0}, \mathcal{T}^{\geq0})$ with respect to a good metric $\mathfrak{B}$. Given a torsion class $\mathcal{X}$ in the heart of $(\mathcal{T}^{\leq0}, \mathcal{T}^{\geq0})$, we prove that lifting the HRS-tilt of $(\mathcal{T}^{\leq0}, \mathcal{T}^{\geq0})$ at $\mathcal{X}$ along the completion of $\mathcal{T}$ coincides with the HRS-tilt of the lifted $t$-structure at the completion of $\mathcal{X}$. As an application, we provide the compatibility result between left silting mutation in $\mathcal{T}$ and HRS tilting in the ambient completion.
Read the full abstract
Statistical Methodology
Spectral Design of Random-Duration Switchbacks
A switchback experiment alternates an entire system between treatment and control over time. It is especially useful when interactions between units can undermine standard unit-level experiments. Switchback experiments are commonly implemented on fixed temporal grids, which impose highly structured restrictions on when treatment can switch. We study a broader class of random-duration switchbacks, in which treatment and control alternate across runs whose durations are drawn from a common distribution. Under finite carryover, we show that the mean squared error of the Horvitz-Thompson estimator has a simple frequency-domain representation governed by how temporal outcome patterns align with design-induced imbalance and contamination patterns. This representation yields a tractable worst-case design criterion that can be computed directly from the duration distribution. Optimizing over even a simple two-rate family produces a run-age-dependent switching rule that reduces the asymptotic worst-case mean squared error by at least 32% relative to the standard independently randomized fixed-block switchback.
Read the full abstract
Analysis of PDEs
Dispersive and Strichartz Estimates for the Schrödinger Equation Inside Cylindrical Domains
Dispersive and Strichartz estimates are fundamental tools for establishing the well-posedness and long-time behavior of solutions to nonlinear partial differential equations. While these estimates are well-understood in the boundaryless Euclidean setting, the presence of a geometric boundary introduces severe analytical complexities, such as the continuous formation of caustics. In this work, we establish sharp local-in-time dispersive estimates for the semiclassical Schrödinger equation inside a three-dimensional cylindrical domain $\Omega \subset \mathbb{R}^3$ subject to homogeneous Dirichlet boundary conditions. This paper provides the first comprehensive microlocal treatment for this anisotropic geometric setting, extending the optimal strictly convex boundary results of Ivanovici \cite{Ivanovici2023} to the parabolic setting. The primary analytical challenge in our cylindrical model stems from the fact that the boundary curvature is non-uniform, depending explicitly on the tracking angle of classical trajectories and vanishing identically along the flat longitudinal axis. Crucially, we demonstrate that the quadratic structure of the Schrödinger phase function ($\partial_\zeta^2 \Phi = 2t$) establishes global non-degeneracy, completely bypassing the arduous low-frequency trajectory ray-tracing mandatory in hyperbolic wave equations. By exploiting this structural advantage alongside a streamlined Littlewood-Paley dyadic block decomposition, we prove that the zero-frequency axial tail can be consistently integrated down to the flat limit $\eta=0$. This yields sharp global Strichartz estimates featuring an explicit derivative loss exponent of $\rho(q) = \frac{3}{2}\left(\frac{1}{2}-\frac{1}{q}\right)$.
Read the full abstract
Theoretical Economics
Convex Order and Moment Persuasion
If a probability measure is a mean-preserving contraction of another, the two measures are said to be in convex order. This paper provides a complete characterization of mean-preserving contractions and their extreme points in the multidimensional setting, extending the results of Kleiner, Moldovanu, Strack, and Whitmeyer (2024) to incorporate fully revealing regions and lower-dimensional pooling regions. A central feature of our characterization is a "concentration " structure: each state can be mapped only to posterior means lying within its own irreducible component. We apply these results to the moment persuasion problem.
Read the full abstract
Robotics
GROOVE: Geometry-Guided Reduction of Operational-Space Jerk in VLA Execution
Chunked vision language action (VLA) policies execute several commands per query, but jerk within chunks and across replanning boundaries can induce oscillatory motion and sharp actuator transients. We present GROOVE, an online regulator that searches directional correction regions around the raw three dimensional end effector (EEF) path, without retraining or additional VLA inference. It optimizes the new chunk using delivered commands as boundary conditions, reducing boundary and within chunk jerk while bounding cumulative translation and local axis angle deviation from the raw plan after every command. Using quadratic programs (QPs), GROOVE generates a cube reference and thirteen directional candidates, then selects the one with the lowest command space jerk under a reference relative deviation cap. On a held out LIBERO benchmark, GROOVE achieves the largest reductions among the evaluated methods, reducing translational and rotational EEF jerk by 33.02% and 43.42%, respectively, with task success of 95.75% versus 93.75% for raw execution. Across 50 matched UR5e pairs with measured execution timing, it reduces translational and rotational tool center point (TCP) jerk by 16.39% and 19.49% and joint current slew by 29.09%.
Read the full abstract
Audio and Speech Processing
Subphonetic Acoustic Modeling via Optimal Transport for Pronunciation Assessment
Pronunciation assessment requires acoustic evidence that is temporally precise, diagnostically meaningful, and faithful to the learner's actual production. However, existing acoustic models often struggle to provide recognition and segmentation evidence simultaneously. CTC-based phone recognizers can predict phone sequences flexibly, but their sparse and peaky posteriors often miss phone boundaries and fine-grained pronunciation cues. In contrast, text-dependent forced aligners provide reliable temporal information when transcripts are available, but are not directly applicable to reference-free pronunciation analysis. In this work, we propose a topology-aware frame-wise acoustic model that learns dense ordered state posteriors within each phone. The key idea is to recover phone-internal state structure in a neural acoustic model by combining ordered subphonetic states with optimal temporal transport classification (OTTC). This combination encourages dense monotonic frame-level state discrimination while preserving phone recognition ability. Experiments on read, spontaneous, and L2 speech show improved segmentation over neural baselines with competitive recognition performance. Downstream evaluations further show gains in mispronunciation detection and automatic pronunciation assessment. Probing analysis suggests that the learned states capture phoneme-dependent acoustic structure rather than arbitrary frame-level distributions.
Read the full abstract
Data Structures and Algorithms
Polynomial-time Tensor Decomposition under the Kruskal Condition and the Lovitz–Petrov Generalization
An identifiability criterion is a condition on a tensor decomposition that certifies uniqueness when the condition holds. Kruskal's classical condition is one of the best-known deterministic criteria for identifiability. However, no polynomial-time decomposition algorithm is known under the Kruskal condition; verifying the condition itself is NP-hard. Lovitz and Petrov introduced a strictly more general identifiability condition which, in contrast, is polynomial-time verifiable, but no polynomial-time decomposition algorithm was known under this condition either. In this paper we give a randomized polynomial-time algorithm, in the algebraic model over $\mathbb R$, for tensor decomposition under the Lovitz–Petrov condition, and therefore also under the stricter Kruskal condition. Moreover, combining our algorithm with polynomial-time verification of the Lovitz–Petrov condition yields an efficient end-to-end certification procedure: after computing a decomposition, one can deterministically certify in polynomial time that it is unique and therefore of minimum rank.
Read the full abstract
Data Structures and Algorithms
Prefix Sharing Is a Sorting Problem
LLM serving reuses KV cache by exact prefix match, so when a prompt is assembled from a set of reusable pieces – retrieved passages, tool definitions, few-shot exemplars – the order chosen for those pieces determines how much computation can be shared. Every deployed system fixes that order by a single global convention. We prove this is optimal only when requests contain at most two pieces, and asymptotically wrong in general. Our main result is a structure theorem: the minimum prefix-trie cost equals min_H sum_x w(x) t_x(H) over binary hierarchies H on the requests, where t_x(H) is the canonical decomposition size of the set of requests needing chunk x. Choosing chunk orders is therefore equivalent to choosing one hierarchy over requests. The identity yields an O(3^m) exact algorithm, identifies the two-chunk case as minimum vertex cover, and shows that on the leave-one-out family the optimum is the minimum external path length of a binary tree – the merge-sort recursion – so a global order pays Theta(n^2) against a true cost of Theta(n log n). Agglomerative clustering by common intersection is a tight 1/2-approximation for the achievable saving. On BM25 retrieval traces over three BEIR corpora the resulting layout reduces prefill by 17-36% against production RAG ordering, and the margin widens with retrieval depth as the theory predicts. Serving requests in the hierarchy's DFS order finally lets a cache holding one request's context attain the unbounded-cache optimum exactly, so cache capacity and reorder window act as substitutes.
Read the full abstract
Computer Vision
MomentBA: Second-order Spatial Moments for Anisotropic Correspondence Uncertainty in Differentiable Bundle Adjustment
Most existing visual odometry (VO) systems treat feature correspondences as deterministic measurements or assign uniform uncertainty, ignoring the inherent localization ambiguity of different observations. However, correspondence uncertainty is often anisotropic due to image structures such as edges, repetitive patterns, and motion blur, which can significantly affect geometric optimization. In this work, we propose MomentBA, a geometry-aware bundle adjustment framework that derives anisotropic correspondence uncertainty from second-order spatial moments of local similarity responses. Instead of introducing additional covariance prediction networks, the proposed method directly converts matching response distributions into interpretable covariance estimates and incorporates them into bundle adjustment as correspondence-specific information matrices for uncertainty-aware residual weighting. Furthermore, the proposed formulation is integrated into a differentiable optimization framework, establishing a direct connection between correspondence uncertainty and geometric estimation. Experiments on the EuRoC MAV and TartanAir v1 Hard datasets demonstrate that MomentBA improves monocular visual odometry accuracy compared with existing feature-based and learning-based approaches. The proposed anisotropic covariance model achieves lower rotational errors and more robust trajectory estimation than fixed and isotropic uncertainty models, validating the effectiveness of geometry-induced uncertainty modeling for challenging visual environments.
Read the full abstract
Differential Geometry
Jacobian estimates and geometric inequalities under intermediate Ricci curvature
We prove a Jacobian estimate underlying both the Heintze–Karcher comparison and the Alexandrov–Bakelman–Pucci method for submanifolds of arbitrary codimension. The estimate retains the contributions of ambient curvature along geodesics emanating from the submanifold and requires no curvature sign assumption. As applications, we obtain a quantitative Fenchel–Willmore inequality with explicit curvature remainders under nonnegative $n$-intermediate Ricci curvature, Michael–Simon Sobolev and isoperimetric inequalities under nonnegative $(n-1)$-intermediate Ricci curvature, and corresponding extensions under quadratic curvature decay. In each result, the required intermediate Ricci curvature condition depends only on the dimension of the submanifold and is independent of its codimension.
Read the full abstract
Solar and Stellar Astrophysics
Multi-Instrument Analysis of NOAA AR 12781: Coupling Surface Evolution of the AR with Its In-Situ Solar Wind Signatures
Understanding the relationship between photospheric magnetic flux evolution and coronal emission remains an important problem in heliophysics. We investigate the decay of NOAA Active Region 12781 from 7 to 11 November 2020 using observations from the Solar Dynamics Observatory (SDO). Coronal emission was measured from the Atmospheric Imaging Assembly (AIA) 193\~Å images, while the photospheric signed and unsigned magnetic flux was derived from Helioseismic and Magnetic Imager (HMI) observations of the FeĨ 6173\~Å line. The unsigned magnetic flux and mean 193\~Å intensity showed a strong inverse relationship, with Pearson and Spearman correlation coefficients of $r\_p=-0.771$ and $r\_s=-0.758$, respectively. During the five-day decay phase, the unsigned magnetic flux decreased by 36.54\% from its maximum value, while the coronal emission increased by 21.96\%. We also compared the remote-sensing observations with near-Earth solar-wind and interplanetary magnetic-field measurements from the OMNI database using an estimated propagation delay. The results show that the coronal emission did not vary directly with the photospheric magnetic flux during the decay of AR\~12781. The possible association with the solar wind is discussed cautiously because a direct source connection cannot be established from the time-delay estimate alone.
Read the full abstract
Image and Video Processing
SONAR: A Structure-Consistent Neural Operator for Null-Space-Aware Sparse View CT Reconstruction
Sparse-view computed tomography (CT) reduces radiation dose and acquisition time but remains severely ill-posed because incomplete projections poorly constrain null-space information. Existing learning-based methods often estimate this information in high-dimensional image space, conflate physical measurement errors with prediction errors, and depend on fixed discretizations. We propose SONAR, a Structure-Consistent Neural Operator for Null-Space-Aware Reconstruction. Instead of recovering the full null-space component, SONAR predicts a low-dimensional null-space-aware representation from the acquired projections as pseudo-measurements. It separates measurement and pseudo-measurement residuals, lifts them into the image domain through physics operators, and applies independent neural operators to constrain their structural effects, thereby accommodating admissible errors while suppressing unsupported structures. To support cross-discretization reconstruction, an anisotropic U-shaped neural operator models the periodic angular and nonperiodic detector dimensions using direction-dependent continuous supports, while image-domain neural operators re-discretize continuous kernels on target grids. These components form an optimization-inspired unrolled network. Experiments on simulated AAPM and clinical MARS photon-counting CT data demonstrate consistent improvements across seen and unseen view settings and unseen image resolutions. On AAPM dataset, SONAR improves PSNR by 1.87~dB at 62 views and by 7.63~dB under zero-shot transfer to a $512\times512$ grid over the strongest competing methods. SONAR also achieves the best overall performance in all clinical settings evaluated, demonstrating accurate, structurally reliable, and discretization-robust sparse-view CT reconstruction.
Read the full abstract
Representation Theory
Differential calculus on quantized irreducible flag manifolds
We give a new description of the differential calculus on the quantized irreducible flag manifold given by Heckenberger-Kolb. We also define a quantum analogue of the Dolbeault complex associated to an equivariant vector bundle on the irreducible flag manifold, and show that its cohomology groups coincide with the cohomology groups given by Andersen-Polo-Wen defined using the induction functor.
Read the full abstract
High Energy Physics (Phenomenology)
Lorentz Violation and Vector Meson Dominance
Vector meson dominance models describe the mixing of photons with vector mesons; the hadronic admixture frequently dominates the interactions of photons with nucleons. This mixing also makes it possible to test for new physics affecting the vector mesons using photon measurements. The possibilities for new physics to be contrained in this indirect fashion include potential Lorentz and CPT violations in the hadronic effective action. The characteristic scale of bounds on Lorentz violation coefficients in the $\rho^{0}$ meson sector is two orders of magnitude weaker than the corresponding photon bounds, three orders of magnitude weaker for $\phi$ vector mesons, and four orders of magnitude weaker for $\omega$ mesons.
Read the full abstract
Computation and Language
Not all Negation Cues are Equal: Affixal Negations Yield Better Negation Understanding
Negation remains a longstanding challenge for both language models (LMs) and large language models (LLMs). Prior work mainly focuses on a small set of high-frequency single-word negation cues, such as not and never, with limited exploration of broader negation types and modern LLMs. To address this gap, we construct NegCue, a large-scale dataset containing over 1.8M samples spanning single-word, multi-word, and affixal negation with more than 200 unique cues. We further pre-train both encoder-only LMs and LLMs on NegCue to investigate how different negation types affect negation understanding. Experiments on five downstream benchmarks show that negation types contribute unevenly to performance gains under the same training scale. In particular, affixal negation yields the largest improvements, while the gains from the commonly studied single-word negation remain modest. Moreover, our results demonstrate that further pre-training improves negation understanding for both LMs and LLMs.
Read the full abstract
Algebraic Geometry
Extensions and Segre stratifications over algebraic surfaces
We study two closely related topics over algebraic surfaces: stability of extensions of stable sheaves by stable sheaves, and maximal subsheaves of a given stable sheaf. For the former, we provide a construction of complete families of sheaves via extensions and prove the stability for some cases. The construction enables us to prove certain cases of Weak Brill–Noether over rational surfaces. The second topic leads to a refinement of the Segre stratification of the moduli of sheaves. We obtain the expected dimension of certain refined Segre strata over rational surfaces and K3 surfaces. Over the projective plane, we prove our main result that all refined Segre strata corresponding to line bundles are irreducible of the expected dimension and are nested under taking closures. As a consequence, we obtain more cases of the stability of extensions. Our results suggest that refined Segre strata behave much better than Brill–Noether strata. Our study of the refined Segre strata relies crucially on Bridgeland stability conditions and the work of Li and Zhao.