{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0021"},"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-0021","number":11996,"title":{"zh-Hant":"第 11996 題：凸最佳化問題","en":"Question 11996: 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":"1eaa6d7b23c942e66e67b3f16c1850b45942efdb7595625a4f61de6974b3d051","derivation_sha256":"240319c9940c5cfa0efadd7464af5bd72cdb71504077f1ce78638a585b47d637"}]}