Peer Revenue Equity in science

Papers

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

All of arXiv

Saturday 29 August

Human-Computer Interaction

Feelium: A Touchable Blimp Body for Aerial Telepresence

Floating things invite touch. We present Feelium, a blimp-based telepresence platform that enables visual embodiment and touch interaction through its inflatable skin. Through a VR headset, a remote person inhabits the blimp, looking out of it first-person, appearing on its skin as a face or avatar, and steering it through the room. Partners in the room pat it, press a palm against it, draw on it, or lean into it; the skin senses each contact, renders it into the wearer's view in VR spaces. Touch thus provides a physical interaction channel for remote presence, turning the skin into a shared surface between remote and co-located partners.
Read the full abstract

All authors George Xi Wang, Henghao Li, Shan Lin, Yunge Wen, Jiaqian Hu, Yuhua Jin

Probability

The Test and Find Model

We introduce the Test and Find (TF) problem, where a decision maker (DM) faces the following situation: $k$ identical objects are randomly allocated to $n$ distinct boxes (sites) according to some distribution $\pi$, with no more than one object to a box. The DM tests all of the boxes. However, the tests are imperfect: they can give false positive or false negative results. DM has $m$ tags, $1\leq m\leq n$, and, after testing all boxes, she can place a tag on any box that she thinks has a hidden object. She is rewarded $c_i$ for a correct guess and penalized $d_i$ for a wrong guess in box $i$. DM knows all of the parameters of the model and her goal is to maximize the expected reward. We give an explicit solution to this problem. We then turn to the symmetric case, for which we derive more computationally efficient results. We also consider several extensions of the TF model and give detailed solutions. One of these extensions is to the realistic case where $k$, the number of objects, is unknown and random.
Read the full abstract

Information Theory

On systematicity of linear function-correcting codes

The standard formulation of function-correcting codes uses systematic encodings. We study the redundancy cost of this constraint when both the prescribed function and the encoding are linear. We introduce the function-separation distance and show that several classical unequal error protection parameters are special cases. For linear functions and encodings, this distance is the first relative generalized Hamming weight of the code relative to the encoded kernel. We formulate free and systematic linear separation problems. We prove that the optimal free redundancy depends only on the rank of the function, and determine the optimal systematic redundancy for prescribed separations $d\leq3$.
Read the full abstract

Machine Learning

Fully Distributed GNE Algorithms for Multi-Robot Placement without Consensus on Multipliers

Recent machine learning research has increasingly focused on equilibrium analysis in non-cooperative games rather than solely on optimal solutions. Many such problems involve shared constraints and can be formulated as Generalized Nash Equilibrium Problems (GNEPs). For strongly monotone games, existing methods compute consensus-based variational GNEs (v-GNEs) by exchanging Lagrange multipliers. We propose a fully distributed continuous-time algorithm for shared linear equality constraints that converges without multiplier exchange and reaches any GNE, reducing communication overhead and improving privacy. Discrete-time schemes are also provided, and the method is validated on a multi-robot placement task.
Read the full abstract

Artificial Intelligence

EvoGenUI-Bench: Evaluating LLMs as Multi-Turn Generative UI Assistants

Large language models can generate interactive web interfaces, but reliable generative UI requires maintaining an executable artifact as user requests evolve. We introduce EvoGenUI-Bench, a benchmark for multi-turn interface maintenance comprising 150 five-turn tasks and 750 turns across three scenarios: information presentation, executable interaction, and tool-grounded external state. We execute generated artifacts in a browser and evaluate them using screenshots, source and DOM evidence, actor traces, and runtime logs. Beyond turn-level and episode-level success, we measure cross-turn retention with Adjacent Pass Retention. Across eight models, even the strongest achieves 74.9% Turn Pass while completing only 37.3% of five-turn episodes; APR further falls to 52.4% on tool-grounded tasks. Diagnostic analysis shows that presentation failures center on information architecture, interaction failures on derived-state propagation and affordance binding, and tool-grounded failures additionally involve external-state grounding and requirement decomposition. These results reframe generative UI evaluation from judging isolated outputs to testing whether interface behavior, derived state, external state, and assistant claims remain synchronized as the artifact evolves.
Read the full abstract

