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

Saturday 12 September

Rings and Algebras

Extending structures for the linear framework of Universal Algebra with applications to transposed Poisson algebras

We present a general study of extending structures in the linear framework of Universal Algebra, which unifies many existing results and contains applications to various Poisson type algebras including transposed Poisson algebras.

Nuclear Experiment

Hadron photoproduction experiments in LEPS2

In the LEPS2 facility constructed at SPring-8, hadron photoproduction experiments have been carried out by using a photon beam with high linear polarization in the tagged energy range of 1.3-2.4 GeV. The BGOegg and Solenoid experiments are alternately running with large-acceptance detector setups, which have been prepared by focusing on the measurement of gamma-rays and charged particles, respectively. These two projects have covered a wide range of hadron physics research, including the search for in-medium meson mass modification, the baryon resonance spectroscopy, the studies on exotic hadrons, and so on. This article reviews the physics programs, the obtained results, and the future prospects in the LEPS2 facility.
Read the full abstract

Artificial Intelligence

Convergent Emergence of In-Context Learning Across Modalities

Few-shot in-context learning (ICL), the capacity of a model to infer abstract patterns from input-output examples provided in its prompt and apply them to new inputs, has been extensively studied in large language models trained for next-token prediction on human text. Recently, few-shot ICL has been demonstrated in autoregressive genomic models as well. This raises a question: does ICL emerge broadly across domains, and if so, what common structure is shared? To address both, we develop a controlled cross-modality framework that instantiates the same task suite in a variety of modalities to test what we call the Convergent Emergence Hypothesis: the idea that few-shot ICL, when it emerges, shares a common cross-modality difficulty profile - i.e., tasks that benefit from ICL in one modality tend to benefit in others. We show that paired-mapping ICL emerges across six modalities (language, genome, integer sequences, time series, images, and proteins), surpasses controlled baselines, and has correlated per-task effects across five of them. Together, these results provide support for the Convergent Emergence Hypothesis in some modalities, but not all.
Read the full abstract

All authors Nathan Breslow, Seungwook Han, Daniel Hyunsoo Lee, Aayush Mishra, Anqi Liu, Daniel Khashabi

Computer Vision

CirrGuide: A Deep Cascaded Framework for Liver Cirrhosis Segmentation and Severity Classification from T2-Weighted MRI

We present CirrGuide, a deep cascaded framework for cirrhotic liver segmentation and severity classification. Cirrhosis causes progressive structural changes in the liver and can lead to serious clinical complications, making severity assessment important for disease monitoring and treatment planning. However, severity classification is challenging because imaging patterns are often subtle, spatially variable, and similar across adjacent stages. CirrGuide addresses this by explicitly linking localization with classification. A ResNet50 encoder with an Attention U-Net decoder first predicts a soft cirrhotic liver mask, which is then used as an anatomical prior in a ResNet50-based classification branch. This branch combines global multi-scale features with mask-guided attention-pooled regional features to classify Mild, Moderate, and Severe cirrhosis. On the official CirrMRI600+ T2-weighted (T2W) 2D split, CirrGuide achieves 89.83% Dice and 84.14% mIoU for segmentation, 69.58% accuracy and 61.55% macro F1-score for severity classification. Compared with segmentation-only, classification-only, and multi-task baselines, CirrGuide improves both localization and severity classification, demonstrating the benefit of using predicted cirrhotic liver masks as anatomical priors for cirrhosis analysis.
Read the full abstract

Analysis of PDEs

Stability Estimates for the Inverse Recovery of Drift and Diffusion Point Sources in Stochastic Parabolic Equations

This paper studies the simultaneous recovery of point-source locations and temporal strengths in both the drift and diffusion terms of a stochastic parabolic equation with Neumann boundary conditions, using only boundary observations on a nonempty portion of the boundary after the sources have become inactive. By separating the stochastic equation into its expectation and centered parts, the drift channel reduces to a deterministic source problem with scalar Laplace moments, while the diffusion channel is controlled by Itô's isometry, which preserves the full $L^2$-energy of the integrand. Under suitable nondegeneracy and separation assumptions, we establish Lipschitz stability for the location of a single source in either channel, logarithmic stability for the drift strength, and Lipschitz stability for the complete diffusion strength including its sign. For multiple sources, we obtain Lipschitz stability up to permutation for drift locations and weighted temporal moments in dimensions two and three, and for diffusion locations and strengths in dimensions one through three. The proof employs explicit adjoint probes, including complex-isotropic polynomial annihilators in dimensions two and three and spectral synthesis in one dimension, combined with boundary-to-source estimates derived from Green's identities. These results extend and improve upon existing deterministic stability theories by revealing the fundamentally different temporal information carried by stochastic integrals, a distinction that is further illustrated by numerical experiments.
Read the full abstract

