{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0084"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0084","number":11959,"title":{"zh-Hant":"第 11959 題：凸最佳化問題","en":"Question 11959: Compare Only Two Eligible Candidates, Not the Whole Problem"},"family_id":"qf-mod25-convexopt-pairwise-feasible-comparison","batch_id":"batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations","mko_ids":["mko-convex-optimization-problem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"3a46c76979be4672958be320b5b37dc1edccf6f9aa3206f64e0939d3c1b5f30e","derivation_sha256":"86e2bbb8a011d19ee989937edad7146896486f1ab9c8a3be235e7d4764519bb9"}]}