@mohan-cao/jev-classify 0.1.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,68 @@
+# @mohan-cao/jev-classify
+
+The classification signal, extracted from `@mohan-cao/jev-classifier`: one Jev
+call answering *what kind of response does the current request need*, plus the
+response policy that follows from it.
+
+```bash
+npm install @mohan-cao/jev-classify
+```
+
+```ts
+import { classifyWithJev, policyFor, premisePolicyFor } from "@mohan-cao/jev-classify";
+
+const result = await classifyWithJev(prompt, apiKey, config, signal, history);
+// { mode: "decomposition_required", confidence: 0.86, signals: { ... } }
+```
+
+| mode | policy |
+| --- | --- |
+| `decomposition_required` | decompose before concluding; name the controlling dependencies |
+| `bounded_verification` | verdict-plus-corrections, at most three claims |
+| `normal` | none — the residual |
+
+## Design notes
+
+**Two Noul questions and a Score, not one Choice.** A single 3-way Choice makes
+`normal` a competing argmax candidate, and a decomposition-shaped request where
+`normal` scored 0.40 and `decomposition_required` scored 0.35 got routed to
+`normal`. Two orthogonal Noul signals composed in code keep `normal` as the
+residual and give decomposition explicit precedence. The thresholds are
+asymmetric — a higher bar for bounded verification than for decomposition —
+because the failure modes are asymmetric.
+
+**`normal` is a residual, not a category.** It means "neither of the two
+questions cleared", which is why `policyFor("normal")` returns `undefined` and
+no policy section is injected at all.
+
+**Premise correction is a modifier, not a mode.** `premisePolicyFor` applies on
+top of a mode, and deliberately never for `bounded_verification`, which already
+emits verdicts and corrections — applying it there would duplicate them.
+
+## Caveats
+
+- **The thresholds are tuned against a synthetic eval set, not real usage.**
+  `0.6` for both gates came from eight hand-written cases. Real conversations
+  will cover cases those eight do not, so treat the gates as provisional until
+  they have been measured against logged decisions.
+- **History inflates the decomposition score.** Including prior turns measurably
+  raises it, which is why the question is worded to judge the *current request
+  only*. If that wording is ever loosened, the threshold has to move with it.
+- **The classification cache is not here.** Caching is a host concern — this
+  package makes a call when asked and holds no state.
+
+## API
+
+| export | purpose |
+| --- | --- |
+| `classifyWithJev(prompt, apiKey, config, signal?, history?)` | one Jev call → `ClassificationResult` |
+| `parseClassificationResponse(payload, config)` | pure: Jev answers → result |
+| `composeMode(signals, config)` | pure: signals → mode |
+| `buildState(prompt, history)` | pure: the Jev `state` payload |
+| `policyFor(mode)`, `premisePolicyFor(mode, defect, threshold)` | the prompt sections |
+| `DECOMPOSITION_QUESTION`, `BOUNDED_VERIFICATION_QUESTION`, `PREMISE_DEFECT_QUESTION` | question specs |
+| `ClassifyConfig` | transport settings plus the three thresholds and `historyTurns` |
+
+## License
+
+Apache-2.0.

package/dist/index.d.ts