Classical Analysis and ODEs

Failure of the linear $A_2$ bound for the strong maximal operator

We show that the strong maximal operator on ${\mathbb R}^2$ does not satisfy a linear weighted $L^2$ estimate in terms of the rectangular $A_2$ characteristic. More precisely, we construct weights with arbitrarily large characteristic for which the operator norm is bounded below by $[w]_{A_2^{\mathrm{str}}}\sqrt{\log [w]_{A_2^{\mathrm{str}}}}$. The proof is elementary. It uses an explicit two-parameter mass recurrence on a product of geometric interval partitions, together with a direct comparison of arbitrary rectangular averages with anchored averages.
Read the full abstract

Information Theory

Finite-Mask Gaussian-Process Reconstruction on a Periodic Sensor Ring: Mask-Geometry Dependence, Fourier-Mode Coupling, and Posterior Trace

We analyze how an arbitrary observation mask on a finite periodic ring of equally spaced sensors affects the posterior covariance, Fourier-mode coupling, and normalized posterior trace in Gaussian-process reconstruction. Under a rotationally stationary prior and homogeneous independent measurement noise, complete observation gives independent scalar posterior formulas for the Fourier modes. For an arbitrary mask, however, the matrix $Q_M=F D_MF^\ast$ is generally non-diagonal; its off-diagonal entries are finite Fourier components of the realized mask and couple modes in the posterior precision. Consequently, masks with the same unavailable-channel fraction can have different normalized posterior traces because their geometries differ. A dimensionless 64-channel synthetic benchmark illustrates this finite-matrix effect. A circumferential array of equally spaced wall-mounted microphones at a fixed axial station of a circular fan or compressor duct provides one concrete mechanical-engineering interpretation: failed, saturated, corrupted, or dropped-out channels form the observation mask. The analysis is a finite-dimensional reference calculation under the stated rotational-stationarity and common-noise assumptions, not a performance claim for a nonuniform or unequally instrumented operating duct.
Read the full abstract

Information Theory

GNN-Based Polarforming for Multi-User MISO Short-Packet URLLC under Imperfect CSI

This paper investigates polarization-aware transmission for multi-user multiple-input single-output (MU-MISO) short-packet ultra-reliable low-latency communications (URLLC) under imperfect channel state information (CSI). We consider a system in which the base station (BS) and users are equipped with polarization-reconfigurable antennas that enable adaptive polarization states through controllable polarization coefficients. A multi-objective optimization problem is formulated to jointly maximize the finite-blocklength (FBL) achievable sum rate and minimize the maximum decoding error probability (DEP), subject to transmit-power, latency, reliability, and discrete polarization-control constraints. The resulting multi-objective problem is scalarized using a normalized weighted-sum utility. To enable low-complexity online decision-making, a heterogeneous graph neural network (GNN) is developed to learn the joint mapping from estimated polarized CSI to digital beamforming and transmit/receive polarforming vectors (PFVs) while accounting for the system constraints. Numerical results demonstrate that the proposed GNN-based polarforming (PF) framework substantially improves the FBL sum rate while reducing the maximum DEP compared with conventional fixed-polarization schemes, particularly under channel depolarization and imperfect CSI. This highlights the potential of adaptive polarization control for reliable low-latency transmission.
Read the full abstract

All authors Zahra Mehrzad, Hamed Aghaei-Karkaj, Rahman Saadat Yeganeh, Kamran Ebrahimi, Mohammad Robat Mili, Symeon Chatzinotas, Ioannis Krikidis

Sound

StepAudio 3 Realtime Technical Report

Realtime spoken interaction demands deep reasoning, prompt responses, and fluid turn-taking. We present StepAudio 3 Realtime, an audio-language foundation model organized around a continuous listen-converse-think-act loop. Deep Perception captures rich acoustic cues to interpret user intent, while Seamless Duplex models synchronized audio streams to handle pauses, backchannels, and interruptions naturally. Crucially, we resolve the tension between deep deliberation and latency via Think-While-Speaking, executing private reasoning in parallel with spoken delivery. In reasoning mode, StepAudio 3 reaches a 73.0 macro average on StepAudioChat. With Think-While-Speaking, it achieves dialogue and reasoning performance comparable to dedicated reasoning models while speaking in real time. Furthermore, an integrated Voice Agent handles asynchronous tool execution without disrupting the dialogue flow. StepAudio 3 Realtime achieves top-tier performance across key dimensions: an exceptional 90.6 on the MMSU benchmark, 98.9 Overall on the Artificial Analysis Full-Duplex Bench, and a 56.0% macro task-success rate on $\tau$-Voice.
Read the full abstract

