{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261013-advance-20261021-r06-linear-programming-0049"},"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-0049","number":2449,"title":{"zh-Hant":"第 2449 題：有限線性規劃候選","en":"Question 2449: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","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":"89649f59363d633044b74a1780c21efe72eda17970a625df40fed369227cc5b6","derivation_sha256":"daffcd6c7735e40b5590841fda54b36247aaa78b7d0b4fcbee8527a457d2b627"}]}