arXiv subjects

Chao Guo

Publications and source records attributed to Chao Guo.

At least 19 recordsLinked to original sources

arXiv2026

Constructing the Field of Philanthropic and Nonprofit Studies: Evidence from Citation Networks

Philanthropic and nonprofit studies (PNPS) has grown rapidly as an interdisciplinary field, yet its intellectual structure and boundaries remain only partially visible. This study maps the field by combining journal- and keyword-based retrieval with citation network analysis, natural language processing, and large language model-assisted cluster labeling. Using 60,917 Web of Science articles, we identify major topical communities, examine their structural connections, and assess how well mainstream PNPS journals represent the broader landscape of related scholarship. The results show that PNPS is a loosely connected field dominated by three distinct "power centers": nonprofit organizations, social movements, and voluntary action. The analysis also reveals a broader disciplinary footprint than commonly recognized, extending beyond the social sciences and humanities into areas such as biomedicine and technology. These findings clarify the organization of PNPS and highlight opportunities for stronger integration across research domains.

cs.SI↗

arXiv2026

Autonomous discovery of traffic laws with AI traffic scientists

Universal traffic laws describe recurrent patterns in congestion, mobility and driving behavior across cities, providing a scientific basis for transportation planning, management and control. Their discovery, however, remains expert-driven, requiring candidate regularities to be identified from heterogeneous observational evidence or validated through intervention experiments. Although autonomous artificial intelligence (AI) systems have advanced scientific discovery in controlled laboratory settings, extending them to complex transportation domains remains a challenge. Here we present TrafficSci, an agentic AI system that formulates traffic-law discovery as an iterative, auditable workflow integrating evidence scoping, critic-judge hypothesis induction, and observational-interventional validation. Across four case studies spanning population, network, control and trajectory scales, TrafficSci autonomously rediscovers three established traffic laws and identifies an unreported intrinsic temporal memory scale in urban driving behavior, statistically consistent across eight cities and two trajectory datasets. TrafficSci provides a route for extending AI-driven scientific discovery from controlled domains to complex urban systems.

cs.AI↗

arXiv2026

Steering Emotional Dynamics for Art Therapy: Controllable Narrative Script Generation through Hierarchically Guided LLM Agents

Art therapy plays a vital role in emotional healing, in which narrative creation acts as the primary vehicle for emotional expression. Given the inherently dynamic nature of emotions during healing, narratives with finely controlled emotional fluctuations enable individuals to safely project inner conflicts and achieve emotional catharsis. Recently, with the rapid development of Large Language Models (LLMs), automated narrative generation technology has provided a new pathway to support such artistic designs. However, while existing methods can produce fluent texts, they struggle to generate narratives that adhere to specified affective trajectories, failing to meet the demands of emotion-oriented psychological healing. To address these issues, this paper proposes EC-Script, an LLM agent-based framework that enables hierarchical control of the affective trajectory in narrative generation for emotional healing. To ensure that the generated narratives strictly follow the given emotional patterns, EC-Script establishes overall narrative direction through Emotion-Trajectory Planning, propels scene-level plot development with Character-Driven Scene Generation, and regulates local emotional changes of characters via Emotion-Controlled Script Writing. Ultimately, it outputs scene-by-scene script content that remains highly consistent with the preset affective trajectory. Experimental results demonstrate that EC-Script significantly outperforms baseline methods in affective trajectory adherence, exhibiting excellent and reliable emotional controllability, thereby providing effective technical support for AI-assisted emotional healing scenarios.

cs.AI↗

arXiv2026

Planning Beyond Text: Graph-based Reasoning for Complex Narrative Generation

While LLMs demonstrate remarkable fluency in narrative generation, existing methods struggle to maintain global narrative coherence, contextual logical consistency, and smooth character development, often producing monotonous scripts with structural fractures. To this end, we introduce PLOTTER, a framework that performs narrative planning on structural graph representations instead of the direct sequential text representations used in existing work. Specifically, PLOTTER executes the Evaluate-Plan-Revise cycle on the event graph and character graph. By diagnosing and repairing issues of the graph topology under rigorous logical constraints, the model optimizes the causality and narrative skeleton before complete context generation. Experiments demonstrate that PLOTTER significantly outperforms representative baselines across diverse narrative scenarios. These findings verify that planning narratives on structural graph representations-rather than directly on text-is crucial to enhance the long context reasoning of LLMs in complex narrative generation.

cs.CL↗

arXiv2025

DyLoC: A Dual-Layer Architecture for Secure and Trainable Quantum Machine Learning Under Polynomial-DLA constraint

