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