acmer-coach 2.5.0 → 2.6.0

package/README.md

@@ -121,6 +121,14 @@ learned/verified 记录，或路线中在此前安排的必验训练，不能从
 
 详见 [长期课程机制](docs/长期课程机制.md)。
 
+### 2.6：独立验收、灵活训练与逐题依据
+
+章节分数及限时通过仍记为 `passed`，但只有本次做出的题都明确报告 `independent: true`，才新增 `verified` 和验证段位。独立性未知或有帮助时，保留实际成绩，不能自动认证；旧证书保留，不补造独立事实。独立性来自明确记录，不是工具能从 AC 猜出的结论。延迟保持与迁移仍由既有课程 `exitChecks` 单独验收。
+
+训练沿用 `coach_assign` / `coach_log` / `coach_plan`：短诊断和整场 VP 可以直接绑定比赛能力，时长由教练明确给出；旧知识点练习和默认时长继续支持。计划只记录安排，不证明训练完成。
+
+`coach_target profiles` 和 `coach_focus` 返回逐题 `samples` 与 `coverage`。中国亚洲区域赛主配置包含南京 2022 全卷十三题和 2023 六题，每题列模型、能力和命题组解题页；NWERC 十三题仅作扩展参考，WF 的三题仍是题面诊断。西安目录已经核对，题解未获取，算法样本数如实为零。覆盖数字不产生专题频率、奖牌线或预测；小鲸结合个人证据决定重点。
+
 ### 2.5：接着教，判断仍归小鲸
 
 `coach_note` 只做一件事：把一个知识点的教学判断和接续点留在现有

package/assets/knowledge/CONTEST_PROFILES.yaml

@@ -2,17 +2,69 @@
 version: 1
 profiles:
   - id: regional-diagnostic
