Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Monday 9 November

Artificial Intelligence

Towards Scalable Network-Based Interventions for HIV Treatment and Prevention via R2C-Agent

Human Immunodeficiency Virus (HIV) remains a pressing public health challenge worldwide. Targeting limited HIV prevention and treatment resources effectively with network-based algorithms is a long-standing problem with a rich history at AAMAS and other computational venues. However, optimizing targeted biomedical interventions for minimizing spread of HIV often requires observability of the contact network of HIV transmission risk behavior among individuals, which is prohibitively expensive to collect at scale. Peer referral networks, i.e., networks collected through a recursive peer referral process, are an alternative network class often used to study HIV in hidden populations that can be collected digitally at scale, but they deviate from the underlying contact network: referrals can follow non-risk social ties and participants accept only one referral, hiding contacts among already-recruited individuals. In this work, we first formalize the novel problem of planning network-based interventions to minimize HIV spread in the hidden contact network while observing only the peer referral network. Second, we implement R2C-Agent, a decision making agent for interventions that is designed around our new conditional graph diffusion model called Referral-to-Contact Diffusion (R2C-Diff). R2C-Diff positions the peer referral process as incremental corruption of the underlying contact network and learns to reverse it. R2C-Agent plans its interventions over contact networks sampled from R2C-Diff, so its decisions account for uncertainty about the hidden contact network. Finally, we conduct simulated experiments using real-world HIV network data that demonstrate that R2C-Agent empirically plans more effective interventions than baselines from interdisciplinary literature and highlight key tradeoffs and assumptions driving performance.
Read the full abstract

All authors Akseli Kangaslahti, Milind Tambe, Alastair van Heerden, Cheryl Johnson

Machine Learning

One Trajectory, Two Requirements: Accuracy and Local Stability in Euler Sampling for Flow Matching Policies

Flow matching robot policies commonly use a fixed Euler step count selected from offline accuracy sweeps. At inference time, however, each policy input (visual observation, robot state, and language instruction) together with a source-noise draw defines a different ODE trajectory and sequence of local Jacobians. We ask whether a step count that accurately follows the nominal noise-to-action trajectory can still be too coarse for strongly contracting directions around it. An exact two-coordinate system and a controlled augmentation of six trained flow models show that trajectory accuracy and local Euler stability can impose different step requirements even when the original learned transport is unchanged. We then study a frozen $\pi_{0.5}$-LIBERO checkpoint without modifying its weights or action dynamics. Across 30 policy inputs from 10 LIBERO-10 tasks, the Jacobian exhibits strong contracting directions near the action endpoint, yet no sampled mode violates the Euler non-expansion condition. On five of those inputs, accuracy sweeps require 4–9 Euler steps at 5% terminal error and 87–112 at 1%. These five paired cases are therefore consistent with accuracy-limited rather than stability-limited sampling under this local criterion, while the controlled experiments show why endpoint accuracy alone cannot rule out a separate stability requirement.
Read the full abstract

Computer Vision

ABRR: Transforming Temporal Sentence Grounding with Wasserstein-Adaptive Refinement and Precision Ranking

Temporal Sentence Grounding (TSG) aims to localize temporal segments in untrimmed videos that correspond to natural language queries, a critical task for video understanding with applications in video retrieval, summarization, and human-computer interaction. Despite significant progress driven by transformer-based models, existing TSG methods suffer from two key limitations: quantization errors due to temporal downsampling, which misalign segment boundaries, and suboptimal ranking of predictions based on semantic matching rather than localization precision. To address these challenges, we propose the Adaptive Boundary Refinement and Ranking (ABRR) framework, a novel, model-agnostic post-processing approach that enhances the performance of any TSG model without retraining. ABRR integrates three innovative components: (1) Temporal Distribution Smoothing, which mitigates noise in predicted score distributions using Gaussian kernel convolution; (2) Boundary Refinement via Optimal Transport, which leverages the 2-Wasserstein distance and Sinkhorn iterations to align coarse segment boundaries with true temporal moments, grounded in Monge-Kantorovich optimal transport theory; and (3) Quality-Driven Re-Ranking, which reorders predictions using a composite score balancing localization precision and semantic relevance. By correcting quantization errors and prioritizing accurately localized segments, ABRR achieves substantial improvements over state-of-the-art TSG models. Extensive experiments on benchmark datasets, including Charades-STA, ActivityNet Captions, and QVHighlights, demonstrate consistent gains at stringent IoU thresholds (e.g., IoU=0.7), alongside enhanced ranking performance. The framework's computational efficiency and compatibility with existing models make it a versatile and impactful solution for real-world TSG applications.
Read the full abstract