All authors Bin Lin, Bo Zhao, Boyang Zhang, Boyong Wu, Chao Yan, Chen Geng, Chen Wu, Cheng Yi, Chengli Feng, Chenglin Zhu, Chengting Feng, Chengyuan Yao, Daijiao Liu, DanNi Wan, Daxin Jiang, Dongjian Li, Dongqing Pang, Fei Tian, Feng Tian, Future Li, Gang Yu, Guanglong Yang, Haoyang Zhang, Hongyuan Wang, Jia Peng, Jiahao Song, Jialong Xue, Jiamin Fan, Jiangjie Zhen, Jianzheng Gao, Jincheng Wen, Jinghua Liang, Jinglan Gong, Jun Chen, Li Xie, Liang Zhao, Lifang Zhang, Lingli Ji, Lun Cai, Min Xu, Peilin Li, Peng Yang, Pengfei Tan, Qingjian Lin, Qinxin Du, Ruijie Xiong, Runze Li, Shenghua Hu, Shengqian Qin, Shi Qiu, Siqi Tu, Siyi Zhou, Tianjiao Deng, Wanying Lu, Weiming Niu, Wen Sun, WenWen Qu, Xiangyu Zhang, Xianwei Zhang, Xiaosu Su, Xing Chen, Xinyu Liu, Xuerui Yang, Yan Wu, Yang Li, Yang Yang, Yechang Huang, Yibo Zhu, Yifan Zhang, Yinuo Yan, Youjun Chen, Yu Fu, Yu Luo, Yu Zhou, Yujie Chen, Yumang Wang, Yunzhou Ju, Yuxiang Yang, Yuxin Li, Yuxin Zhang, Zekai Liu, Zengwei Yao, Zhaoxin Yuan, Zhenwei Mou, Zhiquan Zhang, Zhiyue Wu, Zichao Li, Zichao Zhou, Ziqi Ren, Zixuan Wang

Optimization and Control

Distributed Convex Second-Order Optimization for AC/DC Hybrid Distribution Systems within PROcess Orchestration Framework

Existing operation formulations for AC/DC distribution grid often oversimplify the interplay of AC/DC interconnections and VSC characteristics. Moreover, current distributed algorithms depend on gradient-based methods, which achieve only linear convergence rates and struggle to scale efficiently for large systems. This paper proposes a convex ALADIN variant that exploits second-order derivatives of convex subproblems, achieving locally quadratic convergence for distributed nonlinear but convex optimization problems. Then, this convex ALADIN is applied to a separable AC/DC OPF model for AC/DC hybrid distribution grid, explicitly incorporating complicated AC/DC interconnections and multiple droop-controlled VSCs while retaining computational traceability. To bridge theory with practice, we implement the distributed convex second-order optimization framework using the PROcess Orchestration Framework, a co-simulation platform that automates workflow design, model integration, and distributed execution via a user-friendly graphical interface, eliminating manual coding. Numerical results illustrate effectiveness of the proposed model.
Read the full abstract

All authors Xinliang Dai, Yuning Jiang, Junyi Zhai, Jianlei Liu, Thorsten Schlachter, Colin N. Jones, Xiao-Ping Zhang, Veit Hagenmeyer

Cryptography and Security

Confuse the Model, Control the Flow: Understanding and Mitigating Privacy Leakage from LLM Agents with Information Flow Control

Personal AI agents built on large language models (LLMs) are increasingly given access to a user's private data and communications in order to provide personalized assistance. This access creates a persistent privacy risk: the agent must decide whether a given sensitive information should be disclosed to a particular party. Existing defenses address this by making the agent's backend LLM more privacy-preserving through stronger system prompts, training, or explicit consent-checking procedures, but this approach has a structural challenge: whenever enforcement is a judgment the LLM makes over the same conversational context an adversary controls, the enforcement mechanism and the attack surface coincide. We demonstrate this against existing defenses with three new attacks that require only ordinary agent interaction and no prompt injection: Collaborative Workspace Lure reframes an extraction attempt as collaborative work; Semantic Obfuscation Attack induces disclosure through omission rather than through anything the agent writes; and Channel Decoupling Attack splits the extraction request and the disclosure across independent channels. All three achieve substantially higher leak rates than the attacks these defenses were originally designed to withstand. Guided by this observation, we present FLOWSEAL, a defense that enforces confidentiality through a tool-level interceptor outside the LLM's context, grounded in data provenance and an information-flow-control lattice with controlled declassification. Evaluated across three benchmarks, five prompt-based baselines, and eight attacks, including a real agent executing live tool calls through MCP, FLOWSEAL reduces leak rates to near zero (e.g., 52.2% to 0.5% against Collaborative Workspace Lure) while preserving task utility, regardless of the underlying LLM backend.
Read the full abstract

