{"id":"W4221140790","doi":"10.4230/lipics.fsttcs.2021.9","title":"Approximation Algorithms for Flexible Graph Connectivity","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Virginia; National Science Foundation","keywords":"Approximation algorithm; Combinatorics; Mathematics; Partition (number theory); Graph; Undirected graph; Efficient algorithm; Algorithm; Discrete mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000405062,0.0002214404,0.0002773294,0.0002592764,0.0002140417,0.0003207624,0.001032525,0.0002390361,0.00002804444],"category_scores_gemma":[0.00006672843,0.0002692291,0.0002366762,0.0007079324,0.00006374966,0.0006237886,0.001085747,0.0003331124,0.00001279359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001331015,"about_ca_system_score_gemma":0.0002869846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006186685,"about_ca_topic_score_gemma":0.00002005007,"domain_scores_codex":[0.9982397,0.000149833,0.0001660903,0.001023102,0.0001006902,0.0003205639],"domain_scores_gemma":[0.998209,0.0001408199,0.0001781269,0.0008854783,0.0004391262,0.0001474428],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000138223,0.0001720166,0.0002232731,0.000182903,0.00008675517,0.00003155158,0.0003635059,0.6403995,0.00004167623,0.3554687,0.0003798847,0.002636418],"study_design_scores_gemma":[0.0004976362,0.00004161469,0.0001195647,0.00004470566,0.00001956377,0.00000188662,0.00007510378,0.9335122,0.0004566173,0.06463597,0.0002974003,0.0002977529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008657333,0.00003910196,0.9878636,0.0001914437,0.0005249979,0.0006559425,0.00001738431,0.0003990873,0.0016511],"genre_scores_gemma":[0.8979012,0.0001616199,0.09943159,0.0001430434,0.00006279744,0.00001050227,0.0001203183,0.00002018103,0.002148773],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8892438,"threshold_uncertainty_score":0.999976,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1280277299512267,"score_gpt":0.2260955558256556,"score_spread":0.09806782587442894,"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."}}