{"id":"W2593693579","doi":"10.48550/arxiv.1702.06969","title":"Approximating Unique Games Using Low Diameter Graph Decomposition","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Minor (academic); Graph; Alphabet; Approximation algorithm; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":false,"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"],"consensus_categories":[],"category_scores_codex":[0.0003927151,0.0004055699,0.0004455963,0.0004679267,0.0006693923,0.0005621113,0.002932796,0.0003161225,0.00001488341],"category_scores_gemma":[0.00003960922,0.0004890863,0.000402115,0.0003778137,0.0002592696,0.0008086601,0.00312315,0.0007592371,0.000016729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001688653,"about_ca_system_score_gemma":0.0001605413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002727718,"about_ca_topic_score_gemma":0.00003127587,"domain_scores_codex":[0.9976758,0.0002122835,0.0002779544,0.001248756,0.0001309045,0.0004543263],"domain_scores_gemma":[0.9968994,0.0001280777,0.0005793085,0.002047473,0.0001730135,0.0001727305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004840577,0.0005332143,0.006418744,0.0007687249,0.0005016024,0.001207704,0.001364934,0.3563083,0.0006898147,0.6147857,0.0002200714,0.01715274],"study_design_scores_gemma":[0.0002230613,0.0000201515,0.0005598239,0.0003312672,0.00004298087,0.00001396623,0.00002175869,0.7364204,0.0004167366,0.2614277,0.00004184916,0.0004803476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2207686,0.00004921753,0.7767463,0.00004531664,0.0007105162,0.0002466424,0.00001441163,0.0002584512,0.001160512],"genre_scores_gemma":[0.8964865,0.00007486394,0.103081,0.00007176919,0.0001070148,0.00000123465,0.00001658637,0.00002126642,0.0001397383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6757179,"threshold_uncertainty_score":0.9997561,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1041973609482268,"score_gpt":0.2302774897750129,"score_spread":0.1260801288267862,"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."}}