```json
{
  "title": "Research Paper with SVG",
  "author": "",
  "site": "",
  "published": ""
}
```

This paper discusses algorithms for graph traversal. The following diagram illustrates the main data structure used in the analysis.

<svg class="diagram" viewBox="0 0 100 100" xmlns="http://www.w3.org/2000/svg"><circle cx="50" cy="50" r="40" fill="none" stroke="black"></circle><text x="50" y="55" text-anchor="middle">Node</text></svg>

The algorithm runs in O(n log n) time. We use the notation to represent the input size. This is a standard result in computer science that has been widely studied in the literature.

Additional content ensures stable content detection during testing. The SVG element above has a class attribute which would cause a crash in environments where className returns an SVGAnimatedString object.