Update README.md

README.md

@@ -113,6 +113,11 @@ All scores are deterministic and bounded to [0, 1].
 | **Scheduling correctness** | 0–1 | No double-booking, within working hours, appropriate duration (15min–2hrs), all participants included |
 | **Conflict resolution** | 0–1 | Recognizes conflicts, proposes 2–3 alternatives, explains professionally, prioritizes correctly |
 
+**Architectural note on rubrics.** The reward is composed from independent scoring functions (one per dimension: email quality, scheduling correctness,
+conflict resolution) plus four named penalty checks. Each function returns a value in [0, 1] (or a negative penalty) and is mixed by the task-specific
+weighting shown in the Tasks table. This is structurally a composable rubric — any individual grader can be swapped, weighted differently, or audited in
+isolation. We implemented it as plain Python rather than OpenEnv's `Rubric` class for hackathon speed, but the design pattern is the same.
+
 ### Anti-reward-hacking penalties
 
 - Short email (`< 20` words): **−0.30**