Pith. sign in

REVIEW 3 cited by

Characterizing and Detecting Money Laundering Activities on the Bitcoin Network

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1912.12060 v1 pith:RCYZGLFV submitted 2019-12-27 cs.SI cs.CRcs.LG

classification cs.SIcs.CRcs.LG
keywords launderingmoneytransactionsactivitiesbitcoinclassifiersnetworkregular
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Bitcoin is by far the most popular crypto-currency solution enabling peer-to-peer payments. Despite some studies highlighting the network does not provide full anonymity, it is still being heavily used for a wide variety of dubious financial activities such as money laundering, ponzi schemes, and ransom-ware payments. In this paper, we explore the landscape of potential money laundering activities occurring across the Bitcoin network. Using data collected over three years, we create transaction graphs and provide an in-depth analysis on various graph characteristics to differentiate money laundering transactions from regular transactions. We found that the main difference between laundering and regular transactions lies in their output values and neighbourhood information. Then, we propose and evaluate a set of classifiers based on four types of graph features: immediate neighbours, curated features, deepwalk embeddings, and node2vec embeddings to classify money laundering and regular transactions. Results show that the node2vec-based classifier outperforms other classifiers in binary classification reaching an average accuracy of 92.29% and an F1-measure of 0.93 and high robustness over a 2.5-year time span. Finally, we demonstrate how effective our classifiers are in discovering unknown laundering services. The classifier performance dropped compared to binary classification, however, the prediction can be improved with simple ensemble techniques for some services.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. How Reliable Is the Multi-Input Heuristic for Bitcoin Address Clustering in Law Enforcement Contexts?

    cs.CR 2026-07 conditional novelty 7.0 of 10

    The multi-input heuristic for Bitcoin address clustering shows metric- and entity-dependent reliability, with dataset-level scores masking near-complete failures for individual services when evaluated against verified...

  2. Detecting Sybil Addresses in Blockchain Airdrops: A Subgraph-based Feature Propagation and Fusion Approach

    cs.CR 2025-05 reject novelty 6.0 of 10

    The paper reports that a LightGBM model with two-layer subgraph features detects Sybil airdrop addresses with precision 0.94, recall 0.92, F1 0.93, and AUC 0.98 on Binance BAB data.

  3. Detecting Fraud in Financial Networks: A Semi-Supervised GNN Approach with Granger-Causal Explanations

    q-fin.ST 2025-06 conditional novelty 4.0 of 10

    SAGE-FIN, a semi-supervised graph autoencoder with a classification head, detects fraudulent Bitcoin nodes on Elliptic++ and explains flags by measuring loss changes when edges are removed.

Pith tools