All authors Minsun Shim, Ramisha Raida Karim, Ruthwik Jakkula, Kaiwen Zhou, Xin Liu, Xin Eric Wang, Zhou Li

Optimization and Control

Autonomous Flows: Exact Finite Interpolation and Uniform Approximation Obstructions

In dimension at least two, a class of locally Lipschitz vector fields realizes every finite correspondence between distinct inputs and distinct targets at any prescribed positive time, provided that it is linear, its members generate global flows, and it approximates every smooth vector field of bounded support uniformly on bounded sets. The input and target sets may overlap. The proof constructs a smooth autonomous reference flow and finitely many localized correction fields, then uses uniform stability and Brouwer degree to obtain exact endpoints within the approximating class. The argument uses only uniform approximation of the vector fields; it does not require control of their derivatives. Applied to shallow ReLU vector fields, the result gives exact finite interpolation without time-dependent coefficients or additional state variables, together with bounds on width and normalized coefficient strength. In contrast, no continuous autonomous semiflow can exchange and compress two disjoint balls. Its time maps therefore fail to approximate all continuous maps uniformly on compact sets. The results distinguish exact interpolation at finitely many points from uniform control of neighborhoods.
Read the full abstract

Probability

Local uniform asymptotics for a non-standard risk model and interplay of insurance and financial risks stemming by systemic factors

In this paper we study local uniform, with respect to time, asymptotic expressions for the asymptotic behavior of the entrance probability of discounted aggregate claims to some rare sets, in a multivariate risk model with arbitrarily dependent insurance and financial risks. Our model is based on a multivariate version of a model, introduced by Guo (2022), and we consider that the logarithmic return process of the insurers investment portfolio is described by a jump-diffusion process. The dependence between the insurance and financial risks is implied by the dependence of the claim-vectors with the jumps of returns, and is arbitrary under some distributional conditions on the claim-vectors and the discounted claim-vectors. In opposite to previous papers on this topic, except the multidimensional extension, we consider that the model is driven by a common counting process, that is not necessarily renewal, the claim vectors are interdependent, and their distribution is not restricted to the class of (multivariate) regularly varying distributions. Under the condition that the claim vectors, and the discounted claim-vectors follows distributions from the class of multivariate consistently varying and positively decreasing distributions, and under some moment conditions on the jumps and the counting process, our main result shows the presence of multivariate linear single big jump principle of the discounted aggregate claims in this not necessarily Levy-Renewal environment. After restriction of the distributions to multivariate regular variation, we obtain more explicit expressions, under a slightly weaker moment condition on the jumps. We provide a corollary, in which the conditions of the main result are satisfied under a weak dependence structure and we find a more explicit asymptotic expression, using the technique of solution of the dependence.
Read the full abstract

Nuclear Theory

Near-thermal state and thermodynamic response of a QCD system in ultra-central heavy-ion collisions

We present a systematic framework to extract QCD thermodynamic properties at finite baryon density from ultra-central heavy-ion collisions, where the impact parameter is nearly zero and volume fluctuations are strongly suppressed. By mapping the measured multi-particle state of each event to an effective homogeneous fireball through the conservation of total energy, total entropy and net baryon number, a near-thermal state with variations is realized from event to event, which allows thermodynamic response relations to be tested. Using STAR Beam Energy Scan data on charged particle multiplicity and net proton fluctuations, we show that the thermalization condition is satisfied within uncertainties across collision energies, validating the interpretation of ultra-central events as small deviations from a thermally equilibrated state. We then generalize the response relations to finite baryon chemical potential, expressing the response coefficients in terms of the speed of sound and susceptibilities. Our results provide a baseline for using ultra-central collisions to probe the QCD equation of state and phase structure, including the search for the critical endpoint.
Read the full abstract

Differential Geometry

Diffusion and reaction in the quasi-spherical equation: mean curvature deformations for fill-Ins

