{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0053"},"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-0053","number":11928,"title":{"zh-Hant":"第 11928 題：凸最佳化問題","en":"Question 11928: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"133517413d624f4ee04dd6467bc14afbd451080c8be811e2aecfa0676de19aad","derivation_sha256":"175963aac2e8e4299e4e30de289efe1e01e3e81e255156ae6fe373cadc8118ff"}]}