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