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