All authors Yue Peng, Lanke Xia, Zihan Wang, Jiahao Ye, Ke Ning, Hongyi Wen

Algebraic Geometry

Six-functor formalism for Kummer étale cohomology of log schemes

We establish a Grothendieck six-functor formalism for Kummer étale cohomology including Poincaré duality for every separated vertical exact log smooth morphism of noetherian fs log schemes $f\colon X\rightarrow S$ when the coefficient ring $\Lambda$ is killed by an integer invertible on $S$. This is done via log étale rigidity \[\mathrm{D}_{\mathrm{l\acute{e}t}}(S,\Lambda)\simeq \mathrm{DA}_{\mathrm{l\acute{e}t}}(S,\Lambda).\] To achieve this, we also prove that Kummer étale cohomology satisfies $\mathbb{A}^1$-invariance, invariance under virtual isomorphisms, log cdh-descent, and invariance under verticalization.
Read the full abstract

Statistical Methodology

Robust estimation in generalized linear models based on the normal quantiles of the probability integral transformation

A new approach to robust estimation in generalized linear models is introduced. The idea of the method is to first transform the responses applying the composition of the normal quantile function and the probability integral transformation. Then, using that the transformed responses should follow a standard normal distribution, find the values of the parameters that minimize a robust measure of their size. In practice an approximation of this transformation is used. The proposed estimators are studied theoretically for distributions that depend on a single parameter and through simulations and examples for the particular cases of Poisson and logistic regression.
Read the full abstract

Computer Vision

FiLM-GPNet: Geometry-Aware Pseudo-Supervised Phase Restoration with Zero-Shot Generalization for Large Temporal InSAR Stacks

The growing availability of dense commercial Synthetic Aperture Radar (SAR) time series enables temporal Interferometric SAR (InSAR) analysis, but fixed classical filters fail under heterogeneous acquisition geometries, degrading phase quality and temporal consistency. We propose FiLM-GPNet, a geometry-conditioned network for wrapped-phase restoration that explicitly adapts to acquisition differences using Feature-wise Linear Modulation (FiLM) and a 7D per-pair geometry descriptor. The model is trained with pseudo-supervision from Goldstein-filtered interferograms and regularized by interferometric physics via triplet-closure consistency, while also estimating per-pixel aleatoric uncertainty. Experiments on three Capella Spotlight stacks from the IEEE GRSS 2026 Data Fusion Contest show that FiLM-GPNet reduces temporal residual by 68% (Hawaii) and 66% (Western Australia) relative to the Goldstein baseline, alongside closure error reductions of 10% and 13%, respectively. In Western Australia, it further improves unwrapping success rate by 7.7 percentage points and Digital Elevation Model (DEM) Normalized Median Absolute Deviation (NMAD) by 31%. The model also shows strong zero-shot generalization to a geographically and geometrically distinct third stack (Los Angeles) without retraining, supporting geometry-conditioned restoration as an effective alternative to fixed classical filtering across heterogeneous stacks.
Read the full abstract

All authors Getnet Demil, Muhammad Farhan Humayun, Tomi Westerlund, Jukka Heikkonen, Mourad Oussalah

2608.29384 · 29 Aug · Its IEEE Geoscience And Remote Sensing Symposium (IGARSS) 2026 Data Fusion Contest Winner Paper. reference https://www.grss-ieee.org/community/technical-committees/winners-of-the-2026-ieee-grss-data-fusion-contest-sar-temporal-storytelling/

Number Theory

The average number of rational preperiodic points of polynomials over $\mathbb{Q}$

Let $M_d(X)$ denote the average number of rational preperiodic points among degree-$d$ polynomials over $\mathbb{Q}$ with vanishing $z^{d-1}$ coefficient, constant term $1$, and height at most $X$. We prove that, for every integer $d\ge2$, $M_d(X) \sim \gamma_d X^{-1}$ for an explicit constant $\gamma_d>0$. For $d\ge4$, the error term is $O_{d,\varepsilon}(X^{-2+\varepsilon})$ for every $\varepsilon>0$; for $d=3$ the error term is $O(X^{-3/2})$; and for $d=2$ the error term is $O(X^{-3/2}\log X)$.
Read the full abstract

History and Overview of Mathematics

