{"id":"W2985832939","doi":"10.1002/jgt.22736","title":"Matchings in 1‐planar graphs with large minimum degree","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Degree (music); Mathematics; Planar graph; Planar; Matching (statistics); 1-planar graph; Discrete mathematics; Graph; Chordal graph; Computer science; Physics; Statistics","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.0009061369,0.0006106092,0.0009404522,0.001829434,0.001182372,0.001635388,0.001569787,0.001549161,0.006342292],"category_scores_gemma":[0.008257782,0.0007765242,0.0006251885,0.002186229,0.001265006,0.004250363,0.002178132,0.001145191,0.0006310951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001139936,"about_ca_system_score_gemma":0.0004746547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001389084,"about_ca_topic_score_gemma":0.001948463,"domain_scores_codex":[0.9989451,0.00020421,0.00005841348,0.0003333136,0.0002359557,0.0002230824],"domain_scores_gemma":[0.992939,0.004310726,0.001511517,0.0004178774,0.0003913312,0.0004294712],"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.001249308,0.0004016196,0.01292505,0.001275781,0.0002544022,0.001541952,0.001219331,0.2431698,0.06185408,0.5865275,0.008970058,0.08061115],"study_design_scores_gemma":[0.0001860297,0.0002138778,0.005125814,0.0001119867,0.0001454885,0.001198532,0.0005921864,0.2092692,0.01870954,0.7532513,0.01111728,0.00007887713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8414418,0.001641447,0.1321674,0.002396265,0.0000707299,0.0001423446,0.0006875579,0.0004854343,0.0209671],"genre_scores_gemma":[0.9523969,0.0009618149,0.04223537,0.0003446401,0.00007163082,0.00009050348,0.0003852071,0.00008973822,0.003424256],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006342292,"threshold_uncertainty_score":0.02121711,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02410745607518017,"score_gpt":0.2847914829143302,"score_spread":0.26068402683915,"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."}}