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