Mohsen Hachtroudi and the Geometry of Differential Equations

Mohsen Hachtroudi (1908–1976) was one of the founders of modern mathematics in Iran and the first Iranian mathematician to gain international recognition for original research in modern times. A student of Élie Cartan, he introduced the canonical projective connection now known as the Hachtroudi connection, whose significance has become increasingly apparent through later developments in Cartan geometry, CR geometry, and parabolic geometry. This article combines a historical and mathematical study of\\ Hachtroudi's life and work. It examines his education in Iran and France, his role in establishing modern mathematical research and higher education in Iran, and his influence as a teacher, essayist, and public intellectual. It also presents a modern account of his mathematical contributions and their continuing impact on the geometry of differential equations and the theory of geometric structures.
Read the full abstract

Cryptography and Security

Safe to Resume? Breaking Execution Continuity of Agent Execution via Rollback

AI agents are moving toward persistent, stateful execution across various applications, accumulating execution state and external effects that are costly to reconstruct after failures. Checkpoint and rollback (C/R) are becoming essential for recovery, yet their security implications remain largely unexplored. Correct rollback does not imply secure recovery: a faithfully restored checkpoint may resume an execution whose states, assumptions, and external effects never coexisted in any valid history. In this paper, we present the first systematic security study of checkpoint and rollback in existing agent systems. By examining representative agent C/R systems, we characterize the design space of existing C/R mechanisms and develop a general execution model that captures their recovery boundaries and state dependencies. From this model, we identify five fundamental failure modes spanning incomplete or inconsistent internal state, stale external dependencies, nondeterministic replay, and unrecorded external effects. We further demonstrate their security impact through three end-to-end attacks on Hermes, Cline, and LangGraph, enabling malware-verification bypass, unauthorized mail forwarding, and double payment. To systematically study these failures in practice, we develop a multi-agent analysis pipeline that reconstructs execution semantics, identifies violations of the five failure conditions, and validates them through actual rollback. Across five representative frameworks, our evaluation shows that these failures recur across heterogeneous C/R designs and stem from a common gap between the state restored by a checkpoint and the dependencies required for secure continuation.
Read the full abstract

All authors Guanlong Wu, Dahui Li, Ke Jiang, Jianyu Niu, Cong Wang, Yinqian Zhang

Logic in Computer Science

A quantum let within the lambda calculus

Since the seminal work of Selinger and Valiron, the standard design for quantum lambda calculi has kept the quantum state outside the program: terms manipulate pointers to an external register. This is largely due to the difficulty of eliminating tensor products. For example, the calculus $\lambda_\rho^\circ$ embeds density matrices directly within terms, where terms carry the entire computation state, a feature particularly appealing for program verification. However, lacking a tensor elimination construct, it can neither access the individual qubits of a compound state nor discard them. Borgna showed that this inability to discard qubits makes the calculus strictly less expressive than the quantum lambda calculus of Selinger and Valiron. In this paper we show that tensor elimination is possible in this setting. The key observation is that the Pauli decomposition, combined with the spectral decomposition of the Pauli matrices, allows any $n$-qubit density matrix to be expressed as a real linear combination of tensor products of single-qubit density matrices. Exploiting this fact, we extend $\lambda_\rho^\circ$ with a construct $\mathrm{let}\ x^{\otimes n} = \rho\ \mathrm{in}\ t$, which binds each $x_i$ to a single-qubit density matrix arising from the decomposition of $\rho$. We equip the extended calculus with a rewrite system, a type system, and a denotational semantics, and prove Subject Reduction, Progress, Strong Normalisation, Soundness, and Adequacy. The new construct also recovers the missing ability to discard qubits, thereby restoring expressiveness. Moreover, we show that this is achieved in a physically principled way: a variable unused in $t$ is interpreted exactly as being partial-traced out, as dictated by the no-deleting theorem. We illustrate the resulting compositionality through quantum teleportation and the three-qubit bit-flip code.
Read the full abstract

Robotics

Bridging Semantics and Physics with Constrained LLMs for Safe and Trustworthy Robotic Manipulation

