{
  "report_version": "ocme-question-factory-validation-v0.1",
  "batch_id": "batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations",
  "checked_at": "2026-10-13",
  "outcome": "passed",
  "status_scope": "candidate_only_no_human_review_or_formal_proof_claimed",
  "brief_sha256": "5d5ce3ac6c92ce10c3466dcf7bff6da1eba475b7486bef7aa7520b9d31153312",
  "source_commit_sha": "a74fb26e0b26232b8440bc51fd67b2057395fd38",
  "source_commit_blob_checks": {
    "source_mko": "mko-convex-optimization-problem",
    "source_lf_normalized_sha256": "0484bac345126653c2ee68f9057b0c7bf124c996ee7e7cfd461d32ad4e78747b",
    "all_match": true
  },
  "counts": {
    "total": 100,
    "by_family": {
      "qf-mod25-convexopt-problem-qualification": 25,
      "qf-mod25-convexopt-feasible-point-audit": 25,
      "qf-mod25-convexopt-objective-at-feasible-point": 25,
      "qf-mod25-convexopt-pairwise-feasible-comparison": 25
    },
    "unique_ids": 100,
    "unique_seeds": 100,
    "unique_stems": 100,
    "unique_semantic_templates": 100,
    "exact_stem_duplicate_rate": 0,
    "semantic_template_duplicate_rate": 0
  },
  "questions_sha256": "ef1ac59c4356b6e327bc102178d24ce7d087572a0edfa4f59a5f7fadc0fbcdf3",
  "batch_sha256": "ef1ac59c4356b6e327bc102178d24ce7d087572a0edfa4f59a5f7fadc0fbcdf3",
  "manifest_sha256": "d171d373b4345f8848cb76ac1e360cef951a28be1e221b264a47e90b20dba814",
  "byte_length": 195161,
  "average_bytes_per_question": 1951.61,
  "required_check_results": {
    "json_schema": true,
    "independent_answer_recomputation": true,
    "explanation_witness_accuracy": true,
    "source_mko_snapshot_hash": true,
    "manifest_sha256": true
  },
  "errors": []
}