{"id":"W2403593319","doi":"","title":"Extending matchings in planar odd graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar; Planar graph; Graph; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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.0006224597,0.0005020784,0.0005120575,0.001477567,0.001258215,0.001667254,0.001018942,0.0009267026,0.009209313],"category_scores_gemma":[0.003981816,0.0004275858,0.0008957347,0.00174288,0.001557346,0.00582772,0.003683292,0.001851594,0.001914626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008303074,"about_ca_system_score_gemma":0.0004341485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001272253,"about_ca_topic_score_gemma":0.001551527,"domain_scores_codex":[0.9993649,0.0001716155,0.00004344097,0.0001660106,0.0001231595,0.0001307934],"domain_scores_gemma":[0.9982514,0.0007286856,0.0002122131,0.0004344855,0.0001767863,0.0001964617],"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.00007172803,0.00004514004,0.000553351,0.0001346062,0.00001265916,0.0001875279,0.000316456,0.001920742,0.002287524,0.9440045,0.003729552,0.0467363],"study_design_scores_gemma":[0.00001155985,0.00001919812,0.0002174497,0.00002876311,0.00001590022,0.0002056428,0.0001229096,0.003490816,0.0007886066,0.9762449,0.01884558,0.000008683567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3087489,0.004175524,0.3854873,0.003104595,0.001112277,0.0001969106,0.0009851377,0.001786715,0.2944028],"genre_scores_gemma":[0.831605,0.003057241,0.1190194,0.0009631199,0.0004901705,0.0001089236,0.001059167,0.0004952382,0.0432017],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009209313,"threshold_uncertainty_score":0.03080821,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02904241576714631,"score_gpt":0.2952516997471866,"score_spread":0.2662092839800403,"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."}}