A language-guided robot operating in a real kitchen must do more than produce a plan that appears correct. It must also execute that plan safely in cluttered environments under imperfect perception. Large language models (LLM) can decompose instructions into action sequences, yet a language-action gap remains: a plan may appear valid linguistically while being physically infeasible under kinematic and collision constraints. We bridge this gap by formalizing the reasoning-execution boundary as a typed contract. From RGB-D observations, the system grounds perceived objects in an explicit, collision-aware scene model and constrains language-level decisions through schema-validated tool calls defined by the Model Context Protocol (MCP), rejecting malformed commands before they reach the robot. Each validated call is deterministically grounded in a MoveIt Task Constructor pipeline, where candidate motions are evaluated against the reconstructed planning scene in a verify-then-act step. Only trajectories that pass both kinematic and collision checks are sent to the robot. On a physical UFactory 850, the method achieves up to 80% success across ten trials per task on pouring tasks involving liquids, granular media, and discrete solids. It achieves 90% success on a grasp-and-place task using the same planning, protocol, and verification stack. Although a scripted policy slightly outperforms our method on the easiest task, its success rate falls to 10% on the hardest, compared with 60% for our method.
Read the full abstract

Computation and Language

Arabic Safety Alignment as Selective Refusal: An Empirical Study of SFT, DPO, and Guard Calibration

Arabic large language models must refuse harmful prompts without over-refusing benign or sensitive prompts, yet a single refusal rate hides this trade-off. We evaluate it using benign refusal B and harmful-prompt refusal H, where H measures refusal rather than harmful compliance. Across five Arabic-capable models and 130 runs on the full human-written AraSafe set, refusal-only supervised fine-tuning (SFT) collapses toward blanket refusal, whereas selected mixed-SFT configurations reach H = 90% to 93% at B = 14% to 23%; four selected configurations exceed the H = 90% target in all three runs, while Fanar does so in two of three. Direct Preference Optimization (DPO) and inference guards change B and H differently across models rather than acting as uniform upgrades. In a blinded 300-response audit, annotator binary-refusal agreement is 89.0% (kappa = 0.78); Qwen3Guard and Aya Expanse 32B reach 88.7% and 91.0% accuracy, respectively, with no conclusive paired difference. Selected SFT raises H on Arabizi for all five models, but none reaches 90%, showing only partial transfer from Modern Standard Arabic. Overall, the results support model-specific operating-point selection: set a deployment target and retain only interventions that improve it.
Read the full abstract

Mathematical Physics

Simultaneous Reconstructions of (x,t) -Dependent Coefficients and Initial Conditions of Parabolic Equations

This is the first publication, in which an inverse problem of the simultaneous reconstruction of an unknown (x,t) - dependent coefficient and an unknown initial condition in a general linear parabolic equation of the second order is considered. The input data depend on (n+1) variables and are, therefore, formally determined ones. Stability estimates and uniqueness theorem are obtained for this inverse problem. As a by-product, logarithmic stability estimates for initial conditions of parabolic equations and inequalities with time reversed data are obtained for the first time. All known publications about inverse problems for parabolic equations with formally determined input data and unknown coefficients assume that those coefficients depend either only on x or only on t. In addition, the initial condition is assumed to be known, except of two publications cited in the text. The inverse problem of this paper has two potential applications. The first one is in forecasting of public opinions in the framework of the Mean Field Games theory. The second one is in tracking spatiotemporal outbreaks of epidemics.
Read the full abstract

Artificial Intelligence

Evaluating Tiny Recursive Models Across Training for Code Generation

Code generation increasingly relies on large transformer models, whose capability advances with scale. Yet such a scale is costly, creating demand for small models, especially where data is limited. Recursive models address this by reusing a single block to add depth rather than stacking independent layers. Such models are typically evaluated by teacher-forced fit (next-token loss on ground-truth prefixes) or task accuracy, at a single checkpoint, whereas code is produced by free-running generation, where the model extends its own output. Whether a teacher-forced advantage survives free-running generation, and whether it holds across training, remains open. To study both, we compare a ~28M-parameter autoregressive Tiny Recursive Model (TRM-AR) on natural-language-to-Python code generation against parameter-matched and depth-matched controls, tracking fit and generation across 40 epochs and three seeds. The fit ranking between the recursive model and the depth-matched control reverses twice. Selecting each checkpoint by validation loss and examining the trajectory yields a consistent comparison. At equal parameters, TRM-AR fits, generates, and generalizes better than the parameter-matched control while recovering approximately 45% of the validation-loss gap and 57% of the generation-quality gap between the two controls, at roughly 175 times the per-step cost of the parameter-matched control. However, at equal effective depth, the larger transformer fits and generates better at its validation optimum, suggesting TRM-AR's advantage lies in resistance to overfitting, not greater capability. These findings suggest that recursive code generation models should be evaluated jointly on fit and generation across the training trajectory rather than at a single checkpoint.
Read the full abstract

