@indexnetwork/protocol 4.12.0-rc.352.1 → 4.14.0-rc.354.1

package/dist/opportunity/discriminator/discriminator.assigner.js

@@ -0,0 +1,154 @@
+var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
+    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+    return c > 3 && r && Object.defineProperty(target, key, r), r;
+};
+var __metadata = (this && this.__metadata) || function (k, v) {
+    if (typeof Reflect === "object" && typeof Reflect.metadata === "function") return Reflect.metadata(k, v);
+};
+/**
+ * Evidence-verified assignment of call-local newborn candidates to already
+ * answered pool-discriminator axes (IND-420 P4b).
+ *
+ * One structured model call batches every fixed axis and candidate. The model
+ * never receives the owner's chosen side; it only classifies public candidate
+ * context. Code owns all identifiers, allowed sides, and evidence verification.
+ */
+import { HumanMessage, SystemMessage } from "@langchain/core/messages";
+import { z } from "zod";
+import { createStructuredModel } from "../../shared/agent/model.config.js";
+import { invokeWithAbortSignal } from "../../shared/agent/model-signal.js";
+import { protocolLogger } from "../../shared/observability/protocol.logger.js";
+import { Timed } from "../../shared/observability/performance.js";
+import { POOL_DISCRIMINATOR_MAX_CANDIDATES } from "./discriminator.env.js";
+import { poolEvidenceMatches } from "./discriminator.miner.js";
+/** QuestionerAdapter caps fresh answered preferences at this count. */
+const MAX_ASSIGNMENT_AXES = 10;
+const logger = protocolLogger("PoolDiscriminatorAssigner");
+const AssignmentSchema = z.object({
+    candidateId: z.string(),
+    side: z.string().nullable(),
+    evidence: z.string().max(200).nullable(),
+});
+const AxisSchema = z.object({
+    questionId: z.string(),
+    assignments: z.array(AssignmentSchema).max(POOL_DISCRIMINATOR_MAX_CANDIDATES),
+});
+// Keep fields optional at the outer response layer so one malformed/missing
+// axis can be skipped independently, while still bounding and describing the
+// nested assignment payload sent through structured output.
+const ResponseAxisSchema = z.object({
+    questionId: z.string().optional(),
+    assignments: z.array(AssignmentSchema).max(POOL_DISCRIMINATOR_MAX_CANDIDATES).optional(),
+}).passthrough();
+const ResponseSchema = z.object({ axes: z.array(ResponseAxisSchema).max(MAX_ASSIGNMENT_AXES) });
+const SYSTEM_PROMPT = `Classify candidate matches against FIXED preference axes.
+
+Rules:
+- Use only the supplied questionId, candidateId, and side labels. Never invent or rename them.
+- Return one axis object per supplied question and one assignment per candidate.
+- Pick a side only when the candidate context clearly supports it; otherwise use side null and evidence null.
+- Every non-null side requires a short VERBATIM substring copied from that candidate's context. It is checked mechanically.
+- Do not infer the user's preference. You are classifying candidates, not choosing which side is better.
+- Return only questionId, candidateId, side, and evidence fields.`;
+/** Build the classifier prompt without any chosen-side preference. */
+export function buildAssignmentPrompt(input) {
+    const axes = input.axes.map((axis) => ({
+        questionId: axis.questionId,
+        label: axis.label,
+        sides: axis.sides,
+    }));
+    const candidates = input.candidates.map((candidate) => ({
+        candidateId: candidate.id,
+        publicContext: candidate.publicContext,
+    }));
+    return JSON.stringify({ axes, candidates }, null, 2);
+}
+/** Verify one model-returned axis against fixed IDs, sides, and contexts. */
+export function verifyAssignedAxis(raw, input) {
+    const fixedAxis = input.axes.find((axis) => axis.questionId === raw.questionId);
+    if (!fixedAxis)
+        return null;
+    const contextById = new Map(input.candidates.map((candidate) => [candidate.id, candidate.publicContext]));
+    const firstById = new Map();
+    for (const assignment of raw.assignments) {
+        const context = contextById.get(assignment.candidateId);
+        if (context === undefined || firstById.has(assignment.candidateId))
+            continue;
+        if (assignment.side === null) {
+            firstById.set(assignment.candidateId, {
+                candidateId: assignment.candidateId,
+                side: null,
+                evidence: null,
+            });
+            continue;
+        }
+        if (!fixedAxis.sides.includes(assignment.side) || !poolEvidenceMatches(context, assignment.evidence)) {
+            firstById.set(assignment.candidateId, {
+                candidateId: assignment.candidateId,
+                side: null,
+                evidence: null,
+            });
+            continue;
+        }
+        firstById.set(assignment.candidateId, {
+            candidateId: assignment.candidateId,
+            side: assignment.side,
+            evidence: assignment.evidence,
+        });
+    }
+    return {
+        questionId: fixedAxis.questionId,
+        assignments: input.candidates.map((candidate) => firstById.get(candidate.id) ?? {
+            candidateId: candidate.id,
+            side: null,
+            evidence: null,
+        }),
+    };
+}
+/** Stateless one-call newborn candidate classifier. */
+export class PoolDiscriminatorAssigner {
+    constructor(config) {
+        this.model = createStructuredModel("poolDiscriminatorAssigner", ResponseSchema, { name: "pool_newborn_assignments" }, config?.modelConfig);
+    }
+    /**
+     * Classify every candidate against every fixed axis in one provider call.
+     * Provider failures propagate so the host graph's fail-open seam can retain
+     * the original un-stamped create items.
+     */
+    async assign(input, options) {
+        if (input.axes.length === 0 || input.candidates.length === 0)
+            return [];
+        const boundedInput = {
+            axes: input.axes.slice(0, MAX_ASSIGNMENT_AXES),
+            candidates: input.candidates.slice(0, POOL_DISCRIMINATOR_MAX_CANDIDATES),
+        };
+        const raw = await invokeWithAbortSignal(this.model, [new SystemMessage(SYSTEM_PROMPT), new HumanMessage(buildAssignmentPrompt(boundedInput))], options?.signal);
+        const parsed = ResponseSchema.safeParse(raw);
+        if (!parsed.success) {
+            logger.warn("Assignment response failed schema validation", { issues: parsed.error.issues.length });
+            return [];
+        }
+        const seen = new Set();
+        const verified = [];
+        for (const rawAxis of parsed.data.axes) {
+            const axis = AxisSchema.safeParse(rawAxis);
+            if (!axis.success || seen.has(axis.data.questionId))
+                continue;
+            const result = verifyAssignedAxis(axis.data, boundedInput);
+            if (!result)
+                continue;
+            seen.add(result.questionId);
+            verified.push(result);
+        }
+        return verified;
+    }
+}
+__decorate([
+    Timed(),
+    __metadata("design:type", Function),
+    __metadata("design:paramtypes", [Object, Object]),
+    __metadata("design:returntype", Promise)
+], PoolDiscriminatorAssigner.prototype, "assign", null);
+//# sourceMappingURL=discriminator.assigner.js.map

