English(EN) New Snake-in-the-Box Records via Snakepit Surgery and Learned Construction

新算法为蛇形盒问题创下新纪录

作者 PulseAugur 编辑部 · [1 个来源] · 2026-10-02 04:00

研究人员为蛇形盒问题创下了新纪录，在 n=9 的维度中找到了长度为 191 的蛇。这一发现改进了之前保持了 14 年的 190 长度的记录，并为 10-13 的维度设定了新的下限。这项突破是通过引入“蛇坑”来扩大搜索空间，以及一种名为 Beam Anchor 的新算法来实现的，该算法利用搜索监督的学习构造来找到长度为 190 的蛇的多种变体。 AI

影响引入了可能影响组合优化和图论未来研究的新算法和基准。

排序理由该集群描述了一篇详细介绍数学发现和算法改进的新学术论文。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.AI 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 8 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群描述了一篇详细介绍数学发现和算法改进的新学术论文。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.AI TIER_1 English(EN) · Paul Orland, Lucas Fagan, Michele Tarquini, Davide Passaro, Maksymilian Manko, Elli Heyes, Angus Gruen, Giorgi Butbaia, Justin Tan, Sergei Gukov · 2026-10-02 04:00

通过蛇坑手术和学习式构建获得的新型蛇盒记录

arXiv:2607.15270v3 Announce Type: cross 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…

本文如何被排名

报道来源 [1]

通过蛇坑手术和学习式构建获得的新型蛇盒记录

相关实体

相关话题