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