{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002530099,0.001688567,0.002379201,0.002387259,0.001413317,0.004205002,0.005698564,0.002704905,0.01012032],"category_scores_gemma":[0.02551363,0.001343457,0.002037754,0.005257165,0.002528783,0.01177166,0.004306864,0.006062068,0.001139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003475751,"about_ca_system_score_gemma":0.001830903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003523927,"about_ca_topic_score_gemma":0.004599803,"domain_scores_codex":[0.9978735,0.0006237122,0.00008997307,0.0005227156,0.0005798659,0.0003101927],"domain_scores_gemma":[0.9856523,0.01047692,0.000798951,0.002010201,0.0005706693,0.0004909216],"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.0002541336,0.0002537881,0.001215778,0.0003300654,0.00009412305,0.0001115218,0.0003650889,0.3805517,0.0008808668,0.5114534,0.01494179,0.08954769],"study_design_scores_gemma":[0.00004195068,0.00002252875,0.0001351367,0.00002770389,0.00002734439,0.00005343095,0.00006071971,0.5721273,0.0002773377,0.425363,0.001852908,0.00001062566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02983806,0.0008614264,0.9563888,0.001718467,0.0001255794,0.0001212229,0.0004156971,0.0006352675,0.009895428],"genre_scores_gemma":[0.5271165,0.001723729,0.4569366,0.0007109176,0.0004873289,0.000523226,0.001628703,0.0006808498,0.01019219],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01012032,"threshold_uncertainty_score":0.0338558,"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."}}