@@ -0,0 +1,27 @@
+/**
+ * The classification signal.
+ *
+ * One Jev call answering what kind of response the current request needs, plus
+ * the response policy that follows from it. This is the component that decides
+ * whether a policy section is injected at all, so it is also the one whose
+ * thresholds matter most — and they are still tuned against a synthetic eval
+ * set rather than real usage. See the README.
+ */
+import { type HistoryTurn, type JevSystemOneResponse } from "@mohan-cao/jev-classifier";
+import { BOUNDED_VERIFICATION_QUESTION, DECOMPOSITION_QUESTION, PREMISE_DEFECT_QUESTION } from "./questions.js";
+import type { ClassificationResult, ClassificationState, ClassifyConfig, ResponseMode } from "./types.js";
+export { BOUNDED_VERIFICATION_QUESTION, DECOMPOSITION_QUESTION, PREMISE_DEFECT_QUESTION };
+export { policyFor, premisePolicyFor } from "./policies.js";
+export { RESPONSE_MODES } from "./types.js";
+export type { ClassificationResult, ClassificationSignals, ClassificationState, ClassifyConfig, ResponseMode, } from "./types.js";
+/**
+ * The Jev `state`. History is included so follow-ups are classifiable, but the
+ * decomposition question is worded to judge the current request only — measured
+ * history inflation is why (see the eval harness).
+ */
+export declare function buildState(prompt: string, history: HistoryTurn[]): ClassificationState;
+/** Decomposition takes precedence; `normal` is the residual, never a competitor. */
+export declare function composeMode(signals: ClassificationResult["signals"], config: Pick<ClassifyConfig, "decompositionThreshold" | "boundedVerificationThreshold">): ResponseMode;
+export declare function parseClassificationResponse(payload: JevSystemOneResponse, config: Pick<ClassifyConfig, "decompositionThreshold" | "boundedVerificationThreshold">): ClassificationResult;
+export declare function classifyWithJev(prompt: string, apiKey: string, config: ClassifyConfig, parentSignal?: AbortSignal, history?: HistoryTurn[]): Promise<ClassificationResult>;
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAKL,KAAK,WAAW,EAChB,KAAK,oBAAoB,EAG1B,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EACL,6BAA6B,EAC7B,sBAAsB,EACtB,uBAAuB,EACxB,MAAM,gBAAgB,CAAC;AACxB,OAAO,KAAK,EACV,oBAAoB,EACpB,mBAAmB,EACnB,cAAc,EACd,YAAY,EACb,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,6BAA6B,EAAE,sBAAsB,EAAE,uBAAuB,EAAE,CAAC;AAC1F,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5C,YAAY,EACV,oBAAoB,EACpB,qBAAqB,EACrB,mBAAmB,EACnB,cAAc,EACd,YAAY,GACb,MAAM,YAAY,CAAC;AAMpB;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAMtF;AAED,oFAAoF;AACpF,wBAAgB,WAAW,CACzB,OAAO,EAAE,oBAAoB,CAAC,SAAS,CAAC,EACxC,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,wBAAwB,GAAG,8BAA8B,CAAC,GACtF,YAAY,CAMd;AAED,wBAAgB,2BAA2B,CACzC,OAAO,EAAE,oBAAoB,EAC7B,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,wBAAwB,GAAG,8BAA8B,CAAC,GACtF,oBAAoB,CAyBtB;AAED,wBAAsB,eAAe,CACnC,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,cAAc,EACtB,YAAY,CAAC,EAAE,WAAW,EAC1B,OAAO,GAAE,WAAW,EAAO,GAC1B,OAAO,CAAC,oBAAoB,CAAC,CAc/B"}

package/dist/index.js

