Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Wednesday 2 September

Networking

Bringing dApps to OCUDU: An E3 Controller for Real-Time Open RAN Intelligence

Real-time control loops in Open RAN are increasingly colocated with the gNB, where dApps, i.e., programmable applications with sub-millisecond access to PHY- and MAC-layer signals, enable latency-critical use cases such as spectrum sharing, channel-aware scheduling, and integrated sensing. What turns dApps from a per-vendor mechanism into a portable component of the emerging AI-RAN ecosystem is the E3 interface: this interface defines how a dApp subscribes to RAN telemetry, receives indications, and issues control actions back to the RAN. To date, E3 has been implemented on OpenAirInterface and on NVIDIA Aerial; OCUDU, i.e., the Linux Foundation's open-source CU/DU project, has lacked a comparable E3 path. We close that gap with an open-source E3Controller for OCUDU, designed as a sidecar daemon so the E3 protocol stack, service-model logic, and dApp interactions live entirely outside RAN core processing, which is touched only through well-defined instrumentation hooks. We validate the controller with two reference service models, Spectrum and L1, that deliver O-RAN fronthaul I/Q samples to a spectrum-sensing dApp over a Foxconn RPQN 4800 radio unit. Our evaluation shows that the E3 path imposes no measurable throughput penalty on the OCUDU RAN, demonstrating that a real-time dApp/RAN interface is feasible on production-grade open RAN software.
Read the full abstract

All authors Angelo Feraudo, Ravis Shirkhani, Stefano Maxenti, Andrea Lacava, Michele Polese, Tommaso Melodia

Formal Languages and Automata

NeuroSTAR: Automata-guided Neuro-symbolic Specification Formalization

Automated translation of natural language (NL) descriptions into Linear Temporal Logic over finite traces (LTLf) is a prerequisite for automated formal verification of a system's dynamic behavior. Several LLM-based methods have recently shown potential for this task. However, they struggle with the nuance of natural language descriptions, which can lead LLMs to only partially capture the intended meaning. To address this limitation, we propose NeuroSTAR (Automata-guided Neuro-symbolic Specification Formalization), an NL-to-LTLf framework that builds on two insights. First, it leverages multiple generators to obtain diverse LTLf candidates. Second, it uses an automata-theoretic semantic comparison based on DFA traces to identify behavioral disagreements that guide formula refinement. We evaluate NeuroSTAR and show that it improves NL-to-LTLf translation performance by 8-18 percentage points relative to the prior state-of-the-art (SoTA) on unambiguous benchmarks. We further study its applicability to a body of driving law text, a complex, realistic, and reference-free domain critical for autonomous-vehicle specification. This study shows that NeuroSTAR can capture the necessary temporal semantics in 83.9% of the driving law sections, which demonstrates the effectiveness of automata-guided reference-free refinement in formalization.
Read the full abstract

All authors Joy Saha, Trey Woodlief, Sebastian Elbaum, Matthew B. Dwyer

Computation and Language

No country for old linguists: LLM-brain alignment underdetermines neural computation

Nastase et al. (2026) argue that large language models (LLMs) may illuminate language processing because both rely on distributed, context-sensitive representations shaped by statistical learning. Their rejection of simple cortical "boxology" is persuasive, and they articulate a strong case for the value of LLM-brain alignment research. The key question is what kind of inference LLM-brain alignment licenses. My claim here will be narrow: representational alignment can in principle constrain mechanistic hypotheses, but it does not by itself identify a mechanism. Nastase et al. acknowledge that an encoding model can capture features represented in neural activity without establishing a shared architecture or algorithm. Yet the authors sometime move from alignment to "shared computational principles" and ultimately to LLMs as mechanistic models of natural language. Indeed, their methodological caveat that alignment does not establish a shared architecture or algorithm sits uneasily with their conclusion that LLMs might instantiate the same computational principles as biological brains and provide a "fully mechanistic model" of language. I discuss what I consider to be problems of logical, causal, and computational underdetermination in Nastase et al.'s (2026) proposal.
Read the full abstract

Instrumentation and Methods for Astrophysics

The Accretion Explorer Interferometer (AEI) Phase I NASA Innovative Advanced Concepts Final Report

We must create superb X-ray images to understand the detailed physical processes behind some of the most powerful astronomical objects. The need to achieve this capability has been known for decades. But as time proceeds, X-ray astronomy falls further behind other wavebands that are steadily increasing their imaging capacity. Radio astronomy in particular has reached an angular resolution on the order of micro arcseconds via aperture synthesis interferometry, using the interference of electromagnetic waves from many small telescopes together to simulate having a much larger telescope. Developing an equivalent high-resolution capability in the X-ray band would be a game changer for high-energy astrophysics. We will understand how supermassive black holes grow and evolve. We will learn what powers astrophysical jets. We will learn how young, active stars affect the habitability of their planets. Technologically, our NIAC study has shown that the Accretion Explorer Interferometer (AEI) concept, unlike the original MAXIM concept, is more feasible in operation, being only 2 km long, versus approximately 450 km. Our study has also shown that satellite station keeping is possible, leveraging from LISA pathfinder technology, and using large mirror flats plus an X-ray beamsplitter for enabling technology is feasible.
Read the full abstract

All authors Kimberly A. Weaver, Jenna M. Cann, Kenneth Carpenter, Maurice Leutenegger, Takashi Okajima, Scott Rohrbach, Liz Matson, Craig Stevens, George Bussey, Jean-Etienne Dongmo, David Kim, Jess Lewis, Khashayar Parsay, Sharon Peabody, Alison Rao, Sara Riall, Marta Shelton, Kan Yang, Isabella Carlton, Webster Cash, Kaylee DeGennaro, Emma Kleiner, John Krizmanic, Erini Lambrides, Miranda McCarthy, Jeffrey McKaig, Atul Mohan, Teresa Monsue, Ryan Pfeifle, Mainak Singha, Melville Ulmer, Laura D. Vega, Kelly E. Whalen

Computer Vision

Who Speaks for the Pruned? Visual Token Pruning as Coverage Optimization

Visual token pruning reduces the inference cost of vision-language models (VLMs), but most methods only ask which tokens to keep. This retained-token view can keep redundant high-scoring tokens while leaving discarded evidence without a close representative. We propose CoverPruner, a training-free pruner that asks the complementary demand-side question: after a token is removed, which surviving original token represents it for the target VLM? CoverPruner formulates pruning as Representational Coverage Maximization (RCM), covering the full projected visual-token set with query-weighted demand. It instantiates RCM with projector-space coverage and a lightweight first-layer attention probe. Across multiple VLM architectures and compression rates, CoverPruner achieves the best average accuracy among all compared methods, with the largest gains usually appearing under aggressive compression.
Read the full abstract

All authors Qingchan Zhu, Weihang You, Hanqi Jiang, Changdi Yang, Tianming Liu, Geng Yuan

High Energy Astrophysical Phenomena

Observational selection effects on radio pulsars are minimal for masses, but significant for orbits and spins

The masses of Galactic pulsars in binaries measured through radio timing point to structure in the mass distribution with implications for dense matter and astrophysical formation processes: a bimodal shape with peaks at ${\sim} 1.3\,M_\odot$ and ${\sim} 1.6\,M_\odot$, with a cutoff above ${\sim}2\,M_\odot$. However, this observed population of radio pulsars is shaped not only by intrinsic pulsar properties, such as birth masses, binary evolutionary pathways and dense-matter constraints, but also by observational effects. In existing catalogs of pulsar mass measurements, observational selection effects influence (i) which systems are detected in the first place (detectability) and (ii) which systems yield well-measured masses (measurability). In this work, we revisit the radio pulsar population distribution in the context of observational effects associated with pulsar radio timing. Simulating systems of radio pulsars and timing observations, we track the process by which a given system ends up in an observational dataset and estimate the impact of the binary and pulsar parameters. We fold this selection function into hierarchical population inference and extract the intrinsic astrophysical distribution of pulsars observed with radio timing. We jointly infer the populations of pulsar mass, companion mass, orbital eccentricity, orbital period and pulsar spin period. Selection effects have minimal impact on the mass distributions, but more significantly affect other parameters. The ratio of circular-to-eccentric systems shifts from an observed $1\!:\!1$ to an astrophysical, selection-corrected $2\!:\!1$ ratio, while the true population is shifted toward longer orbital and spin periods than observed.
Read the full abstract

Software Engineering

Compound Prompt Constraints in LLM Code Generation: A Factorial Study of Format, Persona, and Urgency

Large language models (LLMs) are increasingly used in software engineering pipelines for code generation, where production prompts often combine multiple constraints. This paper presents a full-factorial empirical study of how output formatting, persona assignment, and urgency framing jointly affect LLM code-generation reliability. We evaluate all 27 combinations in a controlled 3x3x3 design and decompose each compound condition into an additive prediction and a residual interaction term that captures super-additive degradation. The study uses all 164 HumanEval+ problems across five OpenAI models from the GPT-4o family, GPT-4.1 family, and o3-mini, yielding 22,140 greedy-decoding evaluations. A format-aware extraction pipeline separates formatting failures from reasoning failures, and significance is assessed with McNemar's test, odds ratios, and 95% confidence intervals. Results show that compound constraints can produce architecture-dependent degradation not predictable from single-factor experiments. The GPT-4o family exhibits consistent super-additive effects, with pass@1 reductions 3-12 percentage points beyond additive predictions; the largest interaction is -12.2 pp on GPT-4o-mini for JSON + expert persona + moderate urgency. JSON combinations generally produce larger interactions than XML. In contrast, the GPT-4.1 family is largely resistant, while o3-mini shows a qualitatively different pattern in which structured output constraints can improve performance. These findings show that vulnerability is architecture-dependent rather than size-dependent, that individually neutral or beneficial constraints can combine to cause substantial degradation, and that compound-prompt testing should be standard in reliability assessment for LLM-assisted engineering pipelines.
Read the full abstract

All authors Shrenik Jadhav, Nickalsa LaPlaca, Caleb Stone, Ashok Raja, Omar Ochoa, Vidhyashree Nagaraju

