{"id":"W2103941607","doi":"","title":"Connectivity of Addable Monotone Graph Classes","year":2007,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Monotone polygon; Vertex (graph theory); Discrete mathematics; Graph","routes":{"ca_aff":true,"ca_fund":false,"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.001500894,0.0004614682,0.0007538404,0.002738622,0.001775989,0.00264882,0.00168774,0.001471817,0.006686527],"category_scores_gemma":[0.01853793,0.0005600605,0.0008286826,0.0008979299,0.002632564,0.003918678,0.002707972,0.00170828,0.0003955672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00130047,"about_ca_system_score_gemma":0.0004336148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008011024,"about_ca_topic_score_gemma":0.0008367267,"domain_scores_codex":[0.9976473,0.0005225911,0.0001176198,0.000666836,0.0006876928,0.0003579871],"domain_scores_gemma":[0.9757808,0.01525707,0.003316719,0.001969753,0.001452069,0.002223601],"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.001633959,0.0003823072,0.05839154,0.0004606231,0.0001893204,0.0007777472,0.002367465,0.03328978,0.01861043,0.8168184,0.006540051,0.06053849],"study_design_scores_gemma":[0.0001652733,0.0003429373,0.01439871,0.00009023985,0.0001054751,0.001950701,0.0005351388,0.2533374,0.0058148,0.715741,0.007449242,0.00006902243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9227008,0.0002134849,0.06285781,0.0009335268,0.00002878856,0.0001144149,0.0007018114,0.0002294825,0.01221988],"genre_scores_gemma":[0.9897962,0.0001243634,0.007231596,0.0001574677,0.0001030534,0.0001528804,0.0005930171,0.00004649795,0.001795059],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006686527,"threshold_uncertainty_score":0.02236873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02192203775542063,"score_gpt":0.264636965118337,"score_spread":0.2427149273629164,"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."}}