{"id":"W2962981543","doi":"10.4230/lipics.approx-random.2017.18","title":"Approximating Unique Games Using Low Diameter Graph Decomposition","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Minor (academic); Graph; Approximation 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":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007965812,0.0004328546,0.0004941178,0.000359611,0.001832546,0.002167427,0.00260271,0.0002061454,0.00001302708],"category_scores_gemma":[0.0001335385,0.0004125692,0.0003908812,0.0002245771,0.0002821829,0.00423251,0.001064615,0.0004424237,0.00003149657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001017289,"about_ca_system_score_gemma":0.0000702415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004766012,"about_ca_topic_score_gemma":0.00001652929,"domain_scores_codex":[0.9971889,0.00005426996,0.001056488,0.0003887395,0.0004907754,0.0008208216],"domain_scores_gemma":[0.9965937,0.000153705,0.0009553605,0.001801674,0.0002751035,0.0002204614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002937836,0.002668358,0.03784581,0.005236013,0.00140824,0.00009481721,0.04900193,0.003206762,0.003172641,0.4046797,0.004351717,0.4880402],"study_design_scores_gemma":[0.002146936,0.0001701203,0.002109928,0.0005630004,0.0000400123,0.0001439285,0.0003454193,0.956163,0.004870215,0.02888257,0.003618249,0.0009466296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1582344,0.00002328619,0.8373287,0.0002323426,0.001089746,0.0007283602,0.000119014,0.00024491,0.001999186],"genre_scores_gemma":[0.4957594,0.00001705956,0.5032184,0.000606921,0.0001673043,0.00006825552,0.00008411692,0.00003439907,0.00004420236],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9529563,"threshold_uncertainty_score":0.9998326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03184194492308685,"score_gpt":0.3105793707548013,"score_spread":0.2787374258317145,"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."}}