All authors Xiang Fang, Wanlong Fang, Junhao Dong, Daizong Liu

Distributed Computing

PegasusAI Studio: Legible Cyberinfrastructure and Accountable AI Agents for Scientific Workflows

AI coding agents can now construct scientific workflows, but operating them on shared cyberinfrastructure (CI) raises problems that code generation does not solve. Agents need current knowledge of the workflow system and its execution sites and access to the runtime state of distributed executions, while facilities need to attribute every agent action to a user and bound it by that user's privileges. We present PegasusAI Studio, an AI-assisted science gateway built on the Pegasus and HTCondor stack. Studio makes CI legible to agents by projecting one facility-curated knowledge base into the native configuration of several coding agents, by introspecting workflow interfaces and execution sites, and by grounding diagnosis in workflow and scheduler telemetry. Agent actions operate within a trust envelope that combines federated authentication, per-user execution environments and scheduler credentials, provider-neutral model access, observability, and approval controls for state-changing actions. The same application runs as a JupyterHub-based gateway on a research cloud and as an Open OnDemand application on HPC systems. We evaluate Studio through case studies of legacy CASA weather workflow modernization, a gravitational-wave reanalysis, an EEG analysis built with an open-weight model, and an Event Horizon Telescope (EHT) M87 image reconstruction that recovered from two failed runs to a zero-failure execution. The evaluation establishes that these mechanisms operate as designed.
Read the full abstract

All authors Komal Thareja, Mats Rynge, Berent Aldikacti, Angelina Ju, Ian Lumsden, Anirban Mandal, Rajiv Mayani, Kin Wai Ng, Hamza Safri, Michael Stealey, Sai Swaminathan, Michela Taufer, Karan Vahi, Michael Zink, Ewa Deelman

Computer Vision

Domain-Adversarial Adaptation from MURA to In-House Radiographs for Improved Adult Elbow Fracture Classification

We studied domain shift in adult elbow fracture classification from radiographs when training on a large public dataset and deploying on a small, institution-specific dataset (UofL). We implemented a domain-adversarial neural network (DANN) to align feature distributions across source (MURA) and target (UofL) domains while optimizing fracture classification. A pretrained convolutional backbone was adapted to grayscale inputs; the task head predicts fracture presence, and a gradient-reversal-based domain head encourages domain-invariant features via adversarial learning. We compared four settings: (1) Source-only, (2) Target-only (limited labels), (3) Naive merge (pooled training), and (4) DANN (MURA to UofL). Evaluation on UofL test data uses AUC-ROC, and accuracy. DANN outperformed Source-only and Naive merge baselines by reducing domain bias without overfitting to the small target set. Ablations showed that progressive adversarial weight, dataset-size-aware domain loss, and domain-balanced sampling improved stability and target performance. Results demonstrated that domain alignment is a practical path to robust clinical generalization from public to local data.
Read the full abstract

All authors M. Bolhassani, W. Furtado, D. Duvall, MJ Negahdar, J. Joshi, S. Contractor, A. Amini

Robotics

Does Haptic Connection to a Healthy Partner Improve Motor Learning in Chronic Stroke? A Pilot Study of Robot-Based Dyadic Training

Purpose: Robot-based haptic dyads, where two users exchange forces through robots, have been proposed for robot-assisted neurorehabilitation. This intervention could increase motor learning by promoting motor variability, providing an implicit communication channel, and facilitating social interaction. Despite the potential benefits, few studies have investigated robot-based haptic dyads for neurological populations, and none have included a comprehensive clinical assessment. Design/Methodology/Approach: We present a pilot study investigation of individuals with chronic stroke learning a complex tracking task in solo and dyad conditions. Prior to training, participants completed a battery of cognitive, motor, and sensory assessments. We assessed changes in key kinematic outcomes including tracking error, distance traveled, mean absolute power, and sample entropy. We also performed a correlation analysis of clinical scores with baseline tracking errors. Findings: Baseline tracking error was strongly correlated (r > 0.6) with lower cognitive scores and higher motor scores. Only the solo group demonstrated lower tracking error at assessment ({\Delta} = -5.33, 95%CI [-10.25, -0.40], p = 0.027), but this result was tempered by the removal of an outlier participant. Neither group demonstrated clear retention. The dyad group showed significantly elevated performance, effort, and movement complexity during training. Research Limitations/Implications: The selected task was too difficult to reveal learning for either group, which may be related to its high cognitive demand. Sample size and stroke heterogeneity were also limitation. Originality/Value: Dyadic training increased movement complexity and effort, which are associated with better motor learning. Clinical characteristics such as lesion location, cognition, sensation, and chronicity may influence potential benefits of dyadic training.
Read the full abstract

All authors Erica L. Waters, Natalia Stroutinsky-Sobotka, Reem M. Azar, Frances S. Shofer, Pamela Z. Cacchione, Rochelle J. Mendonca, Michelle J. Johnson

Machine Learning

Train High, Ship Low: Efficient LoRA Synchronization for Distributed On-Policy Post-Training

Transmitting LoRA adapters to rollout workers can bottleneck distributed on-policy post-training over bandwidth-constrained networks. Lowering the training rank may limit the capacity a workload needs, while adaptive optimizer updates are difficult to compress. Rollout workers can instead reconstruct updates from gradients by maintaining replicated optimizer states. We introduce HiLo, a compressor-agnostic framework that replaces parameter transmission with compressed gradient dissemination and local optimizer replay. By applying the same decoded gradients, the learner and workers maintain consistent policy states at the same version under reproducible execution. We further develop Spar, a budget-aware gradient compressor that combines spectral truncation, adaptive rank allocation and error feedback to decouple training rank from communication cost. Experiments across on-policy distillation and reward-guided post-training show that HiLo with Spar maintains learning quality close to full synchronization while transmitting as little as 1.6% of the adapter bytes, and accelerates end-to-end updates by up to $2.2\times$ under bandwidth constraints.
Read the full abstract

Geometric Topology

Every hyperbolic knot has an arc-faithful closed braid diagram

Every hyperbolic knot admits an arc-faithful closed braid diagram, answering Conjecture 29 of McPhail-Snyder. More precisely, any braid representing the knot can be reworded in the same braid group so that the complete holonomy has distinct incoming parabolic fixed points at every crossing. The construction replaces a pinched crossing by five non-pinched crossings when a suitable third strand is adjacent. On $n$ strands it uses at most $2n-1$ letters per replaced crossing. The resulting diagram realizes the complete holonomy by nondegenerate shapes in its four-term octahedral decomposition.
Read the full abstract

Computer Vision

DUO: Dual Readouts of Diffusion Models for OOD Detection

Diffusion models are powerful generative methods for learning and sampling from complex data distributions. Safely deploying these models requires detecting inputs that fall outside their training distribution. Because diffusion models recover clean samples from noisy inputs, reconstruction error is often used for out-of-distribution (OOD) detection. This approach assumes that in-distribution (ID) inputs are reconstructed more accurately than OOD inputs. However, OOD inputs may be reconstructed equally well or even better, making this score unreliable. We therefore propose the leading sensitivity spectrum of intermediate denoising features as a complementary OOD signal and demonstrate that it remains informative when reconstruction error is misleading. We introduce DUal-readout of diffusion models for OOD detection (DUO), a fully unsupervised, training-free OOD detector that combines reconstruction error and feature sensitivity. DUO improves average AUROC by approximately 6% points over the strongest baselines while substantially reducing inference cost, and achieves SOTA on near-OOD and high-resolution benchmarks.
Read the full abstract

Numerical Analysis

A Second-Order Parallel Neumann-Robin Splitting for the Stokes-Biot System with a Linear Time-Step Restriction

