Neurosymbolic Discovery of Algebraic Graph Constructions: Supplementary Material (NeSy 2026)

Software and experimental data backing each empirical claim in: David Seka and Stefan Szeider, "Neurosymbolic Discovery of Algebraic Graph Constructions", NeSy 2026 (20th International Conference on Neurosymbolic Learning and Reasoning), PMLR vol. 284. The archive contains: the pre-registered 100-graph benchmark of two-orbit graphs (graph6 targets and metadata); all agent run transcripts (100 capability runs, a 40-graph backbone pre-study across five models, a 50-graph symmetry-stratified reliability set, a 20-graph planted-construction recall test, and the Bernhart-Kainen case study); the verbatim system prompt and grading prompt; the two non-LLM baselines (strong template enumeration and literature lookup) with scripts and results; per-run isomorphism verification and LLM-judge grades; a human-audit package for judge calibration; and archival copies of the two released software tools. Replay instructions are in README.md (uvx mcp-minion@0.2.1; requires SageMath 10.6+ and an OpenRouter API key). The two bundled software folders are MIT-licensed, Copyright (c) 2026 Stefan Szeider, and are maintained outside this archive: mcp-sage, the SageMath MCP server (https://github.com/szeider/mcp-sage, PyPI: mcp-sage), and mcp-minion, the ReAct agent harness (https://github.com/szeider/mcp-solver, PyPI: mcp-minion). All other content is licensed CC BY 4.0.