Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Tuesday 1 September

Artificial Intelligence

Control-Data Flow Separation: Stable Prompt Optimization in Multi-Agent LLMs

Prompt optimization can improve multi-agent LLM systems, but the prompts being optimized often serve two entangled roles: generating task-relevant content and specifying execution-critical protocols, such as message routing, output formatting, and termination signals, on which the underlying code relies. As a result, a prompt edit intended to improve content generation can inadvertently corrupt the protocol and cause the entire agent pipeline to fail. Our key observation is that these two roles have different representations: execution protocols are typically structured, while task-relevant content is usually expressed in unstructured language. Based on this, we propose control-data flow separation, where execution-critical control is represented as typed, validated program objects, while task-relevant language remains the optimizable data flow for agent communication. This design allows optimizers to improve multi-agent behavior without exposing the routing or formatting interface to prompt drift. Across synthetic reasoning, collaborative review generation, and insurance rating workflows, our framework empirically achieves 100% eventual protocol validity while consistently improving task performance.
Read the full abstract

All authors Wentao Zhang, Syed Shariyar Murtaza, Junaid Ahmad Bhatti, Utkarsh Soni, Yifan Nie, Eugene Wen, Yuntian Deng

High Energy Physics (Phenomenology)

Status of the strong $CP$ problem

The strong $CP$ problem remains one of the major open questions in the Standard Model of particle physics. Its best-known solution is the Peccei–Quinn mechanism, which predicts a new pseudoscalar boson, the QCD axion. In recent years, alternative solutions and new perspectives on the foundations of the strong $CP$ problem have also received renewed attention. In this review, we provide a pedagogical account of the underlying physics and summarise the current theoretical and phenomenological status of the problem.
Read the full abstract

Robotics

DSG: Dynamic 3D Scene Graph Construction for Embodied Agents in Changing Indoor Environments

In indoor environments, object positions frequently change due to human activities or embodied-agent interactions, causing previously constructed scene graphs to become inconsistent with the current scene. To address this issue, we propose DSG, a dynamic 3D scene graph construction framework that detects object changes and performs spatial relationship reasoning. First, we construct a semantic-aware 3D Gaussian scene representation and develop a dual-view rendering-based object change detection method to enable reliable scene graph node updates. Second, we propose a spatial relationship reasoning method that incorporates multi-granularity visual context, enabling a large language model to identify a richer set of interobject spatial relationships. Furthermore, we introduce DynTHOR, a dynamic indoor scene graph benchmark built on the AI2-THOR simulation platform for evaluating scene graph construction in dynamic environments. Extensive experiments on Dyn-THOR, 3RScan, and real-world scenes demonstrate that DSG consistently outperforms existing methods in both object node construction and spatial relationship reasoning, significantly improving the accuracy of dynamic scene graph construction.
Read the full abstract

All authors Ming Liao, Chao Ye, Jianing Fei, Weiyang Lin

Information Retrieval

Towards Effective Structured Context Modeling for Conversational Recommender Systems via Dual-node Monte Carlo Tree Search

We investigate the role of conversational context modeling in user preference tracking for Conversational Recommendation Systems (CRSs). In this regard, we propose DREAMS, a novel tree-structured context modeling framework that explicitly captures user preference evolution throughout multi-turn interactions. DREAMS introduces two specialized node types to support the two fundamental objectives of CRSs: preference elicitation and preference exploitation. Specifically, elicitation nodes leverage Monte Carlo Tree Search (MCTS) to strategically explore conversational actions and infer latent user preferences, while exploitation nodes employ LLM-based refinement to transform the tracked preference state into structured retrieval queries for recommendation. Extensive experiments on benchmark datasets demonstrate the effectiveness of DREAMS and its design.
Read the full abstract

All authors Jincheng Zhang, Chen Huang, Wenqiang Lei, See-Kiong Ng, Yang Deng

Signal Processing

Cross-View Vision-Aided Proactive BS Selection and Beam Prediction for mmWave V2I Communications

This paper investigates environmental-sensing-aided proactive base station (BS) selection and beam prediction for millimeter-wave (mmWave) vehicle-to-infrastructure (V2I) wireless systems. We exploit onboard panoramic street-view images and a preloaded satellite map to predict communication-relevant environmental information around the vehicle, including nearby building footprints and heights. The predicted height map provides a compact environmental prior and is combined with historical mobility information to jointly predict the next-slot line-of-sight (LoS) state, transmission rate, and transmit and receive beam selections. On our dataset covering different real-world regions across New South Wales, Australia, the proposed framework achieves 91.4% LoS classification accuracy, 0.638 bps/Hz mean absolute error of data rate prediction, and more than 40% higher transmission rate than the conventional reactive baseline in geographically unseen regions, outperforming all evaluated deployable learning-based baselines. The dataset and code will be released at https://github.com/Huzijiao/Cross-view_V2I
Read the full abstract

