@disclosureos/scoring 1.0.0

package/CHANGELOG.md

@@ -0,0 +1,17 @@
+# Changelog
+
+All notable changes to `@disclosureos/scoring` are documented here. The format is
+based on [Keep a Changelog](https://keepachangelog.com/en/1.1.0/) and this project
+adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
+
+## 1.0.0
+
+Initial public release — the Scoring layer.
+
+### Added
+- `getCompleteness` (how well-documented a record is) and `score` /
+  `rankByCompellingness` (how anomalous a case is).
+- Scoring over arrays of competing claims: results include a `range` (spread across
+  claims) and a `contested` flag when evaluators disagree.
+- `DEFAULT_WEIGHTS` and configurable evaluator weighting.
+- Committed JSON Schema artifact (`schema/scoring.schema.json`, draft 2020-12).

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Disclosure Foundation
+
+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,89 @@
+# @disclosureos/scoring
+
+[![License: MIT](https://img.shields.io/badge/License-MIT-blue.svg)](https://opensource.org/licenses/MIT)
+
+Reference scoring for the [DisclosureOS](https://github.com/disclosurefoundation)
+ecosystem — the **Scoring** layer. It turns an enriched `Observation` into two
+orthogonal measures:
+
+- **Completeness** — *is it well-documented?* What fraction of the record's fields are
+  present.
+- **Compellingness** — *is it anomalous / non-mundane?* Derived from the observable
+  assessments and origin classification.
+
+## The DisclosureOS model
+
+DisclosureOS is a **five-part standard**. Each part answers one question about an
+observation; `@disclosureos/schema` binds the package-owned pieces into one portable
+contract (a single TS type + JSON Schema + non-stripping parse).
+
+| Part | Package surface | Question it answers |
+|---|---|---|
+| **Records** | `@disclosureos/records` | *What was observed?* |
+| **Observables** | `@disclosureos/observables` | *What anomalous characteristics did it show?* |
+| **Origins** | `@disclosureos/origins` | *What might explain it?* |
+| **Claims** | `@disclosureos/records/shared` | *Who assessed it, why, and on what evidence?* |
+| **Scoring** | `@disclosureos/scoring` | *How complete / compelling is the case?* |
+
+Supporting packages: **`@disclosureos/schema`** (the portable contract that composes the
+package-owned pieces), **`@disclosureos/cli`** (tooling), and **`@disclosureos/examples`**
+(the runnable golden path). *(You are here: **Scoring**.)*
+
+## Consumes the foundation (does not augment it)
+
+Unlike `observables` and `origins`, scoring **only consumes** the foundation — it
+reads `observableAssessments` and `origin` but adds no slot to `Observation`. It
+depends on `@disclosureos/records`, `@disclosureos/observables`, and
+`@disclosureos/origins`, so importing it gives you those slots typed automatically.
+
+> **See it end to end.** [`examples/golden-path.ts`](../../examples/golden-path.ts)
+> takes one observation through every layer — records → observables → origins → scoring,
+> validated as a whole by `@disclosureos/schema` — in a single type-checked file. Run it
+> with `pnpm --filter @disclosureos/examples golden-path`.
+>
+> **Migrating an existing dataset?** See [`examples/migration-path.ts`](../../examples/migration-path.ts)
+> and the [onboarding workspace](https://os.disclosure.org/onboard).
+
+## Install
+
+```bash
+pnpm add @disclosureos/scoring @disclosureos/records @disclosureos/observables @disclosureos/origins zod
+```
+
+## Quick start
+
+```typescript
+import { score, getCompleteness, rankByCompellingness } from '@disclosureos/scoring';
+
+const result = score(observation);
+// { score, range: { low, high }, contested, ... }
+
+const completeness = getCompleteness(observation);
+// { percentage, requiredPercentage, missing, ... }
+
+const ranked = rankByCompellingness([obsA, obsB, obsC]); // most-compelling first
+```
+
+Because evaluative slots hold **arrays of competing claims**, `score()` reports a
+`range` (the spread across claims) and a `contested` flag when evaluators disagree —
+not just a single point estimate.
+
+## Subpath exports
+
+| Subpath | Contents |
+|---|---|
+| `@disclosureos/scoring` | `score`, `rankByCompellingness`, `getCompleteness`, `DEFAULT_WEIGHTS` |
+| `@disclosureos/scoring/completeness` | Completeness scoring + `deriveFieldPaths` |
+| `@disclosureos/scoring/compellingness` | Compellingness scoring + weights |
+| `@disclosureos/scoring/schema` | The committed JSON Schema (`scoring.schema.json`) |
+
+## Standard Schema
+
+The Zod schemas here (`ScoreResultSchema`, `CompletenessResultSchema`, …) implement
+[Standard Schema v1](https://standardschema.dev) via their `~standard` property — a
+guarantee of Zod 4. Any Standard-Schema-compatible validator or framework can consume
+them directly, with no DisclosureOS-specific adapter.
+
+## License
+
+MIT © [Disclosure Foundation](https://disclosure.org)

package/dist/compellingness/index.d.ts

@@ -0,0 +1,99 @@
+import { z } from 'zod';
+import { Observation } from '@disclosureos/records';
+import { AssessmentLevel } from '@disclosureos/observables';
+
+/** Methodology version stamped on every {@link ScoreResult}. Bump on weight/formula changes. */
+declare const SCORING_VERSION: "2.0.0";
+/**
+ * Ordinal anomaly strength per evidentiary tier. A `confirmed` signal counts
+ * fully; `not_indicated` contributes nothing. Multiplied by the assessment's
+ * confidence (default 1 when unstated). Exported so consumers can render the
+ * methodology; override semantics may come in a future minor release.
+ */
+declare const ASSESSMENT_LEVEL_WEIGHTS: Record<AssessmentLevel, number>;
+/**
+ * OCS id prefixes treated as prosaic (well-explained). A confident *prosaic*
+ * classification means the case is explained, so it contributes no anomaly
+ * signal. Overridable per {@link score} call. Default is the OCS "Prosaic"
+ * branch (`1.1.1`).
+ */
+declare const DEFAULT_PROSAIC_OCS_PREFIXES: readonly string[];
+declare const CompellingnessWeightsSchema: z.ZodObject<{
+    technology: z.ZodNumber;
+    biologics: z.ZodNumber;
+    origin: z.ZodNumber;
+}, z.core.$strip>;
+type CompellingnessWeights = z.infer<typeof CompellingnessWeightsSchema>;
+/**
+ * Fixed default weights, exposed as a transparent, overridable data object (not a
+ * config system). Partners can propose alternate weight sets without an API change.
+ *
+ * @experimental The *shape* (`CompellingnessWeights`) is stable, but these specific
+ * default values are a reference methodology that may be re-tuned in a minor release.
+ * Pin your own `weights` via {@link ScoreOptions} if you need stable numbers.
+ */
+declare const DEFAULT_WEIGHTS: CompellingnessWeights;
+declare const ScoreResultSchema: z.ZodObject<{
+    score: z.ZodNumber;
+    range: z.ZodObject<{
+        low: z.ZodNumber;
+        high: z.ZodNumber;
+    }, z.core.$strip>;
+    contested: z.ZodBoolean;
+    components: z.ZodObject<{
+        technology: z.ZodNumber;
+        biologics: z.ZodNumber;
+        origin: z.ZodNumber;
+    }, z.core.$strip>;
+    weights: z.ZodObject<{
+        technology: z.ZodNumber;
+        biologics: z.ZodNumber;
+        origin: z.ZodNumber;
+    }, z.core.$strip>;
+    scoringVersion: z.ZodString;
+}, z.core.$strip>;
+type ScoreResult = z.infer<typeof ScoreResultSchema>;
+/** The minimal claim shape the trust hook sees (it never needs the full body). */
+type EvaluatorWeightInput = {
+    evaluatedBy?: string | undefined;
+    evidenceRefs?: string[] | undefined;
+};
+interface ScoreOptions {
+    weights?: CompellingnessWeights;
+    /** Override the prosaic OCS prefixes (defaults to {@link DEFAULT_PROSAIC_OCS_PREFIXES}). */
+    prosaicPrefixes?: readonly string[];
+    /**
+     * Trust applied to each claim's vote in the consensus point estimate (default
+     * 1.0 — uniform). This is where a future trust policy (e.g.
+     * weighting verified/official evaluators higher) plugs in here without changing
+     * the formula. Range/contestedness are NOT affected — they report the honest
+     * spread of what evaluators actually asserted.
+     *
+     * @experimental The hook signature is stable, but the default trust *policy*
+     * (uniform 1.0) is deliberately unopinionated and is a separate, ongoing design
+     * task; a future built-in policy may change the default.
+     */
+    evaluatorWeight?: (claim: EvaluatorWeightInput) => number;
+}
+/**
+ * Reference compellingness scorer. Combines the strongest technology- and
+ * biologics-anomaly signals (from `observableAssessments`) with the confidence in
+ * a *non-prosaic* origin classification (from `origin`), under transparent,
+ * overridable weights. Each slot is a *list* of competing claims, so the scorer
+ * reports a consensus `score`, the `range` of readings across claims, and whether
+ * the case is `contested` (evaluators disagree on direction). This answers "how
+ * strongly does this case bear on the two public questions — anomalous
+ * tech/biologics, and a non-mundane origin?" — distinct from completeness.
+ */
+declare function score(observation: Observation, options?: ScoreOptions): ScoreResult;
+interface RankedObservation<T extends Observation = Observation> {
+    observation: T;
+    result: ScoreResult;
+}
+/**
+ * Score a set of observations and return them sorted most-compelling first — the
+ * "float the strongest cases to the top" use case.
+ */
+declare function rankByCompellingness<T extends Observation>(observations: readonly T[], options?: ScoreOptions): RankedObservation<T>[];
+
+export { ASSESSMENT_LEVEL_WEIGHTS, type CompellingnessWeights, CompellingnessWeightsSchema, DEFAULT_PROSAIC_OCS_PREFIXES, DEFAULT_WEIGHTS, type EvaluatorWeightInput, type RankedObservation, SCORING_VERSION, type ScoreOptions, type ScoreResult, ScoreResultSchema, rankByCompellingness, score };

package/dist/compellingness/index.js

@@ -0,0 +1,136 @@
+import { z } from 'zod';
+import '@disclosureos/observables';
+import '@disclosureos/origins';
+
+// src/compellingness/index.ts
+var SCORING_VERSION = "2.0.0";
+var ASSESSMENT_LEVEL_WEIGHTS = {
+  not_indicated: 0,
+  reported: 0.25,
+  documented: 0.5,
+  measured: 0.75,
+  confirmed: 1
+};
+var DEFAULT_PROSAIC_OCS_PREFIXES = ["1.1.1"];
+var CompellingnessWeightsSchema = z.object({
+  technology: z.number().min(0).describe("Weight of the technology-anomaly signal."),
+  biologics: z.number().min(0).describe("Weight of the biologics-anomaly signal."),
+  origin: z.number().min(0).describe("Weight of the (non-prosaic) origin-confidence signal.")
+}).meta({ id: "CompellingnessWeights" }).describe("Relative weights for the compellingness components. Need not sum to 1 \u2014 normalized internally.");
+var DEFAULT_WEIGHTS = {
+  technology: 0.45,
+  biologics: 0.35,
+  origin: 0.2
+};
+var ScoreResultSchema = z.object({
+  score: z.number().min(0).max(1).describe("Overall compellingness (consensus point estimate), 0\u20131."),
+  range: z.object({
+    low: z.number().min(0).max(1).describe("Most-skeptical reading of the strongest-anomaly signal across competing claims."),
+    high: z.number().min(0).max(1).describe("Most-anomalous reading of the strongest-anomaly signal across competing claims.")
+  }).describe(
+    "Spread of the score across competing claims \u2014 wide range signals disagreement. Bounds are computed per-signal under the same strongest-anomaly (max) reduction as the point estimate, not a global min/max over every claim."
+  ),
+  contested: z.boolean().describe("True when claims disagree on *direction* (some assert anomaly, some assert none)."),
+  components: z.object({
+    technology: z.number().min(0).max(1),
+    biologics: z.number().min(0).max(1),
+    origin: z.number().min(0).max(1)
+  }).describe("Per-signal consensus contributions before weighting."),
+  weights: CompellingnessWeightsSchema,
+  scoringVersion: z.string().describe("Methodology version that produced this score.")
+}).meta({ id: "ScoreResult" }).describe("A reference compellingness score for an observation, with a contestedness range.");
+var UNIFORM_TRUST = () => 1;
+function isProsaic(id, prefixes) {
+  return prefixes.some((p) => id === p || id.startsWith(`${p}.`));
+}
+function round(n) {
+  return Math.round(n * 1e4) / 1e4;
+}
+var EMPTY_STATS = { point: 0, low: 0, high: 0, contested: false };
+function reduceClaims(weighted) {
+  if (weighted.length === 0) return EMPTY_STATS;
+  let wsum = 0;
+  let msum = 0;
+  let low = Infinity;
+  let high = -Infinity;
+  let anyAnomaly = false;
+  let anyNone = false;
+  for (const { magnitude, weight } of weighted) {
+    wsum += weight;
+    msum += magnitude * weight;
+    if (magnitude < low) low = magnitude;
+    if (magnitude > high) high = magnitude;
+    if (magnitude > 0) anyAnomaly = true;
+    else anyNone = true;
+  }
+  return {
+    point: wsum > 0 ? msum / wsum : 0,
+    low,
+    high,
+    contested: anyAnomaly && anyNone
+  };
+}
+function observableMagnitude(claim) {
+  return ASSESSMENT_LEVEL_WEIGHTS[claim.level] * (claim.confidence ?? 1);
+}
+function domainStats(group, evaluatorWeight) {
+  if (!group) return EMPTY_STATS;
+  let point = 0;
+  let low = 0;
+  let high = 0;
+  let contested = false;
+  for (const claims of Object.values(group)) {
+    if (!claims || claims.length === 0) continue;
+    const weighted = claims.map((c) => ({
+      magnitude: observableMagnitude(c),
+      weight: (c.confidence ?? 1) * evaluatorWeight(c)
+    }));
+    const stats = reduceClaims(weighted);
+    if (stats.point > point) point = stats.point;
+    if (stats.low > low) low = stats.low;
+    if (stats.high > high) high = stats.high;
+    if (stats.contested) contested = true;
+  }
+  return { point, low, high, contested };
+}
+function originStats(origin, prefixes, evaluatorWeight) {
+  if (!origin || origin.length === 0) return EMPTY_STATS;
+  const weighted = origin.map((c) => ({
+    magnitude: isProsaic(c.primaryHypothesis, prefixes) ? 0 : c.confidence,
+    weight: c.confidence * evaluatorWeight(c)
+  }));
+  return reduceClaims(weighted);
+}
+function score(observation, options) {
+  const weights = options?.weights ?? DEFAULT_WEIGHTS;
+  const prosaicPrefixes = options?.prosaicPrefixes ?? DEFAULT_PROSAIC_OCS_PREFIXES;
+  const evaluatorWeight = options?.evaluatorWeight ?? UNIFORM_TRUST;
+  const assessments = observation.observableAssessments;
+  const technology = domainStats(assessments?.technology, evaluatorWeight);
+  const biologics = domainStats(assessments?.biologics, evaluatorWeight);
+  const origin = originStats(observation.origin, prosaicPrefixes, evaluatorWeight);
+  const totalWeight = weights.technology + weights.biologics + weights.origin;
+  const combine = (t, b, o) => totalWeight > 0 ? (t * weights.technology + b * weights.biologics + o * weights.origin) / totalWeight : 0;
+  return {
+    score: round(combine(technology.point, biologics.point, origin.point)),
+    range: {
+      low: round(combine(technology.low, biologics.low, origin.low)),
+      high: round(combine(technology.high, biologics.high, origin.high))
+    },
+    contested: technology.contested || biologics.contested || origin.contested,
+    components: {
+      technology: round(technology.point),
+      biologics: round(biologics.point),
+      origin: round(origin.point)
+    },
+    weights,
+    scoringVersion: SCORING_VERSION
+  };
+}
+function rankByCompellingness(observations, options) {
+  return observations.map((observation) => ({ observation, result: score(observation, options) })).sort((a, b) => b.result.score - a.result.score);
+}
+
+export { ASSESSMENT_LEVEL_WEIGHTS, CompellingnessWeightsSchema, DEFAULT_PROSAIC_OCS_PREFIXES, DEFAULT_WEIGHTS, SCORING_VERSION, ScoreResultSchema, rankByCompellingness, score };
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/dist/compellingness/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/compellingness/index.ts"],"names":[],"mappings":";;;;;AAUO,IAAM,eAAA,GAAkB;AAQxB,IAAM,wBAAA,GAA4D;AAAA,EACvE,aAAA,EAAe,CAAA;AAAA,EACf,QAAA,EAAU,IAAA;AAAA,EACV,UAAA,EAAY,GAAA;AAAA,EACZ,QAAA,EAAU,IAAA;AAAA,EACV,SAAA,EAAW;AACb;AAQO,IAAM,4BAAA,GAAkD,CAAC,OAAO;AAEhE,IAAM,2BAAA,GAA8B,EACxC,MAAA,CAAO;AAAA,EACN,UAAA,EAAY,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,0CAA0C,CAAA;AAAA,EACjF,SAAA,EAAW,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,yCAAyC,CAAA;AAAA,EAC/E,MAAA,EAAQ,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,uDAAuD;AAC5F,CAAC,CAAA,CACA,KAAK,EAAE,EAAA,EAAI,yBAAyB,CAAA,CACpC,SAAS,qGAAgG;AAYrG,IAAM,eAAA,GAAyC;AAAA,EACpD,UAAA,EAAY,IAAA;AAAA,EACZ,SAAA,EAAW,IAAA;AAAA,EACX,MAAA,EAAQ;AACV;AAEO,IAAM,iBAAA,GAAoB,EAC9B,MAAA,CAAO;AAAA,EACN,KAAA,EAAO,CAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,8DAAyD,CAAA;AAAA,EAClG,KAAA,EAAO,EACJ,MAAA,CAAO;AAAA,IACN,GAAA,EAAK,CAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,iFAAiF,CAAA;AAAA,IACxH,IAAA,EAAM,CAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,iFAAiF;AAAA,GAC1H,CAAA,CACA,QAAA;AAAA,IACC;AAAA,GAGF;AAAA,EACF,SAAA,EAAW,CAAA,CACR,OAAA,EAAQ,CACR,SAAS,mFAAmF,CAAA;AAAA,EAC/F,UAAA,EAAY,EACT,MAAA,CAAO;AAAA,IACN,UAAA,EAAY,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,IAAI,CAAC,CAAA;AAAA,IACnC,SAAA,EAAW,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,IAAI,CAAC,CAAA;AAAA,IAClC,MAAA,EAAQ,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,IAAI,CAAC;AAAA,GAChC,CAAA,CACA,QAAA,CAAS,sDAAsD,CAAA;AAAA,EAClE,OAAA,EAAS,2BAAA;AAAA,EACT,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,+CAA+C;AACrF,CAAC,CAAA,CACA,KAAK,EAAE,EAAA,EAAI,eAAe,CAAA,CAC1B,SAAS,kFAAkF;AA4B9F,IAAM,gBAAgB,MAAc,CAAA;AAEpC,SAAS,SAAA,CAAU,IAAY,QAAA,EAAsC;AACnE,EAAA,OAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,EAAA,KAAO,CAAA,IAAK,EAAA,CAAG,UAAA,CAAW,CAAA,EAAG,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA;AAChE;AAEA,SAAS,MAAM,CAAA,EAAmB;AAChC,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,GAAG,CAAA,GAAI,GAAA;AAC/B;AAeA,IAAM,WAAA,GAA0B,EAAE,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,EAAG,IAAA,EAAM,CAAA,EAAG,SAAA,EAAW,KAAA,EAAM;AAE9E,SAAS,aAAa,QAAA,EAAkC;AACtD,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,WAAA;AAClC,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,GAAA,GAAM,QAAA;AACV,EAAA,IAAI,IAAA,GAAO,CAAA,QAAA;AACX,EAAA,IAAI,UAAA,GAAa,KAAA;AACjB,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,KAAA,MAAW,EAAE,SAAA,EAAW,MAAA,EAAO,IAAK,QAAA,EAAU;AAC5C,IAAA,IAAA,IAAQ,MAAA;AACR,IAAA,IAAA,IAAQ,SAAA,GAAY,MAAA;AACpB,IAAA,IAAI,SAAA,GAAY,KAAK,GAAA,GAAM,SAAA;AAC3B,IAAA,IAAI,SAAA,GAAY,MAAM,IAAA,GAAO,SAAA;AAC7B,IAAA,IAAI,SAAA,GAAY,GAAG,UAAA,GAAa,IAAA;AAAA,SAC3B,OAAA,GAAU,IAAA;AAAA,EACjB;AACA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,IAAA,GAAO,CAAA,GAAI,IAAA,GAAO,IAAA,GAAO,CAAA;AAAA,IAChC,GAAA;AAAA,IACA,IAAA;AAAA,IACA,WAAW,UAAA,IAAc;AAAA,GAC3B;AACF;AAGA,SAAS,oBAAoB,KAAA,EAAgC;AAC3D,EAAA,OAAO,wBAAA,CAAyB,KAAA,CAAM,KAAK,CAAA,IAAK,MAAM,UAAA,IAAc,CAAA,CAAA;AACtE;AAQA,SAAS,WAAA,CACP,OACA,eAAA,EACY;AACZ,EAAA,IAAI,CAAC,OAAO,OAAO,WAAA;AACnB,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,SAAA,GAAY,KAAA;AAChB,EAAA,KAAA,MAAW,MAAA,IAAU,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,EAAG;AACzC,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG;AACpC,IAAA,MAAM,QAAA,GAAW,MAAA,CAAO,GAAA,CAAc,CAAC,CAAA,MAAO;AAAA,MAC5C,SAAA,EAAW,oBAAoB,CAAC,CAAA;AAAA,MAChC,MAAA,EAAA,CAAS,CAAA,CAAE,UAAA,IAAc,CAAA,IAAK,gBAAgB,CAAC;AAAA,KACjD,CAAE,CAAA;AACF,IAAA,MAAM,KAAA,GAAQ,aAAa,QAAQ,CAAA;AACnC,IAAA,IAAI,KAAA,CAAM,KAAA,GAAQ,KAAA,EAAO,KAAA,GAAQ,KAAA,CAAM,KAAA;AACvC,IAAA,IAAI,KAAA,CAAM,GAAA,GAAM,GAAA,EAAK,GAAA,GAAM,KAAA,CAAM,GAAA;AACjC,IAAA,IAAI,KAAA,CAAM,IAAA,GAAO,IAAA,EAAM,IAAA,GAAO,KAAA,CAAM,IAAA;AACpC,IAAA,IAAI,KAAA,CAAM,WAAW,SAAA,GAAY,IAAA;AAAA,EACnC;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,GAAA,EAAK,IAAA,EAAM,SAAA,EAAU;AACvC;AAGA,SAAS,WAAA,CACP,MAAA,EACA,QAAA,EACA,eAAA,EACY;AACZ,EAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,MAAA,KAAW,GAAG,OAAO,WAAA;AAC3C,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,GAAA,CAAc,CAAC,CAAA,MAAO;AAAA,IAC5C,WAAW,SAAA,CAAU,CAAA,CAAE,mBAAmB,QAAQ,CAAA,GAAI,IAAI,CAAA,CAAE,UAAA;AAAA,IAC5D,MAAA,EAAQ,CAAA,CAAE,UAAA,GAAa,eAAA,CAAgB,CAAC;AAAA,GAC1C,CAAE,CAAA;AACF,EAAA,OAAO,aAAa,QAAQ,CAAA;AAC9B;AAYO,SAAS,KAAA,CAAM,aAA0B,OAAA,EAAqC;AACnF,EAAA,MAAM,OAAA,GAAU,SAAS,OAAA,IAAW,eAAA;AACpC,EAAA,MAAM,eAAA,GAAkB,SAAS,eAAA,IAAmB,4BAAA;AACpD,EAAA,MAAM,eAAA,GAAkB,SAAS,eAAA,IAAmB,aAAA;AAEpD,EAAA,MAAM,cAAc,WAAA,CAAY,qBAAA;AAChC,EAAA,MAAM,UAAA,GAAa,WAAA,CAAY,WAAA,EAAa,UAAA,EAAY,eAAe,CAAA;AACvE,EAAA,MAAM,SAAA,GAAY,WAAA,CAAY,WAAA,EAAa,SAAA,EAAW,eAAe,CAAA;AACrE,EAAA,MAAM,MAAA,GAAS,WAAA,CAAY,WAAA,CAAY,MAAA,EAAQ,iBAAiB,eAAe,CAAA;AAE/E,EAAA,MAAM,WAAA,GAAc,OAAA,CAAQ,UAAA,GAAa,OAAA,CAAQ,YAAY,OAAA,CAAQ,MAAA;AACrE,EAAA,MAAM,UAAU,CAAC,CAAA,EAAW,CAAA,EAAW,CAAA,KACrC,cAAc,CAAA,GAAA,CACT,CAAA,GAAI,OAAA,CAAQ,UAAA,GAAa,IAAI,OAAA,CAAQ,SAAA,GAAY,CAAA,GAAI,OAAA,CAAQ,UAAU,WAAA,GACxE,CAAA;AAEN,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,MAAM,OAAA,CAAQ,UAAA,CAAW,OAAO,SAAA,CAAU,KAAA,EAAO,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,IACrE,KAAA,EAAO;AAAA,MACL,GAAA,EAAK,MAAM,OAAA,CAAQ,UAAA,CAAW,KAAK,SAAA,CAAU,GAAA,EAAK,MAAA,CAAO,GAAG,CAAC,CAAA;AAAA,MAC7D,IAAA,EAAM,MAAM,OAAA,CAAQ,UAAA,CAAW,MAAM,SAAA,CAAU,IAAA,EAAM,MAAA,CAAO,IAAI,CAAC;AAAA,KACnE;AAAA,IACA,SAAA,EAAW,UAAA,CAAW,SAAA,IAAa,SAAA,CAAU,aAAa,MAAA,CAAO,SAAA;AAAA,IACjE,UAAA,EAAY;AAAA,MACV,UAAA,EAAY,KAAA,CAAM,UAAA,CAAW,KAAK,CAAA;AAAA,MAClC,SAAA,EAAW,KAAA,CAAM,SAAA,CAAU,KAAK,CAAA;AAAA,MAChC,MAAA,EAAQ,KAAA,CAAM,MAAA,CAAO,KAAK;AAAA,KAC5B;AAAA,IACA,OAAA;AAAA,IACA,cAAA,EAAgB;AAAA,GAClB;AACF;AAWO,SAAS,oBAAA,CACd,cACA,OAAA,EACwB;AACxB,EAAA,OAAO,YAAA,CACJ,IAAI,CAAC,WAAA,MAAiB,EAAE,WAAA,EAAa,MAAA,EAAQ,KAAA,CAAM,WAAA,EAAa,OAAO,CAAA,GAAI,CAAA,CAC3E,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,MAAA,CAAO,KAAA,GAAQ,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA;AACnD","file":"index.js","sourcesContent":["import { z } from 'zod';\nimport type { Observation } from '@disclosureos/records';\nimport type { AssessmentLevel, ObservableClaim } from '@disclosureos/observables';\nimport type { OriginClaim } from '@disclosureos/origins';\n// Side-effect imports register the `observableAssessments` and `origin` slots on\n// `Observation` via module augmentation, so they are typed below.\nimport '@disclosureos/observables';\nimport '@disclosureos/origins';\n\n/** Methodology version stamped on every {@link ScoreResult}. Bump on weight/formula changes. */\nexport const SCORING_VERSION = '2.0.0' as const;\n\n/**\n * Ordinal anomaly strength per evidentiary tier. A `confirmed` signal counts\n * fully; `not_indicated` contributes nothing. Multiplied by the assessment's\n * confidence (default 1 when unstated). Exported so consumers can render the\n * methodology; override semantics may come in a future minor release.\n */\nexport const ASSESSMENT_LEVEL_WEIGHTS: Record<AssessmentLevel, number> = {\n  not_indicated: 0,\n  reported: 0.25,\n  documented: 0.5,\n  measured: 0.75,\n  confirmed: 1,\n};\n\n/**\n * OCS id prefixes treated as prosaic (well-explained). A confident *prosaic*\n * classification means the case is explained, so it contributes no anomaly\n * signal. Overridable per {@link score} call. Default is the OCS \"Prosaic\"\n * branch (`1.1.1`).\n */\nexport const DEFAULT_PROSAIC_OCS_PREFIXES: readonly string[] = ['1.1.1'];\n\nexport const CompellingnessWeightsSchema = z\n  .object({\n    technology: z.number().min(0).describe('Weight of the technology-anomaly signal.'),\n    biologics: z.number().min(0).describe('Weight of the biologics-anomaly signal.'),\n    origin: z.number().min(0).describe('Weight of the (non-prosaic) origin-confidence signal.'),\n  })\n  .meta({ id: 'CompellingnessWeights' })\n  .describe('Relative weights for the compellingness components. Need not sum to 1 — normalized internally.');\n\nexport type CompellingnessWeights = z.infer<typeof CompellingnessWeightsSchema>;\n\n/**\n * Fixed default weights, exposed as a transparent, overridable data object (not a\n * config system). Partners can propose alternate weight sets without an API change.\n *\n * @experimental The *shape* (`CompellingnessWeights`) is stable, but these specific\n * default values are a reference methodology that may be re-tuned in a minor release.\n * Pin your own `weights` via {@link ScoreOptions} if you need stable numbers.\n */\nexport const DEFAULT_WEIGHTS: CompellingnessWeights = {\n  technology: 0.45,\n  biologics: 0.35,\n  origin: 0.2,\n};\n\nexport const ScoreResultSchema = z\n  .object({\n    score: z.number().min(0).max(1).describe('Overall compellingness (consensus point estimate), 0–1.'),\n    range: z\n      .object({\n        low: z.number().min(0).max(1).describe('Most-skeptical reading of the strongest-anomaly signal across competing claims.'),\n        high: z.number().min(0).max(1).describe('Most-anomalous reading of the strongest-anomaly signal across competing claims.'),\n      })\n      .describe(\n        'Spread of the score across competing claims — wide range signals disagreement. Bounds are '\n        + 'computed per-signal under the same strongest-anomaly (max) reduction as the point estimate, '\n        + 'not a global min/max over every claim.',\n      ),\n    contested: z\n      .boolean()\n      .describe('True when claims disagree on *direction* (some assert anomaly, some assert none).'),\n    components: z\n      .object({\n        technology: z.number().min(0).max(1),\n        biologics: z.number().min(0).max(1),\n        origin: z.number().min(0).max(1),\n      })\n      .describe('Per-signal consensus contributions before weighting.'),\n    weights: CompellingnessWeightsSchema,\n    scoringVersion: z.string().describe('Methodology version that produced this score.'),\n  })\n  .meta({ id: 'ScoreResult' })\n  .describe('A reference compellingness score for an observation, with a contestedness range.');\n\nexport type ScoreResult = z.infer<typeof ScoreResultSchema>;\n\n/** The minimal claim shape the trust hook sees (it never needs the full body). */\nexport type EvaluatorWeightInput = {\n  evaluatedBy?: string | undefined;\n  evidenceRefs?: string[] | undefined;\n};\n\nexport interface ScoreOptions {\n  weights?: CompellingnessWeights;\n  /** Override the prosaic OCS prefixes (defaults to {@link DEFAULT_PROSAIC_OCS_PREFIXES}). */\n  prosaicPrefixes?: readonly string[];\n  /**\n   * Trust applied to each claim's vote in the consensus point estimate (default\n   * 1.0 — uniform). This is where a future trust policy (e.g.\n   * weighting verified/official evaluators higher) plugs in here without changing\n   * the formula. Range/contestedness are NOT affected — they report the honest\n   * spread of what evaluators actually asserted.\n   *\n   * @experimental The hook signature is stable, but the default trust *policy*\n   * (uniform 1.0) is deliberately unopinionated and is a separate, ongoing design\n   * task; a future built-in policy may change the default.\n   */\n  evaluatorWeight?: (claim: EvaluatorWeightInput) => number;\n}\n\nconst UNIFORM_TRUST = (): number => 1;\n\nfunction isProsaic(id: string, prefixes: readonly string[]): boolean {\n  return prefixes.some((p) => id === p || id.startsWith(`${p}.`));\n}\n\nfunction round(n: number): number {\n  return Math.round(n * 1e4) / 1e4;\n}\n\ntype Weighted = { magnitude: number; weight: number };\n\ninterface ClaimStats {\n  /** Trust-weighted mean magnitude (the consensus point). */\n  point: number;\n  /** Min asserted magnitude (most skeptical). */\n  low: number;\n  /** Max asserted magnitude (most anomalous). */\n  high: number;\n  /** Claims disagree on direction (some > 0, some === 0). */\n  contested: boolean;\n}\n\nconst EMPTY_STATS: ClaimStats = { point: 0, low: 0, high: 0, contested: false };\n\nfunction reduceClaims(weighted: Weighted[]): ClaimStats {\n  if (weighted.length === 0) return EMPTY_STATS;\n  let wsum = 0;\n  let msum = 0;\n  let low = Infinity;\n  let high = -Infinity;\n  let anyAnomaly = false;\n  let anyNone = false;\n  for (const { magnitude, weight } of weighted) {\n    wsum += weight;\n    msum += magnitude * weight;\n    if (magnitude < low) low = magnitude;\n    if (magnitude > high) high = magnitude;\n    if (magnitude > 0) anyAnomaly = true;\n    else anyNone = true;\n  }\n  return {\n    point: wsum > 0 ? msum / wsum : 0,\n    low,\n    high,\n    contested: anyAnomaly && anyNone,\n  };\n}\n\n/** Asserted anomaly magnitude of one observable claim, in [0,1]. */\nfunction observableMagnitude(claim: ObservableClaim): number {\n  return ASSESSMENT_LEVEL_WEIGHTS[claim.level] * (claim.confidence ?? 1);\n}\n\n/**\n * Strongest established anomaly within a domain — the \"is there *any* anomaly?\" reduction.\n * `point`/`low`/`high` are each a **max across observables** of that observable's claim-list\n * stat. So `low` is \"the most-skeptical reading of the strongest-anomaly observable,\" not a\n * global floor across all observables — consistent with the point estimate's max reduction.\n */\nfunction domainStats(\n  group: Partial<Record<string, ObservableClaim[]>> | undefined,\n  evaluatorWeight: (claim: EvaluatorWeightInput) => number,\n): ClaimStats {\n  if (!group) return EMPTY_STATS;\n  let point = 0;\n  let low = 0;\n  let high = 0;\n  let contested = false;\n  for (const claims of Object.values(group)) {\n    if (!claims || claims.length === 0) continue;\n    const weighted = claims.map<Weighted>((c) => ({\n      magnitude: observableMagnitude(c),\n      weight: (c.confidence ?? 1) * evaluatorWeight(c),\n    }));\n    const stats = reduceClaims(weighted);\n    if (stats.point > point) point = stats.point;\n    if (stats.low > low) low = stats.low;\n    if (stats.high > high) high = stats.high;\n    if (stats.contested) contested = true;\n  }\n  return { point, low, high, contested };\n}\n\n/** Confidence in a *non-prosaic* origin, reduced across competing classifications. */\nfunction originStats(\n  origin: OriginClaim[] | undefined,\n  prefixes: readonly string[],\n  evaluatorWeight: (claim: EvaluatorWeightInput) => number,\n): ClaimStats {\n  if (!origin || origin.length === 0) return EMPTY_STATS;\n  const weighted = origin.map<Weighted>((c) => ({\n    magnitude: isProsaic(c.primaryHypothesis, prefixes) ? 0 : c.confidence,\n    weight: c.confidence * evaluatorWeight(c),\n  }));\n  return reduceClaims(weighted);\n}\n\n/**\n * Reference compellingness scorer. Combines the strongest technology- and\n * biologics-anomaly signals (from `observableAssessments`) with the confidence in\n * a *non-prosaic* origin classification (from `origin`), under transparent,\n * overridable weights. Each slot is a *list* of competing claims, so the scorer\n * reports a consensus `score`, the `range` of readings across claims, and whether\n * the case is `contested` (evaluators disagree on direction). This answers \"how\n * strongly does this case bear on the two public questions — anomalous\n * tech/biologics, and a non-mundane origin?\" — distinct from completeness.\n */\nexport function score(observation: Observation, options?: ScoreOptions): ScoreResult {\n  const weights = options?.weights ?? DEFAULT_WEIGHTS;\n  const prosaicPrefixes = options?.prosaicPrefixes ?? DEFAULT_PROSAIC_OCS_PREFIXES;\n  const evaluatorWeight = options?.evaluatorWeight ?? UNIFORM_TRUST;\n\n  const assessments = observation.observableAssessments;\n  const technology = domainStats(assessments?.technology, evaluatorWeight);\n  const biologics = domainStats(assessments?.biologics, evaluatorWeight);\n  const origin = originStats(observation.origin, prosaicPrefixes, evaluatorWeight);\n\n  const totalWeight = weights.technology + weights.biologics + weights.origin;\n  const combine = (t: number, b: number, o: number): number =>\n    totalWeight > 0\n      ? (t * weights.technology + b * weights.biologics + o * weights.origin) / totalWeight\n      : 0;\n\n  return {\n    score: round(combine(technology.point, biologics.point, origin.point)),\n    range: {\n      low: round(combine(technology.low, biologics.low, origin.low)),\n      high: round(combine(technology.high, biologics.high, origin.high)),\n    },\n    contested: technology.contested || biologics.contested || origin.contested,\n    components: {\n      technology: round(technology.point),\n      biologics: round(biologics.point),\n      origin: round(origin.point),\n    },\n    weights,\n    scoringVersion: SCORING_VERSION,\n  };\n}\n\nexport interface RankedObservation<T extends Observation = Observation> {\n  observation: T;\n  result: ScoreResult;\n}\n\n/**\n * Score a set of observations and return them sorted most-compelling first — the\n * \"float the strongest cases to the top\" use case.\n */\nexport function rankByCompellingness<T extends Observation>(\n  observations: readonly T[],\n  options?: ScoreOptions,\n): RankedObservation<T>[] {\n  return observations\n    .map((observation) => ({ observation, result: score(observation, options) }))\n    .sort((a, b) => b.result.score - a.result.score);\n}\n"]}

package/dist/completeness/index.d.ts

@@ -0,0 +1,41 @@
+import { z } from 'zod';
+import { Observation } from '@disclosureos/records';
+
+/** A leaf field path derived from the records JSON Schema. */
+interface FieldPath {
+    /** Dot-path into an `Observation` (e.g. `location.latitude`). */
+    path: string;
+    /** True only when every segment along the path is schema-required. */
+    required: boolean;
+}
+/**
+ * Walk the committed records JSON Schema and enumerate every leaf field path on
+ * `Observation`. Objects are recursed (resolving `$ref` into `$defs`); arrays,
+ * enums, scalars, and `record`/`anyOf` nodes are treated as leaves. This is the
+ * single source of completeness coverage — there is no hand-maintained path list
+ * (so adding a field to the schema automatically extends completeness).
+ */
+declare function deriveFieldPaths(schema?: Record<string, unknown>): FieldPath[];
+
+declare const CompletenessResultSchema: z.ZodObject<{
+    total: z.ZodNumber;
+    present: z.ZodNumber;
+    percentage: z.ZodNumber;
+    missing: z.ZodArray<z.ZodString>;
+    requiredTotal: z.ZodNumber;
+    requiredPresent: z.ZodNumber;
+    requiredPercentage: z.ZodNumber;
+}, z.core.$strip>;
+type CompletenessResult = z.infer<typeof CompletenessResultSchema>;
+interface CompletenessOptions {
+    /** Override the derived field-path set (defaults to the records schema). */
+    paths?: FieldPath[];
+}
+/**
+ * Measure how fully an observation populates the records schema. This is the
+ * "is it well-documented?" axis — deliberately kept separate from compellingness
+ * ("is it anomalous?"), so a thin-but-anomalous case never masquerades as complete.
+ */
+declare function getCompleteness(observation: Observation | Record<string, unknown>, options?: CompletenessOptions): CompletenessResult;
+
+export { type CompletenessOptions, type CompletenessResult, CompletenessResultSchema, type FieldPath, deriveFieldPaths, getCompleteness };

package/dist/completeness/index.js

@@ -0,0 +1,109 @@
+import { z } from 'zod';
+import { recordsJsonSchema } from '@disclosureos/records';
+
+// src/completeness/index.ts
+function refName(ref) {
+  return ref.replace("#/$defs/", "");
+}
+function deriveFieldPaths(schema) {
+  const root = schema ?? recordsJsonSchema();
+  const defs = root.$defs ?? {};
+  const out = [];
+  function resolve(node) {
+    let cur = node;
+    const seen = /* @__PURE__ */ new Set();
+    while (cur.$ref) {
+      const name = refName(cur.$ref);
+      if (seen.has(name)) break;
+      seen.add(name);
+      cur = defs[name] ?? {};
+    }
+    return cur;
+  }
+  function walk(node, prefix, required, visited) {
+    const refn = node.$ref ? refName(node.$ref) : void 0;
+    if (refn && visited.has(refn)) {
+      if (prefix) out.push({ path: prefix, required });
+      return;
+    }
+    const resolved = resolve(node);
+    const props = resolved.properties;
+    if (props && Object.keys(props).length > 0) {
+      const nextVisited = refn ? /* @__PURE__ */ new Set([...visited, refn]) : visited;
+      const req = new Set(resolved.required ?? []);
+      for (const [key, child] of Object.entries(props)) {
+        const childPath = prefix ? `${prefix}.${key}` : key;
+        walk(child, childPath, required && req.has(key), nextVisited);
+      }
+      return;
+    }
+    if (prefix) out.push({ path: prefix, required });
+  }
+  if (root.$ref) {
+    walk({ $ref: root.$ref }, "", true, /* @__PURE__ */ new Set());
+  }
+  return out;
+}
+
+// src/completeness/index.ts
+var CompletenessResultSchema = z.object({
+  total: z.number().int().describe("Total leaf field paths defined by the records schema."),
+  present: z.number().int().describe("How many of those paths carry a value."),
+  percentage: z.number().int().describe("present / total, as a 0\u2013100 integer."),
+  missing: z.array(z.string()).describe("Paths that are absent or empty."),
+  requiredTotal: z.number().int().describe("Count of schema-required leaf paths."),
+  requiredPresent: z.number().int().describe("How many required paths carry a value."),
+  requiredPercentage: z.number().int().describe("requiredPresent / requiredTotal, as a 0\u2013100 integer.")
+}).meta({ id: "CompletenessResult" }).describe("How fully an observation populates the records schema.");
+function getNested(obj, path) {
+  let current = obj;
+  for (const part of path.split(".")) {
+    if (current == null || typeof current !== "object") return void 0;
+    current = current[part];
+  }
+  return current;
+}
+function isPresent(value) {
+  if (value == null) return false;
+  if (typeof value === "string") return value.length > 0;
+  if (Array.isArray(value)) return value.length > 0;
+  if (typeof value === "object") return Object.keys(value).length > 0;
+  return true;
+}
+var cachedPaths = null;
+function defaultPaths() {
+  return cachedPaths ?? (cachedPaths = deriveFieldPaths());
+}
+function pct(present, total) {
+  return total > 0 ? Math.round(present / total * 100) : 0;
+}
+function getCompleteness(observation, options) {
+  const record = observation;
+  const paths = options?.paths ?? defaultPaths();
+  const missing = [];
+  let present = 0;
+  let requiredTotal = 0;
+  let requiredPresent = 0;
+  for (const field of paths) {
+    const ok = isPresent(getNested(record, field.path));
+    if (ok) present++;
+    else missing.push(field.path);
+    if (field.required) {
+      requiredTotal++;
+      if (ok) requiredPresent++;
+    }
+  }
+  return {
+    total: paths.length,
+    present,
+    percentage: pct(present, paths.length),
+    missing,
+    requiredTotal,
+    requiredPresent,
+    requiredPercentage: pct(requiredPresent, requiredTotal)
+  };
+}
+
+export { CompletenessResultSchema, deriveFieldPaths, getCompleteness };
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/dist/completeness/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/completeness/field-paths.ts","../../src/completeness/index.ts"],"names":[],"mappings":";;;;AAiBA,SAAS,QAAQ,GAAA,EAAqB;AACpC,EAAA,OAAO,GAAA,CAAI,OAAA,CAAQ,UAAA,EAAY,EAAE,CAAA;AACnC;AASO,SAAS,iBAAiB,MAAA,EAA+C;AAC9E,EAAA,MAAM,IAAA,GAAQ,UAAU,iBAAA,EAAkB;AAI1C,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,IAAS,EAAC;AAC5B,EAAA,MAAM,MAAmB,EAAC;AAE1B,EAAA,SAAS,QAAQ,IAAA,EAA8B;AAC7C,IAAA,IAAI,GAAA,GAAkB,IAAA;AACtB,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,IAAA,OAAO,IAAI,IAAA,EAAM;AACf,MAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AAC7B,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA,EAAG;AACpB,MAAA,IAAA,CAAK,IAAI,IAAI,CAAA;AACb,MAAA,GAAA,GAAM,IAAA,CAAK,IAAI,CAAA,IAAK,EAAC;AAAA,IACvB;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAEA,EAAA,SAAS,IAAA,CAAK,IAAA,EAAkB,MAAA,EAAgB,QAAA,EAAmB,OAAA,EAA4B;AAC7F,IAAA,MAAM,OAAO,IAAA,CAAK,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,GAAI,MAAA;AAE9C,IAAA,IAAI,IAAA,IAAQ,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AAC7B,MAAA,IAAI,QAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,UAAU,CAAA;AAC/C,MAAA;AAAA,IACF;AACA,IAAA,MAAM,QAAA,GAAW,QAAQ,IAAI,CAAA;AAC7B,IAAA,MAAM,QAAQ,QAAA,CAAS,UAAA;AACvB,IAAA,IAAI,SAAS,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,SAAS,CAAA,EAAG;AAC1C,MAAA,MAAM,WAAA,GAAc,uBAAO,IAAI,GAAA,CAAI,CAAC,GAAG,OAAA,EAAS,IAAI,CAAC,CAAA,GAAI,OAAA;AACzD,MAAA,MAAM,MAAM,IAAI,GAAA,CAAI,QAAA,CAAS,QAAA,IAAY,EAAE,CAAA;AAC3C,MAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,QAAA,MAAM,YAAY,MAAA,GAAS,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,GAAK,GAAA;AAChD,QAAA,IAAA,CAAK,OAAO,SAAA,EAAW,QAAA,IAAY,IAAI,GAAA,CAAI,GAAG,GAAG,WAAW,CAAA;AAAA,MAC9D;AACA,MAAA;AAAA,IACF;AACA,IAAA,IAAI,QAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,UAAU,CAAA;AAAA,EACjD;AAEA,EAAA,IAAI,KAAK,IAAA,EAAM;AACb,IAAA,IAAA,CAAK,EAAE,MAAM,IAAA,CAAK,IAAA,IAAQ,EAAA,EAAI,IAAA,kBAAM,IAAI,GAAA,EAAK,CAAA;AAAA,EAC/C;AACA,EAAA,OAAO,GAAA;AACT;;;ACjEO,IAAM,wBAAA,GAA2B,EACrC,MAAA,CAAO;AAAA,EACN,OAAO,CAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,uDAAuD,CAAA;AAAA,EACxF,SAAS,CAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,wCAAwC,CAAA;AAAA,EAC3E,YAAY,CAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,2CAAsC,CAAA;AAAA,EAC5E,OAAA,EAAS,EAAE,KAAA,CAAM,CAAA,CAAE,QAAQ,CAAA,CAAE,SAAS,iCAAiC,CAAA;AAAA,EACvE,eAAe,CAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,sCAAsC,CAAA;AAAA,EAC/E,iBAAiB,CAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,wCAAwC,CAAA;AAAA,EACnF,oBAAoB,CAAA,CACjB,MAAA,GACA,GAAA,EAAI,CACJ,SAAS,2DAAsD;AACpE,CAAC,CAAA,CACA,KAAK,EAAE,EAAA,EAAI,sBAAsB,CAAA,CACjC,SAAS,wDAAwD;AASpE,SAAS,SAAA,CAAU,KAA8B,IAAA,EAAuB;AACtE,EAAA,IAAI,OAAA,GAAmB,GAAA;AACvB,EAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA,EAAG;AAClC,IAAA,IAAI,OAAA,IAAW,IAAA,IAAQ,OAAO,OAAA,KAAY,UAAU,OAAO,MAAA;AAC3D,IAAA,OAAA,GAAW,QAAoC,IAAI,CAAA;AAAA,EACrD;AACA,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,UAAU,KAAA,EAAyB;AAC1C,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,KAAA;AAC1B,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,MAAM,MAAA,GAAS,CAAA;AACrD,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,OAAO,MAAM,MAAA,GAAS,CAAA;AAChD,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU,OAAO,OAAO,IAAA,CAAK,KAAK,EAAE,MAAA,GAAS,CAAA;AAClE,EAAA,OAAO,IAAA;AACT;AAGA,IAAI,WAAA,GAAkC,IAAA;AACtC,SAAS,YAAA,GAA4B;AACnC,EAAA,OAAQ,8BAAgB,gBAAA,EAAiB,CAAA;AAC3C;AAEA,SAAS,GAAA,CAAI,SAAiB,KAAA,EAAuB;AACnD,EAAA,OAAO,QAAQ,CAAA,GAAI,IAAA,CAAK,MAAO,OAAA,GAAU,KAAA,GAAS,GAAG,CAAA,GAAI,CAAA;AAC3D;AAOO,SAAS,eAAA,CACd,aACA,OAAA,EACoB;AACpB,EAAA,MAAM,MAAA,GAAS,WAAA;AACf,EAAA,MAAM,KAAA,GAAQ,OAAA,EAAS,KAAA,IAAS,YAAA,EAAa;AAC7C,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,IAAI,aAAA,GAAgB,CAAA;AACpB,EAAA,IAAI,eAAA,GAAkB,CAAA;AAEtB,EAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AACzB,IAAA,MAAM,KAAK,SAAA,CAAU,SAAA,CAAU,MAAA,EAAQ,KAAA,CAAM,IAAI,CAAC,CAAA;AAClD,IAAA,IAAI,EAAA,EAAI,OAAA,EAAA;AAAA,SACH,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAC5B,IAAA,IAAI,MAAM,QAAA,EAAU;AAClB,MAAA,aAAA,EAAA;AACA,MAAA,IAAI,EAAA,EAAI,eAAA,EAAA;AAAA,IACV;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,OAAO,KAAA,CAAM,MAAA;AAAA,IACb,OAAA;AAAA,IACA,UAAA,EAAY,GAAA,CAAI,OAAA,EAAS,KAAA,CAAM,MAAM,CAAA;AAAA,IACrC,OAAA;AAAA,IACA,aAAA;AAAA,IACA,eAAA;AAAA,IACA,kBAAA,EAAoB,GAAA,CAAI,eAAA,EAAiB,aAAa;AAAA,GACxD;AACF","file":"index.js","sourcesContent":["import { recordsJsonSchema } from '@disclosureos/records';\n\n/** A leaf field path derived from the records JSON Schema. */\nexport interface FieldPath {\n  /** Dot-path into an `Observation` (e.g. `location.latitude`). */\n  path: string;\n  /** True only when every segment along the path is schema-required. */\n  required: boolean;\n}\n\ninterface SchemaNode {\n  $ref?: string;\n  properties?: Record<string, SchemaNode>;\n  required?: string[];\n  type?: string | string[];\n}\n\nfunction refName(ref: string): string {\n  return ref.replace('#/$defs/', '');\n}\n\n/**\n * Walk the committed records JSON Schema and enumerate every leaf field path on\n * `Observation`. Objects are recursed (resolving `$ref` into `$defs`); arrays,\n * enums, scalars, and `record`/`anyOf` nodes are treated as leaves. This is the\n * single source of completeness coverage — there is no hand-maintained path list\n * (so adding a field to the schema automatically extends completeness).\n */\nexport function deriveFieldPaths(schema?: Record<string, unknown>): FieldPath[] {\n  const root = (schema ?? recordsJsonSchema()) as Record<string, unknown> & {\n    $ref?: string;\n    $defs?: Record<string, SchemaNode>;\n  };\n  const defs = root.$defs ?? {};\n  const out: FieldPath[] = [];\n\n  function resolve(node: SchemaNode): SchemaNode {\n    let cur: SchemaNode = node;\n    const seen = new Set<string>();\n    while (cur.$ref) {\n      const name = refName(cur.$ref);\n      if (seen.has(name)) break;\n      seen.add(name);\n      cur = defs[name] ?? {};\n    }\n    return cur;\n  }\n\n  function walk(node: SchemaNode, prefix: string, required: boolean, visited: Set<string>): void {\n    const refn = node.$ref ? refName(node.$ref) : undefined;\n    // Cycle guard: a recursive $ref re-entering an in-progress def becomes a leaf.\n    if (refn && visited.has(refn)) {\n      if (prefix) out.push({ path: prefix, required });\n      return;\n    }\n    const resolved = resolve(node);\n    const props = resolved.properties;\n    if (props && Object.keys(props).length > 0) {\n      const nextVisited = refn ? new Set([...visited, refn]) : visited;\n      const req = new Set(resolved.required ?? []);\n      for (const [key, child] of Object.entries(props)) {\n        const childPath = prefix ? `${prefix}.${key}` : key;\n        walk(child, childPath, required && req.has(key), nextVisited);\n      }\n      return;\n    }\n    if (prefix) out.push({ path: prefix, required });\n  }\n\n  if (root.$ref) {\n    walk({ $ref: root.$ref }, '', true, new Set());\n  }\n  return out;\n}\n","import { z } from 'zod';\nimport type { Observation } from '@disclosureos/records';\nimport { deriveFieldPaths } from './field-paths';\nimport type { FieldPath } from './field-paths';\n\nexport type { FieldPath } from './field-paths';\nexport { deriveFieldPaths } from './field-paths';\n\nexport const CompletenessResultSchema = z\n  .object({\n    total: z.number().int().describe('Total leaf field paths defined by the records schema.'),\n    present: z.number().int().describe('How many of those paths carry a value.'),\n    percentage: z.number().int().describe('present / total, as a 0–100 integer.'),\n    missing: z.array(z.string()).describe('Paths that are absent or empty.'),\n    requiredTotal: z.number().int().describe('Count of schema-required leaf paths.'),\n    requiredPresent: z.number().int().describe('How many required paths carry a value.'),\n    requiredPercentage: z\n      .number()\n      .int()\n      .describe('requiredPresent / requiredTotal, as a 0–100 integer.'),\n  })\n  .meta({ id: 'CompletenessResult' })\n  .describe('How fully an observation populates the records schema.');\n\nexport type CompletenessResult = z.infer<typeof CompletenessResultSchema>;\n\nexport interface CompletenessOptions {\n  /** Override the derived field-path set (defaults to the records schema). */\n  paths?: FieldPath[];\n}\n\nfunction getNested(obj: Record<string, unknown>, path: string): unknown {\n  let current: unknown = obj;\n  for (const part of path.split('.')) {\n    if (current == null || typeof current !== 'object') return undefined;\n    current = (current as Record<string, unknown>)[part];\n  }\n  return current;\n}\n\nfunction isPresent(value: unknown): boolean {\n  if (value == null) return false;\n  if (typeof value === 'string') return value.length > 0;\n  if (Array.isArray(value)) return value.length > 0;\n  if (typeof value === 'object') return Object.keys(value).length > 0;\n  return true;\n}\n\n// Field paths are stable for a given schema version, so derive once and reuse.\nlet cachedPaths: FieldPath[] | null = null;\nfunction defaultPaths(): FieldPath[] {\n  return (cachedPaths ??= deriveFieldPaths());\n}\n\nfunction pct(present: number, total: number): number {\n  return total > 0 ? Math.round((present / total) * 100) : 0;\n}\n\n/**\n * Measure how fully an observation populates the records schema. This is the\n * \"is it well-documented?\" axis — deliberately kept separate from compellingness\n * (\"is it anomalous?\"), so a thin-but-anomalous case never masquerades as complete.\n */\nexport function getCompleteness(\n  observation: Observation | Record<string, unknown>,\n  options?: CompletenessOptions,\n): CompletenessResult {\n  const record = observation as Record<string, unknown>;\n  const paths = options?.paths ?? defaultPaths();\n  const missing: string[] = [];\n  let present = 0;\n  let requiredTotal = 0;\n  let requiredPresent = 0;\n\n  for (const field of paths) {\n    const ok = isPresent(getNested(record, field.path));\n    if (ok) present++;\n    else missing.push(field.path);\n    if (field.required) {\n      requiredTotal++;\n      if (ok) requiredPresent++;\n    }\n  }\n\n  return {\n    total: paths.length,\n    present,\n    percentage: pct(present, paths.length),\n    missing,\n    requiredTotal,\n    requiredPresent,\n    requiredPercentage: pct(requiredPresent, requiredTotal),\n  };\n}\n"]}

package/dist/index.d.ts

@@ -0,0 +1,16 @@
+export { CompletenessOptions, CompletenessResult, CompletenessResultSchema, FieldPath, deriveFieldPaths, getCompleteness } from './completeness/index.js';
+export { ASSESSMENT_LEVEL_WEIGHTS, CompellingnessWeights, CompellingnessWeightsSchema, DEFAULT_PROSAIC_OCS_PREFIXES, DEFAULT_WEIGHTS, EvaluatorWeightInput, RankedObservation, SCORING_VERSION, ScoreOptions, ScoreResult, ScoreResultSchema, rankByCompellingness, score } from './compellingness/index.js';
+import 'zod';
+import '@disclosureos/records';
+import '@disclosureos/observables';
+
+declare const SCORING_SCHEMA_VERSION = "2.0.0";
+declare const SCORING_SCHEMA_ID: string;
+/**
+ * Emit the JSON Schema (draft 2020-12) for the scoring output shapes
+ * ({@link CompletenessResultSchema}, {@link ScoreResultSchema}) so downstream
+ * consumers (and other languages) can validate stored scores.
+ */
+declare function scoringJsonSchema(): Record<string, unknown>;
+
+export { SCORING_SCHEMA_ID, SCORING_SCHEMA_VERSION, scoringJsonSchema };

package/dist/index.js

@@ -0,0 +1,252 @@
+import { z } from 'zod';
+import { recordsJsonSchema } from '@disclosureos/records';
+import '@disclosureos/observables';
+import '@disclosureos/origins';
+import { schemaId, jsonSchemaEnvelope } from '@disclosureos/records/shared';
+
+// src/completeness/index.ts
+function refName(ref) {
+  return ref.replace("#/$defs/", "");
+}
+function deriveFieldPaths(schema) {
+  const root = schema ?? recordsJsonSchema();
+  const defs = root.$defs ?? {};
+  const out = [];
+  function resolve(node) {
+    let cur = node;
+    const seen = /* @__PURE__ */ new Set();
+    while (cur.$ref) {
+      const name = refName(cur.$ref);
+      if (seen.has(name)) break;
+      seen.add(name);
+      cur = defs[name] ?? {};
+    }
+    return cur;
+  }
+  function walk(node, prefix, required, visited) {
+    const refn = node.$ref ? refName(node.$ref) : void 0;
+    if (refn && visited.has(refn)) {
+      if (prefix) out.push({ path: prefix, required });
+      return;
+    }
+    const resolved = resolve(node);
+    const props = resolved.properties;
+    if (props && Object.keys(props).length > 0) {
+      const nextVisited = refn ? /* @__PURE__ */ new Set([...visited, refn]) : visited;
+      const req = new Set(resolved.required ?? []);
+      for (const [key, child] of Object.entries(props)) {
+        const childPath = prefix ? `${prefix}.${key}` : key;
+        walk(child, childPath, required && req.has(key), nextVisited);
+      }
+      return;
+    }
+    if (prefix) out.push({ path: prefix, required });
+  }
+  if (root.$ref) {
+    walk({ $ref: root.$ref }, "", true, /* @__PURE__ */ new Set());
+  }
+  return out;
+}
+
+// src/completeness/index.ts
+var CompletenessResultSchema = z.object({
+  total: z.number().int().describe("Total leaf field paths defined by the records schema."),
+  present: z.number().int().describe("How many of those paths carry a value."),
+  percentage: z.number().int().describe("present / total, as a 0\u2013100 integer."),
+  missing: z.array(z.string()).describe("Paths that are absent or empty."),
+  requiredTotal: z.number().int().describe("Count of schema-required leaf paths."),
+  requiredPresent: z.number().int().describe("How many required paths carry a value."),
+  requiredPercentage: z.number().int().describe("requiredPresent / requiredTotal, as a 0\u2013100 integer.")
+}).meta({ id: "CompletenessResult" }).describe("How fully an observation populates the records schema.");
+function getNested(obj, path) {
+  let current = obj;
+  for (const part of path.split(".")) {
+    if (current == null || typeof current !== "object") return void 0;
+    current = current[part];
+  }
+  return current;
+}
+function isPresent(value) {
+  if (value == null) return false;
+  if (typeof value === "string") return value.length > 0;
+  if (Array.isArray(value)) return value.length > 0;
+  if (typeof value === "object") return Object.keys(value).length > 0;
+  return true;
+}
+var cachedPaths = null;
+function defaultPaths() {
+  return cachedPaths ?? (cachedPaths = deriveFieldPaths());
+}
+function pct(present, total) {
+  return total > 0 ? Math.round(present / total * 100) : 0;
+}
+function getCompleteness(observation, options) {
+  const record = observation;
+  const paths = options?.paths ?? defaultPaths();
+  const missing = [];
+  let present = 0;
+  let requiredTotal = 0;
+  let requiredPresent = 0;
+  for (const field of paths) {
+    const ok = isPresent(getNested(record, field.path));
+    if (ok) present++;
+    else missing.push(field.path);
+    if (field.required) {
+      requiredTotal++;
+      if (ok) requiredPresent++;
+    }
+  }
+  return {
+    total: paths.length,
+    present,
+    percentage: pct(present, paths.length),
+    missing,
+    requiredTotal,
+    requiredPresent,
+    requiredPercentage: pct(requiredPresent, requiredTotal)
+  };
+}
+var SCORING_VERSION = "2.0.0";
+var ASSESSMENT_LEVEL_WEIGHTS = {
+  not_indicated: 0,
+  reported: 0.25,
+  documented: 0.5,
+  measured: 0.75,
+  confirmed: 1
+};
+var DEFAULT_PROSAIC_OCS_PREFIXES = ["1.1.1"];
+var CompellingnessWeightsSchema = z.object({
+  technology: z.number().min(0).describe("Weight of the technology-anomaly signal."),
+  biologics: z.number().min(0).describe("Weight of the biologics-anomaly signal."),
+  origin: z.number().min(0).describe("Weight of the (non-prosaic) origin-confidence signal.")
+}).meta({ id: "CompellingnessWeights" }).describe("Relative weights for the compellingness components. Need not sum to 1 \u2014 normalized internally.");
+var DEFAULT_WEIGHTS = {
+  technology: 0.45,
+  biologics: 0.35,
+  origin: 0.2
+};
+var ScoreResultSchema = z.object({
+  score: z.number().min(0).max(1).describe("Overall compellingness (consensus point estimate), 0\u20131."),
+  range: z.object({
+    low: z.number().min(0).max(1).describe("Most-skeptical reading of the strongest-anomaly signal across competing claims."),
+    high: z.number().min(0).max(1).describe("Most-anomalous reading of the strongest-anomaly signal across competing claims.")
+  }).describe(
+    "Spread of the score across competing claims \u2014 wide range signals disagreement. Bounds are computed per-signal under the same strongest-anomaly (max) reduction as the point estimate, not a global min/max over every claim."
+  ),
+  contested: z.boolean().describe("True when claims disagree on *direction* (some assert anomaly, some assert none)."),
+  components: z.object({
+    technology: z.number().min(0).max(1),
+    biologics: z.number().min(0).max(1),
+    origin: z.number().min(0).max(1)
+  }).describe("Per-signal consensus contributions before weighting."),
+  weights: CompellingnessWeightsSchema,
+  scoringVersion: z.string().describe("Methodology version that produced this score.")
+}).meta({ id: "ScoreResult" }).describe("A reference compellingness score for an observation, with a contestedness range.");
+var UNIFORM_TRUST = () => 1;
+function isProsaic(id, prefixes) {
+  return prefixes.some((p) => id === p || id.startsWith(`${p}.`));
+}
+function round(n) {
+  return Math.round(n * 1e4) / 1e4;
+}
+var EMPTY_STATS = { point: 0, low: 0, high: 0, contested: false };
+function reduceClaims(weighted) {
+  if (weighted.length === 0) return EMPTY_STATS;
+  let wsum = 0;
+  let msum = 0;
+  let low = Infinity;
+  let high = -Infinity;
+  let anyAnomaly = false;
+  let anyNone = false;
+  for (const { magnitude, weight } of weighted) {
+    wsum += weight;
+    msum += magnitude * weight;
+    if (magnitude < low) low = magnitude;
+    if (magnitude > high) high = magnitude;
+    if (magnitude > 0) anyAnomaly = true;
+    else anyNone = true;
+  }
+  return {
+    point: wsum > 0 ? msum / wsum : 0,
+    low,
+    high,
+    contested: anyAnomaly && anyNone
+  };
+}
+function observableMagnitude(claim) {
+  return ASSESSMENT_LEVEL_WEIGHTS[claim.level] * (claim.confidence ?? 1);
+}
+function domainStats(group, evaluatorWeight) {
+  if (!group) return EMPTY_STATS;
+  let point = 0;
+  let low = 0;
+  let high = 0;
+  let contested = false;
+  for (const claims of Object.values(group)) {
+    if (!claims || claims.length === 0) continue;
+    const weighted = claims.map((c) => ({
+      magnitude: observableMagnitude(c),
+      weight: (c.confidence ?? 1) * evaluatorWeight(c)
+    }));
+    const stats = reduceClaims(weighted);
+    if (stats.point > point) point = stats.point;
+    if (stats.low > low) low = stats.low;
+    if (stats.high > high) high = stats.high;
+    if (stats.contested) contested = true;
+  }
+  return { point, low, high, contested };
+}
+function originStats(origin, prefixes, evaluatorWeight) {
+  if (!origin || origin.length === 0) return EMPTY_STATS;
+  const weighted = origin.map((c) => ({
+    magnitude: isProsaic(c.primaryHypothesis, prefixes) ? 0 : c.confidence,
+    weight: c.confidence * evaluatorWeight(c)
+  }));
+  return reduceClaims(weighted);
+}
+function score(observation, options) {
+  const weights = options?.weights ?? DEFAULT_WEIGHTS;
+  const prosaicPrefixes = options?.prosaicPrefixes ?? DEFAULT_PROSAIC_OCS_PREFIXES;
+  const evaluatorWeight = options?.evaluatorWeight ?? UNIFORM_TRUST;
+  const assessments = observation.observableAssessments;
+  const technology = domainStats(assessments?.technology, evaluatorWeight);
+  const biologics = domainStats(assessments?.biologics, evaluatorWeight);
+  const origin = originStats(observation.origin, prosaicPrefixes, evaluatorWeight);
+  const totalWeight = weights.technology + weights.biologics + weights.origin;
+  const combine = (t, b, o) => totalWeight > 0 ? (t * weights.technology + b * weights.biologics + o * weights.origin) / totalWeight : 0;
+  return {
+    score: round(combine(technology.point, biologics.point, origin.point)),
+    range: {
+      low: round(combine(technology.low, biologics.low, origin.low)),
+      high: round(combine(technology.high, biologics.high, origin.high))
+    },
+    contested: technology.contested || biologics.contested || origin.contested,
+    components: {
+      technology: round(technology.point),
+      biologics: round(biologics.point),
+      origin: round(origin.point)
+    },
+    weights,
+    scoringVersion: SCORING_VERSION
+  };
+}
+function rankByCompellingness(observations, options) {
+  return observations.map((observation) => ({ observation, result: score(observation, options) })).sort((a, b) => b.result.score - a.result.score);
+}
+var SCORING_SCHEMA_VERSION = "2.0.0";
+var SCORING_SCHEMA_ID = schemaId("scoring", "scoring", SCORING_SCHEMA_VERSION);
+function scoringJsonSchema() {
+  const bundle = z.toJSONSchema(
+    z.object({
+      completeness: CompletenessResultSchema,
+      compellingness: ScoreResultSchema,
+      weights: CompellingnessWeightsSchema
+    }),
+    { target: "draft-2020-12" }
+  );
+  return jsonSchemaEnvelope(bundle, { id: SCORING_SCHEMA_ID, version: SCORING_SCHEMA_VERSION });
+}
+
+export { ASSESSMENT_LEVEL_WEIGHTS, CompellingnessWeightsSchema, CompletenessResultSchema, DEFAULT_PROSAIC_OCS_PREFIXES, DEFAULT_WEIGHTS, SCORING_SCHEMA_ID, SCORING_SCHEMA_VERSION, SCORING_VERSION, ScoreResultSchema, deriveFieldPaths, getCompleteness, rankByCompellingness, score, scoringJsonSchema };
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/completeness/field-paths.ts","../src/completeness/index.ts","../src/compellingness/index.ts","../src/schema.ts"],"names":["z"],"mappings":";;;;;;;AAiBA,SAAS,QAAQ,GAAA,EAAqB;AACpC,EAAA,OAAO,GAAA,CAAI,OAAA,CAAQ,UAAA,EAAY,EAAE,CAAA;AACnC;AASO,SAAS,iBAAiB,MAAA,EAA+C;AAC9E,EAAA,MAAM,IAAA,GAAQ,UAAU,iBAAA,EAAkB;AAI1C,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,IAAS,EAAC;AAC5B,EAAA,MAAM,MAAmB,EAAC;AAE1B,EAAA,SAAS,QAAQ,IAAA,EAA8B;AAC7C,IAAA,IAAI,GAAA,GAAkB,IAAA;AACtB,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,IAAA,OAAO,IAAI,IAAA,EAAM;AACf,MAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AAC7B,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA,EAAG;AACpB,MAAA,IAAA,CAAK,IAAI,IAAI,CAAA;AACb,MAAA,GAAA,GAAM,IAAA,CAAK,IAAI,CAAA,IAAK,EAAC;AAAA,IACvB;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAEA,EAAA,SAAS,IAAA,CAAK,IAAA,EAAkB,MAAA,EAAgB,QAAA,EAAmB,OAAA,EAA4B;AAC7F,IAAA,MAAM,OAAO,IAAA,CAAK,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,GAAI,MAAA;AAE9C,IAAA,IAAI,IAAA,IAAQ,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AAC7B,MAAA,IAAI,QAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,UAAU,CAAA;AAC/C,MAAA;AAAA,IACF;AACA,IAAA,MAAM,QAAA,GAAW,QAAQ,IAAI,CAAA;AAC7B,IAAA,MAAM,QAAQ,QAAA,CAAS,UAAA;AACvB,IAAA,IAAI,SAAS,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,SAAS,CAAA,EAAG;AAC1C,MAAA,MAAM,WAAA,GAAc,uBAAO,IAAI,GAAA,CAAI,CAAC,GAAG,OAAA,EAAS,IAAI,CAAC,CAAA,GAAI,OAAA;AACzD,MAAA,MAAM,MAAM,IAAI,GAAA,CAAI,QAAA,CAAS,QAAA,IAAY,EAAE,CAAA;AAC3C,MAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,QAAA,MAAM,YAAY,MAAA,GAAS,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,GAAK,GAAA;AAChD,QAAA,IAAA,CAAK,OAAO,SAAA,EAAW,QAAA,IAAY,IAAI,GAAA,CAAI,GAAG,GAAG,WAAW,CAAA;AAAA,MAC9D;AACA,MAAA;AAAA,IACF;AACA,IAAA,IAAI,QAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,UAAU,CAAA;AAAA,EACjD;AAEA,EAAA,IAAI,KAAK,IAAA,EAAM;AACb,IAAA,IAAA,CAAK,EAAE,MAAM,IAAA,CAAK,IAAA,IAAQ,EAAA,EAAI,IAAA,kBAAM,IAAI,GAAA,EAAK,CAAA;AAAA,EAC/C;AACA,EAAA,OAAO,GAAA;AACT;;;ACjEO,IAAM,wBAAA,GAA2B,EACrC,MAAA,CAAO;AAAA,EACN,OAAO,CAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,uDAAuD,CAAA;AAAA,EACxF,SAAS,CAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,wCAAwC,CAAA;AAAA,EAC3E,YAAY,CAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,2CAAsC,CAAA;AAAA,EAC5E,OAAA,EAAS,EAAE,KAAA,CAAM,CAAA,CAAE,QAAQ,CAAA,CAAE,SAAS,iCAAiC,CAAA;AAAA,EACvE,eAAe,CAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,sCAAsC,CAAA;AAAA,EAC/E,iBAAiB,CAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,wCAAwC,CAAA;AAAA,EACnF,oBAAoB,CAAA,CACjB,MAAA,GACA,GAAA,EAAI,CACJ,SAAS,2DAAsD;AACpE,CAAC,CAAA,CACA,KAAK,EAAE,EAAA,EAAI,sBAAsB,CAAA,CACjC,SAAS,wDAAwD;AASpE,SAAS,SAAA,CAAU,KAA8B,IAAA,EAAuB;AACtE,EAAA,IAAI,OAAA,GAAmB,GAAA;AACvB,EAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA,EAAG;AAClC,IAAA,IAAI,OAAA,IAAW,IAAA,IAAQ,OAAO,OAAA,KAAY,UAAU,OAAO,MAAA;AAC3D,IAAA,OAAA,GAAW,QAAoC,IAAI,CAAA;AAAA,EACrD;AACA,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,UAAU,KAAA,EAAyB;AAC1C,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,KAAA;AAC1B,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,MAAM,MAAA,GAAS,CAAA;AACrD,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,OAAO,MAAM,MAAA,GAAS,CAAA;AAChD,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU,OAAO,OAAO,IAAA,CAAK,KAAK,EAAE,MAAA,GAAS,CAAA;AAClE,EAAA,OAAO,IAAA;AACT;AAGA,IAAI,WAAA,GAAkC,IAAA;AACtC,SAAS,YAAA,GAA4B;AACnC,EAAA,OAAQ,8BAAgB,gBAAA,EAAiB,CAAA;AAC3C;AAEA,SAAS,GAAA,CAAI,SAAiB,KAAA,EAAuB;AACnD,EAAA,OAAO,QAAQ,CAAA,GAAI,IAAA,CAAK,MAAO,OAAA,GAAU,KAAA,GAAS,GAAG,CAAA,GAAI,CAAA;AAC3D;AAOO,SAAS,eAAA,CACd,aACA,OAAA,EACoB;AACpB,EAAA,MAAM,MAAA,GAAS,WAAA;AACf,EAAA,MAAM,KAAA,GAAQ,OAAA,EAAS,KAAA,IAAS,YAAA,EAAa;AAC7C,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,IAAI,aAAA,GAAgB,CAAA;AACpB,EAAA,IAAI,eAAA,GAAkB,CAAA;AAEtB,EAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AACzB,IAAA,MAAM,KAAK,SAAA,CAAU,SAAA,CAAU,MAAA,EAAQ,KAAA,CAAM,IAAI,CAAC,CAAA;AAClD,IAAA,IAAI,EAAA,EAAI,OAAA,EAAA;AAAA,SACH,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAC5B,IAAA,IAAI,MAAM,QAAA,EAAU;AAClB,MAAA,aAAA,EAAA;AACA,MAAA,IAAI,EAAA,EAAI,eAAA,EAAA;AAAA,IACV;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,OAAO,KAAA,CAAM,MAAA;AAAA,IACb,OAAA;AAAA,IACA,UAAA,EAAY,GAAA,CAAI,OAAA,EAAS,KAAA,CAAM,MAAM,CAAA;AAAA,IACrC,OAAA;AAAA,IACA,aAAA;AAAA,IACA,eAAA;AAAA,IACA,kBAAA,EAAoB,GAAA,CAAI,eAAA,EAAiB,aAAa;AAAA,GACxD;AACF;ACnFO,IAAM,eAAA,GAAkB;AAQxB,IAAM,wBAAA,GAA4D;AAAA,EACvE,aAAA,EAAe,CAAA;AAAA,EACf,QAAA,EAAU,IAAA;AAAA,EACV,UAAA,EAAY,GAAA;AAAA,EACZ,QAAA,EAAU,IAAA;AAAA,EACV,SAAA,EAAW;AACb;AAQO,IAAM,4BAAA,GAAkD,CAAC,OAAO;AAEhE,IAAM,2BAAA,GAA8BA,EACxC,MAAA,CAAO;AAAA,EACN,UAAA,EAAYA,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,0CAA0C,CAAA;AAAA,EACjF,SAAA,EAAWA,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,yCAAyC,CAAA;AAAA,EAC/E,MAAA,EAAQA,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,uDAAuD;AAC5F,CAAC,CAAA,CACA,KAAK,EAAE,EAAA,EAAI,yBAAyB,CAAA,CACpC,SAAS,qGAAgG;AAYrG,IAAM,eAAA,GAAyC;AAAA,EACpD,UAAA,EAAY,IAAA;AAAA,EACZ,SAAA,EAAW,IAAA;AAAA,EACX,MAAA,EAAQ;AACV;AAEO,IAAM,iBAAA,GAAoBA,EAC9B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,CAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,8DAAyD,CAAA;AAAA,EAClG,KAAA,EAAOA,EACJ,MAAA,CAAO;AAAA,IACN,GAAA,EAAKA,CAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,iFAAiF,CAAA;AAAA,IACxH,IAAA,EAAMA,CAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,iFAAiF;AAAA,GAC1H,CAAA,CACA,QAAA;AAAA,IACC;AAAA,GAGF;AAAA,EACF,SAAA,EAAWA,CAAAA,CACR,OAAA,EAAQ,CACR,SAAS,mFAAmF,CAAA;AAAA,EAC/F,UAAA,EAAYA,EACT,MAAA,CAAO;AAAA,IACN,UAAA,EAAYA,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,IAAI,CAAC,CAAA;AAAA,IACnC,SAAA,EAAWA,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,IAAI,CAAC,CAAA;AAAA,IAClC,MAAA,EAAQA,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,IAAI,CAAC;AAAA,GAChC,CAAA,CACA,QAAA,CAAS,sDAAsD,CAAA;AAAA,EAClE,OAAA,EAAS,2BAAA;AAAA,EACT,cAAA,EAAgBA,CAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,+CAA+C;AACrF,CAAC,CAAA,CACA,KAAK,EAAE,EAAA,EAAI,eAAe,CAAA,CAC1B,SAAS,kFAAkF;AA4B9F,IAAM,gBAAgB,MAAc,CAAA;AAEpC,SAAS,SAAA,CAAU,IAAY,QAAA,EAAsC;AACnE,EAAA,OAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,EAAA,KAAO,CAAA,IAAK,EAAA,CAAG,UAAA,CAAW,CAAA,EAAG,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA;AAChE;AAEA,SAAS,MAAM,CAAA,EAAmB;AAChC,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,GAAG,CAAA,GAAI,GAAA;AAC/B;AAeA,IAAM,WAAA,GAA0B,EAAE,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,EAAG,IAAA,EAAM,CAAA,EAAG,SAAA,EAAW,KAAA,EAAM;AAE9E,SAAS,aAAa,QAAA,EAAkC;AACtD,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,WAAA;AAClC,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,GAAA,GAAM,QAAA;AACV,EAAA,IAAI,IAAA,GAAO,CAAA,QAAA;AACX,EAAA,IAAI,UAAA,GAAa,KAAA;AACjB,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,KAAA,MAAW,EAAE,SAAA,EAAW,MAAA,EAAO,IAAK,QAAA,EAAU;AAC5C,IAAA,IAAA,IAAQ,MAAA;AACR,IAAA,IAAA,IAAQ,SAAA,GAAY,MAAA;AACpB,IAAA,IAAI,SAAA,GAAY,KAAK,GAAA,GAAM,SAAA;AAC3B,IAAA,IAAI,SAAA,GAAY,MAAM,IAAA,GAAO,SAAA;AAC7B,IAAA,IAAI,SAAA,GAAY,GAAG,UAAA,GAAa,IAAA;AAAA,SAC3B,OAAA,GAAU,IAAA;AAAA,EACjB;AACA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,IAAA,GAAO,CAAA,GAAI,IAAA,GAAO,IAAA,GAAO,CAAA;AAAA,IAChC,GAAA;AAAA,IACA,IAAA;AAAA,IACA,WAAW,UAAA,IAAc;AAAA,GAC3B;AACF;AAGA,SAAS,oBAAoB,KAAA,EAAgC;AAC3D,EAAA,OAAO,wBAAA,CAAyB,KAAA,CAAM,KAAK,CAAA,IAAK,MAAM,UAAA,IAAc,CAAA,CAAA;AACtE;AAQA,SAAS,WAAA,CACP,OACA,eAAA,EACY;AACZ,EAAA,IAAI,CAAC,OAAO,OAAO,WAAA;AACnB,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,SAAA,GAAY,KAAA;AAChB,EAAA,KAAA,MAAW,MAAA,IAAU,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,EAAG;AACzC,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG;AACpC,IAAA,MAAM,QAAA,GAAW,MAAA,CAAO,GAAA,CAAc,CAAC,CAAA,MAAO;AAAA,MAC5C,SAAA,EAAW,oBAAoB,CAAC,CAAA;AAAA,MAChC,MAAA,EAAA,CAAS,CAAA,CAAE,UAAA,IAAc,CAAA,IAAK,gBAAgB,CAAC;AAAA,KACjD,CAAE,CAAA;AACF,IAAA,MAAM,KAAA,GAAQ,aAAa,QAAQ,CAAA;AACnC,IAAA,IAAI,KAAA,CAAM,KAAA,GAAQ,KAAA,EAAO,KAAA,GAAQ,KAAA,CAAM,KAAA;AACvC,IAAA,IAAI,KAAA,CAAM,GAAA,GAAM,GAAA,EAAK,GAAA,GAAM,KAAA,CAAM,GAAA;AACjC,IAAA,IAAI,KAAA,CAAM,IAAA,GAAO,IAAA,EAAM,IAAA,GAAO,KAAA,CAAM,IAAA;AACpC,IAAA,IAAI,KAAA,CAAM,WAAW,SAAA,GAAY,IAAA;AAAA,EACnC;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,GAAA,EAAK,IAAA,EAAM,SAAA,EAAU;AACvC;AAGA,SAAS,WAAA,CACP,MAAA,EACA,QAAA,EACA,eAAA,EACY;AACZ,EAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,MAAA,KAAW,GAAG,OAAO,WAAA;AAC3C,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,GAAA,CAAc,CAAC,CAAA,MAAO;AAAA,IAC5C,WAAW,SAAA,CAAU,CAAA,CAAE,mBAAmB,QAAQ,CAAA,GAAI,IAAI,CAAA,CAAE,UAAA;AAAA,IAC5D,MAAA,EAAQ,CAAA,CAAE,UAAA,GAAa,eAAA,CAAgB,CAAC;AAAA,GAC1C,CAAE,CAAA;AACF,EAAA,OAAO,aAAa,QAAQ,CAAA;AAC9B;AAYO,SAAS,KAAA,CAAM,aAA0B,OAAA,EAAqC;AACnF,EAAA,MAAM,OAAA,GAAU,SAAS,OAAA,IAAW,eAAA;AACpC,EAAA,MAAM,eAAA,GAAkB,SAAS,eAAA,IAAmB,4BAAA;AACpD,EAAA,MAAM,eAAA,GAAkB,SAAS,eAAA,IAAmB,aAAA;AAEpD,EAAA,MAAM,cAAc,WAAA,CAAY,qBAAA;AAChC,EAAA,MAAM,UAAA,GAAa,WAAA,CAAY,WAAA,EAAa,UAAA,EAAY,eAAe,CAAA;AACvE,EAAA,MAAM,SAAA,GAAY,WAAA,CAAY,WAAA,EAAa,SAAA,EAAW,eAAe,CAAA;AACrE,EAAA,MAAM,MAAA,GAAS,WAAA,CAAY,WAAA,CAAY,MAAA,EAAQ,iBAAiB,eAAe,CAAA;AAE/E,EAAA,MAAM,WAAA,GAAc,OAAA,CAAQ,UAAA,GAAa,OAAA,CAAQ,YAAY,OAAA,CAAQ,MAAA;AACrE,EAAA,MAAM,UAAU,CAAC,CAAA,EAAW,CAAA,EAAW,CAAA,KACrC,cAAc,CAAA,GAAA,CACT,CAAA,GAAI,OAAA,CAAQ,UAAA,GAAa,IAAI,OAAA,CAAQ,SAAA,GAAY,CAAA,GAAI,OAAA,CAAQ,UAAU,WAAA,GACxE,CAAA;AAEN,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,MAAM,OAAA,CAAQ,UAAA,CAAW,OAAO,SAAA,CAAU,KAAA,EAAO,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,IACrE,KAAA,EAAO;AAAA,MACL,GAAA,EAAK,MAAM,OAAA,CAAQ,UAAA,CAAW,KAAK,SAAA,CAAU,GAAA,EAAK,MAAA,CAAO,GAAG,CAAC,CAAA;AAAA,MAC7D,IAAA,EAAM,MAAM,OAAA,CAAQ,UAAA,CAAW,MAAM,SAAA,CAAU,IAAA,EAAM,MAAA,CAAO,IAAI,CAAC;AAAA,KACnE;AAAA,IACA,SAAA,EAAW,UAAA,CAAW,SAAA,IAAa,SAAA,CAAU,aAAa,MAAA,CAAO,SAAA;AAAA,IACjE,UAAA,EAAY;AAAA,MACV,UAAA,EAAY,KAAA,CAAM,UAAA,CAAW,KAAK,CAAA;AAAA,MAClC,SAAA,EAAW,KAAA,CAAM,SAAA,CAAU,KAAK,CAAA;AAAA,MAChC,MAAA,EAAQ,KAAA,CAAM,MAAA,CAAO,KAAK;AAAA,KAC5B;AAAA,IACA,OAAA;AAAA,IACA,cAAA,EAAgB;AAAA,GAClB;AACF;AAWO,SAAS,oBAAA,CACd,cACA,OAAA,EACwB;AACxB,EAAA,OAAO,YAAA,CACJ,IAAI,CAAC,WAAA,MAAiB,EAAE,WAAA,EAAa,MAAA,EAAQ,KAAA,CAAM,WAAA,EAAa,OAAO,CAAA,GAAI,CAAA,CAC3E,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,MAAA,CAAO,KAAA,GAAQ,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA;AACnD;AC1QO,IAAM,sBAAA,GAAyB;AAE/B,IAAM,iBAAA,GAAoB,QAAA,CAAS,SAAA,EAAW,SAAA,EAAW,sBAAsB;AAO/E,SAAS,iBAAA,GAA6C;AAC3D,EAAA,MAAM,SAASA,CAAAA,CAAE,YAAA;AAAA,IACfA,EAAE,MAAA,CAAO;AAAA,MACP,YAAA,EAAc,wBAAA;AAAA,MACd,cAAA,EAAgB,iBAAA;AAAA,MAChB,OAAA,EAAS;AAAA,KACV,CAAA;AAAA,IACD,EAAE,QAAQ,eAAA;AAAgB,GAC5B;AACA,EAAA,OAAO,mBAAmB,MAAA,EAAQ,EAAE,IAAI,iBAAA,EAAmB,OAAA,EAAS,wBAAwB,CAAA;AAC9F","file":"index.js","sourcesContent":["import { recordsJsonSchema } from '@disclosureos/records';\n\n/** A leaf field path derived from the records JSON Schema. */\nexport interface FieldPath {\n  /** Dot-path into an `Observation` (e.g. `location.latitude`). */\n  path: string;\n  /** True only when every segment along the path is schema-required. */\n  required: boolean;\n}\n\ninterface SchemaNode {\n  $ref?: string;\n  properties?: Record<string, SchemaNode>;\n  required?: string[];\n  type?: string | string[];\n}\n\nfunction refName(ref: string): string {\n  return ref.replace('#/$defs/', '');\n}\n\n/**\n * Walk the committed records JSON Schema and enumerate every leaf field path on\n * `Observation`. Objects are recursed (resolving `$ref` into `$defs`); arrays,\n * enums, scalars, and `record`/`anyOf` nodes are treated as leaves. This is the\n * single source of completeness coverage — there is no hand-maintained path list\n * (so adding a field to the schema automatically extends completeness).\n */\nexport function deriveFieldPaths(schema?: Record<string, unknown>): FieldPath[] {\n  const root = (schema ?? recordsJsonSchema()) as Record<string, unknown> & {\n    $ref?: string;\n    $defs?: Record<string, SchemaNode>;\n  };\n  const defs = root.$defs ?? {};\n  const out: FieldPath[] = [];\n\n  function resolve(node: SchemaNode): SchemaNode {\n    let cur: SchemaNode = node;\n    const seen = new Set<string>();\n    while (cur.$ref) {\n      const name = refName(cur.$ref);\n      if (seen.has(name)) break;\n      seen.add(name);\n      cur = defs[name] ?? {};\n    }\n    return cur;\n  }\n\n  function walk(node: SchemaNode, prefix: string, required: boolean, visited: Set<string>): void {\n    const refn = node.$ref ? refName(node.$ref) : undefined;\n    // Cycle guard: a recursive $ref re-entering an in-progress def becomes a leaf.\n    if (refn && visited.has(refn)) {\n      if (prefix) out.push({ path: prefix, required });\n      return;\n    }\n    const resolved = resolve(node);\n    const props = resolved.properties;\n    if (props && Object.keys(props).length > 0) {\n      const nextVisited = refn ? new Set([...visited, refn]) : visited;\n      const req = new Set(resolved.required ?? []);\n      for (const [key, child] of Object.entries(props)) {\n        const childPath = prefix ? `${prefix}.${key}` : key;\n        walk(child, childPath, required && req.has(key), nextVisited);\n      }\n      return;\n    }\n    if (prefix) out.push({ path: prefix, required });\n  }\n\n  if (root.$ref) {\n    walk({ $ref: root.$ref }, '', true, new Set());\n  }\n  return out;\n}\n","import { z } from 'zod';\nimport type { Observation } from '@disclosureos/records';\nimport { deriveFieldPaths } from './field-paths';\nimport type { FieldPath } from './field-paths';\n\nexport type { FieldPath } from './field-paths';\nexport { deriveFieldPaths } from './field-paths';\n\nexport const CompletenessResultSchema = z\n  .object({\n    total: z.number().int().describe('Total leaf field paths defined by the records schema.'),\n    present: z.number().int().describe('How many of those paths carry a value.'),\n    percentage: z.number().int().describe('present / total, as a 0–100 integer.'),\n    missing: z.array(z.string()).describe('Paths that are absent or empty.'),\n    requiredTotal: z.number().int().describe('Count of schema-required leaf paths.'),\n    requiredPresent: z.number().int().describe('How many required paths carry a value.'),\n    requiredPercentage: z\n      .number()\n      .int()\n      .describe('requiredPresent / requiredTotal, as a 0–100 integer.'),\n  })\n  .meta({ id: 'CompletenessResult' })\n  .describe('How fully an observation populates the records schema.');\n\nexport type CompletenessResult = z.infer<typeof CompletenessResultSchema>;\n\nexport interface CompletenessOptions {\n  /** Override the derived field-path set (defaults to the records schema). */\n  paths?: FieldPath[];\n}\n\nfunction getNested(obj: Record<string, unknown>, path: string): unknown {\n  let current: unknown = obj;\n  for (const part of path.split('.')) {\n    if (current == null || typeof current !== 'object') return undefined;\n    current = (current as Record<string, unknown>)[part];\n  }\n  return current;\n}\n\nfunction isPresent(value: unknown): boolean {\n  if (value == null) return false;\n  if (typeof value === 'string') return value.length > 0;\n  if (Array.isArray(value)) return value.length > 0;\n  if (typeof value === 'object') return Object.keys(value).length > 0;\n  return true;\n}\n\n// Field paths are stable for a given schema version, so derive once and reuse.\nlet cachedPaths: FieldPath[] | null = null;\nfunction defaultPaths(): FieldPath[] {\n  return (cachedPaths ??= deriveFieldPaths());\n}\n\nfunction pct(present: number, total: number): number {\n  return total > 0 ? Math.round((present / total) * 100) : 0;\n}\n\n/**\n * Measure how fully an observation populates the records schema. This is the\n * \"is it well-documented?\" axis — deliberately kept separate from compellingness\n * (\"is it anomalous?\"), so a thin-but-anomalous case never masquerades as complete.\n */\nexport function getCompleteness(\n  observation: Observation | Record<string, unknown>,\n  options?: CompletenessOptions,\n): CompletenessResult {\n  const record = observation as Record<string, unknown>;\n  const paths = options?.paths ?? defaultPaths();\n  const missing: string[] = [];\n  let present = 0;\n  let requiredTotal = 0;\n  let requiredPresent = 0;\n\n  for (const field of paths) {\n    const ok = isPresent(getNested(record, field.path));\n    if (ok) present++;\n    else missing.push(field.path);\n    if (field.required) {\n      requiredTotal++;\n      if (ok) requiredPresent++;\n    }\n  }\n\n  return {\n    total: paths.length,\n    present,\n    percentage: pct(present, paths.length),\n    missing,\n    requiredTotal,\n    requiredPresent,\n    requiredPercentage: pct(requiredPresent, requiredTotal),\n  };\n}\n","import { z } from 'zod';\nimport type { Observation } from '@disclosureos/records';\nimport type { AssessmentLevel, ObservableClaim } from '@disclosureos/observables';\nimport type { OriginClaim } from '@disclosureos/origins';\n// Side-effect imports register the `observableAssessments` and `origin` slots on\n// `Observation` via module augmentation, so they are typed below.\nimport '@disclosureos/observables';\nimport '@disclosureos/origins';\n\n/** Methodology version stamped on every {@link ScoreResult}. Bump on weight/formula changes. */\nexport const SCORING_VERSION = '2.0.0' as const;\n\n/**\n * Ordinal anomaly strength per evidentiary tier. A `confirmed` signal counts\n * fully; `not_indicated` contributes nothing. Multiplied by the assessment's\n * confidence (default 1 when unstated). Exported so consumers can render the\n * methodology; override semantics may come in a future minor release.\n */\nexport const ASSESSMENT_LEVEL_WEIGHTS: Record<AssessmentLevel, number> = {\n  not_indicated: 0,\n  reported: 0.25,\n  documented: 0.5,\n  measured: 0.75,\n  confirmed: 1,\n};\n\n/**\n * OCS id prefixes treated as prosaic (well-explained). A confident *prosaic*\n * classification means the case is explained, so it contributes no anomaly\n * signal. Overridable per {@link score} call. Default is the OCS \"Prosaic\"\n * branch (`1.1.1`).\n */\nexport const DEFAULT_PROSAIC_OCS_PREFIXES: readonly string[] = ['1.1.1'];\n\nexport const CompellingnessWeightsSchema = z\n  .object({\n    technology: z.number().min(0).describe('Weight of the technology-anomaly signal.'),\n    biologics: z.number().min(0).describe('Weight of the biologics-anomaly signal.'),\n    origin: z.number().min(0).describe('Weight of the (non-prosaic) origin-confidence signal.'),\n  })\n  .meta({ id: 'CompellingnessWeights' })\n  .describe('Relative weights for the compellingness components. Need not sum to 1 — normalized internally.');\n\nexport type CompellingnessWeights = z.infer<typeof CompellingnessWeightsSchema>;\n\n/**\n * Fixed default weights, exposed as a transparent, overridable data object (not a\n * config system). Partners can propose alternate weight sets without an API change.\n *\n * @experimental The *shape* (`CompellingnessWeights`) is stable, but these specific\n * default values are a reference methodology that may be re-tuned in a minor release.\n * Pin your own `weights` via {@link ScoreOptions} if you need stable numbers.\n */\nexport const DEFAULT_WEIGHTS: CompellingnessWeights = {\n  technology: 0.45,\n  biologics: 0.35,\n  origin: 0.2,\n};\n\nexport const ScoreResultSchema = z\n  .object({\n    score: z.number().min(0).max(1).describe('Overall compellingness (consensus point estimate), 0–1.'),\n    range: z\n      .object({\n        low: z.number().min(0).max(1).describe('Most-skeptical reading of the strongest-anomaly signal across competing claims.'),\n        high: z.number().min(0).max(1).describe('Most-anomalous reading of the strongest-anomaly signal across competing claims.'),\n      })\n      .describe(\n        'Spread of the score across competing claims — wide range signals disagreement. Bounds are '\n        + 'computed per-signal under the same strongest-anomaly (max) reduction as the point estimate, '\n        + 'not a global min/max over every claim.',\n      ),\n    contested: z\n      .boolean()\n      .describe('True when claims disagree on *direction* (some assert anomaly, some assert none).'),\n    components: z\n      .object({\n        technology: z.number().min(0).max(1),\n        biologics: z.number().min(0).max(1),\n        origin: z.number().min(0).max(1),\n      })\n      .describe('Per-signal consensus contributions before weighting.'),\n    weights: CompellingnessWeightsSchema,\n    scoringVersion: z.string().describe('Methodology version that produced this score.'),\n  })\n  .meta({ id: 'ScoreResult' })\n  .describe('A reference compellingness score for an observation, with a contestedness range.');\n\nexport type ScoreResult = z.infer<typeof ScoreResultSchema>;\n\n/** The minimal claim shape the trust hook sees (it never needs the full body). */\nexport type EvaluatorWeightInput = {\n  evaluatedBy?: string | undefined;\n  evidenceRefs?: string[] | undefined;\n};\n\nexport interface ScoreOptions {\n  weights?: CompellingnessWeights;\n  /** Override the prosaic OCS prefixes (defaults to {@link DEFAULT_PROSAIC_OCS_PREFIXES}). */\n  prosaicPrefixes?: readonly string[];\n  /**\n   * Trust applied to each claim's vote in the consensus point estimate (default\n   * 1.0 — uniform). This is where a future trust policy (e.g.\n   * weighting verified/official evaluators higher) plugs in here without changing\n   * the formula. Range/contestedness are NOT affected — they report the honest\n   * spread of what evaluators actually asserted.\n   *\n   * @experimental The hook signature is stable, but the default trust *policy*\n   * (uniform 1.0) is deliberately unopinionated and is a separate, ongoing design\n   * task; a future built-in policy may change the default.\n   */\n  evaluatorWeight?: (claim: EvaluatorWeightInput) => number;\n}\n\nconst UNIFORM_TRUST = (): number => 1;\n\nfunction isProsaic(id: string, prefixes: readonly string[]): boolean {\n  return prefixes.some((p) => id === p || id.startsWith(`${p}.`));\n}\n\nfunction round(n: number): number {\n  return Math.round(n * 1e4) / 1e4;\n}\n\ntype Weighted = { magnitude: number; weight: number };\n\ninterface ClaimStats {\n  /** Trust-weighted mean magnitude (the consensus point). */\n  point: number;\n  /** Min asserted magnitude (most skeptical). */\n  low: number;\n  /** Max asserted magnitude (most anomalous). */\n  high: number;\n  /** Claims disagree on direction (some > 0, some === 0). */\n  contested: boolean;\n}\n\nconst EMPTY_STATS: ClaimStats = { point: 0, low: 0, high: 0, contested: false };\n\nfunction reduceClaims(weighted: Weighted[]): ClaimStats {\n  if (weighted.length === 0) return EMPTY_STATS;\n  let wsum = 0;\n  let msum = 0;\n  let low = Infinity;\n  let high = -Infinity;\n  let anyAnomaly = false;\n  let anyNone = false;\n  for (const { magnitude, weight } of weighted) {\n    wsum += weight;\n    msum += magnitude * weight;\n    if (magnitude < low) low = magnitude;\n    if (magnitude > high) high = magnitude;\n    if (magnitude > 0) anyAnomaly = true;\n    else anyNone = true;\n  }\n  return {\n    point: wsum > 0 ? msum / wsum : 0,\n    low,\n    high,\n    contested: anyAnomaly && anyNone,\n  };\n}\n\n/** Asserted anomaly magnitude of one observable claim, in [0,1]. */\nfunction observableMagnitude(claim: ObservableClaim): number {\n  return ASSESSMENT_LEVEL_WEIGHTS[claim.level] * (claim.confidence ?? 1);\n}\n\n/**\n * Strongest established anomaly within a domain — the \"is there *any* anomaly?\" reduction.\n * `point`/`low`/`high` are each a **max across observables** of that observable's claim-list\n * stat. So `low` is \"the most-skeptical reading of the strongest-anomaly observable,\" not a\n * global floor across all observables — consistent with the point estimate's max reduction.\n */\nfunction domainStats(\n  group: Partial<Record<string, ObservableClaim[]>> | undefined,\n  evaluatorWeight: (claim: EvaluatorWeightInput) => number,\n): ClaimStats {\n  if (!group) return EMPTY_STATS;\n  let point = 0;\n  let low = 0;\n  let high = 0;\n  let contested = false;\n  for (const claims of Object.values(group)) {\n    if (!claims || claims.length === 0) continue;\n    const weighted = claims.map<Weighted>((c) => ({\n      magnitude: observableMagnitude(c),\n      weight: (c.confidence ?? 1) * evaluatorWeight(c),\n    }));\n    const stats = reduceClaims(weighted);\n    if (stats.point > point) point = stats.point;\n    if (stats.low > low) low = stats.low;\n    if (stats.high > high) high = stats.high;\n    if (stats.contested) contested = true;\n  }\n  return { point, low, high, contested };\n}\n\n/** Confidence in a *non-prosaic* origin, reduced across competing classifications. */\nfunction originStats(\n  origin: OriginClaim[] | undefined,\n  prefixes: readonly string[],\n  evaluatorWeight: (claim: EvaluatorWeightInput) => number,\n): ClaimStats {\n  if (!origin || origin.length === 0) return EMPTY_STATS;\n  const weighted = origin.map<Weighted>((c) => ({\n    magnitude: isProsaic(c.primaryHypothesis, prefixes) ? 0 : c.confidence,\n    weight: c.confidence * evaluatorWeight(c),\n  }));\n  return reduceClaims(weighted);\n}\n\n/**\n * Reference compellingness scorer. Combines the strongest technology- and\n * biologics-anomaly signals (from `observableAssessments`) with the confidence in\n * a *non-prosaic* origin classification (from `origin`), under transparent,\n * overridable weights. Each slot is a *list* of competing claims, so the scorer\n * reports a consensus `score`, the `range` of readings across claims, and whether\n * the case is `contested` (evaluators disagree on direction). This answers \"how\n * strongly does this case bear on the two public questions — anomalous\n * tech/biologics, and a non-mundane origin?\" — distinct from completeness.\n */\nexport function score(observation: Observation, options?: ScoreOptions): ScoreResult {\n  const weights = options?.weights ?? DEFAULT_WEIGHTS;\n  const prosaicPrefixes = options?.prosaicPrefixes ?? DEFAULT_PROSAIC_OCS_PREFIXES;\n  const evaluatorWeight = options?.evaluatorWeight ?? UNIFORM_TRUST;\n\n  const assessments = observation.observableAssessments;\n  const technology = domainStats(assessments?.technology, evaluatorWeight);\n  const biologics = domainStats(assessments?.biologics, evaluatorWeight);\n  const origin = originStats(observation.origin, prosaicPrefixes, evaluatorWeight);\n\n  const totalWeight = weights.technology + weights.biologics + weights.origin;\n  const combine = (t: number, b: number, o: number): number =>\n    totalWeight > 0\n      ? (t * weights.technology + b * weights.biologics + o * weights.origin) / totalWeight\n      : 0;\n\n  return {\n    score: round(combine(technology.point, biologics.point, origin.point)),\n    range: {\n      low: round(combine(technology.low, biologics.low, origin.low)),\n      high: round(combine(technology.high, biologics.high, origin.high)),\n    },\n    contested: technology.contested || biologics.contested || origin.contested,\n    components: {\n      technology: round(technology.point),\n      biologics: round(biologics.point),\n      origin: round(origin.point),\n    },\n    weights,\n    scoringVersion: SCORING_VERSION,\n  };\n}\n\nexport interface RankedObservation<T extends Observation = Observation> {\n  observation: T;\n  result: ScoreResult;\n}\n\n/**\n * Score a set of observations and return them sorted most-compelling first — the\n * \"float the strongest cases to the top\" use case.\n */\nexport function rankByCompellingness<T extends Observation>(\n  observations: readonly T[],\n  options?: ScoreOptions,\n): RankedObservation<T>[] {\n  return observations\n    .map((observation) => ({ observation, result: score(observation, options) }))\n    .sort((a, b) => b.result.score - a.result.score);\n}\n","import { z } from 'zod';\nimport { jsonSchemaEnvelope, schemaId } from '@disclosureos/records/shared';\nimport { CompletenessResultSchema } from './completeness';\nimport { ScoreResultSchema, CompellingnessWeightsSchema } from './compellingness';\n\nexport const SCORING_SCHEMA_VERSION = '2.0.0';\n\nexport const SCORING_SCHEMA_ID = schemaId('scoring', 'scoring', SCORING_SCHEMA_VERSION);\n\n/**\n * Emit the JSON Schema (draft 2020-12) for the scoring output shapes\n * ({@link CompletenessResultSchema}, {@link ScoreResultSchema}) so downstream\n * consumers (and other languages) can validate stored scores.\n */\nexport function scoringJsonSchema(): Record<string, unknown> {\n  const bundle = z.toJSONSchema(\n    z.object({\n      completeness: CompletenessResultSchema,\n      compellingness: ScoreResultSchema,\n      weights: CompellingnessWeightsSchema,\n    }),\n    { target: 'draft-2020-12' },\n  ) as Record<string, unknown>;\n  return jsonSchemaEnvelope(bundle, { id: SCORING_SCHEMA_ID, version: SCORING_SCHEMA_VERSION });\n}\n"]}

package/package.json

@@ -0,0 +1,81 @@
+{
+  "name": "@disclosureos/scoring",
+  "version": "1.0.0",
+  "description": "Reference scoring for the DisclosureOS ecosystem — record completeness and case compellingness across the Observables and Origin layers",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/disclosurefoundation/disclosureos"
+  },
+  "homepage": "https://github.com/disclosurefoundation/disclosureos#readme",
+  "bugs": {
+    "url": "https://github.com/disclosurefoundation/disclosureos/issues"
+  },
+  "keywords": [
+    "disclosureos",
+    "UAP",
+    "scoring",
+    "completeness",
+    "compellingness",
+    "typescript"
+  ],
+  "sideEffects": false,
+  "type": "module",
+  "engines": {
+    "node": ">=20.0.0"
+  },
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    },
+    "./completeness": {
+      "types": "./dist/completeness/index.d.ts",
+      "import": "./dist/completeness/index.js"
+    },
+    "./compellingness": {
+      "types": "./dist/compellingness/index.d.ts",
+      "import": "./dist/compellingness/index.js"
+    },
+    "./schema": "./schema/scoring.schema.json",
+    "./package.json": "./package.json"
+  },
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "files": [
+    "dist",
+    "schema",
+    "README.md",
+    "CHANGELOG.md",
+    "LICENSE"
+  ],
+  "dependencies": {
+    "zod": "^4.4.3",
+    "@disclosureos/records": "1.0.0",
+    "@disclosureos/origins": "1.0.0",
+    "@disclosureos/observables": "1.0.0"
+  },
+  "devDependencies": {
+    "@types/node": "^20",
+    "tsup": "^8.0.0",
+    "tsx": "^4.21.0",
+    "typescript": "^5.7.2",
+    "vitest": "^4.0.18",
+    "@arethetypeswrong/cli": "^0.18.3",
+    "publint": "^0.3.21",
+    "@repo/typescript-config": "0.0.0"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "tsup",
+    "dev": "tsup --watch",
+    "lint": "eslint .",
+    "type-check": "tsc --noEmit",
+    "emit:schema": "tsx scripts/emit-schema.ts",
+    "clean": "rm -rf dist",
+    "test": "vitest",
+    "lint:publish": "publint --strict && attw --pack . --profile esm-only"
+  }
+}

package/schema/scoring.schema.json

@@ -0,0 +1,194 @@
+{
+  "$schema": "https://json-schema.org/draft/2020-12/schema",
+  "$id": "https://os.disclosure.org/schema/scoring/2.0.0/scoring.json",
+  "x-schema-version": "2.0.0",
+  "type": "object",
+  "properties": {
+    "completeness": {
+      "description": "How fully an observation populates the records schema.",
+      "$ref": "#/$defs/CompletenessResult"
+    },
+    "compellingness": {
+      "description": "A reference compellingness score for an observation, with a contestedness range.",
+      "$ref": "#/$defs/ScoreResult"
+    },
+    "weights": {
+      "description": "Relative weights for the compellingness components. Need not sum to 1 — normalized internally.",
+      "$ref": "#/$defs/CompellingnessWeights"
+    }
+  },
+  "required": [
+    "completeness",
+    "compellingness",
+    "weights"
+  ],
+  "additionalProperties": false,
+  "$defs": {
+    "CompletenessResult": {
+      "type": "object",
+      "properties": {
+        "total": {
+          "type": "integer",
+          "minimum": -9007199254740991,
+          "maximum": 9007199254740991,
+          "description": "Total leaf field paths defined by the records schema."
+        },
+        "present": {
+          "type": "integer",
+          "minimum": -9007199254740991,
+          "maximum": 9007199254740991,
+          "description": "How many of those paths carry a value."
+        },
+        "percentage": {
+          "type": "integer",
+          "minimum": -9007199254740991,
+          "maximum": 9007199254740991,
+          "description": "present / total, as a 0–100 integer."
+        },
+        "missing": {
+          "type": "array",
+          "items": {
+            "type": "string"
+          },
+          "description": "Paths that are absent or empty."
+        },
+        "requiredTotal": {
+          "type": "integer",
+          "minimum": -9007199254740991,
+          "maximum": 9007199254740991,
+          "description": "Count of schema-required leaf paths."
+        },
+        "requiredPresent": {
+          "type": "integer",
+          "minimum": -9007199254740991,
+          "maximum": 9007199254740991,
+          "description": "How many required paths carry a value."
+        },
+        "requiredPercentage": {
+          "type": "integer",
+          "minimum": -9007199254740991,
+          "maximum": 9007199254740991,
+          "description": "requiredPresent / requiredTotal, as a 0–100 integer."
+        }
+      },
+      "required": [
+        "total",
+        "present",
+        "percentage",
+        "missing",
+        "requiredTotal",
+        "requiredPresent",
+        "requiredPercentage"
+      ],
+      "additionalProperties": false
+    },
+    "CompellingnessWeights": {
+      "type": "object",
+      "properties": {
+        "technology": {
+          "type": "number",
+          "minimum": 0,
+          "description": "Weight of the technology-anomaly signal."
+        },
+        "biologics": {
+          "type": "number",
+          "minimum": 0,
+          "description": "Weight of the biologics-anomaly signal."
+        },
+        "origin": {
+          "type": "number",
+          "minimum": 0,
+          "description": "Weight of the (non-prosaic) origin-confidence signal."
+        }
+      },
+      "required": [
+        "technology",
+        "biologics",
+        "origin"
+      ],
+      "additionalProperties": false
+    },
+    "ScoreResult": {
+      "type": "object",
+      "properties": {
+        "score": {
+          "type": "number",
+          "minimum": 0,
+          "maximum": 1,
+          "description": "Overall compellingness (consensus point estimate), 0–1."
+        },
+        "range": {
+          "type": "object",
+          "properties": {
+            "low": {
+              "type": "number",
+              "minimum": 0,
+              "maximum": 1,
+              "description": "Most-skeptical reading of the strongest-anomaly signal across competing claims."
+            },
+            "high": {
+              "type": "number",
+              "minimum": 0,
+              "maximum": 1,
+              "description": "Most-anomalous reading of the strongest-anomaly signal across competing claims."
+            }
+          },
+          "required": [
+            "low",
+            "high"
+          ],
+          "additionalProperties": false,
+          "description": "Spread of the score across competing claims — wide range signals disagreement. Bounds are computed per-signal under the same strongest-anomaly (max) reduction as the point estimate, not a global min/max over every claim."
+        },
+        "contested": {
+          "type": "boolean",
+          "description": "True when claims disagree on *direction* (some assert anomaly, some assert none)."
+        },
+        "components": {
+          "type": "object",
+          "properties": {
+            "technology": {
+              "type": "number",
+              "minimum": 0,
+              "maximum": 1
+            },
+            "biologics": {
+              "type": "number",
+              "minimum": 0,
+              "maximum": 1
+            },
+            "origin": {
+              "type": "number",
+              "minimum": 0,
+              "maximum": 1
+            }
+          },
+          "required": [
+            "technology",
+            "biologics",
+            "origin"
+          ],
+          "additionalProperties": false,
+          "description": "Per-signal consensus contributions before weighting."
+        },
+        "weights": {
+          "description": "Relative weights for the compellingness components. Need not sum to 1 — normalized internally.",
+          "$ref": "#/$defs/CompellingnessWeights"
+        },
+        "scoringVersion": {
+          "type": "string",
+          "description": "Methodology version that produced this score."
+        }
+      },
+      "required": [
+        "score",
+        "range",
+        "contested",
+        "components",
+        "weights",
+        "scoringVersion"
+      ],
+      "additionalProperties": false
+    }
+  }
+}