@absolutejs/absolute 0.19.0-beta.611 → 0.19.0-beta.612

package/dist/ai-client/angular/ai/index.js

@@ -1748,6 +1748,8 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
   }
   const diagnostics = [...sections.values()];
   const strongestBestHit = diagnostics.reduce((highest, section) => Math.max(highest, section.bestScore), 0);
+  const parentLabelByKey = new Map(diagnostics.map((section) => [section.key, section.parentLabel]));
+  const stageSectionCounts = new Map((trace?.steps ?? []).filter((step) => Array.isArray(step.sectionCounts) && step.sectionCounts.length > 0).map((step) => [step.stage, step.sectionCounts ?? []]));
   return diagnostics.map((section) => {
     const siblingPool = diagnostics.filter((entry) => entry.parentLabel === section.parentLabel);
     const siblings = siblingPool.filter((entry) => entry.key !== section.key);
@@ -1768,6 +1770,42 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
       count: step.sectionCounts?.find((entry) => entry.key === section.key)?.count ?? 0,
       stage: step.stage
     })).filter((entry) => entry.count > 0) ?? [];
+    const stageWeights = stageCounts.map((entry) => {
+      const stageEntries = stageSectionCounts.get(entry.stage)?.filter((candidate) => candidate.count > 0) ?? [];
+      const stageTotal = stageEntries.reduce((sum, candidate) => sum + candidate.count, 0);
+      const siblingStageEntries = stageEntries.filter((candidate) => candidate.key !== section.key && parentLabelByKey.get(candidate.key) === section.parentLabel);
+      const parentStageEntries = stageEntries.filter((candidate) => parentLabelByKey.get(candidate.key) === section.parentLabel);
+      const strongestStageSibling = siblingStageEntries.slice().sort((left, right) => right.count - left.count)[0];
+      const parentStageTotal = parentStageEntries.reduce((sum, candidate) => sum + candidate.count, 0);
+      const stageShare = stageTotal > 0 ? entry.count / stageTotal : 0;
+      const parentStageShare = parentStageTotal > 0 ? entry.count / parentStageTotal : undefined;
+      const stageShareGap = stageTotal > 0 && strongestStageSibling ? entry.count / stageTotal - strongestStageSibling.count / stageTotal : undefined;
+      const parentStageShareGap = parentStageTotal > 0 && strongestStageSibling ? entry.count / parentStageTotal - strongestStageSibling.count / parentStageTotal : undefined;
+      const reasons2 = [];
+      if (entry.stage === "rerank" && stageShare > 0.5 && (typeof stageShareGap !== "number" || stageShareGap > 0)) {
+        reasons2.push("rerank_preserved_lead");
+      }
+      if (entry.stage === "finalize" && stageShare >= 0.5) {
+        reasons2.push("final_stage_concentration");
+      }
+      if (entry.stage === "finalize" && typeof parentStageShare === "number" && parentStageShare >= 0.6 && (typeof parentStageShareGap !== "number" || parentStageShareGap > 0)) {
+        reasons2.push("final_stage_dominant_within_parent");
+      }
+      if (strongestStageSibling && (typeof stageShareGap === "number" && stageShareGap <= 0.1 || typeof parentStageShareGap === "number" && parentStageShareGap <= 0.1)) {
+        reasons2.push("stage_runner_up_pressure");
+      }
+      return {
+        count: entry.count,
+        parentStageShare,
+        parentStageShareGap,
+        reasons: reasons2,
+        stage: entry.stage,
+        stageShare,
+        stageShareGap,
+        strongestSiblingCount: strongestStageSibling?.count,
+        strongestSiblingLabel: strongestStageSibling ? diagnostics.find((candidate) => candidate.key === strongestStageSibling.key)?.label ?? strongestStageSibling.key : undefined
+      };
+    });
     const firstSeenStage = stageCounts[0]?.stage;
     const lastSeenStage = stageCounts.at(-1)?.stage;
     if (section.bestScore >= strongestBestHit) {
@@ -1810,6 +1848,7 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
       scoreShare,
       scoreThresholdApplied: trace?.steps.some((step) => step.stage === "score_filter"),
       stageCounts,
+      stageWeights,
       siblingCount: siblings.length,
       siblingScoreGap: strongestSibling ? section.totalScore - strongestSibling.totalScore : undefined,
       sourceCount: section.sourceSet.size,

package/dist/ai-client/react/ai/index.js

@@ -1708,6 +1708,8 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
   }
   const diagnostics = [...sections.values()];
   const strongestBestHit = diagnostics.reduce((highest, section) => Math.max(highest, section.bestScore), 0);
