23 citations · 23 across the 5 of their papers we have counts for
6 papers
Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width
Panagiotis Aivasiliotis, Andreas Göbel, Matthias Lanzinger +1
The Weisfeiler--Leman (WL) algorithm is one of the most influential heuristics for the graph isomorphism problem. The expressive power of WL has been extensively studied in the con…
COMPOSITE-Stem
Kyle Waters, Lucas Nuzzi, Tadhg Looram +20
AI agents hold growing promise for accelerating scientific discovery; yet, a lack of frontier evaluations hinders adoption into real workflows. Expert-written benchmarks have prove…
IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation
Johannes Schmitt, Gergely Bérczi, Jasper Dekoninck +57
As the mathematical capabilities of large language models (LLMs) improve, it becomes increasingly important to evaluate their performance on research-level tasks at the frontier of…
Symmetric Parameterised Holants on Hypergraphs: Towards a Classification for Parameterised VCSPs
Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth
We study the complexity of the parameterised counting constraint satisfaction problem: given a set of constraints over a set of variables and a positive integer , how many ways…
Humanity's Last Exam
Long Phan, Alice Gatti, Ziwen Han +1168
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…
Parameterised Holant Problems
Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth +1
We investigate the complexity of parameterised holant problems p- for families of signatures . The parameterised holant framework was int…