{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001080658,0.000256105,0.0003392781,0.0001242471,0.002511065,0.00256768,0.003053438,0.00007458877,0.00002436882],"category_scores_gemma":[0.0006975729,0.0001637998,0.0003630291,0.0001433872,0.0002866808,0.0005043403,0.0003566878,0.0004576413,0.00002164479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003955065,"about_ca_system_score_gemma":0.00008701995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003708534,"about_ca_topic_score_gemma":0.000006360838,"domain_scores_codex":[0.998222,0.00005027654,0.0004741376,0.0002711,0.0004881467,0.0004943753],"domain_scores_gemma":[0.9967091,0.0009750159,0.0006808779,0.001251356,0.0001993781,0.0001842464],"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.00005678762,0.0002608185,0.0001301093,0.0001800014,0.0003593282,0.0001144059,0.007361574,0.0001133865,0.0002132493,0.9524121,0.007646826,0.03115138],"study_design_scores_gemma":[0.002053755,0.0005605842,0.001653947,0.0006387714,0.0001074893,0.0006915574,0.001080611,0.3559344,0.0009232662,0.6128197,0.02284969,0.0006862307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01228714,0.0002925707,0.9735327,0.008279321,0.001719523,0.0006421836,0.00002161723,0.00009027169,0.003134717],"genre_scores_gemma":[0.8497682,0.0001713917,0.1478956,0.0006615801,0.0007156909,0.00007068266,0.000002770004,0.00005130994,0.0006627018],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8374811,"threshold_uncertainty_score":0.9987875,"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."}}