Combinatorics

Proper Conflict-Free Choosability for Graphs with Bounded Average Degree

For a graph $G$, a proper coloring of $G$ is called proper conflict-free if for every non-isolated vertex $u$, there is at least one color appearing exactly once in $N_G(u)$. A graph $G$ is proper conflict-free $f$-choosable if for every list assignment $L$ with $|L(v)|\ge f(v)$ for each vertex $v$, $G$ admits a proper conflict-free $L$-coloring. Recently, Kashima, Škrekovski, and Xu proposed a conjecture on proper conflict-free list coloring. For a graph $G$, let $\kappa_G:V(G)\to \mathbb{N}$ be defined by \[ \kappa_G(v)= \begin{cases} 4, & \text{if } d_G(v)=2,\\[4pt] d_G(v)+1, & \text{if } d_G(v)\neq 2. \end{cases} \] They conjectured that every connected graph other than $C_5$ is proper conflict-free $\kappa_G$-choosable. In this paper, we confirm this conjecture in two classes of graphs with bounded average degree, thereby generalizing results of Kashima, Škrekovski, and Xu and of Wang and Zhang. We prove that every connected graph $G\neq C_5$ with either $\operatorname{mad}(G)<\frac{12}{5}$ or $\Delta(G)\le3$ is proper conflict-free $\kappa_G$-choosable. To prove these results, we introduce a method based on systems of proper conflict-free representatives and develop a construction of auxiliary graphs that preserves the maximum average degree bound.
Read the full abstract

Computer Vision

Think, Look, and Revise: Inconsistency-Aware Visual Self-Correction in MLLMs

Tool-augmented multimodal reasoning integrates external tools (e.g., object detection, depth estimation) into multimodal large language models (MLLMs) to address perceptual bottlenecks in complex visual tasks. However, existing approaches rarely verify tool outputs, limiting their ability to detect and recover from tool failures. We propose ReVISE, a framework that equips MLLMs with verification and dynamic error recovery for tool-augmented reasoning. ReVISE introduces (1) a curated training dataset that supervises reflective behaviors, enabling models to validate tool-derived evidence, reformulate queries when visual mismatches arise, and fall back to intrinsic grounding when external tools are unreliable; and (2) a reinforcement learning based targeted rewards that encourage internal reflection and penalize spatial misalignment. Experiments on several benchmarks demonstrate consistent improvements over existing methods, highlighting the importance of error detection and correction in tool-augmented multimodal reasoning.
Read the full abstract

Quantum Physics

Convex conservation of von Neumann entropy implies unitarity or antiunitarity

On the space of density matrices $D(H)$, Kadison's theorem establishes that all invertible convex transformations $K:D(H)\to D(H)$ are unitarity or antiunitary. For a finite Hilbert space, we propose a similar theorem which replaces the invertibility requirement with that of entropy conservation. Thus, we argue, the supposition of reversibility in quantum mechanics may be replaced with a principle of entropy conservation.
Read the full abstract

Artificial Intelligence

FORESIGHT-9: Prospective and Process-Aware Evaluation of Adaptive Trading Agents

Retrospective backtests provide a limited test of adaptive trading agents: they cannot rule out historical contamination, expose sensitivity to a single realized market path, or reveal internal degeneration during long-horizon adaptation. We introduce FORESIGHT-9, a prospective and process-aware benchmark built from nine auditable counterfactual stress worldlines branching from a common July 2026 information boundary. Each worldline specifies staged macro-financial events and joint multi-asset anchors; a deterministic generator realizes the trajectories, while observations are disclosed according to in-world time. A common contract standardizes observations and execution while preserving each agent's native adaptation loop. We evaluate two adaptive trading-agent frameworks with two foundation-model backbones across 36 long-horizon runs. Agent rankings vary substantially across worldlines and backbones, and a fixed equal-weight policy outperforms 31 of 36 runs. Process telemetry exposes failures that terminal returns conceal: in one high-return run, the live factor library collapsed while executed holdings converged to the equal-weight fallback, even though decision records continued to report an active factor ensemble. FORESIGHT-9 therefore evaluates not only portfolio outcomes, but whether adaptive agent state and execution remain coherent across alternative futures. We release the worldlines, trajectories, audit traces, and regeneration scripts.
Read the full abstract