@@ -0,0 +1,71 @@
+/**
+ * The classification signal.
+ *
+ * One Jev call answering what kind of response the current request needs, plus
+ * the response policy that follows from it. This is the component that decides
+ * whether a policy section is injected at all, so it is also the one whose
+ * thresholds matter most — and they are still tuned against a synthetic eval
+ * set rather than real usage. See the README.
+ */
+import { callSystemOne, clamp01, parseNoulAnswer, parseScoreAnswer, } from "@mohan-cao/jev-classifier";
+import { BOUNDED_VERIFICATION_QUESTION, DECOMPOSITION_QUESTION, PREMISE_DEFECT_QUESTION, } from "./questions.js";
+export { BOUNDED_VERIFICATION_QUESTION, DECOMPOSITION_QUESTION, PREMISE_DEFECT_QUESTION };
+export { policyFor, premisePolicyFor } from "./policies.js";
+export { RESPONSE_MODES } from "./types.js";
+const DECOMPOSITION_ID = "requires_decomposition";
+const BOUNDED_ID = "bounded_verification";
+const PREMISE_ID = "premise_defect";
+/**
+ * The Jev `state`. History is included so follow-ups are classifiable, but the
+ * decomposition question is worded to judge the current request only — measured
+ * history inflation is why (see the eval harness).
+ */
+export function buildState(prompt, history) {
+    if (history.length === 0)
+        return { user_request: prompt };
+    return {
+        recent_conversation: history.map((turn) => `${turn.role}: ${turn.text}`),
+        user_request: prompt,
+    };
+}
+/** Decomposition takes precedence; `normal` is the residual, never a competitor. */
+export function composeMode(signals, config) {
+    if (signals.decomposition >= config.decompositionThreshold)
+        return "decomposition_required";
+    if (signals.boundedVerification >= config.boundedVerificationThreshold) {
+        return "bounded_verification";
+    }
+    return "normal";
+}
+export function parseClassificationResponse(payload, config) {
+    const signals = {
+        decomposition: parseNoulAnswer(payload, DECOMPOSITION_ID),
+        boundedVerification: parseNoulAnswer(payload, BOUNDED_ID),
+        premiseDefect: parseScoreAnswer(payload, PREMISE_ID).score,
+    };
+    const mode = composeMode(signals, config);
+    const probabilities = {
+        bounded_verification: signals.boundedVerification,
+        decomposition_required: signals.decomposition,
+        normal: clamp01(1 - Math.max(signals.decomposition, signals.boundedVerification)),
+    };
+    // The confidence of a decision is the probability of the mode it picked, which
+    // `probabilities` already holds — no need to re-derive it from the signals.
+    const confidence = probabilities[mode];
+    return {
+        mode,
+        confidence,
+        probabilities,
+        signals,
+        ...(payload.model ? { model: payload.model } : {}),
+    };
+}
+export async function classifyWithJev(prompt, apiKey, config, parentSignal, history = []) {
+    const payload = await callSystemOne(buildState(prompt, history), {
+        [DECOMPOSITION_ID]: DECOMPOSITION_QUESTION,
+        [BOUNDED_ID]: BOUNDED_VERIFICATION_QUESTION,
+        [PREMISE_ID]: PREMISE_DEFECT_QUESTION,
+    }, apiKey, config, parentSignal);
+    return parseClassificationResponse(payload, config);
+}
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EACL,aAAa,EACb,OAAO,EACP,eAAe,EACf,gBAAgB,GAKjB,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EACL,6BAA6B,EAC7B,sBAAsB,EACtB,uBAAuB,GACxB,MAAM,gBAAgB,CAAC;AAQxB,OAAO,EAAE,6BAA6B,EAAE,sBAAsB,EAAE,uBAAuB,EAAE,CAAC;AAC1F,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAS5C,MAAM,gBAAgB,GAAG,wBAAwB,CAAC;AAClD,MAAM,UAAU,GAAG,sBAAsB,CAAC;AAC1C,MAAM,UAAU,GAAG,gBAAgB,CAAC;AAEpC;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,MAAc,EAAE,OAAsB;IAC/D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC;IAC1D,OAAO;QACL,mBAAmB,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;QACxE,YAAY,EAAE,MAAM;KACrB,CAAC;AACJ,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,WAAW,CACzB,OAAwC,EACxC,MAAuF;IAEvF,IAAI,OAAO,CAAC,aAAa,IAAI,MAAM,CAAC,sBAAsB;QAAE,OAAO,wBAAwB,CAAC;IAC5F,IAAI,OAAO,CAAC,mBAAmB,IAAI,MAAM,CAAC,4BAA4B,EAAE,CAAC;QACvE,OAAO,sBAAsB,CAAC;IAChC,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,2BAA2B,CACzC,OAA6B,EAC7B,MAAuF;IAEvF,MAAM,OAAO,GAAG;QACd,aAAa,EAAE,eAAe,CAAC,OAAO,EAAE,gBAAgB,CAAC;QACzD,mBAAmB,EAAE,eAAe,CAAC,OAAO,EAAE,UAAU,CAAC;QACzD,aAAa,EAAE,gBAAgB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,KAAK;KAC3D,CAAC;IAEF,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC1C,MAAM,aAAa,GAAiC;QAClD,oBAAoB,EAAE,OAAO,CAAC,mBAAmB;QACjD,sBAAsB,EAAE,OAAO,CAAC,aAAa;QAC7C,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,mBAAmB,CAAC,CAAC;KAClF,CAAC;IAEF,+EAA+E;IAC/E,4EAA4E;IAC5E,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAEvC,OAAO;QACL,IAAI;QACJ,UAAU;QACV,aAAa;QACb,OAAO;QACP,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACnD,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,MAAc,EACd,MAAc,EACd,MAAsB,EACtB,YAA0B,EAC1B,UAAyB,EAAE;IAE3B,MAAM,OAAO,GAAG,MAAM,aAAa,CACjC,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,EAC3B;QACE,CAAC,gBAAgB,CAAC,EAAE,sBAAiD;QACrE,CAAC,UAAU,CAAC,EAAE,6BAAwD;QACtE,CAAC,UAAU,CAAC,EAAE,uBAAmD;KAClE,EACD,MAAM,EACN,MAAM,EACN,YAAY,CACb,CAAC;IAEF,OAAO,2BAA2B,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;AACtD,CAAC"}

package/dist/policies.d.ts

