{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261020-r04-optimization-problem-0081"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261020-r04-optimization-problem-0081","number":29881,"title":{"zh-Hant":"第 29881 題：有限候選最佳化","en":"Question 29881: A Linear Constraint on a Complete Ordered Finite Point List"},"family_id":"qf-app20-optimization-linear-constraint-audit","batch_id":"batch-20261013-advance-20261020-r04-optimization-problem-foundations","mko_ids":["mko-optimization-problem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"5b352b248abbbe5b0560b8cfdb6ffda02036e6dd8f50a9193296343319f454c2","derivation_sha256":"e094bba84e7b1b574b92dd7a608bbf625dc96af5732ff13150dd94cc3975ed82"}]}