Variational quantum circuits face a critical trade-off between privacy and trainability. High expressivity required for robust privacy induces exponentially large dynamical Lie algebras. This structure inevitably leads to barren plateaus. Conversely, trainable models restricted to polynomial-sized algebras remain transparent to algebraic attacks. To resolve this impasse, DyLoC is proposed. This dual-layer architecture employs an orthogonal decoupling strategy. Trainability is anchored to a polynomial-DLA ansatz while privacy is externalized to the input and output interfaces. Specifically, Truncated Chebyshev Graph Encoding (TCGE) is employed to thwart snapshot inversion. Dynamic Local Scrambling (DLS) is utilized to obfuscate gradients. Experiments demonstrate that DyLoC maintains baseline-level convergence with a final loss of 0.186. It outperforms the baseline by increasing the gradient reconstruction error by 13 orders of magnitude. Furthermore, snapshot inversion attacks are blocked when the reconstruction mean squared error exceeds 2.0. These results confirm that DyLoC effectively establishes a verifiable pathway for secure and trainable quantum machine learning.

quant-ph↗

arXiv2025

Disaggregated Architectures and the Redesign of Data Center Ecosystems: Scheduling, Pooling, and Infrastructure Trade-offs

Hardware disaggregation seeks to transform Data Center (DC) resources from traditional server fleets into unified resource pools. Despite existing challenges that may hinder its full realization, significant progress has been made in both industry and academia. In this article, we provide an overview of the motivations and recent advancements in hardware disaggregation. We further discuss the research challenges and opportunities associated with disaggregated architectures, focusing on aspects that have received limited attention. We argue that hardware disaggregation has the potential to reshape the entire DC ecosystem, impacting application design, resource scheduling, hardware configuration, cooling, and power system optimization. Additionally, we present a numerical study to illustrate several key aspects of these challenges.

cs.AR↗

arXiv2025

Plug-and-Play Dramaturge: A Divide-and-Conquer Approach for Iterative Narrative Script Refinement via Collaborative LLM Agents

Although LLMs have been widely adopted for creative content generation, a single-pass process often struggles to produce high-quality long narratives. How to effectively revise and improve long narrative scripts like scriptwriters remains a significant challenge, as it demands a comprehensive understanding of the entire context to identify global structural issues and local detailed flaws, as well as coordinating revisions at multiple granularities and locations. Direct modifications by LLMs typically introduce inconsistencies between local edits and the overall narrative requirements. To address these issues, we propose Dramaturge, a task and feature oriented divide-and-conquer approach powered by hierarchical multiple LLM agents. It consists of a Global Review stage to grasp the overall storyline and structural issues, a Scene-level Review stage to pinpoint detailed scene and sentence flaws, and a Hierarchical Coordinated Revision stage that coordinates and integrates structural and detailed improvements throughout the script. The top-down task flow ensures that high-level strategies guide local modifications, maintaining contextual consistency. The review and revision workflow follows a coarse-to-fine iterative process, continuing through multiple rounds until no further substantive improvements can be made. Comprehensive experiments show that Dramaturge significantly outperforms all baselines in terms of script-level overall quality and scene-level details. Our approach is plug-and-play and can be easily integrated into existing methods to improve the generated scripts.

cs.AI↗

arXiv2025

Triadic Novelty: A Structural Typology of Science Innovation

Scientific progress depends on novelty, but current evaluation systems often conflate novelty with recognition, favoring work that aligns with existing paradigms over ideas that challenge them. We introduce a theory-driven framework that conceptualizes novelty as a structural process rather than a single scalar outcome. Drawing on network science and theories of scientific discovery, we develop a triadic typology of novelty: Pioneers introduce new topics, Mavericks recombine distant areas of knowledge, and Vanguards reinforce weak but emerging connections. We apply this framework to philanthropic and nonprofit studies, an interdisciplinary and evolving field well suited to examining how novelty is recognized before evaluation norms are fully stabilized. Results show that novelty is not uniformly rewarded: Pioneer contributions are often weakly recognized unless later taken up, Maverick contributions receive consistent recognition, and Vanguard contributions exhibit diminishing returns as ideas become established. By distinguishing how novelty enters and evolves within knowledge structures, the framework offers a citation-independent approach with implications for research evaluation, funding design, and science and innovation policy.

physics.soc-ph↗

arXiv2025

Breaking Bad Molecules: Are MLLMs Ready for Structure-Level Molecular Detoxification?

