Pith. sign in

REVIEW 3 major objections 4 minor 2 references

StableAML: Machine Learning for Behavioral Wallet Detection in Stablecoin Anti-Money Laundering on Ethereum

T0 review · 3 major / 4 minor · reviewed 2026-08-02 · deepseek-v4-flash

Pith's one-line read Domain-informed tree ensembles, not graph neural networks, best detect money-laundering wallets in Ethereum stablecoin flows, and the model also separates cybercrime syndicates from sanctioned entities.

desk verdict The dataset is a real contribution, but the headline result — tree ensembles beating GNNs on stablecoin AML — is likely an artifact of label leakage; don't trust the F1 numbers until the authors remove flag-derived features and re-run. read the letter →

arxiv 2602.17842 v2 pith:JI74KSYK submitted 2026-02-19 cs.CR cs.CE

classification cs.CRcs.CE
keywords anti-moneylaunderingstablecoinsEthereumbehavioralwalletdetectiontreeensemblesgraphneuralnetworksfeatureengineeringblockchainanalytics
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that, for detecting money laundering in USDT/USDC transfers on Ethereum, 68 hand-engineered behavioral features fed into tree ensembles (best: CatBoost) outperform graph neural networks, which stumble on the fragmented stablecoin transaction graph. On a new dataset of 16,433 wallets labeled Normal, Cybercrime, or Blocklisted, CatBoost reaches a Macro-F1 of 0.9775, versus 0.8048 for GraphSAGE. The model further claims to distinguish two laundering typologies: the complex, high-velocity layering of cybercrime syndicates versus the constrained, static footprints of sanctioned or frozen wallets. These results are positioned as an empirical baseline for AML screening under emerging stablecoin regulations, where the persistent transparency of centralized stablecoins serves as a choke point.

What carries the argument

The central object is a 68-feature engineered feature set, grouped into interaction, derived network, transfer, and temporal/direct categories. The load-bearing elements are the second-degree network features (e.g., 2ndWithFlagged, 2ndWithOver10k) and interaction flags (sentToFlagged, receivedFromFlagged, sentToSwap), which are aggregated over the full 2017–2025 observation window. These are fed to gradient-boosted trees, whose piecewise-constant decision boundaries partition the discrete behavioral signals; CatBoost's ordered boosting and native categorical handling are the specific variant used. The graph baseline uses GraphSAGE with mean aggregation over a stablecoin-only weighted graph,

What would settle it

Take the best CatBoost configuration, drop all features derived from flagged-address lists (receivedFromFlagged, sentToFlagged, 2ndWithFlagged, clusterScore, etc.), and replace the random 80/20 split with a temporal split (train on wallets whose first transfer precedes a cutoff, test on wallets first active after it). If Macro-F1 falls well below the reported 0.98, or if the cybercrime/blocklisted separation blurs, the headline result is largely an artifact of label leakage and full-window feature computation rather than a portable detection signal.

Watch

Extended reading notes

Core claim

On a purpose-built dataset of 16,433 Ethereum wallets labeled Normal, Cybercrime, or Blocklisted, restricted to USDT and USDC transfer events, gradient-boosted tree ensembles—especially CatBoost—achieve near-perfect binary separation and strong three-class Macro-F1, clearly outperforming a GraphSAGE graph neural network. The paper attributes the GNN's weakness to the fragmentation of the stablecoin-only transaction graph, which breaks the message-passing paths needed for neighborhood aggregation. Feature-importance analysis shows that second-degree exposure features (e.g., 2ndWithMultipleSameValue, 2ndWithOver10k) and direct contract/CEX interactions drive the predictions, and these map onto

Load-bearing premise

The model assumes each wallet's entire 2017–2025 transaction history is available at scoring time, and that features such as receivedFromFlagged and clusterScore—which are built from the same flagged-address lists that define the labels—do not leak the target during training.

Editorial extensions

