{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261106-r06-linear-diophantine-equation-0018"},"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-0018","number":19693,"title":{"zh-Hant":"第 19693 題：線性Diophantine方程","en":"Question 19693: 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":"e9d7893fcd920f51ddd998ae3b52c80ae0ce422b97d1d7992bc4988ced2bbe02","derivation_sha256":"0890e153ed32667626609c1fa3661728c88588f9e9550dd3f88f2bc84c6dea2c"}]}