All authors Zijiao Hu, Haiyao Yu, Gaoyang Pang, Guangchen Wang, Litianyi Zhang, Wanchun Liu, George C. Alexandropoulos, Branka Vucetic, Yonghui Li

Statistical Methodology

An efficient EM algorithm for both element-wise and structural missingness in matrix-variate normal mixture models

Matrix-variate data with missing entries arise frequently in applications where observations are naturally organized as two-dimensional arrays. Although the matrix normal distribution provides a parsimonious model through its Kronecker covariance structure, standard EM estimation can be computationally expensive because arbitrary missingness patterns typically destroy this separability in the E-step. In this paper, we propose an efficient partial EM algorithm for matrix-variate normal data with missing entries. The proposed method updates the conditional mean and covariance of the missing component through coordinate-wise approximations, avoiding repeated inversion of pattern-specific covariance matrices and avoiding construction of the full vectorized covariance matrix. We further develop a specialized update for submatrix missingness, where the missing-block precision retains a Kronecker product structure, and the covariance update can be carried out independently in the row and column directions. Simulation studies show that the proposed methods substantially reduce computation time compared with exact EM while preserving nearly identical observed-data likelihood across a range of dimensions and missing proportions. A real-data application to hyperspectral image patches demonstrates that the proposed imputation strategy can be embedded within a matrix-variate mixture model for simultaneous imputation and clustering.
Read the full abstract

Signal Processing

BeamRMX: Radiation-Pattern-Driven Learning for Generalizable Beam Radio Map Prediction and Beam Management

The evolution toward sixth-generation (6G) wireless networks is driving larger antenna arrays and highly directional multi-beam transmission, making accurate knowledge of beam-dependent spatial coverage important for beam management and environment-aware network operation. Radio maps (RMs) provide such a representation, yet conventional RM prediction assumes omnidirectional or transmitter-level radiation. In beamformed multiple-input multiple-output (MIMO) systems, one propagation scene instead gives rise to many configuration-dependent beam radio maps (BeamRMs), creating challenges in beam representation and generalization. Existing methods either condition prediction on beam descriptors or use beam maps as auxiliary inputs to generic architectures. We propose BeamRMX, which, to the best of our knowledge, is the first dedicated framework to treat the spatial radiation pattern as the primary BeamRM query and learn how scene geometry transforms it into the received power field. XBase learns multiscale interactions between the radiation query and scene geometry, while an optional Evidence Adapter uses a few cross-configuration BeamRMs from the same scene. Matched-domain and zero-shot experiments show consistent gains over deterministic and diffusion baselines, including mean absolute error reductions of 26.1% on unseen scenes and 47.8% on an unseen configuration. Cross-configuration evidence further improves reconstruction and intra-sector beam refinement.
Read the full abstract

All authors Yue Zhang, Xiucheng Wang, Wenshuo Chen, Nan Cheng

Populations and Evolution

BME-like Quartet Weights for Phylogenetic Trees

Like pairwise distances, quartets can be highly redundant and correlated on a phylogenetic tree, and their number grows on the order of n^4 rather than n^2. I explore BME-like weights for reweighting quartet scores before summing them to score a full tree. Three weights are considered on an unrooted binary tree: w_ext(q)=2^(-I_ext(q)), w_int(q)=2^(-I_int(q)), and w_tot(q)=2^(-I_tot(q))=w_ext(q)w_int(q), where the exponents count specified internal nodes in the minimal connecting subtree of a quartet. Exact tree-shape counts, total quartet-weight sums, and internal-edge crossing sums are calculated for all unlabeled unrooted binary tree shapes on 6-10 taxa. For w_ext, the total quartet weight is tree-shape-invariant and the edge-crossing sum depends only on split size. For any n-leaf tree, we prove sum_q w_ext(q)=(n-2)(n-3)/8, and the sum over quartets crossing an internal edge with split a|b equals (a-1)(b-1)/4. Exact tree-shape-specific normalizers are also derived for w_int and w_tot. A degree-corrected hard-polytomy extension is given for multifurcating trees, and a conditional consistency result shows that these positive weights preserve consistency when the underlying quartet estimates are themselves consistent for the true induced quartet states. These results provide a mathematical foundation for evaluating and applying BME-like quartet weights to reduce redundancy with the particular aim of improving statistical efficiency with finite data.
Read the full abstract

