{"id":"W1764061692","doi":"10.1002/jgt.21882","title":"<i>K</i><sub>4</sub>‐free and ‐free Planar Matching Covered Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Matching (statistics); Subdivision; Graph; Induced subgraph; Factor-critical graph; Conformal map; Line graph; Discrete mathematics; Graph power; Vertex (graph theory); Geometry","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001722002,0.0003602487,0.0003851417,0.0008718179,0.0007915089,0.001167404,0.0007830235,0.0004125554,0.008001586],"category_scores_gemma":[0.0007836721,0.0003258754,0.0005043494,0.0008858062,0.000721645,0.00152159,0.001443689,0.0005414168,0.0007624225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007385018,"about_ca_system_score_gemma":0.0003621132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001939261,"about_ca_topic_score_gemma":0.002116441,"domain_scores_codex":[0.9996074,0.00003762466,0.00002854785,0.00009986314,0.0001057025,0.0001208849],"domain_scores_gemma":[0.9993277,0.0001727236,0.0001532937,0.0001239501,0.000123272,0.00009911725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007202243,0.0002061382,0.01335359,0.0006234749,0.0001394942,0.001258748,0.0006905811,0.04033209,0.06470325,0.7501072,0.01705039,0.1108149],"study_design_scores_gemma":[0.0001240042,0.0002443238,0.02426942,0.0001253723,0.0002987782,0.002967172,0.001441379,0.1103276,0.0695308,0.7039514,0.08656419,0.0001556281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8326295,0.0003477196,0.1087878,0.000459361,0.00005219224,0.0001063121,0.00159295,0.0004106402,0.0556136],"genre_scores_gemma":[0.9615574,0.000178252,0.02660039,0.0001203774,0.00002102776,0.00005949199,0.001878624,0.00006514604,0.009519268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008001586,"threshold_uncertainty_score":0.02676803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02082237696549377,"score_gpt":0.2597374647604382,"score_spread":0.2389150877949445,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}