Pith. sign in

REVIEW 2 cited by

Assessing the Efficacy of Heuristic-Based Address Clustering for Bitcoin

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 2403.00523 v1 pith:NBP23IJK submitted 2024-03-01 q-fin.GN cs.CRcs.SI

classification q-fin.GNcs.CRcs.SI
keywords entitiesclusteringbitcoinheuristicheuristicsnumberratioanalytical
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Exploring transactions within the Bitcoin blockchain entails examining the transfer of bitcoins among several hundred million entities. However, it is often impractical and resource-consuming to study such a vast number of entities. Consequently, entity clustering serves as an initial step in most analytical studies. This process often employs heuristics grounded in the practices and behaviors of these entities. In this research, we delve into the examination of two widely used heuristics, alongside the introduction of four novel ones. Our contribution includes the introduction of the \textit{clustering ratio}, a metric designed to quantify the reduction in the number of entities achieved by a given heuristic. The assessment of this reduction ratio plays an important role in justifying the selection of a specific heuristic for analytical purposes. Given the dynamic nature of the Bitcoin system, characterized by a continuous increase in the number of entities on the blockchain, and the evolving behaviors of these entities, we extend our study to explore the temporal evolution of the clustering ratio for each heuristic. This temporal analysis enhances our understanding of the effectiveness of these heuristics over time.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 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. Bitcoin Research with a Transaction Graph Dataset

    cs.LG 2024-11 conditional novelty 6.0 of 10

    A new public Bitcoin transaction graph dataset with 252M nodes, 785M edges, and ~34K labeled entities, plus GNN baselines.

Pith tools