Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Monday 14 September

Cosmology and Nongalactic Astrophysics

Peering Beyond the Veil of Last Scattering: A View of the Universe with CMB Spectral Distortions

The frequency spectrum of the cosmic microwave background is the most precise blackbody ever measured in nature, with deviations constrained at the level of almost one part per million from the COBE satellite. Nevertheless, departures away from a perfect blackbody are present in standard $\Lambda$CDM cosmology, lurking just beneath the surface of our current observational bounds. These spectral distortions provide invaluable information on our thermal history in both the post- and pre-recombination epochs, allowing us to peer beyond last scattering and into the primordial Universe. Here, we present an overview of the underlying physics responsible for generating CMB spectral distortions at all epochs. As an illustration of this rich physics, we review a comprehensive set of mechanisms capable of generating distortions both within and beyond the standard $\Lambda$CDM paradigm. We also discuss the information that can be gleaned by going beyond the monopole (sky-averaged) spectrum and exploiting the spatial information present in anisotropic spectral distortions. To supplement our discussion of the diverse science of spectral distortions, we provide an overview of the upcoming and proposed experimental landscape. We highlight that the combination of the TMS, COSMO, and BISOU experiments will provide the first discovery of a monopole $y$-type distortion within the coming decade. From space, the proposed FOSSIL experiment is forecasted to improve upon the original COBE/FIRAS measurement by roughly three orders of magnitude in sensitivity, bringing with it the detection of the $\Lambda$CDM $\mu$-type distortion sourced by the dissipation of small scale acoustic modes in the pre-recombination plasma. With transformational measurements on the horizon, CMB spectral distortions offer a uniquely sensitive probe of the thermal history of the Universe at redshifts $z \lesssim 2 \times 10^6$.
Read the full abstract

All authors Bryce Cyr, Nabila Aghanim, Ethan Baker, Elia Stefano Battistelli, Richard Battye, José Luis Bernal, Jens Chluba, Xavier Coulon, William Coulton, Paolo de Bernardis, Eleonora Di Valentino, Guillem Domènech, Sara Evangelista, Giulio Fabbian, Fabio Finelli, J. Colin Hill, Rishi Khatri, Alan Kogut, Guilaine Lagache, Hongwan Liu, Bruno Maffei, Fereshteh Majidi, Abhishek S. Maniyar, C. J. A. P. Martins, Silvia Masi, Jeff McMahon, Daniela Paoletti, Vivian Poulin, Wenzer Qin, Mathieu Remazeilles, José Alberto Rubiño-Martín, Alina Sabyr, Mayuri Sathyanarayana Rao, Carlos Sierra, Jack Singal, Tracy R. Slatyer, Elsa M. Teixeira, Leander Thiele, Léo Vacher, Duncan Watts

Cryptography and Security

Permutation-Based Stegomalware in Large Language Models: Threats and Countermeasures

The difficulty of training large language models (LLMs), together with their ubiquity, raises the threat of stegomalware, where malicious payloads are embedded into model weights. Recent work has demonstrated the use of permutation symmetry in model weights to mitigate these threats, but failed to show neutralization of stegomalware across all weights for LLMs. In this paper, we demonstrate the full potential of behavior-preserving symmetries as a defense against stegomalware, as well as the risks these symmetries pose when exploited by attackers. For stegomalware neutralization, we improve upon previous work, demonstrating that it is possible to select permutations which displace all model parameters. This contrasts with previous methods which left a significant percentage of weights unaltered in LLMs. When used in an attack, we show that permutation symmetries can encode malware into the weights of a model in a way that is theoretically lossless, requires no retraining after encoding, and needs no payload-specific information in the extraction script—a combination of characteristics not previously seen in any single method. While theoretically lossless, permutation can in practice alter model behavior due to the accumulation of numerical error. We therefore quantify the loss in model performance associated with applying these methods, for both attack and defense, showing it to be minimal.
Read the full abstract

Computers and Society

AI-Driven Feedback Systems, Digital Labour, and Silent Quitting: Transforming African Workplaces

The current trend of digitalisation has revolutionised the organisation of work and the way it is measured and performed across the globe, with AI becoming more common for managing labour and performance, as well as employee communication. In African organisations, where there is increasing adoption of remote work, hybrid models of work, digital collaboration, and data-based HR management, the notion of silent quitting has become more relevant, defined as worker disengagement when employees are still doing their job but do not put any effort into achieving good performance and exhibiting any emotion. This paper investigates how AI-driven feedback mechanisms, including sentiment analysis systems, pulse surveys, chatbots, engagement dashboards, and predictive analytics, are changing African workplaces through offering continuous listening, instant performance information and proactive engagement with employees. The study also explores how AI can assist organisations in identifying early disengagement and enable intervention and better employee communication in both private and public sector organisations in Africa. At the same time, we address the challenges of socioeconomic development and governance posed by AI implementation in developing countries, including digital inequality, infrastructure shortcomings, privacy concerns, algorithmic bias, and the risk of workplace surveillance. By situating silent quitting within wider debates on digital labour and automation, the paper contributes an African-centred perspective to discussions on the future of work and offers practical recommendations for HR professionals, managers, policymakers, and technology developers seeking responsible, context-sensitive approaches to workplace transformation across the continent.
Read the full abstract

