{
  "schema_version": "ocme-reviewed-question-reader-v1",
  "question_id": "q-20261012-advance-20261017-r05-graph-0010",
  "pilot_number": "R0015-08010",
  "number": 8010,
  "family_id": "qf-density17-graph-adjacency-degrees",
  "title": {
    "zh-Hant": "第 8010 題：完整鄰接矩陣與握手數",
    "en": "Question 8010: Complete Adjacency Matrix, Degrees, and Handshake Counts"
  },
  "original_question": {
    "schema_version": "ocme-question-v0.1",
    "id": "q-20261012-advance-20261017-r05-graph-0010",
    "batch_id": "batch-20261012-advance-20261017-r05-graph-foundations",
    "language": "zh-Hant",
    "source_mko_ids": [
      "mko-graph"
    ],
    "title_zh": "完整鄰接矩陣與握手數",
    "stem_zh": "簡單無向圖，Fin頂點從0起。V=Fin(5)=[0, 1, 2, 3, 4]，無向邊列項=[[0, 3]]；各邊兩端皆合法且相異。答 (n, 正規邊集, 按全部頂點索引的布林鄰接矩陣, 度數向量, 度數和, 兩倍邊數)。",
    "answer": {
      "kind": "expression",
      "value": "(5, [[0, 3]], [[否, 否, 否, 是, 否], [否, 否, 否, 否, 否], [否, 否, 否, 否, 否], [是, 否, 否, 否, 否], [否, 否, 否, 否, 否]], [1, 0, 0, 1, 0], 2, 2)",
      "explanation_zh": "離散結構核對=(5, [[0, 3]], [[否, 否, 否, 是, 否], [否, 否, 否, 否, 否], [否, 否, 否, 否, 否], [是, 否, 否, 否, 否], [否, 否, 否, 否, 否]], [1, 0, 0, 1, 0], 2, 2)；每條無向邊加入兩個鄰居位置，再逐頂點計不同鄰居。；有限精確核對不是一般形式證明；無自環端點已合型；反向或重複邊不增加邊；不由畫法推相鄰。"
    },
    "difficulty": {
      "band": "undergraduate_core",
      "level": 2,
      "skills": [
        "完整鄰接矩陣與握手數"
      ]
    },
    "variant": {
      "family_id": "qf-density17-graph-adjacency-degrees",
      "seed": 202610175010,
      "parameters": {
        "n": 5,
        "edges": [
          [
            0,
            3
          ]
        ],
        "domain": "Fin_simple_undirected_graph",
        "operation": "graph-adjacency-degrees",
        "semantic_template": "qf-density17-graph-adjacency-degrees/{\"edges\":[[0,3]],\"n\":5}"
      }
    },
    "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-12",
      "contract_version": "ocme-question-factory-v0.1"
    }
  },
  "original_english_edition": {
    "schema_version": "ocme-question-localization-v0.1",
    "question_id": "q-20261012-advance-20261017-r05-graph-0010",
    "batch_id": "batch-20261012-advance-20261017-r05-graph-foundations",
    "locale": "en",
    "translation_state": "ai_candidate",
    "source": {
      "question_sha256": "6405db083616144e5d53cfb6e7661c025ca4881d74e0c07ad4312a02f06c11d6",
      "family_id": "qf-density17-graph-adjacency-degrees",
      "seed": 202610175010,
      "semantic_template": "qf-density17-graph-adjacency-degrees/{\"edges\":[[0,3]],\"n\":5}"
    },
    "fields": {
      "title": "Complete Adjacency Matrix, Degrees, and Handshake Counts",
      "stem": "Use a complete simple undirected graph on Fin(5)={0,…,4} with raw edges=[[0, 3]]. Endpoints are typed and loops are prohibited. Reversed or repeated edges count once; normalize endpoints and edge order. Do not infer adjacency from a drawing. Give (n, normalized edges, Boolean adjacency matrix, degree list, degree sum, twice the edge count).",
      "answer": {
        "kind": "expression",
        "value": "(5, [[0, 3]], [[No, No, No, Yes, No], [No, No, No, No, No], [No, No, No, No, No], [Yes, No, No, No, No], [No, No, No, No, No]], [1, 0, 0, 1, 0], 2, 2)",
        "explanation": "Read the complete symmetric adjacency relation and count each distinct undirected edge once; this is not a connectivity or tree test. These exact finite checks are not new general formal Evidence. The exact result, retaining the requested order, is (5, [[0, 3]], [[No, No, No, Yes, No], [No, No, No, No, No], [No, No, No, No, No], [Yes, No, No, No, No], [No, No, No, No, No]], [1, 0, 0, 1, 0], 2, 2)."
      },
      "skills": [
        "Complete Adjacency Matrix, Degrees, and Handshake Counts"
      ],
      "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": "簡單無向圖，Fin頂點從0起。V=Fin(5)=[0, 1, 2, 3, 4]，無向邊列項=[[0, 3]]；各邊兩端皆合法且相異。答 (n, 正規邊集, 按全部頂點索引的布林鄰接矩陣, 度數向量, 度數和, 兩倍邊數)。",
        "en": "Use a complete simple undirected graph on Fin(5)={0,…,4} with raw edges=[[0, 3]]. Endpoints are typed and loops are prohibited. Reversed or repeated edges count once; normalize endpoints and edge order. Do not infer adjacency from a drawing. Give (n, normalized edges, Boolean adjacency matrix, degree list, degree sum, twice the edge count)."
      }
    }
  ],
  "steps": [
    {
      "id": "S001",
      "uses": [
        "G001"
      ],
      "before": "n=5;raw edges=[[0, 3]]",
      "after": "canonical edges=[[0, 3]]",
      "relation": "implies",
      "rule_id": "simple_graph_edge_normalization",
      "conditions": [],
      "explanation": {
        "zh-Hant": "整張簡單無向圖先查端點合型且無自環；邊兩端排序、反向與重複邊只算一次，不以畫法猜相鄰。",
        "en": "Validate every simple undirected edge for typed distinct endpoints.Sort endpoints and count reversed or repeated edges once;do not infer adjacency from a drawing."
      },
      "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": "phase=original;vertex=0;all edges=[[0, 3]]",
      "after": "neighbors=[3];degree=1",
      "relation": "implies",
      "rule_id": "complete_graph_neighbor_inventory",
      "conditions": [],
      "explanation": {
        "zh-Hant": "掃描所有正規邊，只有以本頂點為端點的邊才給一個不同鄰居；原頂點標籤保留。",
        "en": "Scan all canonical edges.An incident edge contributes its other endpoint as a distinct neighbor.Keep original vertex labels."
      },
      "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": "phase=original;vertex=1;all edges=[[0, 3]]",
      "after": "neighbors=[];degree=0",
      "relation": "implies",
      "rule_id": "complete_graph_neighbor_inventory",
      "conditions": [],
      "explanation": {
        "zh-Hant": "掃描所有正規邊，只有以本頂點為端點的邊才給一個不同鄰居；原頂點標籤保留。",
        "en": "Scan all canonical edges.An incident edge contributes its other endpoint as a distinct neighbor.Keep original vertex labels."
      },
      "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": "S004",
      "uses": [
        "G001",
        "S003"
      ],
      "before": "phase=original;vertex=2;all edges=[[0, 3]]",
      "after": "neighbors=[];degree=0",
      "relation": "implies",
      "rule_id": "complete_graph_neighbor_inventory",
      "conditions": [],
      "explanation": {
        "zh-Hant": "掃描所有正規邊，只有以本頂點為端點的邊才給一個不同鄰居；原頂點標籤保留。",
        "en": "Scan all canonical edges.An incident edge contributes its other endpoint as a distinct neighbor.Keep original vertex labels."
      },
      "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": "phase=original;vertex=3;all edges=[[0, 3]]",
      "after": "neighbors=[0];degree=1",
      "relation": "implies",
      "rule_id": "complete_graph_neighbor_inventory",
      "conditions": [],
      "explanation": {
        "zh-Hant": "掃描所有正規邊，只有以本頂點為端點的邊才給一個不同鄰居；原頂點標籤保留。",
        "en": "Scan all canonical edges.An incident edge contributes its other endpoint as a distinct neighbor.Keep original vertex labels."
      },
      "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": "S006",
      "uses": [
        "G001",
        "S005"
      ],
      "before": "phase=original;vertex=4;all edges=[[0, 3]]",
      "after": "neighbors=[];degree=0",
      "relation": "implies",
      "rule_id": "complete_graph_neighbor_inventory",
      "conditions": [],
      "explanation": {
        "zh-Hant": "掃描所有正規邊，只有以本頂點為端點的邊才給一個不同鄰居；原頂點標籤保留。",
        "en": "Scan all canonical edges.An incident edge contributes its other endpoint as a distinct neighbor.Keep original vertex labels."
      },
      "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": "vertex=0;ordered targets=[0, 1, 2, 3, 4];neighbors=[3]",
      "after": "adjacency row=[否, 否, 否, 是, 否]",
      "relation": "implies",
      "rule_id": "complete_boolean_adjacency_row",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每格布林值表示正規邊是否存在，對角皆假且矩陣對稱；不當作可達矩陣。",
        "en": "Each Boolean entry records edge adjacency.The diagonal is false and the matrix is symmetric;this is not a reachability matrix."
      },
      "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": "S008",
      "uses": [
        "G001",
        "S007"
      ],
      "before": "vertex=1;ordered targets=[0, 1, 2, 3, 4];neighbors=[]",
      "after": "adjacency row=[否, 否, 否, 否, 否]",
      "relation": "implies",
      "rule_id": "complete_boolean_adjacency_row",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每格布林值表示正規邊是否存在，對角皆假且矩陣對稱；不當作可達矩陣。",
        "en": "Each Boolean entry records edge adjacency.The diagonal is false and the matrix is symmetric;this is not a reachability matrix."
      },
      "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": "vertex=2;ordered targets=[0, 1, 2, 3, 4];neighbors=[]",
      "after": "adjacency row=[否, 否, 否, 否, 否]",
      "relation": "implies",
      "rule_id": "complete_boolean_adjacency_row",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每格布林值表示正規邊是否存在，對角皆假且矩陣對稱；不當作可達矩陣。",
        "en": "Each Boolean entry records edge adjacency.The diagonal is false and the matrix is symmetric;this is not a reachability matrix."
      },
      "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": "S010",
      "uses": [
        "G001",
        "S009"
      ],
      "before": "vertex=3;ordered targets=[0, 1, 2, 3, 4];neighbors=[0]",
      "after": "adjacency row=[是, 否, 否, 否, 否]",
      "relation": "implies",
      "rule_id": "complete_boolean_adjacency_row",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每格布林值表示正規邊是否存在，對角皆假且矩陣對稱；不當作可達矩陣。",
        "en": "Each Boolean entry records edge adjacency.The diagonal is false and the matrix is symmetric;this is not a reachability matrix."
      },
      "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": "vertex=4;ordered targets=[0, 1, 2, 3, 4];neighbors=[]",
      "after": "adjacency row=[否, 否, 否, 否, 否]",
      "relation": "implies",
      "rule_id": "complete_boolean_adjacency_row",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每格布林值表示正規邊是否存在，對角皆假且矩陣對稱；不當作可達矩陣。",
        "en": "Each Boolean entry records edge adjacency.The diagonal is false and the matrix is symmetric;this is not a reachability matrix."
      },
      "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": "S012",
      "uses": [
        "G001",
        "S011"
      ],
      "before": "degree sum := sum(1, 0, 0, 1, 0)",
      "after": "degree sum = 2",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "按本步指定順序精確代入原數據，分母非零才允許除法。",
        "en": "Substitute the source data exactly in the stated operand order;division requires a nonzero denominator."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 degree sum，不以小數近似替代。",
          "en": "Recompute degree sum with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "1",
          "0",
          "0",
          "1",
          "0"
        ],
        "output": "2",
        "label": "degree sum"
      }
    },
    {
      "id": "S013",
      "uses": [
        "G001",
        "S012"
      ],
      "before": "twice distinct edge count := mul(2, 1)",
      "after": "twice distinct edge count = 2",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "按本步指定順序精確代入原數據，分母非零才允許除法。",
        "en": "Substitute the source data exactly in the stated operand order;division requires a nonzero denominator."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 twice distinct edge count，不以小數近似替代。",
          "en": "Recompute twice distinct edge count with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "mul",
        "inputs": [
          "2",
          "1"
        ],
        "output": "2",
        "label": "twice distinct edge count"
      }
    },
    {
      "id": "S014",
      "uses": [
        "G001",
        "S013"
      ],
      "before": "degrees=[1, 0, 0, 1, 0];edge count=1",
      "after": "sum=2;2|E|=2",
      "relation": "implies",
      "rule_id": "handshake_each_edge_two_ends",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每條無向非自環邊對兩端各貢獻1，因此度和為兩倍正規邊數；這不是樹或連通判準。",
        "en": "Each undirected nonloop edge contributes1 at each endpoint,so the degree sum is twice the canonical edge count.This does not test connectedness or treehood."
      },
      "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": [
      5,
      [
        [
          0,
          3
        ]
      ],
      [
        [
          false,
          false,
          false,
          true,
          false
        ],
        [
          false,
          false,
          false,
          false,
          false
        ],
        [
          false,
          false,
          false,
          false,
          false
        ],
        [
          true,
          false,
          false,
          false,
          false
        ],
        [
          false,
          false,
          false,
          false,
          false
        ]
      ],
      [
        1,
        0,
        0,
        1,
        0
      ],
      "2",
      "2"
    ]
  },
  "conclusion": {
    "canonical_value": "(5, [[0, 3]], [[否, 否, 否, 是, 否], [否, 否, 否, 否, 否], [否, 否, 否, 否, 否], [是, 否, 否, 否, 否], [否, 否, 否, 否, 否]], [1, 0, 0, 1, 0], 2, 2)",
    "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-20261012-advance-20261017-r05-graph-foundations",
      "batch_path": "public/data/questions/batches/batch-20261012-advance-20261017-r05-graph-foundations/questions.jsonl",
      "batch_sha256": "a86da678771d2977669cd5e9bbbbc7d4a9dde189d293af5c1f2efa0ba35b82ce",
      "original_line": 10,
      "original_line_sha256": "2635562bbbd753bc56a9d403d5ba94b3b1e7102e5ddd3e0274e4baa161e0c96a",
      "question_compact_sha256": "6405db083616144e5d53cfb6e7661c025ca4881d74e0c07ad4312a02f06c11d6",
      "english_row_compact_sha256": "2445fe79800078c414cf398b0e4223a1a43ac57b56b2fc0c90f30a21f340006d",
      "english_manifest_path": "public/data/i18n/editions/batch-20261012-advance-20261017-r05-graph-foundations.en.json",
      "english_rows_path": "public/data/i18n/questions/batch-20261012-advance-20261017-r05-graph-foundations.en.jsonl"
    },
    "mko_bindings": {
      "mko-graph": {
        "sha256": "47d40107cd3836bb878ae46e5c4766288abb1b91e480c38ed14f61f749d27d55",
        "english_sha256": "985d93ed708f51da0e885228658ca76c7075f5bf67bb09b35d10745db33dc847",
        "original_path": "public/data/mko/graph.json",
        "english_path": "public/data/i18n/editions/mko-graph.en.json"
      }
    },
    "selected_manifest_sha256": "5233edba9654a6cffd8b6b2d83c932f82ded15f9c0b7c733bd049943e672acff",
    "selected_part_sha256": "ca1078dc467a0f3769865919aadc46c87712d098f1dfbde90f787471e22bcfec",
    "original_candidate_sha256": "1b73f1447d175406a2877b9f16b239704481b53c4d9eae203f029efbcce218a6",
    "original_candidate_line_sha256": "1b73f1447d175406a2877b9f16b239704481b53c4d9eae203f029efbcce218a6"
  },
  "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-p16",
    "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": "6ecad9d909199221a07e923f87425e80b3bdec3eed46fe5910d04fca694cae18",
      "question_first_witness_sha256": "e8f00458977a09493b5f9f05ab9e6feec72debaf4c7d1c609d1fc95900a35a1b"
    },
    "status": "second_context_reviewed",
    "mathematical_semantics": true,
    "bilingual_semantics": true,
    "steps_reviewed": 14,
    "method": "family_template_semantic_review_plus_independent_per_instance_reconstruction",
    "exact_question_first_check": {
      "model_sha256": "fcd889b578e00a878ea66751151e5ca7feca129134bd6a8175c5d465157f39dc",
      "arithmetic_steps": 2
    },
    "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."
  }
}