{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261101-r05-graph-matching-0051"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261014-advance-20261101-r05-graph-matching-0051","number":16351,"title":{"zh-Hant":"第 16351 題：圖匹配","en":"Question 16351: A Maximal Matching May Still Have Smaller Cardinality than Another Matching"},"family_id":"qf-mod32-matching-maximality-audit","batch_id":"batch-20261014-advance-20261101-r05-graph-matching-foundations","mko_ids":["mko-graph-matching"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"99e3f7275ff621acdf10dc5b6ed40e479994f0087618a89f48926090f02cad89","derivation_sha256":"9f1fe233f597449cea0fec87b6e94cd104947d2fe75a3f3dfdb0f6caefba20dc"}]}