{"id":"W2070458953","doi":"10.1016/s0166-218x(02)00572-3","title":"Bounds on the average connectivity of a graph","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Discrete mathematics; Planar graph; Disjoint sets; Cograph; Graph; Clique number; Upper and lower bounds; Split graph; Cartesian product; 1-planar graph; Chordal 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006947717,0.0001342114,0.0002213779,0.00004926077,0.0001384386,0.00008858385,0.0004380987,0.00005252225,0.00003341664],"category_scores_gemma":[0.00006005578,0.00008315063,0.0001001775,0.0002785001,0.00005718902,0.00005949086,0.00005169607,0.0001267181,0.00003817706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001667427,"about_ca_system_score_gemma":0.00002067856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003164665,"about_ca_topic_score_gemma":0.000003399005,"domain_scores_codex":[0.9990198,0.00005195674,0.0002859473,0.0001977793,0.0002550695,0.0001894276],"domain_scores_gemma":[0.9985849,0.0004430158,0.00018283,0.0007098289,0.00004143962,0.00003797475],"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.000001687369,0.00005052208,0.00000457279,0.00002743806,0.00002117884,7.068987e-7,0.00126023,0.0001939149,0.0006208865,0.9970915,0.0005927947,0.0001345476],"study_design_scores_gemma":[0.0006247068,0.0001857727,0.00006179785,0.0001431858,0.00002075722,0.00003775545,0.001417571,0.05975521,0.02948266,0.9017512,0.006022494,0.000496846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04588954,0.00001285769,0.7947844,0.0001285968,0.0002207675,0.0002930702,0.000001901876,0.00005863831,0.1586102],"genre_scores_gemma":[0.9931563,0.000002958403,0.006433009,0.0001796454,0.00002215024,0.00004569168,4.432224e-7,0.0000101037,0.0001496655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9472668,"threshold_uncertainty_score":0.3390784,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01803764479792878,"score_gpt":0.2266575634988209,"score_spread":0.2086199187008921,"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."}}