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