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