Toxicity remains a leading cause of early-stage drug development failure. Despite advances in molecular design and property prediction, the task of molecular toxicity repair, generating structurally valid molecular alternatives with reduced toxicity, has not yet been systematically defined or benchmarked. To fill this gap, we introduce ToxiMol, the first benchmark task for general-purpose Multimodal Large Language Models (MLLMs) focused on molecular toxicity repair. We construct a standardized dataset covering 11 primary tasks and 660 representative toxic molecules spanning diverse mechanisms and granularities. We design a prompt annotation pipeline with mechanism-aware and task-adaptive capabilities, informed by expert toxicological knowledge. In parallel, we propose an automated evaluation framework, ToxiEval, which integrates toxicity endpoint prediction, synthetic accessibility, drug-likeness, and structural similarity into a high-throughput evaluation chain for repair success. We systematically assess 43 mainstream general-purpose MLLMs and conduct multiple ablation studies to analyze key issues, including evaluation metrics, candidate diversity, and failure attribution. Experimental results show that although current MLLMs still face significant challenges on this task, they begin to demonstrate promising capabilities in toxicity understanding, semantic constraint adherence, and structure-aware editing.

cs.AI↗

arXiv2025

Stop Summation: Min-Form Credit Assignment Is All Process Reward Model Needs for Reasoning

Process reward models (PRMs) have proven effective for test-time scaling of Large Language Models (LLMs) on challenging reasoning tasks. However, reward hacking issues with PRMs limit their successful application in reinforcement fine-tuning. In this paper, we identify the main cause of PRM-induced reward hacking: the canonical summation-form credit assignment in reinforcement learning (RL), which defines the value as cumulative gamma-decayed future rewards, easily induces LLMs to hack steps with high rewards. To address this, we propose PURE: Process sUpervised Reinforcement lEarning. The key innovation of PURE is a min-form credit assignment that formulates the value function as the minimum of future rewards. This method significantly alleviates reward hacking by limiting the value function range and distributing advantages more reasonably. Through extensive experiments on 3 base models, we show that PRM-based approaches enabling min-form credit assignment achieve comparable reasoning performance to verifiable reward-based methods within only 30% steps. In contrast, the canonical sum-form credit assignment collapses training even at the beginning! Additionally, when we supplement PRM-based fine-tuning with just 10% verifiable rewards, we further alleviate reward hacking and produce the best fine-tuned model based on Qwen2.5-Math-7B in our experiments, achieving 82.5% accuracy on AMC23 and 53.3% average accuracy across 5 benchmarks. Moreover, we summarize the observed reward hacking cases and analyze the causes of training collapse. We release our code and model weights at https://github.com/CJReinforce/PURE.

cs.AI↗

arXiv2024

Through the Curved Cover: Synthesizing Cover Aberrated Scenes with Refractive Field

Recent extended reality headsets and field robots have adopted covers to protect the front-facing cameras from environmental hazards and falls. The surface irregularities on the cover can lead to optical aberrations like blurring and non-parametric distortions. Novel view synthesis methods like NeRF and 3D Gaussian Splatting are ill-equipped to synthesize from sequences with optical aberrations. To address this challenge, we introduce SynthCover to enable novel view synthesis through protective covers for downstream extended reality applications. SynthCover employs a Refractive Field that estimates the cover's geometry, enabling precise analytical calculation of refracted rays. Experiments on synthetic and real-world scenes demonstrate our method's ability to accurately model scenes viewed through protective covers, achieving a significant improvement in rendering quality compared to prior methods. We also show that the model can adjust well to various cover geometries with synthetic sequences captured with covers of different surface curvatures. To motivate further studies on this problem, we provide the benchmarked dataset containing real and synthetic walkable scenes captured with protective cover optical aberrations.

cs.CV↗

arXiv2023

NeRF-VINS: A Real-time Neural Radiance Field Map-based Visual-Inertial Navigation System

Achieving efficient and consistent localization a prior map remains challenging in robotics. Conventional keyframe-based approaches often suffers from sub-optimal viewpoints due to limited field of view (FOV) and/or constrained motion, thus degrading the localization performance. To address this issue, we design a real-time tightly-coupled Neural Radiance Fields (NeRF)-aided visual-inertial navigation system (VINS). In particular, by effectively leveraging the NeRF's potential to synthesize novel views, the proposed NeRF-VINS overcomes the limitations of traditional keyframe-based maps (with limited views) and optimally fuses IMU, monocular images, and synthetically rendered images within an efficient filter-based framework. This tightly-coupled fusion enables efficient 3D motion tracking with bounded errors. We extensively compare the proposed NeRF-VINS against the state-of-the-art methods that use prior map information and demonstrate its ability to perform real-time localization, at over 10 Hz, on a resource-constrained Jetson AGX Orin embedded platform.

cs.RO↗

arXiv2023