Human-Computer Interaction

When AI Says "I Am Unable to Answer": Understanding User Responses to AI Refusals

While refusal-based safeguards to mitigate hallucinations in large language models (LLMs) are becoming increasingly common, they may conflict with users' preferences for definitive answers. However, we know little about how users respond to refusals across repeated interactions, when refusals become more or less acceptable, and for whom. In this work, we examine how refusal frequency, explanations, and need for cognitive closure (NFCC) shape responses to AI refusals. Participants (N=599) interacted with an AI system that never refused, refused infrequently, or refused frequently, with refusals either explained or unexplained. Participants were most satisfied with genuine responses, followed by hallucinations and then refusals, despite recognizing hallucinations as less accurate. Explanations increased satisfaction with infrequent, but not frequent, refusals. Higher-NFCC participants evaluated AI systems that refused more negatively. These findings reveal a tension between hallucination avoidance and user satisfaction and highlight the importance of designing balanced refusal strategies.
Read the full abstract

All authors Mahjabin Nahar, Eun-Ju Lee, Yujin Heo, Dongwon Lee

Astrophysics of Galaxies

JWST Observations of Starbursts: A Young Bubble in NGC 253's Central Starburst

We present a multi-wavelength analysis of a young bubble in the nuclear starburst of NGC 253 using new JWST MIRI-MRS observations together with archival ALMA (100, 350, 690 GHz) and Chandra data. The MIRI maps reveal a prominent bubble-like structure in both ionized and molecular emission lines. The bubble is spatially coincident with one of the least embedded massive young clusters detected with ALMA, suggesting that the cluster is driving the expansion. We measure a radius of $\sim 11.5 \pm 3.4$ pc and an expansion velocity of $\sim 90 \pm 44$ km s$^{-1}$, implying a dynamical age of $\sim 0.1 \pm 0.1$ Myr. Using RADEX modeling of multiple CO transitions, we infer a molecular mass in the range of $(1.3 \pm 0.3) \times 10^4$ to $(2.8 \pm 0.8) \times 10^5$ $M_\odot$. We derive a kinetic energy of order $10^{51}$-$10^{52}$ erg, consistent with mechanical input from Wolf-Rayet stellar winds or supernovae in a $\sim 10^6$ $M_\odot$ cluster. The existence of a large population of Wolf-Rayet stars or past supernovae is supported by the presence of coincident X-ray emission. Our results provide direct evidence that individual clusters in a nuclear environment can carve out coherent structures on parsec scales and inject significant energy and momentum into the surrounding interstellar medium, which can contribute to the nuclear outflow in NGC 253.
Read the full abstract

All authors Kaitlyn E. Sheriff, Elisabeth A. C. Mills, Xinyu Mai, Utsav Siwakoti, Sara E. Duval, Alberto D. Bolatto, Rebecca C. Levy, Jia Wei Teh, Torsten Böker, Serena A. Cronin, Daniel A. Dale, Keaton Donaghue, Kimberly Emig, Simon C. O. Glover, Rodrigo Herrera-Camus, Ralf S. Klessen, Thomas S.-Y Lai, Ashley E. Lieber, Laura Lenkić, Sebastian Lopez, David S. Meier, Jüergen Ott, J. D. T. Smith, Yu-Hsuan Teng, Paul P. van der Werf, Sylvain Veilleux, Vicente Villanueva, Rachel Cionitti, Joseph Havens, Maleah Rhem, Nathan Shaw, Kai Smith, Hazel B. Wright, Md. Abdullah Al Zaman

Information Theory

Two variants of Twisted Reed-Solomon Codes

Generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes provide important sources of maximum distance separable codes. In this paper, we study two variants obtained by introducing column twists and simultaneous row-column twists into Reed-Solomon-type evaluation codes. For the column-twisted family, we provide necessary and sufficient conditions for the code to be MDS in terms of explicit subset product conditions. Under the stated parameter assumptions, the Schur square has dimension 2k+1, which leads to MDS codes that are not equivalent to Reed-Solomon codes. For the row-column twisted family, we establish necessary and sufficient conditions for the MDS property in terms of elementary symmetric functions. The larger Schur-square dimension provides a further distinction from both Reed-Solomon codes and known twisted families, thereby yielding new non-RS MDS codes. Finally, explicit parity-check matrices and dual descriptions are obtained for both code families. These results provide a foundation for subsequent studies of self-orthogonality, hull dimensions, and applications to quantum-code constructions.
Read the full abstract

Astrophysics of Galaxies

Forged in Quenching: Morphological Transformation across Star-forming and Quiescent Galaxies in EAGLE

