Neurosymbolic Discovery of Algebraic Graph Constructions

arXiv:2608.08118 · cs.AI, cs.LG, cs.SC, math.CO · Submitted 2026-08-08 · Read on arXiv

David Seka, Stefan Szeider

cs.AI, cs.LG, cs.SC, math.CO

Submitted: 2026-08-08

Updated: 2026-08-11

Code: https://github.com/szeider/mcp-sage

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

Benchmark — 13× in this paper · explained in 2 episodes
Verifier — 7× in this paper · explained in 2 episodes
Generator — 5× in this paper · explained in 2 episodes
LLM judge — 5× in this paper · explained in 2 episodes
Fine-Tuning — 3× in this paper · explained in 5 episodes
Agentic System — 2× in this paper · explained in 2 episodes
Augmentation — 2× in this paper · explained in 2 episodes
Embeddings — 2× in this paper · explained in 2 episodes
Graph Construction — 2× in this paper · explained in 3 episodes
Harness — 2× in this paper · explained in 2 episodes
Model Context Protocol — 2× in this paper
Structural Properties — 2× in this paper · explained in 2 episodes
Agent Harness — 1× in this paper · explained in 2 episodes
Core — 1× in this paper · explained in 2 episodes
Editor — 1× in this paper · explained in 2 episodes
Model Context Protocol (MCP) — 1× in this paper · explained in 8 episodes
Reinforcement Learning — 1× in this paper · explained in 4 episodes
Robustness — 1× in this paper · explained in 6 episodes
Trace — 1× in this paper · explained in 2 episodes
Transformer — 1× in this paper · explained in 2 episodes
Transformer Model — 1× in this paper · explained in 2 episodes

Sources

Related papers