{"id":"W4367050013","doi":"10.1007/s10107-023-01961-5","title":"Approximation algorithms for flexible graph connectivity","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Virginia; National Science Foundation","keywords":"Approximation algorithm; Mathematics; Combinatorics; Partition (number theory); Graph; Undirected graph; Algorithm; Efficient algorithm; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001061184,0.0001660837,0.0002463639,0.0002100089,0.0003289944,0.0003201973,0.0006036594,0.0000749048,0.000008829045],"category_scores_gemma":[0.0003002344,0.0001511848,0.0001823269,0.00125633,0.00009157944,0.0003906914,0.0002482978,0.0001257879,0.0001357622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002315161,"about_ca_system_score_gemma":0.00002298426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002859517,"about_ca_topic_score_gemma":8.241307e-7,"domain_scores_codex":[0.9983887,0.00004068646,0.0003006459,0.0004263898,0.0003238559,0.0005197265],"domain_scores_gemma":[0.9986235,0.0006255365,0.00008091582,0.000469415,0.00008703338,0.0001135284],"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.000002107905,0.0001092031,0.000007201526,0.0001658468,0.0000161887,0.000002114182,0.0004132462,0.00002265209,0.00005320343,0.6241329,0.0004471262,0.3746282],"study_design_scores_gemma":[0.0002143461,0.00007015445,0.00002915188,0.00003037919,0.000006031451,0.000008573613,0.00006666464,0.3904129,0.0007394752,0.6044962,0.003770658,0.0001554444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001422867,0.00002042071,0.9938541,0.0006561023,0.0002227325,0.000772924,0.000003526543,0.001936517,0.001110817],"genre_scores_gemma":[0.05250427,0.000002656969,0.9463757,0.00007366495,0.0001124277,0.0005896727,0.00001578073,0.00002231943,0.0003034547],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3903902,"threshold_uncertainty_score":0.6165136,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07737915461578086,"score_gpt":0.3207735815701585,"score_spread":0.2433944269543776,"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."}}