The connection between morphology and quenching in central galaxies is well established, but its physical origin remains widely debated. We address this by tracing the main progenitor branches of $z=0$ star-forming and quiescent central galaxies in the EAGLE cosmological simulation from $z\gtrsim4$. Their disc-to-total ratio and triaxiality tracks are indistinguishable until $z\approx 1$-$2$, when both diverge concurrently with the onset of quenching, whereas the size and supermassive black hole (SMBH) mass differences are established earlier. We identify four physically distinct channels linking galaxy morphology and quenching. First, mergers cause size growth, rotation suppression, triaxiality increase, and SMBH growth, with the accumulated SMBH mass subsequently causes the quenching of galaxies. Second, with merger history controlled, galaxy morphology modulates SMBH growth throughout the star-forming phase: compact, dispersion-dominated galaxies grow their SMBHs faster and are preferentially quenched, producing the size and morphology differences between star-forming and quiescent galaxies. Third, at fixed stellar mass and SMBH mass, compactness further facilitates the quenching of galaxies. Fourth, disc instability transforms compact oblate discs into prolate systems, with substantial size growth and suppressed rotation but negligible stellar mass growth. This secular channel contributes about half of the prolate galaxy population around $M_{\rm star}\approx 10^{10.6}\,\rm M_\odot$. Prior to quenching, the progenitors of quiescent galaxies already have smaller sizes, lower disc-to-total ratios, and more massive SMBHs than star-forming galaxies at the same epoch, by amounts comparable to their differences at $z=0$. Morphology therefore plays an active role in growing the SMBH and quenching the galaxy, rather than being passively inherited through progenitor bias.
Read the full abstract

All authors Kai Wang, Carlton Baugh, Sownak Bose, Shaun Cole, Carlos S. Frenk, Hao Fu, Cedric Lacey, Shengdong Lu, Aaron Ludlow, Peder Norberg, Yingjie Peng, Katy L. Proctor, Isabel Santos-Santos, Francesco Shankar, Tom Theuns, Enci Wang, Tao Wang, Vivienne Wild

Robotics

Occupancy Network-Guided Autonomous Robotic Partial Nephrectomy

Autonomous soft-tissue cancer surgery has been limited to interventions on organ surfaces, because current systems cannot perceive and adapt to anatomy once it deforms or is cut. We introduce the first vision-guided autonomous system capable of performing complete tumor resections for partial nephrectomy. Our system integrates conditional occupancy networks, trained entirely in a physics-based simulation, that infer full 3-D anatomy (tumor, margin tissue, and kidney) from single-view partial point clouds. These occupancy networks maintain intraoperative tracking even as tissue is cut and deformed, enabling adaptive planning and execution. The surgical platform combines a depth camera for capturing surface point clouds, dual robotic arms for electrosurgical cutting and vacuum-based tissue manipulation, and an autonomous control strategy for tumor resection. In patient-derived hydrogel phantoms under an open partial nephrectomy setting, the robot performed eight consecutive autonomous tumor resections comprising 77 electrosurgical cuts, with all cuts achieving negative surgical margins and 1.61 $\pm$ 0.48 mm mean absolute margin error. This work demonstrates, for the first time, a foundation for supervised autonomous closed-loop, imaging-driven, margin-negative tumor removal in phantoms.
Read the full abstract

All authors Ethan Kilmer, Pit Henrich, Jiawei Ge, Paul M. Scheikl, Laura Connolly, Soum D. Lokeshwar, Joseph Chen, Justin D. Opfermann, Kaitlyn Kumar, Lauren Shepard, Ahmed Ghazi, Nirmish Singla, Richard J. Cha, Kevin Cleary, Franziska Mathis-Ullrich, Axel Krieger

Signal Processing

Distributed Edge-to-Cloud Architecture for Continual Harmonic Load Modeling

Rapid proliferation of power electronic loads at the distribution grid edge has made accurate harmonic load modeling critical for power quality assessment, transformer derating, and grid planning. Existing Frequency Coupling Matrix (FCM) identification methods produce static, one-time models that rapidly lose fidelity as load composition evolves. This paper proposes a distributed edge-to-cloud architecture for autonomous, continual FCM re-identification under real field conditions, with two contributions: (i) a state-machine-driven pipeline that monitors point-on-wave (PoW) measurements and triggers FCM re-identification only when model accuracy falls below a set threshold; and (ii) an edge-to-server architecture confining waveform processing to a low-cost Raspberry Pi node, transmitting only compact JSON model updates upon confirmed change rather than streaming raw PoW data. Validated through a residential field deployment, the framework triggered retraining in 3 of 33 monitoring cycles and restored system modeling accuracy above the 80% threshold after each event, reducing upstream data transmission by 99.7% relative to continuous streaming.
Read the full abstract

Operator Algebras

A generalization of the Powers-Størmer-Ogata inequality

We show that for any positive operator monotone function $f$ the inequality $\int_{[0,\infty)} f(t) \, \mathrm{d} \left\lVert E^{\Delta_{\varphi,\psi}}(t) \xi_\psi \right\rVert^2 + f'_\infty \varphi(1-s(\psi)) \geq \frac{f(1)}{2} \Bigl( \varphi(1) + \psi(1) - \lVert \varphi - \psi \rVert \Bigr)$ holds, where $\varphi, \psi \in \mathcal{M}_{*,+}$ are two normal positive linear functionals on a von Neumann algebra $\mathcal{M}$, and $\Delta_{\varphi,\psi}$ is the associated relative modular operator. Choosing $f(t) = t^s$ with $s \in [0,1]$, the Powers-Størmer-Ogata inequality is recovered.
Read the full abstract