We study the diffusion and reaction effects of Bartnik's quasi-spherical equation to deform boundary mean curvature in fill-in problems with scalar curvature bounded below. The diffusion effect yields an explicit $L^p$-to-$L^\infty$ estimate for $\partial_tu=u^2\Delta u$, thereby extending the known upper bound for the minimum boundary mean curvature of fill-ins to a quantitative upper bound for its harmonic mean. For spin fill-ins, this bound is explicit and involves only coarse intrinsic boundary data. By introducing an absorbing reaction term, we also construct a deformation that transforms any nonnegative initial mean curvature into a terminal mean curvature with a uniform positive lower bound. For Gromov's conjecture on total mean curvature, this reduces the $H\geq 0$ case to Theorem A of Frenck, Hanke, and Hirsch \cite{FHH}, which assumes $H\geq\kappa>0$. This covers the case of non-spin boundaries, complementing their result for spin boundaries (Theorem B) for this conjecture.
Read the full abstract

Differential Geometry

The curl-Yamabe problem

We introduce and study a Yamabe-type variational problem associated with the curl operator on middle-degree forms on a closed oriented Riemannian manifold $(M^n,g)$ with $n\equiv3\pmod4$. The corresponding curl–Yamabe constant is defined by minimizing a conformally invariant, gauge-invariant quotient built from $\|{\rm curl}\,\alpha\|_{\frac{2n}{n+1}}$ and $\int_M\langle{\rm curl}\,\alpha,\alpha\rangle$, and its Euler–Lagrange equation is the critical curl–Yamabe equation ${\rm curl}\,\alpha=\frac{n+1}{2}|\alpha|^{\frac{2}{n-1}}\alpha$. Using sharp curl–Sobolev inequalities on the sphere and an Aubin-type cut-off construction, we prove that $0<Y_{\rm curl}(M,[g])\le Y_{\rm curl}(\mathbb{S}^n)$ for every such manifold, and that the infimum is attained whenever $Y_{\rm curl}(M,[g])<Y_{\rm curl}(\mathbb{S}^n)$. Moreover, for $n>3$ we establish the strict inequality for manifolds that are not locally conformally flat, via a test-form expansion detecting the Weyl tensor, and deduce existence of a minimizer solving the curl–Yamabe equation.
Read the full abstract

Computation and Language

Unlocking the Unsolvable: Teacher-Guided Curriculum for Data-Efficient RLVR

Reinforcement Learning with Verifiable Rewards (RLVR) has shown remarkable success in improving the mathematical reasoning of large language models. Yet problems beyond the model's current capability, where rollouts uniformly fail and no learning signal is produced, are structurally wasted despite marking the most informative training frontier. We show that these otherwise-inert problems can be unlocked via teacher-guided curriculum learning: partial reasoning traces from a stronger model create a graded difficulty landscape, and a backward-chaining curriculum progressively withdraws guidance until the model solves problems unaided. Training on only 128 unsolvable problems matches or exceeds GRPO trained on a full 2,000-problem corpus (~16x data efficiency) on the nine-benchmark average for both base models, while substantially expanding the reasoning boundary measured by pass@k at large k. Furthermore, we identify a distribution-shift cost that is particularly acute in the unsolvable-only regime and propose Monotone Frontier Curriculum (MFC), a method that monotonically drives training toward unguided solving, consistently outperforming existing curriculum methods.
Read the full abstract

Statistical Mechanics

Local pair correlations and network geometry govern collective oscillations in nonreciprocal Ising networks

Nonreciprocal many-body dynamics can develop a swap phase characterized by spontaneous global oscillations far from equilibrium. To determine how local nonreciprocal interactions predict global oscillations and how broadly this prediction applies, we compare mean-field theory, independent-node theory, and nearest-neighbor spin-coupling theory for a two-spin nonreciprocal Ising model on networks of fixed coordination number (\(z=4\)). Nearest-neighbor spin-coupling theory retains nine independent joint edge probabilities. Monte Carlo benchmarks show that it predicts the oscillation amplitude, angular momentum, and period on edge-swapped networks with a 2.1% aggregate mean absolute relative error. We then extend the square lattice to degree-preserving edge-swapped networks and find sharply different behavior. With increasing system size, the oscillation amplitude and angular momentum decay strongly on the periodic square lattice but remain nearly size independent on edge-swapped networks. These results show that identical local parameters do not determine the macroscopic phase. The contrasting finite-size trends identify network geometry as a key determinant of collective oscillations at fixed local interaction parameters.
Read the full abstract

Artificial Intelligence

Synthetic Data in Marketing Research: How to Evaluate and When to Trust

