- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
ASYMGAD ranks potential lateral-movement pivot machines from enterprise authentication streams without attack labels. It combines adaptive window construction, a directional expansion score, historical persistence filtering, and a self-supervised directed GNN that predicts persistence percentiles. Evaluation on the LANL dataset reports improvements over seven baselines, with ablations identifying persistence filtering as the main contributor and message passing providing additional gains.
Critical strengths
-
Practical and interpretable formulation. Authentication activity naturally forms a directed graph. The framework explicitly addresses observation-window construction and uses historical expansion behavior to suppress recurring high-fanout hosts. Its main scoring and filtering decisions are understandable and operate without incident labels.
-
Useful experimental diagnostics. The count-matched random-removal control supports the conclusion that persistence filtering benefits from selecting particular hosts rather than merely reducing the candidate list. Component ablations and results across three training seeds also make the sources and variability of the improvements easier to assess.
Critical weaknesses
-
Important comparisons are missing. Persistence filtering alone achieves 0.2402 mean AP, compared with 0.2616 for the complete method averaged over three seeds. Since the GNN predicts historical persistence, a direct persistence-based scoring baseline is needed to establish the benefit of learning this quantity from graph structure. Furthermore, the CybGFM comparison omits pretraining, limiting conclusions about superiority over the complete published method.
-
Evidence of broad attack coverage remains limited. The evaluation contains only four pivot identities, with one appearing in 44 of 54 positive windows. The low-volume pivot C19932 has a best rank of 263, indicating limited recovery at practical analyst budgets. Table 9 reports window-level AP conditioned on a pivot’s presence, so improvements can arise from ranking another pivot in the same window. The hard persistence filter also suppresses sufficiently persistent attackers, restricting applicability to sustained compromises.
Questions for authors
- How does the GNN compare with directly incorporating historical persistence into the ranking under identical filtering and fusion conditions?
- Does the comparative advantage persist when CybGFM’s pretraining stage is reproduced?
- Can you report identity-specific Hit@K and results excluding the dominant pivot, separating low-volume detection from improvements attributable to co-occurring attacks?
3 comments
Response to Reviewer ---- Part 2/2
Comment 3.
"Evidence of broad attack coverage remains limited. The evaluation contains only four pivot identities, with one appearing in 44 of 54 positive windows. The low-volume pivot C19932 has a best rank of 263, indicating limited recovery at practical analyst budgets. Table 9 reports window-level AP conditioned on a pivot's presence, so improvements can arise from ranking another pivot in the same window."
"Can you report identity-specific Hit@K and results excluding the dominant pivot, separating low-volume detection from improvements attributable to co-occurring attacks?"
We add identity-specific Hit@K, the evaluation without C17693, and the per-pivot decomposition of multi-pivot windows. In Appendix D.3 the mean AP is computed over the windows in which each pivot is active, while the rank and Hit@K refer to the host itself.
On the reported run, C17693 reaches 0.3336 mean AP with median rank 9 and best rank 1, and C22409 reaches 0.1597 with median rank 34. The identity-specific Hit@K is: C17693 hit@1 0.25, hit@10 0.52, hit@50 0.55, hit@100 0.59; C22409 hit@50 0.67, hit@100 0.67. The two low-volume pivots, C19932 and C18025, remain below practical analyst budgets up to K=100; their per-pivot statistics are reported in the same appendix.
Appendix D.13 evaluates the ten positive windows without C17693: our method reaches 0.00354, against 0.00091 for a random ranking and 0.00115 for the best baseline, CyberGFM; the three runs give 0.00354, 0.00365 and 0.00356. The relative advantage remains after removing the dominant pivot. In the sole-window analysis of the same appendix, C22409 reaches 0.0294 mean AP; the low-volume pivots remain limited.
Appendix D.14 decomposes the AP of each multi-pivot window into per-pivot contributions. In window 105 the AP is 0.1943, with C17693 contributing 0.1667 at rank 2; in window 113 the AP is 0.2502, with C17693 contributing 0.2500. The decomposition separates the contribution of a low-observation pivot from the gain of C17693 in the same window, so the evaluation of a single host is not replaced by the window-level AP.
Comment 4.
"The hard persistence filter also suppresses sufficiently persistent attackers, restricting applicability to sustained compromises."
Appendix D.7 quantifies how the persistence threshold affects pivot retention. The filter removes hosts whose observed persistence P exceeds Θ=2/3; the highest observed persistence among labeled pivots is 0.56, so the reported threshold retains all labeled pivots. Lowering Θ to 0.55 and 0.50 would remove 2 and 19 pivot records, respectively.
The method targets transient lateral movement. An attacker whose observed persistence exceeds the threshold is also removed. The Limitations appendix states the corresponding boundary: an adversary that holds a machine over many windows, or whose fanout is no higher than that of comparable hosts, may not be separated by either signal.
We will reflect these results and the scope statement in the revision, and thank the reviewer again.
Dear authors,
Thank you for the additional results. The comparison with pretrained CybGFM is still missing, and detection of low-volume pivots remains limited. I will keep my original rating of Weak Rejection.
Best regards, Reviewer W3L9
Response to Reviewer ---- Part 1/2
We thank the reviewer for the comments. We respond point by point with the additional experiments.
Comment 1.
Appendix D.11 fixes the windows, the filter and the fusion weight, and replaces the learned branch by the historical persistence ranking (Table 1). The 0.2402 value is the directional asymmetry score with the filter; the persistence ranking alone reaches 0.0252, the same ranking with the filter 0.1238, and the fused persistence order 0.2510. The complete method reaches 0.2616 as the three-seed mean and 0.2724 on the reported run, higher than the fused persistence order by 0.0106 and 0.0214, respectively.
We further scan K=10,20,30,50,100 and smoothed persistence. The best training-free configuration on LANL is P(K=20,N≥3) with a fused score of 0.2510; the default K=50 gives 0.2215, below the filtered asymmetry score of 0.2402. The learned branch is 0.0214 above the best training-free configuration on LANL. On OpTC the fused persistence order reaches 0.4647 while the learned branch reaches 0.7194, the mean of three runs. The branch prediction correlates 0.46 with the current-window asymmetry order and 0.20 with the persistence statistic: the learned output differs from the direct persistence order and adds a larger fused gain on OpTC. The K-scan is reported in Appendix D.11.
Table 1: Direct persistence ranking against the learned branch, mean AP.
The LANL learned-branch entry in Table 1 is the reported seed 0; its three-seed mean is 0.2616. The OpTC learned-branch entry is the mean of three runs.