In this paper we develop a second-order, fully decoupled, non-iterative partitioned method for the time-dependent Stokes–Biot problem on fixed domains. In previous work \cite{WangLeeCanic2026SecondOrder}, a Robin–Robin scheme with these features was introduced, and its stability and error estimates were established under the sufficient parabolic CFL-type condition $\Delta t\lesssim C_*h^2$. The main improvement of the new scheme is weakening the CFL-type condition to a linear CFL-type condition $\Delta t \lesssim C_*h$. This can be achieved with a new splitting approach by replacing the poroelastic mechanical normal Robin condition by its physical Neumann-type traction condition, which results in a Neumann–Robin splitting. For fixed coefficients satisfying the stated assumptions, we prove a fully discrete energy bound under a restriction of $\Delta t\lesssim C_*h$. The improvement over the parabolic restriction in the earlier Robin–Robin analysis follows from eliminating the interface residual that requires two inverse-trace estimates. We also establish an energy-norm error bound of order $h^k+\Delta t^2$ under explicit regularity, finite element approximation, and initialization assumptions. Numerical experiments with manufactured solutions examine spatial and temporal accuracy and compare the Neumann–Robin and Robin–Robin schemes. A 3D cylindrical pressure-pulse benchmark further investigates their numerical stability behavior. The results distinguish the less restrictive sufficient stability condition established analytically from the observed stability thresholds of the two schemes.
Read the full abstract

Geometric Topology

Handlebody-links with Euler characteristic -2 up to six crossings

We enumerate all non-split handlebody-links with Euler characteristic $-2$ up to six crossings, up to ambient isotopy and mirror image.
Read the full abstract

All authors Giovanni Bellettini, Giovanni Paolini, Maurizio Paolini, Yi-Sheng Wang

Quantum Physics

A Compiler for Fault Tolerant Quantum Computing

Fault-tolerant quantum computing (FTQC) needs compiler intermediate representations (IRs) that preserve error-correcting-code choices, syndrome information, and non-Clifford resource requirements through analysis, simulation, and hardware lowering. We report practical experience building FTQC, an open-source Multi-Level Intermediate Representation (MLIR) dialect that makes logical qubits, syndromes, magic states, and Pauli frames typed static single assignment (SSA) values. Its error-correction-aware type system, two-level lowering design, and IR-resident resource analysis provide one inspectable pipeline to Open Quantum Assembly Language~3 (OpenQASM~3), the Quantum Intermediate Representation (QIR), Stim, and IQM hardware. Case studies across three code families show that typed metadata makes code-specific decisions verifiable and retargetable: on the 20-qubit Pathfinder at Oak Ridge National Laboratory, decoding reduced logical readout error by 3.3 times. They also expose hidden architectural costs: for a three-qubit Quantum Fourier Transform (QFT-3), a magic-state factory requires five times the peak qubits of the encoded circuit. These experiences demonstrate a practical foundation for developing and evaluating fault-tolerant compiler transformations across software and hardware targets.
Read the full abstract

All authors Narasinga Rao Miniskar, Elaine Wong, Seyong Lee, Vicente Leyton-Ortega, Jeffrey S. Vetter, Travis S. Humble

Signal Processing

Thickness-Field-Excited Bimorph Piezoelectric Micromachined Ultrasonic Transducer in Submicrometer Thin-Film Lithium Niobate

This work presents the first demonstration of a submicrometer-thick thickness-field-excited (TFE) lithium niobate (LN) flexural-mode piezoelectric micromachined ultrasonic transducer (PMUT). A 670-nm-thick bilayer periodically poled piezoelectric film (P3F) 128Y LN is used to demonstrate a suspended membrane with an area of 0.25 mm$^{2}$, achieving a low resonance frequency of 33.4 kHz for airborne transduction. Its electrical measurements reveal an extracted effective electromechanical coupling efficiency ($k_{\mathrm{eff}}^{2}$) of 3% and a moderate static capacitance $C_0$ of 17 pF. Meanwhile, mechanical measurements using a laser Doppler vibrometer (LDV) yield a high quasi-static peak out-of-plane displacement ($\xi_{\mathrm{static}}$) of 145 nm/V and a high corresponding open-circuit sensitivity ($S_{\mathrm{OC}}$) of 1.4 mV/Pa in the audio band. The fabricated device is compared with state-of-the-art (SoA) airborne piezoelectric transducers with sub-100-kHz resonance frequencies, underscoring the potential of the TFE P3F LN transducer platform by simultaneously demonstrating strong actuation capability while featuring high sensitivity.
Read the full abstract

All authors Vakhtang Chulukhadze, Jiajun Huang, Zihuan Liu, Will Leskowitz, Tzu-Hsuan Hsu, Yuchen Ma, Udit Rawat, Yao Yu, Bichoy Bahr, Neal A. Hall, Ruochen Lu

Earth and Planetary Astrophysics

