{"id":"W2600683609","doi":"10.1137/16m1057486","title":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Minimum degree spanning tree; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Induced subgraph isomorphism problem; Upper and lower bounds; Spanning tree; Subgraph isomorphism problem; Connected dominating set; Discrete mathematics; Graph; Computer science; Line graph; Vertex (graph theory); Voltage graph; Artificial intelligence","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.005374163,0.003145976,0.002482229,0.002750862,0.002176618,0.005745469,0.005139528,0.004099493,0.01783732],"category_scores_gemma":[0.02279148,0.0016147,0.002291841,0.003400986,0.003828095,0.01108035,0.00591897,0.01151295,0.004910459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004655106,"about_ca_system_score_gemma":0.002551838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002446718,"about_ca_topic_score_gemma":0.003176067,"domain_scores_codex":[0.9965652,0.0008368953,0.000106498,0.0007573868,0.001037532,0.0006966051],"domain_scores_gemma":[0.9876467,0.008928653,0.0007465581,0.001137957,0.0006149209,0.0009251164],"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.002384625,0.0007408661,0.002690506,0.001491804,0.0002236944,0.0003891767,0.0008159676,0.1783799,0.01463271,0.6378477,0.06700499,0.09339814],"study_design_scores_gemma":[0.0001506555,0.0002105095,0.001108792,0.0003556417,0.0001179808,0.0003061914,0.0002159725,0.3272094,0.00561213,0.6442412,0.02040585,0.00006569375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2351898,0.01249267,0.5110703,0.02507923,0.001222789,0.0004163855,0.005233581,0.002490874,0.2068045],"genre_scores_gemma":[0.6235845,0.006228426,0.33069,0.008367185,0.001569131,0.000973934,0.005494136,0.001862206,0.02123051],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01783732,"threshold_uncertainty_score":0.05967176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08980382657351924,"score_gpt":0.325023209135156,"score_spread":0.2352193825616367,"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."}}