SearcharxivSearch

arXiv subjects

Bin Wu

Publications and source records attributed to Bin Wu.

At least 19 recordsLinked to original sources

Staying on the Attack Path: Structured State for Long-Horizon Automated Penetration Testing

Large language model (LLM) based agents are increasingly applied to cybersecurity tasks such as vulnerability discovery and automated penetration testing. On long-horizon security tasks, however, such agents remain limited by context forgetting and intent drift: early critical facts and causal reasoning chains are lost over extended interactions, and the agent falls into aimless, repetitive exploration. This paper proposes Intentest, an intent-graph-guided automated penetration testing agent that externalizes long-horizon state from the LLM's context window onto a persistent fact-intent directed acyclic graph (DAG), thereby substantially reducing invalid transitions. We evaluate Intentest on automated penetration testing of web applications, a representative long-tail task in cybersecurity. In the DAG, verified network states are stored as immutable fact nodes, and exploration directions are constrained as intent edges bounded by predecessor facts. The system adopts a three-layer architecture, in which the fact-intent mapping layer maintains the global state, the task scheduling and allocation layer ensures execution stability through two-phase degradation recovery and multi-dimensional adaptive load balancing, and the intent retrieval and prediction layer provides tactical priors through a top-down five-stage filtering algorithm. On a benchmark of real CTF challenges covering more than ten vulnerability types across three difficulty levels, Intentest achieves an overall success rate of 88.2% and a success rate of 75.0% on hard tasks, improving over the baseline by approximately 44 and 50 percentage points. Ablation experiments further show that the intent retrieval and prediction reduce the average number of rounds on successful medium and hard tasks by about 33% and 48%, respectively, without changing the set of solvable tasks.

cs.CR

Expected Shortfall Factor Models: Common Tail Losses and Expected Returns

We develop an expected shortfall factor model (ESFM) to estimate and price common variation in the severity of lower-tail losses in large panels of asset returns. Mean factor models describe common variation in average returns, while quantile factor models describe common movements in tail thresholds. ESFM instead captures common variation in the average severity of losses below those thresholds. The model combines observed risk exposures with latent common factors. We estimate ESFM using an orthogonalized two-step procedure under which first-stage quantile estimation error has no first-order effect on the ES coefficient estimates. We establish nonasymptotic error bounds for the ES coefficients, a finite-sample Gaussian approximation, and consistent selection of the number of latent factors. Applied to a large panel of equities, ESFM uncovers common factors that react sharply to market stress and contain information not captured by mean and quantile factors. Average returns increase across portfolios sorted on ESFM exposure; high-minus-low portfolios earn annualized returns of 8.0%--11.7% and Fama--French five-factor alphas of 10.3%--15.0%. These spreads remain positive and statistically significant after conditioning separately and jointly on mean- and quantile-factor exposures. Tail-by-tail spanning tests show that ESFM factors retain significant alphas after controlling for standard traded factors and the corresponding mean and quantile factors. Adding ESFM to these benchmark factor sets increases the maximum attainable Sharpe ratio. These findings identify common loss severity as a distinct and priced dimension of downside risk.

econ.EM

Covariant linear response theory for a photon gas in curved spacetime

To overcome the failure of the conventional non-relativistic description of statistics in strong gravitational fields, we develop a covariant theory for a photon gas in curved spacetime, starting from the Boltzmann equation and employing the relaxation time approximation. The transport coefficients are computed up to second order, which are not a massless limit of the massive-particle results due to the fundamentally different phase-space geometry of null particles. At second order, the gravitational field renders the coefficients tensor-valued and induces transverse fluxes, analogous to the Hall effect. Using the first-order results, we derive relativistic generalizations of Fick's and Fourier's laws and obtain the radiation diffusion equation for spherically symmetric accretion disks. This provides a covariant description of radiative transport in strong gravitational fields for high-energy astrophysical applications.

gr-qc

Inverse Source Problem for a Time-Fractional Diffusion-Wave Equation with a Singular Inverse-Square Potential