+  const parentLabelByKey = new Map(diagnostics.map((section) => [section.key, section.parentLabel]));
+  const stageSectionCounts = new Map((trace?.steps ?? []).filter((step) => Array.isArray(step.sectionCounts) && step.sectionCounts.length > 0).map((step) => [step.stage, step.sectionCounts ?? []]));
   return diagnostics.map((section) => {
     const siblingPool = diagnostics.filter((entry) => entry.parentLabel === section.parentLabel);
     const siblings = siblingPool.filter((entry) => entry.key !== section.key);
@@ -1728,6 +1730,42 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
       count: step.sectionCounts?.find((entry) => entry.key === section.key)?.count ?? 0,
       stage: step.stage
     })).filter((entry) => entry.count > 0) ?? [];
+    const stageWeights = stageCounts.map((entry) => {
+      const stageEntries = stageSectionCounts.get(entry.stage)?.filter((candidate) => candidate.count > 0) ?? [];
+      const stageTotal = stageEntries.reduce((sum, candidate) => sum + candidate.count, 0);
+      const siblingStageEntries = stageEntries.filter((candidate) => candidate.key !== section.key && parentLabelByKey.get(candidate.key) === section.parentLabel);
+      const parentStageEntries = stageEntries.filter((candidate) => parentLabelByKey.get(candidate.key) === section.parentLabel);
+      const strongestStageSibling = siblingStageEntries.slice().sort((left, right) => right.count - left.count)[0];
+      const parentStageTotal = parentStageEntries.reduce((sum, candidate) => sum + candidate.count, 0);
+      const stageShare = stageTotal > 0 ? entry.count / stageTotal : 0;
+      const parentStageShare = parentStageTotal > 0 ? entry.count / parentStageTotal : undefined;
+      const stageShareGap = stageTotal > 0 && strongestStageSibling ? entry.count / stageTotal - strongestStageSibling.count / stageTotal : undefined;
+      const parentStageShareGap = parentStageTotal > 0 && strongestStageSibling ? entry.count / parentStageTotal - strongestStageSibling.count / parentStageTotal : undefined;
+      const reasons2 = [];
+      if (entry.stage === "rerank" && stageShare > 0.5 && (typeof stageShareGap !== "number" || stageShareGap > 0)) {
+        reasons2.push("rerank_preserved_lead");
+      }
+      if (entry.stage === "finalize" && stageShare >= 0.5) {
+        reasons2.push("final_stage_concentration");
+      }
+      if (entry.stage === "finalize" && typeof parentStageShare === "number" && parentStageShare >= 0.6 && (typeof parentStageShareGap !== "number" || parentStageShareGap > 0)) {
+        reasons2.push("final_stage_dominant_within_parent");
+      }
+      if (strongestStageSibling && (typeof stageShareGap === "number" && stageShareGap <= 0.1 || typeof parentStageShareGap === "number" && parentStageShareGap <= 0.1)) {
+        reasons2.push("stage_runner_up_pressure");
+      }
+      return {
+        count: entry.count,
+        parentStageShare,
+        parentStageShareGap,
+        reasons: reasons2,
+        stage: entry.stage,
+        stageShare,
+        stageShareGap,
+        strongestSiblingCount: strongestStageSibling?.count,
+        strongestSiblingLabel: strongestStageSibling ? diagnostics.find((candidate) => candidate.key === strongestStageSibling.key)?.label ?? strongestStageSibling.key : undefined
+      };
+    });
     const firstSeenStage = stageCounts[0]?.stage;
     const lastSeenStage = stageCounts.at(-1)?.stage;
     if (section.bestScore >= strongestBestHit) {
@@ -1770,6 +1808,7 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
       scoreShare,
       scoreThresholdApplied: trace?.steps.some((step) => step.stage === "score_filter"),
       stageCounts,
+      stageWeights,
       siblingCount: siblings.length,
       siblingScoreGap: strongestSibling ? section.totalScore - strongestSibling.totalScore : undefined,
       sourceCount: section.sourceSet.size,

package/dist/ai-client/vue/ai/index.js

@@ -2751,6 +2751,8 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
   }
   const diagnostics = [...sections.values()];
   const strongestBestHit = diagnostics.reduce((highest, section) => Math.max(highest, section.bestScore), 0);