Machine Learning

Anatomy of Associative Recall in Fixed-State Recurrences: A Matched-State Decomposition, an Interference Wall, and a Curriculum That Breaks It

Fixed-state recurrences–linear attention and state-space models–are reported to lag behind attention on associative recall, but whole-architecture comparisons cannot say which ingredient is responsible. We decompose masked multi-query recall at a fixed state budget along three single-knob axes: a short causal convolution, the transition structure (rank-1 delta rule vs. diagonal), and decay. The convolution dominates (~+0.5 recall in both families under matched training): comparisons that pit convolution-free cells against a convolution-equipped Mamba measure the missing convolution, not the recurrence. The rank-1 transition beats its diagonal ablation by +0.19/+0.32 at 16/32 pairs, but the margin shrinks to +0.03 once both cells carry the convolution, and a state-matched Mamba-2 ties the unarmed rank-1 cell: no class claim survives. Cells that solve 32-pair recall degrade gracefully with load yet fall to chance retrieving 4 pairs from a distractor haystack–flat across lengths and transitions. Interference under sparse supervision, not capacity: a distance curriculum takes the unchanged architecture from 0.021 to 1.000. Training is a lock-in lottery–a seed either locks in or does not–and the curriculum is the lever. Lock-in rises from 1/10 to 7/10 (p=0.02); dense supervision adds nothing; at L=256 a shaped ramp reopens a boundary the uniform curriculum cannot (4/5 vs. 0/9); and at L=512, where the ramp collapses (0/6), gating it on measured accuracy locks in 6/6 (p=0.001). Bidirectional denoiser cells, reading the query before the haystack, show no measurable advantage over causal training (ten seeds), and collision-key retrieval needs two layers. Arming for recall is free on an S_5 state-tracking guardrail–the armed cell is significantly better at every depth (p<=0.0044). These replace "recurrent models are bad at recall" with a measured decomposition and two cheap interventions.
Read the full abstract

Optimization and Control

GPU-Accelerated Presolving for Linear Programming

Recent research has focused on developing GPU-accelerated algorithms for solving linear programs (LPs), with results that are nothing short of extraordinary. But a complete solver pipeline consists of more than the core algorithm, and the elephant in the room is that stages such as presolve have remained on the CPU, where they have become an increasingly large bottleneck. Presolve has stayed on the CPU because of the longstanding view, held by academic and industrial developers alike, that it is inherently sequential and irregular, and therefore difficult to parallelize efficiently. In this paper we challenge this view and show that presolving can benefit substantially from GPU acceleration. We describe simple design principles that avoid severe load imbalance and expose parallelism in reductions that appear inherently sequential. We implement these principles in cuPSLP, a GPU-accelerated version of PSLP, a CPU-based presolver that is itself several times faster than a state-of-the-art commercial presolver. In our experiments, cuPSLP reduces the shifted geometric mean presolve time of PSLP by a factor of 11 on the Mittelmann LP benchmark set and 42 on the GAMS large-scale LP benchmark set, with similar reduction quality.
Read the full abstract

Graphics

Delayed-Light Rendering for Superluminal Objects

We present a real-time rendering method for scenes perceived through signals of finite speed $c$ in a non-relativistic setting: $c$ is a property of the imaging signal, not the causal speed limit, so bodies may move faster than $c$. A superluminal body presents several simultaneous images; pairs are created and annihilated in caustic flashes, and some branches play backward in time. Rather than approximating these effects, we enumerate them as roots of an emission condition posed against recorded state history, exact at every point solved, up to one stated approximation for moving observers. Because a fixed-step simulation records piecewise-linear history, the emission condition restricted to one history segment is a quadratic whose discriminant detects image-pair creation and whose slope classifies each image's playback direction, rate, and brightness. Perception is not tied to a single reference point: a global perceived state is built for an arbitrary finite set of observation events, and the delay landscape is the upper envelope of their backward light cones. A monotonic emission clamp guarantees the picture never regresses to images older than those already shown. Per-vertex solves shear bodies straddling delay gradients, and pre-generated frame-sequence assets are adapted by treating them as $(x,y,t)$ volumes sliced by the solved emission surface, so playback rate, reversal, and intra-body de-phasing arise with no animation-specific code. The exposition and implementations are planar: the emission condition and its per-segment solve are norm conditions, independent of dimension, but the visibility and occlusion questions a 3D renderer must answer are out of scope. The method is deployed in a released real-time strategy game; we describe the optimizations that make it run at interactive rates, and measure the algorithms through independent reference implementations.
Read the full abstract

Astrophysics of Galaxies

The Missing Black Hole in the Large Magellanic Cloud: A Dynamical Prediction for Its Present-Day Location

