Papers › Generative Semi-supervised Graph Anomaly Detection
Generative Semi-supervised Graph Anomaly Detection
Hezhe Qiao, Qingsong Wen, XiaoLi Li, Ee-Peng Lim, Guansong Pang
This work considers a practical semi-supervised graph anomaly detection (GAD) scenario, where part of the nodes in a graph are known to be normal, contrasting to the extensively explored unsupervised setting with a fully unlabeled graph. We reveal that having access to the normal nodes, even just a small percentage of normal nodes, helps enhance the detection performance of existing unsupervised GAD methods when they are adapted to the semi-supervised setting. However, their utilization of these normal nodes is limited. In this paper, we propose a novel Generative GAD approach (namely GGAD) for the semi-supervised scenario to better exploit the normal nodes. The key idea is to generate pseudo anomaly nodes, referred to as 'outlier nodes', for providing effective negative node samples in training a discriminative one-class classifier. The main challenge here lies in the lack of ground truth information about real anomaly nodes. To address this challenge, GGAD is designed to leverage two important priors about the anomaly nodes -- asymmetric local affinity and egocentric closeness -- to generate reliable outlier nodes that assimilate anomaly nodes in both graph structure and feature representations. Comprehensive experiments on six real-world GAD datasets are performed to establish a benchmark for semi-supervised GAD and show that GGAD substantially outperforms state-of-the-art unsupervised and semi-supervised GAD methods with varying numbers of training normal nodes. Code will be made available at https://github.com/mala-lab/GGAD.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Syntology holds a reference implementation of GGAD, generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='GGAD') (how to connect); the free check have('2402.11887') needs no token.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2402.11887")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2402.11887", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2402.11887")
Code
Syntology 19 code samples harvested from 2 repositories linked to this paper: 12 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.
By repository: official repository: 14 samples from 1 repository, 10 ran (8 with no instrument failure; 2 where Syntology's instrument failed); found in paper text by Syntology: 5 samples from 1 repository, 2 ran (1 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written between 2026-09-22 and 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 12 samples that ran has no recorded date.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
19 samples harvested: 12 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 14 of the 19 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
97fd9c96e296f10d · report
fixture: signature seq:Tensor/3/float · returned Tensor · level recorded 2026-09-22 4b7926c71f580f82 · report
fixture: signature c:Tensor/2/float, h_pl:Tensor/2/float · returned Tensor · level recorded 2026-09-22 02c6a5361e2291b2 · report
fixture: signature seq:Tensor/3/float, adj:Tensor/3/float, sparse:bool/0/bool · returned Tensor · level recorded 2026-09-22 52859d7e7894cf5a · report
fixture: signature seq:Tensor/3/float · returned Tensor · level recorded 2026-09-22 b0574c4dc72c52d7 · report
fixture: signature seq:Tensor/3/float · returned Tensor · level recorded 2026-09-22 fdec68da5b0533c4 · report
fixture: signature seq1:Tensor/3/float, adj:Tensor/3/float, sample_abnormal_idx:list/1/int, normal_idx:list/1/int, train_flag:bool/0/bool, args:Args/0/?, sparse:bool/0/bool · returned tuple · level recorded 2026-09-24 census: 3 implementations from 6 papers, 3 distinct outputs across 2 buckets, one shared input per bucket this sample: bucket 1 of 2, arg 1: rank 2, kind float, dtype float32 model_tam.py ran · honoured contract fingerprinted no licence file found · pointer only ·
af0b22bd9efac86b · report
fixture: signature feature:Tensor/2/float · returned Tensor · level recorded, date not recorded e5c33eda8d8c16f9 · report
fixture: signature adj:Tensor/2/float · returned list · level recorded 2026-09-26 8f1b9d2b492634d4 · report
fixture: signature adj:Tensor/2/float · returned list · level recorded 2026-09-24 5a685c2a4a645478 · report
fixture: signature adj:Tensor/2/float, idx_train:Tensor/1/int · returned list · level recorded 2026-09-24 census: 5 implementations from 5 papers, 4 distinct outputs across 3 buckets, one shared input per bucket ocgnn.py unverified no licence file found · pointer only ·
7290fd3be1378160 · report
5f69b7946c674637 · report
db2224755aa6cbca · report
fixture: returned GAANBase · level recorded 2026-09-22 7d3627fc8e076142 · report
fixture: signature x:Tensor/2/float, x_:Tensor/2/float, s:Tensor/2/float, s_:Tensor/2/float, weight:float/0/float, pos_weight_a:float/0/float, pos_weight_s:float/0/float, bce_s:bool/0/bool · returned Tensor · level recorded 2026-09-22 d8e12c2b23e733b3 · report
8275702b147e567e · report
Method as code Syntology
What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another. Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.
3 assemblies on this paper: 2 harvested, 1 generated, listed in 2 groups (siblings lifted in one batch form one group).
generated Assembly for GGAD (graph method: GGAD), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 3; 5 property tests passed on both).
label matches by construction: the code was generated for this method (not judged by a model)
- compute_anomaly_score entry · level 3 · ran · violated contract ·
2b22ad73004ec80d85993b803327d08c9169e655df43b1200bb8253595191cc0
2 sibling assemblies for GGAD (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.
harvested Assembly for GGAD (graph method: GGAD). 5 bricks; individually on a fixture: 2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified. The assembly has not been run end-to-end.
one of 2 siblings
- GAAN entry · level 0 · unverified ·
31e42a9deeb82cb3 - DeepDetector helper · level 0 · unverified ·
d8e12c2b23e733b3 - GAANBase model · level 1 · ran ·
db2224755aa6cbca - Detector helper · level 0 · unverified ·
8275702b147e567e - double_recon_loss helper · level 1 · ran; the contract check could not run (RAISES) ·
7d3627fc8e076142
harvested Assembly for GGAD (graph method: GGAD). 7 bricks; individually on a fixture: 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. The assembly has not been run end-to-end.
one of 2 siblings
- Model entry · level 1 · ran ·
fdec68da5b0533c4 - AvgReadout model · level 1 · ran ·
97fd9c96e296f10d - Discriminator model · level 1 · ran ·
4b7926c71f580f82 - GCN model · level 1 · ran ·
02c6a5361e2291b2 - MaxReadout model · level 1 · ran ·
52859d7e7894cf5a - MinReadout model · level 1 · ran ·
b0574c4dc72c52d7 - WSReadout model · level 0 · unverified ·
83dbc56de1da4882
Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2402.11887") returns these assemblies with each brick's role and wiring (how to connect).
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections