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