{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261106-r06-linear-diophantine-equation-0012"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261014-advance-20261106-r06-linear-diophantine-equation-0012","number":19687,"title":{"zh-Hant":"第 19687 題：線性Diophantine方程","en":"Question 19687: Gcd Divisibility Is the Nondegenerate Integer-Solvability Criterion"},"family_id":"qf-mod37-dioph-solvability","batch_id":"batch-20261014-advance-20261106-r06-linear-diophantine-equation-foundations","mko_ids":["mko-linear-diophantine-equation"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"1058ea2f1812e02100c0103e01bf27bdfc8b5348fdeb7da30b0fa8160de11ed6","derivation_sha256":"f23adaba930b85aca1634b1cb34561d5324a9eee8a8f4d31483d5fc9b5fb35db"}]}