If this is right

  • AML screening for stablecoins can rely on tabular behavioral features computed from token transfer events, without needing a connected transaction graph.
  • The three-class model gives compliance teams a way to separate active cybercrime laundering from sanctioned/frozen wallets, enabling different response actions (e.g., freeze vs. monitor).
  • The interpretability analysis maps top features to placement, layering, and integration stages, offering an audit trail for regulators under frameworks like MiCA and the GENIUS Act.
  • The dataset and methodology establish a stablecoin-specific baseline for future AML research and for deterministic, auditable wallet screening.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because several engineered features are computed from the same flagged-address lists that generated the labels, and because features use the full 2017–2025 window (including post-label activity), the reported Macro-F1 likely overestimates out-of-sample performance; a leakage-controlled evaluation would probably lower the numbers.
  • The GNN comparison may understate graph methods: the graph was restricted to USDT/USDC edges only, so cross-asset swaps that break the chain are excluded by design; a multi-asset graph could restore message-passing paths and change the ranking.
  • The claimed typology separation could be tested forward: after the 2025 cutoff, track wallets the model labels as cybercrime and see if their subsequent transaction velocity and hop counts exceed those of wallets labeled blocklisted.
  • If the result holds under leakage control, it suggests that the persistent transparency of centralized stablecoins is enough to screen illicit behavior even as privacy layers obscure native-asset graphs.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper introduces StableAML, a labeled Ethereum stablecoin dataset of 16,433 wallets (Normal, Cybercrime, Blocklisted) built from USDT/USDC transfer events, and compares logistic regression, four tree ensembles, a DNN, and GraphSAGE on 68 engineered features. The headline result is that tree ensembles, especially CatBoost, achieve Macro-F1 ≈ 0.9775, far outperforming GraphSAGE (≈ 0.8048), and that feature-importance analysis reveals distinct behavioral signatures for cybercrime versus blocklisted wallets. The authors argue this demonstrates the superiority of domain-informed feature engineering over graph neural networks for stablecoin AML.

Significance. If the results are valid, the paper would provide a useful benchmark dataset and an important practical message for AML compliance: tabular behavioral features can outperform GNNs on fragmented stablecoin transaction graphs. The dataset is made publicly available, and hyperparameter details are included, which are strengths for reproducibility. However, the central comparison and the typology interpretation rest on a set of features that are constructed from the same flagged-address lists used to define the target labels. This creates a direct label-leakage pathway that can explain the near-perfect F1 scores without any genuine behavioral detection. The paper currently does not provide the ablation needed to show that the reported results survive removal of these leaked features or a temporally honest split. The significance of the contribution is therefore conditional on this missing evidence.

major comments (3)
  1. [Section 3.1, Appendix A (Table 8)] The features receivedFromFlagged, sentToFlagged, 2ndWithFlagged, 3rdWithFlagged, clusterScore ('Number of flagged direct connections'), and isPartOfClusterFrom/To are constructed directly from the same flagged-address lists (Etherscan reports, SlowMist/PeckShield, OFAC) that define the Cybercrime and Blocklisted labels in Section 3.1. A wallet that has any transaction with a flagged address is almost deterministically labeled as illicit. Including these features as inputs means the model is performing label propagation, not learning behavioral detection. This is the most load-bearing issue: the headline Macro-F1 values (Table 5) and the typology separation (Section 5.4) are plausible in-sample artifacts. The authors must report an ablation that removes all features whose construction references flagged-address lists, and a version where second/third-degree flagged features are excluded o
  2. [Sections 3.3 and 4] As stated in Section 3.3, both the graph structure and node features are 'cumulative aggregates over the full observation window' (2017-2025). The labels are assigned at specific points in time (e.g., when a wallet is frozen or sanctioned), so the features include activity that occurs after the label is assigned. The random wallet-level split does not address this temporal leakage: a model evaluated on the test set has access to post-label behavior that would not be available when the label is predicted in practice. A temporal split — where features for each wallet are computed using only transactions before the label date, and training/testing are separated in time — is needed to support the paper's practical claims about detection for compliance.
  3. [Section 5.2 and Table 5] The claimed advantage of tree ensembles over GraphSAGE (Macro-F1 0.9775 vs 0.8048) cannot be interpreted without the leak-free ablation. Since the GNN also uses the same 68 leaky node features, it is plausible that tree ensembles exploit the leaked flagged-connection features more directly, while GNN message passing partially dilutes them. The paper does not report results with the leaky features removed, nor does it compare models on a temporally split dataset. Without these experiments, the central claim that 'domain-informed tree ensembles significantly outperform graph neural networks' is not established.
minor comments (4)
  1. [Table 7, Section 5.5] The comparison with Elliptic dataset results is not apples-to-apples: Elliptic uses a different asset class, different label definitions, and a different task (transaction classification vs. wallet classification). This should be caveated clearly, or the comparison should be removed.
  2. [Appendix A, Table 8] The feature name 'circleDetected' is described as 'Reciprocal transfers within 24 hours' but the name is not self-explanatory. A short explanation of why this indicates circular activity would improve clarity.
  3. [Figure 4] Panels are described as 'Per-class OvR performance curves' but it is not immediately clear from the caption whether the curves are ROC, precision-recall, or something else. Please label axes in the figure.
  4. [Section 4.3, Eq. (1)] The softmax equation uses z_k(x) but the definition of z_k is not explicit; clarify that z is the final linear projection of the hidden representation.

Circularity Check

1 steps flagged · score 6.0 of 10