There are indications that the Large Magellanic Cloud (LMC) hosts a central supermassive black hole (SMBH), yet no direct detection exists: one reason is that its present-day location need not necessarily coincide with the photometric or kinematic centers. Here we frame a dynamical targeting problem and predict the present-day sky location of the LMC SMBH. We model the recent LMC-Small Magellanic Cloud (SMC) interaction, which induces a bar-disk offset, and integrate SMBH orbits within a realistic, time-dependent LMC-SMC-Milky Way (MW) potential. We show that the MW tidal field at present epoch exceeds that of the SMC by at least an order of magnitude, setting a preferred direction for coherent, vertical low-amplitude displacements, while the disk asymmetry drives in-plane offsets. Projecting onto the observed LMC frame, the mean of our predicted SMBH probability distribution is located at $(\alpha,\delta)=(80.23^{\circ},-69.55^{\circ})$, with a $1\sigma$ confidence ellipse having semi-major and semi-minor axes of $(a,b)=(1.34^{\circ},0.56^{\circ})$, respectively. This mean is $\sim6$ arcminutes north of the adopted dynamical center, while the mode coincides with the dynamical center and lies well within the $1\sigma$ confidence region. Furthermore, all literature estimates of the LMC center considered here fall within the $2\sigma$ confidence region. This provides a concrete, testable target for ongoing and upcoming spectroscopic surveys, transforming the search for the LMC SMBH from an unconstrained problem into a focused observational strategy.
Read the full abstract

All authors Robin Chisholm, Elena D'Onghia, Niv Drory, Andrew Fox, Noam Libeskind

Symplectic Geometry

Existence of a positive hyperbolic orbit in three-dimensional Reeb flows

Non-degenerate periodic orbits in three-dimensional Reeb flows are classified into three types: positive hyperbolic, negative hyperbolic and elliptic. In the present paper, we consider a closed connected contact three-manifold with a non-degenerate contact form. We show that its Reeb flow has a simple positive hyperbolic orbit if it has at least three simple periodic orbits. We mainly study the case in which no elliptic orbit exists. We prove that there is no non-degenerate contact form on a closed connected three-manifold with $b_1=0$ such that all simple periodic orbits are negative hyperbolic. As a corollary, by combining the author's previous result in the presence of an elliptic orbit and the known result for $b_1>0$, we obtain the main result. The proof uses the Weyl law for ECH spectral invariants. We also use compactness for genus zero $J$-holomorphic curves counted by the $U$-map. Under the contrary assumption, the number of simple orbits in each action interval $[L,2L]$ is uniformly bounded with respect to $L$. We use this property to study ECH generators and genus zero $U$-curves.
Read the full abstract

Distributed Computing

BOA: Beamwidth Online Adaptation for Filtered-ANNS on a GPU

Filtered approximate nearest neighbor search, i.e. returning the top-k vectors nearest to a query vector among those satisfying one or more attribute predicates, has become a fundamental operation in modern vector search systems. Graph-based solutions employ beam search to solve a batch of queries in parallel for high throughput and employ high fixed beamwidth of 100 or greater for ensuring high recall. We observe that, given a batch of queries, more than half of the queries across multiple data sets can be solved precisely with a beamwidth of just 50 or less. Therefore, existing systems based on fixed high beamwidth sacrifice throughput to achieve high recall by forcing every query to search as thoroughly as the hardest query in the batch even though majority of queries can be resolved by a shallow search. In this paper we present a filtered ANNS engine for a single GPU named BOA that uses online beamwidth adaptation to customize the search effort across queries within a batch under multi-attribute range filters. We address the recall throughput tradeoff with a multi-phase search: all queries are first evaluated under a narrow beam, and only those with uncertain results are progressively refined with wider beamwidths. This renders recall largely insensitive to the starting beamwidth, whereas prior methods must use a fixed high beamwidth for high recall. BOA+ overlaps execution of phases to further enhance throughput. Our experiments show that, for 10,000 queries, online adaptation achieves 94.05% to 99.96% recall with average beamwidth ranging from 22 to 77, while a non-adaptive approach requires a fixed beamwidth of 500 to achieve similar or lower recall. Consequently, adaptivity increases throughput by 7x to 12.5x
Read the full abstract

High Energy Astrophysical Phenomena

Optical Spectroscopy of a Candidate O-Star X-ray Binary in M33

We present new observations of a candidate O-type donor star in a high mass X-ray binary (HMXB) in M33. The candidate donor star is spatially coincident with a hard X-ray point source. The star's optical magnitude and colors are consistent with what is expected for a massive star. The four band optical/UV spectral energy distribution (SED) of the donor star is well fit by an O-giant model with an effective temperature of $\sim$43 kK, mass of 75$_{+9}^{-0.3}$ $M_{\odot}$, and surface gravity of log(g) of $\sim$3.8. We present four epochs of optical spectroscopy of the donor star taken with the Keck/DEIMOS spectrograph over the course of approximately one year. Features in the star's spectrum are consistent with an O-type star. The star's spectrum exhibits a strong H$\alpha$ emission line during all epochs of observation with a variable line profile. We measure the star's radial velocity for each epoch, which we use to fit for a systemic velocity. We find that the systemic velocity is offset from the local gas velocity from HI measurements, suggesting that the system has a peculiar velocity relative to the local gas. We observe a radial velocity shift in the He I absorption lines that is consistent with motion within a binary system.
Read the full abstract

All authors Margaret Lazzarini, Lara Cullinane, Karoline Gilbert, Puragra GuhaThakurta, Kyros Hinton, Daniel Stern, O. Grace Telford, Tobin M. Wainer, Benjamin F. Williams, Robert Alexander, Ernesto Ramirez Jr

