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