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