Cryohydrologic Flow and Pingo Formation Within Freezing Impact Melts in Occator Crater, Ceres

Ceres is a volatile-rich dwarf planet in the asteroid belt and a potential relict ocean world. It exhibits surface features indicative of subsurface brine activity, particularly within Occator Crater. High-resolution imagery from NASA's Dawn Mission reveals landslides, gullies, carbonate faculae, and mound-like features resembling terrestrial pingos on the floor of Occator Crater. Some of these landforms have been hypothesized to form from water, either from the ascent of deep crustal brines or from the freezeout of impact melt. Here, we test the hypothesis that pingo-like features can be formed via the freezing of shallow impact melts. We simulate the heat transfer and groundwater flow dynamics of a freezing impact melt deposit on the floor of Occator Crater. We test a comprehensive parameter space of regolith physical and material properties relevant to the cerean environment. We find that impact melt freezinf produces pressure gradients sufficient to drive hydrologic flow within the melt matrix and could transport fluids to the near surface through hydraulic fracturing. For most of the parameter space tested, water volumes delivered to pingo candidates on the surface meet or exceed those likely required for pingo formation. Analogous hydrologic processes may be important in the shallow subsurface of other regions of Occator Crater and Ceres at large as well as other ice-rich planetary bodies.
Read the full abstract

Machine Learning

Neural Network-Assisted CLEAN for Efficient Multipath Parameter Estimation in MIMO Systems

High-resolution multipath estimation in wideband multiple-input multiple-output (MIMO) channels requires repeated searches over angle of arrival, angle of departure, and propagation distance. This paper presents neural network-assisted CLEAN (NN-CLEAN), which replaces the multidimensional search at each extraction step with a multi-head classifier while retaining least-squares (LS) estimation of the complex path gain, parametric reconstruction, and residual cancellation. The same classifier is applied to successive residuals, allowing the extraction depth to vary without changing its output structure. With the number of iterations prescribed by the reference multipath-component (MPC) count, off-grid synthetic tests show that NN-CLEAN slightly exceeds grid-search CLEAN (GS-CLEAN) in path accuracy for one and two MPCs, although its accuracy declines more rapidly at larger path counts. For complete three-MPC extraction at a batch size of eight, NN-CLEAN achieves an approximately $27\times$ speedup and a $52$-fold reduction in peak GPU memory relative to GS-CLEAN. Applied without retraining to two-MPC line-of-sight (LOS) and non-line-of-sight (NLOS) Sionna ray-tracing channels within a coded MIMO link, NN-CLEAN substantially reduces channel-reconstruction mean-squared error (MSE) and bit error rate (BER) relative to interpolated LS channel estimation. GS-CLEAN retains an accuracy advantage on these channels, indicating the estimation cost associated with the computational savings.
Read the full abstract

All authors Chaofan Deng, Linyu Sun, Jaeho Lee, Zishen Wan, Arijit Raychowdhury

Computer Vision

Domain adaptation of a video Foundation model for Heart Failure Diagnosis from Echocardiography

The rapid advancement of foundation models has transformed computer vision, yet their adaptation to medical imaging, particularly purpose built foundation models for spatio temporal echocardiography videos, remains limited. In this work, we explore the feasibility of fine tuning a pretrained foundation model for video (TimeSformer) for automated diagnosis of reduced ejection fraction heart failure (HFrEF) from apical four chamber videos. The model is finetuned on the publicly available RVENet A4C dataset with a phase aware clip generation strategy that captures complementary systolic and diastolic dynamics. We employ divided space time attention, layer wise learning rate decay, and multi clip inference to enhance robustness under limited data. Experimental results show that full fine tuning of the proposed model outperforms classifier only tuning and a 3D CNN baseline. These findings highlight the potential of leveraging foundation video models for echocardiography based heart failure diagnosis and motivates further domain adaptation studies in medical imaging.
Read the full abstract

All authors Mahyar Bolhassani, Tijana Geroski, Narayana S. Singam, Amir Amini

Graphics

A Unified Interactive Framework for Real-Time Three-Dimensional Cellular Automata Simulation in XR

