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