{
  "annotation_id": "1d57ea84-03c7-4fd5-ba55-ce1630b695e1",
  "date_created": "2026-03-02T18:01:35.365000Z",
  "date_modified": "2026-03-02T18:01:35.365000Z",
  "file_hash": "006513e5cd7eb6fb624e4246356ed41d3c11438d10373fde0a054020e0972d57",
  "private": false,
  "record": {
    "abstract": "The `star paradox\u0027 in phylogenetics is the tendency for a particular resolved\ntree to be sometimes strongly supported even when the data is generated by an\nunresolved (`star\u0027) tree. There have been contrary claims as to whether this\nphenomenon persists when very long sequences are considered. This note settles\none aspect of this debate by proving mathematically that there is always a\nchance that a resolved tree could be strongly supported, even as the length of\nthe sequences becomes very large.",
    "arxiv_id": "q-bio/0611007",
    "authors": [
      "Mike Steel",
      "Frederick A. Matsen"
    ],
    "categories": [
      "q-bio.PE"
    ],
    "title": "The Bayesian `star paradox\u0027 persists for long finite sequences",
    "url": "https://arxiv.org/abs/q-bio/0611007"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "599de37c-05d4-48b4-a8b4-7e66071423c1",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}