Numerical Analysis

A discontinuous Petrov-Galerkin finite-element framework for the simulation of microwave-heated flows

We present a high-order multiphysics solver for the simulation of microwave-heated flows. The solver couples a discontinuous Petrov-Galerkin (DPG) finite element method for the time-harmonic Maxwell equations with continuous Galerkin finite element methods for the heat equation and the incompressible Navier-Stokes equations. We validate the electromagnetic solver against multiple benchmark problems: wave propagation in a rectangular waveguide, a cavity problem with a singular solution, and a microwave-heated obstacle problem, comparing our results against numerical and experimental data from the literature. The results confirm the validity of the implementation and demonstrate its ability to perform adaptive mesh refinement using the DPG method's built-in error estimator. The final part of the study showcases the capabilities of the multiphysics framework through simulations of microwave-heated flow around obstacles with singular geometric features. These results highlight the potential of the proposed framework for the simulation and optimization of microwave-assisted chemical processes. Finally, the developed high-order multiphysics solver has a low memory footprint, since the electromagnetic solver relies on a Conjugate Gradient (CG) iterative solver and the fluid solver is implemented in a matrix-free fashion, making the overall approach scalable and well-suited for large-scale parallel simulations.
Read the full abstract

Emerging Technologies

Embedding Single-Phase Grid-Forming Inverters in Three-Phase Unbalanced Power Flow

This letter introduces Grid-Forming Three-Phase Power Flow (GFM-3PF), an augmented Newton power flow framework for modeling single-phase grid-forming inverters (GFMs) in three-phase unbalanced networks. The contributions of this work are threefold: 1) developing a two-stage solution strategy based on positive-sequence initialization followed by three-phase phase-domain lifting for robust large-scale computation; 2) incorporating phase-domain unbalanced network modeling with controlled mutual coupling together with phase-dependent, frequency-sensitive load representation; and 3) embedding a single-phase GFM bus model directly into the three-phase unbalanced Newton power flow equations through a common droop-governed frequency state. GFM-3PF is validated on 3-bus, 33-bus, and 118-bus test systems, demonstrating its accuracy, robustness, and scalability.
Read the full abstract

Computer Vision

VeriPhy: Agentic Physical Reasoning for World Model Evaluation and Refinement

Visual fluency in generated video does not imply physical reliability, and a scalar quality score alone is incapable of indicating the obligation a clip violates or the moment it fails. We present VeriPhy, an auditable physical-verification system in which a text-only planner compiles the prompt into typed physical obligations and a statically validated execution plan before any frame is observed. During execution, observations gate and scope only declared calls to frozen low-level experts (e.g., segmentation and tracking, counting, eleven typed physical measurements over the resulting tracks, depth, OCR, and audio-event detection). Each action returns a provenance-carrying evidence record whose payload, when usable, is either a typed measurement or an explicitly tagged learned state. Typed resolvers and fixed composition map usable records to a three-valued state (supported, contradicted, or unknown, surfaced as plausible, implausible, or abstain) with full provenance, so that every verdict is traceable to the evidence that produced it. We anchor evaluation in a 1,500-clip corpus of human-annotated flaw records that localize real generation failures in prompt reference, space, and time. On a 149-clip core carrying 304 such records, VeriPhy accounts for 228, against 164 for a published question-decomposition evaluator given the same clips and the same claims. Recall alone does not separate it from prompting the same backbone monolithically, which reaches 222; what separates them is that each decision retains its evidence record and provenance, making the traces auditable one verdict at a time and usable as the interface through which a critic verdict could be written back into generation.
Read the full abstract

All authors Wenzhuo Xu, Yuchen Zhu, Chongjian Ge, Xuan Shen, Jing Shi, Jason Kuen, Yongxin Chen, Molei Tao, Christopher McComb, Noelia Grande Gutiérrez, Jiuxiang Gu

Algebraic Geometry

Experiments with membranes, maps and sheaves

Motivated by the conjectural existence of M-theory, we investigate a web of correspondences between enumerative invariants of a Calabi-Yau fivefold $Z$ with a torus action. This includes a correspondence between the fivefold Gromov-Witten invariants and K-theoretic Pandharipande-Thomas invariants of a threefold $X \subset Z$, mediated by so-called membrane indices, which generalise Gopakumar-Vafa invariants. We establish the correspondence for strip geometries for restricted torus actions and test it numerically for general torus actions. Further numerical evidence is provided for the closed vertex, local surfaces and local projective spaces. For the latter we present conjectural formulae for their low-degree membrane indices. When the fivefold is the product of the affine plane with a suitable toric variety, we prove geometric engineering and equate the generating series of Pandharipande-Thomas invariants with the corresponding instanton partition function while equality with the Gromov-Witten series is probed numerically.
Read the full abstract

Distributed Computing

BASP: Communication-Efficient Batch-Aware Sequence Parallelism for LLM Training

