{"id":"W2061275745","doi":"10.1016/j.jctb.2011.06.004","title":"On the maximum size of a minimal k-edge connected augmentation","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Simple (philosophy); Mathematics; Undirected graph; Graph; Generalization; Enhanced Data Rates for GSM Evolution; Connectivity; Vertex connectivity; Simple graph; Degree (music); Discrete mathematics; Computer science; Physics; Artificial intelligence","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.001277891,0.000826095,0.001390347,0.001321898,0.001799849,0.004481089,0.002473491,0.00181467,0.0143857],"category_scores_gemma":[0.009718269,0.001053719,0.001066663,0.001506936,0.002379616,0.006083418,0.002425531,0.001864025,0.001205159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126277,"about_ca_system_score_gemma":0.0008588495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005954729,"about_ca_topic_score_gemma":0.0008998124,"domain_scores_codex":[0.9990032,0.000278782,0.00006655227,0.0002447076,0.000198907,0.0002078443],"domain_scores_gemma":[0.9861587,0.01047656,0.000836438,0.0008985795,0.0005463879,0.001083307],"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.00299029,0.0003599508,0.008468644,0.001201437,0.0001938516,0.000685689,0.001420025,0.05773506,0.0512386,0.8025028,0.0191564,0.05404716],"study_design_scores_gemma":[0.0001967086,0.0002244909,0.003885838,0.0001666567,0.0001910324,0.0009418605,0.0005911539,0.0996943,0.009185796,0.8774692,0.007389653,0.00006339271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8530366,0.0007199844,0.06851745,0.003339786,0.000165447,0.0001556162,0.003031885,0.0007173162,0.07031591],"genre_scores_gemma":[0.9493381,0.0005036007,0.04042671,0.0003748933,0.0001974935,0.0002389026,0.001554665,0.0003034936,0.007062094],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0143857,"threshold_uncertainty_score":0.04812497,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02594006752946061,"score_gpt":0.2665166091183068,"score_spread":0.2405765415888462,"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."}}