High Energy Astrophysical Phenomena

Nanohertz Gravitational-Wave Constraints on Supermassive Binary Black Holes at Cosmic Dawn

Standard continuous gravitational-wave searches with pulsar timing arrays (PTAs) neglect cosmological redshift, restricting their applicability to the local Universe. We introduce a redshift-aware PTA framework and apply it to the Parkes PTA Data Release 3, deriving the first direct constraints on supermassive binary black holes (SMBBHs) at the cosmic dawn. Evaluating our limits across a broad redshift range, we observationally establish the non-monotonic mass-redshift exclusion boundary driven by the theoretical “redshift bias", demonstrating how PTAs can effectively probe sources at extreme distances. Redshift-aware targeted searches toward high-redshift systems, including the ultraluminous quasar J0100+2802 ($z=6.327$) and the JWST-discovered galaxy JADES-GS-z14-0 ($z=14.32$), rigorously exclude SMBBHs with chirp masses $\mathcal{M}_c \gtrsim 10^{10} M_\odot$ across the nanohertz frequency band. Finally, we demonstrate that high-redshift binaries can be robustly detected and localized, allowing for the accurate measurement of their intrinsic properties. Our results provide the tightest constraints to date on SMBBHs at $z > 6$ and establish a practical framework for probing early-Universe black hole assembly.
Read the full abstract

All authors Yiqin Chen, Shi-Yi Zhao, Xingjiang Zhu, N. D. Ramesh Bhat, Jacob Cardinal Tremblay, Małgorzata Curyło, Valentina Di Marco, George Hobbs, Wenhua Ling, Rami F. Mandow, Richard N. Manchester, Saurav Mishra, Daniel J. Reardon, Sparrow Roch, Christopher J. Russell, Ryan M. Shannon, Jingbo Wang, Shuangqiang Wang, Andrew Zic

Robotics

A Wearable Pneumatic Device for Continuous, Closed-Loop, Bidirectional Tactile Interaction

We present a system of two wearable pneumatic haptic devices that supports continuous, closed-loop, bidirectional tactile interaction at perceptually relevant force and temporal scales. A single device can contain up to twelve pressure sensing channels connected to textile-based pneumatic pouches. Each channel in a device can be used as a sensor, an actuator, or both. As an actuator with integrated sensing, the channel generates stable skin indentation through local closed-loop control. As a sensor, a channel can be mounted (or worn) on any surface, including on a robot gripper or on the human body, and used to measure touch interactions with the environment or a human user. A distributed architecture supports sustained pressure output, rapid dynamic response, and wireless pairing of identical devices in a system to transmit and reproduce tactile pressure signals in real time. Device-level characterization demonstrates force bandwidth exceeding 30 Hz, rapid and well-damped step responses, and extended pressure retention compared to prior compact pneumatic platforms. Human studies show that pressure-based fingertip feedback enables discrimination of force and stiffness, improves teleoperated manipulation by reducing applied pressures by up to 23.1% and task duration by up to 27.4%, and lowers subjective mental workload by 18.8%, particularly under visually constrained conditions. By unifying tactile sensing and haptic feedback within a single pneumatic modality, the device provides a practical foundation for bidirectional touch interaction in teleoperation.
Read the full abstract

All authors Cosima du Pasquier, Aliyah Smith, Serin Huber, Joshua Phelps, Ilana A. Cohen, Ava Chen, Monroe Kennedy III, Allison M. Okamura

High Energy Physics (Experiment)

Panda Diplomacy: Foundation Model Pre-training across Particle Imaging Detectors for High Energy and Nuclear Physics

Foundation models are increasingly being pursued in particle and nuclear physics, but existing approaches remain strongly tied to individual experiments through detector-specific architectures or pre-training objectives, limiting their reuse across sensing modalities. We show that a point cloud self-distillation framework yields a substantially more general sensor-level pre-training recipe. We show that the same refined architecture and objective can be independently pre-trained with minimal changes on three qualitatively different detector modalities: liquid argon time projection chamber (LArTPC), collider TPC, and water Cherenkov. Using 1,000 labeled images for downstream task adaptation, Panda V2 matches or exceeds specialized foundation-model baselines trained with orders of magnitude more supervision, matching state-of-the-art particle-clustering performance with 70x fewer labeled events on sPHENIX while substantially improving particle identification, and on LArTPC data matching Panda (arXiv:2512.01324) particle reconstruction with up to 1,000x fewer labels. Beyond reconstruction, simple linear probes reveal physically meaningful latent structure associated with particle causality and track curvature.
Read the full abstract

Computer Vision