Long-context reasoning for large language models (LLMs) is becoming increasingly important, but training over long sequences remains challenging due to massive memory and communication requirements. Sequence parallelism has emerged as an essential technique for addressing bottlenecks in long sequence LLM training. However, we observe that existing sequence parallelism methods are batch-agnostic and apply uniform sequence partitioning across all batch sizes, resulting in inefficient communication. In this paper, we introduce Batch- Aware Sequence Parallelism (BASP), a sequence parallelism approach that leverages batch structure to reduce communication overhead. BASP exploits batch structure by partitioning GPUs into disjoint sequence-parallel groups according to the micro- batch size. This design reduces the all-to-all communication group size, thereby localizing communication and improving training efficiency. Experimental results on an NVIDIA A100 cluster show that BASP improves end-to-end training time by up to 1.17 - 1.31x in Llama and Qwen models compared to standard sequence parallel baselines, while preserving identical model accuracy and memory usage.
Read the full abstract

Machine Learning

Routing Is Not Enough: Diagnosing Intra-Adapter Subspace Contention in MoE+LoRA Fine-Tuning

Multi-domain fine-tuning often combines MoE routing with LoRA, assuming that token-level routing separates domain-specific updates. We test this assumption in MoE+LoRA using Python code paired with biomedical text and mathematical reasoning. Although these domains show near-disjoint expert routing, adding biomedical data substantially increases code perplexity, indicating that routing separation alone may not prevent negative transfer. To localize the failure, we introduce Jaccard routing overlap and adapter-gradient cosine similarity, which measure expert sharing and update compatibility, respectively. These diagnostics indicate that interference arises mostly from nearly orthogonal domain gradients competing within the same low-rank adapter subspace. We address this issue with SpawnLoRA, which dynamically adds gated sub-adapters inside MoE experts when adapter-level contention is detected, while keeping the router fixed. We evaluate SpawnLoRA on Phi-tiny-MoE-instruct and OLMoE-1B-7B across multiple mixture settings and find that it effectively reduces negative transfer compared with standard and rank-adaptive LoRA. These results demonstrate that structural separation inside experts provides benefits beyond routing or rank expansion alone.
Read the full abstract

All authors Mehreen Hossain Chowdhury, Nowshin Mahjabin, Ahmed Shafin Ruhan, Md Azam Hossain, Abu Raihan Mostofa Kamal, Md Tahmid Rahman Laskar

Emerging Technologies

RACE-AIMC: Selective Inference for Heterogeneous Analog In-Memory Accelerators at the Edge

Analog in-memory computing (AIMC) speeds up neural-network inference by doing the arithmetic directly inside a memory array, instead of shuttling weights back and forth between memory and a processor. This saves energy, but the physical devices that store the weights are imperfect: programming errors, electrical noise, limited-resolution converters, and outright broken cells all distort the computation, and every physical chip is distorted in its own way. A designer with several such chips available faces an uncomfortable choice: run all of them and combine the answers (safe, but wasteful of energy), or trust a single chip blindly (cheap, but with no guarantee on how often it is wrong). This paper introduces RACE-AIMC (Risk-Aware Certified Ensemble for AIMC), a framework that resolves this choice with statistics rather than guesswork. Offline, RACE-AIMC studies a pool of physical accelerators, picks the single best one for a given energy budget, and computes a mathematically exact upper bound on how often that accelerator will be wrong when it chooses to answer. Online, only that one accelerator is switched on; a lightweight check decides whether to accept its answer or defer to a fallback. In our simulations using a noisy weight mapping and multiple independent test runs, every certified bound stayed under a 10% error target (mean bound 7.83% +- 0.89%, with 70.88% +- 0.98% of inputs answered directly). The resulting system matches the accuracy of a clean digital baseline while cutting modeled energy use by 69.02% relative to always running every accelerator in the pool.
Read the full abstract

Computation and Language

Large Language Models in Resolving Contextual Knowledge Conflicts

Most prior works focused on conflicts between an LLM's internal parametric knowledge and externally provided context. In contrast, we investigate how LLMs handle conflicts that arise within contextual knowledge itself. We introduce a taxonomy of six types of contextual conflicts (factual, inferential, temporal, granularity, perspective, and ambiguity) and contribute a comprehensive dataset ContextConflict for this setting. The dataset contains 5,781 samples, covers both reasoning and summarization tasks, and includes both explicit contradictions and implicit conflicts that require multi-step reasoning. Experiments on nine LLMs show that current models still fall short in resolving contextual knowledge conflicts. We further provide mechanistic interpretability insights into how LLMs process such conflicts, revealing their latent awareness of conflicts and the representational geometry underlying conflict processing. In addition, our analysis uncovers a consistent model bias towards earlier evidence, and this positional preference serves as a key obstacle to effective conflict resolution. Motivated by these findings, we further propose a simple training-free, label-free steering method that steers activations to encourage a more comprehensive incorporation of evidences for better conflict resolution. On our dataset, the method consistently improves accuracy on reasoning tasks and generates higher-quality, more balanced summaries for summarization tasks.
Read the full abstract

All authors Xinye Yang, Zhenyang Liu, Ruisi Li, Yuanyuan Lei

Networking

Feasible but Not Safe: Constraint Violations and Report-Channel Attacks in Learned Cell-Free ISAC Association

