Clarify v2 trusted anytime evaluation plan

RELEASE_NOTES.md

@@ -66,9 +66,9 @@ Users of earlier FrontierOR snapshots should:
 - rerun feasibility checks when relying on results produced by older checker versions.
 
 
-### Future direction: trusted anytime evaluation
+### Future direction for v2: trusted anytime evaluation
 
-The current incumbent logs are intentionally treated as untrusted for formal anytime metrics. In many evaluated programs, the log records only an incumbent objective value and does not include the complete decision-variable assignment required by the task's `solution_schema.json`. As a result, if a program finds and logs an incumbent but later fails to terminate correctly, the host cannot verify that intermediate incumbent for feasibility or objective consistency. This also means AOCC computed from objective-only incumbent logs would not be checker-validated.
+The current incumbent logs are intentionally treated as untrusted for formal anytime metrics. In many evaluated programs, the log records only an incumbent objective value and does not include the complete decision-variable assignment required by the task's `solution_schema.json`. As a result, if a program finds and logs an incumbent but later fails to terminate correctly, the host cannot verify that intermediate incumbent for feasibility or objective consistency. This also means AOCC computed from objective-only incumbent logs would not be checker-validated. This version still keeps these log files for inspection and debugging, but temporarily removes AOCC-style metric computation because incumbent logs are not yet trusted evidence of feasible intermediate solutions.
 
 A natural next step is to extend `SolutionLogger.log_solution(objective, solution)` so algorithms can report complete incumbent solution snapshots. This is nontrivial: not every algorithm can construct a complete feasible solution before termination; task schemas differ substantially; some search procedures maintain only internal state or objective values until final reconstruction; Gurobi callbacks may make full variable extraction expensive; repeated serialization of large solutions can add runtime, memory, and disk overhead; and oversized logs need bounded storage and validation policies.