Xiaobo Chen

Xiaobo Chen

Auto-generated profile, based on publicly available information

Xiaobo Chen


Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 October 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
GZGenliang Zhu
Genliang Zhu
ZWZiyuan Wang
Ziyuan Wang
XCXiaobo Chen
Xiaobo Chen
CWChu Wang
Chu Wang
A successful business API call can trigger additional effects through partly visible rules. We study active acquisition of task-relevant cascade evidence through authorized configuration reads and isolated probes under rule drift. A finite contract distinguishes scoped observations, conditional family predictions, and unresolved effects. Twelve controls are evaluated on 34,560 paired trials and 69,120 stages with independent Python reconstruction. A separate native-engine study uses Node-RED and Drools, 16 authored topology streams, three successive requests, six strict acquisition controls, and two model planners, yielding 576 episodes. A fixed configuration-read control leaves an unread hazard unresolved. Decision-loss acquisition attains 31/96 joint goal-and-safe outcomes across the two planners, compared with 18/96 for fixed reads and 30/96 for decision-region acquisition. Its generated impact bounds contain the observed signed effects in 14/96 episodes, demonstrating that task completion and preview correctness are distinct endpoints. Reusing a static public prediction table reduces its evaluation counter by two-thirds while observations about the current configuration are renewed at each request. Native event replay preserves multiplicity, failures, and out-of-family conditions. The contribution is an executable acquisition-and-renewal contract with measured quality, resource, and impact-coverage trade-offs across finite and native rule systems.

16 October 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
GZGenliang Zhu
Genliang Zhu
ZWZiyuan Wang
Ziyuan Wang
XCXiaobo Chen
Xiaobo Chen
CWChu Wang
Chu Wang
Tool retrieval can identify a relevant operation while omitting the prerequisites or completion evidence required to finish a task. We formulate version-conditioned executable support and implement dependency-guided discovery with source-bound index reuse. A finite study covers 72 contexts, six methods, and two exposure budgets, yielding 864 old/new records. A separate source-derived study executes public ticket, trading, retail, and airline tool bodies with Qwen3-32B and Llama-3.1-70B-Instruct: 24 held-out roots, seven canonical methods, 336 lifecycles, and 1,008 assigned model calls. Full rediscovery and simple caching with incremental completion expose support for every feasible revised root. Their revised goal completions are 19/24 versus 18/24 for Qwen and 6/24 for both under Llama. Caching reduces logical indexing input by 35.93%, while actual planner input tokens are nearly equal or higher. A 256-lifecycle CPU supplement exercises mixed-scope catalogs above the 24-tool exposure cap and retains equal feasible-task completion across the two methods. Independent replay checks source-bound exposure, native state transitions, finite infeasibility, and lifecycle cost. The results distinguish capability discovery from successful model execution and identify the separate costs of current-candidate reuse and finite support certification.

21 October 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
XCXiaobo Chen
Xiaobo Chen
GZGenliang Zhu
Genliang Zhu
ZWZiyuan Wang
Ziyuan Wang
CWChu Wang
Chu Wang
Payroll-fraud screening requires finding hidden employee–payee links while distinguishing suspicious relationships from legitimate ones. We formulate this problem as inductive link prediction and entity ranking on synthetic human-resources and enterprise resource planning (HR/ERP) graphs, with unseen organizations and a matched benign twin for every planted case. An original study on 24 held-out organizations and a prospectively frozen extension compare analyst rules, explicit path features and graph neural networks (GNNs). A tuned gradient-boosted model on chained-join features achieved the highest overall link average precision (AP; 0.823), above the GraIL-style GNN (0.663); its 4-hop AP was 0.646 versus 0.272. Thus, the observed multi-hop gain is not specific to GNNs. On a new synthetic cohort with 2.0% positive entities, chained-join boosting again led (AP 0.798); the relational entity GNN also exceeded record-aware rules (0.707 versus 0.504). At a 2% review budget, their precision was 0.695 versus 0.602. Under 40% failed identifier joins, the entity GNN ranked above chained-join boosting (AP 0.712 versus 0.683, descriptively). Structure-only auditing exposed a shortcut in the initial generator; matched twins reduced the audited twin-pool AUROC to 0.493–0.514. These results separate multi-hop candidate discovery, record-based discrimination and review prioritization within an explicit synthetic evaluation design. Code and data are available from the authors on request.