Streaming4D: Accelerate 4D World Models via Block-wise Video Generation and Incremental Reconstruction

Current 4D generation paradigms are often bottlenecked by a sequential decoupling design: video is generated first, followed by 3D reconstruction, leading to high interaction latency. This limits applications in interactive real-time scenarios. To this end, we propose Streaming4D, a tightly coupled synchronous pipeline that integrates block-wise autoregressive video generation with incremental 3D reconstruction. Unlike traditional frame-by-frame emission and delayed geometry recovery, Streaming4D generates temporal video blocks and immediately triggers reconstruction for each completed block, enabling parallel execution between synthesis and geometric updates. This approach allows the world representation to evolve online with the video stream, reducing feedback latency while preserving geometric fidelity. We instantiate Streaming4D using a Self-Forcing-style autoregressive generator and an incremental reconstruction backend. Experiments show consistent runtime improvements across resolutions on a single RTX 4090 (1.24$\times$ speedup), while maintaining high-quality 4D geometry and multi-view consistency.
Read the full abstract

All authors Xiaoyan Liu, Jiaxin Liu, Kangrui Li, Sifan Zhou

Cryptography and Security

A Version Space Approach for Digital Circuit Analysis

Many questions about a digital circuit take the same form. A hidden object is consistent with a set of observations, and one wants to know how many remain consistent and which observation to make next. The set of surviving candidates is the version space, and its size, on a logarithmic scale, measures how much the observations have settled. This paper develops the version-space view as one method and applies it to two circuit-analysis problems usually treated as unrelated. The first is probabilistic combinational equivalence checking, where the candidates are Boolean functions and the observations are modified-Haar spectral coefficients. A method proposed in 2002 posed this counting problem and solved only two special cases, leaving the general case an enumeration exponential in the number of observations. We close it. A reparameterization onto block sums turns the dependence among nested coefficients into locality, a sum–product recursion counts the surviving functions exactly in time polynomial in the truth-table size, closed forms follow for a single coefficient, a coefficient pair, and every ancestor-closed set, and the error of the independence approximation the 2002 work resorted to equals a computable lattice index. Every formula is checked against exhaustive enumeration and reproduces the 2002 tables. The second application is key counting for logic-locked netlists, where the candidates are keys and the observations are oracle responses. The same recursion, run over the gate-level factor graph, computes the number of keys still consistent with a set of queries; across seventy instances of the TrustHub obfuscation release the surviving entropy falls below the advertised key length every time. The two applications are one method: a witness supplies observations, each removes candidates, and the version space is counted exactly.
Read the full abstract

Computation and Language

Investigating Assistant Bias in LLM User Simulators Using a Role Vector

LLM-based user simulators are increasingly used to evaluate autonomous agents at scale, in place of costly human evaluations. Despite this promise, these simulators exhibit "assistant bias," a tendency to cooperate and pursue task goals. They rarely reproduce the frustration or disengagement that real users exhibit, compromising evaluation validity. Prior work outlines that this bias is baked in during model training, which role-playing prompts fail to override. We analyze this bias from model activations, extracting a user role vector by contrasting how the model represents user versus assistant perspectives on the same dialogue. We observe two findings: (i) the user direction is identifiable in activations, elicits user-like behaviors, and captures characteristics distinct from assistant traits; and (ii) although user-role activation associates with simulation realism and steering strengthens it, it can exaggerate user behaviors and override individual user profiles. Together, our findings provide a representation-level analysis of LLM user simulators, confirming that assistant bias is structurally identifiable and that user behavior can be directionally analyzed.
Read the full abstract

All authors Daeheon Jeong, Yoonjoo Lee, Eugene Choi, Sinie van der Ben, Juho Kim

Optics

Dual-polarized, mid-infrared nonreciprocal absorption

The emission and absorption of thermal radiation are usually coupled via reciprocity and Kirchhoff's law, stated as the equality of spectral directional emissivity and absorptivity. Magneto-optical materials have recently been identified as a promising route to lifting the constraint of reciprocity for thermal emission and absorption, with multiple experimental demonstrations using doped InAs, which is described by an antisymmetric, nonreciprocal dielectric tensor under an applied magnetic field. However, these demonstrations have been limited to p-polarized light in the Voigt configuration, whereas thermal radiation from a blackbody is unpolarized and thus comprised of both s- and p-polarized light. This means existing nonreciprocal emitter and absorber designs underutilize available power by 50%. Here, we report a photonic crystal slab-based structure that exhibits nonreciprocal absorption for both s- and p-polarizations in the mid-infrared spectral range. The structure operates from 11-20 $\mu$m and consists of an a-Si photonic crystal slab on top of a doped InAs substrate. The photonic crystal slab supports eigenmodes that couple to both s- and p-polarized plane waves, resulting in absorption peaks that, because of the applied magnetic field, spectrally shift in opposite directions for forward- and backward-propagating light$\unicode{8212}$a signature of nonreciprocity in planar, subwavelength systems. We fabricate the designed structure, then experimentally demonstrate dual-polarized nonreciprocal absorption by measuring its room-temperature absorptance using magnetic-field-integrated absorptance spectroscopy. Our design is a step toward the complete control of light as heat, which could improve photonic energy conversion, thermal management, and mid-infrared optical isolation and circulation.
Read the full abstract

