Papers for

blockchain analytics providers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Solana token rug pulls can be detected within minutes using transfer graphs

Early Rug Pull Detection on Solana

Abstract: Web3 platforms that help users discover and trade newly launched crypto tokens, including launchpads, decentralized-exchange (DEX) interfaces, wallets, and token-analytics sites, must assess tokens before their legitimacy is clear. On Solana, where token creation is inexpensive and tokens use standard programs rather than custom per-token smart contracts, rug pulls can unfold within minutes. Effective warnings must therefore rely on limited histories. Although graph neural networks (GNNs) have improved rug-pull detection on EVM chains, it remains unclear whether transfer structure adds predictive value over non-graph models at minute-scale decision points, and how that value changes as history accumulates. We study 2,700 tokens sampled from SolRPDS, collecting one-minute market histories from Birdeye and token transfers from Solana RPC. We define a rug pull operationally by requiring a liquidity drain, price collapse, and persistent liquidity depletion over a nominal 24-hour period after token creation. All features use only information available at or before each prediction cutoff. We evaluate observation windows of 12.5, 35.5, and 93 minutes, selected in advance from the published lifespan distribution of Solana rug pulls, and represent each token as a temporal transfer graph. Within the first 12.5 minutes, rug-pull and non-rug graphs already differ in size, density, reciprocity, and receiver-side centralization. We compare GNNs against matched non-graph models using the same token-level and graph-summary features on identical samples. A fixed panel of tokens observed in all three windows further isolates the effect of longer observation from changes in token population. Our findings inform the design of early-warning mechanisms for newly launched Solana tokens in Web3 interfaces.

Mon 9 NovCryptography and Security
The gist
Quick scams called rug pulls occur in minutes on the Solana blockchain when new crypto tokens suddenly lose their value and liquidity. The authors study how early indicators from token transfer patterns and market data can warn about such scams within minutes. They found that graph neural networks analyzing token transfers offer useful signals that differ from simpler models, especially in the very first 12.5 minutes. This research helps build tools that warn users about risky new tokens on Solana shortly after they launch.
Open → 2611.13342v1

Feed-guided shortest paths improve illicit subgraph extraction in transaction networks

Extracting Illicit-Rich Subgraph from Transaction Networks via Feed-Guided Shortest Paths

Abstract: We study investigative subgraph extraction for Anti-Money Laundering (AML) transaction graphs using the Shortest Paths Network Search Algorithm (SPNSA), which aggregates shortest paths among a small input feed of entities. Since SPNSA is highly sensitive to the feed choice, we evaluate several graph-only feed selection strategies and propose a motif-based coherent feed selection method. Experiments on the IBM-AML benchmark (HI-Small, LI-Small, HI-Medium) and the Elliptic Bitcoin transaction graph show that the proposed strategy yields markedly higher illicit ratios in the extracted subgraph than random and degree-based heuristics on Elliptic and the IBM-AML HI variants, while keeping the output compact.

Fri 9 OctSocial and Information NetworksComputational Engineering, Finance, and ScienceComputers and Society
The gist
Finding suspicious patterns in money transaction networks helps fight crime like money laundering. This paper looks at a method that extracts important parts of a network by finding shortest paths between some starting points called a feed. The authors show that picking these starting points carefully, using a new motif-based approach, leads to finding more illicit activity than random or simple methods. Their tests on real and benchmark data confirm their approach finds clearer suspicious subgraphs while keeping results manageable in size.
Open → 2610.13280v1