All authors Xiangxin Luo, Chengtian Hong, Haohua Li, Yongyi Xie

Networking

Who Resolves Your DNS? Measuring Resolver Opacity and Closing the Visibility Gap

DNS resolution has no notion of a verifiable resolver path. When an ISP outsources resolution to a third-party provider, a user's queries can cross organizational and national boundaries without their awareness—and the client that issued them has no protocol mechanism to learn which resolvers handled the query, where they sat, or who operated them. We argue that this opacity is an architectural gap rather than a deployment accident, and that a reported, verifiable resolver path should be a first-class goal of the resolution protocol. We motivate this with measurement and then show the gap is cheap to close. Using RIPE Atlas across 190 countries, we find that resolution routinely leaves the client's organization and country: under a conservative in-AS treatment of unattributable observations, 39.8% of observed resolver chains (6,622 of 16,636) use a frontend in a different AS than the client, one in four geolocatable anycast frontend pairs resolves outside the client's country, and a single operator—Google Public DNS—accounts for roughly two-thirds of those out-of-country cases. We then present Resolver-Path, an approach in which participating resolvers report their identity as they forward the query. Its base layer is cooperative in-band disclosure, it carries resolver-path metadata at near-neutral throughput, latency, and CPU cost. Because a non-participating resolver can ignore or strip the option, disclosure alone establishes the verifiable presence of reported hops, not the absence of hidden ones. Attestation authenticates the integrity, ordering, and freshness of the cooperative assertions carried by the selected response. Together, disclosure and attestation provide bounded evidence about the selected response's reported resolver chain—the substrate DNS currently lacks for jurisdictional accountability.
Read the full abstract

Instrumentation and Methods for Astrophysics

Characterization of the stabilized nulling interferometry testbed PERSÉE

Observing exoplanets is hindered by high stellar contrast and tiny angular separation. Nulling interferometry addresses this by recombining two pupils for destructive interference on the star and constructive interference on the planet. However, maintaining deep nulls despite external disturbances requires sub-nanometer optical path difference (OPD) stability and sub-hundredth Airy disk pointing control. To validate this technology for a space mission, the PERSEE laboratory demonstrator bench was developed by a CNES-led consortium and integrated at the Meudon Observatory. Simulating a complete space mission setup, PERSEE targeted a stable star extinction rate of 1e-4 with variations of 1e-5 over several hours under simulated disturbances. The thesis focused on the multi-stage integration, calibration, and characterization of the bench's critical components and cophasing control loops. By implementing a Linear Quadratic Gaussian (LQG) controller optimized through preliminary disturbance measurements, the system mitigated multi-frequency vibrations (1-100 Hz, tens of nanometers amplitude), reducing residual OPD to 0.3 nm RMS and tip-tilt errors to 0.4 percent of the Airy disk. These stabilization controls achieved a record null rate of 8.8e-6 with 9e-7 stability over several hours in the 1.65-2.45um spectral band, surpassing initial specifications by an order of magnitude. Extrapolating these results to space missions indicates that with 40 cm telescopes and 100 Hz control loops, exoplanet observations are feasible for stars brighter than 9th magnitude.
Read the full abstract

Machine Learning

Unlearning on Spatio-Temporal Graphs through Subgraph Virtual Edge Reconstruction