package/dist/opportunity/discriminator/discriminator.assigner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"discriminator.assigner.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.assigner.ts"],"names":[],"mappings":";;;;;;;;;AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,cAAc,EAAE,MAAM,+CAA+C,CAAC;AAC/E,OAAO,EAAE,KAAK,EAAE,MAAM,2CAA2C,CAAC;AAClE,OAAO,EAAE,iCAAiC,EAAE,MAAM,wBAAwB,CAAC;AAC3E,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAG/D,uEAAuE;AACvE,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAC/B,MAAM,MAAM,GAAG,cAAc,CAAC,2BAA2B,CAAC,CAAC;AAE3D,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IAChC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE;IACvB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAC3B,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;CACzC,CAAC,CAAC;AAEH,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1B,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE;IACtB,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,iCAAiC,CAAC;CAC9E,CAAC,CAAC;AAEH,4EAA4E;AAC5E,6EAA6E;AAC7E,4DAA4D;AAC5D,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC;IAClC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IACjC,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAC,QAAQ,EAAE;CACzF,CAAC,CAAC,WAAW,EAAE,CAAC;AACjB,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;AAIhG,MAAM,aAAa,GAAG;;;;;;;;kEAQ4C,CAAC;AAiCnE,sEAAsE;AACtE,MAAM,UAAU,qBAAqB,CAAC,KAAuC;IAC3E,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACrC,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,KAAK,EAAE,IAAI,CAAC,KAAK;KAClB,CAAC,CAAC,CAAC;IACJ,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACtD,WAAW,EAAE,SAAS,CAAC,EAAE;QACzB,aAAa,EAAE,SAAS,CAAC,aAAa;KACvC,CAAC,CAAC,CAAC;IACJ,OAAO,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,kBAAkB,CAChC,GAAY,EACZ,KAAuC;IAEvC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,GAAG,CAAC,UAAU,CAAC,CAAC;IAChF,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,SAAS,GAAG,IAAI,GAAG,EAAgD,CAAC;IAC1E,KAAK,MAAM,UAAU,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QACxD,IAAI,OAAO,KAAK,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC;YAAE,SAAS;QAC7E,IAAI,UAAU,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE;gBACpC,WAAW,EAAE,UAAU,CAAC,WAAW;gBACnC,IAAI,EAAE,IAAI;gBACV,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE;gBACpC,WAAW,EAAE,UAAU,CAAC,WAAW;gBACnC,IAAI,EAAE,IAAI;gBACV,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE;YACpC,WAAW,EAAE,UAAU,CAAC,WAAW;YACnC,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,QAAQ,EAAE,UAAU,CAAC,QAAQ;SAC9B,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,UAAU,EAAE,SAAS,CAAC,UAAU;QAChC,WAAW,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI;YAC9E,WAAW,EAAE,SAAS,CAAC,EAAE;YACzB,IAAI,EAAE,IAAI;YACV,QAAQ,EAAE,IAAI;SACf,CAAC;KACH,CAAC;AACJ,CAAC;AAED,uDAAuD;AACvD,MAAM,OAAO,yBAAyB;IAGpC,YAAY,MAAwC;QAClD,IAAI,CAAC,KAAK,GAAG,qBAAqB,CAChC,2BAA2B,EAC3B,cAAc,EACd,EAAE,IAAI,EAAE,0BAA0B,EAAE,EACpC,MAAM,EAAE,WAAW,CACpB,CAAC;IACJ,CAAC;IAED;;;;OAIG;IAEG,AAAN,KAAK,CAAC,MAAM,CACV,KAAuC,EACvC,OAAkC;QAElC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACxE,MAAM,YAAY,GAAqC;YACrD,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC;YAC9C,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,iCAAiC,CAAC;SACzE,CAAC;QACF,MAAM,GAAG,GAAG,MAAM,qBAAqB,CACrC,IAAI,CAAC,KAAK,EACV,CAAC,IAAI,aAAa,CAAC,aAAa,CAAC,EAAE,IAAI,YAAY,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,EACzF,OAAO,EAAE,MAAM,CAChB,CAAC;QACF,MAAM,MAAM,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,8CAA8C,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YACpG,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,QAAQ,GAAoC,EAAE,CAAC;QACrD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAC3C,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;gBAAE,SAAS;YAC9D,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;YAC3D,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC5B,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAhCO;IADL,KAAK,EAAE;;;;uDAgCP","sourcesContent":["/**\n * Evidence-verified assignment of call-local newborn candidates to already\n * answered pool-discriminator axes (IND-420 P4b).\n *\n * One structured model call batches every fixed axis and candidate. The model\n * never receives the owner's chosen side; it only classifies public candidate\n * context. Code owns all identifiers, allowed sides, and evidence verification.\n */\nimport { HumanMessage, SystemMessage } from \"@langchain/core/messages\";\nimport { z } from \"zod\";\n\nimport { createStructuredModel } from \"../../shared/agent/model.config.js\";\nimport { invokeWithAbortSignal } from \"../../shared/agent/model-signal.js\";\nimport { protocolLogger } from \"../../shared/observability/protocol.logger.js\";\nimport { Timed } from \"../../shared/observability/performance.js\";\nimport { POOL_DISCRIMINATOR_MAX_CANDIDATES } from \"./discriminator.env.js\";\nimport { poolEvidenceMatches } from \"./discriminator.miner.js\";\nimport type { PoolCandidate } from \"./discriminator.types.js\";\n\n/** QuestionerAdapter caps fresh answered preferences at this count. */\nconst MAX_ASSIGNMENT_AXES = 10;\nconst logger = protocolLogger(\"PoolDiscriminatorAssigner\");\n\nconst AssignmentSchema = z.object({\n  candidateId: z.string(),\n  side: z.string().nullable(),\n  evidence: z.string().max(200).nullable(),\n});\n\nconst AxisSchema = z.object({\n  questionId: z.string(),\n  assignments: z.array(AssignmentSchema).max(POOL_DISCRIMINATOR_MAX_CANDIDATES),\n});\n\n// Keep fields optional at the outer response layer so one malformed/missing\n// axis can be skipped independently, while still bounding and describing the\n// nested assignment payload sent through structured output.\nconst ResponseAxisSchema = z.object({\n  questionId: z.string().optional(),\n  assignments: z.array(AssignmentSchema).max(POOL_DISCRIMINATOR_MAX_CANDIDATES).optional(),\n}).passthrough();\nconst ResponseSchema = z.object({ axes: z.array(ResponseAxisSchema).max(MAX_ASSIGNMENT_AXES) });\ntype AssignmentResponse = z.infer<typeof ResponseSchema>;\ntype RawAxis = z.infer<typeof AxisSchema>;\n\nconst SYSTEM_PROMPT = `Classify candidate matches against FIXED preference axes.\n\nRules:\n- Use only the supplied questionId, candidateId, and side labels. Never invent or rename them.\n- Return one axis object per supplied question and one assignment per candidate.\n- Pick a side only when the candidate context clearly supports it; otherwise use side null and evidence null.\n- Every non-null side requires a short VERBATIM substring copied from that candidate's context. It is checked mechanically.\n- Do not infer the user's preference. You are classifying candidates, not choosing which side is better.\n- Return only questionId, candidateId, side, and evidence fields.`;\n\n/** Fixed answered axis; deliberately excludes the owner's chosen side. */\nexport interface PoolDiscriminatorAssignmentAxis {\n  questionId: string;\n  label: string;\n  sides: string[];\n}\n\n/** One batched assignment call. */\nexport interface PoolDiscriminatorAssignmentInput {\n  axes: PoolDiscriminatorAssignmentAxis[];\n  candidates: PoolCandidate[];\n}\n\n/** Verified assignment. Invalid or explicit unknown classifications use null. */\nexport interface PoolDiscriminatorCandidateAssignment {\n  candidateId: string;\n  side: string | null;\n  evidence: string | null;\n}\n\n/** One valid returned axis. Missing or malformed axes are omitted entirely. */\nexport interface PoolDiscriminatorAssignedAxis {\n  questionId: string;\n  assignments: PoolDiscriminatorCandidateAssignment[];\n}\n\n/** Construction options for {@link PoolDiscriminatorAssigner}. */\nexport interface PoolDiscriminatorAssignerConfig {\n  modelConfig?: Parameters<typeof createStructuredModel>[3];\n}\n\n/** Build the classifier prompt without any chosen-side preference. */\nexport function buildAssignmentPrompt(input: PoolDiscriminatorAssignmentInput): string {\n  const axes = input.axes.map((axis) => ({\n    questionId: axis.questionId,\n    label: axis.label,\n    sides: axis.sides,\n  }));\n  const candidates = input.candidates.map((candidate) => ({\n    candidateId: candidate.id,\n    publicContext: candidate.publicContext,\n  }));\n  return JSON.stringify({ axes, candidates }, null, 2);\n}\n\n/** Verify one model-returned axis against fixed IDs, sides, and contexts. */\nexport function verifyAssignedAxis(\n  raw: RawAxis,\n  input: PoolDiscriminatorAssignmentInput,\n): PoolDiscriminatorAssignedAxis | null {\n  const fixedAxis = input.axes.find((axis) => axis.questionId === raw.questionId);\n  if (!fixedAxis) return null;\n\n  const contextById = new Map(input.candidates.map((candidate) => [candidate.id, candidate.publicContext]));\n  const firstById = new Map<string, PoolDiscriminatorCandidateAssignment>();\n  for (const assignment of raw.assignments) {\n    const context = contextById.get(assignment.candidateId);\n    if (context === undefined || firstById.has(assignment.candidateId)) continue;\n    if (assignment.side === null) {\n      firstById.set(assignment.candidateId, {\n        candidateId: assignment.candidateId,\n        side: null,\n        evidence: null,\n      });\n      continue;\n    }\n    if (!fixedAxis.sides.includes(assignment.side) || !poolEvidenceMatches(context, assignment.evidence)) {\n      firstById.set(assignment.candidateId, {\n        candidateId: assignment.candidateId,\n        side: null,\n        evidence: null,\n      });\n      continue;\n    }\n    firstById.set(assignment.candidateId, {\n      candidateId: assignment.candidateId,\n      side: assignment.side,\n      evidence: assignment.evidence,\n    });\n  }\n\n  return {\n    questionId: fixedAxis.questionId,\n    assignments: input.candidates.map((candidate) => firstById.get(candidate.id) ?? {\n      candidateId: candidate.id,\n      side: null,\n      evidence: null,\n    }),\n  };\n}\n\n/** Stateless one-call newborn candidate classifier. */\nexport class PoolDiscriminatorAssigner {\n  private model: ReturnType<typeof createStructuredModel<AssignmentResponse>>;\n\n  constructor(config?: PoolDiscriminatorAssignerConfig) {\n    this.model = createStructuredModel<AssignmentResponse>(\n      \"poolDiscriminatorAssigner\",\n      ResponseSchema,\n      { name: \"pool_newborn_assignments\" },\n      config?.modelConfig,\n    );\n  }\n\n  /**\n   * Classify every candidate against every fixed axis in one provider call.\n   * Provider failures propagate so the host graph's fail-open seam can retain\n   * the original un-stamped create items.\n   */\n  @Timed()\n  async assign(\n    input: PoolDiscriminatorAssignmentInput,\n    options?: { signal?: AbortSignal },\n  ): Promise<PoolDiscriminatorAssignedAxis[]> {\n    if (input.axes.length === 0 || input.candidates.length === 0) return [];\n    const boundedInput: PoolDiscriminatorAssignmentInput = {\n      axes: input.axes.slice(0, MAX_ASSIGNMENT_AXES),\n      candidates: input.candidates.slice(0, POOL_DISCRIMINATOR_MAX_CANDIDATES),\n    };\n    const raw = await invokeWithAbortSignal(\n      this.model,\n      [new SystemMessage(SYSTEM_PROMPT), new HumanMessage(buildAssignmentPrompt(boundedInput))],\n      options?.signal,\n    );\n    const parsed = ResponseSchema.safeParse(raw);\n    if (!parsed.success) {\n      logger.warn(\"Assignment response failed schema validation\", { issues: parsed.error.issues.length });\n      return [];\n    }\n\n    const seen = new Set<string>();\n    const verified: PoolDiscriminatorAssignedAxis[] = [];\n    for (const rawAxis of parsed.data.axes) {\n      const axis = AxisSchema.safeParse(rawAxis);\n      if (!axis.success || seen.has(axis.data.questionId)) continue;\n      const result = verifyAssignedAxis(axis.data, boundedInput);\n      if (!result) continue;\n      seen.add(result.questionId);\n      verified.push(result);\n    }\n    return verified;\n  }\n}\n"]}

package/dist/opportunity/discriminator/discriminator.env.d.ts

@@ -25,6 +25,13 @@ export type PoolQuestionsMode = "off" | "on";
  * "on" implies mining runs even when POOL_QUESTIONS_MINING is off.
  */
 export declare function poolQuestionsMode(): PoolQuestionsMode;
+/** Newborn-opportunity stamping mode (IND-420 P4b). */
+export type PoolQuestionsStampNewbornMode = "off" | "on";
+/**
+ * Current POOL_QUESTIONS_STAMP_NEWBORN mode (default off). Effective callers
+ * additionally require {@link poolQuestionsMode} to be on.
+ */
+export declare function poolQuestionsStampNewborn(): PoolQuestionsStampNewbornMode;
 /** Minimum VoI for a discriminator to become (or chain) a question. */
 export declare const POOL_QUESTION_MIN_VOI = 0.2;
 /** Minimum evidence-verification rate for a discriminator to become a question. */

package/dist/opportunity/discriminator/discriminator.env.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"discriminator.env.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.env.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,+CAA+C;AAC/C,MAAM,MAAM,uBAAuB,GAAG,KAAK,GAAG,QAAQ,CAAC;AAEvD,wDAAwD;AACxD,wBAAgB,uBAAuB,IAAI,uBAAuB,CAEjE;AAED,uDAAuD;AACvD,MAAM,MAAM,iBAAiB,GAAG,KAAK,GAAG,IAAI,CAAC;AAE7C;;;;;GAKG;AACH,wBAAgB,iBAAiB,IAAI,iBAAiB,CAErD;AAED,uEAAuE;AACvE,eAAO,MAAM,qBAAqB,MAAM,CAAC;AAEzC,mFAAmF;AACnF,eAAO,MAAM,+BAA+B,MAAM,CAAC;AAEnD,gFAAgF;AAChF,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAElD,uEAAuE;AACvE,eAAO,MAAM,oCAAoC,IAAI,CAAC;AAEtD,mDAAmD;AACnD,MAAM,MAAM,wBAAwB,GAAG,KAAK,GAAG,IAAI,CAAC;AAEpD;;;;;;GAMG;AACH,wBAAgB,oBAAoB,IAAI,wBAAwB,CAE/D;AAED,4EAA4E;AAC5E,eAAO,MAAM,4BAA4B,MAAM,CAAC;AAEhD,6EAA6E;AAC7E,eAAO,MAAM,8BAA8B,MAAM,CAAC;AAElD,8EAA8E;AAC9E,eAAO,MAAM,qBAAqB,MAAM,CAAC;AAEzC;;;;;GAKG;AACH,eAAO,MAAM,wBAAwB,MAAM,CAAC;AAE5C,8EAA8E;AAC9E,eAAO,MAAM,sBAAsB,QAAS,CAAC;AAE7C;;;;GAIG;AACH,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAElD,6DAA6D;AAC7D,eAAO,MAAM,iCAAiC,KAAK,CAAC;AAEpD,qEAAqE;AACrE,eAAO,MAAM,2CAA2C,MAAM,CAAC"}
+{"version":3,"file":"discriminator.env.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.env.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,+CAA+C;AAC/C,MAAM,MAAM,uBAAuB,GAAG,KAAK,GAAG,QAAQ,CAAC;AAEvD,wDAAwD;AACxD,wBAAgB,uBAAuB,IAAI,uBAAuB,CAEjE;AAED,uDAAuD;AACvD,MAAM,MAAM,iBAAiB,GAAG,KAAK,GAAG,IAAI,CAAC;AAE7C;;;;;GAKG;AACH,wBAAgB,iBAAiB,IAAI,iBAAiB,CAErD;AAED,uDAAuD;AACvD,MAAM,MAAM,6BAA6B,GAAG,KAAK,GAAG,IAAI,CAAC;AAEzD;;;GAGG;AACH,wBAAgB,yBAAyB,IAAI,6BAA6B,CAEzE;AAED,uEAAuE;AACvE,eAAO,MAAM,qBAAqB,MAAM,CAAC;AAEzC,mFAAmF;AACnF,eAAO,MAAM,+BAA+B,MAAM,CAAC;AAEnD,gFAAgF;AAChF,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAElD,uEAAuE;AACvE,eAAO,MAAM,oCAAoC,IAAI,CAAC;AAEtD,mDAAmD;AACnD,MAAM,MAAM,wBAAwB,GAAG,KAAK,GAAG,IAAI,CAAC;AAEpD;;;;;;GAMG;AACH,wBAAgB,oBAAoB,IAAI,wBAAwB,CAE/D;AAED,4EAA4E;AAC5E,eAAO,MAAM,4BAA4B,MAAM,CAAC;AAEhD,6EAA6E;AAC7E,eAAO,MAAM,8BAA8B,MAAM,CAAC;AAElD,8EAA8E;AAC9E,eAAO,MAAM,qBAAqB,MAAM,CAAC;AAEzC;;;;;GAKG;AACH,eAAO,MAAM,wBAAwB,MAAM,CAAC;AAE5C,8EAA8E;AAC9E,eAAO,MAAM,sBAAsB,QAAS,CAAC;AAE7C;;;;GAIG;AACH,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAElD,6DAA6D;AAC7D,eAAO,MAAM,iCAAiC,KAAK,CAAC;AAEpD,qEAAqE;AACrE,eAAO,MAAM,2CAA2C,MAAM,CAAC"}

