PlanCompiler uses a typed node registry, static validation, and deterministic compilation to reach 278/300 successes on structured LLM pipeline benchmarks, outperforming GPT-4.1 and Claude Sonnet baselines at lower cost.
Llamaindex, 2026
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SE 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
PlanCompiler: A Deterministic Compilation Architecture for Structured Multi-Step LLM Pipelines
PlanCompiler uses a typed node registry, static validation, and deterministic compilation to reach 278/300 successes on structured LLM pipeline benchmarks, outperforming GPT-4.1 and Claude Sonnet baselines at lower cost.