All authors Simo Pajovic, Yiting Zhao, Yae-Chan Lim, Ruzan Sokhoyan, Harry A. Atwater

High Energy Physics (Phenomenology)

Photon Gas Thermodynamics with $\kappa$-generalized statistics at Planck-Scale

Kaniadakis, or $\kappa$-generalized, statistical mechanics provides a flexible framework for describing complex systems in the relativistic regime and predicts a richer phenomenology compared to its standard Maxwell-Boltzmann counterpart. In the present work, we extend the investigation of photon gas thermodynamics at the Planck scale within doubly special relativity to the framework of $\kappa$-generalized statistical mechanics. By adopting the $\kappa$-generalized statistical approach, we derive the principal thermodynamic quantities of a photon gas at the Planck scale, including the internal energy $U$, Helmholtz free energy $F$, pressure $P$, entropy $S$, and heat capacity $C_{\rm V}$. We find that these $\kappa$-deformed thermodynamic quantities exhibit nontrivial dependence on the deformation parameter $\kappa$. We then numerically evaluate these quantities as functions of temperature $T$, and reveal that, as $T$ approaches the Planck scale, the $\kappa$-deformed thermodynamic quantities are significantly suppressed relative to those in special relativity, while in the low-temperature regime they are enhanced and exceed their counterparts in special relativity, as a consequence of the $\kappa$-generalized statistics.
Read the full abstract

All authors Xinyi Yang, Qi Xiong, Guifeng Su, Yi Zhang

Machine Learning

Confess What You Know: Forget-Set Misalignment with Model Knowledge in LLM Unlearning

Machine unlearning for large language models (LLMs) often assumes that a pre-defined forget set matches what the model has memorized, but this frequently breaks in realistic privacy settings where the original training data is inaccessible. We term this gap forget-set misalignment and identify two cases. In Under Unlearning, the forget set omits memorized information and leakage persists. In Out-of-Knowledge Unlearning, the algorithm is driven to "forget" knowledge the model never learned, perturbing parameters and degrading utility. Using gradient-level analysis, we show these behaviors arise from misaligned unlearning targets rather than specific optimization choices. We then propose CONfession-to-Forget-Set (CONFS), a data-blind framework that constructs model-aligned forget sets by eliciting and formalizing the model's memorized knowledge. Across synthetic, multimodal, and real-world benchmarks, CONFS approaches Gold-standard performance on several metrics and achieves a competitive forgetting-utility balance, while preserving utility better than other data-blind forget-set constructions.
Read the full abstract

All authors Miso Kim, Georu Lee, Seungwon Jeong, Woojin Lee

Cryptography and Security

NeuroGraph: An AI Graph-Driven Neuro-Symbolic Framework for Explainable Threat Reasoning in Advanced Manufacturing

The growing complexity of cyber-physical attack surfaces in advanced manufacturing has made cyber threat intelligence analysis increasingly difficult. Although large language models and retrieval-augmented generation have improved CTI workflows, text-based approaches remain vulnerable to hallucinations and provide limited support for structured reasoning over interconnected threats. Graph-based RAG reduces some of these limitations, but existing approaches often lack ontology-consistent multi-hop reasoning and transparent evidence tracing across heterogeneous cybersecurity data. This paper proposes a graph-grounded neuro-symbolic framework that integrates ontology-aware symbolic query generation, knowledge graph retrieval, and neural language generation to support accurate and explainable threat analysis across information technology and operational technology environments. The framework adopts a dual-large language model architecture: the first model translates natural-language questions into executable Cypher queries for symbolic graph retrieval, while the second generates answers strictly from the retrieved graph evidence. Experimental evaluation using publicly available cyber threat intelligence benchmarks shows consistent improvements over the published baseline in reasoning accuracy, while also reducing hallucinations, strengthening multi-hop reasoning, and improving robustness to adversarial perturbations. Runtime and explainability analyses further demonstrate that the framework maintains interactive inference performance and exposes graph-grounded reasoning artifacts that allow analysts to inspect and verify each stage of the analysis. Overall, the results highlight the potential of graph-grounded neuro-symbolic reasoning as a scalable, interpretable, and reliable approach to cyber threat intelligence for next-generation Industry 5.0 environments.
Read the full abstract