@@ -0,0 +1,8 @@
+import type { ResponseMode } from "./types.js";
+export declare function policyFor(mode: ResponseMode): string | undefined;
+/**
+ * The corrective modifier. Bounded verification already emits a verdict and
+ * corrections, so applying this there would only duplicate them.
+ */
+export declare function premisePolicyFor(mode: ResponseMode, premiseDefect: number, threshold: number): string | undefined;
+//# sourceMappingURL=policies.d.ts.map

package/dist/policies.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"policies.d.ts","sourceRoot":"","sources":["../src/policies.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAgD/C,wBAAgB,SAAS,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,GAAG,SAAS,CAEhE;AAQD;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,YAAY,EAClB,aAAa,EAAE,MAAM,EACrB,SAAS,EAAE,MAAM,GAChB,MAAM,GAAG,SAAS,CAGpB"}

package/dist/policies.js

@@ -0,0 +1,60 @@
+/**
+ * Policy bodies are injected as a named system-prompt section (see
+ * `POLICY_SECTION` in the extension), so Pi wraps them in a
+ * `<jev-response-policy>` tag. Do not re-add the wrapper here.
+ */
+const BOUNDED_VERIFICATION_POLICY = `
+The current user request was classified as a bounded verification task.
+Evaluate no more than three independently evaluable claims/questions.
+
+For each claim:
+- begin with exactly one of: Correct, Partially correct, or Incorrect;
+- briefly explain why;
+- list only the corrections or qualifications needed to make it accurate.
+
+Do not manufacture an "it depends" discussion when qualifications do not
+materially change the truth value. If an unexpected dependency genuinely makes
+a direct verdict misleading, state that dependency precisely rather than
+hedging vaguely.
+`.trim();
+const DECOMPOSITION_POLICY = `
+The current user request was classified as requiring decomposition before a
+reliable conclusion.
+
+Do not force a binary verdict first. Identify the material assumptions,
+definitions, conditions, or tradeoffs that control the answer. Break the issue
+into the minimum useful subquestions, answer those subquestions, then
+synthesize the result.
+
+Avoid vague "it depends" hedging: name the dependencies explicitly and explain
+how changing them changes the conclusion.
+`.trim();
+/**
+ * A `Record` rather than a `switch`, so a new `ResponseMode` becomes a compile
+ * error here instead of a silent `undefined` — which would mean no policy
+ * injected, with nothing to notice it. Same idiom as `PROGRESS_VALUE` and
+ * `PHASE_GLYPH`.
+ */
+const POLICY_BY_MODE = {
+    bounded_verification: BOUNDED_VERIFICATION_POLICY,
+    decomposition_required: DECOMPOSITION_POLICY,
+    normal: undefined,
+};
+export function policyFor(mode) {
+    return POLICY_BY_MODE[mode];
+}
+const PREMISE_POLICY = `
+The current user request may rest on a false or materially misleading premise.
+If it does, state the correction in one sentence before answering. Do not
+lecture, and do not restate the correction.
+`.trim();
+/**
+ * The corrective modifier. Bounded verification already emits a verdict and
+ * corrections, so applying this there would only duplicate them.
+ */
+export function premisePolicyFor(mode, premiseDefect, threshold) {
+    if (mode === "bounded_verification")
+        return undefined;
+    return premiseDefect >= threshold ? PREMISE_POLICY : undefined;
+}
+//# sourceMappingURL=policies.js.map

package/dist/policies.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"policies.js","sourceRoot":"","sources":["../src/policies.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,MAAM,2BAA2B,GAAG;;;;;;;;;;;;;CAanC,CAAC,IAAI,EAAE,CAAC;AAET,MAAM,oBAAoB,GAAG;;;;;;;;;;;CAW5B,CAAC,IAAI,EAAE,CAAC;AAET;;;;;GAKG;AACH,MAAM,cAAc,GAAG;IACrB,oBAAoB,EAAE,2BAA2B;IACjD,sBAAsB,EAAE,oBAAoB;IAC5C,MAAM,EAAE,SAAS;CACiC,CAAC;AAErD,MAAM,UAAU,SAAS,CAAC,IAAkB;IAC1C,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC;AAC9B,CAAC;AAED,MAAM,cAAc,GAAG;;;;CAItB,CAAC,IAAI,EAAE,CAAC;AAET;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,IAAkB,EAClB,aAAqB,EACrB,SAAiB;IAEjB,IAAI,IAAI,KAAK,sBAAsB;QAAE,OAAO,SAAS,CAAC;IACtD,OAAO,aAAa,IAAI,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;AACjE,CAAC"}

package/dist/questions.d.ts