Logic

Exact Complexity of the Satisfiability Problem for Strategy Logic

We show that the satisfiability problem for Strategy Logic introduced by Mogavero, Murano, and Vardi is $\Pi^1_\infty$-complete, and, more strongly, computably isomorphic to true second-order arithmetic. The lower bound is established for the next-time Boolean-goal fragment of Strategy Logic. Consequently, Strategy Logic is not recursively axiomatizable, even with effectively defined $\omega$-rules.
Read the full abstract

Materials Science

Two-Dimensional Materials toward CMOS-Compatible Scalable Quantum Hardware

Manufacturability is one of several constraints on developing solid-state quantum processors, along with qubit performance, control, connectivity, cryogenic operation, and fault tolerance. Chemical residues, structural disorder, and non-uniform interfaces introduced during fabrication can compromise qubit coherence. Two-dimensional (2D) materials, with their atomically thin crystals and van der Waals interfaces, offer routes to address some of these challenges. Their concurrent development as next-generation CMOS channel materials motivates an examination of whether relevant processes can be transferred to quantum chips. This Perspective evaluates the opportunities and limitations of 2D materials for CMOS-compatible quantum hardware.
Read the full abstract

Quantum Physics

Why Are We Unrolling? The Importance of Structured Quantum Programs for Compilation

As quantum software stacks scale up to support future fault-tolerant quantum hardware and algorithms, quantum compilation is becoming an increasingly important component of the stack. How do we ensure that our software stacks support dynamic algorithms, including patterns such as mid-circuit measurement feedforward and repeat-until-success, with hundreds of logical qubits and billions of quantum operations? To do so, we must re-think how we represent quantum programs beyond straight-line circuits, to representations that include classical structure and dynamism, and make this the default representation to consider when performing quantum compilation. In this work, we present important patterns and algorithms from fault-tolerant quantum applications which admit a structured representation that we argue is crucial to preserve, and set a challenge to the community to compile such representations without unrolling them into straight-line quantum circuits. We also explore the status quo of structured program support in quantum software, and ask ourselves the rhetorical question: how much more efficient can we make quantum compilation tooling when we take into account the additional information from classical structure?
Read the full abstract

All authors Damian Rovara, Daniel Haag, Mark Koch, Josh Izaac, Seyon Sivarajah, Robert Wille, Augustín Borgna, Lukas Burgholzer, Brad Chase, Olivia Di Matteo, David Ittah

Machine Learning

Skeletal Prototypes on Iterative Nerve Expansions

Prototype reduction replaces a training set with a smaller representation, and the established methods return a finite set of points. We propose Skeletal Prototypes on Iterative Nerve Expansions (SPINE). The model for each class is an embedded 1-complex rather than a point set. Its initial edge set is a class-conditional Mapper graph, so the data decide which localized clusters are joined. Later phases fit the vertices under a classification objective, and an observation is assigned to the class whose complex is nearest. The segments therefore enter the decision rule and not only the fitting. We evaluate SPINE on seventeen benchmark datasets under stratified 10-fold cross validation, against seven other prototype reduction methods at a matched budget. SPINE attains the highest mean accuracy and the best average rank. It is significantly better than five of the seven competitors under Wilcoxon signed-rank tests with Holm correction. A budget sweep shows that the decision rule using the entire graph segments contribute most when prototypes are scarce, while the method as a whole competes best at moderate budgets. Construction cost places SPINE with the discriminative methods, and it is faster than generalized learning vector quantization on fourteen of the seventeen datasets.
Read the full abstract

High Energy Physics (Theory)

A $dS_4$ maximum in M-theory from Casimir energies on Riemann-flat manifolds

We describe a fully explicit, four-dimensional, top-down de Sitter saddle, constructed via compactification of M-theory on the Riemann-flat manifold $T^7/\mathbb{Z}_8$. The solution has a vacuum energy of $5.02\cdot 10^{-10}\,M_\text{Pl}^4$, a hierarchy $m_{KK}/H\sim 10^{2}$, and is under control with respect to higher loop and higher-derivative corrections. The solution has an internal manifold with a diameter of a few Planck lengths, and it may be unstable due to loops of virtual 11d black hole microstates. While the solution is the first example of a top-down dS maximum from Riemann-flat manifolds in four dimensions and is realised explicitly enough to compute the vacuum energy precisely and the spectrum of light fields, it is far from being phenomenologically viable. The solution also suggests several promising directions in the search for higher quality dS saddles in the Riemann-flat Landscape, which we describe.
Read the full abstract

Image and Video Processing

Multisource Remote Sensing and Geospatial Analysis of Vineyard Wildfire Impacts and Exposure: The 2019 Kincade Fire

