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