Spatio-temporal graphs are widely used in modeling complex dynamic processes such as temporal forecasting, molecular dynamics, and healthcare monitoring. Recently, stringent privacy regulations such as GDPR and CCPA have introduced significant new challenges for existing spatio-temporal graph models, requiring complete unlearning of unauthorized data. Since each node in a spatio-temporal graph diffuses information globally across both spatial and temporal dimensions, existing unlearning methods primarily designed for static graphs and localized data removal cannot efficiently erase a single node without incurring costs nearly equivalent to full model retraining. To address this, we propose CallosumNet, a spatio-temporal graph unlearning framework biologically inspired by the corpus callosum structure. CallosumNet makes two key technical contributions: (1) it reconstructs subgraphs using biologically-inspired virtual edges; and (2) it restores interlinked spatio-temporal dependencies among subgraphs via a lightweight meta-graph integration layer. Empirical results on four diverse real-world datasets show that CallosumNet achieves complete unlearning while maintaining accuracy very close to the gold model. The code is publicly available at https://github.com/wenlu-lab/STGraphUnlearning.
Read the full abstract

All authors Qiming Guo, Wenbo Sun, Chen Pan, Ye Wang, Wenlu Wang

Artificial Intelligence

Reviving our data foundations is the most disruptive step to data maturity

The most disruptive step that enterprises of small-medium size and maturity can take to make the most of the latest technological advances in AI is to step back from the hype and focus on establishing or reviving a good knowledge foundation layer. It is a hard message to present to the executive team; therefore, it needs to be backed by evidence, and its implementation needs to be of minimal impact on the existing processes. In this vision statement, we discuss how we need to rethink what evidence speaks to the decision-makers and propose a low-impact data strategy that adapts to the existing and ever-changing data flows and processes across the company. We firmly believe that knowledge graph techniques will increasingly become non-negotiable in the data strategy of an AI-powered enterprise, provided that we approach their design in a modular, dynamic and cross-functional way.
Read the full abstract

Metric Geometry

Sharp Metric $X_p$ Inequalities via Martingales

We prove a sharp higher-order Rademacher-chaos inequality on the Hamming cube using random-reveal martingales. As a consequence, we obtain the sharp metric $X_p$ inequality for $L^p$, resolving an open question posed by Naor.

Optimization and Control

Strike Price Optimization for ISO New England's Day-Ahead Ancillary Services

ISO New England's (ISO-NE) Day-Ahead Ancillary Services Initiative settles reserve products as financial call options on real-time energy prices. The system-wide strike price creates an efficiency-reliability tradeoff: increasing it lowers competitive reserve offers, but weakens resources' incentives to incur preparation costs and remain available for real-time performance. The existing strike price rule does not explicitly account for heterogeneous resource incentives and reserve requirements. We develop an optimization framework that selects the highest strike price while ensuring that enough resources retain an incentive to prepare and collectively satisfy the reserve requirements. Because a resource's preparation decision may affect the resulting real-time price distribution, its incentive depends on an unobservable counterfactual. To address this, we derive a tight lower-bound certificate using only the available conditional price distribution and a bound on the resource's price impact. We show that each resource enters the optimization through a single incentive threshold and that any finite optimal strike price occurs at one of these thresholds. This yields a tractable exact solution method based on threshold calculations and a small number of linear feasibility checks. Using reconstructed ISO-NE conditional price distributions and representative gas-fired resources, we find that higher heat-rate combustion turbines are more likely than combined-cycle resources to constrain the strike price choice.
Read the full abstract

All authors Karl Zhu, Parviz Alivand, Jinye Zhao, Tongxin Zheng, Dimitris Bertsimas

High Energy Astrophysical Phenomena

Rapid Energy Dissipation by Colliding Waves in Strongly Magnetized Plasmas

Rapid dissipation of magnetic energy in highly magnetized environments around neutron stars and black holes is a key open question in high-energy astrophysics. We develop a general kinetic picture of counter-propagating wave collisions in magnetized pair plasmas for arbitrary polarizations and find that magnetic energy can be dissipated on the wave-crossing timescale. The two magnetohydrodynamical conditions on the field invariants, $I_1\equiv B^2-E^2>0$ and $I_2\equiv \mathbf{E}\cdot\mathbf{B}=0$, can be spontaneously violated during the collision. Parallel electric fields develop to screen nonzero $I_2$ with little energy loss, consistent with the evolution described by Force-Free Electrodynamics. When magnetic dominance is lost, strong particle energization is triggered, dissipating magnetic energy on the wave-crossing timescale. This dynamical process yields a rapid dissipation channel of magnetic energy and provides a kinetic pathway to high-energy emission.
Read the full abstract

