@tangle-network/agent-eval 1.0.19 → 1.0.21

package/dist/{matrix-Yg1lHIGI.d.ts → matrix-C-GxIgeJ.d.ts}

@@ -1,5 +1,5 @@
 import { u as CostProvenance } from "./cost-ledger-Czro9wmo.js";
-import { C as JudgeDimension, w as JudgeScore } from "./types-wDBk14lj.js";
+import { C as JudgeDimension, w as JudgeScore } from "./types-ip2D3-Ib.js";
 import { o as MatrixResult } from "./index-DwUGehqX.js";
 import { AgentProfile } from "@tangle-network/agent-interface";
 interface MultishotMessage {
@@ -381,4 +381,4 @@ interface RunMultishotMatrixResult {
 }
 declare function runMultishotMatrix<TPersona extends MultishotPersona>(opts: RunMultishotMatrixOptions<TPersona>): Promise<RunMultishotMatrixResult>;
 export { MultishotTransportRequest as A, MultishotMessage as C, MultishotToolDefinition as D, MultishotShape as E, MultishotTransportToolCall as M, assertMultishotShotResult as N, MultishotToolExecutor as O, MultishotFatalToolError as S, MultishotResult as T, renderDimensions as _, MultishotCellOutput as a, MultishotArtifact as b, RunMultishotMatrixResult as c, MultishotShot as d, RunMultishotOptions as f, MultishotJudgeConfig as g, JudgeRunResult as h, ConversationJudgeInput as i, MultishotTransportResponse as j, MultishotTransport as k, computeCellComposite as l, DEFAULT_JUDGE_MODEL as m, CellCompositeInput as n, MultishotJudges as o, runMultishot as p, CellCompositeScore as r, RunMultishotMatrixOptions as s, ArtifactJudgeInput as t, runMultishotMatrix as u, renderJsonFooter as v, MultishotPersona as w, MultishotDriverEmptyError as x, runJudge as y };
-//# sourceMappingURL=matrix-Yg1lHIGI.d.ts.map
+//# sourceMappingURL=matrix-C-GxIgeJ.d.ts.map

package/dist/{matrix-Yg1lHIGI.d.ts.map → matrix-C-GxIgeJ.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"matrix-Yg1lHIGI.d.ts","names":[],"sources":["../src/multishot/types.ts","../src/multishot/judges.ts","../src/multishot/multishot.ts","../src/multishot/matrix.ts"],"mappings":";;;;UAIiB;EACf;EACA;EACA;EACA,YAAY;IAAQ;IAAY;IAAc,MAAM;;;UAGrC;EACf;EACA;EACA;IAAc;IAAc,MAAM;;EAClC;;UAGe;EACf,YAAY;EACZ,WAAW;EACX;EACA;;;EAGA;;;;;;;;EAQA,iBAAiB;;UAGF;EACf;EACA;IACE;IACA;IACA,YAAY;;;;;;UAOC;EACf;EACA,UAAU,MAAM;EAChB,QAAQ;EACR;EACA;EACA,SAAS;;UAGM;EACf;EACA;EACA;IAAY;IAAc;;;UAGX;EACf;IAAW;IAAyB,aAAa;;EACjD;IAAU;IAAwB;;;;EAGlC;;;;EAIA;;;;;;;;KASU,sBACV,KAAK,8BACF,QAAQ;KAED,yBACV,MAAM,yBACN;;EAEE,WAAW;EACX,SAAS;MAER;EAAU;EAAiB;;UAEf;;EAEf;;GAEC;;;;;;;;UASc,eAAe,iBAAiB;;EAE/C,eAAe,SAAS;;;EAGxB,2BAA2B,SAAS;;cAGzB,kCAAkC;WACjB;EAAA,YAAA;;cAMjB,gCAAgC;EAC/B,YAAA;;;;;;;;;;;;;;;;;;;iBAgCE,0BAA0B,yBAAyB,SAAS;cCvI/D;UAEI,qBAAqB;;EAEpC;;;EAGA,WAAW;;EAEX;;EAEA,YAAY;;EAEZ;;;EAGA,cAAc,OAAO;;EAErB;;UAGe;;EAEf,OAAO;;EAEP,MAAM;;iBAGc,SAAS,QAC7B,OAAO,qBAAqB,SAC5B,OAAO,SACN,QAAQ;;;iBAsIK,iBAAiB,eAAe;;iBAKhC,iBAAiB,eAAe;UCxK/B,oBAAoB,iBAAiB;EACpD,SAAS;EACT,SAAS;;;EAGT,QAAQ,eAAe;;EAEvB,QAAQ;;EAER,gBAAgB,eAAe;;;;EAI/B,mBAAmB;EACnB;EACA;EACA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;EAGA,gBAAgB;;;;EAIhB,iBAAiB;;;EAGjB,gBAAgB;EAChB,SAAS;;;;;;;;;;;KAYC,cAAc,iBAAiB,qBACzC,MAAM,oBAAoB,cACvB,QAAQ;;;;;;;;;;;;;;;;;iBAkBS,aAAa,iBAAiB,kBAClD,MAAM,oBAAoB,YACzB,QAAQ;UClEM,uBAAuB,iBAAiB;EACvD,YAAY;EACZ,SAAS;;UAGM,mBAAmB,iBAAiB;EACnD,UAAU;EACV,SAAS;;UAGM,gBAAgB,iBAAiB;;EAEhD,cAAc,qBAAqB,uBAAuB;;EAE1D,aAAa,qBAAqB,mBAAmB;;EAErD,iBAAiB,qBAAqB,mBAAmB;;EAEzD;;EAEA;;UAGe;EACf;EACA,cAAc;EACd;IACE,aAAa,MAAM;MAAe;MAAc;;IAChD;;EAEF;IACE,aAAa,MAAM;MAAe;MAAc;;IAChD;;;UAIa,0BAA0B,iBAAiB;;EAE1D,UAAU;IAAQ;IAAY,OAAO;;;EAErC,UAAU;;;EAGV,QAAQ,eAAe;;EAEvB,QAAQ,gBAAgB;;EAExB,QAAQ;;EAER,gBAAgB,eAAe;;EAE/B,mBAAmB;;EAEnB;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;EAIA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;EAIA,gBAAgB;;EAEhB,iBAAiB;;;EAGjB,gBAAgB;;;;;;;;;;;;;;;EAehB,UAAU,cAAc;;;;;UAMT;EACf;EACA;EACA;;UAoBe;EACf,cAAc;;EAEd,cAAc,cAAc;;EAE5B,iBAAiB,cAAc;;;;;;;iBAQjB,qBAAqB,OAAO;EAC1C;EACA;EACA;EACA;;UAuBe;EACf,QAAQ,aAAa;;iBAGD,mBAAmB,iBAAiB,kBACxD,MAAM,0BAA0B,YAC/B,QAAQ"}
+{"version":3,"file":"matrix-C-GxIgeJ.d.ts","names":[],"sources":["../src/multishot/types.ts","../src/multishot/judges.ts","../src/multishot/multishot.ts","../src/multishot/matrix.ts"],"mappings":";;;;UAIiB;EACf;EACA;EACA;EACA,YAAY;IAAQ;IAAY;IAAc,MAAM;;;UAGrC;EACf;EACA;EACA;IAAc;IAAc,MAAM;;EAClC;;UAGe;EACf,YAAY;EACZ,WAAW;EACX;EACA;;;EAGA;;;;;;;;EAQA,iBAAiB;;UAGF;EACf;EACA;IACE;IACA;IACA,YAAY;;;;;;UAOC;EACf;EACA,UAAU,MAAM;EAChB,QAAQ;EACR;EACA;EACA,SAAS;;UAGM;EACf;EACA;EACA;IAAY;IAAc;;;UAGX;EACf;IAAW;IAAyB,aAAa;;EACjD;IAAU;IAAwB;;;;EAGlC;;;;EAIA;;;;;;;;KASU,sBACV,KAAK,8BACF,QAAQ;KAED,yBACV,MAAM,yBACN;;EAEE,WAAW;EACX,SAAS;MAER;EAAU;EAAiB;;UAEf;;EAEf;;GAEC;;;;;;;;UASc,eAAe,iBAAiB;;EAE/C,eAAe,SAAS;;;EAGxB,2BAA2B,SAAS;;cAGzB,kCAAkC;WACjB;EAAA,YAAA;;cAMjB,gCAAgC;EAC/B,YAAA;;;;;;;;;;;;;;;;;;;iBAgCE,0BAA0B,yBAAyB,SAAS;cCvI/D;UAEI,qBAAqB;;EAEpC;;;EAGA,WAAW;;EAEX;;EAEA,YAAY;;EAEZ;;;EAGA,cAAc,OAAO;;EAErB;;UAGe;;EAEf,OAAO;;EAEP,MAAM;;iBAGc,SAAS,QAC7B,OAAO,qBAAqB,SAC5B,OAAO,SACN,QAAQ;;;iBAsIK,iBAAiB,eAAe;;iBAKhC,iBAAiB,eAAe;UCxK/B,oBAAoB,iBAAiB;EACpD,SAAS;EACT,SAAS;;;EAGT,QAAQ,eAAe;;EAEvB,QAAQ;;EAER,gBAAgB,eAAe;;;;EAI/B,mBAAmB;EACnB;EACA;EACA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;EAGA,gBAAgB;;;;EAIhB,iBAAiB;;;EAGjB,gBAAgB;EAChB,SAAS;;;;;;;;;;;KAYC,cAAc,iBAAiB,qBACzC,MAAM,oBAAoB,cACvB,QAAQ;;;;;;;;;;;;;;;;;iBAkBS,aAAa,iBAAiB,kBAClD,MAAM,oBAAoB,YACzB,QAAQ;UClEM,uBAAuB,iBAAiB;EACvD,YAAY;EACZ,SAAS;;UAGM,mBAAmB,iBAAiB;EACnD,UAAU;EACV,SAAS;;UAGM,gBAAgB,iBAAiB;;EAEhD,cAAc,qBAAqB,uBAAuB;;EAE1D,aAAa,qBAAqB,mBAAmB;;EAErD,iBAAiB,qBAAqB,mBAAmB;;EAEzD;;EAEA;;UAGe;EACf;EACA,cAAc;EACd;IACE,aAAa,MAAM;MAAe;MAAc;;IAChD;;EAEF;IACE,aAAa,MAAM;MAAe;MAAc;;IAChD;;;UAIa,0BAA0B,iBAAiB;;EAE1D,UAAU;IAAQ;IAAY,OAAO;;;EAErC,UAAU;;;EAGV,QAAQ,eAAe;;EAEvB,QAAQ,gBAAgB;;EAExB,QAAQ;;EAER,gBAAgB,eAAe;;EAE/B,mBAAmB;;EAEnB;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;EAIA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;EAIA,gBAAgB;;EAEhB,iBAAiB;;;EAGjB,gBAAgB;;;;;;;;;;;;;;;EAehB,UAAU,cAAc;;;;;UAMT;EACf;EACA;EACA;;UAoBe;EACf,cAAc;;EAEd,cAAc,cAAc;;EAE5B,iBAAiB,cAAc;;;;;;;iBAQjB,qBAAqB,OAAO;EAC1C;EACA;EACA;EACA;;UAuBe;EACf,QAAQ,aAAa;;iBAGD,mBAAmB,iBAAiB,kBACxD,MAAM,0BAA0B,YAC/B,QAAQ"}

package/dist/meta-eval/index.d.ts

@@ -1,4 +1,4 @@
-import { a as ContinuousCalibrationResult, c as SelfPreferenceResult, d as calibrateJudgeContinuous, f as continuousAgreement, h as verbosityBias, i as ContinuousAgreementOptions, l as VerbosityBiasResult, m as selfPreference, n as CandidateScore, o as GoldenItem, p as positionalBias, r as ContinuousAgreement, s as PositionalBiasResult, t as CalibrationResult, u as calibrateJudge } from "../judge-calibration-DnrbQaXI.js";
-import { $ as measureJudgeAgreement, $t as CorrelationStudyOptions, A as JudgePanelOutput, At as ProbabilityPolicyAuditInput, B as JudgeConfusion, Bt as clusterBootstrapMean, C as JudgeCalibrationCellVerdict, Ct as EvaluatorAdmissionPolicy, D as JudgeCalibrationGoldItem, Dt as EvaluatorAuditPlan, E as JudgeCalibrationGateConfig, Et as EvaluatorAuditObservation, F as CalibrationExample, Ft as evaluatorAuditObservationSchema, G as JudgeGateRefusedError, Gt as CategoricalForecast, H as JudgeGateDecision, Ht as CalibrationOptions, I as CalibrationMerge, It as planEvaluatorAudit, J as JudgeRunMeta, Jt as calibrationCurve, K as JudgeGateStatus, Kt as OrdinalForecast, L as DEFAULT_JUDGE_GATE_POLICY, Lt as ClusterBootstrapOptions, M as RubricDimensionGuide, Mt as auditEvaluator, N as calibrateJudgePanel, Nt as auditProbabilityPolicy, O as JudgeDimensionCalibration, Ot as EvaluatorAuditPlanInput, P as gateJudgeCalibration, Pt as evaluatorAdmissionPolicySchema, Q as judgeGateDecision, Qt as CorrelationResult, R as JudgeAgreement, Rt as ClusterBootstrapResult, S as CalibrateJudgePanelInput, T as JudgeCalibrationGateCell, Tt as EvaluatorAuditInput, U as JudgeGateInput, Ut as CalibrationPair, V as JudgeExampleAgreement, Vt as CalibrationBin, W as JudgeGatePolicy, Wt as CalibrationReport, X as addCalibrationVerdicts, Xt as multiclassBrierScore, Y as OwnerVerdict, Yt as calibrationFromPairs, Z as assertJudgeMayGate, Zt as rankedProbabilityScore, _ as catchRate, _t as snapshotFromCalibration, a as PerturbedField, at as SentinelMetrics, b as plantByPerturbation, c as PlantEvidence, ct as SentinelSnapshot, d as PlantKindCounts, dt as SentinelTrend, en as CorrelationStudyResult, et as registerCalibrationSet, f as PlantManifest, ft as SnapshotMeta, g as UnseededRejection, gt as snapshotFromAgreement, h as SeededGradingSet, ht as judgeSentinelReport, i as PerturbationKind, it as SentinelMetricName, j as JudgePanelPrompt, jt as ProbabilityPolicyAuditReport, k as JudgePanelCalibration, kt as EvaluatorErrorRate, l as PlantExpectation, lt as SentinelStore, m as SeedPlantsOptions, mt as fileSentinelStore, n as CatchRateStatus, nn as OutcomePair, nt as EvalHealthStamp, o as PerturbedPlant, ot as SentinelReport, p as PlantOutcome, pt as evalHealthStamp, q as JudgeRun, qt as brierScore, r as EvidencePerturbation, rn as correlationStudy, rt as JudgeSentinelOptions, s as Plant, st as SentinelSetOptions, t as CatchRateReport, tn as EvalMetricSpec, tt as snapshotFromJudgeAgreement, u as PlantKind, ut as SentinelThresholds, v as definePlant, vt as snapshotFromSentinelSet, w as JudgeCalibrationGate, wt as EvaluatorAdmissionReport, x as seedPlants, y as perturbEvidence, yt as validateSentinelSnapshot, z as JudgeCalibrationSet, zt as ClusteredObservation } from "../index-C3t17kHu.js";
+import { $t as selfPreference, Bt as CalibrationResult, Gt as GoldenItem, Ht as ContinuousAgreement, Jt as VerbosityBiasResult, Kt as PositionalBiasResult, Qt as positionalBias, Ut as ContinuousAgreementOptions, Vt as CandidateScore, Wt as ContinuousCalibrationResult, Xt as calibrateJudgeContinuous, Yt as calibrateJudge, Zt as continuousAgreement, en as verbosityBias, qt as SelfPreferenceResult } from "../index-DNXFzSpc.js";
 import { a as RubricPredictiveValidityReport, c as CorrelationInterval, d as FileSystemOutcomeStore, f as FileSystemOutcomeStoreOptions, g as OutcomeStoreError, h as OutcomeStore, i as RubricPredictiveValidityInput, l as OutcomeReduction, m as OutcomeFilter, n as RubricOutcomeExclusion, o as RubricRanking, p as InMemoryOutcomeStore, r as RubricOutcomePair, s as rubricPredictiveValidity, t as OutcomeMetricSpec, u as DeploymentOutcome } from "../rubric-predictive-validity-B3RzbwOx.js";
+import { $ as measureJudgeAgreement, $t as CorrelationStudyOptions, A as JudgePanelOutput, At as ProbabilityPolicyAuditInput, B as JudgeConfusion, Bt as clusterBootstrapMean, C as JudgeCalibrationCellVerdict, Ct as EvaluatorAdmissionPolicy, D as JudgeCalibrationGoldItem, Dt as EvaluatorAuditPlan, E as JudgeCalibrationGateConfig, Et as EvaluatorAuditObservation, F as CalibrationExample, Ft as evaluatorAuditObservationSchema, G as JudgeGateRefusedError, Gt as CategoricalForecast, H as JudgeGateDecision, Ht as CalibrationOptions, I as CalibrationMerge, It as planEvaluatorAudit, J as JudgeRunMeta, Jt as calibrationCurve, K as JudgeGateStatus, Kt as OrdinalForecast, L as DEFAULT_JUDGE_GATE_POLICY, Lt as ClusterBootstrapOptions, M as RubricDimensionGuide, Mt as auditEvaluator, N as calibrateJudgePanel, Nt as auditProbabilityPolicy, O as JudgeDimensionCalibration, Ot as EvaluatorAuditPlanInput, P as gateJudgeCalibration, Pt as evaluatorAdmissionPolicySchema, Q as judgeGateDecision, Qt as CorrelationResult, R as JudgeAgreement, Rt as ClusterBootstrapResult, S as CalibrateJudgePanelInput, T as JudgeCalibrationGateCell, Tt as EvaluatorAuditInput, U as JudgeGateInput, Ut as CalibrationPair, V as JudgeExampleAgreement, Vt as CalibrationBin, W as JudgeGatePolicy, Wt as CalibrationReport, X as addCalibrationVerdicts, Xt as multiclassBrierScore, Y as OwnerVerdict, Yt as calibrationFromPairs, Z as assertJudgeMayGate, Zt as rankedProbabilityScore, _ as catchRate, _t as snapshotFromCalibration, a as PerturbedField, at as SentinelMetrics, b as plantByPerturbation, c as PlantEvidence, ct as SentinelSnapshot, d as PlantKindCounts, dt as SentinelTrend, en as CorrelationStudyResult, et as registerCalibrationSet, f as PlantManifest, ft as SnapshotMeta, g as UnseededRejection, gt as snapshotFromAgreement, h as SeededGradingSet, ht as judgeSentinelReport, i as PerturbationKind, it as SentinelMetricName, j as JudgePanelPrompt, jt as ProbabilityPolicyAuditReport, k as JudgePanelCalibration, kt as EvaluatorErrorRate, l as PlantExpectation, lt as SentinelStore, m as SeedPlantsOptions, mt as fileSentinelStore, n as CatchRateStatus, nn as OutcomePair, nt as EvalHealthStamp, o as PerturbedPlant, ot as SentinelReport, p as PlantOutcome, pt as evalHealthStamp, q as JudgeRun, qt as brierScore, r as EvidencePerturbation, rn as correlationStudy, rt as JudgeSentinelOptions, s as Plant, st as SentinelSetOptions, t as CatchRateReport, tn as EvalMetricSpec, tt as snapshotFromJudgeAgreement, u as PlantKind, ut as SentinelThresholds, v as definePlant, vt as snapshotFromSentinelSet, w as JudgeCalibrationGate, wt as EvaluatorAdmissionReport, x as seedPlants, y as perturbEvidence, yt as validateSentinelSnapshot, z as JudgeCalibrationSet, zt as ClusteredObservation } from "../index-B62BaRzH.js";
 export { type CalibrateJudgePanelInput, CalibrationBin, CalibrationExample, CalibrationMerge, CalibrationOptions, CalibrationPair, CalibrationReport, type CalibrationResult, type CandidateScore, CatchRateReport, CatchRateStatus, CategoricalForecast, ClusterBootstrapOptions, ClusterBootstrapResult, ClusteredObservation, type ContinuousAgreement, type ContinuousAgreementOptions, type ContinuousCalibrationResult, type CorrelationInterval, CorrelationResult, CorrelationStudyOptions, CorrelationStudyResult, DEFAULT_JUDGE_GATE_POLICY, DeploymentOutcome, type EvalHealthStamp, EvalMetricSpec, type EvaluatorAdmissionPolicy, type EvaluatorAdmissionReport, type EvaluatorAuditInput, type EvaluatorAuditObservation, type EvaluatorAuditPlan, type EvaluatorAuditPlanInput, type EvaluatorErrorRate, EvidencePerturbation, FileSystemOutcomeStore, FileSystemOutcomeStoreOptions, type GoldenItem, InMemoryOutcomeStore, JudgeAgreement, type JudgeCalibrationCellVerdict, type JudgeCalibrationGate, type JudgeCalibrationGateCell, type JudgeCalibrationGateConfig, type JudgeCalibrationGoldItem, JudgeCalibrationSet, JudgeConfusion, type JudgeDimensionCalibration, JudgeExampleAgreement, JudgeGateDecision, JudgeGateInput, JudgeGatePolicy, JudgeGateRefusedError, JudgeGateStatus, type JudgePanelCalibration, type JudgePanelOutput, type JudgePanelPrompt, JudgeRun, JudgeRunMeta, type JudgeSentinelOptions, OrdinalForecast, OutcomeFilter, OutcomeMetricSpec, OutcomePair, type OutcomeReduction, OutcomeStore, OutcomeStoreError, OwnerVerdict, PerturbationKind, PerturbedField, PerturbedPlant, Plant, PlantEvidence, PlantExpectation, PlantKind, PlantKindCounts, PlantManifest, PlantOutcome, type PositionalBiasResult, type ProbabilityPolicyAuditInput, type ProbabilityPolicyAuditReport, type RubricDimensionGuide, RubricOutcomeExclusion, RubricOutcomePair, RubricPredictiveValidityInput, RubricPredictiveValidityReport, RubricRanking, SeedPlantsOptions, SeededGradingSet, type SelfPreferenceResult, type SentinelMetricName, type SentinelMetrics, type SentinelReport, type SentinelSetOptions, type SentinelSnapshot, type SentinelStore, type SentinelThresholds, type SentinelTrend, type SnapshotMeta, UnseededRejection, type VerbosityBiasResult, addCalibrationVerdicts, assertJudgeMayGate, auditEvaluator, auditProbabilityPolicy, brierScore, calibrateJudge, calibrateJudgeContinuous, calibrateJudgePanel, calibrationCurve, calibrationFromPairs, catchRate, clusterBootstrapMean, continuousAgreement, correlationStudy, definePlant, evalHealthStamp, evaluatorAdmissionPolicySchema, evaluatorAuditObservationSchema, fileSentinelStore, gateJudgeCalibration, judgeGateDecision, judgeSentinelReport, measureJudgeAgreement, multiclassBrierScore, perturbEvidence, planEvaluatorAudit, plantByPerturbation, positionalBias, rankedProbabilityScore, registerCalibrationSet, rubricPredictiveValidity, seedPlants, selfPreference, snapshotFromAgreement, snapshotFromCalibration, snapshotFromJudgeAgreement, snapshotFromSentinelSet, validateSentinelSnapshot, verbosityBias };

package/dist/meta-eval/index.js

@@ -1,15 +1,15 @@
 import { n as CaptureIntegrityError, s as ValidationError } from "../errors-DeEEV9Vx.js";
 import { a as hashCanonical, i as compareCodeUnits } from "../canonical-CicJlINA.js";
+import { J as continuousAgreement, K as calibrateJudge, X as selfPreference, Y as positionalBias, Z as verbosityBias, q as calibrateJudgeContinuous } from "../statistics-CvvC-MPv.js";
 import { t as mulberry32 } from "../random-DrzcgC7F.js";
-import { a as selfPreference, i as positionalBias, n as calibrateJudgeContinuous, o as verbosityBias, r as continuousAgreement, t as calibrateJudge } from "../judge-calibration-DKR6Xi-w.js";
 import { s as runMetricExtractor } from "../query-CGXzO9d4.js";
-import { n as callLlmJson } from "../llm-client-BdSiZ4qz.js";
-import { a as validateObservationOptions, i as reduceOutcomeMetric, n as correlationSummary, r as hasVariation, t as assertUniqueObservationIds } from "../outcome-observations-DZu5hLYF.js";
-import { a as rankedProbabilityScore, i as multiclassBrierScore, n as calibrationCurve, r as calibrationFromPairs, t as brierScore } from "../calibration-CbZPApIO.js";
-import { a as judgeGateDecision, c as snapshotFromJudgeAgreement, d as judgeSentinelReport, f as snapshotFromAgreement, g as withJudgeRetry, h as validateSentinelSnapshot, i as assertJudgeMayGate, l as evalHealthStamp, m as snapshotFromSentinelSet, n as JudgeGateRefusedError, o as measureJudgeAgreement, p as snapshotFromCalibration, r as addCalibrationVerdicts, s as registerCalibrationSet, t as DEFAULT_JUDGE_GATE_POLICY, u as fileSentinelStore } from "../judge-gate-CIlBrn6q.js";
+import { n as callLlmJson } from "../llm-client-DMMSg-Ro.js";
+import { a as validateObservationOptions, i as reduceOutcomeMetric, n as correlationSummary, r as hasVariation, t as assertUniqueObservationIds } from "../outcome-observations-DPkH-LHQ.js";
+import { a as rankedProbabilityScore, i as multiclassBrierScore, n as calibrationCurve, r as calibrationFromPairs, t as brierScore } from "../calibration-Cf-wpqqO.js";
+import { a as judgeGateDecision, c as snapshotFromJudgeAgreement, d as judgeSentinelReport, f as snapshotFromAgreement, g as withJudgeRetry, h as validateSentinelSnapshot, i as assertJudgeMayGate, l as evalHealthStamp, m as snapshotFromSentinelSet, n as JudgeGateRefusedError, o as measureJudgeAgreement, p as snapshotFromCalibration, r as addCalibrationVerdicts, s as registerCalibrationSet, t as DEFAULT_JUDGE_GATE_POLICY, u as fileSentinelStore } from "../judge-gate-CrN0PaAL.js";
 import { t as computeInterval } from "../interval-Bd2f4CRT.js";
-import { t as clusterBootstrapMean } from "../cluster-bootstrap-BteuR1hg.js";
-import { t as rubricPredictiveValidity } from "../rubric-predictive-validity-D_6ZPTNR.js";
+import { t as clusterBootstrapMean } from "../cluster-bootstrap-B0MTOBRU.js";
+import { t as rubricPredictiveValidity } from "../rubric-predictive-validity-DL7gJ51F.js";
 import { n as InMemoryOutcomeStore, r as OutcomeStoreError, t as FileSystemOutcomeStore } from "../outcome-store-TarrcfHG.js";
 import { z } from "zod";
 // src/meta-eval/correlation-study.ts

package/dist/{metrics-DNCAUtuB.js → metrics-zALlR17s.js}

@@ -32,15 +32,17 @@ const MODEL_PRICING = {
 	"gpt-6-luna": {
 		input: 1e-4,
 		output: 5e-4
+	},
+	"gpt-5-mini": {
+		input: 25e-5,
+		output: .002
 	}
 };
 /** Family-level pricing fallbacks (per-1K), matched against a normalized id
 *  after exact lookup misses. Ordered — first match wins. Covers the model
-*  ids actually used through the Tangle router + cli-bridge harnesses
-*  (`claude-code/sonnet`, `opencode/zai-coding-plan/glm-5.1`,
-*  `kimi-code/kimi-k2.6`, `deepseek-v4-pro`, `anthropic/claude-sonnet-4-6`, …),
-*  none of which appear in the exact table above — without this they priced
-*  to a silent $0, blanking every cost/Pareto axis downstream. */
+*  ids actually used through the Tangle router + cli-bridge harnesses, none
+*  of which appear in the exact table above — without this they priced to a
+*  silent $0, blanking every cost/Pareto axis downstream. */
 const FAMILY_PRICING = [
 	[/^stealth\//, {
 		input: 0,
@@ -99,12 +101,11 @@ const FAMILY_PRICING = [
 		output: 6e-4
 	}]
 ];
-/** Normalize a model id for pricing: drop a `@snapshot` suffix, lowercase,
-*  and return both the complete harness/provider-prefixed id and its final
-*  served-model segment (`opencode/zai-coding-plan/glm-5.3` → full id plus
-*  `glm-5.3`). Exact rows are checked against both before family fallback. */
+/** Normalize a model id for pricing: drop `@snapshot` and trailing
+*  `-YYYY-MM-DD` dated-snapshot suffixes, lowercase, and return the complete
+*  id plus its final served-model segment for exact-row lookup. */
 function normalizedModelIds(model) {
-	const id = (model.split("@")[0] ?? model).trim().toLowerCase();
+	const id = (model.split("@")[0] ?? model).trim().toLowerCase().replace(/-(?:19|20)\d{2}-\d{2}-\d{2}$/, "");
 	const finalSegment = id.slice(id.lastIndexOf("/") + 1);
 	return finalSegment === id ? [id] : [id, finalSegment];
 }
@@ -118,8 +119,7 @@ function resolveModelPricing(model) {
 	for (const [pattern, price] of FAMILY_PRICING) if (ids.some((id) => pattern.test(id))) return price;
 	return null;
 }
-/** True when `model` has known pricing (exact or family). Lets cost-aware
-*  callers distinguish a real $0 from an unpriced model. */
+/** True when `model` has known pricing: distinguishes a real $0 from unpriced. */
 function isModelPriced(model) {
 	return resolveModelPricing(model) !== null;
 }
@@ -128,15 +128,14 @@ const warnedUnpricedModels = /* @__PURE__ */ new Set();
 function estimateTokens(text) {
 	return Math.ceil(text.length / 4);
 }
-/** Calculate cost in USD from token counts and model. Unknown models warn
-*  once (not a silent zero) and return 0 so callers that ignore pricing keep
-*  working; cost-sensitive callers should gate on {@link isModelPriced}. */
+/** Calculate cost in USD from token counts and model. Unknown models warn once
+*  (not a silent zero) and return 0; cost-sensitive callers gate on {@link isModelPriced}. */
 function estimateCost(inputTokens, outputTokens, model) {
 	const pricing = resolveModelPricing(model);
 	if (!pricing) {
 		if (!warnedUnpricedModels.has(model)) {
 			warnedUnpricedModels.add(model);
-			console.warn(`estimateCost: no pricing for model "${model}" — returning 0; add it to MODEL_PRICING/FAMILY_PRICING (cost/Pareto axes will be blank until then)`);
+			console.warn(`estimateCost: no pricing for "${model}" — returning 0; add it to MODEL_PRICING`);
 		}
 		return 0;
 	}
@@ -144,4 +143,4 @@ function estimateCost(inputTokens, outputTokens, model) {
 }
 export { resolveModelPricing as a, isModelPriced as i, estimateCost as n, estimateTokens as r, MODEL_PRICING as t };
 
-//# sourceMappingURL=metrics-DNCAUtuB.js.map
+//# sourceMappingURL=metrics-zALlR17s.js.map

package/dist/metrics-zALlR17s.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics-zALlR17s.js","names":[],"sources":["../src/metrics.ts"],"sourcesContent":["interface TokenPrice {\n  input: number\n  output: number\n}\n\n/** Per-1K token pricing for exact model ids. */\nexport const MODEL_PRICING: Record<string, TokenPrice> = {\n  'gpt-4o': { input: 0.0025, output: 0.01 },\n  'gpt-4o-mini': { input: 0.00015, output: 0.0006 },\n  'gpt-4-turbo': { input: 0.01, output: 0.03 },\n  'claude-sonnet-4-20250514': { input: 0.003, output: 0.015 },\n  'claude-opus-4-20250514': { input: 0.015, output: 0.075 },\n  'claude-3-haiku-20240307': { input: 0.00025, output: 0.00125 },\n  // Router response-header rates observed for the exact served model on\n  // 2026-08-15. Keep this exact row ahead of the deliberately coarse family\n  // fallback so glm-5.3 campaign costs are not understated by ~2.5x.\n  'glm-5.3': { input: 0.00168, output: 0.00528 },\n  // Tangle Router's published rate (`GET /v1/models`) on 2026-10-09:\n  // $0.10 / $0.50 per Mtok. Exact, because the coarse gpt-5 family row would\n  // overstate it 12x on input and 20x on output.\n  'gpt-6-luna': { input: 0.0001, output: 0.0005 },\n  // Router receipts for the served id `gpt-5-mini-2025-08-07` solve exactly\n  // to $0.25 / $2 per Mtok; the gpt-5 family row is 5x too high.\n  'gpt-5-mini': { input: 0.00025, output: 0.002 },\n}\n\n/** Family-level pricing fallbacks (per-1K), matched against a normalized id\n *  after exact lookup misses. Ordered — first match wins. Covers the model\n *  ids actually used through the Tangle router + cli-bridge harnesses, none\n *  of which appear in the exact table above — without this they priced to a\n *  silent $0, blanking every cost/Pareto axis downstream. */\nconst FAMILY_PRICING: Array<[RegExp, TokenPrice]> = [\n  // OpenRouter stealth previews (`stealth/union-alpha`, …) bill $0 during\n  // their preview window. A real zero row lets the budget ledger admit them;\n  // an unpriced id is refused before the first call.\n  [/^stealth\\//, { input: 0, output: 0 }],\n  [/claude.*opus/, { input: 0.015, output: 0.075 }],\n  [/claude.*haiku/, { input: 0.0008, output: 0.004 }],\n  [/claude.*sonnet|claude-code|claude-sonnet/, { input: 0.003, output: 0.015 }],\n  [/gpt-4o-mini/, { input: 0.00015, output: 0.0006 }],\n  [/gpt-5|gpt-4\\.1|o[134]\\b/, { input: 0.00125, output: 0.01 }],\n  [/gpt-4o|gpt-4/, { input: 0.0025, output: 0.01 }],\n  [/deepseek/, { input: 0.0003, output: 0.0011 }],\n  [/glm|zhipu|zai/, { input: 0.0006, output: 0.0022 }],\n  [/kimi|moonshot/, { input: 0.0006, output: 0.0025 }],\n  [/qwen/, { input: 0.0004, output: 0.0012 }],\n  [/gemini.*flash/, { input: 0.0001, output: 0.0004 }],\n  [/gemini/, { input: 0.00125, output: 0.005 }],\n  [/llama/, { input: 0.0002, output: 0.0006 }],\n]\n\n/** Normalize a model id for pricing: drop `@snapshot` and trailing\n *  `-YYYY-MM-DD` dated-snapshot suffixes, lowercase, and return the complete\n *  id plus its final served-model segment for exact-row lookup. */\nfunction normalizedModelIds(model: string): string[] {\n  const stripped = (model.split('@')[0] ?? model).trim().toLowerCase()\n  const id = stripped.replace(/-(?:19|20)\\d{2}-\\d{2}-\\d{2}$/, '')\n  const finalSegment = id.slice(id.lastIndexOf('/') + 1)\n  return finalSegment === id ? [id] : [id, finalSegment]\n}\n\n/** Resolve pricing for a model id: exact table, then family fallback.\n *  Returns null when the id matches nothing (caller decides — never a\n *  silent-zero masquerading as a real $0 cost). */\nexport function resolveModelPricing(model: string): TokenPrice | null {\n  if (MODEL_PRICING[model]) return MODEL_PRICING[model]\n  const ids = normalizedModelIds(model)\n  for (const id of ids) {\n    if (MODEL_PRICING[id]) return MODEL_PRICING[id]\n  }\n  for (const [pattern, price] of FAMILY_PRICING) {\n    if (ids.some((id) => pattern.test(id))) return price\n  }\n  return null\n}\n\n/** True when `model` has known pricing: distinguishes a real $0 from unpriced. */\nexport function isModelPriced(model: string): boolean {\n  return resolveModelPricing(model) !== null\n}\n\nconst warnedUnpricedModels = new Set<string>()\n\n/** Estimate token count from string length (chars / 4 approximation) */\nexport function estimateTokens(text: string): number {\n  return Math.ceil(text.length / 4)\n}\n\n/** Calculate cost in USD from token counts and model. Unknown models warn once\n *  (not a silent zero) and return 0; cost-sensitive callers gate on {@link isModelPriced}. */\nexport function estimateCost(inputTokens: number, outputTokens: number, model: string): number {\n  const pricing = resolveModelPricing(model)\n  if (!pricing) {\n    if (!warnedUnpricedModels.has(model)) {\n      warnedUnpricedModels.add(model)\n      console.warn(`estimateCost: no pricing for \"${model}\" — returning 0; add it to MODEL_PRICING`)\n    }\n    return 0\n  }\n  return (inputTokens / 1000) * pricing.input + (outputTokens / 1000) * pricing.output\n}\n"],"mappings":";;AAMA,MAAa,gBAA4C;CACvD,UAAU;EAAE,OAAO;EAAQ,QAAQ;CAAK;CACxC,eAAe;EAAE,OAAO;EAAS,QAAQ;CAAO;CAChD,eAAe;EAAE,OAAO;EAAM,QAAQ;CAAK;CAC3C,4BAA4B;EAAE,OAAO;EAAO,QAAQ;CAAM;CAC1D,0BAA0B;EAAE,OAAO;EAAO,QAAQ;CAAM;CACxD,2BAA2B;EAAE,OAAO;EAAS,QAAQ;CAAQ;CAI7D,WAAW;EAAE,OAAO;EAAS,QAAQ;CAAQ;CAI7C,cAAc;EAAE,OAAO;EAAQ,QAAQ;CAAO;CAG9C,cAAc;EAAE,OAAO;EAAS,QAAQ;CAAM;AAChD;;;;;;AAOA,MAAM,iBAA8C;CAIlD,CAAC,cAAc;EAAE,OAAO;EAAG,QAAQ;CAAE,CAAC;CACtC,CAAC,gBAAgB;EAAE,OAAO;EAAO,QAAQ;CAAM,CAAC;CAChD,CAAC,iBAAiB;EAAE,OAAO;EAAQ,QAAQ;CAAM,CAAC;CAClD,CAAC,4CAA4C;EAAE,OAAO;EAAO,QAAQ;CAAM,CAAC;CAC5E,CAAC,eAAe;EAAE,OAAO;EAAS,QAAQ;CAAO,CAAC;CAClD,CAAC,2BAA2B;EAAE,OAAO;EAAS,QAAQ;CAAK,CAAC;CAC5D,CAAC,gBAAgB;EAAE,OAAO;EAAQ,QAAQ;CAAK,CAAC;CAChD,CAAC,YAAY;EAAE,OAAO;EAAQ,QAAQ;CAAO,CAAC;CAC9C,CAAC,iBAAiB;EAAE,OAAO;EAAQ,QAAQ;CAAO,CAAC;CACnD,CAAC,iBAAiB;EAAE,OAAO;EAAQ,QAAQ;CAAO,CAAC;CACnD,CAAC,QAAQ;EAAE,OAAO;EAAQ,QAAQ;CAAO,CAAC;CAC1C,CAAC,iBAAiB;EAAE,OAAO;EAAQ,QAAQ;CAAO,CAAC;CACnD,CAAC,UAAU;EAAE,OAAO;EAAS,QAAQ;CAAM,CAAC;CAC5C,CAAC,SAAS;EAAE,OAAO;EAAQ,QAAQ;CAAO,CAAC;AAC7C;;;;AAKA,SAAS,mBAAmB,OAAyB;CAEnD,MAAM,MADY,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,MAAA,CAAO,KAAK,CAAC,CAAC,YACrC,CAAC,CAAC,QAAQ,gCAAgC,EAAE;CAC9D,MAAM,eAAe,GAAG,MAAM,GAAG,YAAY,GAAG,IAAI,CAAC;CACrD,OAAO,iBAAiB,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,YAAY;AACvD;;;;AAKA,SAAgB,oBAAoB,OAAkC;CACpE,IAAI,cAAc,QAAQ,OAAO,cAAc;CAC/C,MAAM,MAAM,mBAAmB,KAAK;CACpC,KAAK,MAAM,MAAM,KACf,IAAI,cAAc,KAAK,OAAO,cAAc;CAE9C,KAAK,MAAM,CAAC,SAAS,UAAU,gBAC7B,IAAI,IAAI,MAAM,OAAO,QAAQ,KAAK,EAAE,CAAC,GAAG,OAAO;CAEjD,OAAO;AACT;;AAGA,SAAgB,cAAc,OAAwB;CACpD,OAAO,oBAAoB,KAAK,MAAM;AACxC;AAEA,MAAM,uCAAuB,IAAI,IAAY;;AAG7C,SAAgB,eAAe,MAAsB;CACnD,OAAO,KAAK,KAAK,KAAK,SAAS,CAAC;AAClC;;;AAIA,SAAgB,aAAa,aAAqB,cAAsB,OAAuB;CAC7F,MAAM,UAAU,oBAAoB,KAAK;CACzC,IAAI,CAAC,SAAS;EACZ,IAAI,CAAC,qBAAqB,IAAI,KAAK,GAAG;GACpC,qBAAqB,IAAI,KAAK;GAC9B,QAAQ,KAAK,iCAAiC,MAAM,yCAAyC;EAC/F;EACA,OAAO;CACT;CACA,OAAQ,cAAc,MAAQ,QAAQ,QAAS,eAAe,MAAQ,QAAQ;AAChF"}

package/dist/multishot/golden/index.d.ts

@@ -1,4 +1,4 @@
-import { A as MultishotTransportRequest, D as MultishotToolDefinition, T as MultishotResult, c as RunMultishotMatrixResult, f as RunMultishotOptions, s as RunMultishotMatrixOptions, w as MultishotPersona } from "../../matrix-Yg1lHIGI.js";
+import { A as MultishotTransportRequest, D as MultishotToolDefinition, T as MultishotResult, c as RunMultishotMatrixResult, f as RunMultishotOptions, s as RunMultishotMatrixOptions, w as MultishotPersona } from "../../matrix-C-GxIgeJ.js";
 interface CompareOptions {
   /** Stop after this many mismatches. A structural divergence high in the
    *  tree would otherwise report every leaf below it. */

package/dist/multishot/index.d.ts

@@ -1,5 +1,5 @@
-import { C as JudgeDimension, w as JudgeScore } from "../types-wDBk14lj.js";
-import { A as MultishotTransportRequest, C as MultishotMessage, D as MultishotToolDefinition, E as MultishotShape, M as MultishotTransportToolCall, N as assertMultishotShotResult, O as MultishotToolExecutor, S as MultishotFatalToolError, T as MultishotResult, _ as renderDimensions, a as MultishotCellOutput, b as MultishotArtifact, c as RunMultishotMatrixResult, d as MultishotShot, f as RunMultishotOptions, g as MultishotJudgeConfig, h as JudgeRunResult, i as ConversationJudgeInput, j as MultishotTransportResponse, k as MultishotTransport, l as computeCellComposite, m as DEFAULT_JUDGE_MODEL, n as CellCompositeInput, o as MultishotJudges, p as runMultishot, r as CellCompositeScore, s as RunMultishotMatrixOptions, t as ArtifactJudgeInput, u as runMultishotMatrix, v as renderJsonFooter, w as MultishotPersona, x as MultishotDriverEmptyError, y as runJudge } from "../matrix-Yg1lHIGI.js";
+import { C as JudgeDimension, w as JudgeScore } from "../types-ip2D3-Ib.js";
+import { A as MultishotTransportRequest, C as MultishotMessage, D as MultishotToolDefinition, E as MultishotShape, M as MultishotTransportToolCall, N as assertMultishotShotResult, O as MultishotToolExecutor, S as MultishotFatalToolError, T as MultishotResult, _ as renderDimensions, a as MultishotCellOutput, b as MultishotArtifact, c as RunMultishotMatrixResult, d as MultishotShot, f as RunMultishotOptions, g as MultishotJudgeConfig, h as JudgeRunResult, i as ConversationJudgeInput, j as MultishotTransportResponse, k as MultishotTransport, l as computeCellComposite, m as DEFAULT_JUDGE_MODEL, n as CellCompositeInput, o as MultishotJudges, p as runMultishot, r as CellCompositeScore, s as RunMultishotMatrixOptions, t as ArtifactJudgeInput, u as runMultishotMatrix, v as renderJsonFooter, w as MultishotPersona, x as MultishotDriverEmptyError, y as runJudge } from "../matrix-C-GxIgeJ.js";
 import { AgentProfile } from "@tangle-network/agent-interface";
 /** Prompt and completion tokens one leg reported. */
 interface MultishotLegTokens {

package/dist/multishot/index.js

@@ -1,4 +1,4 @@
-import { i as isModelPriced, n as estimateCost } from "../metrics-DNCAUtuB.js";
+import { i as isModelPriced, n as estimateCost } from "../metrics-zALlR17s.js";
 import { n as withCellSpend } from "../cell-spend-zxmzg4GH.js";
 import { t as runAgentMatrix } from "../matrix-CgpX8wdm.js";
 import { n as MultishotFatalToolError, r as assertMultishotShotResult, t as MultishotDriverEmptyError } from "../types-DK4vNv5q.js";

package/dist/openapi.json

@@ -2,7 +2,7 @@
   "openapi": "3.1.0",
   "info": {
     "title": "@tangle-network/agent-eval — wire protocol",
-    "version": "1.0.19",
+    "version": "1.0.21",
     "description": "HTTP and stdio RPC interface to agent-eval. The TypeScript runtime is the source of truth; this spec is the contract that cross-language clients (Python, Rust, Go) generate from.\n\nWire-protocol version: 1.1.0. Bumps on breaking changes to request/response schemas.",
     "contact": {
       "name": "Tangle Network",

package/dist/{outcome-observations-DZu5hLYF.js → outcome-observations-DPkH-LHQ.js}

@@ -1,5 +1,4 @@
-import { l as makeRng } from "./mean-D1d6gedE.js";
-import { i as pearsonR, o as spearmanR } from "./descriptive-B3Eb7tX0.js";
+import { dt as makeRng, rt as spearmanR, tt as pearsonR } from "./statistics-CvvC-MPv.js";
 // src/meta-eval/outcome-observations.ts
 /** Reduce observations of one named metric; unrelated keys cannot supply a value. */
 function reduceOutcomeMetric(outcomes, metric, reduction) {
@@ -74,4 +73,4 @@ function interval(values) {
 }
 export { validateObservationOptions as a, reduceOutcomeMetric as i, correlationSummary as n, validateOutcomeMetricSpecifications as o, hasVariation as r, assertUniqueObservationIds as t };
 
-//# sourceMappingURL=outcome-observations-DZu5hLYF.js.map
+//# sourceMappingURL=outcome-observations-DPkH-LHQ.js.map

package/dist/{outcome-observations-DZu5hLYF.js.map → outcome-observations-DPkH-LHQ.js.map}

@@ -1 +1 @@
-{"version":3,"file":"outcome-observations-DZu5hLYF.js","names":[],"sources":["../src/meta-eval/outcome-observations.ts"],"sourcesContent":["import { pearsonR, spearmanR } from '../statistics'\nimport { makeRng } from '../statistics/internal'\nimport type { DeploymentOutcome } from './outcome-store'\n\nexport type OutcomeReduction = 'latest' | 'mean' | 'max'\n\nexport interface CorrelationInterval {\n  lower: number\n  upper: number\n}\n\n/** Reduce observations of one named metric; unrelated keys cannot supply a value. */\nexport function reduceOutcomeMetric(\n  outcomes: readonly DeploymentOutcome[],\n  metric: string,\n  reduction: OutcomeReduction,\n): number | null {\n  const observations = outcomes.flatMap((outcome) => {\n    const value = outcome.metrics[metric]\n    return Number.isFinite(outcome.capturedAt) &&\n      typeof value === 'number' &&\n      Number.isFinite(value)\n      ? [{ capturedAt: outcome.capturedAt, value }]\n      : []\n  })\n  if (observations.length === 0) return null\n  if (reduction === 'mean') {\n    return observations.reduce(\n      (sum, observation) => sum + observation.value / observations.length,\n      0,\n    )\n  }\n  if (reduction === 'max') return Math.max(...observations.map((observation) => observation.value))\n  return observations.reduce((a, b) => (b.capturedAt > a.capturedAt ? b : a)).value\n}\n\nexport function hasVariation(values: readonly number[]): boolean {\n  return values.some((value) => value !== values[0])\n}\n\nexport function correlationSummary(\n  xs: number[],\n  ys: number[],\n  iterations: number,\n  seed: number | undefined,\n): {\n  pearson: number\n  spearman: number\n  pearsonCi95: CorrelationInterval | null\n  spearmanCi95: CorrelationInterval | null\n} {\n  const rng = makeRng(seed, xs, ys)\n  const pearsons: number[] = []\n  const spearmans: number[] = []\n  for (let b = 0; b < iterations; b++) {\n    const rx: number[] = []\n    const ry: number[] = []\n    for (let i = 0; i < xs.length; i++) {\n      const index = Math.floor(rng() * xs.length)\n      rx.push(xs[index]!)\n      ry.push(ys[index]!)\n    }\n    // A constant resample has no estimable correlation, even when both sides agree.\n    if (!hasVariation(rx) || !hasVariation(ry)) continue\n    const pearson = pearsonR(rx, ry)\n    const spearman = spearmanR(rx, ry)\n    if (Number.isFinite(pearson)) pearsons.push(pearson)\n    if (Number.isFinite(spearman)) spearmans.push(spearman)\n  }\n  return {\n    pearson: pearsonR(xs, ys),\n    spearman: spearmanR(xs, ys),\n    pearsonCi95: interval(pearsons),\n    spearmanCi95: interval(spearmans),\n  }\n}\n\nexport function validateObservationOptions(\n  reduction: OutcomeReduction,\n  iterations: number,\n  seed: number | undefined,\n): void {\n  if (!['latest', 'mean', 'max'].includes(reduction)) {\n    throw new Error('outcome reduction must be latest, mean, or max')\n  }\n  if (!Number.isSafeInteger(iterations) || iterations < 1) {\n    throw new Error('bootstrap iterations must be a positive safe integer')\n  }\n  if (seed !== undefined && !Number.isFinite(seed)) {\n    throw new Error('bootstrap seed must be finite')\n  }\n}\n\nexport function assertUniqueObservationIds(ids: readonly string[], name: string): void {\n  if (ids.some((id) => typeof id !== 'string' || id.trim().length === 0)) {\n    throw new Error(`${name} must be a nonempty string`)\n  }\n  if (new Set(ids).size !== ids.length) throw new Error(`duplicate ${name} in outcome study`)\n}\n\nexport function validateOutcomeMetricSpecifications(\n  metrics: readonly { id: string; direction: string }[],\n): void {\n  if (!Array.isArray(metrics) || metrics.length === 0) {\n    throw new Error('outcomeMetrics must declare at least one outcome metric and direction')\n  }\n  for (const metric of metrics) {\n    if (!metric || typeof metric.id !== 'string' || metric.id.trim().length === 0) {\n      throw new Error('each outcome metric must have a nonempty id and explicit direction')\n    }\n    if (metric.direction !== 'higher-is-better' && metric.direction !== 'lower-is-better') {\n      throw new Error(\n        `outcome metric ${metric.id} must declare higher-is-better or lower-is-better`,\n      )\n    }\n  }\n  assertUniqueObservationIds(\n    metrics.map((metric) => metric.id),\n    'outcome metric',\n  )\n}\n\nfunction interval(values: number[]): CorrelationInterval | null {\n  if (values.length === 0) return null\n  values.sort((a, b) => a - b)\n  return {\n    lower: Math.max(-1, values[Math.floor(0.025 * values.length)]!),\n    upper: Math.min(1, values[Math.min(values.length - 1, Math.floor(0.975 * values.length))]!),\n  }\n}\n"],"mappings":";;;;AAYA,SAAgB,oBACd,UACA,QACA,WACe;CACf,MAAM,eAAe,SAAS,SAAS,YAAY;EACjD,MAAM,QAAQ,QAAQ,QAAQ;EAC9B,OAAO,OAAO,SAAS,QAAQ,UAAU,KACvC,OAAO,UAAU,YACjB,OAAO,SAAS,KAAK,IACnB,CAAC;GAAE,YAAY,QAAQ;GAAY;EAAM,CAAC,IAC1C,CAAC;CACP,CAAC;CACD,IAAI,aAAa,WAAW,GAAG,OAAO;CACtC,IAAI,cAAc,QAChB,OAAO,aAAa,QACjB,KAAK,gBAAgB,MAAM,YAAY,QAAQ,aAAa,QAC7D,CACF;CAEF,IAAI,cAAc,OAAO,OAAO,KAAK,IAAI,GAAG,aAAa,KAAK,gBAAgB,YAAY,KAAK,CAAC;CAChG,OAAO,aAAa,QAAQ,GAAG,MAAO,EAAE,aAAa,EAAE,aAAa,IAAI,CAAE,CAAC,CAAC;AAC9E;AAEA,SAAgB,aAAa,QAAoC;CAC/D,OAAO,OAAO,MAAM,UAAU,UAAU,OAAO,EAAE;AACnD;AAEA,SAAgB,mBACd,IACA,IACA,YACA,MAMA;CACA,MAAM,MAAM,QAAQ,MAAM,IAAI,EAAE;CAChC,MAAM,WAAqB,CAAC;CAC5B,MAAM,YAAsB,CAAC;CAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;EACnC,MAAM,KAAe,CAAC;EACtB,MAAM,KAAe,CAAC;EACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;GAClC,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI,GAAG,MAAM;GAC1C,GAAG,KAAK,GAAG,MAAO;GAClB,GAAG,KAAK,GAAG,MAAO;EACpB;EAEA,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,aAAa,EAAE,GAAG;EAC5C,MAAM,UAAU,SAAS,IAAI,EAAE;EAC/B,MAAM,WAAW,UAAU,IAAI,EAAE;EACjC,IAAI,OAAO,SAAS,OAAO,GAAG,SAAS,KAAK,OAAO;EACnD,IAAI,OAAO,SAAS,QAAQ,GAAG,UAAU,KAAK,QAAQ;CACxD;CACA,OAAO;EACL,SAAS,SAAS,IAAI,EAAE;EACxB,UAAU,UAAU,IAAI,EAAE;EAC1B,aAAa,SAAS,QAAQ;EAC9B,cAAc,SAAS,SAAS;CAClC;AACF;AAEA,SAAgB,2BACd,WACA,YACA,MACM;CACN,IAAI,CAAC;EAAC;EAAU;EAAQ;CAAK,CAAC,CAAC,SAAS,SAAS,GAC/C,MAAM,IAAI,MAAM,gDAAgD;CAElE,IAAI,CAAC,OAAO,cAAc,UAAU,KAAK,aAAa,GACpD,MAAM,IAAI,MAAM,sDAAsD;CAExE,IAAI,SAAS,KAAA,KAAa,CAAC,OAAO,SAAS,IAAI,GAC7C,MAAM,IAAI,MAAM,+BAA+B;AAEnD;AAEA,SAAgB,2BAA2B,KAAwB,MAAoB;CACrF,IAAI,IAAI,MAAM,OAAO,OAAO,OAAO,YAAY,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,GACnE,MAAM,IAAI,MAAM,GAAG,KAAK,2BAA2B;CAErD,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,SAAS,IAAI,QAAQ,MAAM,IAAI,MAAM,aAAa,KAAK,kBAAkB;AAC5F;AAEA,SAAgB,oCACd,SACM;CACN,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,WAAW,GAChD,MAAM,IAAI,MAAM,uEAAuE;CAEzF,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,CAAC,UAAU,OAAO,OAAO,OAAO,YAAY,OAAO,GAAG,KAAK,CAAC,CAAC,WAAW,GAC1E,MAAM,IAAI,MAAM,oEAAoE;EAEtF,IAAI,OAAO,cAAc,sBAAsB,OAAO,cAAc,mBAClE,MAAM,IAAI,MACR,kBAAkB,OAAO,GAAG,kDAC9B;CAEJ;CACA,2BACE,QAAQ,KAAK,WAAW,OAAO,EAAE,GACjC,gBACF;AACF;AAEA,SAAS,SAAS,QAA8C;CAC9D,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;CAC3B,OAAO;EACL,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,MAAM,OAAQ,OAAO,MAAM,EAAG;EAC9D,OAAO,KAAK,IAAI,GAAG,OAAO,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,MAAM,OAAQ,OAAO,MAAM,CAAC,EAAG;CAC5F;AACF"}
+{"version":3,"file":"outcome-observations-DPkH-LHQ.js","names":[],"sources":["../src/meta-eval/outcome-observations.ts"],"sourcesContent":["import { pearsonR, spearmanR } from '../statistics'\nimport { makeRng } from '../statistics/internal'\nimport type { DeploymentOutcome } from './outcome-store'\n\nexport type OutcomeReduction = 'latest' | 'mean' | 'max'\n\nexport interface CorrelationInterval {\n  lower: number\n  upper: number\n}\n\n/** Reduce observations of one named metric; unrelated keys cannot supply a value. */\nexport function reduceOutcomeMetric(\n  outcomes: readonly DeploymentOutcome[],\n  metric: string,\n  reduction: OutcomeReduction,\n): number | null {\n  const observations = outcomes.flatMap((outcome) => {\n    const value = outcome.metrics[metric]\n    return Number.isFinite(outcome.capturedAt) &&\n      typeof value === 'number' &&\n      Number.isFinite(value)\n      ? [{ capturedAt: outcome.capturedAt, value }]\n      : []\n  })\n  if (observations.length === 0) return null\n  if (reduction === 'mean') {\n    return observations.reduce(\n      (sum, observation) => sum + observation.value / observations.length,\n      0,\n    )\n  }\n  if (reduction === 'max') return Math.max(...observations.map((observation) => observation.value))\n  return observations.reduce((a, b) => (b.capturedAt > a.capturedAt ? b : a)).value\n}\n\nexport function hasVariation(values: readonly number[]): boolean {\n  return values.some((value) => value !== values[0])\n}\n\nexport function correlationSummary(\n  xs: number[],\n  ys: number[],\n  iterations: number,\n  seed: number | undefined,\n): {\n  pearson: number\n  spearman: number\n  pearsonCi95: CorrelationInterval | null\n  spearmanCi95: CorrelationInterval | null\n} {\n  const rng = makeRng(seed, xs, ys)\n  const pearsons: number[] = []\n  const spearmans: number[] = []\n  for (let b = 0; b < iterations; b++) {\n    const rx: number[] = []\n    const ry: number[] = []\n    for (let i = 0; i < xs.length; i++) {\n      const index = Math.floor(rng() * xs.length)\n      rx.push(xs[index]!)\n      ry.push(ys[index]!)\n    }\n    // A constant resample has no estimable correlation, even when both sides agree.\n    if (!hasVariation(rx) || !hasVariation(ry)) continue\n    const pearson = pearsonR(rx, ry)\n    const spearman = spearmanR(rx, ry)\n    if (Number.isFinite(pearson)) pearsons.push(pearson)\n    if (Number.isFinite(spearman)) spearmans.push(spearman)\n  }\n  return {\n    pearson: pearsonR(xs, ys),\n    spearman: spearmanR(xs, ys),\n    pearsonCi95: interval(pearsons),\n    spearmanCi95: interval(spearmans),\n  }\n}\n\nexport function validateObservationOptions(\n  reduction: OutcomeReduction,\n  iterations: number,\n  seed: number | undefined,\n): void {\n  if (!['latest', 'mean', 'max'].includes(reduction)) {\n    throw new Error('outcome reduction must be latest, mean, or max')\n  }\n  if (!Number.isSafeInteger(iterations) || iterations < 1) {\n    throw new Error('bootstrap iterations must be a positive safe integer')\n  }\n  if (seed !== undefined && !Number.isFinite(seed)) {\n    throw new Error('bootstrap seed must be finite')\n  }\n}\n\nexport function assertUniqueObservationIds(ids: readonly string[], name: string): void {\n  if (ids.some((id) => typeof id !== 'string' || id.trim().length === 0)) {\n    throw new Error(`${name} must be a nonempty string`)\n  }\n  if (new Set(ids).size !== ids.length) throw new Error(`duplicate ${name} in outcome study`)\n}\n\nexport function validateOutcomeMetricSpecifications(\n  metrics: readonly { id: string; direction: string }[],\n): void {\n  if (!Array.isArray(metrics) || metrics.length === 0) {\n    throw new Error('outcomeMetrics must declare at least one outcome metric and direction')\n  }\n  for (const metric of metrics) {\n    if (!metric || typeof metric.id !== 'string' || metric.id.trim().length === 0) {\n      throw new Error('each outcome metric must have a nonempty id and explicit direction')\n    }\n    if (metric.direction !== 'higher-is-better' && metric.direction !== 'lower-is-better') {\n      throw new Error(\n        `outcome metric ${metric.id} must declare higher-is-better or lower-is-better`,\n      )\n    }\n  }\n  assertUniqueObservationIds(\n    metrics.map((metric) => metric.id),\n    'outcome metric',\n  )\n}\n\nfunction interval(values: number[]): CorrelationInterval | null {\n  if (values.length === 0) return null\n  values.sort((a, b) => a - b)\n  return {\n    lower: Math.max(-1, values[Math.floor(0.025 * values.length)]!),\n    upper: Math.min(1, values[Math.min(values.length - 1, Math.floor(0.975 * values.length))]!),\n  }\n}\n"],"mappings":";;;AAYA,SAAgB,oBACd,UACA,QACA,WACe;CACf,MAAM,eAAe,SAAS,SAAS,YAAY;EACjD,MAAM,QAAQ,QAAQ,QAAQ;EAC9B,OAAO,OAAO,SAAS,QAAQ,UAAU,KACvC,OAAO,UAAU,YACjB,OAAO,SAAS,KAAK,IACnB,CAAC;GAAE,YAAY,QAAQ;GAAY;EAAM,CAAC,IAC1C,CAAC;CACP,CAAC;CACD,IAAI,aAAa,WAAW,GAAG,OAAO;CACtC,IAAI,cAAc,QAChB,OAAO,aAAa,QACjB,KAAK,gBAAgB,MAAM,YAAY,QAAQ,aAAa,QAC7D,CACF;CAEF,IAAI,cAAc,OAAO,OAAO,KAAK,IAAI,GAAG,aAAa,KAAK,gBAAgB,YAAY,KAAK,CAAC;CAChG,OAAO,aAAa,QAAQ,GAAG,MAAO,EAAE,aAAa,EAAE,aAAa,IAAI,CAAE,CAAC,CAAC;AAC9E;AAEA,SAAgB,aAAa,QAAoC;CAC/D,OAAO,OAAO,MAAM,UAAU,UAAU,OAAO,EAAE;AACnD;AAEA,SAAgB,mBACd,IACA,IACA,YACA,MAMA;CACA,MAAM,MAAM,QAAQ,MAAM,IAAI,EAAE;CAChC,MAAM,WAAqB,CAAC;CAC5B,MAAM,YAAsB,CAAC;CAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;EACnC,MAAM,KAAe,CAAC;EACtB,MAAM,KAAe,CAAC;EACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;GAClC,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI,GAAG,MAAM;GAC1C,GAAG,KAAK,GAAG,MAAO;GAClB,GAAG,KAAK,GAAG,MAAO;EACpB;EAEA,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,aAAa,EAAE,GAAG;EAC5C,MAAM,UAAU,SAAS,IAAI,EAAE;EAC/B,MAAM,WAAW,UAAU,IAAI,EAAE;EACjC,IAAI,OAAO,SAAS,OAAO,GAAG,SAAS,KAAK,OAAO;EACnD,IAAI,OAAO,SAAS,QAAQ,GAAG,UAAU,KAAK,QAAQ;CACxD;CACA,OAAO;EACL,SAAS,SAAS,IAAI,EAAE;EACxB,UAAU,UAAU,IAAI,EAAE;EAC1B,aAAa,SAAS,QAAQ;EAC9B,cAAc,SAAS,SAAS;CAClC;AACF;AAEA,SAAgB,2BACd,WACA,YACA,MACM;CACN,IAAI,CAAC;EAAC;EAAU;EAAQ;CAAK,CAAC,CAAC,SAAS,SAAS,GAC/C,MAAM,IAAI,MAAM,gDAAgD;CAElE,IAAI,CAAC,OAAO,cAAc,UAAU,KAAK,aAAa,GACpD,MAAM,IAAI,MAAM,sDAAsD;CAExE,IAAI,SAAS,KAAA,KAAa,CAAC,OAAO,SAAS,IAAI,GAC7C,MAAM,IAAI,MAAM,+BAA+B;AAEnD;AAEA,SAAgB,2BAA2B,KAAwB,MAAoB;CACrF,IAAI,IAAI,MAAM,OAAO,OAAO,OAAO,YAAY,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,GACnE,MAAM,IAAI,MAAM,GAAG,KAAK,2BAA2B;CAErD,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,SAAS,IAAI,QAAQ,MAAM,IAAI,MAAM,aAAa,KAAK,kBAAkB;AAC5F;AAEA,SAAgB,oCACd,SACM;CACN,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,WAAW,GAChD,MAAM,IAAI,MAAM,uEAAuE;CAEzF,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,CAAC,UAAU,OAAO,OAAO,OAAO,YAAY,OAAO,GAAG,KAAK,CAAC,CAAC,WAAW,GAC1E,MAAM,IAAI,MAAM,oEAAoE;EAEtF,IAAI,OAAO,cAAc,sBAAsB,OAAO,cAAc,mBAClE,MAAM,IAAI,MACR,kBAAkB,OAAO,GAAG,kDAC9B;CAEJ;CACA,2BACE,QAAQ,KAAK,WAAW,OAAO,EAAE,GACjC,gBACF;AACF;AAEA,SAAS,SAAS,QAA8C;CAC9D,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;CAC3B,OAAO;EACL,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,MAAM,OAAQ,OAAO,MAAM,EAAG;EAC9D,OAAO,KAAK,IAAI,GAAG,OAAO,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,MAAM,OAAQ,OAAO,MAAM,CAAC,EAAG;CAC5F;AACF"}

package/dist/paired-arms-DjMEtYI9.js

@@ -0,0 +1,338 @@
+import { s as ValidationError } from "./errors-DeEEV9Vx.js";
+import { a as findingTreatmentSchema } from "./finding-composition-Belh_qU3.js";
+import { a as wilcoxonSignedRank, b as pairedRiskDifference, p as pairedBootstrap, v as mcnemar } from "./statistics-CvvC-MPv.js";
+// src/arm-populations.ts
+const keyOf = (row) => JSON.stringify([
+	row.arm,
+	row.pairKey,
+	row.repKey ?? null
+]);
+function checkIdentity(row) {
+	for (const value of [
+		row.arm,
+		row.pairKey,
+		...row.repKey === void 0 ? [] : [row.repKey]
+	]) if (typeof value !== "string" || !value.trim()) throw new TypeError("Arm assignments require nonempty identities");
+	if (row.treatment !== void 0) {
+		if (!Array.isArray(row.treatment)) throw new TypeError("Arm treatment must be an array");
+		for (const value of row.treatment) findingTreatmentSchema.parse(value);
+		if (new Set(row.treatment.map((t) => t.id)).size !== row.treatment.length) throw new TypeError("Duplicate arm treatment id");
+	}
+}
+function checkObservation(row) {
+	checkIdentity(row);
+	if (row.pass != null && typeof row.pass !== "boolean") throw new TypeError("Invalid arm pass value");
+	if (row.formation !== void 0) {
+		if (row.formation === null || typeof row.formation !== "object") throw new TypeError("Invalid formation verdict");
+		if (row.formation.formed !== null && typeof row.formation.formed !== "boolean") throw new TypeError("Invalid formation state");
+		if (row.formation.reason !== void 0 && typeof row.formation.reason !== "string") throw new TypeError("Invalid formation reason");
+	}
+	for (const value of Object.values(row.metrics ?? {})) if (value !== null && !Number.isFinite(value)) throw new TypeError("Non-finite arm metric");
+}
+/** One roster join serves comparison and both denominators; no outcomes are inferred from formation. */
+function prepareArmPopulations(observations, assignments, options) {
+	const arms = [options.baselineArm, options.treatmentArm];
+	const roster = /* @__PURE__ */ new Map();
+	for (const entry of assignments) {
+		if (!arms.includes(entry.arm)) continue;
+		checkIdentity(entry);
+		const key = keyOf(entry);
+		if (roster.has(key)) throw new TypeError("Duplicate arm assignment");
+		roster.set(key, structuredClone(entry));
+	}
+	for (const arm of arms) if (![...roster.values()].some((r) => r.arm === arm)) throw new TypeError(`No assignment roster for arm '${arm}'`);
+	const actual = /* @__PURE__ */ new Map();
+	for (const row of observations) {
+		if (!arms.includes(row.arm)) continue;
+		checkObservation(row);
+		const key = keyOf(row);
+		if (!roster.has(key)) throw new TypeError("Observed seed is outside the assignment roster");
+		if (actual.has(key)) throw new TypeError("Duplicate arm observation");
+		actual.set(key, row);
+	}
+	const ordered = [...roster.entries()].sort(([a], [b]) => a < b ? -1 : a > b ? 1 : 0);
+	const rows = ordered.map(([key, entry]) => actual.get(key) ?? entry);
+	const metricNames = options.metricNames ?? [...new Set([...actual.values()].flatMap((r) => Object.keys(r.metrics ?? {})))].sort();
+	return {
+		rows,
+		readings: arms.map((arm) => {
+			const declared = ordered.filter(([, r]) => r.arm === arm);
+			const asAssigned = declared.map(([key]) => actual.get(key));
+			const asFormed = asAssigned.filter((row) => row?.formation?.formed === true);
+			return {
+				arm,
+				assignments: declared.map(([, r]) => r),
+				missingObservations: asAssigned.filter((r) => r === void 0).length,
+				formation: {
+					formed: asFormed.length,
+					notFormed: asAssigned.filter((r) => r?.formation?.formed === false).length,
+					unknown: asAssigned.filter((r) => r?.formation?.formed == null).length
+				},
+				asAssigned: summarize(asAssigned, metricNames),
+				asFormed: summarize(asFormed, metricNames)
+			};
+		})
+	};
+}
+function summarize(rows, names) {
+	const passed = rows.filter((r) => r?.pass === true).length;
+	const failed = rows.filter((r) => r?.pass === false).length;
+	const missingOutcomes = rows.length - passed - failed;
+	const metrics = Object.fromEntries(names.map((name) => {
+		const values = rows.map((r) => r?.metrics?.[name]).filter((x) => x != null);
+		const sum = values.length ? values.reduce((s, v) => s + v, 0) : null;
+		return [name, {
+			n: values.length,
+			missing: rows.length - values.length,
+			sum,
+			mean: sum === null ? null : sum / values.length
+		}];
+	}));
+	return {
+		n: rows.length,
+		passed,
+		failed,
+		missingOutcomes,
+		passRate: rows.length && !missingOutcomes ? passed / rows.length : null,
+		metrics
+	};
+}
+// src/paired-arms.ts
+/**
+* Match rows across two arms into (baseline, treatment) pairs by `pairKey`.
+*
+* A `pairKey` with at most one row per arm pairs directly, no `repKey`
+* needed. A `pairKey` with multiple reps in either arm requires `repKey` on
+* every one of its rows, and reps pair only on exact (`pairKey`, `repKey`)
+* match — pairing is keyed purely on row identity, never on outcome content
+* (outcome-keyed matching deflates discordant counts and biases McNemar), and
+* is therefore independent of input order. Reps whose `repKey` has no
+* counterpart in the other arm, and items present in only one arm, land in
+* the unpaired lists — reported, never truncated.
+*
+* Fail-loud: throws when either named arm has zero rows (an unknown arm
+* name would otherwise read as "everything unpaired"), when the two arm
+* names are equal, when a multi-rep `pairKey` has a row without `repKey`, or
+* when a (`pairKey`, arm) group repeats a `repKey` (the match would be
+* ambiguous).
+*/
+function pairArms(rows, opts) {
+	const { baselineArm, treatmentArm } = opts;
+	if (baselineArm === treatmentArm) throw new ValidationError(`pairArms: baselineArm and treatmentArm are both '${baselineArm}' — an arm cannot be compared to itself`);
+	const byArm = /* @__PURE__ */ new Map();
+	const armsSeen = /* @__PURE__ */ new Set();
+	for (const row of rows) {
+		armsSeen.add(row.arm);
+		if (row.arm !== baselineArm && row.arm !== treatmentArm) continue;
+		const byKey = byArm.get(row.arm) ?? /* @__PURE__ */ new Map();
+		const group = byKey.get(row.pairKey) ?? [];
+		group.push(row);
+		byKey.set(row.pairKey, group);
+		byArm.set(row.arm, byKey);
+	}
+	for (const arm of [baselineArm, treatmentArm]) if (!byArm.has(arm)) {
+		const seen = [...armsSeen].sort().join(", ") || "<none>";
+		throw new ValidationError(`pairArms: no rows for arm '${arm}' (arms present: ${seen})`);
+	}
+	const baselineByKey = byArm.get(baselineArm);
+	const treatmentByKey = byArm.get(treatmentArm);
+	const allKeys = [.../* @__PURE__ */ new Set([...baselineByKey.keys(), ...treatmentByKey.keys()])].sort();
+	const pairs = [];
+	const unpairedBaseline = [];
+	const unpairedTreatment = [];
+	for (const pairKey of allKeys) {
+		const b = baselineByKey.get(pairKey) ?? [];
+		const t = treatmentByKey.get(pairKey) ?? [];
+		if (b.length <= 1 && t.length <= 1) {
+			if (b.length === 1 && t.length === 1) {
+				const baseline = b[0];
+				const treatment = t[0];
+				if (baseline.repKey !== void 0 || treatment.repKey !== void 0) {
+					if (baseline.repKey === void 0 || treatment.repKey === void 0 || baseline.repKey !== treatment.repKey) {
+						unpairedBaseline.push(baseline);
+						unpairedTreatment.push(treatment);
+						continue;
+					}
+				}
+				pairs.push({
+					pairKey,
+					repIndex: 0,
+					baseline,
+					treatment
+				});
+			} else {
+				unpairedBaseline.push(...b);
+				unpairedTreatment.push(...t);
+			}
+			continue;
+		}
+		const bByRep = indexByRepKey(b, pairKey, baselineArm);
+		const tByRep = indexByRepKey(t, pairKey, treatmentArm);
+		const repKeys = [.../* @__PURE__ */ new Set([...bByRep.keys(), ...tByRep.keys()])].sort();
+		let repIndex = 0;
+		for (const repKey of repKeys) {
+			const baseline = bByRep.get(repKey);
+			const treatment = tByRep.get(repKey);
+			if (baseline !== void 0 && treatment !== void 0) pairs.push({
+				pairKey,
+				repIndex: repIndex++,
+				baseline,
+				treatment
+			});
+			else if (baseline !== void 0) unpairedBaseline.push(baseline);
+			else if (treatment !== void 0) unpairedTreatment.push(treatment);
+		}
+	}
+	return {
+		pairs,
+		unpairedBaseline,
+		unpairedTreatment
+	};
+}
+/** Index a multi-rep (pairKey, arm) group by `repKey`, enforcing that every
+*  row carries one and that no repKey repeats within the group. */
+function indexByRepKey(group, pairKey, arm) {
+	const byRep = /* @__PURE__ */ new Map();
+	for (const row of group) {
+		if (row.repKey === void 0) throw new ValidationError(`pairArms: pairKey '${pairKey}' has multiple reps in an arm, but a row in arm '${arm}' is missing repKey — multi-rep items require an explicit repKey on every row so reps pair by identity (pairing reps by outcome or by index would bias the paired statistics)`);
+		if (byRep.has(row.repKey)) throw new ValidationError(`pairArms: duplicate repKey '${row.repKey}' for pairKey '${pairKey}' in arm '${arm}' — (pairKey, repKey) must uniquely identify a rep within an arm`);
+		byRep.set(row.repKey, row);
+	}
+	return byRep;
+}
+/**
+* Full matched-pair arm comparison: pair via {@link pairArms}, then compose
+* the paired estimators from `statistics` over the matched pairs.
+*
+* Correctness uses only the pairs where both sides carry `pass` (`mcnemar.n`
+* is that subset's size); each metric uses only the pairs where both sides
+* carry a finite value for it, with the remainder counted in `nMissing`.
+* Deltas are treatment − baseline throughout. With an assignment roster, pairing
+* covers declared seed identities; missing observations remain identity-only rows
+* and never contribute fabricated outcomes or metrics. Per-arm summaries report
+* every assignment and the explicitly formed subset separately.
+*
+* Fail-loud: inherits {@link pairArms}'s unknown-arm throw, and throws on a
+* non-finite metric value — silently treating corrupt telemetry as "metric
+* absent" would misreport it as missing coverage.
+*/
+function comparePairedArms(rows, opts) {
+	const populations = opts.assignments === void 0 ? void 0 : prepareArmPopulations(rows, opts.assignments, opts);
+	const { pairs, unpairedBaseline, unpairedTreatment } = pairArms(populations?.rows ?? rows, opts);
+	let correctness = null;
+	const baselinePass = [];
+	const treatmentPass = [];
+	for (const pair of pairs) {
+		if (pair.baseline.pass == null || pair.treatment.pass == null) continue;
+		baselinePass.push(pair.baseline.pass ? 1 : 0);
+		treatmentPass.push(pair.treatment.pass ? 1 : 0);
+	}
+	if (baselinePass.length > 0) {
+		const mc = mcnemar(baselinePass, treatmentPass);
+		correctness = {
+			b10: mc.b,
+			b01: mc.c,
+			mcnemar: mc,
+			riskDifference: pairedRiskDifference(baselinePass, treatmentPass)
+		};
+	}
+	const metricDeltas = (opts.metricNames ?? [...new Set(pairs.flatMap((p) => [...Object.keys(p.baseline.metrics ?? {}), ...Object.keys(p.treatment.metrics ?? {})]))].sort()).map((name) => {
+		const before = [];
+		const after = [];
+		let nMissing = 0;
+		for (const pair of pairs) {
+			const b = metricValue(pair.baseline, name);
+			const t = metricValue(pair.treatment, name);
+			if (b === void 0 || t === void 0) {
+				nMissing++;
+				continue;
+			}
+			before.push(b);
+			after.push(t);
+		}
+		const bootstrapCi = before.length === 0 ? null : pairedBootstrap(before, after, opts.bootstrap);
+		return {
+			name,
+			n: before.length,
+			nMissing,
+			medianDelta: bootstrapCi?.median ?? null,
+			meanDelta: bootstrapCi?.mean ?? null,
+			bootstrapCi,
+			wilcoxon: before.length === 0 ? null : wilcoxonSignedRank(before, after)
+		};
+	});
+	return {
+		...populations ? { armPopulations: populations.readings } : {},
+		nPairs: pairs.length,
+		nUnpairedBaseline: unpairedBaseline.length,
+		nUnpairedTreatment: unpairedTreatment.length,
+		correctness,
+		metricDeltas
+	};
+}
+/**
+* Pair two RunRecord arms by the identity of the evaluated work:
+* `(experimentId, scenarioId, seed)`.
+*
+* Falling back to array order, candidate id, or experiment id can compare
+* different tasks and fabricate lift. Duplicate identities throw.
+*/
+function pairRunRecords(baselineRuns, treatmentRuns) {
+	const baselineRows = runRecordArmRows(baselineRuns, "baseline");
+	const treatmentRows = runRecordArmRows(treatmentRuns, "treatment");
+	validateRunRecordArmRows(baselineRows, "baseline");
+	validateRunRecordArmRows(treatmentRows, "treatment");
+	if (baselineRows.length === 0 || treatmentRows.length === 0) return {
+		pairs: [],
+		unpairedBaseline: baselineRows.map((row) => row.run),
+		unpairedTreatment: treatmentRows.map((row) => row.run)
+	};
+	const result = pairArms([...baselineRows, ...treatmentRows], {
+		baselineArm: "baseline",
+		treatmentArm: "treatment"
+	});
+	return {
+		pairs: result.pairs.map((pair) => {
+			const baseline = pair.baseline;
+			const treatment = pair.treatment;
+			return {
+				pairKey: pair.pairKey,
+				repKey: baseline.repKey,
+				baseline: baseline.run,
+				treatment: treatment.run
+			};
+		}),
+		unpairedBaseline: result.unpairedBaseline.map((row) => row.run),
+		unpairedTreatment: result.unpairedTreatment.map((row) => row.run)
+	};
+}
+function runRecordArmRows(runs, arm) {
+	return runs.map((run) => {
+		const scenarioId = run.scenarioId.trim();
+		if (!scenarioId) throw new ValidationError(`pairRunRecords: run '${run.runId}' is missing scenarioId; paired comparisons require explicit scenario identity`);
+		return {
+			pairKey: JSON.stringify([run.experimentId, scenarioId]),
+			repKey: String(run.seed),
+			arm,
+			run
+		};
+	});
+}
+function validateRunRecordArmRows(rows, arm) {
+	const byPairKey = /* @__PURE__ */ new Map();
+	for (const row of rows) {
+		const group = byPairKey.get(row.pairKey) ?? [];
+		group.push(row);
+		byPairKey.set(row.pairKey, group);
+	}
+	for (const [pairKey, group] of byPairKey) if (group.length > 1) indexByRepKey(group, pairKey, arm);
+}
+function metricValue(row, name) {
+	const v = row.metrics?.[name];
+	if (v == null) return void 0;
+	if (!Number.isFinite(v)) throw new ValidationError(`comparePairedArms: non-finite value for metric '${name}' on pairKey '${row.pairKey}' (arm '${row.arm}'): ${v}`);
+	return v;
+}
+export { pairArms as n, pairRunRecords as r, comparePairedArms as t };
+
+//# sourceMappingURL=paired-arms-DjMEtYI9.js.map