Integrating three-dimensional cellular automata (3D CA) into extended reality (XR) requires coordinated simulation, volumetric data management, rendering, and interaction under variable hardware constraints. This paper presents a hybrid study combining a critical review of existing approaches with a unified architecture for real-time 3D CA in XR. The proposed five-layer architecture integrates voxel and rule management, parallel computation, interoperability middleware, visualization, and XR interaction. Its key principles include hardware-aware execution, asynchronous simulation-rendering, adaptive fidelity, and cross-engine interoperability. An analytical evaluation framework is defined to assess performance, latency, scalability, memory efficiency, simulation correctness, and interaction quality. The proposed framework provides a foundation for developing portable and interactive 3D CA systems across desktop and mobile XR platforms.
Read the full abstract

Machine Learning (Statistics)

Time Series Change Point Detection with Gaussian Processes

This paper proposes a novel general Gaussian process framework for change point detection in time series. A change is defined as an alteration of the hyperparameters of the Gaussian process prior. We formulate the problem in the context of statistical hypothesis testing and demonstrate its performance over both offline and online multiple change points detection. The approach provides theoretical guaranties of its performance. An important advantage of the developed framework is that it does not need a detailed specification of the time series function before and after a change. The hyperparameter values are learned from the data. Comprehensive evaluation of the proposed framework is provided both on synthetic and real data and its efficiency is demonstrated.
Read the full abstract

All authors Olga Isupova, Danil Kuzin, Fredrik Gustafsson, Lyudmila Mihaylova

Data Structures and Algorithms

Function Inversion Reporting

In the Function Inversion problem, the goal is to invert a function $f:[N] \to [N]$ in two phases. In the preprocessing phase, the offline algorithm computes an advice string of length $S$ bits. In the online phase, the online algorithm receives the advice and a challenge $y \in [N]$, and the goal is to find a preimage $x \in [N]$ such that $f(x) = y$ in time $T$. The problem was initially studied in cryptography, but in recent years it has found various applications to data structure problems. Yet, several of the applications require a variant of Function Inversion, known as Function Inversion Reporting, where the goal is to output all preimages of the challenge $y$. In this paper, we study the Function Inversion Reporting problem in a systematic way by unifying and improving existing algorithms. As a result, we obtain improved data structures for several problems including 3SUM-Indexing Reporting, Range Reporting, Approximate Nearest Neighbor, Jumbled Indexing Reporting, and Gapped String Indexing Reporting.
Read the full abstract

All authors Itai Dinur, Alexander Golovnev, Chao Yan, Yiding Zhu

Distributed Computing

Decode Token Parallelism: Memory-Efficient Distributed Attention Parallelism for Scalable LLM Decoding

Serving large language models at high concurrency with long contexts requires KV-cache capacity and attention bandwidth that grow with the decode pool. Existing parallelization strategies trade one against the other: data parallelism replicates model weights, limiting KV capacity; tensor parallelism stops scaling attention at the model's KV-head count and pushes dense collectives across nodes; and decode context parallelism (DCP) recovers capacity by sharding the sequence but adds cross-node aggregation of partial attention results. We observe that during decode, dense layers and attention scale differently: dense layers amortize weight reads across the batch and run efficiently within a single NVLink domain, whereas attention cost grows with every active request's KV cache. We present Decode Token Parallelism (TKNP), a decode-pool architecture that decouples weight placement from attention ownership. TKNP distributes a single model copy across nodes in balanced layer blocks. The active node holding a block executes its projections and MLP for the full batch using intra-node tensor parallelism, while every node computes attention for its own requests against locally resident KV cache. This extends request-local attention across nodes without replicating weights: only current-token activations cross the network, dense all-reduces remain within NVLink, and attention requires no cross-node merging of partial results. Implemented in vLLM and evaluated on Llama 3.1 405B and Nemotron-4 340B on up to 64 H100 GPUs, TKNP improves completion throughput for long-context, high-concurrency workloads by up to 1.7$\times$ over DCP and by up to 2.06$\times$ over data parallelism at matched GPU count.
Read the full abstract

Robotics

Large Language Model Explainability for Planning Lunar Rover Trajectories under Uncertainty

