{
  "$type": "site.standard.document",
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2602.04694v1",
  "publishedAt": "2026-02-05T01:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Maya Le",
    "Paweł Prałat",
    "Aaron Smith",
    "François Théberge"
  ],
  "textContent": "**Authors:** Maya Le, Paweł Prałat, Aaron Smith, François Théberge\n\nMotivated by applications in cybersecurity such as finding meaningful sequences of malware-related events buried inside large amounts of computer log data, we introduce the \"planted path\" problem and propose an algorithm to find fuzzy matchings between two trees. This algorithm can be used as a \"building block\" for more complicated workflows. We demonstrate usefulness of a few of such workflows in mining synthetically generated data as well as real-world ACME cybersecurity datasets.",
  "title": "The Needle is a Thread: Finding Planted Paths in Noisy Process Trees"
}