Learning-based schedulers have been proposed to provide real-time user, target, and access point (AP) association in distributed cell-free integrated sensing and communication systems. In a typical approach, a graph neural network (GNN), trained on labels from a mixed-integer linear program, maps lightweight per-AP statistics to decisions on AP clustering, user and target scheduling, and mode selection in one forward pass. Such solutions assume that hard constraints, enforced only as soft training penalties, hold at inference, and that the self-reported statistics are truthful. Using our ASSENT algorithm as an example, we find that despite high $F_1$ scores, many solutions violate at least one hard constraint, demonstrating that high prediction accuracy does not ensure joint feasibility. Projecting the GNN output onto a feasible solution restores constraint satisfaction with low utility loss, even with a simple greedy repair procedure. We further show that feasibility alone does not guarantee robustness to false data injection attacks. A single malicious AP that reports false information cannot substantially increase its user associations, but can greatly increase the rate of infeasible solutions. The effect of such attacks depends on the type of information being falsified. Misreporting information that affects the objective can largely be mitigated through feasibility projection, whereas falsifying information that affects the constraints cannot. The latter can, however, be detected using a low-complexity cross-AP consistency check. These results show that learned ISAC schedulers should be evaluated using constraint-aware feasibility metrics in addition to conventional accuracy measures.
Read the full abstract

Chemical Physics

Overlimiting Ion Transport and Reaction Limitations in Charged Porous Media

Electrochemical reaction rates are controlled by both interfacial charge-transfer kinetics and reactive-ion transport. In charged porous media, fixed charges enrich reactive counterions near pore walls, enabling transport beyond the classical diffusion limit via surface conduction (SC). Under overlimiting conditions, classical Butler-Volmer kinetics predict indefinitely increasing current with overpotential, contrasting with microscopic electron-transfer theories, which impose a finite reaction-limited current. Here, we couple the one-dimensional leaky membrane model to coupled ion-electron transfer (CIET) kinetics to examine the interplay between transport and reaction limitations. The limiting behavior is governed by the scaled surface charge $(\tilde{\rho}_s)$ and a Damköhler number $(Da)$ comparing reaction-limited and diffusion-limited currents. We derive analytical limiting-current expressions for neutral, positive, and negatively charged porous media, mapping underlimiting-to-overlimiting transitions in the $(Da,\tilde{\rho}_s)$ plane. By preventing reactive-ion depletion, SC restores polarization-curve sensitivity to charge-transfer kinetics that would otherwise be obscured by diffusion limitation. Fitting to published Cu electrodeposition data in charged AAO membranes yields $Da\approx24$. CIET parameters fitted to AAO($-$) also describe AAO($+$) and predict a finite AAO($-$) reaction limit beyond the applied voltage range. These results provide a framework for distinguishing transport-limited and reaction-limited responses in electrochemical systems and establish charged porous media as platforms to reveal electrochemical reaction-kinetic descriptors.
Read the full abstract

Distributed Computing

Skywing: A Platform for Decentralized Mathematical Computing in Unreliable Environments

Emerging edge, autonomous, and cyber-physical systems increasingly require mathematical computation across heterogeneous devices connected by unreliable communication networks. Traditional high-performance computing and distributed data-processing frameworks provide powerful abstractions for managed environments but are less suited to decentralized settings where centralized coordination, reliable communication, and global synchronization cannot be assumed. This paper presents Skywing, an open-source platform for decentralized mathematical computing in unreliable environments. Its programming model consists of three abstractions: agents represent participants in a decentralized computation, processors encapsulate algorithm-specific update rules, and iterations manage distributed execution. Skywing supports asynchronous operation, publish-subscribe communication, managed message handling, and the composition of independent algorithms into complex decentralized workflows. We demonstrate Skywing using representative algorithms from consensus, optimization, and numerical linear algebra. Experiments on the native Skywing runtime include Push Sum and Max Consensus, a composed monitoring and control workflow, resilient Push Sum under delayed communication, and resilient asynchronous Jacobi under malevolent data corruption. These demonstrations show that Skywing supports diverse decentralized algorithms while separating mathematical logic from communication and execution infrastructure. Skywing serves as both a deployment framework for decentralized applications and a research platform for developing resilient mathematical algorithms.
Read the full abstract

All authors Alyson Fox, Colin Ponce, Annika Mauro, Wayne Mitchell, Sarah Osborn, Tom Benson, Shayna Kapadia

Earth and Planetary Astrophysics

Evolutionary pathways toward survival of a thick CO2- or SO2-rich atmosphere on the lava world TOI-561 b