-    title: 区域赛通用能力诊断（有限样本）
+    title: 中国亚洲区域赛能力诊断（南京 2022/2023 样本）
+    scope: 以中国亚洲区域赛原题和命题组题解建立模型诊断，结合本人和团队的 VP 事实取舍。
+    status: provisional
+    sources:
+      - {title: SUA 南京 2022 命题组中文题解（全卷十三题）, url: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf'}
+      - {title: SUA 南京 2023 命题组题解（QOJ 镜像，采样六题）, url: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf'}
+      - {title: QOJ 西安历年比赛目录（对应赛区的原题入口）, url: 'https://qoj.ac/category/87'}
+    competencyIds: [contest-reading, contest-decision, implementation-stability, dp-modeling, graph-modeling, data-structures, math-combinatorics, code-review, team-communication]
+    samples:
+      - {year: 2022, contest: Nanjing, problem: I, model: 从旋转回文条件推出字符频次计数, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=3'}
+      - {year: 2022, contest: Nanjing, problem: G, model: 维护总和及数量的可反悔贪心, competencyIds: [math-combinatorics, implementation-stability], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=5'}
+      - {year: 2022, contest: Nanjing, problem: D, model: 二分阈值与有效操作区间前缀统计, competencyIds: [contest-reading, data-structures], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=7'}
+      - {year: 2022, contest: Nanjing, problem: B, model: 单调队列优化 DP 与前后缀复用, competencyIds: [dp-modeling, data-structures], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=10'}
+      - {year: 2022, contest: Nanjing, problem: A, model: 整体移动转边界与二维前缀和, competencyIds: [contest-reading, data-structures], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=15'}
+      - {year: 2022, contest: Nanjing, problem: M, model: 局部极小与水平边界的分类计数, competencyIds: [math-combinatorics, implementation-stability], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=19'}
+      - {year: 2022, contest: Nanjing, problem: J, model: 等式变二分图边与连通块配对, competencyIds: [graph-modeling], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=22'}
+      - {year: 2022, contest: Nanjing, problem: E, model: 树形 DP 与虚树深度统计, competencyIds: [dp-modeling, graph-modeling], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=25'}
+      - {year: 2022, contest: Nanjing, problem: C, model: 逆序操作与通配位置的贪心构造, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=28'}
+      - {year: 2022, contest: Nanjing, problem: H, model: 树上边贡献与凹性背包合并优化, competencyIds: [dp-modeling, data-structures], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=33'}
+      - {year: 2022, contest: Nanjing, problem: K, model: 堆排列概率与完全二叉树对称计数, competencyIds: [math-combinatorics], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=36'}
+      - {year: 2022, contest: Nanjing, problem: L, model: 链上弦覆盖与二边割的增量维护, competencyIds: [graph-modeling, data-structures], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=45'}
+      - {year: 2022, contest: Nanjing, problem: F, model: 锐角三角剖分的基例与递增构造, competencyIds: [math-combinatorics], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=48'}
+      - {year: 2023, contest: Nanjing, problem: I, model: 按重置时间排序并检查约束区间一致性, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=3'}
+      - {year: 2023, contest: Nanjing, problem: F, model: 最后写入者依赖 DAG 与拓扑序交换, competencyIds: [graph-modeling], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=5'}
+      - {year: 2023, contest: Nanjing, problem: C, model: 异或计数同余与区间分解，题名不是算法标签, competencyIds: [math-combinatorics], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=7'}
+      - {year: 2023, contest: Nanjing, problem: G, model: 交换论证结合前缀选择与后缀背包, competencyIds: [dp-modeling, data-structures], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=9'}
+      - {year: 2023, contest: Nanjing, problem: A, model: 双位置可达状态与相对移动约束, competencyIds: [graph-modeling], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=11'}
+      - {year: 2023, contest: Nanjing, problem: L, model: 降序楼层贪心与放松下界的匹配证明, competencyIds: [math-combinatorics, contest-reading], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=13'}
+    selectionGuidance:
+      - 中国亚洲区域赛优先使用对应赛区和年份的真题；先诊断读题、模型选择和实现，不按 CF rating 连续解锁知识点。
+      - 结合本人 VP 已确认的失败原因选择本周重点；一道成功题可作为起点，不证明同模型已经掌握。
+      - I/G 用于条件提炼与贪心证明，D/A 用于变量转化和统计，B 用于从朴素转移推导优化；模型对应题解，训练取舍由教练决定。
+      - 西安目标优先看西安配置及对应原题；NWERC 只作扩展参考，不用欧洲样本代替中国赛区依据。
+    limitations:
+      - 当前采样南京 2022 全卷十三题和 2023 六题，未做跨年份与跨赛区专题频率统计；不能推出中国区域赛频率或本届西安预测。
+      - 这不是完整考纲，模型是教学解释而非唯一解法；验收阈值需按个人和团队事实调整。
+      - 未核验目标届次奖牌榜单，不给出金牌题数或奖牌保证。
+  - id: nwerc-reference
+    title: 区域赛通用能力诊断（NWERC 2024 全卷样本）
     scope: 用公开区域赛的题面与官方解题建立诊断任务，再结合本人 VP 证据取舍。
     status: provisional
     sources:
-      - title: NWERC 2024 官方题面（采样 A、D、E、F、K、L）
+      - title: NWERC 2024 官方题面（A–M 全卷）
         url: https://2024.nwerc.eu/main/problem-set.pdf
-      - title: NWERC 2024 官方解题（A/D/E/F/K/L 对应页）
+      - title: NWERC 2024 官方解题（A–M 对应页）
         url: https://2024.nwerc.eu/main/solutions.pdf
       - title: ICPC NCNA 公布的区域赛规则（通用背景，不提供专题频率）
         url: https://nc.na.icpc.global/rules/
     competencyIds: [contest-reading, contest-decision, implementation-stability, dp-modeling, graph-modeling, data-structures, math-combinatorics, code-review, team-communication]
+    samples:
+      - {year: 2024, contest: NWERC, problem: A, model: 自定义排序规则, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=4'}
+      - {year: 2024, contest: NWERC, problem: B, model: 周期标号游走与状态动态规划，题名不能决定算法, competencyIds: [graph-modeling, dp-modeling], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=24'}
+      - {year: 2024, contest: NWERC, problem: C, model: 网格极端点收缩与几何分类, competencyIds: [math-combinatorics, graph-modeling], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=19'}
+      - {year: 2024, contest: NWERC, problem: D, model: 排序后按最小元素分类计数与背包, competencyIds: [dp-modeling, math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=11'}
+      - {year: 2024, contest: NWERC, problem: E, model: 下标变换与模幂, competencyIds: [math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=8'}
+      - {year: 2024, contest: NWERC, problem: F, model: 单调栈和并查集跳过已满位置, competencyIds: [data-structures], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=13'}
+      - {year: 2024, contest: NWERC, problem: G, model: 双连通分量与排列奇偶性, competencyIds: [graph-modeling, math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=31'}
+      - {year: 2024, contest: NWERC, problem: H, model: 交互函数迭代的等式构造，存在多种解法, competencyIds: [graph-modeling, math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=16'}
+      - {year: 2024, contest: NWERC, problem: I, model: 素数指数参数化与容斥预处理, competencyIds: [math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=28'}
+      - {year: 2024, contest: NWERC, problem: J, model: 独立优化与最近更高障碍限制, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=7'}
+      - {year: 2024, contest: NWERC, problem: K, model: 最短路与按距离排序的概率期望, competencyIds: [graph-modeling, math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=15'}
+      - {year: 2024, contest: NWERC, problem: L, model: 单调可行性与贪心配对二分, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=10'}
+      - {year: 2024, contest: NWERC, problem: M, model: 期望线性性与面积前后缀求和，检查整数溢出, competencyIds: [math-combinatorics, implementation-stability], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=22'}
     selectionGuidance:
       - 先用整场 VP 诊断读题、实现、调试与分工，再用经确认的失败原因选择专题；成功题用作能力基线。
       - 采样 A 检查从精确排序规则到实现的转化；D 检查计数状态；E 检查大次数变换与模幂，题名不决定算法。
@@ -20,9 +72,9 @@ profiles:
       - 赛前优先修复已证实、可在剩余时间完成验收的障碍；未证实的缺口先安排短诊断，不直接扩知识点。
       - 同一题允许多种正确解法；把能解释条件并独立迁移作为验收，不能将某个算法标签当唯一答案。
     limitations:
-      - 当前算法样本只有 NWERC 2024 的六题，不能推出中国区域赛频率、任何场次金牌题数或西安出题预测。
+      - 当前算法样本只有 NWERC 2024 的一届全卷十三题，不能推出中国区域赛频率、任何场次金牌题数或西安出题预测。
       - 读题时间盒、换题条件、验收动作是插件教学设计，需要按个人与团队记录调整，规则来源不证明这些训练阈值。
-      - 未采样其余题或跨年份统计；此配置不是西安考纲，排名与奖牌目标仍需对应比赛榜单。
+      - 未做跨年份统计；此配置不是西安考纲，排名与奖牌目标仍需对应比赛榜单。模型映射是教学解释，官方解题不证明该题在其他赛区高频。
   - id: wf-extension
     title: WF 扩展能力诊断（题面样本）
     scope: 在基础能力稳定后，以 World Finals 原题检查跨模型推理、约束解释和交互实现。
@@ -33,6 +85,10 @@ profiles:
       - title: ICPC 2024 交互题评测说明（输出刷新等要求）
         url: https://docs.icpc.global/wp-content/uploads/2024/08/2024-JudgingNotes.pdf
     competencyIds: [contest-reading, contest-decision, dp-modeling, graph-modeling, data-structures, math-combinatorics, code-review, team-communication]
+    samples:
+      - {year: 2024, contest: World Finals, problem: B, model: 概率对象与事件依赖诊断，题解尚未核验, competencyIds: [math-combinatorics], solutionReviewed: false, sourceUrl: 'https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf'}
+      - {year: 2024, contest: World Finals, problem: I, model: 树上覆盖目标建模，题解尚未核验, competencyIds: [graph-modeling], solutionReviewed: false, sourceUrl: 'https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf'}
+      - {year: 2024, contest: World Finals, problem: L, model: 交互信息状态诊断，策略尚未核验, competencyIds: [contest-reading], solutionReviewed: false, sourceUrl: 'https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf'}
     selectionGuidance:
       - 采样 B 用于检查概率对象、重复元素与事件依赖的精确表达；不能仅凭概率题标签选一个模板。
       - 采样 I 用于检查树上覆盖目标与最坏响应时间的建模，要求先解释判定或优化方案再实现。
@@ -52,6 +108,7 @@ profiles:
       - title: ICPC NCNA 公布的区域赛规则（通用背景，非西安本届规则）
         url: https://nc.na.icpc.global/rules/
     competencyIds: [contest-reading, contest-decision, implementation-stability, code-review, team-communication]
+    samples: []
     selectionGuidance:
       - 使用本人和当前团队 VP 的经确认障碍安排短期动作，专题需求暂参考区域赛通用诊断并明示来源。
       - 先核验目标届次、原始题面、主办方题解和榜单，再记录逐题模型、可替代解法及样本年份。

package/assets/knowledge/skilltree.html

@@ -1335,7 +1335,7 @@ const SNAP = 5;
 // 块型短名。**必须和 host 的 SCHED_KINDS[k].name 逐字一致** ——
 // 不一致时页面会拿 id 兜底显示（不会崩），但那块看着就像坏了。
 // host 是真相源，这里只管显示。verify.mjs 有一条盯着这个一致性。
-const KIND_NAME = { cycle: "题目循环", review: "复习一题", exam: "章节检测" };
+const KIND_NAME = { cycle: "题目循环", review: "复习一题", exam: "章节检测", diagnostic: "短诊断", vp: "完整 VP" };
 
 const minToHM = (m) => {
   const t = HOUR_FROM * 60 + m;
@@ -1447,7 +1447,7 @@ function renderSched() {
       const kind = String(b.kind ?? "");
       // 地图改过名、甚至删过节点，而计划是历史数据 ——
       // 查不到名字就退回 id，**不能因为查不到就不画**（那等于计划凭空消失）。
-      const nm = byId(b.node)?.name ?? String(b.node ?? "");
+      const nm = b.competency ? `能力：${b.competency}` : byId(b.node)?.name ?? String(b.node ?? "");
       const size = mins >= 75 ? "s-full" : mins >= 40 ? "s-mid" : "s-mini";
       // 中等高度（40~74 分钟，循环块正好 60）挤不下两行，但**时间要留住** ——
       // busy 那边中档只放事由就够（他自己知道标了什么），
@@ -1457,7 +1457,7 @@ function renderSched() {
         ? `<span class="t">${esc(b.from)}–${esc(b.to)}</span>${esc(nm)}`
         : size === "s-mid" ? `${esc(b.from)} ${esc(nm)}` : "";
       const tip = `${b.from}–${b.to}　${KIND_NAME[kind] ?? kind}　${nm}` +
-        (kind === "cycle" ? "　（40 自己做 → 10 解决遗留 → 10 重写）" : "");
+        (kind === "cycle" && mins === 60 ? "　（40 自己做 → 10 解决遗留 → 10 重写）" : "");
       return `<div class="pbar k-${esc(kind)} ${size}" title="${esc(tip)}" ` +
         `style="top:${pct(a)};height:${pct(mins)}">${body}</div>`;
     }).join("");

package/assets/rules/coach-rules.md

@@ -13,6 +13,8 @@
   比赛目标不能悄悄覆盖长期目标。赛前在剩余实际容量内选择可验收的改善，赛后再按新
   证据修订；日期只提供约束，不证明某专题该学。无法装进预算时说明暂缓什么与代价。
 * `coach_target profiles` 提供有来源和样本限制的配置，再按需设置 `profileId`。
+  `samples` 是逐题模型与来源，`coverage` 是已核验覆盖；零样本就是没有依据。根据题目
+  条件选模型，不能从题名或一次样本计数推出必考、高频或完整考纲。
   provisional 表示有限样本或尚待取样，不能称官方考纲、预测本届高频专题或保证奖牌。
   不因某知识点“低频”就永久排除，不把同一道题的某一种解法当唯一算法标签。
 * 原始 VP 判题、耗时和提交是观察；WA 不等于不会，AC 不证明独立完成。先用
@@ -402,6 +404,12 @@
 
 ### 二、验收：什么才算"会了"
 
+* `coach_grade` 的 `passed` 只表示卷面分数和限时通过；本次做出题的 `independent`
+  全部明确为 true 才新增 `verified`。未知就留未知，提示或题解帮助不能补成独立。
+  节点 verified 不是保持率或迁移能力证明；这些按课程现有 `exitChecks` 分别验收。
+  短诊断和整场 VP 可用 `coach_assign` 绑定真实 competency，再用 `coach_log` 记录
+  实际交付物与独立性；计划、时长和一次交付物通过都不证明该能力全面掌握。
+
 * 只有 **无提示 + 换皮题（同知识点、他没练过的题）+ 间隔 ≥1 天** 的表现才算数；
   带提示做对的，**不计入"已验证"**。
   依据：延迟 1–6 天后测的效应 g=0.82，当天测只有 0.56（Adesope 2017，272 个效应量）。

package/coach/skilltree_template.html

@@ -1335,7 +1335,7 @@ const SNAP = 5;
 // 块型短名。**必须和 host 的 SCHED_KINDS[k].name 逐字一致** ——
 // 不一致时页面会拿 id 兜底显示（不会崩），但那块看着就像坏了。
 // host 是真相源，这里只管显示。verify.mjs 有一条盯着这个一致性。
-const KIND_NAME = { cycle: "题目循环", review: "复习一题", exam: "章节检测" };
+const KIND_NAME = { cycle: "题目循环", review: "复习一题", exam: "章节检测", diagnostic: "短诊断", vp: "完整 VP" };
 
 const minToHM = (m) => {
   const t = HOUR_FROM * 60 + m;
@@ -1447,7 +1447,7 @@ function renderSched() {
       const kind = String(b.kind ?? "");
       // 地图改过名、甚至删过节点，而计划是历史数据 ——
       // 查不到名字就退回 id，**不能因为查不到就不画**（那等于计划凭空消失）。
-      const nm = byId(b.node)?.name ?? String(b.node ?? "");
+      const nm = b.competency ? `能力：${b.competency}` : byId(b.node)?.name ?? String(b.node ?? "");
       const size = mins >= 75 ? "s-full" : mins >= 40 ? "s-mid" : "s-mini";
       // 中等高度（40~74 分钟，循环块正好 60）挤不下两行，但**时间要留住** ——
       // busy 那边中档只放事由就够（他自己知道标了什么），
@@ -1457,7 +1457,7 @@ function renderSched() {
         ? `<span class="t">${esc(b.from)}–${esc(b.to)}</span>${esc(nm)}`
         : size === "s-mid" ? `${esc(b.from)} ${esc(nm)}` : "";
       const tip = `${b.from}–${b.to}　${KIND_NAME[kind] ?? kind}　${nm}` +
-        (kind === "cycle" ? "　（40 自己做 → 10 解决遗留 → 10 重写）" : "");
+        (kind === "cycle" && mins === 60 ? "　（40 自己做 → 10 解决遗留 → 10 重写）" : "");
       return `<div class="pbar k-${esc(kind)} ${size}" title="${esc(tip)}" ` +
         `style="top:${pct(a)};height:${pct(mins)}">${body}</div>`;
     }).join("");

package/dev/catalog-check.mjs

@@ -2,6 +2,11 @@ import test from 'node:test'
 import assert from 'node:assert/strict'
 import { readFileSync } from 'node:fs'
 import YAML from 'yaml'
+import { mkdtempSync, rmSync } from 'node:fs'
+import { tmpdir } from 'node:os'
+import { join } from 'node:path'
+import { fileURLToPath } from 'node:url'
+import { createStrategyStore } from '../lib/strategy.js'
 
 const knowledge = new URL('../assets/knowledge/', import.meta.url)
 const read = name => YAML.parse(readFileSync(new URL(name, knowledge), 'utf8'))
@@ -24,6 +29,37 @@ function textList(value, label) {
   assert.ok(value.every(item => typeof item === 'string' && item.trim()), `${label}: text required`)
 }
 
+test('contest evidence exposes actual reviewed samples, never a complete syllabus', () => {
+  const dir = mkdtempSync(join(tmpdir(), 'coach-samples-'))
+  try {
+    const store = createStrategyStore({ dataDir: dir, competenciesPath: fileURLToPath(new URL('COMPETENCIES.yaml', knowledge)) })
+    const profiles = store.target('profiles').availableProfiles
+    const regional = profiles.find(profile => profile.id === 'regional-diagnostic')
+    assert.equal(regional.coverage.sampledProblems, 19)
+    assert.equal(regional.coverage.reviewedSolutions, 19)
+    assert.deepEqual(regional.coverage.years, [2022, 2023])
+    assert.equal(regional.coverage.isSyllabus, false)
+    assert.deepEqual(regional.samples.filter(sample => sample.year === 2022).map(sample => sample.problem).sort(), [...'ABCDEFGHIJKLM'])
+    assert.equal(new Set(regional.samples.map(sample => `${sample.contest}:${sample.year}:${sample.problem}`)).size, 19)
+    assert.match(regional.title, /中国|亚洲/)
+    for (const sample of regional.samples) {
+      assert.ok(sample.model && sample.solutionReviewed)
+      assert.match(sample.sourceUrl, sample.year === 2022
+        ? /^https:\/\/sua\.ac\/wiki\/2022-icpc-nanjing\/tutorial-sketch-zh\.pdf#page=\d+$/
+        : /^https:\/\/universal-cup-website\.qoj\.ac\/files\/ucup\/tutorials\/tutorials-2-11\.pdf#page=\d+$/)
+      assert.ok(sample.competencyIds.every(id => competencies.some(card => card.id === id)))
+    }
+    const xian = profiles.find(profile => profile.id === 'xian-pending')
+    assert.equal(xian.coverage.sampledProblems, 0)
+    assert.equal(xian.coverage.reviewedSolutions, 0)
+    assert.equal(xian.coverage.isSyllabus, false)
+    assert.equal(store.target('set', { expectedRevision: 0, contest: '区域赛', date: '2026-10-17', result: '稳定', profileId: regional.id, weeklyHours: 25,
+      priorities: [{ id: 'graph-modeling', weight: 10 }] }).ok, true)
+    assert.equal(store.focus().profile.coverage.sampledProblems, 19)
+    assert.equal(profiles.find(profile => profile.id === 'nwerc-reference').coverage.reviewedSolutions, 13)
+  } finally { rmSync(dir, { recursive: true, force: true }) }
+})
+
 test('node teaching cards use exact map nodes and contain sourced transfer boundaries', () => {
   const catalog = read('NODE_SCOPES.yaml')
   assert.equal(catalog.version, 1)

package/dev/curriculum-evidence-check.mjs

@@ -17,6 +17,24 @@ const practice = (extra = {}) => ({ date, problemId: '1234A', solved: false,
   independent: true, minutes: 40, ...extra })
 const progress = (nodeRecord, node = '区间 DP') => ({ nodes: { [node]: nodeRecord } })
 const rowsFor = (record) => collectEvidence(progress(record))
+
+test('competency diagnostics and VP completions become facts without fake knowledge nodes', () => {
+  const schedule = { days: { [date]: { actual: [
+    { node: '', competency: 'contest-reading', kind: 'diagnostic', actualMin: 15, solved: true, independent: true, problemId: 'probe' },
+    { node: '', competency: 'contest-decision', kind: 'vp', actualMin: 300, solved: false, independent: true, problemId: 'probe' },
+  ] } } }
+  const rows = collectEvidence({}, schedule)
+  assert.equal(rows.length, 2)
+  assert.equal(rows[0].node, '')
+  assert.equal(rows[0].competency, 'contest-reading')
+  assert.equal(rows[0].minutes, 15)
+  assert.equal(rows[0].signal, 'baseline')
+  assert.equal(rows[1].competency, 'contest-decision')
+  assert.equal(rows[1].signal, 'gap')
+  assert.notEqual(rows[0].eventId, rows[1].eventId)
+  assert.deepEqual(collectEvidence({}, { days: { [date]: { actual: [{ ...schedule.days[date].actual[0], independent: 'yes' }] } } }), [])
+  assert.deepEqual(collectEvidence({ pendingActions: { 'competency:contest-reading': { kind: 'diagnostic', minutes: 15 } } }), [])
+})
 const reverseKeys = (value) => Array.isArray(value) ? value.map(reverseKeys)
   : value && typeof value === 'object'
     ? Object.fromEntries(Object.entries(value).reverse().map(([key, item]) => [key, reverseKeys(item)]))

package/dev/grading-check.mjs

@@ -0,0 +1,161 @@
+import test from 'node:test'
+import assert from 'node:assert/strict'
+import { mkdtempSync, writeFileSync, readFileSync, rmSync } from 'node:fs'
+import { tmpdir } from 'node:os'
+import { join } from 'node:path'
+import { parse, stringify } from 'yaml'
+import { collectEvidence } from '../lib/curriculum-evidence.js'
+import { evaluateExitChecks } from '../lib/curriculum-planning.js'
+
+async function fixture(run, nodeRecord = { status: 'studying' }) {
+  const dir = mkdtempSync(join(tmpdir(), 'coach-grading-'))
+  const previous = { data: process.env.COACH_DATA_DIR, db: process.env.COACH_DB }
+  try {
+    process.env.COACH_DATA_DIR = dir
+    process.env.COACH_DB = join(dir, 'unused.db')
+    writeFileSync(join(dir, 'MAP.yaml'), 'meta: {version: 1}\nnodes:\n  - {id: A, name: 基础, depends: []}\n')
+    const path = join(dir, 'PROGRESS.yaml')
+    writeFileSync(path, stringify({ version: 1, cursor: 'A', nodes: { A: nodeRecord }, pending: {
+      node: 'A', totalMinutes: 90, passScore: 4, maxScore: 6,
+      problems: [
+        { problemId: 'P1', band: '易', weight: 1, cfRating: 1200, source: 'pool' },
+        { problemId: 'P2', band: '中', weight: 2, cfRating: 1600, source: 'pool' },
+        { problemId: 'P3', band: '难', weight: 3, cfRating: 1900, source: 'pool' },
+      ],
+    } }))
+    const { apply } = await import(`../index.js?grading=${encodeURIComponent(dir)}`)
+    const tools = new Map()
+    apply({ tools: { register: tool => tools.set(tool.name, tool) }, inject() {}, on() {} })
+    await run({ grade: tools.get('coach_grade'), call: (name, args) => tools.get(name).execute(args),
+      ledger: () => parse(readFileSync(path, 'utf8')), bytes: () => readFileSync(path, 'utf8') })
+  } finally {
+    for (const [key, value] of [['COACH_DATA_DIR', previous.data], ['COACH_DB', previous.db]]) {
+      if (value === undefined) delete process.env[key]
+      else process.env[key] = value
+    }
+    rmSync(dir, { recursive: true, force: true })
+  }
+}
+
+const results = (extra = {}) => ['P1', 'P2', 'P3'].map(problemId => ({ problemId, solved: true, minutes: 15, ...extra }))
+const independentExit = ledger => evaluateExitChecks({ exitChecks: [{ node: 'A', minEvents: 1, independent: true }] },
+  collectEvidence(ledger), [], '2000-01-01')[0]
+
+test('a passing paper without independence facts cannot create a mastery certificate', async () => {
+  await fixture(async ({ grade, ledger }) => {
+    const result = await grade.execute({ results: results() })
+    assert.equal(result.ok, true)
+    assert.equal(result.outcome, 'passed')
+    assert.equal(result.status, 'studying')
+    assert.equal(result.verified, false)
+    assert.equal(result.independence, 'unknown')
+    assert.equal(result.verifiedAt, 0)
+    const record = ledger().nodes.A
+    assert.equal(record.checks[0].independent, undefined)
+    assert.equal(record.checks[0].verifiedAt, 0)
+    assert.equal(independentExit(ledger()).passed, false, 'unknown independence cannot satisfy the course exit condition')
+    assert.equal(ledger().pending, undefined)
+    assert.match(grade.output.render({}, result)[0].text, /独立性.*未|未.*独立/)
+  })
+})
+
+test('a passing paper with a helped solution stays a paper pass without a certificate', async () => {
+  await fixture(async ({ grade, ledger }) => {
+    const reported = results({ independent: true })
+    reported[1].independent = false
+    const result = await grade.execute({ results: reported })
+    assert.equal(result.outcome, 'passed')
+    assert.equal(result.independence, 'assisted')
+    assert.equal(result.verified, false)
+    assert.equal(result.status, 'studying')
+    assert.equal(result.verifiedAt, 0)
+    assert.equal(ledger().nodes.A.checks[0].independent, false)
+    assert.equal(independentExit(ledger()).passed, false)
+    assert.match(grade.output.render({}, result)[0].text, /有帮助/)
+  })
+})
+
+test('explicitly independent solved problems certify a passing paper and carry the evidence into course checks', async () => {
+  await fixture(async ({ grade, ledger }) => {
+    const result = await grade.execute({ results: results({ independent: true }) })
+    assert.equal(result.verified, true)
+    assert.equal(result.status, 'verified')
+    assert.equal(result.independence, 'independent')
+    assert.equal(result.verifiedAt, 1900)
+    assert.equal(ledger().nodes.A.checks[0].independent, true)
+    assert.equal(independentExit(ledger()).passed, true)
+    assert.equal(ledger().nodes.A.passes, undefined, 'exam records must not invent practice records')
+    assert.match(grade.output.render({}, result)[0].text, /不代表隔日.*迁移/)
+  })
+})
+
+test('weighted passing still requires explicit independence for every solved problem', async () => {
+  await fixture(async ({ grade }) => {
+    const reported = results({ independent: true })
+    delete reported[2].independent
+    const result = await grade.execute({ results: reported })
+    assert.equal(result.outcome, 'passed')
+    assert.equal(result.verified, false)
+    assert.equal(result.independence, 'unknown')
+  })
+  await fixture(async ({ grade }) => {
+    const reported = results({ independent: true })
+    reported[1] = { problemId: 'P2', solved: false, minutes: 15 }
+    const result = await grade.execute({ results: reported })
+    assert.equal(result.score, 4)
+    assert.equal(result.verified, true, 'the existing weighted pass line remains valid; unsolved problems do not prove mastery')
+  })
+})
+
+test('explicit independence never certifies a failing or overtime paper', async () => {
+  for (const [reported, outcome] of [
+    [results({ independent: true, solved: false }), 'failed'],
+    [results({ independent: true, minutes: 40 }), 'overTime'],
+  ]) await fixture(async ({ grade, ledger }) => {
+    const result = await grade.execute({ results: reported })
+    assert.equal(result.outcome, outcome)
+    assert.equal(result.verified, false)
+    assert.equal(result.status, 'studying')
+    assert.equal(result.verifiedAt, 0)
+    assert.equal(independentExit(ledger()).passed, false)
+  })
+})
+
+test('unknown or assisted passing records preserve historical verified and learned states', async () => {
+  const previousCheck = { date: '2026-09-01', outcome: 'passed', score: 6, maxScore: 6, passScore: 4,
+    minutes: 45, limit: 90, verifiedAt: 1600, selfReported: 0, problems: [] }
+  for (const status of ['verified', 'learned']) await fixture(async ({ grade, ledger }) => {
+    const result = await grade.execute({ results: results() })
+    assert.equal(result.status, status)
+    assert.equal(result.verified, false, 'status may be historical; verified describes this attempt only')
+    assert.equal(result.verifiedAt, 0)
+    assert.equal(ledger().nodes.A.at, '2026-09-01')
+    assert.deepEqual(ledger().nodes.A.checks[0], previousCheck)
+    assert.equal(ledger().nodes.A.checks.length, 2)
+  }, { status, at: '2026-09-01', checks: [previousCheck] })
+})
+
+test('malformed grading fields and contradictory IDs are rejected without changing the pending paper', async () => {
+  await fixture(async ({ grade, bytes }) => {
+    const before = bytes()
+    for (const invalid of [
+      { independent: 'true' }, { independent: null }, { solved: 'true' },
+      { minutes: -1 }, { minutes: Infinity }, { minutes: Number.MAX_VALUE }, { minutes: '15' }, { problemId: '' }, { problemId: 'P2' },
+    ]) {
+      const reported = results()
+      Object.assign(reported[0], invalid)
+      let rejected
+      try { rejected = await grade.execute({ results: reported }) }
+      catch (error) {
+        assert.equal(error.code, 'INVALID_ARGS', 'the native SDK may reject malformed types before tool execution')
+      }
+      if (rejected) {
+        assert.equal(rejected.ok, false, JSON.stringify(invalid))
+        assert.equal(rejected.verified, false)
+        assert.equal(rejected.independence, 'unknown')
+        for (const key of grade.output.schema.required) assert.ok(key in rejected, `missing refusal field ${key}`)
+      }
+      assert.equal(bytes(), before)
+    }
+  })
+})

package/dev/parity-check.mjs

@@ -135,6 +135,10 @@ for (const [tool, args, label] of CALLS) {
     delete ra.targetAligned; delete ra.competencies
   }
   // A legacy host cannot return the new empty continuation field.
+  if (tool === 'coach_schedule' && Array.isArray(ra?.blockKinds) && Array.isArray(rb?.blockKinds) && rb.blockKinds.length === 3) {
+    const added = ra.blockKinds.slice(3)
+    if (JSON.stringify(added) === JSON.stringify([{ kind: 'diagnostic', minutes: 15, name: '短诊断' }, { kind: 'vp', minutes: 300, name: '完整 VP' }])) ra.blockKinds = ra.blockKinds.slice(0, 3)
+  }
   if (tool === 'coach_status' && rb && !('teachingContext' in rb) && ra?.teachingContext === '') {
     delete ra.teachingContext
   }
@@ -165,6 +169,7 @@ for (const [tool, args, label] of CALLS.filter((c) => c[0] !== 'coach_diagnose')
     : legacyText)
   // Only the changed goal-led advice is excluded; schedule facts still match byte for byte.
   const scheduleAdvice = (text) => text
+    .replace('／diagnostic 15min（短诊断）／vp 300min（完整 VP）', '')
     .replace(/^⚠️ \*\*复习别把新知识挤没了。\*\*.*剩下的时间留给推进。$/m, '<COACH_ADVICE>')
     .replace(/^根据目标、剩余时间和实际表现，选择新课、复习、迁移或 VP。上面的间隔只供判断；不要为了填满课表持续开新知识点。$/m, '<COACH_ADVICE>')
   const same = tool === 'coach_schedule' ? scheduleAdvice(ra) === scheduleAdvice(rb) : ra === rb

package/dev/run-all.sh

@@ -69,6 +69,8 @@ run "strategy"      node --test dev/strategy-check.mjs
 run "catalog"       node --test dev/catalog-check.mjs
 run "coach-contract" node --test dev/coaching-contract-check.mjs
 run "teaching"      node --test dev/teaching-check.mjs
+run "grading"       node --test dev/grading-check.mjs
+run "training"      node --test dev/training-check.mjs
 run "VP-client"     node dev/vp-client-check.mjs
 run "VP-sync"       node --test dev/vp-sync-check.mjs
 run "migration"     node --test dev/workspace-migration-check.mjs