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