Rocky planets evolve through the exchange of volatiles between their interiors and atmospheres, an interplay still poorly constrained by observations. Remarkably, highly irradiated ultrashort-period (USP) exoplanets may offer a window into this exchange – some retain low bulk densities compatible with volatile-rich envelopes surrounding rocky interiors, indicating possible secondary atmospheres. TOI-561 b is a prime example, with a bulk density of $4.3\pm0.4$ g cm$^{-3}$ and recent JWST observations favoring a thick volatile atmosphere overlying a dayside magma ocean. Here, we investigate the evolutionary pathways allowing TOI-561 b to retain a substantial atmosphere over gigayears using the PROTEUS coupled interior–atmosphere framework. We explore different core radius fractions, Bond albedos, atmospheric escape efficiencies, mantle redox states, and initial C–H–O–N–S volatile inventories, under in situ evolution and late inward migration. Over half of our simulations leave a bare interior too dense to match observations. Successful cases favor a volatile-rich origin ($\lesssim200$ Earth oceans of hydrogen, S/H $\le10$, and N/H $\le1$), an oxidized mantle ($f$O$_2 \gtrsim \mathrm{IW}+4$), a small iron core ($\le 0.40$ for the core radius fraction), and low escape efficiency ($\epsilon \lesssim 10^{-3}$) in the hydrodynamic escape regime. At present, TOI-561 b is consistent with a global magma ocean beneath a thick (surface pressure $\approx 10^{3}$–$10^{4}$ bar), high mean molecular weight atmosphere ($38$–$60$ g mol$^{-1}$). Two archetypes emerge, differentiated by bulk sulfur content: a CO$_2$-dominated and an SO$_2$-dominated atmosphere. Migration is viable but not required to reproduce the observations. Our study illustrates how interior–atmosphere coupling governs atmospheric retention on irradiated rocky planets.
Read the full abstract

All authors Emma Postolec, Tim Lichtenberg, Johanna K. Teske, Harrison Nicholls, Mara Attia, Anjali Piette, Lisa Dang, Nicole L. Wallack, Mykhaylo Plotnykov, Alex McGinty, Samuel Boucher, Bo Peng, Diana Valencia

Algebraic Geometry

Equilibria for Networks of Linear Translational Springs

We use tools from nonlinear algebra to study the equilibria of small linear translational spring networks. Specifically we use the techniques of homotopy continuation, monodromy, and parameter homotopy (a.k.a. cheater homotopy) to solve all rigid linear translational spring networks up to $5$ nodes in both $2$ and $3$ dimensions. We describe a method of implementing parameter homotopy that arises naturally from the physical structure of the system. We give precise total degree bounds on the maximum number of solutions for general planar spring networks. We discuss further efficiency gains obtained from polyhedral homotopy methods. We compare the computation efficiency of these techniques against a baseline of Newton's method.
Read the full abstract

All authors Luke Oeding, Ethan Clayton, Jackson Elsea, Nicholas Wang, Adam Rutkowski

Robotics

Sensing Which Modality Matters: Evidence-Gated Regularization for Robust VLA Policies

Vision-Language-Action (VLA) policies fuse multimodal sensory inputs, but training on limited and homogeneous robot demonstrations encourages spurious inter-sensor correlations rather than task-relevant signal, a failure we term modality entanglement. Under real-world occlusions and distractors, this manifests as nuisance sensitivity to corruption of uninformative sensors and single-modality insufficiency when only one informative sensor remains intact. We propose Evidence-Gated Regularization (EGR), a modality-agnostic training objective that introduces zero inference-time overhead. EGR derives a per-frame and per-sensor task-relevance signal to gate two state-conditional consistency objectives: invariance on low-evidence sensors, and single-sensor sufficiency on high-evidence ones. We introduce a benchmark based on BEHAVIOR-1K, comprising a fast inference-only diagnostic suite and 47 rollout-based skills targeting modality entanglement. We validate EGR on this benchmark and on two real-robot setups with fundamentally different embodiments: a bi-manual setup with two Kinova arms and three RGB cameras, and a single-arm MELFA ASSISTA setup combining vision and GelSight tactile sensors. EGR improves simulation success rates (SR) from 12.5% to 16.4% under full modalities (+31%), from 9.4% to 16.5% under uninformative-sensor corruption (+75%), and from 2.8% to 6.1% under single-sensor fallback (+120%). Under physical-object distractors, EGR boosts SR from 30% to 85% on the bi-manual setup (+183%) and from 55% to 70% on the tactile setup (+27%).
Read the full abstract

All authors Yue Yang, Diego Romeres, Chiori Hori, Gedas Bertasius, Daniel Szafir, Siddarth Jain

Databases

What Happens When the Model Eats the Stack? Rethinking the Research Agenda for Data Agents to Withstand the Bitter Lesson

The bitter lesson poses an existential question for the data systems community, whereby large language models (LLMs) trained end-to-end are rapidly internalizing new capabilities that previously required carefully engineered data agents. Guided by empirical insights, we argue that as models continue to improve, many proposed system layers designed to compensate for model limitations on a given task will increasingly be subsumed by the model itself. We instead identify enduring research opportunities, which lie in supporting data agents across many queries with curated contextual information about the data environment, which we call persistent semantic context. We find that these context layers demonstrate strong promise for improving data agent performance, but they also raise significant system challenges. Thus, a key requirement for future data systems will lie in natively serving persistent semantic contexts as a first-class abstraction in order to enable capable data agents working over huge, complex knowledge corpora. Towards this vision, we outline exciting new research opportunities, including designing efficient context data structures, storage methods, compression techniques, and semantic consistency protocols, to ensure integrity and correctness of the stored contextual knowledge.
Read the full abstract