This paper investigates an inverse source problem for a time-fractional diffusion-wave equation with a singular inverse-square potential. The source term is assumed to consist of a known temporal factor and an unknown spatial component, which is to be recovered from terminal-state measurements. The well-posedness and regularity of the forward problem are established within an appropriate energy framework by exploiting Hardy-type inequalities and the spectral properties of the associated singular elliptic operator. The terminal observation operator is then shown to be compact, and uniqueness of the spatial source is established under a suitable nondegeneracy condition on the temporal factor. To stabilize the resulting ill-posed inverse problem, a Tikhonov regularization approach is introduced. The gradient of the regularized functional is derived through an adjoint problem involving a right-sided fractional derivative, leading to an adjoint-based conjugate gradient method with an exact line search for the numerical reconstruction of the unknown source. Numerical experiments are conducted on both one-and two-dimensional spatial domains, using both exact and noisy terminal data, to demonstrate the effectiveness and stability of the proposed source reconstruction method.

math.NA

Preference Flow Matching with Spectral Factorization for Micro-video Recommendation

Micro-video recommendation aims to infer user preferences from historical interactions and multimodal video content, thereby identifying the next video of interest. However, prevailing methods compress frame sequences into a single holistic representation, entangling the stable visual semantics and the evolving dynamics that jointly shape user preferences. Meanwhile, diffusion- and flow matching-based recommenders condition their generation process solely on coarse behavioral context, leaving its internal temporal structure outside preference formation. We therefore propose PrismRec, a Preference Flow Matching framework with Spectral Factorization for Micro-video Recommendation. Analogous to a prism that disperses white light into its constituent spectrum, PrismRec devises Spectral Semantic Factorization (SSF) to derive complementary static semantic and dynamic factors from frame-level representations via a prior-guided learnable frequency mask in the temporal frequency domain. Then, it proposes Context-Calibrated Preference Matching (CPM) to weigh them with each user's specific sensitivity and inject the calibrated context as a structured condition to steer the matching trajectory toward the target representation, making video content as an intrinsic driver of preference formation rather than auxiliary side information. Experiments on four datasets from two platforms show that PrismRec surpasses the SOTA baseline by up to 22.65%, with the lowest inference cost and peak memory among the compared methods.

cs.IR

Geometric formulation for the relativistic kinetic theory of photons

We provide a geometric foundation for the kinetic theory of photons. Although the induced metric $\hat h$ on the light cone bundle $\Gamma_0^+$ is degenerate, which causes the corresponding volume element to vanish, we can still use a method similar to the Hodge dual to construct a volume element $\eta_{\Gamma_0^+}$ for the light cone bundle. Based on this geometric structure $(\Gamma^+_0,\eta_{\Gamma_0^+},\hat h)$, we establish the fully covariant Boltzmann equation for photons. More importantly, the volume element and the induced metric are linked in a nontrivial way, which allows the physical distributions to be defined consistently. This yields the corresponding hydrodynamic quantities and their divergences, which take the same form as in the case of massive particles.

gr-qc

Poetic Heritage for Culturally Grounded Emotional Support: An Interaction Design Framework and Its Multimodal Agentic Instantiation

Digital systems increasingly mediate emotional support, yet their interactions often remain culturally generic. Accordingly, we examine how a poetic tradition can be operationalized as a culturally grounded interactive medium and how generative AI can support such engagement. The resulting interaction design framework translates staged literature-based support and tradition-specific poetic aesthetics into guidance for digital system design. Poemithy instantiates the framework as a multimodal, LLM-enabled multi-agent system for guided reflection through classical Chinese poetry. A controlled between-subjects study with 50 participants compared text-only and multimodal versions. Both conditions showed medium-to-large within-session improvements in affect, anxiety, and emotion regulation, while between-condition tests detected no differences in these changes. Among secondary post-session user-experience measures, the clearest observed differences favored multimodality in perceived attunement, perceived task success, and engagement; usability and hedonic quality were descriptively higher, while workload did not differ detectably. Post-only cultural ratings were descriptively favorable in both conditions for cultural identification, poetry-engagement and dissemination intentions, and perceived cultural enrichment. Together, the findings suggest that culturally grounded content and structured guidance should anchor system design, while multimodal presentation may strengthen resonance and engagement. More broadly, the work shows how generative AI can mediate engagement with poetic heritage in culturally grounded emotional-support interactions.

