{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261101-r05-graph-matching-0066"},"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-0066","number":16366,"title":{"zh-Hant":"第 16366 題：圖匹配","en":"Question 16366: 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":"f4cf03925537b2038af7c49946842cd1d4dfbcc79d568348ab3af01da7b91972","derivation_sha256":"034de30bed73bf916341e44666db826e18230146972e727c989fa5ce04ac6cd5"}]}