All authors Padmeswari Nandiya, Ahmad Mohsin, Ahmed Ibrahim, Iqbal H. Sarker, Helge Janicke

Probability

Universal Beta Incidence Angles: Cauchy Rigidity and Infinite Arrangements

Let $U$ be Haar-uniform on $\mathbb S^{p-1}$, let $a_1,\ldots,a_k$ be arbitrary nonzero vectors, and let $w_1,\ldots,w_k$ be simplex weights. Define \[ g(U)=\sum_{j=1}^k w_j\frac{a_j}{a_j^\top U}, \qquad N(U)=\frac{g(U)}{\|g(U)\|}. \] We prove the universal incidence law \[ \{U^\top N(U)\}^2\sim\operatorname{Beta}\!\left(\frac12,\frac{p-1}{2}\right), \] independently of the number, arrangement, rank, or overcompleteness of the directions and of the weights. Thus a deterministic, generally non-Haar function of $U$ has the same squared-cosine law as an independent Haar direction. One proof combines a Herglotz–Cauchy boundary principle, a Haar-random two-plane with one common phase, and an exact Beta–Cauchy tangent-projection equivalence. A second proof specializes the positive-semidefinite Pillai–Meng identity. The planar structure leads to converses: plane-conditional Cauchy laws recover positivity, while for signed measures an exact phase-cancellation deficit equals twice the hidden negative mass. This yields local-to-global rigidity under a phase-norming condition strictly weaker than injectivity and an unconditional exclusion of negative atoms. The law extends to probability measures under almost-sure reciprocal integrability. We characterize this condition by an exact Wiener–Dini belt series, prove finite Shannon entropy to be the sharp universal criterion for countable weights, and give an entropy–geometry extension for clustered measures. Every compact carrier of zero one-dimensional Hausdorff measure is admissible, whereas a nonzero rectifiable arc component forces divergence on a set of positive Haar measure. In orthogonal coordinates, the theorem also gives a weight-free scaled $F$ law for Pearson divergence from a fixed simplex vector to a $\operatorname{Dirichlet}(1/2,\ldots,1/2)$ vector.
Read the full abstract

Representation Theory

A right pretriangulated category which is not right triangulated

Chen, Liu, Lu, and Zhang recently constructed a pretriangulated category with invertible suspension in which Verdier's octahedral axiom fails. We introduce a general enlargement construction for right pretriangulated categories and show that it preserves axioms (RTR1)-(RTR3), while failure of (RTR4) is detected by the forgetful functor. Applied to their type $A_5$ example, the construction yields a right pretriangulated category that is not right triangulated. In this example, the suspension is faithful but not essentially surjective.
Read the full abstract

Dynamical Systems

Behavior of the SRB Entropy Functional in Families of Hyperbolic Attractors and Expanding Maps

We review the current state of the study of the SRB entropy functional over open components of families of uniformly hyperbolic systems, including Anosov systems, hyperbolic attractors, expanding maps, and Markov transformations. We address problems concerning the functional's infimum, supremum, and local extrema; the gradient flow induced by the functional; and the functional's behavior near the boundary of open components.
Read the full abstract

Plasma Physics

Dynamic Alignment or Angular Persistence?

Dynamic alignment in magnetohydrodynamic turbulence is commonly inferred from the decrease of an amplitude-weighted average of the mutual angle between Elsässer increments toward smaller separations. That decrease, however, need not imply that the increments themselves rotate toward alignment: large-angle fluctuations can simply lose more amplitude than small-angle ones. We therefore study the joint evolution of increment amplitude and mutual angle using finite-step conditional transition probabilities. In forced incompressible full MHD and in balanced strong-guide-field reduced MHD, we find that, at fixed initial angle, large-amplitude Elsässer-increment pairs undergo smaller angular changes than small-amplitude pairs, including when they begin at large angles. We call this amplitude-dependent angular persistence. Normalized amplitude moments increase toward smaller separation, while stronger amplitude weighting produces progressively smaller angular averages and stronger scale dependence, linking apparent alignment to the intermittent large-amplitude tail. In RMHD, a source-state decomposition of the Politano-Pouquet third-order moment shows that initially large-angle, high-amplitude populations contribute with the sign associated with transfer toward smaller perpendicular scales despite their comparatively small angular changes. Time-resolved full-MHD data reproduce the same amplitude ordering, and the local Elsässer advective term closely tracks the conditional dependence of both angular and amplitude changes on the initial state. These results show that the conventional dynamic-alignment diagnostic reflects the joint statistical evolution of amplitude and angle and, by itself, is not evidence for a cascade-wide dynamical rotation toward alignment.
Read the full abstract