cs.HC

Stochastic Liouville-transport theory of light-atom interaction noise in thermal atomic vapors

Atom-light interaction noise can limit thermal-vapor sensing. Existing theories often treat internal-state dynamics, finite-mode atomic motion, and stochastic renewal separately, obscuring their coupled contributions to measured noise. We develop a general stochastic Liouville-transport theory, tested against polarization-resolved resonant Cs D$_2$ spectra. Joint experiment-theory analysis identifies atom-light noise below approximately 100 kHz as transit-dominated. Ballistic motion through the finite Gaussian mode modulates both the coupling-weighted effective atom number and trajectory-dependent Rabi coupling, producing predominantly common-mode noise. Boundary renewal introduces atoms with independently sampled ground-state sublevels, generating differential population fluctuations with opposite effects on the circular channels. Under an applied longitudinal magnetic field, experiment and theory show the same qualitative nonmonotonic change in common-mode suppression, supporting Zeeman redistribution of the channel responses. The framework can analyze noise in other thermal-atom sensors, including Rydberg-atom electric-field measurements.

quant-ph

Mitigating Context Interference for Reliable and Efficient Search Agents

Recent research empowers Large Language Models (LLMs) as multi-turn search agents to iteratively retrieve and generate outputs until complex tasks are solved. However, the contexts of multi-turn search agents are lengthy and complex. For example, the retrieved set of documents in each turn would inevitably introduce irrelevant information that distracts LLMs, referring to \textit{context interference}, potentially hindering the reliability and efficiency of search agents. Therefore, we conduct a systematic study on context interference in multi-turn search agents, focusing on investigating i) which parts of the context of search agents will contribute to the context interference, ii) how to refine the contexts of search agents to mitigate the interference, and iii) can incorporating context refinement into search agent training yield further improvements. We reveal that interference primarily arises from the latest retrieved documents. Based on the explored findings, we then introduce a distill-based context refiner to dynamically mitigate context interference for multi-turn search agents. Finally, we validate that incorporating context refinement into RL training pipelines of search agents can significantly enhance both reliability and efficiency. This study highlights the importance of mitigating context interference of search agents, inspiring a novel paradigm of ``refine context and then generate'' for AI agents.

cs.CL

Particle Production, Equilibration, and Quantum Recurrences from Classical Fields

We investigate particle production from classical fields, a phenomenon central to the pre-equilibrium dynamics of relativistic heavy-ion collisions and the reheating epoch of the early Universe. Using lattice $\lambda\phi^4$ theory as a proof of principle, we show that this problem is naturally amenable to quantum computation, providing a first-principles framework for nonequilibrium quantum-field dynamics beyond existing approximations. We perform simulations on small spatial lattices, exhausting our available classical computational resources while maintaining a direct mapping to future quantum-computing implementations. We find that particle production is accompanied by equilibration of observables, including the field expectation value, occupation-number distribution, and pressure. The observed equilibration persists for timescales several times longer than the initial equilibration time before the observables resume oscillatory behavior associated with quantum Poincar\'e recurrences. Our results establish a route toward first-principles studies of equilibration in nonequilibrium quantum field theory and provide insight into the search for the smallest possible locally equilibrated quark-gluon systems at hadron colliders.

hep-ph

Domain Decoupling Attack: Exploiting the Validation Gap Between Protective DNS and Shared Edge Routing

Network attackers often conceal malicious communication within legitimate Internet traffic. Existing CDN-based evasion techniques rely on SNI--Host inconsistency, insufficient domain ownership verification, or provider-specific routing rewrites, which limit their applicability in modern CDN environments. We identify a validation gap in DNS-based authorization, where permission derived from an allowed domain applies to a shared IP and can be reused to reach another tenant in both CDN and non-CDN shared-hosting environments. This paper presents the Domain Decoupling Attack (DDA), which resolves an allowed domain to obtain permission for a shared edge IP and subsequently connects to the same address while presenting the hidden domain consistently in both TLS SNI and HTTP Host. Measurements of 1,069,048 domains across six continents produce 18,025,068 successful probes and identify exposure rates of 95.8% overall, 99.26% for CDN domains, 92.75% for non-CDN domains, and 97.7% for non-CDN cross-tenant IPs, while laboratory experiments reveal a structural limitation of DNS-bound access control on shared addresses. These results clarify the security risks of DNS-derived IP authorization and support the evaluation and improvement of access-control mechanisms in CDN and non-CDN shared-hosting environments.

