{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0019"},"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-0019","number":11994,"title":{"zh-Hant":"第 11994 題：凸最佳化問題","en":"Question 11994: 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":"54008ee9aeea72cc317941c13403b3e6dadaf2657ebf26f7feaf69946495f86b","derivation_sha256":"611dac687c255233c6a8f8ccb24e0c2b7effe31b7bbad5c1763fa9fe017583cf"}]}