@@ -0,0 +1,14 @@
+/**
+ * The three classification questions.
+ *
+ * Deliberately narrow, independently evaluated Noul (yes/no) questions rather
+ * than one mutually exclusive Choice. Two orthogonal signals composed in code
+ * keep `normal` as the residual instead of a competing argmax candidate, which
+ * is what made a previous single-choice router misclassify
+ * decomposition-shaped requests as normal.
+ */
+import type { NoulQuestionSpec, ScoreQuestionSpec } from "@mohan-cao/jev-classifier";
+export declare const DECOMPOSITION_QUESTION: NoulQuestionSpec;
+export declare const BOUNDED_VERIFICATION_QUESTION: NoulQuestionSpec;
+export declare const PREMISE_DEFECT_QUESTION: ScoreQuestionSpec;
+//# sourceMappingURL=questions.d.ts.map

package/dist/questions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"questions.d.ts","sourceRoot":"","sources":["../src/questions.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAErF,eAAO,MAAM,sBAAsB,EAAE,gBASpC,CAAC;AAEF,eAAO,MAAM,6BAA6B,EAAE,gBAS3C,CAAC;AAEF,eAAO,MAAM,uBAAuB,EAAE,iBAUrC,CAAC"}

package/dist/questions.js

@@ -0,0 +1,36 @@
+/**
+ * The three classification questions.
+ *
+ * Deliberately narrow, independently evaluated Noul (yes/no) questions rather
+ * than one mutually exclusive Choice. Two orthogonal signals composed in code
+ * keep `normal` as the residual instead of a competing argmax candidate, which
+ * is what made a previous single-choice router misclassify
+ * decomposition-shaped requests as normal.
+ */
+export const DECOMPOSITION_QUESTION = {
+    type: "noul",
+    instructions: "Judge the CURRENT request only. Use the conversation solely to resolve what the request refers to; do not let how earlier turns were answered influence the judgment. Does answering this request well require decomposing it first — identifying the material assumptions, conditions, missing inputs, or tradeoffs that control the answer — because a direct answer would discard something that materially changes it?",
+    criteria: {
+        true: "The current request itself materially depends on conditions, missing inputs, or tradeoffs that must be surfaced before a reliable conclusion can be given.",
+        false: "A direct answer to the current request, including a short list of corrections, can be given without first decomposing the problem.",
+    },
+};
+export const BOUNDED_VERIFICATION_QUESTION = {
+    type: "noul",
+    instructions: "Does this request contain at most three concrete, independently evaluable claims or questions that can each be answered with a direct correct / partially-correct / incorrect verdict followed only by the corrections that matter?",
+    criteria: {
+        true: "At most three concrete claims or questions, each independently checkable, where a useful answer is essentially a verdict plus concise corrections.",
+        false: "The request is open-ended, asks for design, planning, recommendation, or tradeoff analysis, or contains more than three checkable claims.",
+    },
+};
+export const PREMISE_DEFECT_QUESTION = {
+    type: "score",
+    instructions: "How sound is the factual premise of this request? Rate whether the request presupposes something that is false, or true only under a narrower framing than the request implies.",
+    criteria: [
+        "Premise is sound. Nothing presupposed is false or misleading.",
+        "Minor slip in wording or intent; imprecise but not misleading.",
+        "The presupposition holds only under a narrower framing than the request implies; worth naming, but the request is still answerable as posed.",
+        "The presupposition is false or materially misleading; answering as posed would reinforce a misconception.",
+    ],
+};
+//# sourceMappingURL=questions.js.map

