{"id":"W4313598201","doi":"10.48550/arxiv.2301.01394","title":"Large Matchings in Maximal 1-planar graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Graph; Matching (statistics); Discrete mathematics; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001629604,0.0009264722,0.001031478,0.001599987,0.001279399,0.002471589,0.002061479,0.001723066,0.01241263],"category_scores_gemma":[0.01533612,0.0009665847,0.001059998,0.002533528,0.001899996,0.006985615,0.003154111,0.001618358,0.001152018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001617294,"about_ca_system_score_gemma":0.0006796327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001265532,"about_ca_topic_score_gemma":0.001971153,"domain_scores_codex":[0.9980496,0.0003728739,0.0001040054,0.0006303982,0.0004743045,0.0003688028],"domain_scores_gemma":[0.9870522,0.009259598,0.001527137,0.001054992,0.0004509257,0.0006552095],"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.001382527,0.000353419,0.008030634,0.001624922,0.0002141895,0.0009489082,0.001218333,0.1460833,0.04044773,0.6842768,0.01323079,0.1021883],"study_design_scores_gemma":[0.0001360886,0.0001673164,0.002087931,0.0001115153,0.0001234841,0.0006160879,0.000404197,0.12345,0.01886905,0.8409084,0.01307794,0.00004802156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6610229,0.002168937,0.279644,0.003141278,0.0001037379,0.0002365344,0.001458774,0.001527934,0.05069597],"genre_scores_gemma":[0.9027649,0.001129701,0.08490464,0.0005819187,0.0001327514,0.0001971143,0.0015696,0.0003585742,0.008360687],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01241263,"threshold_uncertainty_score":0.04152441,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06873277572545392,"score_gpt":0.1966631349431001,"score_spread":0.1279303592176461,"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."}}