Payroll Fraud Detection in Synthetic HR/ERP Graphs: An Inductive Comparison of Rules, Path Features, and Graph Neural Networks

Xiaobo Chen, Genliang Zhu, Ziyuan Wang, Chu WangarXiv 2026 · arXiv

TL;DR

This paper presents a rigorous evaluation of payroll fraud detection methods using synthetic HR/ERP graphs, comparing traditional rules, explicit path features, and Graph Neural Networks (GNNs). The authors demonstrate that while GNNs excel at multi-hop discovery, a tuned Gradient-Boosted Decision Tree (GBDT) on explicit path features actually achieves superior performance, provided the graph data is well-resolved.

What Problem Does This Paper Address?

Payroll fraud—such as "ghost employees" or collusion between employees and vendors—is a major challenge for internal audits. These schemes often hide behind multi-hop relationships (e.g., an employee’s emergency contact sharing a bank account with a new vendor).

Traditional audit tools rely on "one-step" rules that struggle with these indirect links. While Graph Neural Networks (GNNs) seem like a natural fit for this problem, the authors identify a critical pitfall: synthetic benchmarks often contain "structural tells" (shortcuts) that allow models to achieve near-perfect scores without actually learning the underlying fraud logic. The paper aims to establish a more realistic, "leakage-free" benchmark to see if GNNs truly offer an advantage over simpler methods.

Methods

The researchers compared several families of models:

  • Analyst Rules: Ranging from naive flag-counting to "record-aware" rules that account for legitimate exceptions (like joint accounts).
  • Path Features + GBDT: A tuned gradient-boosted model trained on hand-crafted features, including counts of specific path types between entities and their attributes.
  • Graph Neural Networks (GNNs): Several state-of-the-art inductive architectures, including GraIL (subgraph-based), NBFNet (path-based message passing), and RDL-style (relational deep learning) models.
  • Chained-Join Queries: Deterministic audit queries that follow identifier chains across tables.

A key methodological contribution is the "matched benign twin" design. For every planted fraud case, the generator creates a structurally identical benign case (e.g., a legitimate family-member payee). This forces models to discriminate based on noisy control records (like approval logs and conflict-of-interest declarations) rather than just graph topology.

Figure 1: A planted 3-hop fraud and its matched benign twin have identical topology; only the control records attached to the entities differ. A model that separates the two must read the records.

Datasets

The study uses two newly introduced synthetic datasets:

  • hrgraph-004: A cohort of 36 organizations (12 dev, 24 test) with a high fraud prevalence (26.9% at the entity level) used for the primary comparison.
  • hrgraph-005: A lower-prevalence cohort (2.0% positive entities) designed to test review prioritization and performance in more realistic, imbalanced settings.

The datasets model complex HR/ERP relationships, including employees, vendors, bank accounts, addresses, and various internal control records.

Key Insights and Ideas

  • The "Structural Tell" Trap: In early exploratory phases, GNNs achieved near-perfect scores (AUROC > 0.99). However, a "leakage audit" revealed the models were simply detecting artifacts of the generator's planting code (e.g., a colluder having an extra emergency contact). This highlights the danger of using naive synthetic data for GNN benchmarking.
  • Multi-hop is not GNN-exclusive: The perceived advantage of GNNs in reaching distant colluders is actually an "information-access advantage." A GBDT trained on explicit multi-hop path features (chained joins) was able to reach the same candidates and rank them more accurately.
  • Robustness to Noise: While GBDTs won on clean data, GNNs showed better resilience when the graph was "noisy." When 40% of identifier joins failed (simulating poor data quality), the entity-level GNN maintained higher performance than the path-based GBDT.
  • Discrimination vs. Discovery: The authors separate the task into discovery (finding the chain) and discrimination (reading the records to see if the chain is fraudulent). Rules are excellent at discrimination for short chains, but multi-hop models are required for discovery.

Key Results

  • Overall Champion: A tuned GBDT on chained-join features achieved the highest overall link Average Precision (AP 0.823), significantly outperforming the GraIL-style GNN (AP 0.663).
  • Multi-hop Performance: At 4 hops, the GBDT maintained an AP of 0.646, while the GNN dropped to 0.272.
  • Entity Ranking: On the 2% prevalence cohort, the RDL-style entity GNN significantly outperformed record-aware rules (AP 0.707 vs. 0.504).
  • Review Budget: At a 2% review budget, the GNN achieved a precision of 0.695, compared to 0.602 for traditional rules.
Table 2: Exploratory phase 2 on generator v1 (24 test orgs, 215,545 pairs): near-ceiling GNN scores that the leakage audit later traced to structural tells. Not confirmatory; reported to document the trap.

Limitations and Future Work

  • Synthetic Nature: The study relies entirely on synthetic data. While the "matched twin" design adds rigor, real-world payroll data may contain different types of noise and "shortcuts" not captured here.
  • Entity Resolution: The generator assumes that linking an emergency contact to a vendor representative is a solved problem. In practice, this "record linkage" is a major hurdle.
  • LLMs: The study did not evaluate Large Language Models, which are increasingly being proposed for audit tasks.
  • Future Directions: The authors suggest that future work should focus on "cascaded" designs—using multi-hop methods for candidate retrieval and specialized record-reading layers for final fraud assessment.

Summary updated

Abstract

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.
BibTeX
@misc{chen2026payroll,
  author = {Xiaobo Chen and Genliang Zhu and Ziyuan Wang and Chu Wang},
  title = {{Payroll Fraud Detection in Synthetic HR/ERP Graphs: An Inductive Comparison of Rules, Path Features, and Graph Neural Networks}},
  year = {2026},
  eprint = {2610.41085},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.41085},
}
Figure