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