Working agricultural landscapes are often treated as background to wildfire disasters, even though they are managed fuel mosaics, productive assets, and parts of regional infrastructure systems. We examine vineyard wildfire resilience during the electrically initiated 2019 Kincade Fire in Sonoma County, California, using an open, event-anchored geospatial framework spanning 4,581 vineyard fields (8,813.2 ha), wildland vegetation, surveyed structures, roads, overhead smoke, and post-fire greenness. Sentinel-2, OpenET, gridMET, soils, terrain, NOAA smoke polygons, an ignition-date OpenStreetMap network, and three-dimensional data inventories were analyzed at native decision scales. Vineyard pixels showed substantially lower descriptive dNBR than wildland pixels inside the perimeter (means 0.130 and 0.337). This contrast did not identify a universal vineyard firebreak effect: a segment-clustered boundary model gave a small negative contrast at 100 m (tau = -0.0166) but changed across bandwidths, failed slope continuity, disappeared in a 100 m donut, and produced a wrong-signed placebo. A 250 m spatial GAM reversed the unconditional pattern: after conditioning on location, terrain, and water use, vineyard fraction was positively associated with dNBR, while residual Moran's I remained 0.519. Beyond spectral impact, all mapped vineyards intersected overhead smoke on at least one day (mean 7.78 potential smoke-days per field), 34.2% of road-network nodes were dead ends, and inside-perimeter vineyards showed a larger greenness deficit through 2021 (recovery ratios 0.815 inside and 0.854 outside). Lower immediate spectral impact therefore did not imply complete resilience. The study provides a reproducible urban-rural informatics template separating descriptive contrasts, conditional associations, exposure indicators, and recovery evidence for decisions in working landscapes.
Read the full abstract

All authors Parastoo Farajpoor, Mahla Ardebili Pour, Mohammad Bagher Ghiasi, Mohammadreza Narimani

2609.16168 · 14 Sep · 18 pages, 11 figures, 4 tables. Accepted for publication in Frontiers in Sustainability (in press). Data: https://doi.org/10.5281/zenodo.22713181. Code: https://github.com/MohammadrezaNarimaniUCDavis/Kincade_Vineyard_Wildfire_Resilience

High Energy Astrophysical Phenomena

Jet Feedback and the Self-Regulated Growth of Black Holes Embedded in AGN Disks

Accretion disks in active galactic nuclei (AGN) are expected to host embedded stellar-mass black holes (BHs) whose gas capture rates can be highly super-Eddington. Without feedback, they would rapidly grow and deplete the disk, but at such high feeding rates, radiation is advected inward with the flow. We test whether the resulting accretion-powered jet and its shocked cocoon can (i) self-regulate the BH's growth rate and (ii) break out of the AGN disk. Using GIZMO, we perform three-dimensional simulations of a $10\,{\rm M}_\odot$ BH, embedded in dense AGN-disk gas, launching a particle-spawned jet whose mass flux scales with the accretion rate. We explore a range of jet velocities, ambient temperatures and densities, and three cooling regimes. We find that the jet-inflated cocoon stalls near the Bondi radius and maintains a modest aspect ratio and the self-regulated mass flux is determined by momentum balance at the Bondi radius. Cooling controls the mode of self-regulated accretion, from large-amplitude oscillation cycles at low metallicity to weak, quasi-steady modulation at solar metallicity. Scaling our results to outer disk conditions implies that mechanical feedback limits BH growth to within an order of magnitude of the Eddington rate – largely preventing the overgrowth problem. Over the same disk region, the cocoon remains confined within the disk. In the inner disk, accretion onto the embedded BHs is limited by tidal shear rather than the Bondi radius, and our simulations no longer apply. Whether runaway growth and cocoon breakout remains possible in these inner regions needs further study.
Read the full abstract

All authors Marguerite Epstein-Martin, Kung-Yi Su, Zoltan Haiman, Rosalba Perna

Human-Computer Interaction

Moral Missions: Sustaining Responsible Practice by Surfacing Practitioner Moral Decision-Making Procedures

A growing ecosystem of techniques, toolkits, and guidelines has been developed to help data scientists consider the social implications of data-driven technologies. However, prior literature highlights that even when this ecosystem of techniques is provided to professional data scientists, they still struggle to consistently adopt a responsible data science practice. We posit that the key to sustained responsible data science practice is to approach it as a moral mission: a conviction-driven technical practice that seeks to transform social conditions by any degree possible. In this paper, we present a semi-structured interview study with 15 responsible data scientists and AI practitioners to understand the moral decision-making procedures they use to articulate and actualize their moral missions. Through a phenomenological analysis of our participants' accounts, we find participants engage in embodied introspection, circumvent institutional expectations, and center relationality throughout their moral missions. We also present how our participants engage in similar processes to contend with generative AI (GenAI) in their responsible practice. We conclude by calling for subversive data science communities and identifying sociotechnical design implications to better support sustainable responsible data science practice.
Read the full abstract

All authors Teanna Barrett, B. Biira, Jainaba Jawara, Andrew Shaw, Ziwei Dong, Chinasa T. Okolo, Seyi Olojo, Keerthana Kompella, Khadija Saho, Amy X. Zhang, Leilani Battle

High Energy Physics (Theory)

Instanton Interactions and the Axion Weak Gravity Conjecture