Debate over synthetic data in marketing research has polarized between claims that large language models (LLMs) make human respondents obsolete and calls to avoid them entirely. We argue that both positions obscure the more useful question: not whether synthetic respondents work, but when. Building on Brand, Israeli, and Ngwe (2026), we make three contributions. First, we distinguish three types of synthetic data (ungrounded LLM responses, segment-level personas, and individual-level digital twins) and map each to the decisions it can support. Second, we develop a taxonomy of four families of accuracy measures and suggest that the wide range of reported twin accuracy, from near-perfect to near-chance, largely reflects differences in what is being measured rather than in method quality. Aggregate measures often perform well even when little information is supplied to the LLM, and can mask a complete absence of respondent-level differentiation. Third, we introduce the forgotten question problem, in which a question is omitted from a fielded study, as a setting for twin-based augmentation of existing data. We propose an ex-ante answerability diagnostic that requires no ground truth: the R^2 of a random forest predicting twin outputs from the data used to construct the twins. Across 108 attitude questions from a nationally representative survey (N = 3,063), screening at R^2 above 0.7 raises the mean twin-human individual-level correlation by 15% and reduces the share of poorly answered questions from 25.9% to 4.3%. Embedding similarity and experienced-researcher judgment provide correlated but weaker screens.
Read the full abstract

High Energy Physics (Theory)

A new product entropy

We propose a new product entropy, defined as the Rényi (or von Neumann) entropy of a normalized product operator constructed from two density matrices. We establish a duality showing that the SVD entanglement entropy of a subsystem for two pure states is exactly equivalent to the product entropy of the complementary subsystem. This connection provides both a transparent physical interpretation in terms of the spectral diversity of the subsystem state product and a computationally efficient route that bypasses the reduced transition matrix. For low-lying eigenstates, we derive analytical expressions for the subsystem product entropy between the ground state and primary excitations in two-dimensional conformal field theories, explicitly verified against the critical Ising chain. In quantum quench dynamics, the quasiparticle picture yields time evolution in the scaling limit: following a global quench, the subsystem product entropy exhibits distinct sequences of thermalization and revivals, whereas under a local operator quench, it develops characteristic plateaus whose constant values are determined by the inserted operator. Extensive numerical calculations on the critical Ising chain confirm the analytical predictions with excellent accuracy.
Read the full abstract

All authors Jiaju Zhang, Zhuo-Yu Xian, René Meyer, Song He, Bin Chen

Information Retrieval

P$^3$Rec: Distilling Prior–Posterior Preference Reasoning for LLM-based Recommendation

Large language models (LLMs) exhibit strong semantic understanding and preference reasoning capabilities, offering new opportunities for user modeling in recommender systems. Existing LLM-as-Enhancer methods typically distill LLM-derived preference knowledge into lightweight recommenders to avoid costly online LLM inference. However, they often construct distillation knowledge from only one perspective. Prior preference captures users' stable and consistent interests but provides limited guidance for the current decision, whereas posterior preference reveals target-relevant fine-grained interests but may rely excessively on target clues. To address these limitations, we propose P$^3$Rec, a framework that jointly extracts and internalizes complementary prior and posterior preference reasoning knowledge. Specifically, P$^3$Rec first derives target-agnostic prior preferences and target-conditioned posterior preferences from the user side, while further extracting item-centric preference representations from item semantics and predecessor interactions. It then progressively internalizes prior and posterior knowledge into behavioral representations through prior preference absorption and posterior-guided preference distillation. Since the resulting comprehensive preference representation may not always provide an equally decisive retrieval direction, P$^3$Rec further characterizes historical interest dispersion with interest entropy and adaptively calibrates the user representation before contrastive retrieval optimization. In this way, P$^3$Rec achieves more complete preference reasoning while preserving efficient recommendation. Extensive experiments on multiple public datasets demonstrate its effectiveness.
Read the full abstract

Differential Geometry

Overdetermined equations and support functions on the hyperbolic and de Sitter planes

We study overdetermined equations on the hyperbolic and de Sitter planes by means of the support-function representation of zero mean curvature surfaces in Lorentz–Minkowski three-space. On the hyperbolic plane, solutions of $\Delta u-2u=0$ give rise to branched spacelike maximal surfaces. We prove that, on a bounded simply connected domain, nontrivial constant Dirichlet and Neumann data force the domain to be a geodesic disk, provided that the associated support quadric is nonlightlike; moreover, the solution is a multiple of the hyperbolic cosine of the distance from the center. On the de Sitter plane, the corresponding equation is the Klein–Gordon equation $\Box u+2u=0$, and its solutions generate timelike minimal surfaces wherever the support tensor is nondegenerate. We identify the support quadric and the constant-angle condition determined by constant Cauchy data, prove that local rigidity fails along every analytic noncharacteristic curve, and recover rotational symmetry from constant data on a global Cauchy circle. Thus the same support-function formalism reveals a sharp transition from elliptic rigidity to hyperbolic flexibility when the signature changes.
Read the full abstract

Computer Vision

Mind2Cloud: EEG-to-Point Cloud Generation with Two-Granularity Diffusion Decoding