+  const parentLabelByKey = new Map(diagnostics.map((section) => [section.key, section.parentLabel]));
+  const stageSectionCounts = new Map((trace?.steps ?? []).filter((step) => Array.isArray(step.sectionCounts) && step.sectionCounts.length > 0).map((step) => [step.stage, step.sectionCounts ?? []]));
   return diagnostics.map((section) => {
     const siblingPool = diagnostics.filter((entry) => entry.parentLabel === section.parentLabel);
     const siblings = siblingPool.filter((entry) => entry.key !== section.key);
@@ -2771,6 +2773,42 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
       count: step.sectionCounts?.find((entry) => entry.key === section.key)?.count ?? 0,
       stage: step.stage
     })).filter((entry) => entry.count > 0) ?? [];
+    const stageWeights = stageCounts.map((entry) => {
+      const stageEntries = stageSectionCounts.get(entry.stage)?.filter((candidate) => candidate.count > 0) ?? [];
+      const stageTotal = stageEntries.reduce((sum, candidate) => sum + candidate.count, 0);
+      const siblingStageEntries = stageEntries.filter((candidate) => candidate.key !== section.key && parentLabelByKey.get(candidate.key) === section.parentLabel);
+      const parentStageEntries = stageEntries.filter((candidate) => parentLabelByKey.get(candidate.key) === section.parentLabel);
+      const strongestStageSibling = siblingStageEntries.slice().sort((left, right) => right.count - left.count)[0];
+      const parentStageTotal = parentStageEntries.reduce((sum, candidate) => sum + candidate.count, 0);
+      const stageShare = stageTotal > 0 ? entry.count / stageTotal : 0;
+      const parentStageShare = parentStageTotal > 0 ? entry.count / parentStageTotal : undefined;
+      const stageShareGap = stageTotal > 0 && strongestStageSibling ? entry.count / stageTotal - strongestStageSibling.count / stageTotal : undefined;
+      const parentStageShareGap = parentStageTotal > 0 && strongestStageSibling ? entry.count / parentStageTotal - strongestStageSibling.count / parentStageTotal : undefined;
+      const reasons2 = [];
+      if (entry.stage === "rerank" && stageShare > 0.5 && (typeof stageShareGap !== "number" || stageShareGap > 0)) {
+        reasons2.push("rerank_preserved_lead");
+      }
+      if (entry.stage === "finalize" && stageShare >= 0.5) {
+        reasons2.push("final_stage_concentration");
+      }
+      if (entry.stage === "finalize" && typeof parentStageShare === "number" && parentStageShare >= 0.6 && (typeof parentStageShareGap !== "number" || parentStageShareGap > 0)) {
+        reasons2.push("final_stage_dominant_within_parent");
+      }
+      if (strongestStageSibling && (typeof stageShareGap === "number" && stageShareGap <= 0.1 || typeof parentStageShareGap === "number" && parentStageShareGap <= 0.1)) {
+        reasons2.push("stage_runner_up_pressure");
+      }
+      return {
+        count: entry.count,
+        parentStageShare,
+        parentStageShareGap,
+        reasons: reasons2,
+        stage: entry.stage,
+        stageShare,
+        stageShareGap,
+        strongestSiblingCount: strongestStageSibling?.count,
+        strongestSiblingLabel: strongestStageSibling ? diagnostics.find((candidate) => candidate.key === strongestStageSibling.key)?.label ?? strongestStageSibling.key : undefined
+      };
+    });
     const firstSeenStage = stageCounts[0]?.stage;
     const lastSeenStage = stageCounts.at(-1)?.stage;
     if (section.bestScore >= strongestBestHit) {
@@ -2813,6 +2851,7 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
       scoreShare,
       scoreThresholdApplied: trace?.steps.some((step) => step.stage === "score_filter"),
       stageCounts,
+      stageWeights,
       siblingCount: siblings.length,
       siblingScoreGap: strongestSibling ? section.totalScore - strongestSibling.totalScore : undefined,
       sourceCount: section.sourceSet.size,

package/dist/angular/ai/index.js

@@ -2298,6 +2298,8 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
   }
   const diagnostics = [...sections.values()];
   const strongestBestHit = diagnostics.reduce((highest, section) => Math.max(highest, section.bestScore), 0);
