{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002041121,0.002353422,0.001663336,0.002271264,0.001735024,0.00351269,0.003940891,0.002416683,0.01471569],"category_scores_gemma":[0.01461441,0.0008536177,0.001857194,0.00549448,0.00409835,0.01633979,0.004670883,0.005833077,0.001625017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004009573,"about_ca_system_score_gemma":0.001159012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002596595,"about_ca_topic_score_gemma":0.001938147,"domain_scores_codex":[0.9968758,0.000778059,0.0001525523,0.0008083036,0.000910831,0.0004743882],"domain_scores_gemma":[0.9874507,0.00967703,0.0006132225,0.001357955,0.0005600987,0.0003410152],"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.000458894,0.0001827338,0.001301863,0.0009914634,0.0001113165,0.0003161611,0.000615511,0.2331529,0.004482327,0.6442579,0.01938668,0.09474223],"study_design_scores_gemma":[0.00005890894,0.0001580029,0.0005522266,0.0001716007,0.00005149087,0.0004997732,0.0002092371,0.2693877,0.002312205,0.7021196,0.02444294,0.00003629773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05725436,0.005355964,0.8780729,0.007424013,0.0004201566,0.000412492,0.00180637,0.001029746,0.04822404],"genre_scores_gemma":[0.5560172,0.01432022,0.3984624,0.002397736,0.002163569,0.001190187,0.004156226,0.0008312754,0.02046104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01471569,"threshold_uncertainty_score":0.04922891,"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."}}