Reconstructing 3D objects from brain signals offers a promising avenue for understanding human visual cognition. While prior work has shown initial success using EEG signals for 3D reconstruction, existing methods typically employ a uniform diffusion decoder, overlooking the evolving semantic granularity of both EEG representations and the diffusion denoising process. In this paper, we propose Mind2Cloud, a novel EEG-to-point-cloud generation framework based on two-granularity diffusion decoding. The core of Mind2Cloud is a time-aware decoder that integrates a global Transformer branch and a local Point-Voxel CNN (PVCNN) branch across diffusion timesteps through a learnable fusion mask. Specifically, Transformer layers are incorporated into the early upsampling stages to capture global object structure under high uncertainty, while PVCNN modules are used in later stages to refine local geometric details. Inspired by the hierarchical nature of EEG-based visual representations, this design dynamically adapts its spatial granularity in accordance with the coarse-to-fine trajectory of diffusion denoising. We further introduce an adversarial refinement module to enhance geometric realism and semantic consistency. Extensive experiments on the EEG-3D dataset across all 12 subjects demonstrate that Mind2Cloud outperforms prior work in both geometric accuracy and semantic alignment, setting a new benchmark for EEG-to-point-cloud generation. Our source code is available at https://github.com/duasoi/Mind2Cloud.
Read the full abstract

Systems and Control

Diffusion-Based Multiple-Shooting Indirect Optimal Control for Fuel-Optimal Spacecraft Trajectory Generation

Diffusion-based generative models (DMs) have found applications in control problems, and in particular robotics, where the DMs enable exploration of possible control solutions. A critical shortcoming of these applications is that they have lacked optimality guarantees. This is a problem for their potential use in fuel-optimal spacecraft trajectories that are characterized with long time-horizons and bang-bang profiles. Alternatively, indirect optimal control methods ensure explicit satisfaction of necessary conditions, but are highly sensitive to the initial costate estimation needed to solve the resulting Hamiltonian boundary-value problems (HBVPs). To alleviate this sensitivity and enlarge the convergence domain of HBVPs, advanced indirect methods have been developed that use smoothing approaches and continuation. We propose a diffusion-based multiple shooting indirect control method that combines the exploration capability of DMs with indirect method to generate fuel-optimal spacecraft trajectories. We benchmark our method against an advanced indirect method on a fuel-optimal Earth-Mars low-thrust transfer problem, showing higher convergence robustness than the advanced indirect method that is based on random costate initialization. Code and visualizations are available at https://saeidtafazzol.github.io/Diffusion_Indirect_Control/.
Read the full abstract

Analysis of PDEs

Well-posedness for a class of $n\times n$ hyperbolic systems and shock stability for the viscous approximation

We establish the global well-posedness of weak solutions to the Cauchy problem for a broad class of multi-dimensional $n\times n$ Keyfitz-Kranzer type systems with homogeneous flux. Our proof relies on a novel viscous approximation that yields the necessary compactness estimates. By exploiting the specific structure of this proposed approximation, we derive a priori uniform $L^{\infty}$ bounds and prove the $L^1_{loc}$ precompactness of the sequence of approximate solutions. This framework allows us to rigorously justify the vanishing viscosity limit. Furthermore, under suitable assumptions on the initial data, we employ the relative entropy method to analyze the $L^2$-time decay of large perturbations of the viscous shock, up to a dynamical shift.Evan
Read the full abstract

Quantum Physics

Noise-aware derivative feedback of a harmonic oscillator under quantum-limited position measurement

We study measurement-based feedback control of a damped harmonic oscillator, motivated by optomechanical and interferometric position measurements, in which feedback is synthesized from a displacement measurement. For a band-limited derivative controller, the loop shapes the mechanical susceptibility and reinjects measurement noise, creating a tradeoff between stabilization and noise amplification. We present a compact classical formulation that isolates this tradeoff in the closed-loop displacement spectrum and identifies the parameters governing resonance suppression versus noise-driven actuation. We then extend the same topology to a quantum-limited position detector, enforcing the imprecision-backaction constraint and introducing finite measurement bandwidth that regularizes high-frequency noise reinjection and adds phase lag in the feedback path. In the high-$Q$ regime we obtain an analytic design rule for the optimal feedback gain at fixed controller and measurement bandwidths and compare it with full-spectrum calculations. The comparison shows that a high mechanical quality factor alone does not guarantee quantitative agreement: the accuracy of the near-resonant approximation depends strongly on the controller and measurement bandwidths. Because finite measurement bandwidth changes both the magnitude and phase of the feedback loop, the analysis separates the near-resonant damping contribution from imprecision-noise reinjection and shows that positive near-resonant feedback damping requires the product of the controller cutoff and measurement bandwidth to exceed the square of the mechanical resonance frequency. Finally, we present a dimensionless map of the gain-optimized high-$Q$ occupation and compare its predictions with full-spectrum optimization. All analytical gains evaluated in this map satisfy the full closed-loop stability criterion for these parameters.
Read the full abstract