Computer Vision

Sketch2Inspire: Structure-Sensitive Evaluation for Product Retrieval

Early-stage product design retrieval often requires more than category recognition: designers may need reference examples that match both a short semantic intent and a rough structural cue. Existing product-image resources and generic image–text retrieval benchmarks rarely separate category retrieval from within-category structural fit. We present Sketch2Inspire, built from a curated subset of Amazon Berkeley Objects with aligned text queries, edge-based sketch-proxy queries, and fused text–sketch queries. The resource separates broad category-level retrieval from structure-sensitive within-category retrieval and includes a human-graded reference protocol for calibration. We evaluate a lightweight reference system based on pretrained CLIP-family encoders, comparing text-only retrieval, sketch-only retrieval, weighted late fusion, and text-first reranking without updating model weights. Under broad relevance, late fusion obtains the highest score (nDCG = 0.9962). Under automatic structure-sensitive relevance, late fusion again obtains the highest score (nDCG = 0.7015), exceeding text-only retrieval (nDCG = 0.5912). In the human-graded results, late fusion obtains the highest nDCG@10 (0.9133), while text-only retrieval ranks second (0.9030). These results show that the retrieval gain from multimodal input depends on how relevance is defined. Sketch2Inspire therefore provides a diagnostic resource for evaluating modality contribution and supports the development of structure-aware product-retrieval protocols with independent human annotation.
Read the full abstract

Artificial Intelligence

TRACER: Per-Tool Context Retention for LLM Agents via Consequence-Attributed Reinforcement Learning

Enterprise data agents answer business queries by chaining many tool calls over multiple reasoning steps, routinely accumulating hundreds of thousands of context tokens per session. Existing compression strategies typically allocate retention budgets without accounting for the downstream consequences of removing individual tool outputs. Aggressive compression may therefore trigger costly tool re-invocations that offset the initial savings. We call this the compression–consequence gap. To close it, we propose TRACER, which formulates compression as a sequential per-tool decision problem. A lightweight REINFORCE policy assigns query-conditioned retention ratios using only information available at each compression event. Its consequence-aware objective jointly accounts for task success, total token consumption, and post-compression tool re-invocations. To improve credit assignment, TRACER uses a learned outcome model to compare the predicted consequences of the selected retention ratio with those of fully retaining each tool output. On held-out production queries across three compressor backends, TRACER reduces total token consumption by 29–46% relative to keeping all context while maintaining comparable or higher task success. Compared with a tool-type-conditional static policy, TRACER provides an additional 15–18% of token savings. Interventional rollouts show that the learned per-tool credit scores correlate with measured single-tool consequences. The learned policy also yields positive savings when transferred across agent backbones and compressor architectures, and reduces token consumption by 18–25% on five held-out LOCA-bench environments. These results demonstrate the value of consequence-aware, per-tool context retention for improving the efficiency of long-horizon language agents.
Read the full abstract

All authors Ziqi Lin, Ye Wu, Mengying Yang, Xu Liu, Yizhou Liu, Qiang Ke, Qin Guo

Performance

Spectral Analysis for Sparse Matrix Computation: Insights and Potential

Sparse computations are fundamental to scientific computing, graph analytics, and machine learning, yet their performance is highly sensitive to the diverse sparsity and patterns. This is because cache reuse, memory coalescing, and load balancing depend critically on the sparsity patterns. This work gives the first known exploration of the connections between sparse matrix computation and spectral analysis by treating sparse matrices as two-dimensional signals and analyzing their frequency-domain representations through Fast Fourier Transform. We show that spectral signatures uncover global structural characteristics that are not sufficiently captured by conventional spatial statistics and provide complementary information for understanding sparse computation performance. Experiments on incorporating spectral features into machine-learning-based SpMV format selection demonstrate the usefulness of such spectral analysis over a state-of-the-art spatial-only model. By uncovering the principled connections between spectral characteristics and sparse matrix computations, this work introduces a novel analytical perspective into sparse computation, and provides a new approach to enhancing the current sparse structure characterization and optimization. On pruned LLM decoding, adding spectral features improves kernel selection and yields 1.035–1.245$\times$ kernel speedups.
Read the full abstract