Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This paper applies graph neural networks to refine Bitcoin address clustering, addressing the limitations of traditional heuristics in analyzing pseudonymous transaction graphs. By generating contrastive embeddings and utilizing hierarchical clustering, the method offers a more robust framework for distinguishing between legitimate user activity and suspicious merges. The work represents a significant advancement in applying machine learning techniques to blockchain data analysis rather than focusing on core AI model development.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Refining Heuristic-Based Bitcoin Address Clustering with Graph Neural Networks

arXiv2 min read

arXiv:2609.01942v1 Announce Type: new Abstract: Bitcoin's pseudonymous nature makes it challenging to analyze user-level activity, since a single user may control multiple identifiers (addresses). Existing heuristic-based methods attempt to identify addresses belonging to the same user, but they often produce flat cluster assignments with limited modularity and are prone to errors such as merging different users together. In this work, we propose a method for refining heuristic-obtained clusters by grounding our clustering on contrastive embeddings yielded by graph neural networks. Our contributions are threefold: (i) we release a publicly available dataset of Bitcoin transaction graphs containing a substantial number of clusters; (ii) we propose a methodology for learning address embeddings consistent with heuristics, and back it up with theoretical guiding intuitions; (iii) through hierarchical clustering, we enable a finer analysis of heuristic clusters and provide a quantitative criterion for flagging suspicious merges.

Abstract:Bitcoin's pseudonymous nature makes it challenging to analyze user-level activity, since a single user may control multiple identifiers (addresses). Existing heuristic-based methods attempt to identify addresses belonging to the same user, but they often produce flat cluster assignments with limited modularity and are prone to errors such as merging different users together. In this work, we propose a method for refining heuristic-obtained clusters by grounding our clustering on contrastive embeddings yielded by graph neural networks. Our contributions are threefold: (i) we release a publicly available dataset of Bitcoin transaction graphs containing a substantial number of clusters; (ii) we propose a methodology for learning address embeddings consistent with heuristics, and back it up with theoretical guiding intuitions; (iii) through hierarchical clustering, we enable a finer analysis of heuristic clusters and provide a quantitative criterion for flagging suspicious merges.

29 pages, 6 figures. Code: this https URL . Dataset: this https URL

Machine Learning (cs.LG)

arXiv:2609.01942 [cs.LG]

(or arXiv:2609.01942v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2609.01942 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 244 words

Related coverage