cs.CR

IMFuse: Instance-Aware Multi-Layer Fusion for LLM-Enhanced Sequential Recommendation

Recent advancements in Large Language Models (LLMs) have significantly enhanced sequential recommendation by encoding rich item textual information into semantic representations. However, existing methods typically rely on the final-layer hidden states of LLMs, overlooking potentially useful semantic signals encoded in other layers. Through empirical analysis, we reveal the limitations of this practice: final-layer representations often suffer from dimensional collapse, whereas intermediate layers preserve complementary, coarse-to-fine semantic knowledge. Furthermore, we observe that different items exhibit heterogeneous layer-wise representation evolution, making a uniform layer selection sub-optimal. To bridge this gap, we propose IMFuse, an instance-aware multi-layer fusion strategy designed for LLM-enhanced recommendation. Instead of relying on a single layer, IMFuse adaptively aggregates multi-layer semantic information by learning global dimension-wise layer preferences to capture general semantic contributions. To address item-level heterogeneity, IMFuse introduces an instance-aware expert modulation mechanism that dynamically adjusts these global preferences, generating personalized, item-specific semantic representations. Extensive experiments across four real-world datasets demonstrate the effectiveness of IMFuse. It consistently outperforms state-of-the-art baselines with an average relative improvement of 6.72%, while introducing limited parameter and computational overhead.

cs.IR

Aggregation of Evolutionary Game Dynamics on Large-Scale Weighted Networks

Networked evolutionary games, which integrate network topology and game dynamics, serve as a powerful framework for complex systems. Evolutionary games on large-scale networks, however, have been analytically challenging due to the curse of dimensionality arising from large network size. This paper proposes an aggregation method based on backward equivalence, such that agents within the same equivalence class behave exactly the same over time. We give a necessary and sufficient condition under which the weighted networked evolutionary games (WNEG) are reduced to an equivalent system with low dimension. The aggregation is shown to reduce the computational burden ranging from strategy consensus, strategy optimization, controllability, to optimal control of the WNEG. Examples are provided. Our work opens an avenue to solve the curse of dimensionality on networked evolutionary game systems with mathematical rigor.

eess.SY

The semileptonic decays of $\mathcal{B}_{Q_{1}Q_{2}}(\frac{1}{2}^{+})\rightarrow\mathcal{B}_{Q_{1}}^{*}(\frac{3}{2}^{+})$ in QCD sum rules

In the framework of QCD sum rules, we systematically analyze the weak transition process $\mathcal{B}_{Q_{1}Q_{2}}(\frac{1}{2}^{+})\rightarrow\mathcal{B}_{Q_{1}}^{*}(\frac{3}{2}^{+})$. When doing the operator product expansion in the QCD side, we consider the contributions of perturbative part and vacuum condensate terms up to dimension 6. In the phenomenological side, we eliminate the interferences of the low spin states and negative parity states by employing 16 different dirac structures. As an application, these form factors are finally used to analyze the semileptonic decays of $\mathcal{B}_{Q_{1}Q_{2}}(\frac{1}{2}^{+})\rightarrow\mathcal{B}_{Q_{1}}^{*}(\frac{3}{2}^{+})l\nu$, where these decays are driven by the transition processes $c\rightarrow d/s+l^{+}+\nu_{l}$ and $b\rightarrow u+l^{-}+\overline{\nu}_{l}$. The predicted physical quantities include not only the partial widths, ratios of $\Gamma_{L}/\Gamma_{T}$ and the branching fractions, but also some observables such as the forward-backward asymmetry parameter $A_{FB}^{l}$ of lepton, the $P_z^{F}$ component of the polarization vector for daughter baryon and the longitudinal polarization of the lepton $P_z^{l}$. We hope all of these theoretical predictions about the weak decays will be helpful for studying the properties of doubly heavy baryons in experiments in the future.