Planning planetary rover trajectories under probabilistic uncertainty is a multi-objective optimization problem that science teams currently iteratively solve and verify by hand. This process becomes impractical when timelines and constraints frequently shift throughout the mission planning phase. Sampling-based planners such as Monte Carlo tree search can speed up this process, but their outputs do not preserve traceability to the science objectives that justify each plan, which the science team needs to verify. We propose an interactive assistant based on a large language model (LLM) that can explain planner trajectories using domain vocabulary and re-run the planner under user-specified conditions to compare alternatives. Previous work has used LLMs inside planner decision-making loops, but we explore using them for post-planning explanation, where they are more likely to be trusted since they do not directly influence planner decisions. Our framework pairs a simulator inspired by the NASA Volatiles Investigating Polar Exploration Rover (VIPER) mission with a ReAct queryable interface that calls curated action tools and retrieval functions. We evaluate the assistant on a query bank consisting of plan comparisons, feasibility, and lookup queries. Experiments show that 90.9% of the assistant's responses are faithful to the planner's outputs, a nearly 65% improvement over zero-shot prompting of the same LLM without tool access, demonstrating the potential for trustworthy explainability of uncertainty-aware traverses with an LLM-based system.
Read the full abstract

All authors Michelle Ho, Maximilian Adang, Zachary Booth, David E. Astle, Margaret Hansen, Edward Balaban, Mykel J. Kochenderfer

Systems and Control

Implicit DeepReach Without Implicit Differentiation

We consider the problem of approximating backward reachable and reach-avoid tubes for high-dimensional nonlinear systems whose Hamiltonians require numerical optimization over constrained controls and disturbances. Existing neural Hamilton-Jacobi (HJ) reachability methods alleviate the dimensionality bottleneck of grid-based solvers, but evaluating Hamiltonians without closed-form expressions introduces an additional computational challenge. We show that, under suitable assumptions, the gradients required for value-function training can be computed without differentiating through the inner optimization problem. Specifically, we establish an envelope-type gradient identity for the saddle point Hamiltonian, under which the optimal control and disturbance enter backpropagation as constants without gradient tracking. This enables end-to-end neural HJ reachability with numerically evaluated Hamiltonians while avoiding both solver unrolling and implicit differentiation. We demonstrate the accuracy and computational efficiency of the proposed approach on nonlinear reachability and reach-avoid problems of different scales.
Read the full abstract

All authors Xingjian Li, Kelvin Kan, Deepanshu Verma, Krishna Kumar, Hayden Schaeffer, Samy Wu Fung

Complex Variables

Bounded point evaluations in spaces of several complex variables

The focus of this manuscript is existence criteria for bounded point evaluations and bounded point derivations. In the single variable setting conditions for the existence of bounded point evaluations and derivations are known for many spaces of functions; however, in the several variable case far less is known. In this manuscript, we consider Campanato spaces, which contain many other function spaces as special cases, and prove sufficient conditions for the existence of bounded point evaluations in these spaces that are analogs of known results for the single variable case. We also demonstrate that for certain cases these sufficient conditions are also necessary.
Read the full abstract

Image and Video Processing

MRFoundry: Knowledge-guided agent loops for end-to-end MRI research

AI agents can write code, use scientific software, and revise computational workflows, opening new possibilities for MRI research. Effective assistance requires connecting acquisition physics, data conventions, specialized tools, and scientific validation. We present MRFoundry, an open-source, extensible package that connects MRI knowledge to agent actions and output checks. Project-local memory preserves decisions and evidence, while reviewed contributions allow researchers to improve shared guidance. Researcher-supervised examples demonstrate skill-guided sequence auditing and acquired-data reconstruction, connecting tool use, output checks, and documented decisions. Alongside MRFoundry, we introduce MRI Agent Bench to compare agents with and without the package across models and MRI task domains. Across 240 paired Core evaluations spanning 24 task types and ten models, all-checks-passed completion increased from 67.5% without MRFoundry to 78.3% with it. Across 134 Hard pairs, completion increased from 36.6% to 44.8%. MRFoundry makes MRI workflow expertise available as reusable guidance that researchers can inspect, adapt, and extend within existing agent and scientific software environments. MRFoundry is openly available at https://github.com/KeWang0622/MRFoundry.
Read the full abstract

All authors Ke Wang, Atakan Topcu, Hossein Momeni, Molin Zhang

Classical Analysis and ODEs

A Counterexample to Polynomial Approximation for Monotone Weights

We give a counterexample to a question of Borichev on polynomial approximation with monotone weights. We construct an even continuous weight $W$, strictly increasing on $[0,\infty)$, with superpolynomial growth and finite logarithmic integral, and an entire function $F$ of zero exponential type such that $F/W$ vanishes at infinity and belongs to $L^p(\mathbb{R})$ for every $1\leq p<\infty$. Nevertheless, $F$ has positive distance from the polynomials in the weighted uniform norm and in every corresponding weighted $L^{p}$ norm.
Read the full abstract

