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