pi-jev-router
A minimal Pareto-optimal OpenRouter model router for pi, based on Jev
14 ★ on GitHub
What it is
The router ranks the whole OpenRouter catalog for each task. It filters the catalog to models that fit the task, computes a Pareto frontier over quality, cost and latency, then picks the knee point. The knee is the frontier member farthest from the chord that joins the cheapest and dearest models. It needs no weights, so the pick follows the catalog and the recorded evidence on every task. A front
Where the decision sits
pi-jev-router runs its own weights or its own runtime rather than calling a hosted API, so its decisions do not depend on a vendor being up or on a key being funded. The trade is that the model is now yours to keep current.
How active it is
Created 2026-09-20, last pushed 2026-09-20, 14 stars and 0 forks when we read it on 2026-09-20. Everything in this category is weeks old at most, so a stale push date means something different here than it would on a mature project. Check the repository before you depend on it.
What we have not checked
Whether it works. We have not run this project, measured the model behind it, or verified any performance claim in its README. This page records what the repository says about itself, read on 2026-09-20. The one model we have measured end to end is Jev.
Find out what your data actually supports
We turn your historical decisions into a frozen test set, then tell you which model, which threshold, and how much of it you can safely automate.