{
  "schema_version": "ocme-reviewed-question-reader-v1",
  "question_id": "q-20261008-advance-20261012-r01-mathematical-induction-0049",
  "pilot_number": "R0009-05424",
  "number": 5424,
  "family_id": "qf-density12-induction-affine-recursive-prefix",
  "title": {
    "zh-Hant": "第 5424 題：整數值遞推的有限前綴",
    "en": "Question 5424: Inclusive Finite Recurrence Prefix"
  },
  "original_question": {
    "schema_version": "ocme-question-v0.1",
    "id": "q-20261008-advance-20261012-r01-mathematical-induction-0049",
    "batch_id": "batch-20261008-advance-20261012-r01-mathematical-induction-foundations",
    "language": "zh-Hant",
    "source_mko_ids": [
      "mko-mathematical-induction"
    ],
    "title_zh": "整數值遞推的有限前綴",
    "stem_zh": "N從0起；有限歸納協議；a(0)=11、a(k+1)=a(k)+(1)，through=8。列a(0)至a(through)，含兩端。",
    "answer": {
      "kind": "expression",
      "value": "[11, 12, 13, 14, 15, 16, 17, 18, 19]",
      "explanation_zh": "遞推有限前綴=[11, 12, 13, 14, 15, 16, 17, 18, 19]。從初值逐次加d，零範圍只列初值；索引自然數不要求遞推值非負，有限檢查非普遍證明。"
    },
    "difficulty": {
      "band": "upper_secondary",
      "level": 3,
      "skills": [
        "整數值遞推的有限前綴"
      ]
    },
    "variant": {
      "family_id": "qf-density12-induction-affine-recursive-prefix",
      "seed": 202610121049,
      "parameters": {
        "s": 11,
        "d": 1,
        "through": 8,
        "operation": "density12_induction_affine_recursive_prefix",
        "domain": "finite_induction_protocol",
        "semantic_template": "qf-density12-induction-affine-recursive-prefix/[11,1,8]"
      }
    },
    "verification": {
      "status": "candidate",
      "checks": [
        "producer_exact_integer_rational_arithmetic",
        "producer_finite_enumeration",
        "producer_source_snapshot_check",
        "producer_substantive_template_deduplication",
        "producer_json_schema"
      ],
      "warning_zh": "僅為產生端候選及自檢；主端須另做獨立驗收，不構成人工審定、普遍證明或形式 Evidence。"
    },
    "provenance": {
      "generator_role": "question_producer",
      "generator_model": "model_unknown",
      "generated_at": "2026-10-08",
      "contract_version": "ocme-question-factory-v0.1"
    }
  },
  "original_english_edition": {
    "schema_version": "ocme-question-localization-v0.1",
    "question_id": "q-20261008-advance-20261012-r01-mathematical-induction-0049",
    "batch_id": "batch-20261008-advance-20261012-r01-mathematical-induction-foundations",
    "locale": "en",
    "translation_state": "ai_candidate",
    "source": {
      "question_sha256": "425c3f118b4827387d8db3c56a48618910c383c8d00c1b18686d305f6ad69abb",
      "family_id": "qf-density12-induction-affine-recursive-prefix",
      "seed": 202610121049,
      "semantic_template": "qf-density12-induction-affine-recursive-prefix/[11,1,8]"
    },
    "fields": {
      "title": "Inclusive Finite Recurrence Prefix",
      "stem": "N is indexed from 0; this is an explicitly finite induction protocol, not a universal proof. a(0)=11, a(k+1)=a(k)+(1), through=8. List a(0) through a(through), inclusive.",
      "answer": {
        "kind": "expression",
        "value": "[11, 12, 13, 14, 15, 16, 17, 18, 19]",
        "explanation": "Start at the given initial value and add d repeatedly; through=0 lists only the initial value. Natural indices do not require nonnegative sequence values. The exact result, retaining the requested order, is [11, 12, 13, 14, 15, 16, 17, 18, 19]."
      },
      "skills": [
        "Inclusive Finite Recurrence Prefix"
      ],
      "verification_warning": "This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."
    }
  },
  "givens": [
    {
      "id": "G001",
      "text": {
        "zh-Hant": "N從0起；有限歸納協議；a(0)=11、a(k+1)=a(k)+(1)，through=8。列a(0)至a(through)，含兩端。",
        "en": "N is indexed from 0; this is an explicitly finite induction protocol, not a universal proof. a(0)=11, a(k+1)=a(k)+(1), through=8. List a(0) through a(through), inclusive."
      }
    }
  ],
  "steps": [
    {
      "id": "S001",
      "uses": [
        "G001"
      ],
      "before": "natural indices start at0;finite induction protocol",
      "after": "index bookkeeping and finite values are not proofs of all P(n)",
      "relation": "implies",
      "rule_id": "finite_induction_claim_boundary",
      "conditions": [],
      "explanation": {
        "zh-Hant": "自然數索引不要求序列值非負；有限範圍或後繼索引的核對不自動提供命題真值或所有自然數的歸納證明。",
        "en": "Natural indices do not require nonnegative sequence values.Checking a finite range or a successor index does not supply proposition truth or an induction proof over all naturals."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S002",
      "uses": [
        "G001",
        "S001"
      ],
      "before": "a(0)=11;through=8",
      "after": "[11]",
      "relation": "implies",
      "rule_id": "recurrence_prefix_base",
      "conditions": [],
      "explanation": {
        "zh-Hant": "先列給定初值，through=0時只保留它。",
        "en": "Start with the supplied initial value;through=0 retains only it."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S003",
      "uses": [
        "G001",
        "S002"
      ],
      "before": "recurrence next value1 := sum(11, 1)",
      "after": "recurrence next value1 = 12",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "用上一項加明示d，負步長或負項也合法。",
        "en": "Add the declared d to the previous value;negative increments or terms are allowed."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 recurrence next value1，不以小數近似替代。",
          "en": "Recompute recurrence next value1 with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "11",
          "1"
        ],
        "output": "12",
        "label": "recurrence next value1"
      }
    },
    {
      "id": "S004",
      "uses": [
        "G001",
        "S003"
      ],
      "before": "a(0)=11;d=1",
      "after": "a(1)=12",
      "relation": "implies",
      "rule_id": "finite_recurrence_transition",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每一步使用最新前項，不重用初值；這是所求有限前綴的遞推。",
        "en": "Each step uses the latest preceding term,not the initial value again;this constructs the requested finite prefix."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S005",
      "uses": [
        "G001",
        "S004"
      ],
      "before": "recurrence next value2 := sum(12, 1)",
      "after": "recurrence next value2 = 13",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "用上一項加明示d，負步長或負項也合法。",
        "en": "Add the declared d to the previous value;negative increments or terms are allowed."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 recurrence next value2，不以小數近似替代。",
          "en": "Recompute recurrence next value2 with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "12",
          "1"
        ],
        "output": "13",
        "label": "recurrence next value2"
      }
    },
    {
      "id": "S006",
      "uses": [
        "G001",
        "S005"
      ],
      "before": "a(1)=12;d=1",
      "after": "a(2)=13",
      "relation": "implies",
      "rule_id": "finite_recurrence_transition",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每一步使用最新前項，不重用初值；這是所求有限前綴的遞推。",
        "en": "Each step uses the latest preceding term,not the initial value again;this constructs the requested finite prefix."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S007",
      "uses": [
        "G001",
        "S006"
      ],
      "before": "recurrence next value3 := sum(13, 1)",
      "after": "recurrence next value3 = 14",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "用上一項加明示d，負步長或負項也合法。",
        "en": "Add the declared d to the previous value;negative increments or terms are allowed."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 recurrence next value3，不以小數近似替代。",
          "en": "Recompute recurrence next value3 with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "13",
          "1"
        ],
        "output": "14",
        "label": "recurrence next value3"
      }
    },
    {
      "id": "S008",
      "uses": [
        "G001",
        "S007"
      ],
      "before": "a(2)=13;d=1",
      "after": "a(3)=14",
      "relation": "implies",
      "rule_id": "finite_recurrence_transition",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每一步使用最新前項，不重用初值；這是所求有限前綴的遞推。",
        "en": "Each step uses the latest preceding term,not the initial value again;this constructs the requested finite prefix."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S009",
      "uses": [
        "G001",
        "S008"
      ],
      "before": "recurrence next value4 := sum(14, 1)",
      "after": "recurrence next value4 = 15",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "用上一項加明示d，負步長或負項也合法。",
        "en": "Add the declared d to the previous value;negative increments or terms are allowed."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 recurrence next value4，不以小數近似替代。",
          "en": "Recompute recurrence next value4 with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "14",
          "1"
        ],
        "output": "15",
        "label": "recurrence next value4"
      }
    },
    {
      "id": "S010",
      "uses": [
        "G001",
        "S009"
      ],
      "before": "a(3)=14;d=1",
      "after": "a(4)=15",
      "relation": "implies",
      "rule_id": "finite_recurrence_transition",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每一步使用最新前項，不重用初值；這是所求有限前綴的遞推。",
        "en": "Each step uses the latest preceding term,not the initial value again;this constructs the requested finite prefix."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S011",
      "uses": [
        "G001",
        "S010"
      ],
      "before": "recurrence next value5 := sum(15, 1)",
      "after": "recurrence next value5 = 16",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "用上一項加明示d，負步長或負項也合法。",
        "en": "Add the declared d to the previous value;negative increments or terms are allowed."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 recurrence next value5，不以小數近似替代。",
          "en": "Recompute recurrence next value5 with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "15",
          "1"
        ],
        "output": "16",
        "label": "recurrence next value5"
      }
    },
    {
      "id": "S012",
      "uses": [
        "G001",
        "S011"
      ],
      "before": "a(4)=15;d=1",
      "after": "a(5)=16",
      "relation": "implies",
      "rule_id": "finite_recurrence_transition",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每一步使用最新前項，不重用初值；這是所求有限前綴的遞推。",
        "en": "Each step uses the latest preceding term,not the initial value again;this constructs the requested finite prefix."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S013",
      "uses": [
        "G001",
        "S012"
      ],
      "before": "recurrence next value6 := sum(16, 1)",
      "after": "recurrence next value6 = 17",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "用上一項加明示d，負步長或負項也合法。",
        "en": "Add the declared d to the previous value;negative increments or terms are allowed."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 recurrence next value6，不以小數近似替代。",
          "en": "Recompute recurrence next value6 with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "16",
          "1"
        ],
        "output": "17",
        "label": "recurrence next value6"
      }
    },
    {
      "id": "S014",
      "uses": [
        "G001",
        "S013"
      ],
      "before": "a(5)=16;d=1",
      "after": "a(6)=17",
      "relation": "implies",
      "rule_id": "finite_recurrence_transition",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每一步使用最新前項，不重用初值；這是所求有限前綴的遞推。",
        "en": "Each step uses the latest preceding term,not the initial value again;this constructs the requested finite prefix."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S015",
      "uses": [
        "G001",
        "S014"
      ],
      "before": "recurrence next value7 := sum(17, 1)",
      "after": "recurrence next value7 = 18",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "用上一項加明示d，負步長或負項也合法。",
        "en": "Add the declared d to the previous value;negative increments or terms are allowed."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 recurrence next value7，不以小數近似替代。",
          "en": "Recompute recurrence next value7 with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "17",
          "1"
        ],
        "output": "18",
        "label": "recurrence next value7"
      }
    },
    {
      "id": "S016",
      "uses": [
        "G001",
        "S015"
      ],
      "before": "a(6)=17;d=1",
      "after": "a(7)=18",
      "relation": "implies",
      "rule_id": "finite_recurrence_transition",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每一步使用最新前項，不重用初值；這是所求有限前綴的遞推。",
        "en": "Each step uses the latest preceding term,not the initial value again;this constructs the requested finite prefix."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S017",
      "uses": [
        "G001",
        "S016"
      ],
      "before": "recurrence next value8 := sum(18, 1)",
      "after": "recurrence next value8 = 19",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "用上一項加明示d，負步長或負項也合法。",
        "en": "Add the declared d to the previous value;negative increments or terms are allowed."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 recurrence next value8，不以小數近似替代。",
          "en": "Recompute recurrence next value8 with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "18",
          "1"
        ],
        "output": "19",
        "label": "recurrence next value8"
      }
    },
    {
      "id": "S018",
      "uses": [
        "G001",
        "S017"
      ],
      "before": "a(7)=18;d=1",
      "after": "a(8)=19",
      "relation": "implies",
      "rule_id": "finite_recurrence_transition",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每一步使用最新前項，不重用初值；這是所求有限前綴的遞推。",
        "en": "Each step uses the latest preceding term,not the initial value again;this constructs the requested finite prefix."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    }
  ],
  "math_model": {
    "result": [
      11,
      12,
      13,
      14,
      15,
      16,
      17,
      18,
      19
    ]
  },
  "conclusion": {
    "canonical_value": "[11, 12, 13, 14, 15, 16, 17, 18, 19]",
    "explanation": {
      "zh-Hant": "依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。",
      "en": "The full substitutions and premise checks give the original answer; source identity,format and status are unchanged."
    }
  },
  "definition_note": {
    "zh-Hant": "沿用原題明示的論域、假設與來源 MKO 定義。本題已完成第二對話數理與中英語義覆核，並由原始參數逐題獨立重算模型、答案與每個算術步驟；原題仍為 candidate。",
    "en": "Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate."
  },
  "source": {
    "input_commit": "0f7be61e2c22317a4075561dc822c87d881a50db",
    "question_binding": {
      "batch_id": "batch-20261008-advance-20261012-r01-mathematical-induction-foundations",
      "batch_path": "public/data/questions/batches/batch-20261008-advance-20261012-r01-mathematical-induction-foundations/questions.jsonl",
      "batch_sha256": "4ff961382c9b0e9265156817fa51ccd4f7623e1942ae117f50b21701e1edb9f1",
      "original_line": 49,
      "original_line_sha256": "f39b77d85b56e2d28105df8440f90988d0f77f39f2df579db5cf2c5a72d44b98",
      "question_compact_sha256": "425c3f118b4827387d8db3c56a48618910c383c8d00c1b18686d305f6ad69abb",
      "english_row_compact_sha256": "7fe89e8bf783595f1a0140c941f4fe099ad2ec6f2c3fbdfdc78cde325d26fe8a",
      "english_manifest_path": "public/data/i18n/editions/batch-20261008-advance-20261012-r01-mathematical-induction-foundations.en.json",
      "english_rows_path": "public/data/i18n/questions/batch-20261008-advance-20261012-r01-mathematical-induction-foundations.en.jsonl"
    },
    "mko_bindings": {
      "mko-mathematical-induction": {
        "sha256": "53fe3a341f5fa25780e7aa742a25087665b257b3c91a3e4f718b50f368a8dd67",
        "english_sha256": "18d956a6519adafa325420611bdba90cada15d1a1db00caffeca5e4b4979cada",
        "original_path": "public/data/mko/mathematical-induction.json",
        "english_path": "public/data/i18n/editions/mko-mathematical-induction.en.json"
      }
    },
    "selected_manifest_sha256": "5233edba9654a6cffd8b6b2d83c932f82ded15f9c0b7c733bd049943e672acff",
    "selected_part_sha256": "3132b1200be7a5de38191badc52fb1727d4dd9d4c2f26818de2e8a76426d2d3f",
    "original_candidate_sha256": "eb97587aa7e70b8dcd57f80d40e0ff215dec8a06a9031590f834d9ca43af4c6f",
    "original_candidate_line_sha256": "eb97587aa7e70b8dcd57f80d40e0ff215dec8a06a9031590f834d9ca43af4c6f"
  },
  "historical_source_state": {
    "review_state": {
      "derivation": "candidate_authored_and_locally_checked",
      "source_question_state": "candidate",
      "independent_AI_or_human_review": "NOT_PERFORMED",
      "formalization": "not_formalized",
      "Lean": "NOT_RUN"
    },
    "scope_note": {
      "zh-Hant": "來源綁定教學推導候選；精確核對不等於獨立AI／人工審查或一般形式證明。原題、答案、MKO、公式、AST與歷史不變。",
      "en": "Source-bound pedagogical derivation candidate.Exact checking is not independent AI/human review or general formal proof.Original questions,answers,MKOs,formulas,ASTs and history remain unchanged."
    },
    "label": "Frozen producer metadata; current per-question review is separate below."
  },
  "revision": {
    "id": "review-20261026-005-p10",
    "review_date": "2026-10-26",
    "owner_authorized_reader_publication": true,
    "scope": "One hundred sixty family prototypes and their mathematical/bilingual reasoning variants, stems, boundary statements and every distinct explanation shape were reviewed in a context independent of the producer; parameter substitutions, source bindings, full math models, both answer strings and every arithmetic step were independently reconstructed per question from the original parameters only, with negative controls. This grouped method does not claim a separate literal AI reading of every repeated sentence or an extra AI voter.",
    "review_receipts": {
      "semantic_review_sha256": "71e7db519df31f3a164533e472e293cb64f001b475a8d002b4a5c2740a237b56",
      "question_first_witness_sha256": "5a43f4f81b6256281f8d139a4010bbde127be803c528e5878857269c8f854462"
    },
    "status": "second_context_reviewed",
    "mathematical_semantics": true,
    "bilingual_semantics": true,
    "steps_reviewed": 18,
    "method": "family_template_semantic_review_plus_independent_per_instance_reconstruction",
    "exact_question_first_check": {
      "model_sha256": "581caa1f261bc300333c894747beece62c0b53a9aa96476551e04e5a16167fb7",
      "arithmetic_steps": 8
    },
    "uses_answer_as_premise": false,
    "human_review": "NOT_PERFORMED",
    "formalization": "not_formalized",
    "Lean": "NOT_RUN",
    "Canonical_truth_promotion": false,
    "authority": "Owner-authorized reviewed reader publication; original question/candidate states remain historical and unchanged."
  }
}