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