hep-ph

From Centrality Discounts to Centrality Premia: Interoperability and Platform Competition in Social Networks

We study how interoperability reshapes competitive price discrimination when consumers are embedded in a social network. Two differentiated platforms set personalized prices; consumers benefit from neighbors' consumption of the same platform and, under interoperability, of the rival. Equilibrium prices obtain in closed form for arbitrary networks and contain a network-position term, proportional to Katz-Bonacich centrality, whose sign is determined by whether interoperability exceeds product substitutability. Below this threshold, platforms contest central consumers and grant centrality discounts; above it, central consumers become gateways to a shared cross-platform network and pay premia; at the threshold, prices are independent of network position. Interoperability softens price competition, can make platforms favor denser consumer networks, and reverses which side of the market gains from price discrimination.

econ.TH

Azimuthal momentum isotropization in the Quark-Gluon Plasma thermalization

Azimuthal anisotropies coming from the initial state of a heavy-ion collision have been historically disregarded in the study of thermalization because they are expected to be rapidly washed out due to final-state interactions. However, they may be important when one attempts to describe azimuthal correlations observed in the collisions of small systems. In this work, we study how these initial anisotropies relax in the context of the Boltzmann Equation in Diffusion Approximation (BEDA). We find a clear hierarchy in the relaxation time of the anisotropies in terms of each harmonic coefficient. We also explore the evolution of the $p_T$-dependent harmonic coefficients in time, finding a shift in the initial peak towards higher momenta that mimics the experimental data when we perform a phenomenologically motivated simulation.

hep-ph

Danus: Orchestrating Mathematical Reasoning Agents with Fact-Graph Memory

Recent LLM-based mathematical reasoning agents have begun to tackle research-level problems and, in several cases, have contributed to the resolution of open problems. However, scaling and orchestrating such agents effectively remains challenging, due to the difficulty of coordinating parallel proof search while keeping intermediate claims organized and reliable. In this paper, we propose Danus, an orchestration system for research-level mathematical reasoning centered on a shared fact graph as a global memory-management mechanism. Danus consists of a main agent that performs planning and coordination, multiple worker agents that carry out proof search in parallel, and a stateless verifier that checks proposed mathematical claims before they are admitted into the fact graph. Each verified fact is stored together with its proof and logical dependencies, allowing the system to build long arguments incrementally while keeping the shared proof state organized. The main agent periodically summarizes the evolving proof state, redirects workers across promising directions, and supports interaction with human mathematicians through progress reports. We evaluate Danus through six research-level case studies in algebraic geometry, singularity theory, and combinatorics, illustrating how the fact-graph memory mechanism enables Danus to construct long, detailed mathematical proofs. Our results suggest that fact-graph-based orchestration provides an effective route toward scaling mathematical reasoning agents for long-horizon research problems. Danus is open source at https://github.com/frenzymath/Danus.

cs.AI

Positive and Negative Determinant Strategies in Repeated Games with Behavior-Value Inconsistency

Direct reciprocity, based on the repeated interactions, is a fundamental mechanism to promote cooperation. Zero-determinant (ZD) strategies have opened an avenue for unilateral payoff control. However, previous studies neglect internal costs provided what agents do differ from what agents think, which is crucial for decision making of intelligent agents. Motivated by this, we establish a game theoretical framework by assuming that an individual pays the internal cost if the behavior is inconsistent with the internal thought. We prove that ZD strategy does not exist if the cost via behavior-value inconsistency is present. Instead, we find a new class of repeated strategies that enforce a unilateral payoff control, which is termed as positive/negative determinant strategy. The found strategy allows an individual to enforce an affine combination of two individuals' average payoffs above/below zero. Consequently, a focal individual is able to unilaterally control the opponent's payoff below a given value via negative determinant strategy, and a focal individual is able to get more payoff than the opponent via positive determinant strategy. We also find that the control ability of positive/negative determinant strategies is better off than that of ZD strategies. Our work highlights the importance of inconsistency between the behavior and value on payoff control, which is typically absent in classic ZD strategies.

cs.GT