{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0085"},"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-0085","number":11960,"title":{"zh-Hant":"第 11960 題：凸最佳化問題","en":"Question 11960: 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":"80878debe6b7845e31459a41e1a52e943d6351cae0c1127ee29dc0fee5b8c888","derivation_sha256":"5b0687ddae430531470c2e29190ee08d8d4e9d86c20deceb6dcf63747eb71d47"}]}