{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261013-advance-20261021-r06-linear-programming-0034"},"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-0034","number":2434,"title":{"zh-Hant":"第 2434 題：有限線性規劃候選","en":"Question 2434: 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":"533341e9eed39d9c7e3ad3f4684886fb56883d702d03c311c18aeefb42ea6402","derivation_sha256":"b009cf5e8cf8c8cce099f995b23cb13e062d7920c8bda778fbf93d9a79b9ab3a"}]}