{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001389374,0.00197101,0.001400934,0.001597273,0.0008317207,0.001624698,0.002624228,0.001458125,0.004723556],"category_scores_gemma":[0.008124851,0.0008831548,0.001788302,0.001727227,0.001103655,0.003347409,0.002765356,0.00251988,0.001054418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002430073,"about_ca_system_score_gemma":0.00134888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003590558,"about_ca_topic_score_gemma":0.006162835,"domain_scores_codex":[0.9983693,0.0005024021,0.00006870169,0.0004722296,0.0002716808,0.0003157226],"domain_scores_gemma":[0.9968218,0.00178489,0.0004249138,0.0005206213,0.0002233889,0.0002243666],"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.0003000138,0.0002290335,0.001799772,0.0003332443,0.0001123525,0.0001752196,0.0002244695,0.7703378,0.005429296,0.09993265,0.007672857,0.1134532],"study_design_scores_gemma":[0.00003438994,0.0000613508,0.0001388351,0.0000232306,0.00001593942,0.00006361151,0.00004205282,0.9164533,0.001562381,0.08017352,0.001420264,0.00001109868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03346324,0.0002777896,0.9597023,0.0003809363,0.00005935389,0.0001132656,0.0001743447,0.0009395368,0.00488924],"genre_scores_gemma":[0.360293,0.0003460898,0.6330234,0.0003198757,0.00007367371,0.0003606653,0.0007215722,0.0004369035,0.004424718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004723556,"threshold_uncertainty_score":0.01763147,"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."}}