{"id":"W1554467813","doi":"","title":"On Survivable Set Connectivity","year":2015,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Discrete mathematics; Disjoint sets; Time complexity; Path (computing); Node (physics); Set (abstract data type); Undirected graph; Reduction (mathematics); Set cover problem; Graph; Computer science; Computer network","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.0003652102,0.00006638673,0.00008115949,0.00004894194,0.00005880399,0.00008970503,0.0004768374,0.00002327534,0.00003978375],"category_scores_gemma":[0.00007303216,0.00005553598,0.00003026504,0.0002567797,0.00002513772,0.0002351546,0.0001757101,0.00007442977,0.0002670609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001979123,"about_ca_system_score_gemma":0.0000404204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001502719,"about_ca_topic_score_gemma":0.00003682475,"domain_scores_codex":[0.9993115,0.00005154633,0.00006551827,0.0002113299,0.0002021925,0.0001578809],"domain_scores_gemma":[0.9992565,0.0001478581,0.00001729418,0.0004162251,0.00005184357,0.0001102685],"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.000002481677,0.00004559854,0.00019178,9.469191e-7,0.000003547148,0.000005493167,0.0001129869,0.00008596399,0.000006020797,0.9756366,0.01701048,0.006898126],"study_design_scores_gemma":[0.0005306109,0.0002887645,0.001282014,0.000006287918,0.000001180154,0.00001490085,0.00005262705,0.1375438,0.001698863,0.8307436,0.02758604,0.0002513447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04559575,0.00001459617,0.7923884,0.001066581,0.0006540886,0.00006847094,0.000002048969,0.0003439232,0.1598661],"genre_scores_gemma":[0.9720374,7.128244e-7,0.02579317,0.0007765134,0.00003946887,0.00000349324,9.24119e-7,0.000003061118,0.001345304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9264416,"threshold_uncertainty_score":0.3432616,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08869594552647594,"score_gpt":0.2866805072558247,"score_spread":0.1979845617293488,"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."}}