{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261021-r06-linear-programming-0022"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0022","number":2422,"title":{"zh-Hant":"第 2422 題：有限線性規劃候選","en":"Question 2422: Every Constraint at One Declared Point"},"family_id":"qf-app21-lp-constraint-row-audit","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"74c209ed6133397fcceb529e5cf271f461c2ba277f9b921d1d2f868ba2f68f24","derivation_sha256":"c7ebba14ff7ec524b1c075345633c0ad7d5894c32f474d6acef767f8ef7a099f"}]}