{
  "abstract": "The snake-in-the-box problem asks for a longest induced path in the hypercube graph $Q_n$. We find a length-191 snake in dimension $n=9$, the lowest dimension where the maximum is unknown, improving the previous record of 190 that had stood for 14 years. We also establish new lower bounds in dimensions 10-13. To find these records, we introduce snakepits, collections of disjoint snakes, to expand the search space and open new routes between snakes. This motivates our new Snakepit-in-the-Box benchmark, which seeks maximal edge counts when allowing multiple components. Finally, we introduce Beam Anchor, a search-supervised learned constructor algorithm that finds 100 inequivalent length-190 snakes in dimension 9.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2607.15270",
  "author_total": 10,
  "authors": [
    {
      "name": "Paul Orland"
    },
    {
      "name": "Lucas Fagan"
    },
    {
      "name": "Michele Tarquini"
    },
    {
      "name": "Davide Passaro"
    },
    {
      "name": "Maksymilian Manko"
    },
    {
      "name": "Elli Heyes"
    },
    {
      "name": "Angus Gruen"
    },
    {
      "name": "Giorgi Butbaia"
    },
    {
      "name": "Justin Tan"
    },
    {
      "name": "Sergei Gukov"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/0j5dh5b4jt3a7.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2607.15270",
  "fulltext_url": null,
  "id": "0j5dh5b4jt3a7",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2607.15270",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.AI"
    ],
    [
      "arxiv",
      "cs.DM"
    ],
    [
      "arxiv",
      "cs.LG"
    ],
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W7169506528",
  "pdf_url": "https://arxiv.org/pdf/2607.15270",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/0j5dh5b4jt3a7.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:26:07Z",
      "native_id": "2607.15270",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2607.15270"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "New Snake-in-the-Box Records via Snakepit Surgery and Learned Construction",
  "title_text": "New Snake-in-the-Box Records via Snakepit Surgery and Learned Construction",
  "type": "preprint",
  "updated_at": "2026-10-30T12:26:07Z",
  "url": "https://research.draconitic.com/paper/0j5dh5b4jt3a7",
  "venue": "arXiv",
  "versions": []
}