Disordered Systems and Neural Networks

Sequential Retrieval in Dense Associative Memory: Asymptotic Dynamics and Storage Capacity

We study the retrieval dynamics of an $n$-body asymmetric dense associative memory model, in which sequential retrieval is implemented by shifting one pattern index in the higher-order Hebbian interaction. The model exhibits sequential retrieval of the stored patterns, and the retrieval state corresponds to a stable limit-cycle attractor. The storage capacity is defined as the maximum loading rate for which this limit cycle remains stable. Using generating functional analysis, we derive the dynamical equations describing the sequential retrieval state. The generating functional analysis reveals that the retarded self-interaction term vanishes in the asymmetric model, and the resulting overlap dynamics is reproduced by an Amari-Maginu-type signal-to-noise analysis. Also, we find that for the interaction order $n\ge 3$, the normalized storage capacity decreases monotonically with increasing interaction order, in contrast to symmetric Modern Hopfield models.
Read the full abstract

Multimedia

A Low-Latency Interactive System for Real-Time Video Understanding Based on VLMs

Vision-language models are extending video understanding from offline clip analysis to continuous interactive streaming, but most research still emphasizes model capability rather than deployable low-latency interaction. This paper presents a unified edge-cloud system for real-time video VLM applications. Lightweight phone, smart glasses, PC, and pseudo-replay clients publish video and speech to a server runtime that provides shared ASR/TTS, session orchestration, backend adaptation, response delivery, and archive-backed measurement. The system integrates six representative video VLM backends with streaming or interaction-oriented capabilities and evaluates them across backend runtime, media transport, client-observed latency, and interaction behavior. With suitable backend selection and the WebRTC path, the tested system reaches approximately 0.9 to 1.0 s to first VLM text and 1.3 to 1.5 s to first non-silent TTS audio, while exposing backend adaptation costs and differences in real-time interaction behavior.
Read the full abstract

All authors Punan Dai, Jun Xu, Bingcong Lu, Zhengxue Cheng, Hongwei Hu, Ronghua Wu, Li Song

Nuclear Theory

Dileptons in heavy-ion collisions

In this review we give an overview about dileptons as probes for the properties of the strongly interacting hot and dense matter created in heavy-ion collisions at various beam energies. As penetrating probes they leave the fireball unaffected from final-state interactions and thus provide a space-time-evolution weighted average of the in-medium properties of hot and dense QCD matter.
Read the full abstract

Robotics

What Makes an Efficient VLA? Navigating Action-Head Design, Scaling, and Latency

Vision-Language-Action (VLA) models combine a pretrained vision encoder, a language backbone, and an action head, but their relative contribution has not been established under controlled, latency-paired conditions. We fix the backbone families (SigLIP2 and Qwen2.5) and the training pipeline, sweep action-head design and module scale, and pair each configuration with measured on-device latency. The study yields three findings. First, action-head performance is governed primarily by initialization rather than decoder architecture, loss, or inference budget: copying the last transformer layers of the language backbone into the head is the single largest lever, at no latency cost, and the only axis that helps at every module scale. Alignment also explains the other axes: flow matching and a heavier decoder pay off only while the head is misaligned and reverse once it is aligned, and extra inference passes give no measurable benefit; expressiveness appears to substitute for missing alignment. We read this as representation transfer: the aligned head keeps attending to the instruction's object nouns and stays close to the backbone in weight space rather than relearning to act from scratch. Because we reach alignment only through initialization, we offer this as the account that best organizes the measurements, not a demonstrated cause, and name the control that would settle it. Second, capacity pays only after alignment: the aligned action head is the highest-return module to scale. Third, those returns diminish sharply near the size today's $\pi$-series VLAs already use, so further growth buys little in-domain accuracy for its latency. These specify EffVLA, a compact model matching the strongest open-source VLAs on standard LIBERO, leading on most LIBERO-Plus perturbation axes at lower latency, and transferring to a real SO-ARM101 arm with the recipe unchanged.
Read the full abstract

All authors Luoyang Sun, Guoyang Xia, Fengfa Li, Lei Ren, Xinyu Cui, Haifeng Zhang, Fangxiang Feng, Kaike Zhang, Kun Zhan, Yan Xie, Jun Wang, Cheng Deng