package/dist/opportunity/discriminator/discriminator.env.js

@@ -25,6 +25,13 @@ export function poolQuestionsMiningMode() {
 export function poolQuestionsMode() {
     return process.env.POOL_QUESTIONS_MODE?.trim() === "on" ? "on" : "off";
 }
+/**
+ * Current POOL_QUESTIONS_STAMP_NEWBORN mode (default off). Effective callers
+ * additionally require {@link poolQuestionsMode} to be on.
+ */
+export function poolQuestionsStampNewborn() {
+    return process.env.POOL_QUESTIONS_STAMP_NEWBORN?.trim() === "on" ? "on" : "off";
+}
 /** Minimum VoI for a discriminator to become (or chain) a question. */
 export const POOL_QUESTION_MIN_VOI = 0.2;
 /** Minimum evidence-verification rate for a discriminator to become a question. */

package/dist/opportunity/discriminator/discriminator.env.js.map

@@ -1 +1 @@
-{"version":3,"file":"discriminator.env.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.env.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH,wDAAwD;AACxD,MAAM,UAAU,uBAAuB;IACrC,OAAO,OAAO,CAAC,GAAG,CAAC,qBAAqB,EAAE,IAAI,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;AACnF,CAAC;AAKD;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,GAAG,CAAC,mBAAmB,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AACzE,CAAC;AAED,uEAAuE;AACvE,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAEzC,mFAAmF;AACnF,MAAM,CAAC,MAAM,+BAA+B,GAAG,GAAG,CAAC;AAEnD,gFAAgF;AAChF,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD,uEAAuE;AACvE,MAAM,CAAC,MAAM,oCAAoC,GAAG,CAAC,CAAC;AAKtD;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB;IAClC,OAAO,OAAO,CAAC,GAAG,CAAC,sBAAsB,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AAC5E,CAAC;AAED,4EAA4E;AAC5E,MAAM,CAAC,MAAM,4BAA4B,GAAG,GAAG,CAAC;AAEhD,6EAA6E;AAC7E,MAAM,CAAC,MAAM,8BAA8B,GAAG,GAAG,CAAC;AAElD,8EAA8E;AAC9E,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAEzC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAE5C,8EAA8E;AAC9E,MAAM,CAAC,MAAM,sBAAsB,GAAG,KAAM,CAAC;AAE7C;;;;GAIG;AACH,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD,6DAA6D;AAC7D,MAAM,CAAC,MAAM,iCAAiC,GAAG,EAAE,CAAC;AAEpD,qEAAqE;AACrE,MAAM,CAAC,MAAM,2CAA2C,GAAG,GAAG,CAAC","sourcesContent":["/**\n * Centralized accessors for pool-question environment variables (IND-416).\n *\n *   POOL_QUESTIONS_MINING   off | shadow — P1 shadow axis mining on\n *                           discovery-run completion. `shadow` mines and\n *                           scores axes and logs them; no questions are\n *                           generated and no user-facing behavior changes.\n *                           Any value other than \"shadow\" (including unset)\n *                           means off.\n *\n * All reads go through this module — do not read these variables via\n * `process.env` elsewhere. Values are read on every call (no caching) so\n * tests and long-lived processes observe changes.\n */\n\n/** Mining mode for pool discriminator axes. */\nexport type PoolQuestionsMiningMode = \"off\" | \"shadow\";\n\n/** Current POOL_QUESTIONS_MINING mode (default off). */\nexport function poolQuestionsMiningMode(): PoolQuestionsMiningMode {\n  return process.env.POOL_QUESTIONS_MINING?.trim() === \"shadow\" ? \"shadow\" : \"off\";\n}\n\n/** Question mode for pool discriminators (IND-418). */\nexport type PoolQuestionsMode = \"off\" | \"on\";\n\n/**\n * Current POOL_QUESTIONS_MODE (default off). When \"on\", the mining hook also\n * enqueues a pool_discovery question for the top eligible discriminator\n * (still subject to the QUESTIONER_ENABLED master gate and per-intent budget).\n * \"on\" implies mining runs even when POOL_QUESTIONS_MINING is off.\n */\nexport function poolQuestionsMode(): PoolQuestionsMode {\n  return process.env.POOL_QUESTIONS_MODE?.trim() === \"on\" ? \"on\" : \"off\";\n}\n\n/** Minimum VoI for a discriminator to become (or chain) a question. */\nexport const POOL_QUESTION_MIN_VOI = 0.2;\n\n/** Minimum evidence-verification rate for a discriminator to become a question. */\nexport const POOL_QUESTION_MIN_EVIDENCE_RATE = 0.6;\n\n/** Max eligible discriminators carried per mining pass (asked + alternates). */\nexport const POOL_QUESTION_MAX_DISCRIMINATORS = 3;\n\n/** Unattended budget: max pending questions of ANY mode per intent. */\nexport const POOL_QUESTION_MAX_PENDING_PER_INTENT = 3;\n\n/** Ranking mode for pool adjustments (IND-419). */\nexport type PoolQuestionsRankingMode = \"off\" | \"on\";\n\n/**\n * Current POOL_QUESTIONS_RANKING (default off). When \"on\", the home feed\n * orders by adjusted confidence (confidence × Π poolAdjustments.factor,\n * floor {@link POOL_ADJUSTMENT_FLOOR}). Adjustments are WRITTEN regardless of\n * this flag — it only gates whether ordering reads them, so the apply path\n * can ship first.\n */\nexport function poolQuestionsRanking(): PoolQuestionsRankingMode {\n  return process.env.POOL_QUESTIONS_RANKING?.trim() === \"on\" ? \"on\" : \"off\";\n}\n\n/** Adjustment factor for candidates on the side the user did NOT choose. */\nexport const POOL_ADJUSTMENT_FACTOR_OTHER = 0.6;\n\n/** Adjustment factor for candidates the miner could not assign (unknown). */\nexport const POOL_ADJUSTMENT_FACTOR_UNKNOWN = 0.9;\n\n/** Floor for the cumulative adjustment multiplier — demoted, never hidden. */\nexport const POOL_ADJUSTMENT_FLOOR = 0.3;\n\n/**\n * Staleness guard (IND-419): when more than this fraction of a question's\n * stored assignments point at opportunities that left the pool (expired /\n * rejected / accepted / archived), skip the re-rank — the snapshot no longer\n * describes the live pool.\n */\nexport const POOL_STALENESS_THRESHOLD = 0.3;\n\n/** Debounce window for answer-triggered re-discovery (Tier 1), per intent. */\nexport const POOL_RERUN_DEBOUNCE_MS = 60_000;\n\n/**\n * k-anonymity floor: axes are only mined when the pool has at least this many\n * candidates, so no axis (or later, question option) can be traced back to a\n * specific individual.\n */\nexport const POOL_DISCRIMINATOR_MIN_POOL_SIZE = 5;\n\n/** Max candidates sent to the miner LLM (top-N by score). */\nexport const POOL_DISCRIMINATOR_MAX_CANDIDATES = 24;\n\n/** Max chars of public context per candidate in the miner prompt. */\nexport const POOL_DISCRIMINATOR_MAX_PUBLIC_CONTEXT_CHARS = 400;\n"]}
+{"version":3,"file":"discriminator.env.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.env.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH,wDAAwD;AACxD,MAAM,UAAU,uBAAuB;IACrC,OAAO,OAAO,CAAC,GAAG,CAAC,qBAAqB,EAAE,IAAI,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;AACnF,CAAC;AAKD;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,GAAG,CAAC,mBAAmB,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AACzE,CAAC;AAKD;;;GAGG;AACH,MAAM,UAAU,yBAAyB;IACvC,OAAO,OAAO,CAAC,GAAG,CAAC,4BAA4B,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AAClF,CAAC;AAED,uEAAuE;AACvE,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAEzC,mFAAmF;AACnF,MAAM,CAAC,MAAM,+BAA+B,GAAG,GAAG,CAAC;AAEnD,gFAAgF;AAChF,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD,uEAAuE;AACvE,MAAM,CAAC,MAAM,oCAAoC,GAAG,CAAC,CAAC;AAKtD;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB;IAClC,OAAO,OAAO,CAAC,GAAG,CAAC,sBAAsB,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AAC5E,CAAC;AAED,4EAA4E;AAC5E,MAAM,CAAC,MAAM,4BAA4B,GAAG,GAAG,CAAC;AAEhD,6EAA6E;AAC7E,MAAM,CAAC,MAAM,8BAA8B,GAAG,GAAG,CAAC;AAElD,8EAA8E;AAC9E,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAEzC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAE5C,8EAA8E;AAC9E,MAAM,CAAC,MAAM,sBAAsB,GAAG,KAAM,CAAC;AAE7C;;;;GAIG;AACH,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD,6DAA6D;AAC7D,MAAM,CAAC,MAAM,iCAAiC,GAAG,EAAE,CAAC;AAEpD,qEAAqE;AACrE,MAAM,CAAC,MAAM,2CAA2C,GAAG,GAAG,CAAC","sourcesContent":["/**\n * Centralized accessors for pool-question environment variables (IND-416).\n *\n *   POOL_QUESTIONS_MINING   off | shadow — P1 shadow axis mining on\n *                           discovery-run completion. `shadow` mines and\n *                           scores axes and logs them; no questions are\n *                           generated and no user-facing behavior changes.\n *                           Any value other than \"shadow\" (including unset)\n *                           means off.\n *\n * All reads go through this module — do not read these variables via\n * `process.env` elsewhere. Values are read on every call (no caching) so\n * tests and long-lived processes observe changes.\n */\n\n/** Mining mode for pool discriminator axes. */\nexport type PoolQuestionsMiningMode = \"off\" | \"shadow\";\n\n/** Current POOL_QUESTIONS_MINING mode (default off). */\nexport function poolQuestionsMiningMode(): PoolQuestionsMiningMode {\n  return process.env.POOL_QUESTIONS_MINING?.trim() === \"shadow\" ? \"shadow\" : \"off\";\n}\n\n/** Question mode for pool discriminators (IND-418). */\nexport type PoolQuestionsMode = \"off\" | \"on\";\n\n/**\n * Current POOL_QUESTIONS_MODE (default off). When \"on\", the mining hook also\n * enqueues a pool_discovery question for the top eligible discriminator\n * (still subject to the QUESTIONER_ENABLED master gate and per-intent budget).\n * \"on\" implies mining runs even when POOL_QUESTIONS_MINING is off.\n */\nexport function poolQuestionsMode(): PoolQuestionsMode {\n  return process.env.POOL_QUESTIONS_MODE?.trim() === \"on\" ? \"on\" : \"off\";\n}\n\n/** Newborn-opportunity stamping mode (IND-420 P4b). */\nexport type PoolQuestionsStampNewbornMode = \"off\" | \"on\";\n\n/**\n * Current POOL_QUESTIONS_STAMP_NEWBORN mode (default off). Effective callers\n * additionally require {@link poolQuestionsMode} to be on.\n */\nexport function poolQuestionsStampNewborn(): PoolQuestionsStampNewbornMode {\n  return process.env.POOL_QUESTIONS_STAMP_NEWBORN?.trim() === \"on\" ? \"on\" : \"off\";\n}\n\n/** Minimum VoI for a discriminator to become (or chain) a question. */\nexport const POOL_QUESTION_MIN_VOI = 0.2;\n\n/** Minimum evidence-verification rate for a discriminator to become a question. */\nexport const POOL_QUESTION_MIN_EVIDENCE_RATE = 0.6;\n\n/** Max eligible discriminators carried per mining pass (asked + alternates). */\nexport const POOL_QUESTION_MAX_DISCRIMINATORS = 3;\n\n/** Unattended budget: max pending questions of ANY mode per intent. */\nexport const POOL_QUESTION_MAX_PENDING_PER_INTENT = 3;\n\n/** Ranking mode for pool adjustments (IND-419). */\nexport type PoolQuestionsRankingMode = \"off\" | \"on\";\n\n/**\n * Current POOL_QUESTIONS_RANKING (default off). When \"on\", the home feed\n * orders by adjusted confidence (confidence × Π poolAdjustments.factor,\n * floor {@link POOL_ADJUSTMENT_FLOOR}). Adjustments are WRITTEN regardless of\n * this flag — it only gates whether ordering reads them, so the apply path\n * can ship first.\n */\nexport function poolQuestionsRanking(): PoolQuestionsRankingMode {\n  return process.env.POOL_QUESTIONS_RANKING?.trim() === \"on\" ? \"on\" : \"off\";\n}\n\n/** Adjustment factor for candidates on the side the user did NOT choose. */\nexport const POOL_ADJUSTMENT_FACTOR_OTHER = 0.6;\n\n/** Adjustment factor for candidates the miner could not assign (unknown). */\nexport const POOL_ADJUSTMENT_FACTOR_UNKNOWN = 0.9;\n\n/** Floor for the cumulative adjustment multiplier — demoted, never hidden. */\nexport const POOL_ADJUSTMENT_FLOOR = 0.3;\n\n/**\n * Staleness guard (IND-419): when more than this fraction of a question's\n * stored assignments point at opportunities that left the pool (expired /\n * rejected / accepted / archived), skip the re-rank — the snapshot no longer\n * describes the live pool.\n */\nexport const POOL_STALENESS_THRESHOLD = 0.3;\n\n/** Debounce window for answer-triggered re-discovery (Tier 1), per intent. */\nexport const POOL_RERUN_DEBOUNCE_MS = 60_000;\n\n/**\n * k-anonymity floor: axes are only mined when the pool has at least this many\n * candidates, so no axis (or later, question option) can be traced back to a\n * specific individual.\n */\nexport const POOL_DISCRIMINATOR_MIN_POOL_SIZE = 5;\n\n/** Max candidates sent to the miner LLM (top-N by score). */\nexport const POOL_DISCRIMINATOR_MAX_CANDIDATES = 24;\n\n/** Max chars of public context per candidate in the miner prompt. */\nexport const POOL_DISCRIMINATOR_MAX_PUBLIC_CONTEXT_CHARS = 400;\n"]}

package/dist/opportunity/discriminator/discriminator.miner.d.ts

@@ -67,6 +67,20 @@ export interface PoolDiscriminatorMinerConfig {
     /** Optional model config override (API key / base URL / model). */
     modelConfig?: Parameters<typeof createStructuredModel>[3];
 }
+/**
+ * Collapse whitespace, lowercase, and fold typographic punctuation to ASCII
+ * (curly quotes/apostrophes, en/em dashes, ellipsis), so evidence matching
+ * tolerates formatting drift without weakening the verbatim requirement.
+ */
+export declare function normalizePoolEvidenceForMatch(s: string): string;
+/**
+ * Strips wrapping quotes and edge punctuation from an evidence span before
+ * matching. LLMs habitually sentence-ize copied spans (append a trailing
+ * period, wrap in quotes); the meaningful content must still match verbatim.
+ */
+export declare function stripPoolEvidenceEdgePunctuation(s: string): string;
+/** Evidence verifier shared by mining and newborn assignment. */
+export declare function poolEvidenceMatches(publicContext: string, evidence: string | null): boolean;
 /**
  * Stateless axis-mining agent. One `mine()` call = one structured LLM pass +
  * deterministic evidence verification.

package/dist/opportunity/discriminator/discriminator.miner.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"discriminator.miner.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.miner.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAI3E,OAAO,KAAK,EAAE,kBAAkB,EAAE,wBAAwB,EAAsB,MAAM,0BAA0B,CAAC;AAOjH,QAAA,MAAM,wBAAwB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAoC5B,CAAC;AAEH,KAAK,kBAAkB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,wBAAwB,CAAC,CAAC;AAkBnE,sDAAsD;AACtD,MAAM,WAAW,4BAA4B;IAC3C,mEAAmE;IACnE,WAAW,CAAC,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3D;AA2BD;;;GAGG;AACH,qBAAa,sBAAsB;IACjC,OAAO,CAAC,KAAK,CAA+D;gBAEhE,MAAM,CAAC,EAAE,4BAA4B;IASjD;;;;;OAKG;IAEG,IAAI,CACR,KAAK,EAAE,wBAAwB,EAC/B,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAA;KAAE,GACjC,OAAO,CAAC,kBAAkB,EAAE,CAAC;CAcjC;AAED,gFAAgF;AAChF,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,wBAAwB,GAAG,MAAM,CAQzE;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CACxB,IAAI,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,EACxC,UAAU,EAAE,wBAAwB,CAAC,YAAY,CAAC,GACjD,kBAAkB,CAuCpB"}
+{"version":3,"file":"discriminator.miner.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.miner.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAI3E,OAAO,KAAK,EAAE,kBAAkB,EAAE,wBAAwB,EAAsB,MAAM,0BAA0B,CAAC;AAOjH,QAAA,MAAM,wBAAwB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAoC5B,CAAC;AAEH,KAAK,kBAAkB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,wBAAwB,CAAC,CAAC;AAkBnE,sDAAsD;AACtD,MAAM,WAAW,4BAA4B;IAC3C,mEAAmE;IACnE,WAAW,CAAC,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3D;AAED;;;;GAIG;AACH,wBAAgB,6BAA6B,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAS/D;AAED;;;;GAIG;AACH,wBAAgB,gCAAgC,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAElE;AAKD,iEAAiE;AACjE,wBAAgB,mBAAmB,CAAC,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,GAAG,OAAO,CAK3F;AAED;;;GAGG;AACH,qBAAa,sBAAsB;IACjC,OAAO,CAAC,KAAK,CAA+D;gBAEhE,MAAM,CAAC,EAAE,4BAA4B;IASjD;;;;;OAKG;IAEG,IAAI,CACR,KAAK,EAAE,wBAAwB,EAC/B,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAA;KAAE,GACjC,OAAO,CAAC,kBAAkB,EAAE,CAAC;CAcjC;AAED,gFAAgF;AAChF,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,wBAAwB,GAAG,MAAM,CAQzE;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CACxB,IAAI,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,EACxC,UAAU,EAAE,wBAAwB,CAAC,YAAY,CAAC,GACjD,kBAAkB,CAsCpB"}

package/dist/opportunity/discriminator/discriminator.miner.js

@@ -82,7 +82,7 @@ Prefer axes that split the pool close to evenly and that cover many candidates w
  * (curly quotes/apostrophes, en/em dashes, ellipsis), so evidence matching
  * tolerates formatting drift without weakening the verbatim requirement.
  */
-function normalizeForMatch(s) {
+export function normalizePoolEvidenceForMatch(s) {
     return s
         .toLowerCase()
         .replace(/[\u2018\u2019\u02bc]/g, "'")
@@ -97,9 +97,19 @@ function normalizeForMatch(s) {
  * matching. LLMs habitually sentence-ize copied spans (append a trailing
  * period, wrap in quotes); the meaningful content must still match verbatim.
  */
-function stripEdgePunctuation(s) {
+export function stripPoolEvidenceEdgePunctuation(s) {
     return s.replace(/^[\s"'.,;:!?()\u2018\u2019\u201c\u201d]+/, "").replace(/[\s"'.,;:!?()\u2018\u2019\u201c\u201d]+$/, "");
 }
+/** Minimum normalized span that counts as meaningful verbatim evidence. */
+const MIN_POOL_EVIDENCE_CHARS = 8;
+/** Evidence verifier shared by mining and newborn assignment. */
+export function poolEvidenceMatches(publicContext, evidence) {
+    if (evidence === null)
+        return false;
+    const context = normalizePoolEvidenceForMatch(publicContext);
+    const evidenceCore = normalizePoolEvidenceForMatch(stripPoolEvidenceEdgePunctuation(evidence));
+    return evidenceCore.length >= MIN_POOL_EVIDENCE_CHARS && context.includes(evidenceCore);
+}
 /**
  * Stateless axis-mining agent. One `mine()` call = one structured LLM pass +
  * deterministic evidence verification.
@@ -150,7 +160,7 @@ export function buildMiningPrompt(input) {
  * - computes evidenceRate = verified / side-proposals.
  */
 export function verifyAxis(axis, candidates) {
-    const contextById = new Map(candidates.map((c) => [c.id, normalizeForMatch(c.publicContext)]));
+    const contextById = new Map(candidates.map((c) => [c.id, c.publicContext]));
     const byId = new Map();
     let proposed = 0;
     let verified = 0;
@@ -166,8 +176,7 @@ export function verifyAxis(axis, candidates) {
         }
         proposed++;
         const sideOk = axis.sides.includes(a.side);
-        const evidenceCore = a.evidence === null ? "" : normalizeForMatch(stripEdgePunctuation(a.evidence));
-        const evidenceOk = evidenceCore.length > 0 && context.includes(evidenceCore);
+        const evidenceOk = poolEvidenceMatches(context, a.evidence);
         if (sideOk && evidenceOk) {
             verified++;
             byId.set(a.id, { id: a.id, side: a.side, evidence: a.evidence, verified: true });

package/dist/opportunity/discriminator/discriminator.miner.js.map

@@ -1 +1 @@
-{"version":3,"file":"discriminator.miner.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.miner.ts"],"names":[],"mappings":";;;;;;;;;AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,cAAc,EAAE,MAAM,+CAA+C,CAAC;AAC/E,OAAO,EAAE,KAAK,EAAE,MAAM,2CAA2C,CAAC;AAGlE,MAAM,MAAM,GAAG,cAAc,CAAC,wBAAwB,CAAC,CAAC;AAExD,qEAAqE;AACrE,MAAM,QAAQ,GAAG,CAAC,CAAC;AAEnB,MAAM,wBAAwB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,IAAI,EAAE,CAAC;SACJ,KAAK,CACJ,CAAC,CAAC,MAAM,CAAC;QACP,IAAI,EAAE,CAAC;aACJ,MAAM,EAAE;aACR,QAAQ,CAAC,iFAAiF,CAAC;QAC9F,YAAY,EAAE,CAAC;aACZ,MAAM,EAAE;aACR,QAAQ,CAAC,sEAAsE,CAAC;QACnF,KAAK,EAAE,CAAC;aACL,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;aACjB,GAAG,CAAC,CAAC,CAAC;aACN,GAAG,CAAC,CAAC,CAAC;aACN,QAAQ,CAAC,qDAAqD,CAAC;QAClE,WAAW,EAAE,CAAC;aACX,KAAK,CACJ,CAAC,CAAC,MAAM,CAAC;YACP,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+BAA+B,CAAC;YACxD,IAAI,EAAE,CAAC;iBACJ,MAAM,EAAE;iBACR,QAAQ,EAAE;iBACV,QAAQ,CAAC,0EAA0E,CAAC;YACvF,QAAQ,EAAE,CAAC;iBACR,MAAM,EAAE;iBACR,GAAG,CAAC,GAAG,CAAC;iBACR,QAAQ,EAAE;iBACV,QAAQ,CACP,gHAAgH,CACjH;SACJ,CAAC,CACH;aACA,QAAQ,CAAC,yBAAyB,CAAC;KACvC,CAAC,CACH;SACA,GAAG,CAAC,QAAQ,CAAC;CACjB,CAAC,CAAC;AAIH,MAAM,aAAa,GAAG;;;;;;;;;;;;;;2HAcqG,QAAQ,+CAA+C,CAAC;AAQnL;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,CAAS;IAClC,OAAO,CAAC;SACL,WAAW,EAAE;SACb,OAAO,CAAC,uBAAuB,EAAE,GAAG,CAAC;SACrC,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;SAC/B,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;SAC/B,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC;SACzB,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,CAAS;IACrC,OAAO,CAAC,CAAC,OAAO,CAAC,0CAA0C,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,0CAA0C,EAAE,EAAE,CAAC,CAAC;AAC3H,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,sBAAsB;IAGjC,YAAY,MAAqC;QAC/C,IAAI,CAAC,KAAK,GAAG,qBAAqB,CAChC,wBAAwB,EACxB,wBAAwB,EACxB,EAAE,IAAI,EAAE,WAAW,EAAE,EACrB,MAAM,EAAE,WAAW,CACpB,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IAEG,AAAN,KAAK,CAAC,IAAI,CACR,KAA+B,EAC/B,OAAkC;QAElC,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,MAAM,qBAAqB,CACrC,IAAI,CAAC,KAAK,EACV,CAAC,IAAI,aAAa,CAAC,aAAa,CAAC,EAAE,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,EAC5D,OAAO,EAAE,MAAM,CAChB,CAAC;QACF,MAAM,MAAM,GAAG,wBAAwB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACvD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,0CAA0C,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YAChG,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IAC/F,CAAC;CACF;AAjBO;IADL,KAAK,EAAE;;;;kDAiBP;AAGH,gFAAgF;AAChF,MAAM,UAAU,iBAAiB,CAAC,KAA+B;IAC/D,MAAM,eAAe,GAAG,KAAK,CAAC,UAAU;SACrC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,aAAa,EAAE,CAAC;SAC3C,IAAI,CAAC,MAAM,CAAC,CAAC;IAChB,OAAO;QACL,YAAY,KAAK,CAAC,UAAU,EAAE;QAC9B,mBAAmB,KAAK,CAAC,UAAU,CAAC,MAAM,oCAAoC,eAAe,EAAE;KAChG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CACxB,IAAwC,EACxC,UAAkD;IAElD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,MAAM,IAAI,GAAG,IAAI,GAAG,EAA8B,CAAC;IACnD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,OAAO,KAAK,SAAS;YAAE,SAAS,CAAC,4BAA4B;QACjE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,sBAAsB;QACpD,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;YAC1E,SAAS;QACX,CAAC;QACD,QAAQ,EAAE,CAAC;QACX,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,YAAY,GAAG,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACpG,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAC7E,IAAI,MAAM,IAAI,UAAU,EAAE,CAAC;YACzB,QAAQ,EAAE,CAAC;YACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QACnF,CAAC;aAAM,CAAC;YACN,2EAA2E;YAC3E,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QAClF,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,MAAM,WAAW,GAAyB,UAAU,CAAC,GAAG,CACtD,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CACnF,CAAC;IAEF,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,IAAI;QAChB,YAAY,EAAE,IAAI,CAAC,YAAY;QAC/B,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,WAAW;QACX,YAAY,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;KACrD,CAAC;AACJ,CAAC","sourcesContent":["/**\n * PoolDiscriminatorMiner — one structured LLM pass that proposes discriminating axes\n * over a discovery-run candidate pool, with code-side evidence verification\n * (IND-417).\n *\n * Anti-hallucination contract: every side assignment must quote a short\n * evidence span from that candidate's supplied publicContext. Verification is\n * done in code (substring match, case/whitespace-insensitive), NOT trusted\n * from the prompt. Failed verifications are demoted to `unknown`, which\n * lowers coverage → lowers VoI → buries the axis. The failure mode\n * self-punishes.\n *\n * Follows the QuestionerAgent pattern: constructor binds the structured\n * model once; single public `mine()` per call.\n */\nimport { HumanMessage, SystemMessage } from \"@langchain/core/messages\";\nimport { z } from \"zod\";\n\nimport { createStructuredModel } from \"../../shared/agent/model.config.js\";\nimport { invokeWithAbortSignal } from \"../../shared/agent/model-signal.js\";\nimport { protocolLogger } from \"../../shared/observability/protocol.logger.js\";\nimport { Timed } from \"../../shared/observability/performance.js\";\nimport type { MinedDiscriminator, DiscriminatorMiningInput, VerifiedAssignment } from \"./discriminator.types.js\";\n\nconst logger = protocolLogger(\"PoolDiscriminatorMiner\");\n\n/** Max axes requested from (and accepted out of) one mining pass. */\nconst MAX_AXES = 6;\n\nconst AxisMiningResponseSchema = z.object({\n  axes: z\n    .array(\n      z.object({\n        axis: z\n          .string()\n          .describe(\"Short discriminating-axis label, e.g. 'Hands-on builders vs strategic advisors'\"),\n        questionSeed: z\n          .string()\n          .describe(\"A direct question the intent owner could answer to resolve this axis\"),\n        sides: z\n          .array(z.string())\n          .min(2)\n          .max(3)\n          .describe(\"2-3 mutually exclusive side labels (2-5 words each)\"),\n        assignments: z\n          .array(\n            z.object({\n              id: z.string().describe(\"Candidate id exactly as given\"),\n              side: z\n                .string()\n                .nullable()\n                .describe(\"One of this axis's side labels, or null when the context is insufficient\"),\n              evidence: z\n                .string()\n                .max(200)\n                .nullable()\n                .describe(\n                  \"VERBATIM span (≤80 chars) copied from this candidate's context that justifies the side. null when side is null\",\n                ),\n            }),\n          )\n          .describe(\"One entry per candidate\"),\n      }),\n    )\n    .max(MAX_AXES),\n});\n\ntype AxisMiningResponse = z.infer<typeof AxisMiningResponseSchema>;\n\nconst SYSTEM_PROMPT = `You analyze a pool of candidate matches for one user intent and propose the preference axes that best SPLIT the pool into meaningfully different groups.\n\nRules for every axis:\n- Sides must be mutually exclusive readings of one dimension (a candidate belongs to at most one side).\n- The axis must NOT already be determined by the intent text itself — only propose axes the intent leaves genuinely open.\n- The axis must be phrased as a preference the intent OWNER could hold and answer (the questionSeed asks them directly).\n- Side labels are terse (2-5 words), concrete, and derived from patterns across MULTIPLE candidates — never from a single person and never naming anyone.\n- BANNED axis families: protected attributes (race, ethnicity, religion, gender, age, nationality, disability, politics, sexual orientation), and vanity/noise splits (profile completeness, bio length, has photo, name alphabet).\n\nRules for assignments:\n- Assign EVERY candidate: pick a side only when the candidate's context contains clear support; otherwise use side null.\n- When you pick a side you MUST quote a short (≤80 chars) VERBATIM substring of that candidate's context as evidence. Copy it exactly — it is checked mechanically, and paraphrased evidence is discarded. Do NOT add punctuation that is not in the source (no trailing period); cutting off mid-sentence is fine.\n- Never invent context. If unsure, use side null with evidence null.\n\nPrefer axes that split the pool close to evenly and that cover many candidates with verifiable evidence. Propose at most ${MAX_AXES} axes; fewer strong axes beat many weak ones.`;\n\n/** Config for PoolDiscriminatorMiner construction. */\nexport interface PoolDiscriminatorMinerConfig {\n  /** Optional model config override (API key / base URL / model). */\n  modelConfig?: Parameters<typeof createStructuredModel>[3];\n}\n\n/**\n * Collapse whitespace, lowercase, and fold typographic punctuation to ASCII\n * (curly quotes/apostrophes, en/em dashes, ellipsis), so evidence matching\n * tolerates formatting drift without weakening the verbatim requirement.\n */\nfunction normalizeForMatch(s: string): string {\n  return s\n    .toLowerCase()\n    .replace(/[\\u2018\\u2019\\u02bc]/g, \"'\")\n    .replace(/[\\u201c\\u201d]/g, '\"')\n    .replace(/[\\u2013\\u2014]/g, \"-\")\n    .replace(/\\u2026/g, \"...\")\n    .replace(/\\s+/g, \" \")\n    .trim();\n}\n\n/**\n * Strips wrapping quotes and edge punctuation from an evidence span before\n * matching. LLMs habitually sentence-ize copied spans (append a trailing\n * period, wrap in quotes); the meaningful content must still match verbatim.\n */\nfunction stripEdgePunctuation(s: string): string {\n  return s.replace(/^[\\s\"'.,;:!?()\\u2018\\u2019\\u201c\\u201d]+/, \"\").replace(/[\\s\"'.,;:!?()\\u2018\\u2019\\u201c\\u201d]+$/, \"\");\n}\n\n/**\n * Stateless axis-mining agent. One `mine()` call = one structured LLM pass +\n * deterministic evidence verification.\n */\nexport class PoolDiscriminatorMiner {\n  private model: ReturnType<typeof createStructuredModel<AxisMiningResponse>>;\n\n  constructor(config?: PoolDiscriminatorMinerConfig) {\n    this.model = createStructuredModel<AxisMiningResponse>(\n      \"poolDiscriminatorMiner\",\n      AxisMiningResponseSchema,\n      { name: \"pool_axes\" },\n      config?.modelConfig,\n    );\n  }\n\n  /**\n   * Mine discriminating axes for one pool.\n   *\n   * @returns Verified axes (may be empty). Throws on LLM failure — callers\n   *   run this fire-and-forget and must catch.\n   */\n  @Timed()\n  async mine(\n    input: DiscriminatorMiningInput,\n    options?: { signal?: AbortSignal },\n  ): Promise<MinedDiscriminator[]> {\n    const prompt = buildMiningPrompt(input);\n    const raw = await invokeWithAbortSignal(\n      this.model,\n      [new SystemMessage(SYSTEM_PROMPT), new HumanMessage(prompt)],\n      options?.signal,\n    );\n    const parsed = AxisMiningResponseSchema.safeParse(raw);\n    if (!parsed.success) {\n      logger.warn(\"Mining response failed schema validation\", { issues: parsed.error.issues.length });\n      return [];\n    }\n    return parsed.data.axes.slice(0, MAX_AXES).map((axis) => verifyAxis(axis, input.candidates));\n  }\n}\n\n/** Builds the human message: intent text + one numbered block per candidate. */\nexport function buildMiningPrompt(input: DiscriminatorMiningInput): string {\n  const candidateBlocks = input.candidates\n    .map((c) => `[${c.id}]\\n${c.publicContext}`)\n    .join(\"\\n\\n\");\n  return [\n    `Intent:\\n${input.intentText}`,\n    `Candidate pool (${input.candidates.length} candidates, id in brackets):\\n\\n${candidateBlocks}`,\n  ].join(\"\\n\\n\");\n}\n\n/**\n * Deterministic post-pass over one LLM axis:\n * - drops assignments for ids not in the pool,\n * - demotes to unknown: sides not in the axis's side list, missing evidence,\n *   and evidence that does not substring-match the candidate's publicContext,\n * - guarantees exactly one assignment per pool candidate (missing → unknown),\n * - computes evidenceRate = verified / side-proposals.\n */\nexport function verifyAxis(\n  axis: AxisMiningResponse[\"axes\"][number],\n  candidates: DiscriminatorMiningInput[\"candidates\"],\n): MinedDiscriminator {\n  const contextById = new Map(candidates.map((c) => [c.id, normalizeForMatch(c.publicContext)]));\n  const byId = new Map<string, VerifiedAssignment>();\n  let proposed = 0;\n  let verified = 0;\n\n  for (const a of axis.assignments) {\n    const context = contextById.get(a.id);\n    if (context === undefined) continue; // hallucinated candidate id\n    if (byId.has(a.id)) continue; // first proposal wins\n    if (a.side === null) {\n      byId.set(a.id, { id: a.id, side: null, evidence: null, verified: false });\n      continue;\n    }\n    proposed++;\n    const sideOk = axis.sides.includes(a.side);\n    const evidenceCore = a.evidence === null ? \"\" : normalizeForMatch(stripEdgePunctuation(a.evidence));\n    const evidenceOk = evidenceCore.length > 0 && context.includes(evidenceCore);\n    if (sideOk && evidenceOk) {\n      verified++;\n      byId.set(a.id, { id: a.id, side: a.side, evidence: a.evidence, verified: true });\n    } else {\n      // Demoted: keep the (failed) evidence for audit logging, but unknown side.\n      byId.set(a.id, { id: a.id, side: null, evidence: a.evidence, verified: false });\n    }\n  }\n\n  // Every pool candidate gets exactly one assignment.\n  const assignments: VerifiedAssignment[] = candidates.map(\n    (c) => byId.get(c.id) ?? { id: c.id, side: null, evidence: null, verified: false },\n  );\n\n  return {\n    label: axis.axis,\n    questionSeed: axis.questionSeed,\n    sides: axis.sides,\n    assignments,\n    evidenceRate: proposed > 0 ? verified / proposed : 0,\n  };\n}\n"]}
+{"version":3,"file":"discriminator.miner.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.miner.ts"],"names":[],"mappings":";;;;;;;;;AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,cAAc,EAAE,MAAM,+CAA+C,CAAC;AAC/E,OAAO,EAAE,KAAK,EAAE,MAAM,2CAA2C,CAAC;AAGlE,MAAM,MAAM,GAAG,cAAc,CAAC,wBAAwB,CAAC,CAAC;AAExD,qEAAqE;AACrE,MAAM,QAAQ,GAAG,CAAC,CAAC;AAEnB,MAAM,wBAAwB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,IAAI,EAAE,CAAC;SACJ,KAAK,CACJ,CAAC,CAAC,MAAM,CAAC;QACP,IAAI,EAAE,CAAC;aACJ,MAAM,EAAE;aACR,QAAQ,CAAC,iFAAiF,CAAC;QAC9F,YAAY,EAAE,CAAC;aACZ,MAAM,EAAE;aACR,QAAQ,CAAC,sEAAsE,CAAC;QACnF,KAAK,EAAE,CAAC;aACL,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;aACjB,GAAG,CAAC,CAAC,CAAC;aACN,GAAG,CAAC,CAAC,CAAC;aACN,QAAQ,CAAC,qDAAqD,CAAC;QAClE,WAAW,EAAE,CAAC;aACX,KAAK,CACJ,CAAC,CAAC,MAAM,CAAC;YACP,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+BAA+B,CAAC;YACxD,IAAI,EAAE,CAAC;iBACJ,MAAM,EAAE;iBACR,QAAQ,EAAE;iBACV,QAAQ,CAAC,0EAA0E,CAAC;YACvF,QAAQ,EAAE,CAAC;iBACR,MAAM,EAAE;iBACR,GAAG,CAAC,GAAG,CAAC;iBACR,QAAQ,EAAE;iBACV,QAAQ,CACP,gHAAgH,CACjH;SACJ,CAAC,CACH;aACA,QAAQ,CAAC,yBAAyB,CAAC;KACvC,CAAC,CACH;SACA,GAAG,CAAC,QAAQ,CAAC;CACjB,CAAC,CAAC;AAIH,MAAM,aAAa,GAAG;;;;;;;;;;;;;;2HAcqG,QAAQ,+CAA+C,CAAC;AAQnL;;;;GAIG;AACH,MAAM,UAAU,6BAA6B,CAAC,CAAS;IACrD,OAAO,CAAC;SACL,WAAW,EAAE;SACb,OAAO,CAAC,uBAAuB,EAAE,GAAG,CAAC;SACrC,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;SAC/B,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;SAC/B,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC;SACzB,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gCAAgC,CAAC,CAAS;IACxD,OAAO,CAAC,CAAC,OAAO,CAAC,0CAA0C,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,0CAA0C,EAAE,EAAE,CAAC,CAAC;AAC3H,CAAC;AAED,2EAA2E;AAC3E,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAElC,iEAAiE;AACjE,MAAM,UAAU,mBAAmB,CAAC,aAAqB,EAAE,QAAuB;IAChF,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,MAAM,OAAO,GAAG,6BAA6B,CAAC,aAAa,CAAC,CAAC;IAC7D,MAAM,YAAY,GAAG,6BAA6B,CAAC,gCAAgC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC/F,OAAO,YAAY,CAAC,MAAM,IAAI,uBAAuB,IAAI,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC1F,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,sBAAsB;IAGjC,YAAY,MAAqC;QAC/C,IAAI,CAAC,KAAK,GAAG,qBAAqB,CAChC,wBAAwB,EACxB,wBAAwB,EACxB,EAAE,IAAI,EAAE,WAAW,EAAE,EACrB,MAAM,EAAE,WAAW,CACpB,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IAEG,AAAN,KAAK,CAAC,IAAI,CACR,KAA+B,EAC/B,OAAkC;QAElC,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,MAAM,qBAAqB,CACrC,IAAI,CAAC,KAAK,EACV,CAAC,IAAI,aAAa,CAAC,aAAa,CAAC,EAAE,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,EAC5D,OAAO,EAAE,MAAM,CAChB,CAAC;QACF,MAAM,MAAM,GAAG,wBAAwB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACvD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,0CAA0C,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YAChG,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IAC/F,CAAC;CACF;AAjBO;IADL,KAAK,EAAE;;;;kDAiBP;AAGH,gFAAgF;AAChF,MAAM,UAAU,iBAAiB,CAAC,KAA+B;IAC/D,MAAM,eAAe,GAAG,KAAK,CAAC,UAAU;SACrC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,aAAa,EAAE,CAAC;SAC3C,IAAI,CAAC,MAAM,CAAC,CAAC;IAChB,OAAO;QACL,YAAY,KAAK,CAAC,UAAU,EAAE;QAC9B,mBAAmB,KAAK,CAAC,UAAU,CAAC,MAAM,oCAAoC,eAAe,EAAE;KAChG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CACxB,IAAwC,EACxC,UAAkD;IAElD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,IAAI,GAAG,IAAI,GAAG,EAA8B,CAAC;IACnD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,OAAO,KAAK,SAAS;YAAE,SAAS,CAAC,4BAA4B;QACjE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,sBAAsB;QACpD,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;YAC1E,SAAS;QACX,CAAC;QACD,QAAQ,EAAE,CAAC;QACX,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,mBAAmB,CAAC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,MAAM,IAAI,UAAU,EAAE,CAAC;YACzB,QAAQ,EAAE,CAAC;YACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QACnF,CAAC;aAAM,CAAC;YACN,2EAA2E;YAC3E,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QAClF,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,MAAM,WAAW,GAAyB,UAAU,CAAC,GAAG,CACtD,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CACnF,CAAC;IAEF,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,IAAI;QAChB,YAAY,EAAE,IAAI,CAAC,YAAY;QAC/B,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,WAAW;QACX,YAAY,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;KACrD,CAAC;AACJ,CAAC","sourcesContent":["/**\n * PoolDiscriminatorMiner — one structured LLM pass that proposes discriminating axes\n * over a discovery-run candidate pool, with code-side evidence verification\n * (IND-417).\n *\n * Anti-hallucination contract: every side assignment must quote a short\n * evidence span from that candidate's supplied publicContext. Verification is\n * done in code (substring match, case/whitespace-insensitive), NOT trusted\n * from the prompt. Failed verifications are demoted to `unknown`, which\n * lowers coverage → lowers VoI → buries the axis. The failure mode\n * self-punishes.\n *\n * Follows the QuestionerAgent pattern: constructor binds the structured\n * model once; single public `mine()` per call.\n */\nimport { HumanMessage, SystemMessage } from \"@langchain/core/messages\";\nimport { z } from \"zod\";\n\nimport { createStructuredModel } from \"../../shared/agent/model.config.js\";\nimport { invokeWithAbortSignal } from \"../../shared/agent/model-signal.js\";\nimport { protocolLogger } from \"../../shared/observability/protocol.logger.js\";\nimport { Timed } from \"../../shared/observability/performance.js\";\nimport type { MinedDiscriminator, DiscriminatorMiningInput, VerifiedAssignment } from \"./discriminator.types.js\";\n\nconst logger = protocolLogger(\"PoolDiscriminatorMiner\");\n\n/** Max axes requested from (and accepted out of) one mining pass. */\nconst MAX_AXES = 6;\n\nconst AxisMiningResponseSchema = z.object({\n  axes: z\n    .array(\n      z.object({\n        axis: z\n          .string()\n          .describe(\"Short discriminating-axis label, e.g. 'Hands-on builders vs strategic advisors'\"),\n        questionSeed: z\n          .string()\n          .describe(\"A direct question the intent owner could answer to resolve this axis\"),\n        sides: z\n          .array(z.string())\n          .min(2)\n          .max(3)\n          .describe(\"2-3 mutually exclusive side labels (2-5 words each)\"),\n        assignments: z\n          .array(\n            z.object({\n              id: z.string().describe(\"Candidate id exactly as given\"),\n              side: z\n                .string()\n                .nullable()\n                .describe(\"One of this axis's side labels, or null when the context is insufficient\"),\n              evidence: z\n                .string()\n                .max(200)\n                .nullable()\n                .describe(\n                  \"VERBATIM span (≤80 chars) copied from this candidate's context that justifies the side. null when side is null\",\n                ),\n            }),\n          )\n          .describe(\"One entry per candidate\"),\n      }),\n    )\n    .max(MAX_AXES),\n});\n\ntype AxisMiningResponse = z.infer<typeof AxisMiningResponseSchema>;\n\nconst SYSTEM_PROMPT = `You analyze a pool of candidate matches for one user intent and propose the preference axes that best SPLIT the pool into meaningfully different groups.\n\nRules for every axis:\n- Sides must be mutually exclusive readings of one dimension (a candidate belongs to at most one side).\n- The axis must NOT already be determined by the intent text itself — only propose axes the intent leaves genuinely open.\n- The axis must be phrased as a preference the intent OWNER could hold and answer (the questionSeed asks them directly).\n- Side labels are terse (2-5 words), concrete, and derived from patterns across MULTIPLE candidates — never from a single person and never naming anyone.\n- BANNED axis families: protected attributes (race, ethnicity, religion, gender, age, nationality, disability, politics, sexual orientation), and vanity/noise splits (profile completeness, bio length, has photo, name alphabet).\n\nRules for assignments:\n- Assign EVERY candidate: pick a side only when the candidate's context contains clear support; otherwise use side null.\n- When you pick a side you MUST quote a short (≤80 chars) VERBATIM substring of that candidate's context as evidence. Copy it exactly — it is checked mechanically, and paraphrased evidence is discarded. Do NOT add punctuation that is not in the source (no trailing period); cutting off mid-sentence is fine.\n- Never invent context. If unsure, use side null with evidence null.\n\nPrefer axes that split the pool close to evenly and that cover many candidates with verifiable evidence. Propose at most ${MAX_AXES} axes; fewer strong axes beat many weak ones.`;\n\n/** Config for PoolDiscriminatorMiner construction. */\nexport interface PoolDiscriminatorMinerConfig {\n  /** Optional model config override (API key / base URL / model). */\n  modelConfig?: Parameters<typeof createStructuredModel>[3];\n}\n\n/**\n * Collapse whitespace, lowercase, and fold typographic punctuation to ASCII\n * (curly quotes/apostrophes, en/em dashes, ellipsis), so evidence matching\n * tolerates formatting drift without weakening the verbatim requirement.\n */\nexport function normalizePoolEvidenceForMatch(s: string): string {\n  return s\n    .toLowerCase()\n    .replace(/[\\u2018\\u2019\\u02bc]/g, \"'\")\n    .replace(/[\\u201c\\u201d]/g, '\"')\n    .replace(/[\\u2013\\u2014]/g, \"-\")\n    .replace(/\\u2026/g, \"...\")\n    .replace(/\\s+/g, \" \")\n    .trim();\n}\n\n/**\n * Strips wrapping quotes and edge punctuation from an evidence span before\n * matching. LLMs habitually sentence-ize copied spans (append a trailing\n * period, wrap in quotes); the meaningful content must still match verbatim.\n */\nexport function stripPoolEvidenceEdgePunctuation(s: string): string {\n  return s.replace(/^[\\s\"'.,;:!?()\\u2018\\u2019\\u201c\\u201d]+/, \"\").replace(/[\\s\"'.,;:!?()\\u2018\\u2019\\u201c\\u201d]+$/, \"\");\n}\n\n/** Minimum normalized span that counts as meaningful verbatim evidence. */\nconst MIN_POOL_EVIDENCE_CHARS = 8;\n\n/** Evidence verifier shared by mining and newborn assignment. */\nexport function poolEvidenceMatches(publicContext: string, evidence: string | null): boolean {\n  if (evidence === null) return false;\n  const context = normalizePoolEvidenceForMatch(publicContext);\n  const evidenceCore = normalizePoolEvidenceForMatch(stripPoolEvidenceEdgePunctuation(evidence));\n  return evidenceCore.length >= MIN_POOL_EVIDENCE_CHARS && context.includes(evidenceCore);\n}\n\n/**\n * Stateless axis-mining agent. One `mine()` call = one structured LLM pass +\n * deterministic evidence verification.\n */\nexport class PoolDiscriminatorMiner {\n  private model: ReturnType<typeof createStructuredModel<AxisMiningResponse>>;\n\n  constructor(config?: PoolDiscriminatorMinerConfig) {\n    this.model = createStructuredModel<AxisMiningResponse>(\n      \"poolDiscriminatorMiner\",\n      AxisMiningResponseSchema,\n      { name: \"pool_axes\" },\n      config?.modelConfig,\n    );\n  }\n\n  /**\n   * Mine discriminating axes for one pool.\n   *\n   * @returns Verified axes (may be empty). Throws on LLM failure — callers\n   *   run this fire-and-forget and must catch.\n   */\n  @Timed()\n  async mine(\n    input: DiscriminatorMiningInput,\n    options?: { signal?: AbortSignal },\n  ): Promise<MinedDiscriminator[]> {\n    const prompt = buildMiningPrompt(input);\n    const raw = await invokeWithAbortSignal(\n      this.model,\n      [new SystemMessage(SYSTEM_PROMPT), new HumanMessage(prompt)],\n      options?.signal,\n    );\n    const parsed = AxisMiningResponseSchema.safeParse(raw);\n    if (!parsed.success) {\n      logger.warn(\"Mining response failed schema validation\", { issues: parsed.error.issues.length });\n      return [];\n    }\n    return parsed.data.axes.slice(0, MAX_AXES).map((axis) => verifyAxis(axis, input.candidates));\n  }\n}\n\n/** Builds the human message: intent text + one numbered block per candidate. */\nexport function buildMiningPrompt(input: DiscriminatorMiningInput): string {\n  const candidateBlocks = input.candidates\n    .map((c) => `[${c.id}]\\n${c.publicContext}`)\n    .join(\"\\n\\n\");\n  return [\n    `Intent:\\n${input.intentText}`,\n    `Candidate pool (${input.candidates.length} candidates, id in brackets):\\n\\n${candidateBlocks}`,\n  ].join(\"\\n\\n\");\n}\n\n/**\n * Deterministic post-pass over one LLM axis:\n * - drops assignments for ids not in the pool,\n * - demotes to unknown: sides not in the axis's side list, missing evidence,\n *   and evidence that does not substring-match the candidate's publicContext,\n * - guarantees exactly one assignment per pool candidate (missing → unknown),\n * - computes evidenceRate = verified / side-proposals.\n */\nexport function verifyAxis(\n  axis: AxisMiningResponse[\"axes\"][number],\n  candidates: DiscriminatorMiningInput[\"candidates\"],\n): MinedDiscriminator {\n  const contextById = new Map(candidates.map((c) => [c.id, c.publicContext]));\n  const byId = new Map<string, VerifiedAssignment>();\n  let proposed = 0;\n  let verified = 0;\n\n  for (const a of axis.assignments) {\n    const context = contextById.get(a.id);\n    if (context === undefined) continue; // hallucinated candidate id\n    if (byId.has(a.id)) continue; // first proposal wins\n    if (a.side === null) {\n      byId.set(a.id, { id: a.id, side: null, evidence: null, verified: false });\n      continue;\n    }\n    proposed++;\n    const sideOk = axis.sides.includes(a.side);\n    const evidenceOk = poolEvidenceMatches(context, a.evidence);\n    if (sideOk && evidenceOk) {\n      verified++;\n      byId.set(a.id, { id: a.id, side: a.side, evidence: a.evidence, verified: true });\n    } else {\n      // Demoted: keep the (failed) evidence for audit logging, but unknown side.\n      byId.set(a.id, { id: a.id, side: null, evidence: a.evidence, verified: false });\n    }\n  }\n\n  // Every pool candidate gets exactly one assignment.\n  const assignments: VerifiedAssignment[] = candidates.map(\n    (c) => byId.get(c.id) ?? { id: c.id, side: null, evidence: null, verified: false },\n  );\n\n  return {\n    label: axis.axis,\n    questionSeed: axis.questionSeed,\n    sides: axis.sides,\n    assignments,\n    evidenceRate: proposed > 0 ? verified / proposed : 0,\n  };\n}\n"]}

package/dist/opportunity/opportunity.graph.d.ts

@@ -41,7 +41,7 @@ export type OpportunityEvaluatorLike = {
     }>>;
 };
 import type { Embedder } from '../shared/interfaces/embedder.interface.js';
-import type { Opportunity } from '../shared/interfaces/database.interface.js';
+import type { CreateOpportunityData, Opportunity } from '../shared/interfaces/database.interface.js';
 import type { NegotiationGraphLike } from "../negotiation/negotiation.state.js";
 import type { AgentDispatcher } from "../shared/interfaces/agent-dispatcher.interface.js";
 /** Input shape for the HyDE graph invoke call (query-based embedding). */
@@ -53,6 +53,17 @@ export interface HydeGeneratorInvokeInput {
 }
 /** Optional notifier for opportunity send; when omitted, the real queue is used via dynamic import. */
 export type QueueOpportunityNotificationFn = (opportunityId: string, recipientId: string, priority: 'immediate' | 'high' | 'low') => Promise<unknown>;
+/** Input for the host-side newborn pool-preference stamper (IND-420 P4b). */
+export interface StampNewbornOpportunitiesInput {
+    ownerUserId: string;
+    intentId: string;
+    items: CreateOpportunityData[];
+}
+/**
+ * Optional host callback that stamps call-local create items before INSERT.
+ * It must preserve array length/order and may only enrich metadata/signals.
+ */
+export type StampNewbornOpportunitiesFn = (input: StampNewbornOpportunitiesInput) => Promise<CreateOpportunityData[]>;
 /**
  * Builds a compact text summary of the discoverer's profile and active intents
  * for use as profileContext in HyDE generation.
@@ -84,6 +95,8 @@ export declare class OpportunityGraphFactory {
      * negotiations after introducer approval.
      */
     private queueNegotiateExisting?;
+    /** Host-side P4b stamper. Omitted by manual/introducer/enrichment roots. */
+    private stampNewbornOpportunities?;
     constructor(database: OpportunityGraphDatabase, embedder: Embedder, hydeGenerator: {
         invoke: (input: HydeGeneratorInvokeInput) => Promise<{
             hydeEmbeddings: Record<string, number[]>;
@@ -108,7 +121,9 @@ export declare class OpportunityGraphFactory {
      * When provided, negotiate_existing mode uses this to queue follow-up
      * negotiations after introducer approval.
      */
-    queueNegotiateExisting?: ((opportunityId: string, userId: string) => Promise<void>) | undefined);
+    queueNegotiateExisting?: ((opportunityId: string, userId: string) => Promise<void>) | undefined, 
+    /** Host-side P4b stamper. Omitted by manual/introducer/enrichment roots. */
+    stampNewbornOpportunities?: StampNewbornOpportunitiesFn | undefined);
     createGraph(): import("@langchain/langgraph").CompiledStateGraph<{
         userId: Id<"users">;
         searchQuery: string | undefined;

package/dist/opportunity/opportunity.graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"opportunity.graph.d.ts","sourceRoot":"/","sources":["opportunity/opportunity.graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,4CAA4C,CAAC;AACrE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAyB,KAAK,aAAa,EAAE,KAAK,iBAAiB,EAAE,KAAK,aAAa,EAAE,KAAK,cAAc,EAAE,KAAK,kBAAkB,EAAE,KAAK,oBAAoB,EAAE,KAAK,yBAAyB,EAAE,MAAM,wBAAwB,CAAC;AAExO,OAAO,EAAwB,KAAK,gBAAgB,EAAuC,KAAK,eAAe,EAAE,KAAK,cAAc,EAAE,MAAM,4BAA4B,CAAC;AACzK,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,4CAA4C,CAAC;AAM3F,yDAAyD;AACzD,MAAM,MAAM,wBAAwB,GAAG;IACrC,MAAM,CAAC,EAAE,CACP,oBAAoB,EAAE,MAAM,EAC5B,UAAU,EAAE,gBAAgB,EAAE,EAC9B,OAAO,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,KAC3B,OAAO,CAAC,KAAK,CAAC;QACjB,QAAQ,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;QACpB,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,MAAM,CAAC;QAClB,WAAW,EAAE,OAAO,GAAG,SAAS,GAAG,MAAM,CAAC;KAC3C,CAAC,CAAC,CAAC;IACJ,kBAAkB,CAAC,EAAE,CAAC,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,KAAK,OAAO,CAAC,KAAK,CAAC;QAC5F,SAAS,EAAE,MAAM,CAAC;QAClB,KAAK,EAAE,MAAM,CAAC;QACd,MAAM,EAAE,KAAK,CAAC;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,OAAO,GAAG,SAAS,GAAG,MAAM,CAAC;YAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;YAAC,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;SAAE,CAAC,CAAC;KAC9H,CAAC,CAAC,CAAC;CACL,CAAC;AACF,OAAO,KAAK,EAAE,QAAQ,EAAiB,MAAM,4CAA4C,CAAC;AAC1F,OAAO,KAAK,EAAyB,WAAW,EAAkC,MAAM,4CAA4C,CAAC;AAMrI,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,qCAAqC,CAAC;AAChF,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oDAAoD,CAAC;AAqD1F,0EAA0E;AAC1E,MAAM,WAAW,wBAAwB;IACvC,UAAU,EAAE,OAAO,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,uGAAuG;AACvG,MAAM,MAAM,8BAA8B,GAAG,CAC3C,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,EACnB,QAAQ,EAAE,WAAW,GAAG,MAAM,GAAG,KAAK,KACnC,OAAO,CAAC,OAAO,CAAC,CAAC;AAEtB;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,iBAAiB,GAAG,IAAI,GAAG,SAAS,EAC7C,OAAO,EAAE,aAAa,EAAE,GAAG,SAAS,GACnC,MAAM,GAAG,SAAS,CA4BpB;AA6BD;;;GAGG;AACH,qBAAa,uBAAuB;IAEhC,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,aAAa;IAOrB,OAAO,CAAC,iBAAiB,CAAC;IAC1B,OAAO,CAAC,iBAAiB,CAAC;IAC1B,OAAO,CAAC,gBAAgB,CAAC;IACzB;;;;OAIG;IACH,OAAO,CAAC,eAAe,CAAC;IACxB;;;;OAIG;IACH,OAAO,CAAC,sBAAsB,CAAC;gBAvBvB,QAAQ,EAAE,wBAAwB,EAClC,QAAQ,EAAE,QAAQ,EAClB,aAAa,EAAE;QACrB,MAAM,EAAE,CAAC,KAAK,EAAE,wBAAwB,KAAK,OAAO,CAAC;YACnD,cAAc,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,EAAE,KAAK,CAAC;gBAAE,KAAK,EAAE,MAAM,CAAC;gBAAC,MAAM,EAAE,UAAU,GAAG,SAAS,GAAG,UAAU,CAAA;aAAE,CAAC,CAAC;YAC/E,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE;gBAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;gBAAC,IAAI,CAAC,EAAE,MAAM,CAAA;aAAE,CAAC,CAAC;SACtE,CAAC,CAAC;KACJ,EACO,iBAAiB,CAAC,EAAE,wBAAwB,YAAA,EAC5C,iBAAiB,CAAC,EAAE,8BAA8B,YAAA,EAClD,gBAAgB,CAAC,EAAE,oBAAoB,YAAA;IAC/C;;;;OAIG;IACK,eAAe,CAAC,EAAE,IAAI,CAAC,eAAe,EAAE,kBAAkB,CAAC,YAAA;IACnE;;;;OAIG;IACK,sBAAsB,CAAC,GAAE,CAAC,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,aAAA;IAGpF,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;0BA+DgB,EAAE,CAAC,UAAU,CAAC,EAAE;;;;;;;;;;;;;;;;;;;2BA0BC,EAAE,CAAC,UAAU,CAAC;2BAAa,MAAM,EAAE;;;;2BAW9C,EAAE,CAAC,UAAU,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;sBAkcR,MAAM;yBAAW,MAAM;uBAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;;;;;4BA8b5D,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;;;;;4BAoJrB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;;;sBAzF1B,MAAM;yBAAW,MAAM;uBAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;sBAiSvD,MAAM;yBAAW,MAAM;uBAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAopElG"}
+{"version":3,"file":"opportunity.graph.d.ts","sourceRoot":"/","sources":["opportunity/opportunity.graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,4CAA4C,CAAC;AACrE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAyB,KAAK,aAAa,EAAE,KAAK,iBAAiB,EAAE,KAAK,aAAa,EAAE,KAAK,cAAc,EAAE,KAAK,kBAAkB,EAAE,KAAK,oBAAoB,EAAE,KAAK,yBAAyB,EAAE,MAAM,wBAAwB,CAAC;AAExO,OAAO,EAAwB,KAAK,gBAAgB,EAAuC,KAAK,eAAe,EAAE,KAAK,cAAc,EAAE,MAAM,4BAA4B,CAAC;AACzK,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,4CAA4C,CAAC;AAM3F,yDAAyD;AACzD,MAAM,MAAM,wBAAwB,GAAG;IACrC,MAAM,CAAC,EAAE,CACP,oBAAoB,EAAE,MAAM,EAC5B,UAAU,EAAE,gBAAgB,EAAE,EAC9B,OAAO,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,KAC3B,OAAO,CAAC,KAAK,CAAC;QACjB,QAAQ,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;QACpB,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,MAAM,CAAC;QAClB,WAAW,EAAE,OAAO,GAAG,SAAS,GAAG,MAAM,CAAC;KAC3C,CAAC,CAAC,CAAC;IACJ,kBAAkB,CAAC,EAAE,CAAC,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,KAAK,OAAO,CAAC,KAAK,CAAC;QAC5F,SAAS,EAAE,MAAM,CAAC;QAClB,KAAK,EAAE,MAAM,CAAC;QACd,MAAM,EAAE,KAAK,CAAC;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,OAAO,GAAG,SAAS,GAAG,MAAM,CAAC;YAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;YAAC,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;SAAE,CAAC,CAAC;KAC9H,CAAC,CAAC,CAAC;CACL,CAAC;AACF,OAAO,KAAK,EAAE,QAAQ,EAAiB,MAAM,4CAA4C,CAAC;AAC1F,OAAO,KAAK,EAAE,qBAAqB,EAAE,WAAW,EAAkC,MAAM,4CAA4C,CAAC;AAMrI,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,qCAAqC,CAAC;AAChF,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oDAAoD,CAAC;AAqD1F,0EAA0E;AAC1E,MAAM,WAAW,wBAAwB;IACvC,UAAU,EAAE,OAAO,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,uGAAuG;AACvG,MAAM,MAAM,8BAA8B,GAAG,CAC3C,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,EACnB,QAAQ,EAAE,WAAW,GAAG,MAAM,GAAG,KAAK,KACnC,OAAO,CAAC,OAAO,CAAC,CAAC;AAEtB,6EAA6E;AAC7E,MAAM,WAAW,8BAA8B;IAC7C,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,qBAAqB,EAAE,CAAC;CAChC;AAED;;;GAGG;AACH,MAAM,MAAM,2BAA2B,GAAG,CACxC,KAAK,EAAE,8BAA8B,KAClC,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAC;AAiCtC;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,iBAAiB,GAAG,IAAI,GAAG,SAAS,EAC7C,OAAO,EAAE,aAAa,EAAE,GAAG,SAAS,GACnC,MAAM,GAAG,SAAS,CA4BpB;AA6BD;;;GAGG;AACH,qBAAa,uBAAuB;IAEhC,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,aAAa;IAOrB,OAAO,CAAC,iBAAiB,CAAC;IAC1B,OAAO,CAAC,iBAAiB,CAAC;IAC1B,OAAO,CAAC,gBAAgB,CAAC;IACzB;;;;OAIG;IACH,OAAO,CAAC,eAAe,CAAC;IACxB;;;;OAIG;IACH,OAAO,CAAC,sBAAsB,CAAC;IAC/B,4EAA4E;IAC5E,OAAO,CAAC,yBAAyB,CAAC;gBAzB1B,QAAQ,EAAE,wBAAwB,EAClC,QAAQ,EAAE,QAAQ,EAClB,aAAa,EAAE;QACrB,MAAM,EAAE,CAAC,KAAK,EAAE,wBAAwB,KAAK,OAAO,CAAC;YACnD,cAAc,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,EAAE,KAAK,CAAC;gBAAE,KAAK,EAAE,MAAM,CAAC;gBAAC,MAAM,EAAE,UAAU,GAAG,SAAS,GAAG,UAAU,CAAA;aAAE,CAAC,CAAC;YAC/E,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE;gBAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;gBAAC,IAAI,CAAC,EAAE,MAAM,CAAA;aAAE,CAAC,CAAC;SACtE,CAAC,CAAC;KACJ,EACO,iBAAiB,CAAC,EAAE,wBAAwB,YAAA,EAC5C,iBAAiB,CAAC,EAAE,8BAA8B,YAAA,EAClD,gBAAgB,CAAC,EAAE,oBAAoB,YAAA;IAC/C;;;;OAIG;IACK,eAAe,CAAC,EAAE,IAAI,CAAC,eAAe,EAAE,kBAAkB,CAAC,YAAA;IACnE;;;;OAIG;IACK,sBAAsB,CAAC,GAAE,CAAC,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,aAAA;IACzF,4EAA4E;IACpE,yBAAyB,CAAC,EAAE,2BAA2B,YAAA;IAG1D,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;0BA+DgB,EAAE,CAAC,UAAU,CAAC,EAAE;;;;;;;;;;;;;;;;;;;2BA0BC,EAAE,CAAC,UAAU,CAAC;2BAAa,MAAM,EAAE;;;;2BAW9C,EAAE,CAAC,UAAU,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;sBAkcR,MAAM;yBAAW,MAAM;uBAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;;;;;4BA8b5D,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;;;;;4BAoJrB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;;;sBAzF1B,MAAM;yBAAW,MAAM;uBAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;sBAiSvD,MAAM;yBAAW,MAAM;uBAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAysElG"}

package/dist/opportunity/opportunity.graph.js

@@ -69,6 +69,35 @@ function buildEvaluatorEvidenceKey(candidate) {
         candidate.candidateIntentId ?? candidate.candidatePremiseId ?? candidate.sourceContextId ?? 'profile',
     ].join(':');
 }
+function copyCreateOpportunityData(item) {
+    return {
+        ...item,
+        detection: { ...item.detection },
+        actors: item.actors.map((actor) => ({ ...actor })),
+        interpretation: {
+            ...item.interpretation,
+            signals: item.interpretation.signals?.map((signal) => ({ ...signal })),
+        },
+        context: { ...item.context },
+        metadata: item.metadata ? { ...item.metadata } : item.metadata,
+    };
+}
+/** Fields a stamper is not allowed to change; also protects candidate order. */
+function newbornItemIdentity(item) {
+    return JSON.stringify({
+        detection: item.detection,
+        actors: item.actors,
+        interpretation: {
+            category: item.interpretation.category,
+            reasoning: item.interpretation.reasoning,
+            confidence: item.interpretation.confidence,
+        },
+        context: item.context,
+        confidence: item.confidence,
+        status: item.status,
+        expiresAt: item.expiresAt?.toISOString(),
+    });
+}
 /**
  * Builds a compact text summary of the discoverer's profile and active intents
  * for use as profileContext in HyDE generation.
@@ -144,7 +173,9 @@ export class OpportunityGraphFactory {
      * When provided, negotiate_existing mode uses this to queue follow-up
      * negotiations after introducer approval.
      */
-    queueNegotiateExisting) {
+    queueNegotiateExisting, 
+    /** Host-side P4b stamper. Omitted by manual/introducer/enrichment roots. */
+    stampNewbornOpportunities) {
         this.database = database;
         this.embedder = embedder;
         this.hydeGenerator = hydeGenerator;
@@ -153,6 +184,7 @@ export class OpportunityGraphFactory {
         this.negotiationGraph = negotiationGraph;
         this.agentDispatcher = agentDispatcher;
         this.queueNegotiateExisting = queueNegotiateExisting;
+        this.stampNewbornOpportunities = stampNewbornOpportunities;
     }
     createGraph() {
         const evaluatorAgent = this.optionalEvaluator ?? new OpportunityEvaluator();
@@ -2754,10 +2786,61 @@ export class OpportunityGraphFactory {
                         }
                         itemsToPersist.push(data);
                     }
+                    // P4b seam: only genuinely new, create-mode, owned-intent discovery
+                    // items reach the host stamper. Dedup reactivations/upgrades have
+                    // already continued above; introductions, on-behalf-of, context-only,
+                    // manual, and continuation flows are excluded explicitly.
+                    let itemsForPersistence = itemsToPersist;
+                    const stampIntentId = state.resolvedTriggerIntentId;
+                    const mayStamp = Boolean(this.stampNewbornOpportunities
+                        && state.operationMode === 'create'
+                        && !state.introductionContext
+                        && !state.onBehalfOfUserId
+                        && !state.targetUserId
+                        && state.discoverySource === 'intent'
+                        && stampIntentId
+                        && state.indexedIntents.some((intent) => intent.intentId === stampIntentId));
+                    if (mayStamp && stampIntentId && itemsToPersist.length > 0) {
+                        const eligibleIndexes = itemsToPersist.flatMap((item, index) => item.detection.source === 'opportunity_graph' && item.detection.triggeredBy === stampIntentId
+                            ? [index]
+                            : []);
+                        if (eligibleIndexes.length > 0) {
+                            const originals = eligibleIndexes.map((index) => itemsToPersist[index]);
+                            const callbackItems = originals.map(copyCreateOpportunityData);
+                            try {
+                                const stamped = await this.stampNewbornOpportunities({
+                                    ownerUserId: state.userId,
+                                    intentId: stampIntentId,
+                                    items: callbackItems,
+                                });
+                                const valid = Array.isArray(stamped)
+                                    && stamped.length === originals.length
+                                    && stamped.every((item, index) => newbornItemIdentity(item) === newbornItemIdentity(originals[index]));
+                                if (valid) {
+                                    itemsForPersistence = [...itemsToPersist];
+                                    eligibleIndexes.forEach((itemIndex, stampedIndex) => {
+                                        itemsForPersistence[itemIndex] = stamped[stampedIndex];
+                                    });
+                                }
+                                else {
+                                    persistLog.warn('Newborn stamper returned unsafe length/order; persisting originals', {
+                                        expected: originals.length,
+                                        actual: Array.isArray(stamped) ? stamped.length : null,
+                                    });
+                                }
+                            }
+                            catch (error) {
+                                persistLog.warn('Newborn stamper failed; persisting originals', {
+                                    intentId: stampIntentId,
+                                    error: error instanceof Error ? error.message : String(error),
+                                });
+                            }
+                        }
+                    }
                     const { created: createdList } = await persistOpportunities({
                         database: this.database,
                         embedder: this.embedder,
-                        items: itemsToPersist,
+                        items: itemsForPersistence,
                     });
                     const allOpportunities = [...reactivatedOpportunities, ...createdList];
                     persistLog.verbose('Persistence complete', {