{"id":"W3216441663","doi":"","title":"A $2$-Approximation Algorithm for Flexible Graph Connectivity","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"","keywords":"Computer science; Approximation algorithm; Algorithm; Theoretical computer science","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.0002156414,0.0001414775,0.0001737726,0.0001415794,0.0003061794,0.0001057904,0.0005614432,0.00007309816,0.00002547352],"category_scores_gemma":[0.00004161799,0.0001710501,0.0001889896,0.001279561,0.00007466047,0.0006952074,0.0002558892,0.0001156714,0.00002120132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005501281,"about_ca_system_score_gemma":0.0001046935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002290338,"about_ca_topic_score_gemma":0.00002240506,"domain_scores_codex":[0.9988005,0.00007824231,0.0001136612,0.0006438267,0.00006933471,0.0002944114],"domain_scores_gemma":[0.9987959,0.0002012539,0.00007559752,0.0005833571,0.0002375578,0.0001063689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007038092,0.0001691103,0.0001941093,0.00001877394,0.00004481795,0.00008187143,0.0001076405,0.00186651,0.0001673667,0.9475541,0.0003383666,0.04945034],"study_design_scores_gemma":[0.0006079993,0.00005323135,0.0003781207,0.00001072602,0.00001494045,0.00001450925,0.00006773532,0.6927648,0.003429698,0.3004741,0.001983008,0.0002011794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01656588,0.00004301336,0.980913,0.0001470251,0.0003566311,0.0001732552,0.00001650036,0.0003095802,0.001475085],"genre_scores_gemma":[0.8245444,0.0000395322,0.1732457,0.0002336079,0.00008207888,0.000003276313,0.00001961017,0.00001179871,0.001820028],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8079785,"threshold_uncertainty_score":0.6975221,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07365225862169666,"score_gpt":0.1985476314444734,"score_spread":0.1248953728227767,"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."}}