+  const parentLabelByKey = new Map(diagnostics.map((section) => [section.key, section.parentLabel]));
+  const stageSectionCounts = new Map((trace?.steps ?? []).filter((step) => Array.isArray(step.sectionCounts) && step.sectionCounts.length > 0).map((step) => [step.stage, step.sectionCounts ?? []]));
   return diagnostics.map((section) => {
     const siblingPool = diagnostics.filter((entry) => entry.parentLabel === section.parentLabel);
     const siblings = siblingPool.filter((entry) => entry.key !== section.key);
@@ -2318,6 +2320,42 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
       count: step.sectionCounts?.find((entry) => entry.key === section.key)?.count ?? 0,
       stage: step.stage
     })).filter((entry) => entry.count > 0) ?? [];
+    const stageWeights = stageCounts.map((entry) => {
+      const stageEntries = stageSectionCounts.get(entry.stage)?.filter((candidate) => candidate.count > 0) ?? [];
+      const stageTotal = stageEntries.reduce((sum, candidate) => sum + candidate.count, 0);
+      const siblingStageEntries = stageEntries.filter((candidate) => candidate.key !== section.key && parentLabelByKey.get(candidate.key) === section.parentLabel);
+      const parentStageEntries = stageEntries.filter((candidate) => parentLabelByKey.get(candidate.key) === section.parentLabel);
+      const strongestStageSibling = siblingStageEntries.slice().sort((left, right) => right.count - left.count)[0];
+      const parentStageTotal = parentStageEntries.reduce((sum, candidate) => sum + candidate.count, 0);
+      const stageShare = stageTotal > 0 ? entry.count / stageTotal : 0;
+      const parentStageShare = parentStageTotal > 0 ? entry.count / parentStageTotal : undefined;
+      const stageShareGap = stageTotal > 0 && strongestStageSibling ? entry.count / stageTotal - strongestStageSibling.count / stageTotal : undefined;
+      const parentStageShareGap = parentStageTotal > 0 && strongestStageSibling ? entry.count / parentStageTotal - strongestStageSibling.count / parentStageTotal : undefined;
+      const reasons2 = [];
+      if (entry.stage === "rerank" && stageShare > 0.5 && (typeof stageShareGap !== "number" || stageShareGap > 0)) {
+        reasons2.push("rerank_preserved_lead");
+      }
+      if (entry.stage === "finalize" && stageShare >= 0.5) {
+        reasons2.push("final_stage_concentration");
+      }
+      if (entry.stage === "finalize" && typeof parentStageShare === "number" && parentStageShare >= 0.6 && (typeof parentStageShareGap !== "number" || parentStageShareGap > 0)) {
+        reasons2.push("final_stage_dominant_within_parent");
+      }
+      if (strongestStageSibling && (typeof stageShareGap === "number" && stageShareGap <= 0.1 || typeof parentStageShareGap === "number" && parentStageShareGap <= 0.1)) {
+        reasons2.push("stage_runner_up_pressure");
+      }
+      return {
+        count: entry.count,
+        parentStageShare,
+        parentStageShareGap,
+        reasons: reasons2,
+        stage: entry.stage,
+        stageShare,
+        stageShareGap,
+        strongestSiblingCount: strongestStageSibling?.count,
+        strongestSiblingLabel: strongestStageSibling ? diagnostics.find((candidate) => candidate.key === strongestStageSibling.key)?.label ?? strongestStageSibling.key : undefined
+      };
+    });
     const firstSeenStage = stageCounts[0]?.stage;
     const lastSeenStage = stageCounts.at(-1)?.stage;
     if (section.bestScore >= strongestBestHit) {
@@ -2360,6 +2398,7 @@ var buildRAGSectionRetrievalDiagnostics = (sources, trace) => {
       scoreShare,
       scoreThresholdApplied: trace?.steps.some((step) => step.stage === "score_filter"),
       stageCounts,
+      stageWeights,
       siblingCount: siblings.length,
       siblingScoreGap: strongestSibling ? section.totalScore - strongestSibling.totalScore : undefined,
       sourceCount: section.sourceSet.size,
@@ -4549,5 +4588,5 @@ export {
   AIStreamService
 };
 
-//# debugId=458F3E73F2A0F43C64756E2164756E21
+//# debugId=4DB0513163E0BB7564756E2164756E21
 //# sourceMappingURL=index.js.map