{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0011"},"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-0011","number":11986,"title":{"zh-Hant":"第 11986 題：凸最佳化問題","en":"Question 11986: Separate a Quadratic Objective Certificate from Feasible-Interval Qualification"},"family_id":"qf-mod25-convexopt-problem-qualification","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":"5afd4079ccd7022637921e025b58f27a9946271104ee6e63334501b28172446d","derivation_sha256":"f71d895f053279b6f64f2f4b88dd838cdcb6135d0f25d85a9dc91fe173a32b6f"}]}