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