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