2 papers
cs.DS2026
Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
David Gillman, Jacob Platnick, Dana Randall
We consider the probability that a spanning tree chosen uniformly at random from a graph can be partitioned into a fixed number of trees of equal size by removing edges.…
cs.LG2026
Humanity's Last Exam
Long Phan, Alice Gatti, Ziwen Han +1144
Benchmarks are important tools for tracking the rapid advancements in large language model (LLM) capabilities. However, benchmarks are not keeping pace in difficulty: LLMs now achi…