The comparison of optical variability of broad-line Seyfert 1 and narrow-line Seyfert 1 galaxies from the view of Pan-STARRS

By means of the data sets of the Panoramic Survey Telescope and Rapid Response System (Pan-STARRS), we investigate the relationship between the variability amplitude and luminosity at 5100 \AA, black hole mass, Eddington ratio, $ R_{\rm Fe \, II}$ ( the ratio of the flux of Fe II line within 4435-4685 \AA ~to the broad proportion of $\rm H\beta$ line) as well as $ R_{5007}$ (the ratio of the flux [O III] line to the total $\rm H\beta$ line) of the broad line Seyfert 1 (BLS1) and narrow line Seyfert 1 (NLS1) galaxies sample in g,r,i,z and y bands, respectively. We also analyze the similarities and differences of the variability characteristics between the BLS1 galaxies and NLS1 galaxies. The results are listed as follows. (1). The cumulative probability distribution of the variability amplitude shows that NLS1 galaxies are lower than that in BLS1 galaxies. (2). We analyze the dependence of the variability amplitude with the luminosity at 5100 \AA, black hole mass, Eddington ratio, $ R_{\rm Fe \,II}$ and $ R_{5007}$, respectively. We find significantly negative correlations between the variability amplitude and Eddington ratio, insignificant correlations with the luminosity at 5100 \AA. The results also show significantly positive correlations with the black hole mass and $ R_{5007}$, significantly negative correlations with $ R_{\rm Fe\, II}$ which are consistent with Rakshit and Stalin(2017) in low redshift bins (z<0.4) and Ai et al.(2010). (3). The relationship between the variability amplitude and the radio loudness is investigated for 155 BLS1 galaxies and 188 NLS1 galaxies. No significant correlations are found in our results.

astro-ph.HE↗

arXiv2023

A Hamiltonian Approach to Barrier Option Pricing Under Vasicek Model

In this paper, we study option pricing under Vasicek Model by a Hamiltonian approach. Since the interest rate changes with time, we split the time to maturity into infinite steps, and the matrix element during each step could be calculated by quantum mechanics methods. Using completeness condition, the pricing kernel and the integral expression of option price could also be derived. Numerical results of option prices as functions of underlying asset price, floating rate and regression rate are also shown.

q-fin.PR↗

arXiv2023

Path Integral Method for Pricing Proportional Step Double-Barrier Option with Time Dependent Parameters

Path integral method in quantum mechanics provides a new thinking for barrier option pricing. For proportional double-barrier step (PDBS) options, the option price changing process is analogous to a particle moving in a finite symmetric square potential well. We have derived the pricing kernel of PDBS options with time dependent interest rate and volatility. Numerical results of option price as a function of underlying asset price are shown as well. Path integral method can be easily generalized to the pricing of PDBS options with curved boundaries.

q-fin.PR↗

arXiv2022

A Hamiltonian Approach to Floating Barrier Option Pricing

Hamiltonian approach in quantum mechanics provides a new thinking for barrier option pricing. For proportional floating barrier step options, the option price changing process is similar to the one dimensional trapezoid potential barrier scattering problem in quantum mechanics; for floating double-barrier step options, the option price changing process is analogous to a particle moving in a finite symmetric square potential well. Using Hamiltonian methodology, the analytical expressions of pricing kernel and option price could be derived. Numerical results of option price as a function of underlying price, floating rate, interest rate and exercise price are shown, which are consistent with the results given by mathematical calculations.

q-fin.PR↗

arXiv2022

A multi view multi stage and multi window framework for pulmonary artery segmentation from CT scans

This is the technical report of the 9th place in the final result of PARSE2022 Challenge. We solve the segmentation problem of the pulmonary artery by using a two-stage method based on a 3D CNN network. The coarse model is used to locate the ROI, and the fine model is used to refine the segmentation result. In addition, in order to improve the segmentation performance, we adopt multi-view and multi-window level method, at the same time we employ a fine-tune strategy to mitigate the impact of inconsistent labeling.

eess.IV↗

arXiv2021

Path Integral Method for Proportional Step and Proportional Double-Barrier Step Option Pricing

Path integral method in quantum mechanics provides a new thinking for barrier option pricing. For proportional step options, the option price changing process is similar to the one dimensional trapezoid potential barrier scattering problem in quantum mechanics; for double-barrier step options, the option price changing process is analogous to a particle moving in a finite symmetric square potential well. Using path integral method, the analytical expressions of pricing kernel and option price could be derived. Numerical results of option price as a function of underlying price, potential and exercise price are shown, which are consistent with the results given by mathematical method.

q-fin.PR↗