{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001735271,0.001923868,0.001710817,0.001818773,0.001041756,0.002446245,0.003833414,0.002631126,0.008223356],"category_scores_gemma":[0.01258187,0.0008378772,0.002152682,0.004016663,0.001240193,0.005833047,0.002768432,0.003554099,0.001437699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003175559,"about_ca_system_score_gemma":0.001554835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004958863,"about_ca_topic_score_gemma":0.005790219,"domain_scores_codex":[0.9977993,0.0005278158,0.0001016575,0.0005789533,0.000596381,0.0003958166],"domain_scores_gemma":[0.9950792,0.00295525,0.0004291956,0.000985631,0.0003663364,0.0001844411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003520685,0.0002232937,0.001234667,0.0003373171,0.0001485924,0.0001487322,0.0002292261,0.7337795,0.001199035,0.1100158,0.01925365,0.1330781],"study_design_scores_gemma":[0.00006820857,0.00004537664,0.0001536323,0.00003078814,0.00003074689,0.0001008081,0.00005339644,0.86442,0.000335989,0.1305428,0.004205943,0.00001231133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02240097,0.00181845,0.9601056,0.001641139,0.0001577765,0.0001643033,0.0007081041,0.001463995,0.01153963],"genre_scores_gemma":[0.3723999,0.002008808,0.6133183,0.0008338228,0.0002894101,0.0005764226,0.002930827,0.0005629092,0.007079619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008223356,"threshold_uncertainty_score":0.02750987,"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."}}