All authors Liana Patel, Siddharth Jha, Negar Arabzadeh, Carlos Guestrin, Ion Stoica, Matei Zaharia

High Energy Astrophysical Phenomena

Thermal and non-thermal emission from supermassive black hole circumbinary disks: Disks, Coronae, Streams, and Cavities

The search for electromagnetic signals from supermassive black hole (SMBH) binary systems is one of the cornerstones of multi-messenger astrophysics, complementing gravitational wave observations of such systems by pulsar timing arrays and LISA. Although extensive simulations have been run to understand the time variability of the bolometric luminosity from accreting binary SMBH systems, comparatively few spectral predictions have been made, and none that go beyond simple emission models. In this paper, we post-process a HARM3D simulation snapshot of a binary at $20 M$ separation accreting at 0.01 Eddington. For black hole masses $10^6$, $10^7$, and $10^8\, M_\odot$, we self-consistently solve for the radiated spectrum on the basis of time-steady radiation transfer, thermal balance, and ionization equilibrium, including all relevant relativistic effects as well as emission and absorption processes. Although most of the bolometric luminosity is radiated thermally by the disk, the low density regions evacuated by the binary's quadrupole moment produce copious X-rays, with $\sim40\%$ of the observed luminosity in a soft X-ray power law ($\Gamma = 2.3$). We identify two modes of observed azimuthal variation. The X-ray continuum varies by $\sim10\%$ due to an underlying asymmetry in the gas temperature of spiral shocks in the disk. The Fe~K$\alpha$ equivalent width dips by $\sim25\%$ when the line of sight to the inner disk is partially obscured by the lump. These two effects share the same period and are $\sim \pi/2$ out of phase; the period is order days to weeks for typical AGN masses and a 20$M$ separation.
Read the full abstract

All authors Chris Nagele, Julian H. Krolik, Brooks E. Kinch, Jeremy D. Schnittman, Scott C. Noble

Computer Vision

Beyond Small Patches: Black-Box Detection and Purification of Diverse Backdoor Triggers

Deep neural networks (DNNs) are increasingly deployed in real-world vision systems, yet their predictions can be covertly manipulated by backdoor attacks, in which malicious triggers cause targeted misclassification while preserving high clean accuracy. Existing defenses often rely on model internals, training data, or clean validation samples, making them difficult to deploy when only black-box access to a trained model is available. We propose TRIM (Trigger Removal by Identifying Manipulated Regions), a deployment-oriented black-box defense that detects and selectively removes backdoor triggers at inference time without requiring model internals, training data, or clean samples. The key insight behind TRIM is to identify image regions that are responsible for anomalous model behavior and purify only those regions while preserving benign content. TRIM innovates via three key components: (i) region-based segmentation with deep feature representations, (ii) adaptive trigger discovery through inpainting and diffusion-based reconstruction to isolate regions responsible for misclassification—without assumptions about trigger type, shape, or location, and (iii) selective region purification that cleans poisoned regions while retaining benign content. To support practical deployment, TRIM further caches feature embeddings of previously identified triggers, enabling efficient recognition and avoiding redundant detection and purification. Extensive experiments across diverse datasets and backdoor types, including blended, sparse, varying-size, and multiple triggers, show that TRIM consistently outperforms existing black-box defenses, reducing attack success rates (ASR) to as low as 1.16% while preserving clean accuracy of up to 87.87%. These results demonstrate that effective backdoor mitigation is possible at inference time even when the defender has no access to any auxiliary data.
Read the full abstract

Strongly Correlated Electrons

Antiferromagnetism-altered plasmon dynamics

The interaction between plasmons and magnons is a long-sought phenomenon with implications for fundamental physics and spintronics applications. In three-dimensional systems, this coupling is suppressed by the large mismatch in energy scales, but two-dimensional (2D) plasmons with gapless dispersion can overlap with magnons over a broad spectral range. Despite numerous theoretical predictions, experimental observation of magnon-plasmon interaction has remained elusive. In this work, we study a first-of-its-kind hybrid plasmon-magnon platform based on 2D materials. By deploying scattering-type scanning near-field optical microscopy (s-SNOM) with terahertz radiation, we image propagating plasmon wavepackets at a graphene/NiPS$_3$ interface and track their dynamics across the antiferromagnetic transition of NiPS$_3$. We observe a clear renormalization of the plasmon-polariton dispersion concurrent with the onset of antiferromagnetic order. With complementary Raman scattering and nano-terahertz spectroscopy, we unveil spectral weight redistribution and dielectric screening changes, potentially associated with the multi-magnon continuum, as the underlying mechanism. These results provide solid evidence of coupling between plasmon and antiferromagnetic order, marking a cornerstone for a potential platform for hybrid magnon-plasmon interactions in 2D materials, opening avenues for coherent spin-plasmon devices and tunable terahertz spintronic components.
Read the full abstract

