Cover image

When Riders Become Nodes: Mapping Fraud in Ride-Hailing with Graph Neural Networks

A ride can look perfectly normal. The driver accepts a request, reaches the pickup point, and ends the trip shortly afterward. Nothing in that single transaction necessarily screams fraud. But place it beside the driver’s repeated early completions, the passengers who frequently disappear from the platform after pickup, and the same locations where similar cancellations occur, and the pattern changes. ...

January 4, 2026 · 17 min · Zelina
Cover image

Graph Crimes of the Temporal Kind: How LoReTTA Quietly Breaks Time

A fraud model does not only learn from transactions. It learns from sequence. Who interacted with whom. When. How often. After what previous event. Before which next event. In temporal graph systems, the order is not metadata. It is the thing being modelled. That is why LoReTTA is an uncomfortable paper.1 It does not argue that Temporal Graph Neural Networks can be broken only by a powerful adversary with model access, expensive surrogate training, and a theatrical pile of fake edges. It argues something more operationally annoying: a continuous-time graph can be poisoned by removing influential interactions and replacing them with plausible ones. The resulting history still looks enough like history. The model quietly learns the wrong temporal structure. Very civilised, as crimes go. ...

November 16, 2025 · 16 min · Zelina
Cover image

Fraud, Trimmed and Tagged: How Dual-Granularity Prompts Sharpen LLMs for Graph Detection

TL;DR for operators Fraud teams already know the problem: the suspicious review, shop, seller, or account is rarely suspicious in isolation. The useful evidence is scattered across neighbours — same user, same product, same rating pattern, same time window, same commercial ecosystem. The less useful evidence is also scattered there. At scale, that second pile is larger. How inconvenient. ...

July 30, 2025 · 15 min · Zelina