The Weak Gravity Conjecture admits a formulation in terms of long-range charged particle self-interactions being repulsive. We adopt a similar approach to the Axionic Weak Gravity Conjecture by considering long-range instanton interactions. At leading order, in the instanton separation, such interactions are mediated purely by massless scalar fields. Gravitational and gauge interactions are sub-leading. We formulate a repulsive interaction Axionic Weak Gravity Conjecture, which forms a bound on the scalar field dependence of the complex Euclidean instanton action. We show that in standard ultraviolet complete examples, this bound implies the usual formulation of the Axionic Weak Gravity Conjecture, while generally being stronger. Because this formulation is purely a statement about massless scalar fields, it implies that in the absence of massless scalars the usual bound on the axion decay constant could be modified.
Read the full abstract

High Energy Physics (Theory)

Schwinger-Keldysh effective actions for non-hydrodynamic poles and branch cuts

Retarded thermal correlators, analytically continued to complex frequency, exhibit non-hydrodynamic poles and branch cuts that constrain hydrodynamics. We construct Gaussian Schwinger-Keldysh effective actions in which branch cuts arise from continua of relaxation poles and response functions are governed by Stieltjes transforms of relaxation-time densities. Dynamical KMS symmetry, positivity and stability constrain the spectra, while endpoint behaviour controls the local branch structure and near-edge pole scaling. The illustrative examples of uniform and power-law densities exhibit respectively beyond-all-orders pole-endpoint separation and a continuous interpolation between pole-pole and pole-branch-point termination. Finally, we show that an energy-dependent relaxation-time approximation in kinetic theory provides a microscopic realization of our branch cuts at zero momentum.
Read the full abstract

Artificial Intelligence

GPEvac: GNN-Based PPO for Adaptive Evacuation Routing During Shooting Events

The sharp increase in mass shootings underscores an urgent need for systems that guide victims to safety in real time. An effective evacuation system must minimize threat exposure while also accounting for adversarial uncertainty and crowding dynamics. Current methods in the literature are rigidly constrained to layout-specific policies and computationally intractable in large-scale layouts, while practical guidelines simply advise victims to "run", "hide", or "fight". We propose GPEvac: a GNN-based PPO framework that computes adaptive evacuation routes during shooting events. To capture both local and long-distance dependencies, we introduce an edge-first sequential message-passing scheme with a learnable virtual global node. The resulting graph embeddings are integrated into a permutation-invariant scoring mechanism that allows a single learned policy to operate across building layouts of diverse topologies and sizes. Through extensive simulation, we show that GPEvac outperforms intelligent baselines across distinct architectural layouts, significantly reducing total threat exposure. Crucially, the system computes global evacuation routes in just 14.73 ms on local CPU hardware, enabling seamless integration with live surveillance systems. In addition to saving lives during shooting events, the methodologies developed are transferable to other graph-structured decision-making domains, including critical infrastructure, intelligent transportation systems, and adaptive sensor networks.
Read the full abstract

High Energy Physics (Theory)

Persistent Spontaneous Time-Reversal Breaking

We provide an analytic realization of spontaneous parity and time-reversal breaking without thermal restoration in a local, unitary, ultraviolet-complete quantum field theory in $2+1$ dimensions with finitely many fields. The theory is defined by a relevant Yukawa deformation of a product of the critical biconical vector model and free massless Dirac fermions. This deformation induces a renormalization group flow whose infrared endpoint is a decoupled product of the critical vector model and the conformal Gross-Neveu-Yukawa model. At zero temperature, the vacuum preserves both symmetries, whereas upon heating, the theory undergoes an inverse thermal transition at a finite critical temperature. Above this temperature, a fermion mass, odd under parity and time reversal, is dynamically generated, and the broken phase persists to arbitrarily high temperatures.
Read the full abstract

Machine Learning

LLM Inference in a Flash!

Large Language Models (LLMs) have shown impressive capabilities across a range of natural language processing tasks, and LLM inference has emerged as a critical workload for enabling downstream applications. The demands of serving LLM inference are becoming increasingly challenging as requests shift toward longer sequences and heavier inference, driven by retrieval-augmented generation, inference-time compute scaling, and long-context applications. Additionally, these challenges are compounded by hardware trends, as memory capacity and communication bandwidth are not scaling as fast as increases in workload complexity. Compute-in-Flash is a promising solution to address memory bandwidth limitations by moving computation close to memory, and to exploit the large capacity of SSD technologies. However, it is challenging to deploy LLMs on these systems as they lack support for high-precision floating point operations and have limited write endurance. In our work, we aim to address these challenges by designing inference algorithms to enable LLM inference on Flash compute-in-memory devices. We present an end-to-end integer-only quantization approach to eliminate expensive floating-point computations. To address the limited write endurance, we design a dictionary-based KV cache compression strategy based on sparse dictionary coding that represents each KV vector as a linear combination of static dictionary vectors. These algorithmic improvements enable us to exploit the benefits of Compute-in-Flash for both model weights and KV cache, and to minimize expensive data transfer operations. Across Llama-3.1-8B and Qwen-2.5-7B, our combined method exhibits limited accuracy degradation while reducing dynamic KV cache traffic by 15$\times$.
Read the full abstract

All authors Sebastian Zhao, Minseo Kim, Coleman Hooper, Luca Manolache, Michael W. Mahoney, Yakun Sophia Shao, Kurt Keutzer, Amir Gholami