{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007549396,0.00193981,0.001574943,0.001594677,0.001276143,0.00194157,0.004659657,0.00251313,0.01460091],"category_scores_gemma":[0.005250848,0.0008654688,0.001902248,0.002867793,0.000885759,0.004726346,0.003842392,0.003997587,0.003273888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001778194,"about_ca_system_score_gemma":0.001754047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003123574,"about_ca_topic_score_gemma":0.005414509,"domain_scores_codex":[0.9985982,0.0002001292,0.00007186474,0.0004342194,0.0003978785,0.0002977043],"domain_scores_gemma":[0.9977357,0.0008623325,0.0001787434,0.0008315074,0.0001940293,0.0001976875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001157072,0.001126547,0.002061747,0.0008384746,0.0002191525,0.0005242327,0.0005102544,0.2664905,0.02065909,0.1108752,0.08048835,0.5150493],"study_design_scores_gemma":[0.0003788539,0.0003266297,0.000876258,0.0000668573,0.0001078368,0.0007163789,0.000207273,0.8078965,0.006988957,0.1593505,0.02301643,0.00006758188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04760933,0.0007503149,0.9187018,0.002524428,0.0003358579,0.0005094092,0.00173643,0.004928472,0.02290403],"genre_scores_gemma":[0.2503927,0.000467947,0.731289,0.0009044757,0.0001957826,0.0007280504,0.004178105,0.0007618734,0.011082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01460091,"threshold_uncertainty_score":0.04884487,"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."}}