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