17 November 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
XCXiaobo Chen
Xiaobo Chen
GZGenliang Zhu
Genliang Zhu
ZWZiyuan Wang
Ziyuan Wang
CWChu Wang
Chu Wang
Across three independent root sets, no handoff-interface effect in parallel multi-agent LLM workflows replicated, and a single-context agent was never dominated on quality and cost. When an orchestrator splits a request across subagents and merges their results, conditional requirements, whose trigger, scope or exception depends on another branch, can be lost at the handoff. In a five-layer preregistered study of more than 4,000 workflows (Qwen3-8B, Llama-3.1-8B, Qwen3.6-35B-A3B, a GPT-5.6-luna subset and a track adapted from TravelPlanner), scored exactly against a finite specification with no LLM judge, we vary whether subagents see the full request or an orchestrator brief, whether handoffs are summaries or structured records, and whether the merger rereads the request. Two measurement artifacts produced apparent effects: the frontier model's effects came from an orchestrator that answered instead of delegating, and a 17-point structured-over-summary effect was measured while the summaries were empty. The single-context agent was the cheapest arm in every family. Rereading at merge helped Qwen3-8B on the original roots (+5.6 points, Holm p = 0.028) but not on fresh roots (+2.4, p = 0.44), where visibility and handoff form reversed direction. A preregistered random-effects meta-analysis found no significant pooled interface effect; visibility and handoff form were heterogeneous (I² = 86% and 87%), and rereading was the only consistent effect (+3.9 points, I² = 0%), with an interval that included zero. Which handoff interface looks better depends more on the task distribution than on the interface. All materials are available from the authors on request.

14 October 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
GZGenliang Zhu
Genliang Zhu
XCXiaobo Chen
Xiaobo Chen
ZWZiyuan Wang
Ziyuan Wang
CWChu Wang
Chu Wang
A tool timeout can leave an agent uncertain whether an external action failed, committed or remains in flight. We formulate task-level recovery over approved obligations, provider capabilities and states compatible with public evidence. A shared admissibility check handles key expiry, authorization timing, dependencies and residual effects; a terminal certificate separates actual goal satisfaction from publicly supported safe completion. The known-model implementation combines standard observation-contingent planning with a separately implemented effect-history adjudicator. In a finite study of 37 assignments, planning and three active controls each certify 28 completions; four saved synthetic fee units incur additional computation. A preregistered assignment-held-out comparison then evaluates planning advice against evidence prompting with two local model bundles. Across 58 paired units in 19 previously developed task families, advice certifies 30 completions versus 9, a 36.2-percentage-point difference (exact family sign-flip 𝑝 = 0.0078), using 272 proposals versus 399. All 116 trajectories pass independent replay. Both models exhibit a positive completion difference. This identifies the value of the evaluated advice interface under a common shield, not a separate advantage of multi-step search over rule advice. Unknown and handoff outcomes remain explicit, with no arbitrary third-party exactly-once guarantee.

15 October 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
GZGenliang Zhu
Genliang Zhu
XCXiaobo Chen
Xiaobo Chen
ZWZiyuan Wang
Ziyuan Wang
CWChu Wang
Chu Wang
Incorrect upstream values can propagate through an AI agent's task graph into consistent but erroneous business outputs. We compare auditing the execution history to select a recomputation origin with rewriting terminal outputs from the full context. A prospectively specified local-model study evaluates 112 paired cases from 14 held-out authored templates in a fixed six-node graph. Both procedures initially receive the same sources, history and failed-check message. Full-context rewriting yields 111 correct output pairs versus 75 for audit-guided recomputation with gpt-oss, and 105 versus 88 with gemma (Holm-adjusted template sign-flip 𝑝 = 4.9 × 10-4 and 𝑝 = 0.002). Rewriting also uses fewer tokens per correct repair. An exploratory trace decomposition separates 29/18 attribution failures from 8/6 generation failures after correct attribution. Audit errors concentrate on plausible incorrect extracted amounts blamed on downstream computations that faithfully used them; oracle-origin controls independently expose regeneration errors. A supporting 672-assignment scripted census and 36 matched-prefix interventions specify version-bound validity and persistent effect histories. The results distinguish structural repair scope, source attribution and regenerated-output correctness, and establish full-context rewriting as an essential strong control for dependency-aware repair on the stated task and interface contracts.