Label-derived adjacency features (clusterScore, sentToFlagged, receivedFromFlagged, 2nd/3rdWithFlagged) are built from the same flagged/sanctioned lists that define the labels, so the near-perfect F1 and typology separation are partly label propagation, not independent behavioral detection.

  1. self definitional [Section 3.1 ('Classification Groups') vs Appendix A Table 8; also Section 3 feature list]
    "We collect suspicious and malicious Ethereum wallets identified through Etherscan reports, disclosures from partner blockchain security firms (e.g., SlowMist, PeckShield), and official sanctions and enforcement lists, specifically the U.S. Office of Foreign Assets Control (OFAC) Specially Designated Nationals list. ... clusterScore: Number of flagged direct connections; sentToFlagged: Sent funds to a flagged address; receivedFromFlagged: Received funds from a flagged address."

    The suspicious labels (Cybercrime, Blocklisted) are exactly membership in the flagged/sanctioned set F assembled from those reports and OFAC lists. Several top features are direct summaries of F: clusterScore counts a wallet's neighbors in F, and sentToFlagged/receivedFromFlagged/2ndWithFlagged/3rdWithFlagged count transactions or paths touching F. Thus a wallet's risk score is, to a large extent, a function of the same set that defines its label. The model is propagating the label set through graph adjacency, so the reported Macro-F1 ~0.98 and the Cybercrime-vs-Blocklisted typology split are not shown to come from independent behavioral signals. No ablation removes these label-derived features or enforces a temporal split, so the 'behavioral detection' claim is not separable from the labe

full rationale

No self-citation chains, imported uniqueness theorems, or ansatz-by-citation were found; the tree-vs-GNN comparison is an honest empirical benchmark on the constructed dataset. However, the central behavioral/typology claims are compromised by construction: the same external flagged/sanctioned lists generate both the labels (Section 3.1) and the highest-ranked derived features (Appendix A: receivedFromFlagged, sentToFlagged, clusterScore, isPartOfClusterFrom/To). Because features are cumulative over 2017-2025 (Section 3.3), they also include post-label activity, adding lookahead leakage. The paper does not report an ablation without these features or with temporal splits, so the near-perfect F1 and typology separation may reflect label propagation rather than independent behavioral detection. These issues warrant a correctness/validity follow-up, but the model-comparison result retains some independent content, so the circularity score is 6 rather than higher.

Assumptions & free parameters 5 free parameters · 5 assumptions · 0 invented entities

The central results rest on hand-chosen feature thresholds (transferOver*, highFrequency, isLongTermWallet), a deliberately rebalanced class distribution, and an 80/20 random split. The most consequential choice is that label-derived adjacency features (e.g., receivedFromFlagged, clusterScore) are included in the inputs; this is not a fitted constant but a design decision that drives the circularity score.

free parameters (5)
  • transferOver thresholds = 1000, 5000, 10000 USD
    Hand-chosen thresholds in feature engineering (Table 8); define the volume-based features that rank high in importance.
  • highFrequency threshold = 10 transfers/day
    Hand-chosen definition of abnormal burst behavior; used in the Temporal feature group.
  • isLongTermWallet threshold = 3 months active
    Hand-chosen threshold for wallet longevity; used in Direct features.
  • class-balance sampling proportions = Normal ~48.7%, Cybercrime ~36.5%, Blocklisted ~14.8%
    Curated subset deliberately rebalances the <1% natural illicit prevalence; affects all reported precision/recall values.
  • train/test split ratio = 80/20
    Arbitrary partition; no temporal split is used, so features computed over the full window can leak post-label behavior into the test set.
assumptions (5)
  • domain assumption Transfer events emitted by USDT/USDC contracts fully represent economic transfers.
    Section 3 uses event logs instead of raw transactions to bypass relayer ambiguity; assumes event-to-intent correspondence.
  • domain assumption Labels from Etherscan, SlowMist, PeckShield, and OFAC SDN are accurate and exhaustive for the three classes.
    Section 3.1 defines the label classes; the paper does not discuss label noise or incomplete coverage.
  • domain assumption A random wallet-level train/test split gives unbiased generalization for future detection.
    Sections 3.3 and 4.0 assume i.i.d. wallets even though features are aggregated over the full time window including post-label data.
  • domain assumption The graph built only from the curated labeled wallets is representative enough for GNN message passing.
    Section 3.3 constructs the graph over labeled addresses only; the resulting sparsity (density <0.01) may reflect dataset construction rather than the true network.
  • standard math Supervised learning treats wallets as i.i.d. samples.
    Standard assumption in tabular ML, though it conflicts with the graph-based relational view used in Section 4.4.

how reviews work

0 comments
Cite this review

