4 citations · 12 across the 9 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.CC2026
Generalized Fibonacci gates are Frobenius algebras: a proof of Liu's conjecture
Aaron Sterling
Liu introduced generalized Fibonacci gates on domains of size 3 and 4, proved that Holant problems built from them are tractable by a cut-and-merge algorithm, and conjectured that…
cs.LO2026
Provably Auditable and Safe LLM Agents from Human-Authored Ontologies
Aaron Sterling
We introduce the LLM agent architecture Agentic Redux, intended for use with nontrivial problem domains that require linear auditability. Using the typed lambda calculus, we prove…