Human-Computer Interaction

Project Progress Desk: Know Where All Your Claude Code and Codex Projects Stand at a Glance

Agentic coding tools such as Codex and Claude Code let developers work on many projects in parallel, but keeping track of them still means switching between chats, terminal sessions and providers. We present Project Progress Desk, a local desktop interface that brings overall progress, blockers and pending decisions into one view. Users can see which projects need attention and what remains, and compare earlier approaches before choosing how to continue. Agents report each result in a short receipt; the Desk checks it against the project's checklist and moves the bar, showing earlier estimates in a lighter shade. We describe daily use across 36 projects, including a choice between two implementations based on their recorded outcomes. At the demo, attendees will explore 30 simulated projects, trace completed work to overall progress, and watch a coding agent's new result update the overview.
Read the full abstract

All authors Wanghao Ye, Yiting Wang, Shwai He, Guoheng Sun, Ziyao Wang, Yexiao He, Zheyu Shen, Zhaoyi Liu, Bowei Tian, Daeun Jung, Aditya Sarkar, Parastoo Pilevar, Xiaochuan Gong, Yancheng Zhu, Yingying Fan, Qiong Wang, Yuning Zhang, Meng Feng, Siyuan Peng, Zhenle Duan, Sihan Chen, Ziyi Wang, Yifei Dong, Yilong Dai, Ang Li

Optimization and Control

Multiple Control Barrier Functions for Geometric Hybrid Systems: Modeling and Safe Control Synthesis

We formulate geometric hybrid dynamical systems with states on intrinsic manifolds and inputs in topological spaces using relaxed C1-control bundles. Within this framework, we establish a barrier certificate that guarantees forward invariance of a closed set for closed-loop systems. We introduce multiple control barrier functions and derive conditions that render their sublevel sets forward invariant. We then construct pointwise optimal safe control laws, establish regularity conditions for measurable selections, and use these laws to design safety filters for geometric hybrid systems on manifolds. A second-order bouncing-pendulum example illustrates the framework and results.
Read the full abstract

All authors Piyush P. Jirwankar, Daniel E. Ochoa, Carlos A. Montenegro G., Ricardo G. Sanfelice

Complex Variables

Sharp weighted Riesz inequalities for harmonic mappings in the range 1<p<2

For $1<p<2$ and $c>0$, we determine the exact norm of the weighted analytic–coanalytic projection operator $F\mapsto(P_+F,\sqrt c\,P_-F)$ from $L^p(\T)$ to $L^p(\T;\ell_2^2)$. The sharp constant is \[ a_{p,c}=\left(\frac{1+c+\sqrt{1+c^2+2c\cos(2\pi/p)}}{2\sin^2(\pi/p)}\right)^{1/2}. \] We construct an explicit plurisubharmonic minorant of the corresponding pointwise obstacle and obtain an origin-corrected inequality for arbitrary harmonic decompositions. The uncorrected inequality holds under an optimal angular condition at the origin. The scalar estimate underlying the construction is proved by angular minimization and a two-sided comparison with solutions of $y''=y$. An explicit family establishes sharpness.
Read the full abstract

Category Theory

Closed layers in tensor-triangular geometry

In the absence of a theory of closed immersions in tensor-triangular geometry, we propose an alternative approach via quotients of module categories. As an application, we prove invariance of homological residue fields under completion.

Numerical Analysis

An Accelerated Power Method

An Accelerated Power Method (APM) for locating the dominant eigen-pair of a real, symmetric matrix is presented. The algorithm is motivated by Nesterov's Accelerated Gradient Method (AGM) and a connection between the APM and the AGM holds, that is analogous to the relationship between the Conjugate Gradient and Lanczos methods. Theoretical convergence analysis shows that the APM is guaranteed to recover the dominant eigen-pair of a normalized semi-definite matrix at a rate no worse than the Power Method. For normalized indefinite matrices, the APM will recover an extremal eigen-pair, but not necessarily the dominant one, and the rate can be worse than the vanilla PM, depending upon the choice of acceleration parameter. Computational practicalities are discussed, including parameter tuning, and numerical experiments are also presented.
Read the full abstract