{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004822704,0.0002592072,0.0004374181,0.0008567865,0.0001941676,0.0002109248,0.002751411,0.0001083248,0.000003020006],"category_scores_gemma":[0.0007621288,0.0002141674,0.0002334456,0.0008427791,0.0003676073,0.001468328,0.0006035481,0.0007157167,0.000009149805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005401503,"about_ca_system_score_gemma":0.0001796014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002682977,"about_ca_topic_score_gemma":0.000005944265,"domain_scores_codex":[0.996887,0.0006882528,0.0005872571,0.0003250099,0.001002725,0.0005097456],"domain_scores_gemma":[0.9966331,0.0007610864,0.0004921685,0.001127366,0.0003984729,0.0005878767],"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.0005169425,0.00009921415,0.0005147879,0.00002542642,0.0001510573,0.0003333273,0.001430813,0.0001035245,0.02066797,0.9578892,0.004623336,0.0136444],"study_design_scores_gemma":[0.001926058,0.0004312932,0.0006373616,0.0000781788,0.00002111833,0.0008707832,0.0003811969,0.00004974389,0.008566918,0.9863925,0.0004053425,0.0002394972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6411283,0.003835075,0.3509604,0.001002459,0.0008497829,0.0001993029,0.00001899689,0.00009667224,0.00190901],"genre_scores_gemma":[0.9778938,0.0005149169,0.02078406,0.0005788169,0.0001445244,0.000004235984,8.735684e-7,0.00004047727,0.00003835306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3367654,"threshold_uncertainty_score":0.8733494,"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."}}