All authors Yifan Su, Suheng Xu, Rocco A. Vitalone, Ziyu Liu, Emil Viñas Boström, Na Wu, Chun-Ying Huang, Zhuquan Zhang, Jaehoon Jung, Daniel G. Chica, Vinícius da Silveira Lan Avelar, Yiping Wang, Takashi Taniguchi, Kenji Watanabe, James C. Hone, Xiaoyang Zhu, Cory R. Dean, Xavier Roy, Angel Rubio, D. N. Basov

Hardware Architecture

A single-precision floating-point systolic Givens-QRD Triangular Solver for MVDR Beamforming

Computation of adaptive beamforming weights in Minimum Variance Distortionless Response (MVDR) processing is a latency-critical operation that poses significant challenges for real-time hardware implementation. This paper presents an FPGA implementation of a systolic Givens-rotation QR decomposition pipeline for MVDR beamforming on a simulated 32-element ultrasound transducer array, using single-precision floating-point arithmetic. The design is deployed on a Zynq UltraScale+ FPGA at 100 MHz with three parallel kernel instances operating concurrently, achieving a measured throughput of 31,123 weight vectors/s at 90.9% parallel efficiency relative to the measured single-instance rate. At an estimated 2.451 W of programmable-logic power, and 5.286 W including the processing system, this corresponds to 12,698 and 5,888 weight vectors/s/W, respectively. Under a matched three-way dispatch, a 24-core Intel Xeon Gold 5220R at 2.20 GHz achieves 465,699 weight vectors/s at a measured 83.08 W package power, corresponding to 5,606 weight vectors/s/W. The FPGA therefore attains 2.3x the power-normalised throughput of the processor on a programmable-logic basis and 1.05x on a total on-chip basis. In contrast, the processor retains a raw throughput advantage of approximately 15x at this operating point. Numerical precision is validated against MATLAB float32 reference outputs from a Field II cyst phantom simulation, achieving a 100% pass rate with a root mean square error of 5.10x10^-7, confirming near-theoretical finite-precision behaviour without systematic bias.
Read the full abstract

All authors Athi Ram R S, Alwin A, S. G. Sreejeesh, J. U. Kidav

Optimization and Control

Structural Compatibility and Uniform Stability of Temporally Degenerate Parabolic Systems

Modern feedback design for distributed parameter systems presupposes that the closed-loop dynamics define a well-posed evolution problem. This presupposition becomes nontrivial for temporally degenerate parabolic systems, where temporal degeneracy affects not only the analytical properties of the evolution equation but also the mathematical formulation of the feedback interconnection itself. It is shown that admissible feedback interconnections for temporally degenerate parabolic systems are completely characterized by an operator compatibility condition linking the singular reaction operator with the actuator and observation operators. This characterization removes the singular component of the closed-loop dynamics and reduces the degenerate evolution equation to a regular evolution equation. Building upon this regularized formulation, a critical–residual decomposition yields a uniform exponential stability certificate, which is subsequently extended to the original infinite-dimensional evolution through a finite-to-infinite lifting theorem. A constructive static output feedback synthesis is finally obtained as a consequence of these results. Numerical experiments illustrate the regularization mechanism, validate the stability certificate, and confirm the finite-to-infinite lifting.
Read the full abstract

Analysis of PDEs

Existence of multi-peak solutions for singularly perturbed problems in the zero-mass case

We prove the existence of multi-peak solutions for singularly perturbed elliptic problems in the so-called zero-mass case by applying the classical Lyapunov-Schmidt reduction method. The goal is to construct solutions concentrating around several distinct interior points of the domain, identified as nondegenerate critical points of a potential.
Read the full abstract

Complex Variables

Proof of the generalized Chui conjecture

We prove Chui's conjecture on sums of Cauchy kernels. It states that among all configurations of Cauchy kernels on the unit disk, the equispaced one minimizes $L^1$ norm of the sum in the unit disk. Moreover, we obtain a generalization to a wider set of functionals, including weighted $L^p$ norms for $p > 1$ with radially symmetric weights.
Read the full abstract

Cryptography and Security

SecDT: A Profile-Based Security Layer for TRDP Communications

The Train Real-time Data Protocol (TRDP) is widely used on rolling stock but it provides limited native support for cryptographic protection. Furthermore, the multicast traffic profile used in TRDP Process Data to exchange critical information between onboard subsystems makes the introduction of cryptographic protection a challenge. This paper presents a lightweight security layer for secure TRDP communication that implements a number of security profiles built around modern cryptographic algorithms. This additional layer relies on an On-board Key Management System (OKMS) for both security profile negotiation, dynamic key distribution and key lifecycle management. The security profiles allow for cryptographic agility and flexibility, ranging from simple authentication to Authenticated Encryption with Associated Data (AEAD) algorithms. The security profile negotiation procedure guarantees all TRDP End Devices (ED) on a common Communication ID (ComID) share the same security profile and can therefore process each other's messages. A prototype implementation based on mbedTLS and Arm Platform Security Architecture (PSA) was developed and evaluated. Experimental results demonstrate manageable overhead, suitable for the real-time and time-sensitive communication found on rolling stock.
Read the full abstract