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