@claudexor/arbitration 1.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 joi-lab
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,7 @@
+# @claudexor/arbitration
+
+Internal package of [Claudexor](https://github.com/razzant/claudexor) — Evidence-first arbitration: rank candidates on typed gate/review evidence, pairwise tie-breaks, DecisionRecord.
+
+Published as part of the Claudexor toolchain; it follows the monorepo's
+lockstep version and has no separate semver contract. Use the `claudexor`
+CLI (or `@claudexor/cli`) as the supported entry point.

package/dist/arbitration.d.ts

@@ -0,0 +1,51 @@
+import type { DecisionRecord, GateResult, PairwiseComparison, ReviewFinding } from "@claudexor/schema";
+/** Evidence assembled for one tournament candidate. */
+export interface CandidateEvidence {
+    attemptId: string;
+    /** Anonymized label shown to the arbiter (e.g. "Candidate A"). */
+    label: string;
+    gates: GateResult[];
+    acceptanceCovered: string[];
+    acceptanceTotal: number;
+    findings: ReviewFinding[];
+    testsPassed: number;
+    testsTotal: number;
+    finalReviewClean: boolean;
+    reviewVerified?: boolean;
+    /** Non-blocking tool hygiene warnings from the engine-owned attempt outcome. */
+    toolWarningsCount?: number;
+    /** Smaller = simpler (e.g. diff line count). */
+    diffSize?: number;
+    diffBytes?: number;
+    costUsd?: number;
+}
+/** Higher is better, compared lexicographically (evidence-first ordering). */
+export declare function scoreTuple(c: CandidateEvidence): number[];
+/** Compare two candidates (best-first): negative if `a` should rank ahead of `b`. */
+export declare function compareCandidates(a: CandidateEvidence, b: CandidateEvidence): number;
+export interface CandidateSummary {
+    gatesPassed: boolean;
+    blockers: number;
+    acceptance: number;
+    testFraction: number;
+    clean: boolean;
+}
+export declare function candidateSummary(c: CandidateEvidence): CandidateSummary;
+export interface ArbitrationResult {
+    ranking: CandidateEvidence[];
+    decision: DecisionRecord;
+    pairwise: PairwiseComparison[];
+}
+/**
+ * Evidence-first arbitration. Ranks candidates lexicographically by hard gates,
+ * acceptance coverage, accepted blockers, tests, clean
+ * review, simplicity, cost. When the top two candidates are an EXACT
+ * tie on every evidence axis, the winner is chosen deterministically by route
+ * order and that tie is DISCLOSED in the decision (final_checks) — there is no
+ * hidden LLM tie-break, so the choice is never silently presented as decisive.
+ */
+export declare function arbitrate(candidates: CandidateEvidence[], opts?: {
+    spendUsd?: number | null;
+    estimatedSpend?: boolean;
+}): ArbitrationResult;
+//# sourceMappingURL=arbitration.d.ts.map

package/dist/arbitration.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arbitration.d.ts","sourceRoot":"","sources":["../src/arbitration.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,UAAU,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAGvG,uDAAuD;AACvD,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE,aAAa,EAAE,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,gBAAgB,EAAE,OAAO,CAAC;IAC1B,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,gFAAgF;IAChF,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,gDAAgD;IAChD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AA+CD,8EAA8E;AAC9E,wBAAgB,UAAU,CAAC,CAAC,EAAE,iBAAiB,GAAG,MAAM,EAAE,CAWzD;AAWD,qFAAqF;AACrF,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,iBAAiB,EAAE,CAAC,EAAE,iBAAiB,GAAG,MAAM,CAEpF;AAED,MAAM,WAAW,gBAAgB;IAC/B,WAAW,EAAE,OAAO,CAAC;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE,OAAO,CAAC;CAChB;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,iBAAiB,GAAG,gBAAgB,CAQvE;AAED,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,iBAAiB,EAAE,CAAC;IAC7B,QAAQ,EAAE,cAAc,CAAC;IACzB,QAAQ,EAAE,kBAAkB,EAAE,CAAC;CAChC;AA0DD;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,UAAU,EAAE,iBAAiB,EAAE,EAC/B,IAAI,GAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,cAAc,CAAC,EAAE,OAAO,CAAA;CAAO,GAChE,iBAAiB,CAoInB"}

package/dist/arbitration.js

@@ -0,0 +1,262 @@
+import { DecisionRecord as DecisionRecordSchema, isBlocking } from "@claudexor/schema";
+function requiredGatesPassed(c) {
+    const required = c.gates.filter((g) => g.required);
+    return required.length === 0 ? true : required.every((g) => g.status === "passed");
+}
+/**
+ * Acceptance coverage fraction. Zero configured success criteria is zero
+ * acceptance EVIDENCE (0, never a vacuous 1), mirroring `effectiveTestFraction`.
+ * Since all candidates in a tournament share one contract, a 0 here is a neutral
+ * tie axis (no relative penalty) — it only removes the false "100%" claim.
+ */
+function acceptanceFraction(c) {
+    return c.acceptanceTotal > 0 ? c.acceptanceCovered.length / c.acceptanceTotal : 0;
+}
+/** Human label for gate-derived criteria coverage: honest "n/a" when no
+ * criteria exist. Named gates_coverage in decision strings: the
+ * number is a PROXY derived from the deterministic gates (all criteria
+ * count as covered only when gates pass), not independent per-criterion
+ * acceptance evidence. */
+function acceptanceLabel(c) {
+    return c.acceptanceTotal > 0 ? `${(acceptanceFraction(c) * 100).toFixed(0)}%` : "n/a";
+}
+function openBlockerCount(c) {
+    return c.findings.filter((f) => isBlocking(f)).length;
+}
+/**
+ * Test pass-fraction. Zero configured tests is zero test EVIDENCE (0, never a
+ * vacuous 1): a candidate with no tests must not score "100%" in rankings or
+ * user-facing decision strings. (The held-out split axis was retired in the
+ * v0.15 triage: no producer ever populated it — re-add WITH a real held-out
+ * runner if that anti-reward-hacking design returns.)
+ */
+function effectiveTestFraction(c) {
+    return c.testsTotal > 0 ? c.testsPassed / c.testsTotal : 0;
+}
+/** Human label for test evidence: honest "n/a" when no tests exist at all. */
+function testEvidenceLabel(c) {
+    if (c.testsTotal === 0)
+        return "n/a";
+    return `${(effectiveTestFraction(c) * 100).toFixed(0)}%`;
+}
+/** Higher is better, compared lexicographically (evidence-first ordering). */
+export function scoreTuple(c) {
+    return [
+        requiredGatesPassed(c) ? 1 : 0, // hard gates
+        acceptanceFraction(c), // acceptance coverage
+        -openBlockerCount(c), // fewer accepted blockers
+        effectiveTestFraction(c), // deterministic test pass fraction
+        c.finalReviewClean ? 1 : 0, // final clean review
+        -(c.toolWarningsCount ?? 0), // cleaner tool hygiene
+        -(c.diffSize ?? 0), // simplicity
+        -(c.costUsd ?? 0), // cost
+    ];
+}
+function compareTuples(a, b) {
+    for (let i = 0; i < Math.max(a.length, b.length); i++) {
+        const av = a[i] ?? 0;
+        const bv = b[i] ?? 0;
+        if (av !== bv)
+            return av > bv ? -1 : 1; // sort best-first
+    }
+    return 0;
+}
+/** Compare two candidates (best-first): negative if `a` should rank ahead of `b`. */
+export function compareCandidates(a, b) {
+    return compareTuples(scoreTuple(a), scoreTuple(b));
+}
+export function candidateSummary(c) {
+    return {
+        gatesPassed: requiredGatesPassed(c),
+        blockers: openBlockerCount(c),
+        acceptance: acceptanceFraction(c),
+        testFraction: effectiveTestFraction(c),
+        clean: c.finalReviewClean,
+    };
+}
+const CRITERIA = [
+    {
+        key: "gates",
+        better: (a, b) => requiredGatesPassed(a) === requiredGatesPassed(b) ? "tie" : requiredGatesPassed(a) ? "a" : "b",
+    },
+    {
+        key: "gates_coverage",
+        better: (a, b) => acceptanceFraction(a) === acceptanceFraction(b) ? "tie" : acceptanceFraction(a) > acceptanceFraction(b) ? "a" : "b",
+    },
+    {
+        key: "blockers",
+        better: (a, b) => openBlockerCount(a) === openBlockerCount(b) ? "tie" : openBlockerCount(a) < openBlockerCount(b) ? "a" : "b",
+    },
+    {
+        key: "tests",
+        better: (a, b) => effectiveTestFraction(a) === effectiveTestFraction(b)
+            ? "tie"
+            : effectiveTestFraction(a) > effectiveTestFraction(b)
+                ? "a"
+                : "b",
+    },
+];
+/** Concrete per-criterion evidence values, so the persisted pairwise reason
+ * says WHAT differed (not just which axis name was consulted). */
+function criterionValue(key, c) {
+    switch (key) {
+        case "gates":
+            return requiredGatesPassed(c) ? "required gates passed" : "required gates FAILED";
+        case "gates_coverage":
+            return `acceptance ${(acceptanceFraction(c) * 100).toFixed(0)}%`;
+        case "blockers":
+            return `${openBlockerCount(c)} open blocker(s)`;
+        case "tests":
+            return `tests ${testEvidenceLabel(c)}`;
+        default:
+            return key;
+    }
+}
+function pairwise(a, b) {
+    const criteria = {};
+    for (const c of CRITERIA) {
+        const winner = c.better(a, b);
+        criteria[c.key] = {
+            winner,
+            reason: `${a.label}: ${criterionValue(c.key, a)} vs ${b.label}: ${criterionValue(c.key, b)}`,
+        };
+    }
+    return { candidate_a: a.label, candidate_b: b.label, criteria };
+}
+/**
+ * Evidence-first arbitration. Ranks candidates lexicographically by hard gates,
+ * acceptance coverage, accepted blockers, tests, clean
+ * review, simplicity, cost. When the top two candidates are an EXACT
+ * tie on every evidence axis, the winner is chosen deterministically by route
+ * order and that tie is DISCLOSED in the decision (final_checks) — there is no
+ * hidden LLM tie-break, so the choice is never silently presented as decisive.
+ */
+export function arbitrate(candidates, opts = {}) {
+    if (candidates.length === 0) {
+        return {
+            ranking: [],
+            decision: DecisionRecordSchema.parse({
+                winner: null,
+                status: "failed",
+                outcome: "blocked",
+                why_winner: "no candidates",
+                evidence_facts: ["no candidates were produced"],
+                apply_recommendation: "continue",
+            }),
+            pairwise: [],
+        };
+    }
+    const ranking = [...candidates].sort((a, b) => compareTuples(scoreTuple(a), scoreTuple(b)));
+    const winner = ranking[0];
+    const runnerUp = ranking[1];
+    // An exact tie on every evidence axis: the winner is the first in route order.
+    // Disclose it instead of presenting the pick as evidence-decisive.
+    const tiedWithRunnerUp = runnerUp ? compareTuples(scoreTuple(winner), scoreTuple(runnerUp)) === 0 : false;
+    const requiredOk = requiredGatesPassed(winner);
+    const blockerCount = openBlockerCount(winner);
+    const winnerOk = requiredOk && winner.finalReviewClean && blockerCount === 0;
+    const noOpOk = requiredOk && blockerCount === 0;
+    const hasDiff = (winner.diffBytes ?? winner.diffSize ?? 0) > 0;
+    const hasGates = winner.testsTotal > 0 || winner.gates.length > 0;
+    const reviewRan = winner.reviewVerified === true;
+    // A clean, route-proof-VERIFIED cross-family review is real verification even
+    // when no deterministic test gate is configured. `reviewRan` already
+    // requires crossFamilyVerified (observed route proofs, §5), so this never
+    // adopts an unobserved/argv-echo review. The patch-hash binding is enforced
+    // separately by the apply gate.
+    const reviewCleanVerified = reviewRan && winner.finalReviewClean && blockerCount === 0;
+    const harnessFailed = winner.gates.some((g) => g.id === "harness" && g.status === "failed");
+    const outcome = harnessFailed
+        ? "blocked"
+        : !hasDiff
+            ? noOpOk
+                ? "no_op"
+                : "blocked"
+            : !hasGates
+                ? reviewCleanVerified
+                    ? "ready"
+                    : "ungated"
+                : !reviewRan
+                    ? "review_not_run"
+                    : winnerOk
+                        ? "ready"
+                        : "blocked";
+    // Honest disclosure of WHAT verified an applyable run. "both" requires a
+    // DETERMINISTIC gate — a real test count or a REQUIRED gate that passed — not
+    // mere gate presence (a non-required/diagnostic gate must not read as "tests
+    // passed"). A no-gate run adopted on review evidence is cross_family_review.
+    const gateVerified = (winner.testsTotal > 0 && winner.testsPassed === winner.testsTotal) || winner.gates.some((g) => g.required && g.status === "passed");
+    const verificationBasis = outcome === "ready" ? (gateVerified ? "both" : "cross_family_review") : "none";
+    const status = harnessFailed
+        ? "failed"
+        : outcome === "ready"
+            ? "success"
+            : outcome === "no_op"
+                ? "no_op"
+                : outcome === "ungated"
+                    ? "ungated"
+                    : outcome === "review_not_run"
+                        ? "review_not_run"
+                        : "not_converged";
+    const whyNot = {};
+    for (const c of ranking.slice(1)) {
+        const reasons = [];
+        if (!requiredGatesPassed(c))
+            reasons.push("required gates not all passing");
+        if (openBlockerCount(c) > 0)
+            reasons.push(`${openBlockerCount(c)} open blocker(s)`);
+        if (acceptanceFraction(c) < acceptanceFraction(winner))
+            reasons.push("lower gates-derived criteria coverage");
+        if (effectiveTestFraction(c) < effectiveTestFraction(winner))
+            reasons.push("weaker test evidence");
+        if (!c.finalReviewClean)
+            reasons.push("no clean final review");
+        whyNot[c.label] = reasons.length > 0 ? reasons.join("; ") : "narrowly behind on tie-breakers";
+    }
+    const acceptedRisks = winner.findings
+        .filter((f) => f.status === "accepted_risk")
+        .map((f) => f.claim);
+    const decision = DecisionRecordSchema.parse({
+        winner: winner.attemptId,
+        status,
+        outcome,
+        why_winner: `${winner.label}: gates=${requiredGatesPassed(winner)}, gates_coverage=${acceptanceLabel(winner)}, blockers=${openBlockerCount(winner)}, tests=${testEvidenceLabel(winner)}, cleanReview=${winner.finalReviewClean}`,
+        why_not_others: whyNot,
+        accepted_risks: acceptedRisks,
+        final_checks: [
+            `required gates ${requiredGatesPassed(winner) ? "passed" : "FAILED"}`,
+            `final cross-family review ${winner.finalReviewClean ? "clean" : "not clean"}`,
+            ...(tiedWithRunnerUp
+                ? [`tie: winner chosen by route order (no distinguishing evidence vs ${runnerUp?.label ?? "runner-up"})`]
+                : []),
+        ],
+        evidence_facts: [
+            `diff ${hasDiff ? "non-empty" : "empty"}`,
+            `gates ${hasGates ? "configured" : "not configured"}`,
+            `review ${reviewRan ? "verified" : "not verified"}`,
+            `blockers ${openBlockerCount(winner)}`,
+        ],
+        budget_summary: {
+            spend_usd: opts.spendUsd ?? winner.costUsd ?? null,
+            estimated: opts.estimatedSpend ?? false,
+        },
+        apply_recommendation: outcome === "ready"
+            ? "apply"
+            : outcome === "no_op"
+                ? "inspect"
+                : outcome === "ungated" || outcome === "review_not_run"
+                    ? "human_review"
+                    : openBlockerCount(winner) > 0
+                        ? "human_review"
+                        : "continue",
+        verification_basis: verificationBasis,
+    });
+    const pairs = [];
+    for (let i = 0; i < ranking.length; i++) {
+        for (let j = i + 1; j < ranking.length; j++) {
+            pairs.push(pairwise(ranking[i], ranking[j]));
+        }
+    }
+    return { ranking, decision, pairwise: pairs };
+}
+//# sourceMappingURL=arbitration.js.map

package/dist/arbitration.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arbitration.js","sourceRoot":"","sources":["../src/arbitration.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,IAAI,oBAAoB,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAuBvF,SAAS,mBAAmB,CAAC,CAAoB;IAC/C,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACnD,OAAO,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;AACrF,CAAC;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CAAC,CAAoB;IAC9C,OAAO,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;AACpF,CAAC;AAED;;;;0BAI0B;AAC1B,SAAS,eAAe,CAAC,CAAoB;IAC3C,OAAO,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;AACxF,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAoB;IAC5C,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;AACxD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,qBAAqB,CAAC,CAAoB;IACjD,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,8EAA8E;AAC9E,SAAS,iBAAiB,CAAC,CAAoB;IAC7C,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACrC,OAAO,GAAG,CAAC,qBAAqB,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;AAC3D,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,UAAU,CAAC,CAAoB;IAC7C,OAAO;QACL,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa;QAC7C,kBAAkB,CAAC,CAAC,CAAC,EAAE,sBAAsB;QAC7C,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,0BAA0B;QAChD,qBAAqB,CAAC,CAAC,CAAC,EAAE,mCAAmC;QAC7D,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,qBAAqB;QACjD,CAAC,CAAC,CAAC,CAAC,iBAAiB,IAAI,CAAC,CAAC,EAAE,uBAAuB;QACpD,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,EAAE,aAAa;QACjC,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE,OAAO;KAC3B,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,CAAW,EAAE,CAAW;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACtD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB;IAC5D,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,iBAAiB,CAAC,CAAoB,EAAE,CAAoB;IAC1E,OAAO,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;AACrD,CAAC;AAUD,MAAM,UAAU,gBAAgB,CAAC,CAAoB;IACnD,OAAO;QACL,WAAW,EAAE,mBAAmB,CAAC,CAAC,CAAC;QACnC,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAC;QAC7B,UAAU,EAAE,kBAAkB,CAAC,CAAC,CAAC;QACjC,YAAY,EAAE,qBAAqB,CAAC,CAAC,CAAC;QACtC,KAAK,EAAE,CAAC,CAAC,gBAAgB;KAC1B,CAAC;AACJ,CAAC;AAQD,MAAM,QAAQ,GAAiG;IAC7G;QACE,GAAG,EAAE,OAAO;QACZ,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACf,mBAAmB,CAAC,CAAC,CAAC,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;KACjG;IACD;QACE,GAAG,EAAE,gBAAgB;QACrB,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACf,kBAAkB,CAAC,CAAC,CAAC,KAAK,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;KACtH;IACD;QACE,GAAG,EAAE,UAAU;QACf,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACf,gBAAgB,CAAC,CAAC,CAAC,KAAK,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;KAC9G;IACD;QACE,GAAG,EAAE,OAAO;QACZ,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACf,qBAAqB,CAAC,CAAC,CAAC,KAAK,qBAAqB,CAAC,CAAC,CAAC;YACnD,CAAC,CAAC,KAAK;YACP,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,GAAG,qBAAqB,CAAC,CAAC,CAAC;gBACnD,CAAC,CAAC,GAAG;gBACL,CAAC,CAAC,GAAG;KACZ;CACF,CAAC;AAEF;kEACkE;AAClE,SAAS,cAAc,CAAC,GAAW,EAAE,CAAoB;IACvD,QAAQ,GAAG,EAAE,CAAC;QACZ,KAAK,OAAO;YACV,OAAO,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,uBAAuB,CAAC;QACpF,KAAK,gBAAgB;YACnB,OAAO,cAAc,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;QACnE,KAAK,UAAU;YACb,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,kBAAkB,CAAC;QAClD,KAAK,OAAO;YACV,OAAO,SAAS,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;QACzC;YACE,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,CAAoB,EAAE,CAAoB;IAC1D,MAAM,QAAQ,GAAmC,EAAE,CAAC;IACpD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG;YAChB,MAAM;YACN,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,KAAK,cAAc,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,KAAK,cAAc,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE;SAC7F,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC;AAClE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CACvB,UAA+B,EAC/B,OAA+D,EAAE;IAEjE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO;YACL,OAAO,EAAE,EAAE;YACX,QAAQ,EAAE,oBAAoB,CAAC,KAAK,CAAC;gBACnC,MAAM,EAAE,IAAI;gBACZ,MAAM,EAAE,QAAQ;gBAChB,OAAO,EAAE,SAAS;gBAClB,UAAU,EAAE,eAAe;gBAC3B,cAAc,EAAE,CAAC,6BAA6B,CAAC;gBAC/C,oBAAoB,EAAE,UAAU;aACjC,CAAC;YACF,QAAQ,EAAE,EAAE;SACb,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAsB,CAAC;IAC/C,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAC5B,+EAA+E;IAC/E,mEAAmE;IACnE,MAAM,gBAAgB,GAAG,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAE1G,MAAM,UAAU,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC;IAC/C,MAAM,YAAY,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,UAAU,IAAI,MAAM,CAAC,gBAAgB,IAAI,YAAY,KAAK,CAAC,CAAC;IAC7E,MAAM,MAAM,GAAG,UAAU,IAAI,YAAY,KAAK,CAAC,CAAC;IAChD,MAAM,OAAO,GAAG,CAAC,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/D,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAClE,MAAM,SAAS,GAAG,MAAM,CAAC,cAAc,KAAK,IAAI,CAAC;IACjD,8EAA8E;IAC9E,qEAAqE;IACrE,0EAA0E;IAC1E,4EAA4E;IAC5E,gCAAgC;IAChC,MAAM,mBAAmB,GAAG,SAAS,IAAI,MAAM,CAAC,gBAAgB,IAAI,YAAY,KAAK,CAAC,CAAC;IACvF,MAAM,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;IAC5F,MAAM,OAAO,GACX,aAAa;QACX,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,CAAC,OAAO;YACR,CAAC,CAAC,MAAM;gBACN,CAAC,CAAC,OAAO;gBACT,CAAC,CAAC,SAAS;YACf,CAAC,CAAC,CAAC,QAAQ;gBACT,CAAC,CAAC,mBAAmB;oBACnB,CAAC,CAAC,OAAO;oBACT,CAAC,CAAC,SAAS;gBACb,CAAC,CAAC,CAAC,SAAS;oBACV,CAAC,CAAC,gBAAgB;oBAClB,CAAC,CAAC,QAAQ;wBACR,CAAC,CAAC,OAAO;wBACT,CAAC,CAAC,SAAS,CAAC;IACtB,yEAAyE;IACzE,8EAA8E;IAC9E,6EAA6E;IAC7E,6EAA6E;IAC7E,MAAM,YAAY,GAAG,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,IAAI,MAAM,CAAC,WAAW,KAAK,MAAM,CAAC,UAAU,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;IAC1J,MAAM,iBAAiB,GAAG,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACzG,MAAM,MAAM,GACV,aAAa;QACX,CAAC,CAAC,QAAQ;QACV,CAAC,CAAC,OAAO,KAAK,OAAO;YACrB,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,OAAO,KAAK,OAAO;gBACnB,CAAC,CAAC,OAAO;gBACT,CAAC,CAAC,OAAO,KAAK,SAAS;oBACrB,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,OAAO,KAAK,gBAAgB;wBAC5B,CAAC,CAAC,gBAAgB;wBAClB,CAAC,CAAC,eAAe,CAAC;IAE5B,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;QAC5E,IAAI,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC;QACpF,IAAI,kBAAkB,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,uCAAuC,CAAC,CAAC;QAC9G,IAAI,qBAAqB,CAAC,CAAC,CAAC,GAAG,qBAAqB,CAAC,MAAM,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;QACnG,IAAI,CAAC,CAAC,CAAC,gBAAgB;YAAE,OAAO,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;QAC/D,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,iCAAiC,CAAC;IAChG,CAAC;IAED,MAAM,aAAa,GAAG,MAAM,CAAC,QAAQ;SAClC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,eAAe,CAAC;SAC3C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAEvB,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAK,CAAC;QAC1C,MAAM,EAAE,MAAM,CAAC,SAAS;QACxB,MAAM;QACN,OAAO;QACP,UAAU,EAAE,GAAG,MAAM,CAAC,KAAK,WAAW,mBAAmB,CAAC,MAAM,CAAC,oBAAoB,eAAe,CAAC,MAAM,CAAC,cAAc,gBAAgB,CAAC,MAAM,CAAC,WAAW,iBAAiB,CAAC,MAAM,CAAC,iBAAiB,MAAM,CAAC,gBAAgB,EAAE;QAChO,cAAc,EAAE,MAAM;QACtB,cAAc,EAAE,aAAa;QAC7B,YAAY,EAAE;YACZ,kBAAkB,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,EAAE;YACrE,6BAA6B,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,EAAE;YAC9E,GAAG,CAAC,gBAAgB;gBAClB,CAAC,CAAC,CAAC,oEAAoE,QAAQ,EAAE,KAAK,IAAI,WAAW,GAAG,CAAC;gBACzG,CAAC,CAAC,EAAE,CAAC;SACR;QACD,cAAc,EAAE;YACd,QAAQ,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,EAAE;YACzC,SAAS,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,gBAAgB,EAAE;YACrD,UAAU,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,cAAc,EAAE;YACnD,YAAY,gBAAgB,CAAC,MAAM,CAAC,EAAE;SACvC;QACD,cAAc,EAAE;YACd,SAAS,EAAE,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,OAAO,IAAI,IAAI;YAClD,SAAS,EAAE,IAAI,CAAC,cAAc,IAAI,KAAK;SACxC;QACD,oBAAoB,EAClB,OAAO,KAAK,OAAO;YACjB,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,OAAO,KAAK,OAAO;gBACnB,CAAC,CAAC,SAAS;gBACX,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,gBAAgB;oBACrD,CAAC,CAAC,cAAc;oBAChB,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC,GAAG,CAAC;wBAC5B,CAAC,CAAC,cAAc;wBAChB,CAAC,CAAC,UAAU;QACtB,kBAAkB,EAAE,iBAAiB;KACtC,CAAC,CAAC;IAEH,MAAM,KAAK,GAAyB,EAAE,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAsB,EAAE,OAAO,CAAC,CAAC,CAAsB,CAAC,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AAChD,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,2 @@
+export * from "./arbitration.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC"}

package/dist/index.js

@@ -0,0 +1,2 @@
+export * from "./arbitration.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC"}

package/package.json

@@ -0,0 +1,40 @@
+{
+  "name": "@claudexor/arbitration",
+  "version": "1.0.0",
+  "license": "MIT",
+  "description": "Evidence-first arbitration: rank candidates on typed gate/review evidence, pairwise tie-breaks, DecisionRecord.",
+  "type": "module",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "dependencies": {
+    "@claudexor/schema": "1.0.0"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/razzant/claudexor.git",
+    "directory": "packages/arbitration"
+  },
+  "homepage": "https://github.com/razzant/claudexor#readme",
+  "bugs": {
+    "url": "https://github.com/razzant/claudexor/issues"
+  },
+  "engines": {
+    "node": ">=20.19"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "tsc",
+    "typecheck": "tsc --noEmit"
+  }
+}