package/dist/questions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"questions.js","sourceRoot":"","sources":["../src/questions.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,MAAM,CAAC,MAAM,sBAAsB,GAAqB;IACtD,IAAI,EAAE,MAAM;IACZ,YAAY,EACV,4ZAA4Z;IAC9Z,QAAQ,EAAE;QACR,IAAI,EAAE,4JAA4J;QAClK,KAAK,EACH,oIAAoI;KACvI;CACF,CAAC;AAEF,MAAM,CAAC,MAAM,6BAA6B,GAAqB;IAC7D,IAAI,EAAE,MAAM;IACZ,YAAY,EACV,qOAAqO;IACvO,QAAQ,EAAE;QACR,IAAI,EAAE,oJAAoJ;QAC1J,KAAK,EACH,2IAA2I;KAC9I;CACF,CAAC;AAEF,MAAM,CAAC,MAAM,uBAAuB,GAAsB;IACxD,IAAI,EAAE,OAAO;IACb,YAAY,EACV,iLAAiL;IACnL,QAAQ,EAAE;QACR,+DAA+D;QAC/D,gEAAgE;QAChE,8IAA8I;QAC9I,2GAA2G;KAC5G;CACF,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,39 @@
+import type { JevConfig } from "@mohan-cao/jev-classifier";
+export declare const RESPONSE_MODES: readonly ["bounded_verification", "decomposition_required", "normal"];
+export type ResponseMode = (typeof RESPONSE_MODES)[number];
+/** Raw Jev signals that drive the composed decision, each in [0, 1]. */
+export interface ClassificationSignals {
+    /** P(the request requires decomposition before a reliable answer). */
+    decomposition: number;
+    /** P(the request is bounded verification). */
+    boundedVerification: number;
+    /** Expected severity of a false or misleading premise, 0-3. */
+    premiseDefect: number;
+}
+export interface ClassificationResult {
+    mode: ResponseMode;
+    /** Probability of the signal that drove the decision. */
+    confidence: number;
+    probabilities: Record<ResponseMode, number>;
+    signals: ClassificationSignals;
+    model?: string;
+    cached?: boolean;
+}
+/** The Jev `state` payload for classification. */
+export interface ClassificationState {
+    user_request: string;
+    /** Prior turns, flattened as `"role: text"`. Omitted when there is no history. */
+    recent_conversation?: string[];
+}
+/** Transport settings plus this component's thresholds. */
+export interface ClassifyConfig extends JevConfig {
+    /** P(decomposition) at or above which decomposition wins. */
+    decompositionThreshold: number;
+    /** P(bounded verification) at or above which bounded verification wins. */
+    boundedVerificationThreshold: number;
+    /** Expected premise defect (0-3) at or above which the premise is corrected. */
+    premiseDefectThreshold: number;
+    /** Number of prior conversation turns included in Jev state. 0 disables. */
+    historyTurns: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAE3D,eAAO,MAAM,cAAc,uEAIjB,CAAC;AAEX,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAE3D,wEAAwE;AACxE,MAAM,WAAW,qBAAqB;IACpC,sEAAsE;IACtE,aAAa,EAAE,MAAM,CAAC;IACtB,8CAA8C;IAC9C,mBAAmB,EAAE,MAAM,CAAC;IAC5B,+DAA+D;IAC/D,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,YAAY,CAAC;IACnB,yDAAyD;IACzD,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;IAC5C,OAAO,EAAE,qBAAqB,CAAC;IAC/B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB;AAED,kDAAkD;AAClD,MAAM,WAAW,mBAAmB;IAClC,YAAY,EAAE,MAAM,CAAC;IACrB,kFAAkF;IAClF,mBAAmB,CAAC,EAAE,MAAM,EAAE,CAAC;CAChC;AAED,2DAA2D;AAC3D,MAAM,WAAW,cAAe,SAAQ,SAAS;IAC/C,6DAA6D;IAC7D,sBAAsB,EAAE,MAAM,CAAC;IAC/B,2EAA2E;IAC3E,4BAA4B,EAAE,MAAM,CAAC;IACrC,gFAAgF;IAChF,sBAAsB,EAAE,MAAM,CAAC;IAC/B,4EAA4E;IAC5E,YAAY,EAAE,MAAM,CAAC;CACtB"}

package/dist/types.js

@@ -0,0 +1,6 @@
+export const RESPONSE_MODES = [
+    "bounded_verification",
+    "decomposition_required",
+    "normal",
+];
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAEA,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B,sBAAsB;IACtB,wBAAwB;IACxB,QAAQ;CACA,CAAC"}

package/package.json

@@ -0,0 +1,46 @@
+{
+  "name": "@mohan-cao/jev-classify",
+  "version": "0.1.0",
+  "description": "Jev classification signal: what kind of response the current request needs, and the policy that shapes it.",
+  "type": "module",
+  "license": "Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/mohan-cao/pi-extensions.git",
+    "directory": "packages/jev-classify"
+  },
+  "keywords": [
+    "jev",
+    "typesafe-ai",
+    "system-one",
+    "classifier",
+    "llm"
+  ],
+  "engines": {
+    "node": ">=20"
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE",
+    "CHANGELOG.md"
+  ],
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "dependencies": {
+    "@mohan-cao/jev-classifier": "^0.2.0"
+  },
+  "scripts": {
+    "clean": "rm -rf dist",
+    "build": "tsc -p tsconfig.json",
+    "build:unchecked": "tsc -p tsconfig.json --noCheck",
+    "test": "node --test test/*.test.mjs"
+  }
+}