Pith. "Pith review of StableAML: Machine Learning for Behavioral Wallet Detection in Stablecoin Anti-Money Laundering on Ethereum." pith.science (2026). https://pith.science/paper/JI74KSYK

@misc{pith2026260217842,
  author       = {Pith},
  title        = {Pith review of: StableAML: Machine Learning for Behavioral Wallet Detection in Stablecoin Anti-Money Laundering on Ethereum},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JI74KSYK}},
  note         = {Machine review of arXiv:2602.17842}
}
abstract

Global illicit fund flows exceed an estimated $3.1 trillion annually, with stablecoins emerging as a preferred laundering medium due to their liquidity. While decentralized protocols increasingly adopt zero-knowledge proofs to obfuscate transaction graphs, centralized stablecoins remain critical transparent choke points for compliance. Leveraging this persistent visibility, this study analyzes an Ethereum dataset to establish an empirical baseline for behavioral AML detection. Our findings demonstrate that domain-informed tree ensemble models achieve higher Macro-F1 score, significantly outperforming graph neural networks, which struggle with the increasing fragmentation of transaction networks. The model's interpretability goes beyond binary detection, successfully dissecting distinct typologies: it differentiates the complex, high-velocity dispersion of cybercrime syndicates from the constrained, static footprints left by sanctioned entities. This methodological approach provides actionable insights that align with industry shifts toward deterministic verification, informing the auditability and compliance requirements under regulations such as the EU's MiCA and the U.S. GENIUS Act while minimizing unjustified asset freezes. By providing a high-precision behavioral classification of suspicious wallets, this approach contributes to raising the economic cost of financial misconduct while informing compliance practice under emerging stablecoin regulations.

Figures

Figures reproduced from arXiv: 2602.17842 by the authors.

Figure 1
Figure 1. Historical transaction volumes for Bitcoin, Ethereum, and combined stablecoins. Concurrent with these trends, stablecoin regulation is advancing rapidly across major jurisdic￾tions. The EU’s Markets in Crypto-Assets (MiCA) Regulation (2023) and the U.S. GENIUS Act (2025) mandate that stablecoin issuers maintain full reserve backing, undergo independent audits, and comply with comprehensive Anti-Money Laundering (AML… view at source ↗
Figure 2
Figure 2. Sankey diagram of a multi-hop transfer. Funds are withdrawn from Tornado Cash, passed through intermediary wallets to obscure the trail, and rapidly deposited into a centralized exchange (Binance) within a 26-minute window. The prominent grey path highlights the primary volume flow, illustrating the "layering" behavior captured by second-degree network features. To illustrate multi-hop exposure, [PITH_FULL_IMAGE:fi… view at source ↗
Figure 3
Figure 3. Exploratory plots. (a) Distribution of 2ndWithOver10k shows that illicit wallets are structurally embedded in high-volume networks, unlike normal users. (b) Inverse preference for CEX vs. DeFi Swaps. 3.2.3 Transfer-based Features Transfer-based features capture the direct flow of value into and out of a wallet. These include threshold-based indicators, such as transfers exceeding $1,000, $5,000, and $10,000. Their d… view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Per-class OvR performance curves for multiclass wallet classification, shown separately for the Normal, Cybercrime, and Blocklisted classes. The detailed per-class performance analysis, summarized in [PITH_FULL_IMAGE:figures/full_fig_p016_4.png]
Figure 5
Figure 5. Figure 5: Consensus ranking of the top 15 features across primary models. The reported "Value" represents the normalized importance derived from the multi-stage pipeline, aggregating: (i) model-specific impurity/gain for tree ensembles, (ii) normalized coefficients (β) for LR, (…
Figure 6
Figure 6. Figure 6: Class-specific feature importance heatmap. Color intensity represents the relative influence (normalized aggregated importance) of each feature on model predictions, segmented by output class. Values are averaged across all tree ensembles to highlight the distinct beha…

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

2 extracted references

  1. [1]

    A., Johnson, S

    Akartuna, E. A., Johnson, S. D., and Thornton, A. (2022). Preventing the money laundering and terrorist financing risks of emerging technologies: An international policy delphi study. Technological Forecasting and Social Change, 179:121632. Andersen, R. (2022). Sanctioned addresses and blockchain monitoring. Office of Foreign Assets Control (OFAC). Berent...

  2. [30]

    Lin, D., Wu, J., Fu, Q., Yu, Y., Lin, K., Zheng, Z., and Yang, S. (2023). Towards understanding crypto money laundering in web3 through the lenses of ethereum heists. InProceedings of the ACM SIGMETRICS Conference, pages 1–21. Liu, J., Yin, C., Wang, H., Wu, X., Lan, D., Zhou, L., and Ge, C. (2023). Graph embedding-based money laundering detection for eth...

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.