General Topology

Cardinality Bounds for Hausdorff SDL Spaces

We establish the cardinal inequality \(|X|\leq 2^{t(X)H\psi(X)}\) for every Hausdorff SDL space \(X\), where \(t(X)\) and \(H\psi(X)\) denote the tightness and the Hausdorff pseudocharacter of \(X\), respectively. Since both invariants are bounded by \(\chi(X)\), this yields \(|X|\leq 2^{\chi(X)}\). As a consequence, every first-countable Hausdorff strongly cellular–Lindelöf space has cardinality at most the continuum. These results answer Questions~2.1 and~2.2 of Bella and Spadaro. An intermediate result is a uniform bounded-decomposition property for SDL spaces; in particular, their strict quasi–Lindelöf number satisfies \(\sqL(X)\leq t(X)\).
Read the full abstract

Analysis of PDEs

Supercritical mean–field limit for magnetized Hamiltonian dynamic

The magnetized Vlasov–Poisson equation is a fundamental kinetic model for collisionless plasmas. We establish its quasi-neutral limit in two dimensions in the presence of a spatially inhomogeneous and time-dependent external magnetic field. In the same setting, we also establish the combined mean-field and quasi-neutral limit of the associated repulsive Coulomb particle system, thereby extending the results of \cite{han2021newton}. Both limits lead to the incompressible Euler equations with Lorentz forcing. A key structural feature is the pointwise skew-symmetry of the Lorentz operator, which produces exact cancellations in the modulated-energy estimates and is crucial for controlling the limiting dynamics. We further derive a closed vorticity formulation in which the sum of the fluid vorticity and the magnetic field is transported by the flow, coupled to an evolution equation for the spatial mean velocity. Finally, we establish global well-posedness of the resulting limiting system in the Lipschitz class.
Read the full abstract

Machine Learning

Topological Steering

With the rapid rise of large language models (LLMs), controlling undesirable model behaviors has become increasingly important. Existing behavioral control methods typically intervene directly in activation or feature space, but such approaches can be sensitive to outliers, distributional shifts, noise, and other local perturbations. Motivated by Topological Data Analysis (TDA), which captures global rather than purely local structure, we propose Topological Steering, a new framework for steering LLM behavior through the topological representation of activation spaces. Using persistence diagrams, our method connects activation-based steering with TDA and enables more robust behavioral control. We show that Topological Steering consistently modifies LLM behavior across multiple model families and model sizes.
Read the full abstract

Optimization and Control

The Minimum Q-Order of BFGS with Exact Line Search Is One

Powell asked whether the smoothness assumptions underlying classical superlinear convergence force a fixed power law between adjacent iterates of exact-line-search variable-metric methods. We answer this question negatively for BFGS: within the smooth strongly convex setting, the smallest possible adjacent-iterate Q-order is one, and this boundary is attained by a single nonterminating run. In every finite dimension at least two, and for any prescribed radius and Hessian tolerance, we construct an infinitely differentiable, globally strongly convex objective that equals the standard quadratic outside the corresponding ball and whose Hessian remains within the prescribed tolerance of the identity in operator norm. The objective has its unique minimizer at the origin and identity Hessian there. Exact-line-search BFGS, initialized with the identity matrix and started inside that ball, converges Q-superlinearly, yet no fixed power greater than one controls all sufficiently late adjacent errors.
Read the full abstract

Cryptography and Security

SoK: When Safe Agents Fail Together: The Security of Multi Agent LLM Systems

Safe agents can fail together. Multi-agent LLM systems (MAS) move information, state, decisions, and authority across principal boundaries, creating failures that local checks may miss. Without an execution-level view, a multi-agent setting can easily be mistaken for evidence of a genuinely multi-agent security effect. We thus systematize MAS security through an execution-centered analysis of 197 works, covering six interaction interfaces, four adversary positions, seven system-level risks, and eight recurring attack paths. We introduce an A-I-R framework that organizes attacks by adversary position, interaction interface, and resulting system-level risk, unifying otherwise fragmented attack mechanisms across MAS. We organize defenses through a five-part contract covering path target, observation, intervention, trust boundary, and recovery, and identify path closure and recovery as key challenges. We audit 44 evaluation and benchmark works and identify open challenges in isolating interaction effects, designing comparable and diagnostic metrics, supporting reuse across MAS designs, and evaluating open-system operation. Together, these findings motivate an interaction-aware view of MAS security: trace attacks end to end, test whether defenses close those paths, and evaluate system-level effects with appropriate counterfactuals.
Read the full abstract

All authors Rui Yang, Junjie Xu, Zhengyu Liu, Neil Fendley, Yang Hong, Ziyang Li, Yinzhi Cao

Materials Science

GW and Bethe-Salpeter Theory for Molecular Polaritons, Quasiparticles, and Excitons

The electron self-energy is central to quasiparticle theory, yet how an optical cavity enters it remains unclear. We address this question for a molecule in a single-mode cavity using the dipole-gauge Pauli-Fierz Hamiltonian and a coherent-state QED Hartree-Fock reference. The cavity enters through three channels: the static dipole self-energy (DSE) shift of reference orbital energies, direct DSE augmentation of the screened interaction, and the polariton pole carrying the bilinear electron-photon coupling. We benchmark QED-$GW$ ionization potentials (IPs) and electron affinities (EAs) against a cavity $\Delta$-method ladder from QED-HF to correlated wave-function methods, whose cavity-induced shifts agree within 1 meV where directly comparable. For closed-shell molecules with unbound anions, $GW$ systematically overestimates cavity-induced IP redshifts, whereas EA shifts are reproduced nearly quantitatively, although this does not imply comparable accuracy for absolute EAs. For ionic molecules with bound anions, this ordering reverses, consistent with published QED coupled-cluster results. Coupling and detuning scans show that the error is predominantly quadratic in $\lambda$ and DSE-driven rather than resonant. The spectral function develops a polariton-replica photoemission sideband with weight scaling as $\lambda^2$. In the static screened interaction used in the Bethe-Salpeter equation, bare-photon exchange cancels the matching DSE contribution to the direct interaction, while exchange and polariton-screening corrections remain. Their net effect on the lowest excitation is appreciable only for ammonia in the molecules studied. Exciton-binding energies involving unbound anions are strongly basis-dependent and should therefore be viewed as diagnostics of electron-hole interactions rather than basis-converged molecular quantities.
Read the full abstract

All authors Soohaeng Yoo Willow, Gi Beom Sim, Tae Hyeon Park, Tae In Kim, D. ChangMo Yang, Mikuláš Matoušek, Jiří Brabec, Libor Veis, Chang Woo Myung

Computer Vision

BrainDiff: Longitudinal Report Generation for Multimodal Brain MRI

Neuroradiologists rarely read a brain MRI in isolation, yet automated brain-MRI report generation has been built almost entirely for single studies. Temporal analysis has been explored on chest radiography and chest CT, but to our knowledge, longitudinal reporting for brain MRI, where interval change is often subtle and spatially distributed, remains unaddressed. We present BrainDiff, the first longitudinal vision-language system for brain MRI. BrainDiff outperforms both frontier general-purpose and single-study neuroimaging models on the same patient pairs. Moreover, BrainDiff retains 91% of internal RadGraph-XL entity+relation F1 (rg_er) on an external, cross-hospital cohort. Beyond the system, we contribute three analyses. First, we identify two independent grounding levers: a counterfactual objective with prior-report dropout, which increases measured image reliance by ~47%, and a staged curriculum. Together, these interventions raise image reliance 2.5-fold from the baseline. Second, we provide a factorial over prior-report availability and image identity, isolating a visual contribution of +0.0387 rg_er, which grows when the prior report is withheld. Third, a cheap change-decodability test for candidate backbones shows that interval change is decodable far more weakly than single-study pathology (0.60 vs. 0.77 AUROC). Code is publicly available at https://github.com/jhuldr/BrainDiff.
Read the full abstract

Algebraic Geometry

Bounded cohomology property on Jacobian elliptic surfaces with simplicial Mori cones

Let $X$ be a Jacobian elliptic surface with finite Mordell-Weil group and exactly one reducible fiber. We prove that if $\chi(\mathcal O_X)\ge \rho(X)$, then the Mori cone of $X$ is simplicial. As an application, assuming additionally $q(X)=0$, we show that $X$ satisfies the bounded cohomology property (BCP): there exists a constant $c_X>0$ such that $h^1(\mathcal O_X(C))\le c_X h^0(\mathcal O_X(C))$ for every curve $C$ on $X$. We also establish a necessary and sufficient condition for the BCP to hold on minimal smooth projective surfaces $Y$ with $\kappa(Y)\ge 1$, $q(Y)=0$, and rational polyhedral Mori cones.
Read the full abstract